CSES - NOI 2024

CSES - NOI 2024 - Results

Submission details
Task:	Chair Game
Sender:	Victor Vatn
Submission time:	2024-03-06 19:46:05 +0200
Language:	C++ (C++17)
Status:	READY
Result:	24

Feedback
group	verdict	score
#1	ACCEPTED	8
#2	ACCEPTED	5
#3	ACCEPTED	4
#4	ACCEPTED	7
#5	TIME LIMIT EXCEEDED	0
#6	TIME LIMIT EXCEEDED	0
#7	TIME LIMIT EXCEEDED	0
#8	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 7, 8	details
#2	ACCEPTED	0.01 s	1, 7, 8	details
#3	ACCEPTED	0.01 s	1, 7, 8	details
#4	ACCEPTED	0.01 s	1, 7, 8	details
#5	ACCEPTED	0.01 s	1, 7, 8	details
#6	TIME LIMIT EXCEEDED	--	7, 8	details
#7	TIME LIMIT EXCEEDED	--	7, 8	details
#8	ACCEPTED	0.01 s	2, 8	details
#9	ACCEPTED	0.01 s	3, 4, 5, 6, 8	details
#10	ACCEPTED	0.01 s	3, 4, 5, 6, 8	details
#11	ACCEPTED	0.01 s	3, 4, 5, 6, 8	details
#12	ACCEPTED	0.02 s	3, 4, 5, 6, 8	details
#13	ACCEPTED	0.01 s	4, 5, 6, 7, 8	details
#14	ACCEPTED	0.01 s	4, 5, 6, 8	details
#15	ACCEPTED	0.01 s	4, 5, 6, 8	details
#16	ACCEPTED	0.02 s	4, 5, 6, 8	details
#17	ACCEPTED	0.01 s	5, 6, 7, 8	details
#18	TIME LIMIT EXCEEDED	--	5, 6, 8	details
#19	ACCEPTED	0.01 s	5, 6, 8	details
#20	TIME LIMIT EXCEEDED	--	5, 6, 8	details
#21	ACCEPTED	0.01 s	1, 6, 7, 8	details
#22	ACCEPTED	0.51 s	6, 7, 8	details
#23	TIME LIMIT EXCEEDED	--	6, 8	details
#24	TIME LIMIT EXCEEDED	--	6, 8	details
#25	TIME LIMIT EXCEEDED	--	8	details
#26	TIME LIMIT EXCEEDED	--	8	details
#27	ACCEPTED	0.02 s	3, 4, 5, 6, 8	details
#28	ACCEPTED	0.02 s	8	details
#29	TIME LIMIT EXCEEDED	--	8	details
#30	TIME LIMIT EXCEEDED	--	8	details

Code

// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize ("Ofast,inline") // O1 - O2 - O3 - Os - Ofast
// #pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
 
using namespace std;
 
#define rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define per(i, a, b) for (ll i = (b) - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)
 
#define all(x) x.begin(), x.end()
#define sz(x) (ll)x.size()
#define pb push_back
#define debug(x) cout<<#x<<" = "<<x<<endl
 
#define umap unordered_map
#define uset unordered_set
 
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
 
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<ll,pll> ppll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vll> vvll;
 
const ll INF = 1'000'000'007;
 
ll tc;
ll n;
ll m;

ll dp();

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
 
 
 
    cin>>tc;
    while(tc--) {
        cin>>n;
        vll s(n);
        ll sum=0;
        m=0;
        rep(i,0,n) {
            cin>>s[i];
            sum+=s[i];
            m=max(m,s[i]);
        }
 
        if(sum%n) {
            cout<<"NO"<<endl;
            continue;
        }

        cout<<"YES"<<endl;

        if(m==3) {
            ll ones=0,twos=0,threes=0;
            rep(i,0,n) {
                if(s[i]==1) ++ones;
                if(s[i]==2) ++twos;
                if(s[i]==3) ++threes;
            }

            if(ones==threes) {
                if(!ones) {
                    rep(i,0,n) cout<<2<<' ';
                    cout<<endl;

                } else {
                    --ones;
                    cout<<1<<' ';
                    rep(i,0,twos) cout<<2<<' ';
                    cout<<3<<' ';
                    rep(i,0,ones) cout<<1<<' '<<3<<' ';
                }
                continue;
            }
        }

        sort(all(s));
        bool has_sol=0;
        do {
            has_sol=1;
            vll cnt(n,0);
            rep(i,0,n) if(cnt[(i+s[i])%n]++) has_sol=0;
            if(has_sol) break;

        } while(next_permutation(all(s)));

        assert(has_sol);
        trav(num,s) cout<<num<<' ';
        cout<<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 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 ...` 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 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 ...` view save

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

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 ...` 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 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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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 NO ...` 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: ACCEPTED

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

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

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

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

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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)

NOI 2024

Chair Game

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Tasks

Submissions (Victor Vatn)