#include "bits/stdc++.h" // Tomasz Nowak using namespace std; // XIII LO Szczecin using LL = long long; // Poland #define FOR(i, l, r) for(int i = (l); i <= (r); ++i) #define REP(i, n) FOR(i, 0, (n) - 1) template<class T> int size(T &&x) { return int(x.size()); } template<class A, class B> ostream& operator<<(ostream &out, const pair<A, B> &p) { return out << '(' << p.first << ", " << p.second << ')'; } template<class T> auto operator<<(ostream &out, T &&x) -> decltype(x.begin(), out) { out << '{'; for(auto it = x.begin(); it != x.end(); ++it) out << *it << (it == prev(x.end()) ? "" : ", "); return out << '}'; } void dump() {} template<class T, class... Args> void dump(T &&x, Args... args) { cerr << x << "; "; dump(args...); } #ifdef DEBUG struct Nl{~Nl(){cerr << '\n';}}; # define debug(x...) cerr << (strcmp(#x, "") ? #x ": " : ""), dump(x), Nl(), cerr << "" #else # define debug(...) 0 && cerr #endif mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); int rd(int l, int r) { return uniform_int_distribution<int>(l, r)(rng); } // end of templates // #define TESTING int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> a(n); for(int &ai : a) cin >> ai; #ifdef TESTING int sure_yes; cin >> sure_yes; #endif vector<int> output(n); for(int i = 0; i < n; ++i) output[i] = a[i] - (i == 0 ? 0 : a[i - 1]); debug(output); for(int l = 0; l < n; ++l) { LL sum_lr = 0; for(int r = l; r < n; ++r) { sum_lr += output[r]; if(sum_lr > a[r - l]) { debug(l, r, sum_lr, a[r - l]); #ifdef TESTING assert(not sure_yes); #endif cout << "NIE\n"; return 0; } } } cout << "TAK\n"; #ifdef TESTING constexpr LL inf = LL(1e13); assert(size(output) <= int(1e5)); for(LL x : output) assert(-inf <= x and x <= inf); #else cout << size(output) << '\n'; for(LL x : output) cout << x << ' '; cout << '\n'; #endif }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 | #include "bits/stdc++.h" // Tomasz Nowak using namespace std; // XIII LO Szczecin using LL = long long; // Poland #define FOR(i, l, r) for(int i = (l); i <= (r); ++i) #define REP(i, n) FOR(i, 0, (n) - 1) template<class T> int size(T &&x) { return int(x.size()); } template<class A, class B> ostream& operator<<(ostream &out, const pair<A, B> &p) { return out << '(' << p.first << ", " << p.second << ')'; } template<class T> auto operator<<(ostream &out, T &&x) -> decltype(x.begin(), out) { out << '{'; for(auto it = x.begin(); it != x.end(); ++it) out << *it << (it == prev(x.end()) ? "" : ", "); return out << '}'; } void dump() {} template<class T, class... Args> void dump(T &&x, Args... args) { cerr << x << "; "; dump(args...); } #ifdef DEBUG struct Nl{~Nl(){cerr << '\n';}}; # define debug(x...) cerr << (strcmp(#x, "") ? #x ": " : ""), dump(x), Nl(), cerr << "" #else # define debug(...) 0 && cerr #endif mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); int rd(int l, int r) { return uniform_int_distribution<int>(l, r)(rng); } // end of templates // #define TESTING int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> a(n); for(int &ai : a) cin >> ai; #ifdef TESTING int sure_yes; cin >> sure_yes; #endif vector<int> output(n); for(int i = 0; i < n; ++i) output[i] = a[i] - (i == 0 ? 0 : a[i - 1]); debug(output); for(int l = 0; l < n; ++l) { LL sum_lr = 0; for(int r = l; r < n; ++r) { sum_lr += output[r]; if(sum_lr > a[r - l]) { debug(l, r, sum_lr, a[r - l]); #ifdef TESTING assert(not sure_yes); #endif cout << "NIE\n"; return 0; } } } cout << "TAK\n"; #ifdef TESTING constexpr LL inf = LL(1e13); assert(size(output) <= int(1e5)); for(LL x : output) assert(-inf <= x and x <= inf); #else cout << size(output) << '\n'; for(LL x : output) cout << x << ' '; cout << '\n'; #endif } |