Submission #382398


Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
#include <stack>

using namespace std;

int main()
{

	int n;
	cin>>n;

	vector<unsigned long long> dist(100,0);
	unsigned long long dd=-1;
	for(int i=2;i<=n;i++){
		cout<<"? "<< 1 <<" "<<i<<endl;
		unsigned long long d;
		cin>>d;
		dist[i]=d;
		if(dd==-1 || dist[dd]<d) dd=i;
	}

	vector<unsigned long long> dist2(100,0);
	unsigned long long dd2=-1;
	for(int i=1;i<=n;i++){
		if(i==dd) continue;
		cout<<"? "<< dd <<" "<<i<<endl;
		unsigned long long d;
		cin>>d;
		dist2[i]=d;
		if(dd2==-1 || dist2[dd2]<d) dd2=i;
	}

	cout<<"? "<<dd<<" "<<dd2<<endl;
	unsigned long long res;
	cin>>res;

	cout<<"! "<<res<<endl;

	return 0;
}

Submission Info

Submission Time
Task D - 高橋くんと木の直径
User lay20114
Language C++11 (GCC 4.8.1)
Score 100
Code Size 914 Byte
Status AC
Exec Time 37 ms
Memory 1284 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 20 / 20 80 / 80
Status
AC × 1
AC × 22
AC × 42
Set Name Test Cases
Sample subtask0_0.txt
Subtask1 subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_20.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt
All subtask0_0.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_20.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 32 ms 1168 KB
subtask1_0.txt AC 34 ms 1136 KB
subtask1_1.txt AC 35 ms 1208 KB
subtask1_10.txt AC 33 ms 1212 KB
subtask1_11.txt AC 35 ms 1276 KB
subtask1_12.txt AC 34 ms 1200 KB
subtask1_13.txt AC 33 ms 1212 KB
subtask1_14.txt AC 32 ms 1224 KB
subtask1_15.txt AC 35 ms 1212 KB
subtask1_16.txt AC 34 ms 1204 KB
subtask1_17.txt AC 35 ms 1128 KB
subtask1_18.txt AC 34 ms 1204 KB
subtask1_19.txt AC 35 ms 1128 KB
subtask1_2.txt AC 34 ms 1260 KB
subtask1_20.txt AC 34 ms 1136 KB
subtask1_3.txt AC 35 ms 1284 KB
subtask1_4.txt AC 35 ms 1208 KB
subtask1_5.txt AC 35 ms 1132 KB
subtask1_6.txt AC 35 ms 1220 KB
subtask1_7.txt AC 36 ms 1204 KB
subtask1_8.txt AC 34 ms 1204 KB
subtask1_9.txt AC 35 ms 1212 KB
subtask2_0.txt AC 34 ms 1132 KB
subtask2_1.txt AC 35 ms 1136 KB
subtask2_10.txt AC 35 ms 1208 KB
subtask2_11.txt AC 35 ms 1204 KB
subtask2_12.txt AC 34 ms 1136 KB
subtask2_13.txt AC 34 ms 1124 KB
subtask2_14.txt AC 34 ms 1208 KB
subtask2_15.txt AC 35 ms 1208 KB
subtask2_16.txt AC 35 ms 1228 KB
subtask2_17.txt AC 35 ms 1212 KB
subtask2_18.txt AC 34 ms 1212 KB
subtask2_19.txt AC 34 ms 1204 KB
subtask2_2.txt AC 34 ms 1208 KB
subtask2_3.txt AC 34 ms 1268 KB
subtask2_4.txt AC 35 ms 1224 KB
subtask2_5.txt AC 35 ms 1204 KB
subtask2_6.txt AC 36 ms 1144 KB
subtask2_7.txt AC 36 ms 1200 KB
subtask2_8.txt AC 37 ms 1244 KB
subtask2_9.txt AC 37 ms 1272 KB