Submission #5319232
Source Code Expand
/* _ _ _ _ _ _ _ _ _ _ _ / /\ / /\ / /\ / /\ / /\ /\ \ /\_\/\_\ _ /\ \ /\ \ _ /\ \ / / \ / / \ / / \ / / / / / / \ \ \ / / / / //\_\ \ \ \ / \ \ /\_\ / \ \ / / /\ \__ / / /\ \ / / /\ \__ / /_/ / / / /\ \_\ /\ \/ \ \/ / / /\ \_\ / /\ \ \_/ / // /\ \_\ / / /\ \___\ / / /\ \ \ / / /\ \___\ / /\ \__/ / / / /\/_/ / \____\__/ / / /\/_/ / / /\ \___/ // / /\/_/ \ \ \ \/___// / / \ \ \ \ \ \ \/___// /\ \___\/ / / / / / /\/________/ / / / / / / \/____// / / ______ \ \ \ / / /___/ /\ \ \ \ \ / / /\/___/ / / / / / / /\/_// / / / / / / / / / / // / / /\_____\ _ \ \ \ / / /_____/ /\ \ _ \ \ \ / / / / / / / / / / / / / / / / / / / / / / / // / / \/____ / /_/\__/ / / / /_________/\ \ \ /_/\__/ / / / / / / / /___/ / /__ / / / / / /___/ / /__ / / / / / // / /_____/ / / \ \/___/ / / / /_ __\ \_\\ \/___/ / / / / / / //\__\/_/___\\/_/ / / //\__\/_/___\/ / / / / // / /______\/ / \_____\/ \_\___\ /____/_/ \_____\/ \/_/ \/_/ \/_________/ \/_/ \/_________/\/_/ \/_/ \/___________/ */ #include<bits/stdc++.h> using namespace std; #define ALL(obj) (obj).begin(), (obj).end() #define REP(i, n) for(int i = 0;i < (n);++i) // #define endl '\n' #define pb emplace_back #define mkp make_pair #define p_q priority_queue #define INF 1000000000 #define PI 3.1415926 #define coutdb cout << fixed << setprecision(10) const int dx[]={1,0,-1,0}, dy[]={0,-1,0,1}; const int dx_8[]={1,1,0,-1,-1,-1,0,1}, dy_8[]={0,-1,-1,-1,0,1,1,1}; const long long MOD = 1e9+7; // typedef long long ll; #define int long long template <typename T> inline T GCD(T a,T b){T c;while(b!=0){c=a%b;a=b;b=c;}return a;} template <typename T> inline T LCM(T a,T b){T c=GCD(a,b);a/=c;return a*b;} template <typename T> inline T nCr(T a,T b){T i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;} template <typename T> inline T nHr(T a,T b){return nCr(a+b-1,b);} typedef pair<int, int> P; signed main(void){ cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; int mx = -1, mxnode; for(int i = 2; i <= N; i++){ int d; cout << "? " << 1 << ' ' << i << endl; cin >> d; if(mx < d){ mx = d; mxnode = i; } } mx = -1; for(int i = 1; i <= N; i++){ if(i == mxnode) continue; int d; cout << "? " << mxnode << ' ' << i << endl; cin >> d; mx = max(mx, d); } cout << "! " << mx << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 高橋くんと木の直径 |
User | Sashiming |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2938 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 724 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 20 / 20 | 80 / 80 | ||||||
Status |
|
|
|
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 | 5 ms | 720 KB |
subtask1_0.txt | AC | 10 ms | 724 KB |
subtask1_1.txt | AC | 8 ms | 720 KB |
subtask1_10.txt | AC | 7 ms | 720 KB |
subtask1_11.txt | AC | 7 ms | 716 KB |
subtask1_12.txt | AC | 7 ms | 720 KB |
subtask1_13.txt | AC | 7 ms | 724 KB |
subtask1_14.txt | AC | 8 ms | 720 KB |
subtask1_15.txt | AC | 8 ms | 720 KB |
subtask1_16.txt | AC | 8 ms | 716 KB |
subtask1_17.txt | AC | 7 ms | 720 KB |
subtask1_18.txt | AC | 7 ms | 720 KB |
subtask1_19.txt | AC | 8 ms | 720 KB |
subtask1_2.txt | AC | 8 ms | 720 KB |
subtask1_20.txt | AC | 3 ms | 720 KB |
subtask1_3.txt | AC | 7 ms | 716 KB |
subtask1_4.txt | AC | 7 ms | 724 KB |
subtask1_5.txt | AC | 7 ms | 720 KB |
subtask1_6.txt | AC | 8 ms | 716 KB |
subtask1_7.txt | AC | 7 ms | 724 KB |
subtask1_8.txt | AC | 7 ms | 724 KB |
subtask1_9.txt | AC | 7 ms | 724 KB |
subtask2_0.txt | AC | 7 ms | 720 KB |
subtask2_1.txt | AC | 8 ms | 720 KB |
subtask2_10.txt | AC | 8 ms | 720 KB |
subtask2_11.txt | AC | 7 ms | 724 KB |
subtask2_12.txt | AC | 7 ms | 724 KB |
subtask2_13.txt | AC | 8 ms | 724 KB |
subtask2_14.txt | AC | 7 ms | 724 KB |
subtask2_15.txt | AC | 7 ms | 724 KB |
subtask2_16.txt | AC | 7 ms | 724 KB |
subtask2_17.txt | AC | 8 ms | 720 KB |
subtask2_18.txt | AC | 7 ms | 724 KB |
subtask2_19.txt | AC | 7 ms | 720 KB |
subtask2_2.txt | AC | 8 ms | 720 KB |
subtask2_3.txt | AC | 7 ms | 720 KB |
subtask2_4.txt | AC | 7 ms | 720 KB |
subtask2_5.txt | AC | 8 ms | 720 KB |
subtask2_6.txt | AC | 7 ms | 720 KB |
subtask2_7.txt | AC | 8 ms | 724 KB |
subtask2_8.txt | AC | 7 ms | 720 KB |
subtask2_9.txt | AC | 7 ms | 716 KB |