— Dark mode

NOI 2024

Chair Game

  • Start: 2024-03-06 15:00:00
  • End: 2024-03-06 20:00:00
  • Contest has ended
CSES - NOI 2024 - Results
Submission details
Task:Chair Game
Sender:Theodor Beskow
Submission time:2024-03-14 20:34:44 +0200
Language:C++ (C++17)
Status:READY
Result:12
Feedback
groupverdictscore
#1ACCEPTED8
#20
#3ACCEPTED4
#40
#50
#60
#70
#80
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 7, 8details
#2ACCEPTED0.01 s1, 7, 8details
#3ACCEPTED0.02 s1, 7, 8details
#4ACCEPTED0.01 s1, 7, 8details
#5ACCEPTED0.02 s1, 7, 8details
#6ACCEPTED0.13 s7, 8details
#7--7, 8details
#8--2, 8details
#9ACCEPTED0.01 s3, 4, 5, 6, 8details
#10ACCEPTED0.01 s3, 4, 5, 6, 8details
#11ACCEPTED0.01 s3, 4, 5, 6, 8details
#12ACCEPTED0.02 s3, 4, 5, 6, 8details
#13--4, 5, 6, 7, 8details
#14--4, 5, 6, 8details
#15--4, 5, 6, 8details
#16--4, 5, 6, 8details
#17ACCEPTED0.08 s5, 6, 7, 8details
#18--5, 6, 8details
#19ACCEPTED0.01 s5, 6, 8details
#20--5, 6, 8details
#21ACCEPTED0.00 s1, 6, 7, 8details
#22--6, 7, 8details
#23--6, 8details
#24--6, 8details
#25--8details
#26--8details
#27ACCEPTED0.01 s3, 4, 5, 6, 8details
#28ACCEPTED0.01 s8details
#29--8details
#30--8details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:90:14: warning: unused variable 'fail' [-Wunused-variable]
   90 |         bool fail = 1;
      |              ^~~~
input/code.cpp:75:11: warning: variable 'tt' set but not used [-Wunused-but-set-variable]
   75 |     ll t, tt;
      |           ^~
input/code.cpp:78:8: warning: unused variable 'startTime' [-Wunused-variable]
   78 |     ll startTime = chrono::steady_clock::now().time_since_epoch().count();
      |        ^~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;
 
// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")
 
// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
 
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
 
#define ll long long
#define INF ((ll)(1e9+7))
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << (x) << endl;
#define deb2(x, y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;
 
vl v;
// vvl memo;
ll n;
 
 
 
ll best;
vl current;
 
bool check(){
    vl res(n, 0);
    fo(i, n){
        if(res[(i+v[i])%n]){
            if(i>best){
                current = v;
                best = i;
            }
            
            return 0;
        }
        res[(i+v[i])%n] = 1;
    }
    return 1;
}
 
int main(){
    cin.tie(0)->sync_with_stdio(0);
    
 
    ll t, tt;
    cin >> t;
    tt = t;
    ll startTime = chrono::steady_clock::now().time_since_epoch().count();
    srand(50);
    while(t--){
        cin >> n;
        v.assign(n, 0);
        // current.assign(n, 0);
        ll currentSum = 0;
 
        fo(i, n){
            cin >> v[i];
            currentSum+=v[i];
        }
        bool fail = 1;
        best = -1;
        current = v;
        // deb(currentSum)
        if(currentSum%n != 0){
            cout << "NO\n";
            continue;
        }
 
        while(true){
            if(check()){
                break;
            }
            v = current;
            fo(ii, rand()%5) swap(v[best], v[rand()%n]);
        }
        cout << "YES\n";
        fo(i, n) cout << v[i] << " ";
        cout << "\n";
    }
 
    return 0;
}
 
 
 
// #include <iostream>
// #include <vector>
// #include <algorithm>
// #include <numeric>
// #include <functional>
// #include <set>
// #include <map>
// #include <queue>
 
// using namespace std;
 
