Submission #346565


Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
#define rep(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
int main(void){
	int N;
	cin >> N;
	int result = 0,a,b;
	int A = 1, B = 2;
	cout << "? " << 1 << " " << 2 << endl;
	cin >> a;
	result = a;
	rep(i, 3, N + 1){
		cout << "? " << A << " " << i << endl;
		cin >> a;
		cout << "? " << B << " " << i << endl;
		cin >> b;
		if (result < a){
			if (result<b){
				if (a>b)B = i;
				else A = i;
			}
			else
				B = i;
		}
		else if (result < b)
				A = i;
		result = max(max(result, a),b);
	}
	cout << "! " << result << endl;

	return(0);
}

Submission Info

Submission Time
Task D - 高橋くんと木の直径
User btk15049
Language C++11 (GCC 4.8.1)
Score 100
Code Size 680 Byte
Status AC
Exec Time 39 ms
Memory 1288 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 30 ms 1072 KB
subtask1_0.txt AC 35 ms 1228 KB
subtask1_1.txt AC 32 ms 1216 KB
subtask1_10.txt AC 35 ms 1228 KB
subtask1_11.txt AC 35 ms 1228 KB
subtask1_12.txt AC 34 ms 1284 KB
subtask1_13.txt AC 34 ms 1224 KB
subtask1_14.txt AC 33 ms 1288 KB
subtask1_15.txt AC 34 ms 1124 KB
subtask1_16.txt AC 35 ms 1232 KB
subtask1_17.txt AC 36 ms 1276 KB
subtask1_18.txt AC 39 ms 1228 KB
subtask1_19.txt AC 33 ms 1224 KB
subtask1_2.txt AC 35 ms 1236 KB
subtask1_20.txt AC 28 ms 1128 KB
subtask1_3.txt AC 35 ms 1280 KB
subtask1_4.txt AC 36 ms 1208 KB
subtask1_5.txt AC 32 ms 1132 KB
subtask1_6.txt AC 35 ms 1216 KB
subtask1_7.txt AC 32 ms 1216 KB
subtask1_8.txt AC 32 ms 1136 KB
subtask1_9.txt AC 32 ms 1208 KB
subtask2_0.txt AC 35 ms 1208 KB
subtask2_1.txt AC 32 ms 1228 KB
subtask2_10.txt AC 35 ms 1140 KB
subtask2_11.txt AC 35 ms 1232 KB
subtask2_12.txt AC 32 ms 1200 KB
subtask2_13.txt AC 36 ms 1256 KB
subtask2_14.txt AC 34 ms 1280 KB
subtask2_15.txt AC 37 ms 1216 KB
subtask2_16.txt AC 31 ms 1212 KB
subtask2_17.txt AC 32 ms 1236 KB
subtask2_18.txt AC 33 ms 1208 KB
subtask2_19.txt AC 32 ms 1124 KB
subtask2_2.txt AC 34 ms 1224 KB
subtask2_3.txt AC 31 ms 1224 KB
subtask2_4.txt AC 32 ms 1208 KB
subtask2_5.txt AC 33 ms 1224 KB
subtask2_6.txt AC 32 ms 1128 KB
subtask2_7.txt AC 34 ms 1212 KB
subtask2_8.txt AC 33 ms 1204 KB
subtask2_9.txt AC 33 ms 1124 KB