Submission #347173


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;

int main(){
	int n;
	long dist=0, point;
	long max=0;
	
	scanf(" %d", &n);
	
	for(int i=2; i<=n; ++i){
		long p;
		cout<<"? "<<1<<" "<<i<<endl;
		cin>>p;
		if(dist<p){
			dist=p;
			point=i;
		}
	}
	
	for(int i=1; i<=n; ++i){
		if(i==point) continue;
		
		long p;
		cout<<"? "<<point<<" "<<i<<endl;
		cin>>p;
		if(max<p) max=p;
	}	
	
	printf("! %ld\n", max);
}

Submission Info

Submission Time
Task D - 高橋くんと木の直径
User imulan
Language C++ (G++ 4.6.4)
Score 100
Code Size 473 Byte
Status AC
Exec Time 35 ms
Memory 1292 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

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 30 ms 1120 KB
subtask1_0.txt AC 35 ms 1208 KB
subtask1_1.txt AC 34 ms 1160 KB
subtask1_10.txt AC 33 ms 1208 KB
subtask1_11.txt AC 35 ms 1112 KB
subtask1_12.txt AC 33 ms 1196 KB
subtask1_13.txt AC 34 ms 1208 KB
subtask1_14.txt AC 32 ms 1164 KB
subtask1_15.txt AC 34 ms 1132 KB
subtask1_16.txt AC 33 ms 1212 KB
subtask1_17.txt AC 34 ms 1292 KB
subtask1_18.txt AC 34 ms 1216 KB
subtask1_19.txt AC 35 ms 1160 KB
subtask1_2.txt AC 35 ms 1220 KB
subtask1_20.txt AC 29 ms 1232 KB
subtask1_3.txt AC 34 ms 1120 KB
subtask1_4.txt AC 34 ms 1272 KB
subtask1_5.txt AC 34 ms 1208 KB
subtask1_6.txt AC 32 ms 1128 KB
subtask1_7.txt AC 32 ms 1220 KB
subtask1_8.txt AC 34 ms 1264 KB
subtask1_9.txt AC 32 ms 1208 KB
subtask2_0.txt AC 32 ms 1212 KB
subtask2_1.txt AC 32 ms 1132 KB
subtask2_10.txt AC 32 ms 1216 KB
subtask2_11.txt AC 33 ms 1204 KB
subtask2_12.txt AC 34 ms 1276 KB
subtask2_13.txt AC 35 ms 1208 KB
subtask2_14.txt AC 34 ms 1132 KB
subtask2_15.txt AC 34 ms 1168 KB
subtask2_16.txt AC 35 ms 1208 KB
subtask2_17.txt AC 34 ms 1244 KB
subtask2_18.txt AC 35 ms 1216 KB
subtask2_19.txt AC 34 ms 1248 KB
subtask2_2.txt AC 33 ms 1204 KB
subtask2_3.txt AC 33 ms 1256 KB
subtask2_4.txt AC 34 ms 1212 KB
subtask2_5.txt AC 34 ms 1208 KB
subtask2_6.txt AC 32 ms 1220 KB
subtask2_7.txt AC 33 ms 1272 KB
subtask2_8.txt AC 32 ms 1216 KB
subtask2_9.txt AC 33 ms 1224 KB