— Dark mode

NOI 2024

Chair Game

  • Start: 2024-03-06 15:00:00
  • End: 2024-03-06 20:00:00
CSES - NOI 2024 - Results
Submission details
Task:Chair Game
Sender:Sofie Fu
Submission time:2024-03-18 19:55:44 +0200
Language:C++ (C++20)
Status:READY
Result:9
Feedback
groupverdictscore
#10
#2ACCEPTED5
#3ACCEPTED4
#40
#50
#60
#70
#80
Test results
testverdicttimegroup
#1--1, 7, 8details
#2--1, 7, 8details
#3--1, 7, 8details
#4--1, 7, 8details
#5--1, 7, 8details
#6--7, 8details
#7--7, 8details
#8ACCEPTED0.03 s2, 8details
#9ACCEPTED0.01 s3, 4, 5, 6, 8details
#10ACCEPTED0.01 s3, 4, 5, 6, 8details
#11ACCEPTED0.03 s3, 4, 5, 6, 8details
#12ACCEPTED0.05 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
#17--5, 6, 7, 8details
#18--5, 6, 8details
#19ACCEPTED0.03 s5, 6, 8details
#20--5, 6, 8details
#21--1, 6, 7, 8details
#22--6, 7, 8details
#23--6, 8details
#24--6, 8details
#25--8details
#26--8details
#27ACCEPTED0.03 s3, 4, 5, 6, 8details
#28ACCEPTED0.03 s8details
#29--8details
#30--8details

Compiler report

input/code.cpp: In function 'void solve()':
input/code.cpp:83:19: warning: unused variable 'a2' [-Wunused-variable]
   83 |     int a1 = n-2, a2 = n-1, b1 = *notChosenB.begin(), b2 = *notChosenB.rbegin(), u1 = *notChosenC.begin(), u2 = *notChosenC.rbegin();
      |                   ^~

Code

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vo vector
#define pb push_back
#define se second
#define fi first
#define sz(x) x.size()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define umap unordered_map
#define uset unordered_set

