Submission #345791


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int main(){
  int N;
  cin >> N;

  int dist;
  vector<int> d, d2;
  d.push_back(0);
  rep(i,N-1){
    cout << "? " << 1 << " " << i+2 << endl;
    cin >> dist;
    d.push_back(dist);
  }
  int mx_i = -1, mx_v = -1;
  rep(i,d.size()){
    if(mx_v < d[i]){
      mx_i = i;
      mx_v = d[i];
    }
  }
  rep(i,N){
    if(i==mx_i){
      d2.push_back(0);
    }else{
      cout << "? " << mx_i+1 << " " << i+1 << endl;
      cin >> dist;
      d2.push_back(dist);
    }
  }
  sort(ALLOF(d2));
  reverse(ALLOF(d2));
  cout << "! " << d2[0] << endl;
  
  return 0;
}

Submission Info

Submission Time
Task D - 高橋くんと木の直径
User phyllo
Language C++ (G++ 4.6.4)
Score 100
Code Size 1111 Byte
Status AC
Exec Time 37 ms
Memory 1292 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 1224 KB
subtask1_0.txt AC 34 ms 1272 KB
subtask1_1.txt AC 33 ms 1220 KB
subtask1_10.txt AC 34 ms 1160 KB
subtask1_11.txt AC 32 ms 1288 KB
subtask1_12.txt AC 36 ms 1212 KB
subtask1_13.txt AC 36 ms 1292 KB
subtask1_14.txt AC 33 ms 1224 KB
subtask1_15.txt AC 32 ms 1156 KB
subtask1_16.txt AC 34 ms 1220 KB
subtask1_17.txt AC 32 ms 1136 KB
subtask1_18.txt AC 36 ms 1260 KB
subtask1_19.txt AC 34 ms 1244 KB
subtask1_2.txt AC 35 ms 1208 KB
subtask1_20.txt AC 30 ms 1064 KB
subtask1_3.txt AC 37 ms 1280 KB
subtask1_4.txt AC 34 ms 1196 KB
subtask1_5.txt AC 34 ms 1200 KB
subtask1_6.txt AC 36 ms 1164 KB
subtask1_7.txt AC 35 ms 1208 KB
subtask1_8.txt AC 34 ms 1164 KB
subtask1_9.txt AC 36 ms 1224 KB
subtask2_0.txt AC 33 ms 1220 KB
subtask2_1.txt AC 33 ms 1128 KB
subtask2_10.txt AC 34 ms 1228 KB
subtask2_11.txt AC 37 ms 1224 KB
subtask2_12.txt AC 36 ms 1212 KB
subtask2_13.txt AC 35 ms 1204 KB
subtask2_14.txt AC 36 ms 1292 KB
subtask2_15.txt AC 33 ms 1136 KB
subtask2_16.txt AC 35 ms 1256 KB
subtask2_17.txt AC 35 ms 1204 KB
subtask2_18.txt AC 34 ms 1208 KB
subtask2_19.txt AC 34 ms 1204 KB
subtask2_2.txt AC 37 ms 1212 KB
subtask2_3.txt AC 36 ms 1152 KB
subtask2_4.txt AC 36 ms 1252 KB
subtask2_5.txt AC 35 ms 1224 KB
subtask2_6.txt AC 37 ms 1220 KB
subtask2_7.txt AC 36 ms 1220 KB
subtask2_8.txt AC 37 ms 1208 KB
subtask2_9.txt AC 34 ms 1120 KB