// typedef long long int ll;
// typedef vector<ll> vll;
// typedef vector<vll> vvll;
// typedef pair<ll, ll> pll;
// typedef vector<pll> vpll;
// typedef set<pll> spll;
// typedef pair<pll, ll> ppll_ll;
// typedef set<ppll_ll> sppll_ll;
// typedef set<ll> sll;
 
// #define rep(i, a, b) for (ll i = a; i < b; i++)
// #define sz(a) (ll) a.size()
// #define mp(a, b) make_pair(a, b)
// #define pb(a) push_back(a)
// #define trav(itr, a, t) for (t::iterator itr = a.begin(); itr != a.end())
 
// // coordinate convention (y, x) for (n, m)
 
// const pll delta[4] = {mp(1, 0), mp(0, 1), mp(-1, 0), mp(0, -1)};
 
// ll n, m, d;
 
// vvll ice;
 
// bool inline is_edge(const pll& pos) {return (pos.first == 0) || (pos.first == n - 1) || (pos.second == 0) || (pos.second == m - 1);}
// ll inline coco(pll z) {return z.first + (z.second * n);}
// pll inline rev_coco(ll z) {return mp(z % n, z / n);}
 
// pll inline operator+(const pll& lhs, const pll& rhs) {return mp(lhs.first + rhs.first, lhs.second + rhs.second);}
// pll inline operator+(const pll& lhs, const ll& rhs) {return mp(lhs.first + rhs, lhs.second);}
 
// sppll_ll best_edges; // ((d[neigh] + cnt, neigh), src)
// spll best_comp; // (cnt, src)
 
// struct component;
// vector<component> comps;
// vll par;
 
// ll find_par(ll x) {
//     if (x != par[x]) par[x] = find_par(par[x]);
//     return par[x];
// }
 
// struct component {
//     ll root;
//     ll cnt;
//     spll edges; // (d[neigh], neigh)
//     //sll members;
//     component(ll root) : root(root), cnt(1) {
//         par[root] = root;
//         //members.insert(root);
//     }
//     ppll_ll best_edge() {
//         return mp(*edges.rbegin() + cnt, root);
//     }
//     void add_best_edge() {
//         if (sz(edges)) best_edges.insert(best_edge());
//     }
//     void absorb(ll oth) {
//         //cout << "root " << root << endl;
 
//         if (sz(edges)) best_edges.erase(best_edge()); // remove previous best edge
//         best_comp.erase(mp(cnt, root));
 
//         //cout << oth << " -> " << find_par(oth) << endl;
//         oth = find_par(oth);
 
//         if (sz(comps[oth].edges)) best_edges.erase(comps[oth].best_edge()); // remove previous best edge from oth
//         best_comp.erase(mp(comps[oth].cnt, oth));
        
//         par[oth] = root;
//         cnt += comps[oth].cnt;
//         //cout << "cnt -> " << cnt << " (+" << comps[oth].cnt << ")" << endl; 
//         edges.insert(comps[oth].edges.begin(), comps[oth].edges.end()); // merge edges
        
//         add_best_edge(); // make public best edge
//         best_comp.insert(mp(cnt, root));
//     }
//     void tick() {
//         best_edges.erase(best_edge());
//         edges.erase(prev(edges.end()));
//         add_best_edge();
//     }
// };
 
// spll e;
 
// int main() {
//     cin.tie(NULL)->sync_with_stdio(false);
 
//     cin >> n >> m;
//     d = 1;
//     ice.resize(n);
//     rep(i, 0, n) {
//         ice[i].resize(m);
//         rep(j, 0, m) {
//             cin >> ice[i][j];
//             d = max<ll>(d, ice[i][j]);
//         }
//     }
 
//     par.resize(n * m);
//     //comps.reserve(n * m);
 
//     rep(j, 0, m) {
//         rep(i, 0, n) {
//             comps.pb(component(coco(mp(i, j))));
//         }
//     }
 
