Submission #6514297


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int n,maxn=-1,node,a;
int main()
{
	scanf("%d",&n);
	for (int i=2; i<=n; i++)
	{
		printf("? 1 %d",i);
		fflush(stdout);
		scanf("%d",&a);
		if (a>maxn)
		{
			maxn=a;
			node=i;
		}
	}
	maxn=-1;
	for (int i=1; i<=n; i++)
		if (i!=node)
		{
			printf("? %d %d",node,i);
			fflush(stdout);
			scanf("%d",&a);
			maxn=max(maxn,a);
		}
	printf("%d",maxn);
	return 0;
}

Submission Info

Submission Time
Task D - 高橋くんと木の直径
User luogu_bot1
Language C++ (GCC 5.4.1)
Score 0
Code Size 438 Byte
Status TLE
Exec Time 2103 ms
Memory 724 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:6:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:11:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a);
                 ^
./Main.cpp:24:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&a);
                  ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 20 0 / 80
Status
TLE × 1
TLE × 22
TLE × 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 TLE 2103 ms 716 KB
subtask1_0.txt TLE 2103 ms 720 KB
subtask1_1.txt TLE 2103 ms 724 KB
subtask1_10.txt TLE 2103 ms 720 KB
subtask1_11.txt TLE 2103 ms 720 KB
subtask1_12.txt TLE 2103 ms 724 KB
subtask1_13.txt TLE 2103 ms 724 KB
subtask1_14.txt TLE 2103 ms 724 KB
subtask1_15.txt TLE 2103 ms 724 KB
subtask1_16.txt TLE 2103 ms 720 KB
subtask1_17.txt TLE 2103 ms 720 KB
subtask1_18.txt TLE 2103 ms 720 KB
subtask1_19.txt TLE 2103 ms 724 KB
subtask1_2.txt TLE 2103 ms 724 KB
subtask1_20.txt TLE 2103 ms 716 KB
subtask1_3.txt TLE 2103 ms 724 KB
subtask1_4.txt TLE 2103 ms 716 KB
subtask1_5.txt TLE 2103 ms 720 KB
subtask1_6.txt TLE 2103 ms 724 KB
subtask1_7.txt TLE 2103 ms 724 KB
subtask1_8.txt TLE 2103 ms 720 KB
subtask1_9.txt TLE 2103 ms 720 KB
subtask2_0.txt TLE 2103 ms 720 KB
subtask2_1.txt TLE 2103 ms 720 KB
subtask2_10.txt TLE 2103 ms 720 KB
subtask2_11.txt TLE 2103 ms 724 KB
subtask2_12.txt TLE 2103 ms 720 KB
subtask2_13.txt TLE 2103 ms 720 KB
subtask2_14.txt TLE 2103 ms 724 KB
subtask2_15.txt TLE 2103 ms 724 KB
subtask2_16.txt TLE 2103 ms 724 KB
subtask2_17.txt TLE 2103 ms 724 KB
subtask2_18.txt TLE 2103 ms 720 KB
subtask2_19.txt TLE 2103 ms 724 KB
subtask2_2.txt TLE 2103 ms 724 KB
subtask2_3.txt TLE 2103 ms 720 KB
subtask2_4.txt TLE 2103 ms 720 KB
subtask2_5.txt TLE 2103 ms 720 KB
subtask2_6.txt TLE 2103 ms 720 KB
subtask2_7.txt TLE 2103 ms 720 KB
subtask2_8.txt TLE 2103 ms 720 KB
subtask2_9.txt TLE 2103 ms 724 KB