Submission #346193
Source Code Expand
#include <algorithm> #include <cstdio> #include <iostream> using namespace std; int main(){ int n; int a=1, b=2; long dist[51][51]; long max=0; scanf(" %d", &n); for(int i=0; i<(n-1)*n/2; ++i){ cout<<"? "<<a<<" "<<b<<endl; cin>>dist[a][b]; if(max<dist[a][b]) max=dist[a][b]; b++; if(b==n+1){ a++; b=a+1; } } printf("! %ld\n", max); }
Submission Info
Submission Time | |
---|---|
Task | D - 高橋くんと木の直径 |
User | imulan |
Language | C++ (G++ 4.6.4) |
Score | 20 |
Code Size | 389 Byte |
Status | WA |
Exec Time | 91 ms |
Memory | 1296 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:12:18: 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 | 0 / 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 | 30 ms | 1264 KB |
subtask1_0.txt | AC | 90 ms | 1228 KB |
subtask1_1.txt | AC | 81 ms | 1212 KB |
subtask1_10.txt | AC | 84 ms | 1284 KB |
subtask1_11.txt | AC | 85 ms | 1296 KB |
subtask1_12.txt | AC | 82 ms | 1220 KB |
subtask1_13.txt | AC | 87 ms | 1272 KB |
subtask1_14.txt | AC | 84 ms | 1224 KB |
subtask1_15.txt | AC | 81 ms | 1208 KB |
subtask1_16.txt | AC | 81 ms | 1204 KB |
subtask1_17.txt | AC | 83 ms | 1260 KB |
subtask1_18.txt | AC | 85 ms | 1224 KB |
subtask1_19.txt | AC | 80 ms | 1208 KB |
subtask1_2.txt | AC | 82 ms | 1232 KB |
subtask1_20.txt | AC | 30 ms | 1124 KB |
subtask1_3.txt | AC | 78 ms | 1220 KB |
subtask1_4.txt | AC | 83 ms | 1212 KB |
subtask1_5.txt | AC | 87 ms | 1212 KB |
subtask1_6.txt | AC | 84 ms | 1200 KB |
subtask1_7.txt | AC | 84 ms | 1224 KB |
subtask1_8.txt | AC | 85 ms | 1204 KB |
subtask1_9.txt | AC | 91 ms | 1216 KB |
subtask2_0.txt | WA | 36 ms | 1124 KB |
subtask2_1.txt | WA | 37 ms | 1136 KB |
subtask2_10.txt | WA | 37 ms | 1208 KB |
subtask2_11.txt | WA | 37 ms | 1264 KB |
subtask2_12.txt | WA | 35 ms | 1164 KB |
subtask2_13.txt | WA | 40 ms | 1228 KB |
subtask2_14.txt | WA | 39 ms | 1228 KB |
subtask2_15.txt | WA | 35 ms | 1204 KB |
subtask2_16.txt | WA | 37 ms | 1172 KB |
subtask2_17.txt | WA | 35 ms | 1228 KB |
subtask2_18.txt | WA | 37 ms | 1268 KB |
subtask2_19.txt | WA | 41 ms | 1232 KB |
subtask2_2.txt | WA | 36 ms | 1224 KB |
subtask2_3.txt | WA | 37 ms | 1208 KB |
subtask2_4.txt | WA | 37 ms | 1164 KB |
subtask2_5.txt | WA | 37 ms | 1276 KB |
subtask2_6.txt | WA | 34 ms | 1124 KB |
subtask2_7.txt | WA | 37 ms | 1124 KB |
subtask2_8.txt | WA | 37 ms | 1276 KB |
subtask2_9.txt | WA | 39 ms | 1204 KB |