結果
問題 | No.2165 Let's Play Nim! |
ユーザー | null |
提出日時 | 2022-08-12 23:28:32 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 210 ms / 2,000 ms |
コード長 | 4,485 bytes |
コンパイル時間 | 7,401 ms |
コンパイル使用メモリ | 457,024 KB |
実行使用メモリ | 25,580 KB |
平均クエリ数 | 880.41 |
最終ジャッジ日時 | 2024-11-14 15:11:38 |
合計ジャッジ時間 | 23,437 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 27 ms
25,196 KB |
testcase_01 | AC | 143 ms
25,196 KB |
testcase_02 | AC | 151 ms
25,580 KB |
testcase_03 | AC | 98 ms
25,196 KB |
testcase_04 | AC | 26 ms
25,324 KB |
testcase_05 | AC | 31 ms
24,812 KB |
testcase_06 | AC | 31 ms
25,196 KB |
testcase_07 | AC | 31 ms
24,812 KB |
testcase_08 | AC | 104 ms
24,824 KB |
testcase_09 | AC | 28 ms
25,208 KB |
testcase_10 | AC | 35 ms
24,952 KB |
testcase_11 | AC | 155 ms
24,812 KB |
testcase_12 | AC | 134 ms
25,580 KB |
testcase_13 | AC | 27 ms
24,940 KB |
testcase_14 | AC | 30 ms
25,196 KB |
testcase_15 | AC | 27 ms
24,940 KB |
testcase_16 | AC | 126 ms
24,556 KB |
testcase_17 | AC | 67 ms
24,940 KB |
testcase_18 | AC | 210 ms
25,196 KB |
testcase_19 | AC | 26 ms
24,824 KB |
testcase_20 | AC | 30 ms
25,208 KB |
testcase_21 | AC | 54 ms
24,836 KB |
testcase_22 | AC | 46 ms
24,964 KB |
testcase_23 | AC | 43 ms
24,964 KB |
testcase_24 | AC | 40 ms
24,964 KB |
testcase_25 | AC | 84 ms
25,220 KB |
testcase_26 | AC | 151 ms
25,196 KB |
testcase_27 | AC | 47 ms
24,556 KB |
testcase_28 | AC | 72 ms
25,196 KB |
testcase_29 | AC | 25 ms
25,196 KB |
testcase_30 | AC | 24 ms
25,196 KB |
testcase_31 | AC | 24 ms
24,940 KB |
testcase_32 | AC | 108 ms
25,196 KB |
evil_2_big_1.txt | AC | 1,771 ms
25,196 KB |
evil_2_big_2.txt | AC | 1,941 ms
25,916 KB |
evil_2_big_3.txt | AC | 1,786 ms
25,580 KB |
evil_big_1.txt | AC | 1,909 ms
25,560 KB |
evil_big_2.txt | AC | 1,948 ms
25,780 KB |
evil_big_3.txt | AC | 1,949 ms
25,936 KB |
ソースコード
/* このコード、と~おれ! Be accepted! ∧_∧ (。・ω・。)つ━☆・*。 ⊂ ノ ・゜+. しーJ °。+ *´¨) .· ´¸.·*´¨) ¸.·*¨) (¸.·´ (¸.·'* ☆ */ #include <cstdio> #include <algorithm> #include <string> #include <cmath> #include <cstring> #include <vector> #include <numeric> #include <iostream> #include <random> #include <map> #include <unordered_map> #include <queue> #include <regex> #include <functional> #include <complex> #include <list> #include <cassert> #include <iomanip> #include <set> #include <stack> #include <bitset> #include <array> #include <chrono> //#pragma GCC target("arch=skylake-avx512") //#pragma GCC target("avx2") //#pragma GCC optimize("O3") //#pragma GCC optimize("Ofast") //#pragma GCC target("sse4") //#pragma GCC optimize("unroll-loops") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define repeat(i, n, m) for(int i = n; i < (m); ++i) #define rep(i, n) for(int i = 0; i < (n); ++i) #define printynl(a) printf(a ? "yes\n" : "no\n") #define printyn(a) printf(a ? "Yes\n" : "No\n") #define printYN(a) printf(a ? "YES\n" : "NO\n") #define printim(a) printf(a ? "possible\n" : "imposible\n") #define printdb(a) printf("%.50lf\n", a) #define printLdb(a) printf("%.50Lf\n", a) #define printdbd(a) printf("%.16lf\n", a) #define prints(s) printf("%s\n", s.c_str()) #define all(x) (x).begin(), (x).end() #define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI) #define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L) #define Please return #define AC 0 #define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d)) using ll = long long; using ull = unsigned long long; constexpr int INF = 1073741823; constexpr int MINF = -1073741823; constexpr ll LINF = ll(4661686018427387903); constexpr ll MOD = 1e9 + 7; constexpr ll mod = 998244353; constexpr long double eps = 1e-14; const long double PI = acosl(-1.0L); using namespace std; void scans(string& str) { char c; str = ""; scanf("%c", &c); if (c == '\n')scanf("%c", &c); while (c != '\n' && c != -1 && c != ' ') { str += c; scanf("%c", &c); } } void scanc(char& str) { char c; scanf("%c", &c); if (c == -1)return; while (c == '\n') { scanf("%c", &c); } str = c; } double acot(double x) { return PI / 2 - atan(x); } ll LSB(ll n) { return (n & (-n)); } template<typename T> inline T chmin(T& a, const T& b) { if (a > b)a = b; return a; } template<typename T> inline T chmax(T& a, const T& b) { if (a < b)a = b; return a; } //cpp_int #if __has_include(<boost/multiprecision/cpp_int.hpp>) #include <boost/multiprecision/cpp_int.hpp> #include <boost/multiprecision/cpp_dec_float.hpp> using namespace boost::multiprecision; #else using cpp_int = ll; #endif //atcoder library #if __has_include(<atcoder/all>) #include <atcoder/all> //using namespace atcoder; #endif /* random_device seed_gen; mt19937 engine(seed_gen()); uniform_int_distribution dist(1, 100); */ /*----------------------------------------------------------------------------------*/ int main() { int n; scanf("%d", &n); vector<int> a(n); set<pair<int, int>> st; multiset<int> b[30]; int x = 0, ret = 0; rep(i, n) { scanf("%d", &a[i]); x ^= a[i]; st.insert({ a[i], i }); rep(j, 30)if (a[i] & (1 << j))b[j].insert(a[i]); } if (x == 0) { puts("0"); fflush(stdout); } else { puts("1"); fflush(stdout); } bool t = (x == 0); while (ret != -1) { if (t) { int num, idx; scanf("%d%d", &idx, &num); --idx; st.erase({ a[idx], idx }); rep(j, 30)if((1 << j) & a[idx])b[j].erase(b[j].lower_bound(a[idx])); if (a[idx] - num != 0) { st.insert({ a[idx] - num, idx }); rep(j, 30)if ((a[idx] - num) & (1 << j))b[j].insert(a[idx] - num); } x ^= a[idx]; a[idx] -= num; x ^= a[idx]; scanf("%d", &ret); if (ret)return 0; } else { int num = 0, idx = 0; for (int j = 29; j >= 0; --j) { if ((x & (1 << j)) and not b[j].empty()) { auto ite = st.lower_bound({ *b[j].begin(), 0 }); num = ite->first; idx = ite->second; break; } } st.erase({ num, idx }); rep(j, 30)if((1 << j) & num)b[j].erase(b[j].lower_bound(num)); x ^= num; st.insert({ x, idx }); rep(j, 30)if (x & (1 << j))b[j].insert(x); printf("%d %d\n", idx + 1, num - x); fflush(stdout); scanf("%d", &ret); if (ret)return 0; a[idx] = x; x = 0; } t ^= 1; } Please AC; }