oj.uz

Submission #108969

# Submission time Handle Problem Language Result Execution time Memory
108969 2019-05-03T11:36:56 Z PeppaPig Amusement Park (JOI17_amusement_park) C++14
28 / 100
 94 ms 24544 KB 
#include "Joi.h"
#include <bits/stdc++.h>

#define long long long
#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 1e4+5;

static vector<int> g[N];
static vector<pii> init;
static int pre[N], pos[N];

static void dfs(int u, int p) {
    static int idx = 0;
    pre[u] = idx++;
    for(int v : g[u]) if(v != p) dfs(v, u);
}

static void gen_tree(int n, int m, int A[], int B[]) {
    int par[N]; iota(par, par+N, 0);
    vector<pii> E;
    
    function<int(int)> find = [&](int x) { return par[x] = x == par[x] ? x : find(par[x]); };

    for(int i = 0; i < m; i++) {
        if(A[i] > B[i]) swap(A[i], B[i]);
        E.emplace_back(A[i], B[i]);
    }
    sort(E.begin(), E.end());

    vector<pii> ret;
    for(pii e : E) {
        int a, b; tie(a, b) = e;
        if(find(a) != find(b)) {
            par[find(a)] = find(b);
            g[a].emplace_back(b), g[b].emplace_back(a);
            ret.emplace_back(a, b);
        }
    } 
    dfs(0, 0);
    for(int i = 0; i < n; i++) if(pre[i] < 60) pos[i] = pre[i];
    for(pii e : ret) {
        int a, b; tie(a, b) = e;
        if(pre[a] < 60 && pre[b] < 60) init.emplace_back(a, b);
    }
}

static int deg[N];
static vector<pii> t[N];

static void extend_tree(int u, int p) {
    if(pre[u] < 60) return;
    vector<pii> v = t[p];
    for(pii e : v) {
        int a, b; tie(a, b) = e;
        ++deg[a], ++deg[b];
    }
    int leaf;
    for(pii e : v) {
        int a, b; tie(a, b) = e;
        if(deg[a] > deg[b]) swap(a, b);
        if(deg[a] == 1) { leaf = a; break; }
    }
    pos[u] = pos[leaf];
    for(pii e : v) {
        int a, b; tie(a, b) = e;
        --deg[a], --deg[b];
        if(a == leaf || b == leaf) continue;
        t[u].emplace_back(a, b);
    }
    t[u].emplace_back(u, p);
    for(int v : g[u]) if(v != p) extend_tree(v, u);
}

void Joi(int n, int m, int A[], int B[], long x, int T) {
    gen_tree(n, m, A, B);

    for(int i = 0; i < n; i++) if(pre[i] < 60) t[i] = init;
    for(int i = 0; i < n; i++) if(pre[i] < 60) for(int v : g[i]) extend_tree(v, i);
    for(int i = 0; i < n; i++) MessageBoard(i, x >> pos[i] & 1);
}

#include "Ioi.h"
#include <bits/stdc++.h>

#define long long long
#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 1e4+5;

static vector<int> g[N];
static vector<pii> init;
static int pre[N], pos[N];

static void dfs(int u, int p) {
    static int idx = 0;
    pre[u] = idx++;
    for(int v : g[u]) if(v != p) dfs(v, u);
}

static void gen_tree(int n, int m, int A[], int B[]) {
    int par[N]; iota(par, par+N, 0);
    vector<pii> E;
    
    function<int(int)> find = [&](int x) { return par[x] = x == par[x] ? x : find(par[x]); };

    for(int i = 0; i < m; i++) {
        if(A[i] > B[i]) swap(A[i], B[i]);
        E.emplace_back(A[i], B[i]);
    }
    sort(E.begin(), E.end());

    vector<pii> ret;
    for(pii e : E) {
        int a, b; tie(a, b) = e;
        if(find(a) != find(b)) {
            par[find(a)] = find(b);
            g[a].emplace_back(b), g[b].emplace_back(a);
            ret.emplace_back(a, b);
        }
    } 
    dfs(0, 0);
    for(int i = 0; i < n; i++) if(pre[i] < 60) pos[i] = pre[i];
    for(pii e : ret) {
        int a, b; tie(a, b) = e;
        if(pre[a] < 60 && pre[b] < 60) init.emplace_back(a, b);
    }
}

static int deg[N];
static vector<pii> t[N];

static void extend_tree(int u, int p) {
    if(pre[u] < 60) return;
    vector<pii> v = t[p];
    for(pii e : v) {
        int a, b; tie(a, b) = e;
        ++deg[a], ++deg[b];
    }
    int leaf;
    for(pii e : v) {
        int a, b; tie(a, b) = e;
        if(deg[a] > deg[b]) swap(a, b);
        if(deg[a] == 1) { leaf = a; break; }
    }
    pos[u] = pos[leaf];
    for(pii e : v) {
        int a, b; tie(a, b) = e;
        --deg[a], --deg[b];
        if(a == leaf || b == leaf) continue;
        t[u].emplace_back(a, b);
    }
    t[u].emplace_back(u, p);
    for(int v : g[u]) if(v != p) extend_tree(v, u);
}

static long ans;
static bitset<N> chk;

static void get_ans(int u, int p) {
    for(int v : g[u]) if(v != p && chk[v]) {
        int nex = Move(v);
        if(nex) ans += 1ll << pos[v];
        get_ans(v, u);
        Move(u);
    }
}

