結果
問題 | No.1149 色塗りゲーム |
ユーザー | 👑 hitonanode |
提出日時 | 2020-08-07 22:16:55 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 115 ms / 2,000 ms |
コード長 | 3,886 bytes |
コンパイル時間 | 1,970 ms |
コンパイル使用メモリ | 197,804 KB |
実行使用メモリ | 24,396 KB |
平均クエリ数 | 19.82 |
最終ジャッジ日時 | 2023-09-24 04:34:23 |
合計ジャッジ時間 | 7,958 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
24,012 KB |
testcase_01 | AC | 43 ms
23,988 KB |
testcase_02 | AC | 42 ms
24,048 KB |
testcase_03 | AC | 43 ms
23,484 KB |
testcase_04 | AC | 41 ms
23,364 KB |
testcase_05 | AC | 42 ms
24,372 KB |
testcase_06 | AC | 42 ms
23,700 KB |
testcase_07 | AC | 41 ms
24,264 KB |
testcase_08 | AC | 43 ms
23,640 KB |
testcase_09 | AC | 43 ms
23,424 KB |
testcase_10 | AC | 45 ms
24,372 KB |
testcase_11 | AC | 42 ms
23,376 KB |
testcase_12 | AC | 43 ms
23,364 KB |
testcase_13 | AC | 44 ms
24,324 KB |
testcase_14 | AC | 44 ms
23,448 KB |
testcase_15 | AC | 45 ms
23,520 KB |
testcase_16 | AC | 44 ms
23,448 KB |
testcase_17 | AC | 44 ms
23,448 KB |
testcase_18 | AC | 44 ms
24,252 KB |
testcase_19 | AC | 46 ms
24,360 KB |
testcase_20 | AC | 46 ms
23,412 KB |
testcase_21 | AC | 46 ms
24,000 KB |
testcase_22 | AC | 47 ms
23,664 KB |
testcase_23 | AC | 45 ms
23,676 KB |
testcase_24 | AC | 47 ms
23,412 KB |
testcase_25 | AC | 48 ms
24,396 KB |
testcase_26 | AC | 46 ms
24,264 KB |
testcase_27 | AC | 46 ms
24,348 KB |
testcase_28 | AC | 49 ms
23,628 KB |
testcase_29 | AC | 48 ms
24,288 KB |
testcase_30 | AC | 86 ms
23,700 KB |
testcase_31 | AC | 81 ms
23,532 KB |
testcase_32 | AC | 83 ms
23,700 KB |
testcase_33 | AC | 85 ms
23,700 KB |
testcase_34 | AC | 90 ms
24,000 KB |
testcase_35 | AC | 83 ms
23,664 KB |
testcase_36 | AC | 91 ms
23,664 KB |
testcase_37 | AC | 94 ms
23,700 KB |
testcase_38 | AC | 88 ms
23,688 KB |
testcase_39 | AC | 93 ms
24,336 KB |
testcase_40 | AC | 100 ms
23,496 KB |
testcase_41 | AC | 97 ms
23,712 KB |
testcase_42 | AC | 95 ms
23,400 KB |
testcase_43 | AC | 95 ms
24,324 KB |
testcase_44 | AC | 104 ms
23,532 KB |
testcase_45 | AC | 103 ms
24,348 KB |
testcase_46 | AC | 104 ms
23,400 KB |
testcase_47 | AC | 111 ms
23,640 KB |
testcase_48 | AC | 111 ms
23,364 KB |
testcase_49 | AC | 115 ms
24,288 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long; using pint = pair<int, int>; using plint = pair<lint, lint>; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); } template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); } template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; } template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); } template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; } template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; } template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); } template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); } template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; } template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; } template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl; void get(int k, int x) { cout << k << ' ' << x << endl; int t; cin >> t; if (t <= 2) exit(0); } int main() { int N; cin >> N; if (N % 2) get(1, N / 2 + 1); else get(2, N / 2); while (true) { int k, x; cin >> k >> x; if (k == 1) get(k, N + 1 - x); else get(k, min(N + 1 - x, N + 1 - (x + 1))); } }