oj.uz

Submission #108964

# Submission time Handle Problem Language Result Execution time Memory
108964 2019-05-03T11:27:04 Z PeppaPig Amusement Park (JOI17_amusement_park) C++14
28 / 100
 99 ms 24372 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 void get_ans(int u, int p, int bit) {
    if(bit) ans += 1ll << pos[u];
    for(int v : g[u]) if(v != p) {
      	int now = Move(v);
        get_ans(v, u, now);
        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);
    for(int i = 0; i < n; i++) g[i].clear();

    for(pii e : t[P]) g[e.x].emplace_back(e.y), g[e.y].emplace_back(e.x);
    get_ans(P, P, V);

    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 1928 KB Output is correct
2 Correct 6 ms 2180 KB Output is correct
3 Correct 7 ms 2180 KB Output is correct
4 Correct 10 ms 2048 KB Output is correct
5 Correct 5 ms 1920 KB Output is correct
6 Correct 7 ms 1904 KB Output is correct
7 Correct 6 ms 2180 KB Output is correct
8 Correct 7 ms 2180 KB Output is correct
9 Correct 6 ms 2188 KB Output is correct
10 Correct 7 ms 1920 KB Output is correct
11 Correct 15 ms 2224 KB Output is correct
12 Correct 6 ms 1972 KB Output is correct
13 Correct 7 ms 2052 KB Output is correct
14 Correct 6 ms 2244 KB Output is correct
15 Correct 7 ms 2220 KB Output is correct
16 Correct 8 ms 2216 KB Output is correct
17 Correct 7 ms 2052 KB Output is correct
18 Correct 8 ms 2220 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 14460 KB Output is correct
2 Correct 72 ms 14328 KB Output is correct
3 Correct 99 ms 14452 KB Output is correct
4 Correct 57 ms 13796 KB Output is correct
5 Correct 83 ms 18900 KB Output is correct
6 Correct 71 ms 17112 KB Output is correct
7 Correct 67 ms 17392 KB Output is correct
8 Correct 80 ms 17988 KB Output is correct
9 Correct 72 ms 18120 KB Output is correct
10 Correct 55 ms 13856 KB Output is correct
11 Correct 62 ms 14200 KB Output is correct
12 Correct 64 ms 12680 KB Output is correct
13 Correct 54 ms 12808 KB Output is correct
14 Correct 56 ms 13284 KB Output is correct
15 Correct 55 ms 14052 KB Output is correct
16 Correct 62 ms 13936 KB Output is correct
17 Correct 55 ms 13980 KB Output is correct
18 Correct 64 ms 13812 KB Output is correct
19 Correct 62 ms 13860 KB Output is correct
20 Correct 56 ms 19284 KB Output is correct
21 Correct 66 ms 18916 KB Output is correct
22 Correct 83 ms 16352 KB Output is correct
23 Correct 74 ms 18008 KB Output is correct
24 Correct 72 ms 16868 KB Output is correct
25 Correct 69 ms 17584 KB Output is correct
26 Correct 61 ms 18164 KB Output is correct
27 Correct 68 ms 17880 KB Output is correct
28 Correct 60 ms 18532 KB Output is correct
29 Correct 59 ms 16568 KB Output is correct
30 Correct 88 ms 16872 KB Output is correct
31 Correct 7 ms 2056 KB Output is correct
32 Correct 6 ms 1920 KB Output is correct
33 Correct 7 ms 2264 KB Output is correct
34 Correct 7 ms 1948 KB Output is correct
35 Correct 8 ms 1888 KB Output is correct
36 Correct 8 ms 1800 KB Output is correct
37 Correct 6 ms 1928 KB Output is correct
38 Correct 6 ms 2000 KB Output is correct
39 Correct 4 ms 1928 KB Output is correct
40 Correct 6 ms 1980 KB Output is correct
41 Correct 5 ms 2048 KB Output is correct
42 Correct 8 ms 1920 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1964 KB Output is correct
2 Correct 6 ms 2056 KB Output is correct
3 Correct 5 ms 1920 KB Output is correct
4 Correct 17 ms 5148 KB Output is correct
5 Correct 16 ms 5148 KB Output is correct
6 Correct 14 ms 5520 KB Output is correct
7 Correct 15 ms 5404 KB Output is correct
8 Correct 14 ms 5404 KB Output is correct
9 Correct 72 ms 24276 KB Output is correct
10 Correct 59 ms 24372 KB Output is correct
11 Correct 69 ms 24368 KB Output is correct
12 Correct 6 ms 1772 KB Output is correct
13 Correct 6 ms 1960 KB Output is correct
14 Correct 4 ms 1872 KB Output is correct
15 Correct 5 ms 1852 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 14480 KB Output is correct
2 Incorrect 79 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 99 ms 14552 KB Output is correct
2 Correct 75 ms 14340 KB Output is correct
3 Correct 75 ms 14448 KB Output is correct
4 Correct 55 ms 13804 KB Output is correct
5 Incorrect 76 ms 22648 KB Wrong Answer [7]
6 Halted 0 ms 0 KB -