//     rep(i, 0, n) {
//         rep(j, 0, m) {
//             // initialize neighbors
//             rep(d, 0, 4) {
//                 pll neigh = mp(i, j) + delta[d];
//                 if ((neigh.first == -1) || (neigh.first == n) || (neigh.second == -1) || (neigh.second == m)) continue; // check oob
//                 // add edge (i, j) -> neigh (with d = ice[neigh])
//                 //cout << "edge: " << coco(mp(i, j)) << " -> (" << ice[neigh.first][neigh.second] << ", " << coco(neigh) << ")" << endl;
//                 comps[coco(mp(i, j))].edges.insert(mp(ice[neigh.first][neigh.second], coco(neigh)));
//             }
 
//             if (is_edge(mp(i, j))) {
//                 e.insert(mp(ice[i][j], coco(mp(i, j))));
//             }
//             /* if (is_edge(mp(i, j))) { // now we only consider edges from active...
//                 // initialize presence in best_edges and best_comp
//                 comps[coco(mp(i, j))].add_best_edge();
//                 best_comp.insert(mp(1, coco(mp(i, j))));
//             } */
//         }
//     }
 
//     /* cout << "par:" << endl;
//     rep(i, 0, n) {
//         rep(j, 0, m) {
//             cout << par[coco(mp(i, j))] << " ";
//         }
//         cout << endl;
//     } */
 
//     d++;
 
//     while ((best_comp.empty()) || (best_comp.rbegin()->first < d)) {
//     //rep(tmp, 0, 20) {
//         //cout << "d = " << d << endl;
//         //if (!best_comp.empty()) cout << "comp: " << best_comp.rbegin()->first << " " << best_comp.rbegin()->second << endl;
//         //if (!best_edges.empty()) cout << "edge: " << best_edges.rbegin()->first.first << " " << best_edges.rbegin()->first.second << " " << best_edges.rbegin()->second << endl;
//         // check for edges to add
//         if ((!best_edges.empty()) && (best_edges.rbegin()->first.first >= d)) {
//             // do some pre-work
//             ll src = best_edges.rbegin()->second;
//             ll dest = best_edges.rbegin()->first.second;
//             // check if edge goes from comp to itself
//             if (find_par(dest) == src) {
//                 //cout << "tick" << endl;
//                 comps[src].tick(); // remove best edge, because it goes within itself
//             } else { // the edge merges two distinct components
//                 //cout << "absorb" << endl;
//                 comps[src].absorb(dest);
//             }
//         } else { // if no edges, then decrement d
//             d--;
 
//             while ((!e.empty()) && (e.rbegin()->first == d)) {
//                 if (find_par(e.rbegin()->second) == e.rbegin()->second) {
//                     comps[e.rbegin()->second].add_best_edge();
//                             best_comp.insert(mp(1, e.rbegin()->second));
//                 }
//                 e.erase(prev(e.end()));
//             }
 
//             /* // activate all edges with ice = d
//             rep(i, 0, n) {
//                 rep(j, 0, m) {
//                     if (is_edge(mp(i, j)) && (find_par(coco(mp(i, j))) == coco(mp(i, j)))) {
//                         if (ice[i][j] == d) {
//                             // initialize presence in best_edges and best_comp
//                             comps[coco(mp(i, j))].add_best_edge();
//                             best_comp.insert(mp(1, coco(mp(i, j))));
//                         }
//                     }
//                 }
//             } */
//         }
 
//         /* cout << "par:" << endl;
//         rep(i, 0, n) {
//             rep(j, 0, m) {
//                 cout << par[coco(mp(i, j))] << " ";
//             }
//             cout << endl;
//         } */
//     }
 
 
//     cout << d << endl;
 
//     return 0;
// }

Test details

Test 1

Group: 1, 7, 8

Verdict: ACCEPTED

input
637
1
1
2
1 1
...
view save

correct output
YES
1 
YES
1 1 
YES
...
view save

user output
YES
1 
YES
1 1 
YES
...
Truncated

Test 2

Group: 1, 7, 8

Verdict: ACCEPTED

input
246
7
1 1 1 1 1 1 1
7
1 1 2 1 1 7 1
...
view save

correct output
YES
1 1 1 1 1 1 1 
YES
1 1 1 1 2 7 1 
YES
...
view save

user output
YES
1 1 1 1 1 1 1 
YES
1 1 1 1 2 7 1 
YES
...
Truncated

