Submission #345635
Source Code Expand
#ifndef KOMAKI_LOCAL
#define NDEBUG
#endif
#include <bits/stdc++.h>
#include <sys/time.h>
#include <unistd.h>
using namespace std;
#define i64 int64_t
#define rep(i, n) for(i64 i = 0; i < ((i64)(n)); ++i)
#define sz(v) ((i64)((v).size()))
#define bit(n) (((i64)1)<<((i64)(n)))
#define all(v) (v).begin(), (v).end()
std::string dbgDelim(int &i){ return (i++ == 0 ? "" : ", "); }
#define dbgEmbrace(exp) { int i = 0; os << "{"; { exp; } os << "}"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> v);
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> v);
template <class T> std::ostream& operator<<(std::ostream &os, std::queue<T> q);
template <class T> std::ostream& operator<<(std::ostream &os, std::priority_queue<T> q);
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::pair<T, K> p);
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> mp);
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::unordered_map<T, K> mp);
template <int INDEX, class TUPLE> void dbgDeploy(std::ostream &os, TUPLE tuple){}
template <int INDEX, class TUPLE, class H, class ...Ts> void dbgDeploy(std::ostream &os, TUPLE t)
{ os << (INDEX == 0 ? "" : ", ") << get<INDEX>(t); dbgDeploy<INDEX + 1, TUPLE, Ts...>(os, t); }
template <class T, class K> void dbgDeploy(std::ostream &os, std::pair<T, K> p, std::string delim)
{ os << "(" << p.first << delim << p.second << ")"; }
template <class ...Ts> std::ostream& operator<<(std::ostream &os, std::tuple<Ts...> t)
{ os << "("; dbgDeploy<0, std::tuple<Ts...>, Ts...>(os, t); os << ")"; return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::pair<T, K> p)
{ dbgDeploy(os, p, ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> v)
{ dbgEmbrace( for(T t: v){ os << dbgDelim(i) << t; }); }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> s)
{ dbgEmbrace( for(T t: s){ os << dbgDelim(i) << t; }); }
template <class T> std::ostream& operator<<(std::ostream &os, std::queue<T> q)
{ dbgEmbrace( for(; q.size(); q.pop()){ os << dbgDelim(i) << q.front(); }); }
template <class T> std::ostream& operator<<(std::ostream &os, std::priority_queue<T> q)
{ dbgEmbrace( for(; q.size(); q.pop()){ os << dbgDelim(i) << q.top(); }); }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> mp)
{ dbgEmbrace( for(auto p: mp){ os << dbgDelim(i); dbgDeploy(os, p, "->"); }); }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::unordered_map<T, K> mp)
{ dbgEmbrace( for(auto p: mp){ os << dbgDelim(i); dbgDeploy(os, p, "->"); }); }
#define DBG_OUT std::cerr
#define DBG_OVERLOAD(_1, _2, _3, _4, _5, _6, macro_name, ...) macro_name
#define DBG_LINE() { char s[99]; sprintf(s, "line:%3d | ", __LINE__); DBG_OUT << s; }
#define DBG_OUTPUT(v) { DBG_OUT << (#v) << "=" << (v); }
#define DBG1(v, ...) { DBG_OUTPUT(v); }
#define DBG2(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG1(__VA_ARGS__); }
#define DBG3(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG2(__VA_ARGS__); }
#define DBG4(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG3(__VA_ARGS__); }
#define DBG5(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG4(__VA_ARGS__); }
#define DBG6(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG5(__VA_ARGS__); }
#define DEBUG0() { DBG_LINE(); DBG_OUT << std::endl; }
#define DEBUG(...) \
{ \
DBG_LINE(); \
DBG_OVERLOAD(__VA_ARGS__, DBG6, DBG5, DBG4, DBG3, DBG2, DBG1)(__VA_ARGS__); \
DBG_OUT << std::endl; \
}
i64 ask(i64 a, i64 b)
{
i64 d;
cout << "? " << a << " " << b << endl;
cin >> d;
return d;
}
void ans(i64 d)
{
cout << "! " << d << endl;
}
int main()
{
i64 n;
cin >> n;
i64 a = 1, b = 2;
i64 ab = ask(a, b);
for(i64 c = 3; c <= n; ++c){
i64 ac = ask(a, c);
i64 bc = ask(b, c);
i64 maxi = max(ab, max(ac, bc));
if(ab == maxi){
}else if(ac == maxi){ b = c;
}else if(bc == maxi){ a = c;
}else{ assert(false); }
ab = maxi;
}
ans(ab);
}
Submission Info
Submission Time |
|
Task |
D - 高橋くんと木の直径 |
User |
Komaki |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
4499 Byte |
Status |
AC |
Exec Time |
39 ms |
Memory |
1280 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 |
33 ms |
1132 KB |
subtask1_0.txt |
AC |
37 ms |
1268 KB |
subtask1_1.txt |
AC |
36 ms |
1204 KB |
subtask1_10.txt |
AC |
36 ms |
1208 KB |
subtask1_11.txt |
AC |
38 ms |
1272 KB |
subtask1_12.txt |
AC |
36 ms |
1212 KB |
subtask1_13.txt |
AC |
39 ms |
1128 KB |
subtask1_14.txt |
AC |
36 ms |
1124 KB |
subtask1_15.txt |
AC |
36 ms |
1196 KB |
subtask1_16.txt |
AC |
36 ms |
1128 KB |
subtask1_17.txt |
AC |
38 ms |
1204 KB |
subtask1_18.txt |
AC |
35 ms |
1208 KB |
subtask1_19.txt |
AC |
37 ms |
1156 KB |
subtask1_2.txt |
AC |
37 ms |
1256 KB |
subtask1_20.txt |
AC |
33 ms |
1132 KB |
subtask1_3.txt |
AC |
37 ms |
1216 KB |
subtask1_4.txt |
AC |
38 ms |
1224 KB |
subtask1_5.txt |
AC |
35 ms |
1216 KB |
subtask1_6.txt |
AC |
39 ms |
1208 KB |
subtask1_7.txt |
AC |
38 ms |
1280 KB |
subtask1_8.txt |
AC |
34 ms |
1216 KB |
subtask1_9.txt |
AC |
35 ms |
1212 KB |
subtask2_0.txt |
AC |
35 ms |
1216 KB |
subtask2_1.txt |
AC |
35 ms |
1216 KB |
subtask2_10.txt |
AC |
34 ms |
1208 KB |
subtask2_11.txt |
AC |
33 ms |
1212 KB |
subtask2_12.txt |
AC |
34 ms |
1124 KB |
subtask2_13.txt |
AC |
33 ms |
1180 KB |
subtask2_14.txt |
AC |
38 ms |
1208 KB |
subtask2_15.txt |
AC |
37 ms |
1128 KB |
subtask2_16.txt |
AC |
36 ms |
1172 KB |
subtask2_17.txt |
AC |
37 ms |
1260 KB |
subtask2_18.txt |
AC |
37 ms |
1280 KB |
subtask2_19.txt |
AC |
37 ms |
1256 KB |
subtask2_2.txt |
AC |
38 ms |
1212 KB |
subtask2_3.txt |
AC |
37 ms |
1220 KB |
subtask2_4.txt |
AC |
38 ms |
1272 KB |
subtask2_5.txt |
AC |
37 ms |
1224 KB |
subtask2_6.txt |
AC |
37 ms |
1264 KB |
subtask2_7.txt |
AC |
39 ms |
1248 KB |
subtask2_8.txt |
AC |
34 ms |
1136 KB |
subtask2_9.txt |
AC |
37 ms |
1220 KB |