結果
問題 | No.946 箱箱箱 |
ユーザー | hotman78 |
提出日時 | 2023-10-22 16:39:29 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 355 ms / 2,000 ms |
コード長 | 8,529 bytes |
コンパイル時間 | 3,701 ms |
コンパイル使用メモリ | 233,728 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-22 09:46:49 |
合計ジャッジ時間 | 15,132 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 229 ms
6,940 KB |
testcase_04 | AC | 234 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 233 ms
6,940 KB |
testcase_07 | AC | 233 ms
6,944 KB |
testcase_08 | AC | 236 ms
6,944 KB |
testcase_09 | AC | 290 ms
6,940 KB |
testcase_10 | AC | 227 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 275 ms
6,940 KB |
testcase_13 | AC | 237 ms
6,944 KB |
testcase_14 | AC | 234 ms
6,944 KB |
testcase_15 | AC | 230 ms
6,940 KB |
testcase_16 | AC | 231 ms
6,944 KB |
testcase_17 | AC | 230 ms
6,940 KB |
testcase_18 | AC | 232 ms
6,944 KB |
testcase_19 | AC | 328 ms
6,944 KB |
testcase_20 | AC | 3 ms
6,940 KB |
testcase_21 | AC | 221 ms
6,944 KB |
testcase_22 | AC | 231 ms
6,940 KB |
testcase_23 | AC | 233 ms
6,944 KB |
testcase_24 | AC | 222 ms
6,940 KB |
testcase_25 | AC | 352 ms
6,944 KB |
testcase_26 | AC | 232 ms
6,944 KB |
testcase_27 | AC | 230 ms
6,940 KB |
testcase_28 | AC | 228 ms
6,944 KB |
testcase_29 | AC | 233 ms
6,944 KB |
testcase_30 | AC | 234 ms
6,940 KB |
testcase_31 | AC | 233 ms
6,940 KB |
testcase_32 | AC | 227 ms
6,940 KB |
testcase_33 | AC | 231 ms
6,940 KB |
testcase_34 | AC | 233 ms
6,944 KB |
testcase_35 | AC | 233 ms
6,944 KB |
testcase_36 | AC | 232 ms
6,940 KB |
testcase_37 | AC | 232 ms
6,940 KB |
testcase_38 | AC | 355 ms
6,944 KB |
testcase_39 | AC | 228 ms
6,944 KB |
testcase_40 | AC | 225 ms
6,944 KB |
testcase_41 | AC | 229 ms
6,940 KB |
testcase_42 | AC | 232 ms
6,940 KB |
testcase_43 | AC | 232 ms
6,940 KB |
testcase_44 | AC | 354 ms
6,944 KB |
testcase_45 | AC | 233 ms
6,944 KB |
testcase_46 | AC | 233 ms
6,940 KB |
testcase_47 | AC | 2 ms
6,944 KB |
testcase_48 | AC | 2 ms
6,940 KB |
testcase_49 | AC | 2 ms
6,944 KB |
testcase_50 | AC | 2 ms
6,940 KB |
testcase_51 | AC | 2 ms
6,944 KB |
testcase_52 | AC | 2 ms
6,944 KB |
testcase_53 | AC | 2 ms
6,940 KB |
ソースコード
// author: hotman78 // date: 2023/10/22-16:39:22 // --- begin raw code ----------------- // #include"cpplib/util/template.hpp" // // int main(){ // lint n; // cin>>n; // vec a(n); // rep(i,n)cin>>a[i]; // reverse(all(a)); // auto dp=make_vector<lint>(0,n+1); // vec b(n+1); // rep(i,n)b[i+1]=b[i]^a[i]; // rep(i,n+1){ // set<lint>s; // rep(j,i){ // // cerr<<(dp[j]^b[i]^b[j])<<endl; // s.emplace(dp[j]^b[i]^b[j]); // } // lint now=0; // while(s.count(now))now++; // dp[i]=now; // } // cout<<(dp[n]?"Takahashi":"Takanashi")<<endl; // // debug(dp); // } // --- end raw code ----------------- #line 2 "cpplib/util/template.hpp" #ifdef LOCAL #define _GLIBCXX_DEBUG #endif #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC target("avx2") #include <bits/stdc++.h> using namespace std; #line 1 "cpplib/util/ioutil.hpp" // template <class Head,class... Args> // std::ostream& output(std::ostream& out,const Head& head,const Args&... args){ // out>>head; // return output(head,args...); // } // template <class Head> // std::ostream& output(std::ostream& out,const Head& head){ // out>>head; // return out; // } template <typename T, typename E> std::ostream &operator<<(std::ostream &out, std::pair<T, E> v) { out << "(" << v.first << "," << v.second << ")"; return out; } // template <class... Args> // ostream& operator<<(ostream& out,std::tuple<Args...>v){ // std::apply(output,v); // return out; // } #line 11 "cpplib/util/template.hpp" struct __INIT__ { __INIT__() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } __INIT__; typedef long long lint; constexpr long long INF = 1LL << 60; constexpr int IINF = 1 << 30; constexpr double EPS = 1e-10; #ifndef REACTIVE #define endl '\n'; #endif typedef vector<lint> vec; typedef vector<vector<lint>> mat; typedef vector<vector<vector<lint>>> mat3; typedef vector<string> svec; typedef vector<vector<string>> smat; template <typename T> using V = vector<T>; template <typename T> using VV = V<V<T>>; #define output(t) \ { \ bool f = 0; \ for (auto val : (t)) { \ cout << (f ? " " : "") << val; \ f = 1; \ } \ cout << endl; \ } #define output2(t) \ { \ for (auto i : t) \ output(i); \ } #define debug(t) \ { \ bool f = 0; \ for (auto i : t) { \ cerr << (f ? " " : "") << i; \ f = 1; \ } \ cerr << endl; \ } #define debug2(t) \ { \ for (auto i : t) \ debug(i); \ } #define loop(n) for (long long _ = 0; _ < (long long)(n); ++_) #define _overload4(_1, _2, _3, _4, name, ...) name #define __rep(i, a) repi(i, 0, a, 1) #define _rep(i, a, b) repi(i, a, b, 1) #define repi(i, a, b, c) \ for (long long i = (long long)(a); i < (long long)(b); i += c) #define rep(...) _overload4(__VA_ARGS__, repi, _rep, __rep)(__VA_ARGS__) #define _overload3_rev(_1, _2, _3, name, ...) name #define _rep_rev(i, a) repi_rev(i, 0, a) #define repi_rev(i, a, b) \ for (long long i = (long long)(b)-1; i >= (long long)(a); --i) #define rrep(...) _overload3_rev(__VA_ARGS__, repi_rev, _rep_rev)(__VA_ARGS__) #define all(n) begin(n), end(n) template <typename T, typename E> bool chmin(T &s, const E &t) { bool res = s > t; s = min<T>(s, t); return res; } template <typename T, typename E> bool chmax(T &s, const E &t) { bool res = s < t; s = max<T>(s, t); return res; } const vector<lint> dx = {1, 0, -1, 0, 1, 1, -1, -1}; const vector<lint> dy = {0, 1, 0, -1, 1, -1, 1, -1}; #define SUM(v) accumulate(all(v), 0LL) #if __cplusplus >= 201703L template <typename T, typename... Args> auto make_vector(T x, int arg, Args... args) { if constexpr (sizeof...(args) == 0) return vector<T>(arg, x); else return vector(arg, make_vector<T>(x, args...)); } #endif #define extrep(v, ...) for (auto v : __MAKE_MAT__({__VA_ARGS__})) #define bit(n, a) ((n >> a) & 1) vector<vector<long long>> __MAKE_MAT__(vector<long long> v) { if (v.empty()) return vector<vector<long long>>(1, vector<long long>()); long long n = v.back(); v.pop_back(); vector<vector<long long>> ret; vector<vector<long long>> tmp = __MAKE_MAT__(v); for (auto e : tmp) for (long long i = 0; i < n; ++i) { ret.push_back(e); ret.back().push_back(i); } return ret; } using graph = vector<vector<int>>; template <typename T> using graph_w = vector<vector<pair<int, T>>>; #if __cplusplus >= 201703L constexpr inline long long powll(long long a, long long b) { long long res = 1; while (b--) res *= a; return res; } #endif template <typename T, typename E> pair<T, E> &operator+=(pair<T, E> &s, const pair<T, E> &t) { s.first += t.first; s.second += t.second; return s; } template <typename T, typename E> pair<T, E> &operator-=(pair<T, E> &s, const pair<T, E> &t) { s.first -= t.first; s.second -= t.second; return s; } template <typename T, typename E> pair<T, E> operator+(const pair<T, E> &s, const pair<T, E> &t) { auto res = s; return res += t; } template <typename T, typename E> pair<T, E> operator-(const pair<T, E> &s, const pair<T, E> &t) { auto res = s; return res -= t; } #define BEGIN_STACK_EXTEND(size) \ void *stack_extend_memory_ = malloc(size); \ void *stack_extend_origin_memory_; \ char *stack_extend_dummy_memory_ = (char *)alloca( \ (1 + (int)(((long long)stack_extend_memory_) & 127)) * 16); \ *stack_extend_dummy_memory_ = 0; \ asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp" \ : "=b"(stack_extend_origin_memory_) \ : "a"((char *)stack_extend_memory_ + (size)-1024)); #define END_STACK_EXTEND \ asm volatile("mov %%rax, %%rsp" ::"a"(stack_extend_origin_memory_)); \ free(stack_extend_memory_); int floor_pow(int n) { return n ? 31 - __builtin_clz(n) : 0; } #line 2 "main.cpp" int main() { lint n; cin >> n; vec a(n); rep(i, n) cin >> a[i]; reverse(all(a)); auto dp = make_vector<lint>(0, n + 1); vec b(n + 1); rep(i, n) b[i + 1] = b[i] ^ a[i]; rep(i, n + 1) { set<lint> s; rep(j, i) { // cerr<<(dp[j]^b[i]^b[j])<<endl; s.emplace(dp[j] ^ b[i] ^ b[j]); } lint now = 0; while (s.count(now)) now++; dp[i] = now; } cout << (dp[n] ? "Takahashi" : "Takanashi") << endl; // debug(dp); }