CSES - NOI 2024 - Results
Submission details
Task:Chair Game
Sender:Veikko Heikkinen
Submission time:2024-03-06 18:41:29 +0200
Language:C++ (C++20)
Status:READY
Result:17
Feedback
groupverdictscore
#1ACCEPTED8
#2ACCEPTED5
#3ACCEPTED4
#40
#50
#60
#70
#80
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 7, 8details
#2ACCEPTED0.00 s1, 7, 8details
#3ACCEPTED0.01 s1, 7, 8details
#4ACCEPTED0.01 s1, 7, 8details
#5ACCEPTED0.01 s1, 7, 8details
#60.00 s7, 8details
#70.00 s7, 8details
#8ACCEPTED0.01 s2, 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
#130.01 s4, 5, 6, 7, 8details
#140.01 s4, 5, 6, 8details
#150.01 s4, 5, 6, 8details
#160.01 s4, 5, 6, 8details
#170.01 s5, 6, 7, 8details
#180.01 s5, 6, 8details
#19ACCEPTED0.01 s5, 6, 8details
#200.01 s5, 6, 8details
#21ACCEPTED0.00 s1, 6, 7, 8details
#220.01 s6, 7, 8details
#230.01 s6, 8details
#240.01 s6, 8details
#250.01 s8details
#260.00 s8details
#27ACCEPTED0.01 s3, 4, 5, 6, 8details
#280.00 s8details
#290.00 s8details
#300.00 s8details

Code

#include <bits/stdc++.h>

#define debug(x) cout << #x << ": " << x << endl
#define all(x) begin(x),end(x)
#define rall(x) rbegin(x),rend(x)
#define fi first
#define se second

using namespace std;
using ll = long long;
using pii = pair<int, int>;

void solve() {
    int n;
    cin >> n;
    
    vector<int> v(n);
    vector<bool> has(n+1, 0);
    
    int s = 0;
    bool uniq = 1;
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
        s += v[i];
        uniq &= !has[v[i]];
        has[v[i]] = 1;
    }
    
    if (s % n != 0) {
        cout << "NO\n";
        return;
    }
    
    cout << "YES\n";
    if (n <= 8) {
        sort(all(v));
        vector<int> p(n);
        iota(all(p), 0);
        do {
            vector<int> q(n);
            for (int i = 0; i < n; ++i) q[i] = (i + v[i]) % n;
            sort(all(q));
            if (p == q) {
                for (int i = 0; i < n; ++i) cout << v[i] << " \n"[i == n-1];
                return;
            }
        } while (next_permutation(all(v)));
    } else if (uniq) {
        for (int i = 1; i <= n; ++i) cout << i << " \n"[i == n];
    } else {
        int k = 3;
        int f[10] = {};
        for (int i : v) ++f[i];
        for (int i = 1; i <= k; ++i) {
            bool g = 1;
            for (int j = 1; j < k; ++j) g &= f[(i+j-1) % k + 1] == 0;
            if (g) {
                for (int j = 1; j <= n; ++j) cout << i << " \n"[j == n];
                return;
            }
        }
        if (f[1] != f[3]) {
            cout << "NO\n";
            return;
        }
        cout << "YES\n";
        for (int i = 0; i < f[1]; ++i) cout << "3 1 ";
        for (int i = 0; i < f[2]; ++i) cout << "2 ";
        cout << '\n';
    }
}

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    
    int t;
    cin >> t;
    while (t--) solve();
    
    return 0;
}

Test details

Test 1

Group: 1, 7, 8

Verdict: ACCEPTED

input
637
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

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
...

correct output
YES
1 1 1 1 1 1 1 
YES
1 1 1 1 2 7 1 
YES
...

user output
YES
1 1 1 1 1 1 1
YES
1 1 1 1 1 2 7
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
...

correct output
YES
1 1 1 1 1 1 1 1 
YES
1 1 2 8 1 1 1 1 
YES
...

user output
YES
1 1 1 1 1 1 1 1
YES
1 1 1 1 1 1 2 8
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
...

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

user output
NO
YES
1 2 2 5 6 2 8 6
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
...

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

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

Test 6

Group: 7, 8

Verdict:

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

correct output
NO
NO
NO
NO
NO
...

user output
(empty)

Error:
*** stack smashing detected ***: terminated

Test 7

Group: 7, 8

Verdict:

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

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

user output
(empty)

Error:
*** stack smashing detected ***: terminated

Test 8

Group: 2, 8

Verdict: ACCEPTED

input
1000
1
1
2
1 2
...

correct output
YES

NO
YES
3 1 2 
...

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
...

correct output
YES

YES
1 1 
YES
...

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
...

correct output
YES

YES
1 1 
YES
...

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 ...

correct output
NO
NO
NO
NO
NO
...

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 ...

correct output
YES
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

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
...

correct output
YES

YES
1 1 
YES
...

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

Test 14

Group: 4, 5, 6, 8

Verdict:

input
979
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

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

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 ...

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...
Truncated

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 ...

correct output
YES
2 2 2 3 1 2 3 1 2 3 1 3 1 3 1 ...

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

Test 17

Group: 5, 6, 7, 8

Verdict:

input
980
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

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

Test 18

Group: 5, 6, 8

Verdict:

input
947
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

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

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 ...

correct output
NO
NO
NO
NO
NO
...

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 ...

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

user output
YES
NO
YES
NO
YES
...
Truncated

Test 21

Group: 1, 6, 7, 8

Verdict: ACCEPTED

input
715
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

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

Test 22

Group: 6, 7, 8

Verdict:

input
843
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

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

Test 23

Group: 6, 8

Verdict:

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

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 24

Group: 6, 8

Verdict:

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

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

user output
YES
NO
YES
NO
YES
...
Truncated

Test 25

Group: 8

Verdict:

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

correct output
NO
NO
NO
NO
NO
...

user output
(empty)

Error:
*** stack smashing detected ***: terminated

Test 26

Group: 8

Verdict:

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

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

user output
(empty)

Error:
*** stack smashing detected ***: terminated

Test 27

Group: 3, 4, 5, 6, 8

Verdict: ACCEPTED

input
1000
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

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

Test 28

Group: 8

Verdict:

input
1000
1
1
2
2 2
...

correct output
YES

YES
2 2 
YES
...

user output
(empty)

Error:
*** stack smashing detected ***: terminated

Test 29

Group: 8

Verdict:

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

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

user output
(empty)

Error:
*** stack smashing detected ***: terminated

Test 30

Group: 8

Verdict:

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

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

user output
(empty)