結果
問題 | No.361 門松ゲーム2 |
ユーザー | tancahn2380 |
提出日時 | 2018-03-31 23:12:29 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 131 ms / 2,000 ms |
コード長 | 1,840 bytes |
コンパイル時間 | 2,245 ms |
コンパイル使用メモリ | 107,220 KB |
実行使用メモリ | 4,380 KB |
最終ジャッジ日時 | 2023-09-08 10:23:41 |
合計ジャッジ時間 | 2,425 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,380 KB |
testcase_14 | AC | 68 ms
4,376 KB |
testcase_15 | AC | 3 ms
4,380 KB |
testcase_16 | AC | 43 ms
4,380 KB |
testcase_17 | AC | 14 ms
4,376 KB |
testcase_18 | AC | 9 ms
4,380 KB |
testcase_19 | AC | 11 ms
4,376 KB |
testcase_20 | AC | 3 ms
4,376 KB |
testcase_21 | AC | 46 ms
4,380 KB |
testcase_22 | AC | 131 ms
4,376 KB |
testcase_23 | AC | 5 ms
4,376 KB |
testcase_24 | AC | 5 ms
4,376 KB |
testcase_25 | AC | 7 ms
4,380 KB |
testcase_26 | AC | 17 ms
4,380 KB |
testcase_27 | AC | 21 ms
4,376 KB |
ソースコード
# include <iostream> # include <algorithm> # include <vector> # include <string> # include <set> # include <map> # include <cmath> # include <iomanip> # include <functional> # include <utility> # include <stack> # include <queue> # include <list> # include <tuple> # include <unordered_map> # include <numeric> # include <complex> # include <bitset> # include <random> # include <chrono> using namespace std; using LL = long long; using ULL = unsigned long long; constexpr int INF = 2147483647; constexpr int HINF = INF / 2; constexpr double DINF = 100000000000000000.0; constexpr double HDINF = 50000000000000000.0; constexpr long long LINF = 9223372036854775807; constexpr long long HLINF = 4500000000000000000; const double PI = acos(-1); int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 }; template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }; template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }; # define ALL(x) (x).begin(),(x).end() # define UNIQ(c) (c).erase(unique(ALL((c))),(c).end()) # define LOWER(s) transform(ALL((s)),(s).begin(),TL<char>) # define UPPER(s) transform(ALL((s)),(s).begin(),TU<char>) # define mp make_pair # define eb emplace_back # define FOR(i,a,b) for(LL i=(a);i<(b);i++) # define RFOR(i,a,b) for(LL i=(a);i>=(b);i--) # define REP(i,n) FOR(i,0,n) # define INIT std::ios::sync_with_stdio(false);std::cin.tie(0) int l, d; int grundy[1010]; int main() { cin >> l >> d; for (int i = 1; i <= l; i++) { set<int>st; for (int x = 1; x <= i - 1; x++) { for (int y = x + 1; i - (x + y) > y; y++) { int r = i - x - y; if (r - x <= d)st.insert(grundy[x] ^ grundy[y] ^ grundy[r]); } } while (st.count(grundy[i]))grundy[i]++; } if (grundy[l] == 0) { cout << "matsu" << endl; } else { cout << "kado" << endl; } }