— 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-13 18:32:55 +0200
Language:C++11
Status:READY
Result:9
Feedback
groupverdictscore
#10
#2ACCEPTED5
#3ACCEPTED4
#40
#50
#60
#70
#80
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1, 7, 8details
#2ACCEPTED0.01 s1, 7, 8details
#3ACCEPTED0.03 s1, 7, 8details
#4--1, 7, 8details
#5ACCEPTED0.04 s1, 7, 8details
#60.01 s7, 8details
#70.01 s7, 8details
#8ACCEPTED0.07 s2, 8details
#9ACCEPTED0.05 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.23 s4, 5, 6, 7, 8details
#140.01 s4, 5, 6, 8details
#150.01 s4, 5, 6, 8details
#160.01 s4, 5, 6, 8details
#170.84 s5, 6, 7, 8details
#180.01 s5, 6, 8details
#19ACCEPTED0.01 s5, 6, 8details
#200.01 s5, 6, 8details
#21ACCEPTED0.20 s1, 6, 7, 8details
#220.01 s6, 7, 8details
#230.01 s6, 8details
#240.01 s6, 8details
#250.02 s8details
#260.02 s8details
#27ACCEPTED0.01 s3, 4, 5, 6, 8details
#280.01 s8details
#290.02 s8details
#300.02 s8details

Code

#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define uset unordered_set
#define vo vector
#define pb push_back
#define sz(x) x.size()
#define fi first 
#define se second
typedef long long ll;
typedef pair<int ,int> pii;
typedef vo<int> vi;
#define all(x) x.begin(), x.end()
 
#define rep(i, a, b) for(ll i=(a); i<(b); i++)
#define pr(x) cout << #x << " " << x << endl;
ll const inf = LLONG_MAX, mxn = 104;
int n, t, arr[mxn], taken[mxn], ans[mxn];
vo<vi> seq;
// gör en dp
 
bool solve(vi &v){
    rep(i, 0, n){
        cout << v[i] << " ";
    } cout << endl;

    rep(i, 0, n){
        cout << taken[i] << " ";
    } cout << endl;
    rep(i, 0, n){
        int pos = (i+arr[v[i]])%n;
        pr(i)
        pr(v[i])
        pr(arr[v[i]])
        pr(pos)
        if(taken[pos]) return 0;
        taken[pos] = 1;
    }
    return 1;
}
 
void generate(int pos, vi &used){
    if(pos==n){
        return;
    }
    rep(i, 0, n){
        if(!used[i]){
            used[i] = 1;
            if(pos==0){
                seq.pb({});
            }
            seq.back().pb(i);
            generate(pos+1, used);
            used[i] = 0;
        }
    }
}
 
void succ(){
    cout << "YES" << "\n";
    rep(i, 0, n){
        cout << ans[i] << " ";
    } 
    cout << "\n";
}
 
void fail(){
    cout << "NO" << "\n";
}

void solve(){
    cin>>n; seq.clear(); 
    int subtask3 = 1, subtask2 = 1, ct3=0, ct1=0;
    uset<int> perm;
    rep(i, 0, n){
        cin>>arr[i];
        if(arr[i] > 2) subtask3 = 0;
        if(perm.count(arr[i])) {
            subtask2 = 0;
        }
        perm.insert(arr[i]);
        if(arr[i]==3) ct3++;
        if(arr[i]==1) ct1++;
    }
    if(n<=8){
        vi cmpr(n); rep(i, 0, n) cmpr[i] = i;
        do{
            vi taken(n, 0);
            rep(i, 0, n) {
                taken[(i+arr[cmpr[i]])%n]++;
            }
            if(find(all(taken), 0) != taken.end()) continue;
            cout << "YES" << "\n";
            rep(i, 0, n) cout << arr[cmpr[i]] << " \n"[i==n-1];
            return;
        } while(next_permutation(all(cmpr)));
        cout << "NO" << "\n";
    }
    else if(subtask3){
        int p = arr[0], allsame = 1; 
        rep(i, 0, n){
            if(arr[i] != p) allsame = 0;
        }

        if(allsame){
            rep(i, 0, n) ans[i] = arr[i];
            succ();
        }
        else fail();
    }
    else if(subtask2){
        if(n%2==0){
            fail();
        }
        else{
            int prev = n;
            rep(i, 0, n){
                ans[i] = prev;
                prev -= 2;
                if(prev <= 0){
                    prev = n-1;
                }
            }
            succ();
        }
    }
    else{
        if(ct3==1){
            if(n-1 - ct1 % 2){
                rep(i, 0, n){
                    if(i < n-1-ct1){
                        ans[i] = 2;
                    }
                    else if(i==n-1-ct1) ans[i] = 3;
                    else{
                        ans[i] = 1;
                    }
                }
                succ();
            }
            else{
                fail();
            }
        }
        else{
            if(ct3==n){
                rep(i, 0, n) ans[i] = arr[i];
                succ();
            }
            else fail();
        }
    }
}
 
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    cin>>t;
 
    rep(_, 0, t){
        solve();
    }
 
}

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 2 7 1 1 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:

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: 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 2 3 7 8 2
YES
4 1 5 3 5 3 7 4
YES
...
Truncated

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
NO
YES
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
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
NO
YES
2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 ...
Truncated

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
3 1 2
...
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
YES
1
YES
1 1
YES
...
Truncated

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

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

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

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

user output
NO
NO
NO
NO
NO
...
Truncated

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

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

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

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

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

user output
NO
NO
NO
NO
NO
...
Truncated

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
NO
NO
NO
YES
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
Truncated

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

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:

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
YES
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
Truncated

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
NO
NO
YES
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
Truncated

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