oj.uz

Submission #1065517

# Submission time Handle Problem Language Result Execution time Memory
1065517 2024-08-19T08:52:51 Z Jarif_Rahman Amusement Park (JOI17_amusement_park) C++17
74 / 100
 21 ms 4648 KB 
#include "Joi.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

namespace {
    const int N = 10000;
    const int k = 60;
    int n, m;
    vector<int> graph[N];
    vector<int> msg;

    int ls = 0;
    void dfs(int nd){
        if(msg[nd] != -1) return;
        msg[nd] = ls;
        ls++, ls%=k;
        for(int x: graph[nd]) dfs(x);
    }
}

void Joi(int _n, int _m, int A[], int B[], ll X, int T){
    n = _n, m = _m;
    for(int i = 0; i < m; i++){
        graph[A[i]].push_back(B[i]);
        graph[B[i]].push_back(A[i]);
    }

    vector<int> bin;
    for(int i = 0; i < k; i++){
        bin.push_back(X%2);
        X/=2;
    }

    msg.assign(n, -1);
    dfs(0);
    for(int i = 0; i < n; i++) MessageBoard(i, bin[msg[i]]);
}
#include "Ioi.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

namespace {
    const int N = 10000;
    const int k = 60;
    int n, m;
    vector<int> graph[N];
    vector<int> tree[N];
    vector<int> msg;

    int ls = 0;
    void dfs(int nd){
        if(msg[nd] != -1) return;
        msg[nd] = ls;
        ls++, ls%=k;
        for(int x: graph[nd]) dfs(x);
    }
}