#define rep(i, a, b) for(ll i=(a); i<b; i++)
#define pr1(x) cerr << #x << '=' << x << ' ';
//for google contests
#define all(v) v.begin(), v.end()
#define repd(i, a, b) for(ll i=(b-1); i >= a; i--)
void _pr(signed x) {cerr << x;}
void _pr(long long x) {cerr << x;}
void _pr(unsigned long long x) {cerr << x;}
void _pr(double x) {cerr << x;}
void _pr(char x) {cerr << '\'' << x << '\'';}
void _pr(const char* x) {cerr << x;}
void _pr(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void _pr(const pair<T, V> &x);
template<typename T, typename V> void _pr(const pair<T, V> &x) {cerr << "\e[95m" << "[ "; _pr(x.first); cerr << ", "; _pr(x.second); cerr << "\e[95m" << ']';}
template<typename T> void _pr(const T &x) {int F=0; cerr << '{'; for(auto &i: x) cerr << (F++ ? ", " : ""), _pr(i); cerr << "\e[91m" << '}';}
template <typename T, typename... V> void _pr(T t, V... v) {_pr(t); if(sizeof...(v)) cerr << ", "; _pr(v...);}
#define pr(x...) cerr << "\e[91m" << __func__ << ':' << __LINE__ << " [" << #x << "] = ["; _pr(x); cerr << "\e[91m" << ']' << "\033[0m"  << endl;

//go for outline with ;, then details
ll const inf = LLONG_MAX, mxn = 105;
int t, n;
map<int, pii> abc;

bool check(int a, int b, int u, int lb){
    // pr(a, b, u)
    if((a+b)%n == u){
        abc[a] = {b, u};

        cout << "YES\n";
        rep(i, 0, n-1){
            cout << abc[i].fi << " ";
        }
        cout << lb << "\n";

        return 1;
    }
    return 0;
}

void solve(){
    cin>>n; abc.clear();
    vi a(n), b(n); int sum = 0;
    iota(all(a), 0);
    multiset<int> notChosenB, notChosenC;
    rep(i, 0, n) {
        cin>>b[i]; 
        sum+=b[i]; 
        notChosenB.insert(b[i]); notChosenC.insert(i);
    }

    if(sum % n) {cout << "NO\n"; return;}

    rep(i, 0, n-2){
        for(auto x: notChosenB){
            int ns = (i+x)%n;
            if(notChosenC.count(ns)){
                abc[i] = {x, ns};

                notChosenC.erase(ns);
                notChosenB.erase(notChosenB.find(x));
                break;
            }
        }
        // pr(notChosenB)
        // pr(notChosenC)
    }
    // pr(notChosenB)
    // pr(notChosenC);
    int a1 = n-2, a2 = n-1, b1 = *notChosenB.begin(), b2 = *notChosenB.rbegin(), u1 = *notChosenC.begin(), u2 = *notChosenC.rbegin();
    // pr(b1, b2, u1, u2)
    while(1){
        if(check(a1, b1, u1, b2)) return;
        if(check(a1, b1, u2, b2)) return;
        if(check(a1, b2, u1, b1)) return;
        if(check(a1, b2, u2, b1)) return;
        // pr(b1, b2, u1, u2)

        //swap
        int ar1 = (n+u1-b1)%n, nb = abc[ar1].fi, nu = abc[ar1].se;
        // pr(ar1)
        abc[ar1] = {b1, u1};
        b1 = b2, u1 = u2;
        b2 = nb, u2 = nu;
        
    }
}

signed main(){
    cin.tie(0)->sync_with_stdio(0);
    cin>>t;
    rep(_, 0, t){
        solve();
    }
}

/*
1
5
4 1 2 1 2
*/

Test details

Test 1

Group: 1, 7, 8

Verdict:

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

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

user output
(empty)

Test 2

Group: 1, 7, 8

Verdict:

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
(empty)

Test 3

Group: 1, 7, 8

Verdict:

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
(empty)

Test 4

Group: 1, 7, 8

Verdict:

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
(empty)

Test 5

Group: 1, 7, 8

Verdict:

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
(empty)

Test 6

Group: 7, 8

Verdict:

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
(empty)

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: ACCEPTED

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

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

user output
YES
1
NO
YES
1 2 3
...
Truncated

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:

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

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

user output
(empty)

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:

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

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

user output
(empty)

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 (Sofie Fu)

2024-03-19 23:15:58 1002024-03-19 23:15:01 1002024-03-19 23:08:26 02024-03-19 18:57:26 02024-03-19 18:56:17 02024-03-19 18:46:00 172024-03-19 18:24:58 02024-03-19 17:53:29 42024-03-19 17:49:08 42024-03-19 17:47:30 02024-03-19 17:45:31 172024-03-18 19:55:44 92024-03-18 18:55:55 92024-03-18 18:55:42 2024-03-18 18:54:03 92024-03-18 18:53:21 02024-03-18 18:50:49 02024-03-13 18:38:57 172024-03-13 18:32:55 92024-03-13 18:24:44 92024-03-06 20:00:13 92024-03-06 19:58:53 92024-03-06 19:58:48 92024-03-06 19:58:48 92024-03-06 19:56:50 92024-03-06 19:35:56 02024-03-06 19:05:39 92024-03-06 19:03:21 92024-03-06 19:00:50 92024-03-06 18:48:55 92024-03-06 18:47:22 92024-03-06 18:43:50 92024-03-06 18:35:53 42024-03-06 18:34:47 02024-03-06 18:16:58 02024-03-06 17:50:29 02024-03-06 17:44:08 02024-03-06 17:42:23 02024-03-06 17:40:48 02024-03-06 17:37:36 02024-03-06 17:35:31 02024-03-06 17:27:07 0