long Ioi(int n, int m, int A[], int B[], int P, int V, int T) {
    gen_tree(n, m, A, B);

    for(int i = 0; i < n; i++) if(pre[i] < 60) t[i] = init;
    for(int i = 0; i < n; i++) if(pre[i] < 60) for(int v : g[i]) extend_tree(v, i);

    if(V) ans += 1ll << pos[P];
    for(pii e : t[P]) {
        int a, b; tie(a, b) = e;
        chk[a] = chk[b] = true;
    }
    get_ans(P, P);

    return ans;
}

Compilation message

Joi.cpp: In function 'void extend_tree(int, int)':
Joi.cpp:68:22: warning: 'leaf' may be used uninitialized in this function [-Wmaybe-uninitialized]
     pos[u] = pos[leaf];
              ~~~~~~~~^

Ioi.cpp: In function 'void extend_tree(int, int)':
Ioi.cpp:68:22: warning: 'leaf' may be used uninitialized in this function [-Wmaybe-uninitialized]
     pos[u] = pos[leaf];
              ~~~~~~~~^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1792 KB Output is correct
2 Correct 6 ms 1920 KB Output is correct
3 Correct 8 ms 2180 KB Output is correct
4 Correct 6 ms 1792 KB Output is correct
5 Correct 7 ms 2056 KB Output is correct
6 Correct 6 ms 2184 KB Output is correct
7 Correct 8 ms 2288 KB Output is correct
8 Correct 7 ms 2052 KB Output is correct
9 Correct 12 ms 2208 KB Output is correct
10 Correct 6 ms 1792 KB Output is correct
11 Correct 8 ms 2224 KB Output is correct
12 Correct 6 ms 1928 KB Output is correct
13 Correct 7 ms 2052 KB Output is correct
14 Correct 8 ms 2180 KB Output is correct
15 Correct 6 ms 2052 KB Output is correct
16 Correct 8 ms 2188 KB Output is correct
17 Correct 7 ms 2052 KB Output is correct
18 Correct 5 ms 2032 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 14336 KB Output is correct
2 Correct 72 ms 14592 KB Output is correct
3 Correct 90 ms 14456 KB Output is correct
4 Correct 68 ms 13720 KB Output is correct
5 Correct 65 ms 18592 KB Output is correct
6 Correct 80 ms 17084 KB Output is correct
7 Correct 74 ms 17252 KB Output is correct
8 Correct 66 ms 17832 KB Output is correct
9 Correct 77 ms 17976 KB Output is correct
10 Correct 57 ms 13804 KB Output is correct
11 Correct 66 ms 14052 KB Output is correct
12 Correct 79 ms 12784 KB Output is correct
13 Correct 60 ms 12616 KB Output is correct
14 Correct 60 ms 13220 KB Output is correct
15 Correct 79 ms 13776 KB Output is correct
16 Correct 56 ms 13820 KB Output is correct
17 Correct 68 ms 13796 KB Output is correct
18 Correct 68 ms 13824 KB Output is correct
19 Correct 55 ms 13720 KB Output is correct
20 Correct 49 ms 18940 KB Output is correct
21 Correct 61 ms 18808 KB Output is correct
22 Correct 72 ms 16368 KB Output is correct
23 Correct 83 ms 17816 KB Output is correct
24 Correct 70 ms 16864 KB Output is correct
25 Correct 81 ms 17456 KB Output is correct
26 Correct 64 ms 18084 KB Output is correct
27 Correct 66 ms 18012 KB Output is correct
28 Correct 66 ms 18256 KB Output is correct
29 Correct 52 ms 16400 KB Output is correct
30 Correct 68 ms 16852 KB Output is correct
31 Correct 4 ms 1920 KB Output is correct
32 Correct 5 ms 1928 KB Output is correct
33 Correct 6 ms 2236 KB Output is correct
34 Correct 6 ms 2184 KB Output is correct
35 Correct 6 ms 1920 KB Output is correct
36 Correct 7 ms 1928 KB Output is correct
37 Correct 6 ms 1920 KB Output is correct
38 Correct 5 ms 1928 KB Output is correct
39 Correct 6 ms 1800 KB Output is correct
40 Correct 6 ms 1920 KB Output is correct
41 Correct 7 ms 2180 KB Output is correct
42 Correct 6 ms 1920 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1928 KB Output is correct
2 Correct 6 ms 1792 KB Output is correct
3 Correct 7 ms 2056 KB Output is correct
4 Correct 16 ms 5412 KB Output is correct
5 Correct 14 ms 5360 KB Output is correct
6 Correct 15 ms 5148 KB Output is correct
7 Correct 18 ms 5412 KB Output is correct
8 Correct 14 ms 5440 KB Output is correct
9 Correct 67 ms 24544 KB Output is correct
10 Correct 58 ms 24380 KB Output is correct
11 Correct 60 ms 24472 KB Output is correct
12 Correct 6 ms 1928 KB Output is correct
13 Correct 6 ms 1968 KB Output is correct
14 Correct 6 ms 1928 KB Output is correct
15 Correct 7 ms 1928 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 14320 KB Output is correct
2 Incorrect 86 ms 14392 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 14376 KB Output is correct
2 Correct 91 ms 14328 KB Output is correct
3 Correct 94 ms 14324 KB Output is correct
4 Correct 72 ms 13720 KB Output is correct
5 Incorrect 61 ms 22648 KB Wrong Answer [7]
6 Halted 0 ms 0 KB -