CSES - NOI 2024

CSES - NOI 2024 - Results

Submission details
Task:	Chair Game
Sender:	Erik Hedin
Submission time:	2024-03-12 00:35:19 +0200
Language:	C++ (C++17)
Status:	READY
Result:	37

Feedback
group	verdict	score
#1	ACCEPTED	8
#2	ACCEPTED	5
#3	ACCEPTED	4
#4	TIME LIMIT EXCEEDED	0
#5	TIME LIMIT EXCEEDED	0
#6	TIME LIMIT EXCEEDED	0
#7	ACCEPTED	20
#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	ACCEPTED	0.01 s	7, 8	details
#7	ACCEPTED	0.05 s	7, 8	details
#8	ACCEPTED	0.89 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.13 s	3, 4, 5, 6, 8	details
#13	ACCEPTED	0.01 s	4, 5, 6, 7, 8	details
#14	TIME LIMIT EXCEEDED	--	4, 5, 6, 8	details
#15	TIME LIMIT EXCEEDED	--	4, 5, 6, 8	details
#16	TIME LIMIT EXCEEDED	--	4, 5, 6, 8	details
#17	ACCEPTED	0.01 s	5, 6, 7, 8	details
#18	ACCEPTED	0.09 s	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.02 s	6, 7, 8	details
#23	TIME LIMIT EXCEEDED	--	6, 8	details
#24	TIME LIMIT EXCEEDED	--	6, 8	details
#25	ACCEPTED	0.08 s	8	details
#26	TIME LIMIT EXCEEDED	--	8	details
#27	ACCEPTED	0.05 s	3, 4, 5, 6, 8	details
#28	ACCEPTED	0.05 s	8	details
#29	TIME LIMIT EXCEEDED	--	8	details
#30	TIME LIMIT EXCEEDED	--	8	details

Code

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#include <queue>
#include <random>

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 vector<bool> vb;
typedef vector<vb> vvb;

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

const ll MAXN = 100;

mt19937 mt;

ll n;
deque<ll> chairs;
bool hit[MAXN];
bool used[MAXN];
ll answ[MAXN];
set<pll> pq;
ll cnt[MAXN + 1]; // how many of each chair is left
ll options[MAXN]; // number of options left for chair from pos
bool open[MAXN][MAXN + 1]; // if chair is usable from pos

vll P;
ll rP[MAXN];

ll DFS_reps;
ll DFS_reps_bound;

bool DFS(const ll& rdepth) {
    if (rdepth == 0) return true;
    if (pq.begin()->first == 0) return false;

    const ll p = rP[pq.begin()->second];
    pq.erase(pq.begin());

    //cout << "DFS(" << p << ", " << rdepth << ")" << endl;

    // check all options in chairs, then
    rep(i, 0, rdepth) {

        ll chair = chairs.front();
        chairs.pop_front();

        if (!hit[(p + chair) % n]) {
            // apply (p, chair)
            hit[(p + chair) % n] = true;
            used[p] = true;

            // using chair
            if (--cnt[chair] == 0) {
                rep(i, 0, n) {
                    if (open[i][chair] && !used[i]) {
                        pq.erase(mp(options[i], P[i]));
                        options[i]--;
                        open[i][chair] = false;
                        pq.insert(mp(options[i], P[i]));
                    }
                }
            }

            // jumping to (p + chair) % n
            rep(i, 0, rdepth - 1) {
                ll c = chairs.front();
                chairs.pop_front();
                ll oth = (p + chair + n - c) % n;
                //cout << oth << " " << c << " " << p << " " << chair << endl;
                if (open[oth][c] && !used[oth]) {
                    pq.erase(mp(options[oth], P[oth]));
                    options[oth]--;
                    open[oth][c] = false;
                    pq.insert(mp(options[oth], P[oth]));
                }
                chairs.pb(c);
            }

            // check for solution
            if (DFS(rdepth - 1)) {
                answ[p] = chair;
                return true;
            }
            // check if we may be stuck and should return
            if (++DFS_reps > DFS_reps_bound) return false;

            // undo using chair
            if (cnt[chair]++ == 0) {
                rep(i, 0, n) {
                    if (!hit[(i + chair) % n] && !used[i]) {
                        pq.erase(mp(options[i], P[i]));
                        options[i]++;
                        open[i][chair] = true;
                        pq.insert(mp(options[i], P[i]));
                    }
                }
            }

            // undo jumping to (p + chair) % n
            rep(i, 0, rdepth - 1) {
                ll c = chairs.front();
                chairs.pop_front();
                ll oth = (p + chair + n - c) % n;
                if (!open[oth][c] && !used[oth]) {
                    pq.erase(mp(options[oth], P[oth]));
                    options[oth]++;
                    open[oth][c] = true;
                    pq.insert(mp(options[oth], P[oth]));
                }
                chairs.pb(c);
            }

            // undo (p, chair)
            hit[(p + chair) % n] = false;
            used[p] = false;
        }

        chairs.pb(chair);
    }

    //cout << "leave DFS(" << p << ", " << rdepth << ")" << endl;

    pq.insert(mp(options[p], P[p]));
    return false;
}

void solve() {
    cin >> n;
    vll s(n);
    rep(i, 0, n) cin >> s[i];

    if (accumulate(s.begin(), s.end(), 0LL) % n) {
        cout << "NO\n";
        return;
    }

    DFS_reps_bound = n;

    // clear previos data
    do {
        chairs.clear();
        chairs.shrink_to_fit();
        rep(i, 0, n) {
            hit[i] = false;
            used[i] = false;
            cnt[i + 1] = 0;
            options[i] = 0;
        }
        pq.clear();
        P.clear();

        // initialize data
        shuffle(s.begin(), s.end(), mt);
        rep(i, 0, n) chairs.pb(s[i]);

        rep(i, 0, n) cnt[s[i]]++;
        rep(i, 0, n) rep(j, 1, n + 1) open[i][j] = cnt[j];
        rep(i, 0, n) rep(j, 1, n + 1) options[i] += open[i][j];

        rep(i, 0, n) pq.insert(mp(options[i], i));

        rep(i, 0, n) P.pb(i);
        shuffle(P.begin(), P.end(), mt);
        rep(i, 0, n) rP[P[i]] = i;

        // DFS
        DFS_reps = 0;
        DFS_reps_bound += DFS_reps_bound / 2; // *=1.5
    } while (!DFS(n));

    // answer
    cout << "YES\n";
    rep(i, 0, n) cout << answ[i] << " ";
    cout << "\n";
}

int main() {
    cin.tie(NULL)->sync_with_stdio(false);

    random_device rd;
    mt.seed(rd());
    //mt.seed(0);

    ll testcases;
    cin >> testcases;
    rep(testcase, 0, testcases) {
        solve();
        cout << flush;
    }

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

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
`YES 8 12 13 9 16 2 11 2 2 5 6 16 9...` 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 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: 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: TIME LIMIT EXCEEDED

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

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

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

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

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

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 (Erik Hedin)