Submission #6513762
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(ll i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef long long int ll;
typedef pair<ll,ll> Pi;
const int INF=(ll)(1LL<<30)-1;
const double INFd=100000000000.0;
const ll INFl=(ll)9223372036854775807;
const int MAX=10000;
const ll MOD=(ll)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a, b)*b;}
int dx[4]={0,-1,0,1},dy[4]={-1,0,1,0};
int mdx[8]={0,1,0,-1,1,1,-1,-1},mdy[8]={-1,0,1,0,1,-1,1,-1};
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll mod_pow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1)res=res*x%MOD;
x=x*x%MOD;
n>>=1;
}
return res;
}
ll inverse_element(ll t){
return mod_pow(t,MOD-2);
}
ll n;
int main(){
cin>>n;
int m_dist=0;
int dist=0;
int node;
for(int i=2;i<=n;i++){
cout<<"? "<<1<<" "<<i<<endl;
cin>>dist;
if(dist>=m_dist){
node=i;
m_dist=dist;
}
}
m_dist=0;
dist=0;
for(int i=1;i<=n;i++){
if(i==node)continue;
cout<<"? "<<node<<" "<<i<<endl;
cin>>dist;
m_dist=max(dist,m_dist);
}
cout<<"! "<<m_dist<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - 高橋くんと木の直径 |
User |
latter0206 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1442 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 |
7 ms |
720 KB |
subtask1_1.txt |
AC |
7 ms |
720 KB |
subtask1_10.txt |
AC |
7 ms |
720 KB |
subtask1_11.txt |
AC |
7 ms |
720 KB |
subtask1_12.txt |
AC |
7 ms |
720 KB |
subtask1_13.txt |
AC |
7 ms |
720 KB |
subtask1_14.txt |
AC |
7 ms |
720 KB |
subtask1_15.txt |
AC |
7 ms |
724 KB |
subtask1_16.txt |
AC |
7 ms |
720 KB |
subtask1_17.txt |
AC |
7 ms |
724 KB |
subtask1_18.txt |
AC |
7 ms |
716 KB |
subtask1_19.txt |
AC |
7 ms |
720 KB |
subtask1_2.txt |
AC |
7 ms |
720 KB |
subtask1_20.txt |
AC |
3 ms |
724 KB |
subtask1_3.txt |
AC |
7 ms |
720 KB |
subtask1_4.txt |
AC |
7 ms |
720 KB |
subtask1_5.txt |
AC |
7 ms |
716 KB |
subtask1_6.txt |
AC |
7 ms |
720 KB |
subtask1_7.txt |
AC |
7 ms |
724 KB |
subtask1_8.txt |
AC |
7 ms |
720 KB |
subtask1_9.txt |
AC |
7 ms |
716 KB |
subtask2_0.txt |
AC |
7 ms |
720 KB |
subtask2_1.txt |
AC |
7 ms |
720 KB |
subtask2_10.txt |
AC |
7 ms |
720 KB |
subtask2_11.txt |
AC |
7 ms |
720 KB |
subtask2_12.txt |
AC |
7 ms |
720 KB |
subtask2_13.txt |
AC |
7 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 |
716 KB |
subtask2_17.txt |
AC |
7 ms |
724 KB |
subtask2_18.txt |
AC |
7 ms |
724 KB |
subtask2_19.txt |
AC |
7 ms |
720 KB |
subtask2_2.txt |
AC |
7 ms |
720 KB |
subtask2_3.txt |
AC |
7 ms |
720 KB |
subtask2_4.txt |
AC |
7 ms |
720 KB |
subtask2_5.txt |
AC |
7 ms |
720 KB |
subtask2_6.txt |
AC |
7 ms |
720 KB |
subtask2_7.txt |
AC |
7 ms |
720 KB |
subtask2_8.txt |
AC |
7 ms |
720 KB |
subtask2_9.txt |
AC |
7 ms |
720 KB |