Submission #1911697
Source Code Expand
#include <algorithm> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <ctime> #include <iostream> #include <sstream> #include <functional> #include <map> #include <string> #include <cstring> #include <vector> #include <queue> #include <stack> #include <deque> #include <set> #include <list> #include <numeric> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll,ll> P; const double PI = 3.14159265358979323846; const double EPS = 1e-12; const ll INF = 1LL<<29; const ll mod = 1e9+7; #define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i)) #define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d)) #define all(v) (v).begin(), (v).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset((m),(v),sizeof(m)) #define chmin(x,y) (x=min(x,y)) #define chmax(x,y) (x=max(x,y)) #define fst first #define snd second #define UNIQUE(x) (x).erase(unique(all(x)),(x).end()) template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;} int main(){ int n; cin>>n; ll a = 1, b = 1, mx = 0; rep(j, 2){ mx = 0; for(int i = 1; i <= n; i++){ if(i==a) continue; cout<<"? "<<a<<" "<<i<<endl; int d; cin>>d; if(d>mx){ mx = d; b = i; } } swap(a, b); } cout<<"! "<<mx<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 高橋くんと木の直径 |
User | Lepton |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1434 Byte |
Status | AC |
Exec Time | 7 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 | 3 ms | 720 KB |
subtask1_0.txt | AC | 6 ms | 724 KB |
subtask1_1.txt | AC | 6 ms | 724 KB |
subtask1_10.txt | AC | 7 ms | 720 KB |
subtask1_11.txt | AC | 6 ms | 720 KB |
subtask1_12.txt | AC | 6 ms | 724 KB |
subtask1_13.txt | AC | 6 ms | 716 KB |
subtask1_14.txt | AC | 6 ms | 720 KB |
subtask1_15.txt | AC | 6 ms | 720 KB |
subtask1_16.txt | AC | 6 ms | 720 KB |
subtask1_17.txt | AC | 7 ms | 724 KB |
subtask1_18.txt | AC | 7 ms | 724 KB |
subtask1_19.txt | AC | 6 ms | 716 KB |
subtask1_2.txt | AC | 6 ms | 720 KB |
subtask1_20.txt | AC | 3 ms | 720 KB |
subtask1_3.txt | AC | 7 ms | 720 KB |
subtask1_4.txt | AC | 6 ms | 720 KB |
subtask1_5.txt | AC | 6 ms | 724 KB |
subtask1_6.txt | AC | 6 ms | 720 KB |
subtask1_7.txt | AC | 6 ms | 724 KB |
subtask1_8.txt | AC | 6 ms | 724 KB |
subtask1_9.txt | AC | 7 ms | 716 KB |
subtask2_0.txt | AC | 6 ms | 724 KB |
subtask2_1.txt | AC | 6 ms | 720 KB |
subtask2_10.txt | AC | 6 ms | 720 KB |
subtask2_11.txt | AC | 6 ms | 720 KB |
subtask2_12.txt | AC | 6 ms | 720 KB |
subtask2_13.txt | AC | 6 ms | 724 KB |
subtask2_14.txt | AC | 6 ms | 720 KB |
subtask2_15.txt | AC | 7 ms | 720 KB |
subtask2_16.txt | AC | 7 ms | 720 KB |
subtask2_17.txt | AC | 6 ms | 724 KB |
subtask2_18.txt | AC | 6 ms | 720 KB |
subtask2_19.txt | AC | 7 ms | 716 KB |
subtask2_2.txt | AC | 6 ms | 720 KB |
subtask2_3.txt | AC | 6 ms | 720 KB |
subtask2_4.txt | AC | 6 ms | 720 KB |
subtask2_5.txt | AC | 6 ms | 716 KB |
subtask2_6.txt | AC | 6 ms | 720 KB |
subtask2_7.txt | AC | 6 ms | 724 KB |
subtask2_8.txt | AC | 6 ms | 720 KB |
subtask2_9.txt | AC | 6 ms | 720 KB |