ll Ioi(int _n, int _m, int A[], int B[], int p, int v, int T){
    n = _n, m = _m;
    for(int i = 0; i < m; i++){
        graph[A[i]].push_back(B[i]);
        graph[B[i]].push_back(A[i]);
    }

    msg.assign(n, -1);
    dfs(0);

    vector<bool> done(k, 0);
    int left = k;
    vector<bool> bl(n, 0);

    done[msg[p]] = 1;
    left--;
    bl[p] = 1;

    vector<pair<int, int>> nxt;
    for(int x: graph[p]) if(!bl[x]){
        bl[x] = 1;
        nxt.push_back({x, p});
    }

    while(left){
        int nd = -1, ss = -1;
        for(int i = int(nxt.size())-1; i >= 0; i--) if(!done[msg[nxt[i].first]]){
            tie(nd, ss) = nxt[i];
            nxt.erase(nxt.begin()+i);
            break;
        }
        if(nd == -1){
            assert(!nxt.empty());
            tie(nd, ss) = nxt.back();
            nxt.pop_back();
        }

        if(!done[msg[nd]]) left--;
        done[msg[nd]] = 1;
        bl[nd] = 1;

        tree[ss].push_back(nd);

        for(int x: graph[nd]) if(!bl[x]){
            bl[x] = 1;
            nxt.push_back({x, nd});
        }
    }

    vector<int> bin(k);
    bin[msg[p]] = v;

    function<void(int)> dfs2 = [&](int nd){
        for(int x: tree[nd]){
            bin[msg[x]] = Move(x);
            dfs2(x);
            Move(nd);
        }
    };

    dfs2(p);

    ll X = 0;
    for(int i = 0; i < k; i++) if(bin[i]) X+=(1LL<<i);
    return X;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1548 KB Output is correct
2 Correct 0 ms 1556 KB Output is correct
3 Correct 1 ms 1564 KB Output is correct
4 Correct 1 ms 1564 KB Output is correct
5 Correct 1 ms 1552 KB Output is correct
6 Correct 1 ms 1556 KB Output is correct
7 Correct 2 ms 1564 KB Output is correct
8 Correct 1 ms 1564 KB Output is correct
9 Correct 2 ms 1636 KB Output is correct
10 Correct 0 ms 1552 KB Output is correct
11 Correct 3 ms 1888 KB Output is correct
12 Correct 0 ms 1564 KB Output is correct
13 Correct 0 ms 1568 KB Output is correct
14 Correct 1 ms 1572 KB Output is correct
15 Correct 2 ms 1564 KB Output is correct
16 Correct 1 ms 1572 KB Output is correct
17 Correct 2 ms 1564 KB Output is correct
18 Correct 2 ms 1572 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 4196 KB Output is correct
2 Correct 20 ms 4568 KB Output is correct
3 Correct 15 ms 4632 KB Output is correct
4 Correct 11 ms 3128 KB Output is correct
5 Correct 9 ms 3388 KB Output is correct
6 Correct 10 ms 3384 KB Output is correct
7 Correct 11 ms 3388 KB Output is correct
8 Correct 9 ms 3388 KB Output is correct
9 Correct 9 ms 3380 KB Output is correct
10 Correct 9 ms 3388 KB Output is correct
11 Correct 9 ms 3380 KB Output is correct
12 Correct 7 ms 3116 KB Output is correct
13 Correct 12 ms 3108 KB Output is correct
14 Correct 9 ms 3116 KB Output is correct
15 Correct 12 ms 3300 KB Output is correct
16 Correct 9 ms 3128 KB Output is correct
17 Correct 12 ms 3124 KB Output is correct
18 Correct 12 ms 3136 KB Output is correct
19 Correct 12 ms 3124 KB Output is correct
20 Correct 7 ms 3380 KB Output is correct
21 Correct 7 ms 3384 KB Output is correct
22 Correct 10 ms 3124 KB Output is correct
23 Correct 11 ms 3384 KB Output is correct
24 Correct 9 ms 3140 KB Output is correct
25 Correct 9 ms 3388 KB Output is correct
26 Correct 9 ms 3388 KB Output is correct
27 Correct 9 ms 3392 KB Output is correct
28 Correct 12 ms 3384 KB Output is correct
29 Correct 9 ms 3104 KB Output is correct
30 Correct 9 ms 3120 KB Output is correct
31 Correct 2 ms 1552 KB Output is correct
32 Correct 1 ms 1556 KB Output is correct
33 Correct 1 ms 1556 KB Output is correct
34 Correct 1 ms 1548 KB Output is correct
35 Correct 1 ms 1556 KB Output is correct
36 Correct 1 ms 1552 KB Output is correct
37 Correct 0 ms 1556 KB Output is correct
38 Correct 1 ms 1556 KB Output is correct
39 Correct 1 ms 1568 KB Output is correct
40 Correct 0 ms 1564 KB Output is correct
41 Correct 1 ms 1552 KB Output is correct
42 Correct 0 ms 1568 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1552 KB Output is correct
2 Correct 1 ms 1552 KB Output is correct
3 Correct 1 ms 1568 KB Output is correct
4 Correct 2 ms 1856 KB Output is correct
5 Correct 2 ms 1860 KB Output is correct
6 Correct 2 ms 1856 KB Output is correct
7 Correct 2 ms 1856 KB Output is correct
8 Correct 3 ms 1856 KB Output is correct
9 Correct 7 ms 3640 KB Output is correct
10 Correct 10 ms 3644 KB Output is correct
11 Correct 9 ms 3636 KB Output is correct
12 Correct 1 ms 1568 KB Output is correct
13 Correct 0 ms 1568 KB Output is correct
14 Correct 0 ms 1556 KB Output is correct
15 Correct 1 ms 1568 KB Output is correct

Subtask #4
46.0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 21 ms 4284 KB Partially correct
2 Correct 19 ms 4592 KB Output is correct
3 Correct 18 ms 4640 KB Output is correct
4 Correct 9 ms 3204 KB Output is correct
5 Correct 9 ms 3640 KB Output is correct
6 Correct 14 ms 3392 KB Output is correct
7 Correct 10 ms 3648 KB Output is correct
8 Correct 9 ms 3140 KB Output is correct
9 Correct 9 ms 3384 KB Output is correct
10 Correct 8 ms 3388 KB Output is correct
11 Correct 11 ms 3388 KB Output is correct
12 Correct 8 ms 3356 KB Output is correct
13 Correct 8 ms 3100 KB Output is correct
14 Partially correct 7 ms 3124 KB Partially correct
15 Correct 9 ms 3140 KB Output is correct
16 Correct 9 ms 3348 KB Output is correct
17 Correct 12 ms 3132 KB Output is correct
18 Correct 9 ms 3080 KB Output is correct
19 Partially correct 13 ms 2992 KB Partially correct
20 Correct 7 ms 3376 KB Output is correct
21 Correct 10 ms 3388 KB Output is correct
22 Correct 10 ms 3392 KB Output is correct
23 Partially correct 9 ms 3392 KB Partially correct
24 Correct 13 ms 3384 KB Output is correct
25 Partially correct 11 ms 3384 KB Partially correct
26 Correct 9 ms 3392 KB Output is correct
27 Correct 11 ms 3388 KB Output is correct
28 Correct 9 ms 3368 KB Output is correct
29 Partially correct 8 ms 3112 KB Partially correct
30 Correct 10 ms 3116 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 4196 KB Output is correct
2 Correct 17 ms 4648 KB Output is correct
3 Correct 18 ms 4636 KB Output is correct
4 Correct 14 ms 3096 KB Output is correct
5 Correct 9 ms 3640 KB Output is correct
6 Correct 10 ms 3128 KB Output is correct
7 Correct 9 ms 3132 KB Output is correct
8 Correct 9 ms 3388 KB Output is correct
9 Incorrect 10 ms 3388 KB Output isn't correct
10 Halted 0 ms 0 KB -