Submission #345475


Source Code Expand

#define REP(i,n) for(int i=0; i<(int)(n); i++)

#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

#include <set>
using namespace std;

int query(int a, int b){
  printf("? %d %d\n", a, b);
  fflush(stdout);
  return getInt();
}

void ans(int a){
  printf("! %d\n", a);
  fflush(stdout);
}

int main(){
  const int n = getInt();

  pair<int, int> mx;
  REP(i,n-1){
    const int d = query(1, i + 2);
    mx = max(mx, make_pair(d, i + 2));
  }
  const int a = mx.second;
  mx = make_pair(0, 0);
  REP(i,n){
    if(a != i + 1){
      const int d = query(a, i + 1);
      mx = max(mx, make_pair(d, i + 1));
    }
  }

  ans(mx.first);

  return 0;
}

Submission Info

Submission Time
Task D - 高橋くんと木の直径
User yukim
Language C++ (G++ 4.6.4)
Score 100
Code Size 712 Byte
Status AC
Exec Time 35 ms
Memory 1212 KB

Compile Error

./Main.cpp: In function ‘int getInt()’:
./Main.cpp:4:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

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 28 ms 1040 KB
subtask1_0.txt AC 32 ms 1136 KB
subtask1_1.txt AC 32 ms 1148 KB
subtask1_10.txt AC 34 ms 1140 KB
subtask1_11.txt AC 31 ms 1204 KB
subtask1_12.txt AC 33 ms 1080 KB
subtask1_13.txt AC 31 ms 1048 KB
subtask1_14.txt AC 30 ms 1160 KB
subtask1_15.txt AC 32 ms 1144 KB
subtask1_16.txt AC 33 ms 1076 KB
subtask1_17.txt AC 29 ms 1048 KB
subtask1_18.txt AC 31 ms 1140 KB
subtask1_19.txt AC 32 ms 1132 KB
subtask1_2.txt AC 33 ms 1152 KB
subtask1_20.txt AC 28 ms 1064 KB
subtask1_3.txt AC 31 ms 1092 KB
subtask1_4.txt AC 30 ms 1084 KB
subtask1_5.txt AC 30 ms 1212 KB
subtask1_6.txt AC 30 ms 1144 KB
subtask1_7.txt AC 31 ms 1144 KB
subtask1_8.txt AC 32 ms 1132 KB
subtask1_9.txt AC 31 ms 1096 KB
subtask2_0.txt AC 32 ms 1044 KB
subtask2_1.txt AC 31 ms 1156 KB
subtask2_10.txt AC 30 ms 1168 KB
subtask2_11.txt AC 31 ms 1124 KB
subtask2_12.txt AC 30 ms 1080 KB
subtask2_13.txt AC 30 ms 1088 KB
subtask2_14.txt AC 31 ms 1136 KB
subtask2_15.txt AC 30 ms 1036 KB
subtask2_16.txt AC 34 ms 1044 KB
subtask2_17.txt AC 30 ms 1208 KB
subtask2_18.txt AC 31 ms 1032 KB
subtask2_19.txt AC 32 ms 1076 KB
subtask2_2.txt AC 30 ms 1076 KB
subtask2_3.txt AC 31 ms 1040 KB
subtask2_4.txt AC 31 ms 1052 KB
subtask2_5.txt AC 31 ms 1116 KB
subtask2_6.txt AC 32 ms 1152 KB
subtask2_7.txt AC 35 ms 1084 KB
subtask2_8.txt AC 31 ms 1128 KB
subtask2_9.txt AC 32 ms 1132 KB