Test 3

Group: 1, 7, 8

Verdict: ACCEPTED

input
810
8
1 1 1 1 1 1 1 1
8
1 1 1 8 1 1 2 1
...
view save

correct output
YES
1 1 1 1 1 1 1 1 
YES
1 1 2 8 1 1 1 1 
YES
...
view save

user output
YES
1 1 1 1 1 1 1 1 
YES
1 1 1 1 1 2 8 1 
YES
...
Truncated

Test 4

Group: 1, 7, 8

Verdict: ACCEPTED

input
1000
8
8 8 5 2 8 7 6 5
8
6 5 2 2 8 2 1 6
...
view save

correct output
NO
YES
8 2 2 6 2 5 1 6 
NO
NO
...
view save

user output
NO
YES
6 8 2 2 6 2 5 1 
NO
NO
...
Truncated

Test 5

Group: 1, 7, 8

Verdict: ACCEPTED

input
1000
8
2 1 7 7 2 3 8 2
8
4 1 5 4 7 3 5 3
...
view save

correct output
YES
7 2 2 7 1 3 8 2 
YES
4 4 7 3 3 5 5 1 
YES
...
view save

user output
YES
2 7 1 3 8 2 7 2 
YES
4 1 5 3 5 3 7 4 
YES
...
Truncated

Test 6

Group: 7, 8

Verdict: ACCEPTED

input
1000
16
15 16 6 4 14 2 1 6 2 16 10 2 9...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
Truncated

Test 7

Group: 7, 8

Verdict:

input
1000
16
2 4 13 6 8 16 12 8 16 5 9 5 9 ...
view save

correct output
YES
13 5 2 8 12 2 8 5 16 16 9 6 9 ...
view save

user output
(empty)

Test 8

Group: 2, 8

Verdict:

input
1000
1
1
2
1 2
...
view save

correct output
YES
1 
NO
YES
3 1 2 
...
view save

user output
(empty)

Test 9

Group: 3, 4, 5, 6, 8

Verdict: ACCEPTED

input
988
1
1
2
1 1
...
view save

correct output
YES
1 
YES
1 1 
YES
...
view save

user output
YES
1 
YES
1 1 
YES
...
Truncated

Test 10

Group: 3, 4, 5, 6, 8

Verdict: ACCEPTED

input
199
1
1
2
1 1
...
view save

correct output
YES
1 
YES
1 1 
YES
...
view save

user output
YES
1 
YES
1 1 
YES
...
Truncated

Test 11

Group: 3, 4, 5, 6, 8

Verdict: ACCEPTED

input
1000
100
1 1 1 2 1 1 2 2 1 1 1 1 1 2 1 ...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
Truncated

Test 12

Group: 3, 4, 5, 6, 8

Verdict: ACCEPTED

input
1000
100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view save

correct output
YES
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view save

user output
YES
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
Truncated

Test 13

Group: 4, 5, 6, 7, 8

Verdict:

input
963
1
1
2
1 1
...
view save

correct output
YES
1 
YES
1 1 
YES
...
view save

user output
(empty)

Test 14

Group: 4, 5, 6, 8

Verdict:

input
979
1
1
2
1 1
...
view save

correct output
YES
1 
YES
1 1 
YES
...
view save

user output
(empty)

Test 15

Group: 4, 5, 6, 8

Verdict:

input
1000
100
3 3 1 2 1 1 2 3 1 3 2 1 1 3 1 ...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
(empty)

Test 16

Group: 4, 5, 6, 8

Verdict:

input
1000
100
1 2 2 2 2 1 1 1 2 3 1 1 3 2 1 ...
view save

correct output
YES
2 2 2 3 1 2 3 1 2 3 1 3 1 3 1 ...
view save

user output
(empty)

Test 17

Group: 5, 6, 7, 8

Verdict: ACCEPTED

input
980
1
1
2
1 1
...
view save

correct output
YES
1 
YES
1 1 
YES
...
view save

user output
YES
1 
YES
1 1 
YES
...
Truncated

Test 18

Group: 5, 6, 8

Verdict:

input
947
1
1
2
1 1
...
view save

