結果
問題 | No.2753 鳩の巣原理 |
ユーザー | soto800 |
提出日時 | 2024-05-10 22:05:23 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,612 bytes |
コンパイル時間 | 2,217 ms |
コンパイル使用メモリ | 202,452 KB |
実行使用メモリ | 25,836 KB |
平均クエリ数 | 7.33 |
最終ジャッジ日時 | 2024-05-10 22:05:32 |
合計ジャッジ時間 | 6,937 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 22 ms
25,196 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
ソースコード
#include <bits/stdc++.h> //#include <atcoder/all> using namespace std; #define lli long long int #define REP(i, s, n) for (lli i = s; i < n; i++) #define INF (1LL << 62) #define mp(a, b) make_pair(a, b) #define SORT(V) sort(V.begin(), V.end()) #define PI (3.141592653589794) #define TO_STRING(VariableName) #VariableName #define LOG1(x) \ if (DEBUG) \ cout << TO_STRING(x) << "=" << x << " " << endl; #define LOG2(x, y) \ if (DEBUG) \ cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl; #define LOG3(x, y, z) \ if (DEBUG) \ cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \ << TO_STRING(z) << "=" << z << endl; #define LOG4(w, x, y, z) \ if (DEBUG) \ cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \ << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z \ << endl; #define LOG5(w, x, y, z, a) \ if (DEBUG) \ cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \ << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \ << TO_STRING(a) << "=" << a << endl; #define LOG6(w, x, y, z, a, b) \ if (DEBUG) \ cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \ << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \ << TO_STRING(a) << "=" << a << " " << TO_STRING(b) << "=" << b \ << endl; #define overload6(a, b, c, d, e, f, g, ...) g #define LOG(...) \ overload6(__VA_ARGS__, LOG6, LOG5, LOG4, LOG3, LOG2, LOG1)(__VA_ARGS__) template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } mt19937 engine; std::chrono::system_clock::time_point start, endTime; #define DEBUG 0 lli query(lli x) { cout << "? " << x << endl; lli res; cin >> res; return res; } void solve() { // write your code here lli N; cin >> N; lli small = 1; lli smallNum = 0; lli large = N; lli largeNum = N - 1; while (small + 1 < large) { lli middle = (small + large) / 2; auto ret = query(middle); lli smallDiff = ret - smallNum; lli largeDiff = largeNum - ret; if (smallDiff > largeDiff) { small = middle; smallNum = ret; } else { large = middle; largeNum = ret; } } cout << "Yes " << small << " " << large << endl; } // Generated by 2.13.0 https://github.com/kyuridenamida/atcoder-tools (tips: // You use the default template now. You can remove this line by using your // custom template) int main() { // Failed to predict input format lli N = 1; // cin >> N; while (N--) solve(); return 0; }