correct output
YES
1 
YES
1 1 
YES
...
view save

user output
(empty)

Test 19

Group: 5, 6, 8

Verdict: ACCEPTED

input
1000
100
1 2 4 2 1 3 1 2 2 3 1 1 3 1 4 ...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
Truncated

Test 20

Group: 5, 6, 8

Verdict:

input
1000
100
3 4 4 4 4 4 4 3 3 3 4 4 2 3 3 ...
view save

correct output
YES
4 2 4 4 1 3 4 2 4 2 3 4 2 4 4 ...
view save

user output
(empty)

Test 21

Group: 1, 6, 7, 8

Verdict: ACCEPTED

input
715
1
1
2
1 1
...
view save

correct output
YES
1 
YES
1 1 
YES
...
view save

user output
YES
1 
YES
1 1 
YES
...
Truncated

Test 22

Group: 6, 7, 8

Verdict:

input
843
1
1
2
1 1
...
view save

correct output
YES
1 
YES
1 1 
YES
...
view save

user output
(empty)

Test 23

Group: 6, 8

Verdict:

input
1000
100
3 4 5 1 4 4 2 3 2 3 4 1 1 1 2 ...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
(empty)

Test 24

Group: 6, 8

Verdict:

input
1000
100
5 3 4 3 5 3 3 5 5 4 5 5 5 5 2 ...
view save

correct output
YES
4 4 5 5 2 4 4 5 3 5 5 2 5 5 2 ...
view save

user output
(empty)

Test 25

Group: 8

Verdict:

input
1000
100
88 70 59 44 28 10 19 19 42 16 ...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
(empty)

Test 26

Group: 8

Verdict:

input
1000
100
31 72 52 30 77 56 79 10 88 11 ...
view save

correct output
YES
31 62 14 10 66 63 1 82 37 92 3...
view save

user output
(empty)

Test 27

Group: 3, 4, 5, 6, 8

Verdict: ACCEPTED

input
1000
1
1
2
1 1
...
view save

correct output
YES
1 
YES
1 1 
YES
...
view save

user output
YES
1 
YES
1 1 
YES
...
Truncated

Test 28

Group: 8

Verdict: ACCEPTED

input
1000
1
1
2
2 2
...
view save

correct output
YES
1 
YES
2 2 
YES
...
view save

user output
YES
1 
YES
2 2 
YES
...
Truncated

Test 29

Group: 8

Verdict:

input
1000
100
87 81 29 35 8 98 77 50 46 34 5...
view save

correct output
YES
34 74 25 91 80 18 95 26 88 12 ...
view save

user output
(empty)

Test 30

Group: 8

Verdict:

input
1000
100
65 92 39 22 67 41 17 65 97 71 ...
view save

correct output
YES
9 38 24 59 69 24 63 3 22 35 24...
view save

user output
(empty)

Tasks

A Anime Shops-B Chair Game-C Thin Ice-

Submissions (Theodor Beskow)

2024-03-18 19:02:32 1002024-03-18 18:54:31 42024-03-17 15:23:49 02024-03-17 15:14:44 42024-03-15 00:26:53 442024-03-15 00:24:17 282024-03-15 00:18:54 322024-03-14 21:44:54 122024-03-14 21:37:04 122024-03-14 21:08:54 122024-03-14 20:42:13 122024-03-14 20:39:12 2024-03-14 20:38:25 2024-03-14 20:34:44 122024-03-06 20:00:01 122024-03-06 20:00:01 122024-03-06 19:59:46 122024-03-06 19:59:36 122024-03-06 19:59:23 122024-03-06 19:58:56 2024-03-06 19:58:27 82024-03-06 19:22:23 122024-03-06 19:12:59 122024-03-06 19:12:46 122024-03-06 19:11:56 42024-03-06 19:10:47 122024-03-06 18:56:59 122024-03-06 18:56:47 122024-03-06 18:55:03 122024-03-06 18:17:37 242024-03-06 18:15:56 92024-03-06 18:14:25 02024-03-06 18:04:23 172024-03-06 18:03:15 82024-03-06 16:50:08 9