oj.uz

Submission #137020

# Submission time Handle Problem Language Result Execution time Memory
137020 2019-07-26T22:40:21 Z osaaateiasavtnl Amusement Park (JOI17_amusement_park) C++14
80 / 100
 34 ms 5888 KB 
#include<bits/stdc++.h>
#include"Joi.h"
using namespace std;
#define color MessageBoard
#define app push_back
const int N = 20001;
vector <int> g[N];
int tin[N], ptr = 0;
bool used[N];
void dfs(int u, long long x) {
    used[u] = 1;
    tin[u] = ptr++;
    int b = tin[u] % 60;
    color(u, (x >> b) & 1);
    for (int v : g[u]) {
        if (!used[v]) {
            dfs(v, x);
        }   
    }   
}   
void Joi(int n, int m, int a[], int b[], long long x, int t) {
    for (int i = 0; i < m; ++i) {
        g[a[i]].app(b[i]);
        g[b[i]].app(a[i]);    
    }   
    dfs(0, x);
}   
#include<bits/stdc++.h>
#include"Ioi.h"
#define move Move
#define app push_back
using namespace std;
const int N = 20001;
vector <int> g[N];
int tin[N], cnt[N], par[N], ptr = 0;
bool used[N];
vector <int> tree[N];
void dfs(int u) {
    used[u] = 1; cnt[u] = 1; tin[u] = ptr++;
    for (int v : g[u]) {
        if (!used[v]) {
            dfs(v);
            par[v] = u; tree[u].app(v); cnt[u] += cnt[v];
        }   
    }   
}   
int vis = 0;
bool want[N], mem[N];
int vert[60];
int ans[N];
void dfs1(int u, int p) {
    if (vis == 60) return;
    ++vis;              
    int b = tin[u] % 60;
    want[u] = vert[b] == -1;
    bool want0 = want[u];
    for (int v : tree[u]) {
        dfs1(v, u);
        want[u] |= want[v];
    }   
    mem[u] = !want0 && want[u];
}   
bool comp(int u, int v) {
    return mem[u] < mem[v];
}   
void dfs2(int u, int p) {
    if (tree[u].empty()) return;
    sort(tree[u].begin(), tree[u].end(), comp);
    for (int v : tree[u]) {
        if (want[v]) {
            vert[tin[v] % 60] = v;
            ans[v] = move(v);
            dfs2(v, u);
            move(u);
            /*
            if (!mem[u]) {
                move(u);
            }
            */
        }
    }   
}   
long long Ioi(int n, int m, int a[], int b[], int u, int v, int t) {
    for (int i = 0; i < 60; ++i) vert[i] = -1;
    for (int i = 0; i < m; ++i) {
        g[a[i]].app(b[i]);
        g[b[i]].app(a[i]);
    }   
    dfs(0);
    ans[u] = v;
    vert[tin[u] % 60] = u;
    while (cnt[u] < 60) {
        u = par[u];
        ans[u] = move(u);
        vert[tin[u] % 60] = u;
    }   
    dfs1(u, par[u]);
    if (want[u]) dfs2(u, par[u]);
    long long x = 0;
    for (int i = 0; i < 60; ++i) {
        x += (1ll << i) * ans[vert[i]];
    }   
    return x;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2416 KB Output is correct
2 Correct 5 ms 2320 KB Output is correct
3 Correct 6 ms 2172 KB Output is correct
4 Correct 5 ms 2192 KB Output is correct
5 Correct 6 ms 2416 KB Output is correct
6 Correct 6 ms 2416 KB Output is correct
7 Correct 6 ms 2404 KB Output is correct
8 Correct 7 ms 2300 KB Output is correct
9 Correct 6 ms 2412 KB Output is correct
10 Correct 5 ms 2428 KB Output is correct
11 Correct 8 ms 2752 KB Output is correct
12 Correct 5 ms 2292 KB Output is correct
13 Correct 6 ms 2308 KB Output is correct
14 Correct 5 ms 2412 KB Output is correct
15 Correct 6 ms 2436 KB Output is correct
16 Correct 6 ms 2404 KB Output is correct
17 Correct 6 ms 2336 KB Output is correct
18 Correct 5 ms 2412 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 5576 KB Output is correct
2 Correct 33 ms 5576 KB Output is correct
3 Correct 34 ms 5884 KB Output is correct
4 Correct 20 ms 4256 KB Output is correct
5 Correct 20 ms 4896 KB Output is correct
6 Correct 22 ms 4640 KB Output is correct
7 Correct 20 ms 4504 KB Output is correct
8 Correct 22 ms 4760 KB Output is correct
9 Correct 20 ms 4756 KB Output is correct
10 Correct 20 ms 4264 KB Output is correct
11 Correct 20 ms 4252 KB Output is correct
12 Correct 20 ms 4076 KB Output is correct
13 Correct 20 ms 4104 KB Output is correct
14 Correct 20 ms 4320 KB Output is correct
15 Correct 20 ms 4376 KB Output is correct
16 Correct 20 ms 4284 KB Output is correct
17 Correct 20 ms 4288 KB Output is correct
18 Correct 20 ms 4256 KB Output is correct
19 Correct 20 ms 4384 KB Output is correct
20 Correct 17 ms 4632 KB Output is correct
21 Correct 17 ms 4668 KB Output is correct
22 Correct 23 ms 4488 KB Output is correct
23 Correct 20 ms 4760 KB Output is correct
24 Correct 20 ms 4632 KB Output is correct
25 Correct 23 ms 4740 KB Output is correct
26 Correct 22 ms 4640 KB Output is correct
27 Correct 22 ms 4640 KB Output is correct
28 Correct 22 ms 4780 KB Output is correct
29 Correct 20 ms 4380 KB Output is correct
30 Correct 20 ms 4628 KB Output is correct
31 Correct 5 ms 2304 KB Output is correct
32 Correct 6 ms 2300 KB Output is correct
33 Correct 6 ms 2308 KB Output is correct
34 Correct 6 ms 2300 KB Output is correct
35 Correct 6 ms 2424 KB Output is correct
36 Correct 6 ms 2164 KB Output is correct
37 Correct 6 ms 2164 KB Output is correct
38 Correct 6 ms 2164 KB Output is correct
39 Correct 6 ms 2292 KB Output is correct
40 Correct 6 ms 2420 KB Output is correct
41 Correct 6 ms 2416 KB Output is correct
42 Correct 6 ms 2300 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2288 KB Output is correct
2 Correct 6 ms 2288 KB Output is correct
3 Correct 6 ms 2296 KB Output is correct
4 Correct 8 ms 2820 KB Output is correct
5 Correct 8 ms 2840 KB Output is correct
6 Correct 7 ms 2796 KB Output is correct
7 Correct 7 ms 2792 KB Output is correct
8 Correct 7 ms 2712 KB Output is correct
9 Correct 18 ms 5176 KB Output is correct
10 Correct 18 ms 5292 KB Output is correct
11 Correct 18 ms 5048 KB Output is correct
12 Correct 6 ms 2424 KB Output is correct
13 Correct 6 ms 2296 KB Output is correct
14 Correct 5 ms 2168 KB Output is correct
15 Correct 5 ms 2172 KB Output is correct

Subtask #4
52.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 5576 KB Output is correct
2 Correct 33 ms 5416 KB Output is correct
3 Correct 33 ms 5888 KB Output is correct
4 Correct 20 ms 4228 KB Output is correct
5 Partially correct 22 ms 5016 KB Partially correct
6 Correct 20 ms 4760 KB Output is correct
7 Correct 22 ms 4684 KB Output is correct
8 Correct 22 ms 4580 KB Output is correct
9 Correct 22 ms 4632 KB Output is correct
10 Correct 20 ms 4388 KB Output is correct
11 Correct 20 ms 4252 KB Output is correct
12 Correct 20 ms 4352 KB Output is correct
13 Partially correct 20 ms 4128 KB Partially correct
14 Partially correct 20 ms 4108 KB Partially correct
15 Partially correct 20 ms 4248 KB Partially correct
16 Correct 20 ms 4376 KB Output is correct
17 Correct 20 ms 4284 KB Output is correct
18 Correct 20 ms 4312 KB Output is correct
19 Correct 20 ms 4284 KB Output is correct
20 Correct 17 ms 4680 KB Output is correct
21 Correct 17 ms 4696 KB Output is correct
22 Correct 20 ms 4696 KB Output is correct
23 Correct 23 ms 4744 KB Output is correct
24 Correct 20 ms 4448 KB Output is correct
25 Correct 23 ms 4632 KB Output is correct
26 Correct 23 ms 4760 KB Output is correct
27 Correct 24 ms 4760 KB Output is correct
28 Correct 22 ms 4504 KB Output is correct
29 Correct 20 ms 4384 KB Output is correct
30 Correct 22 ms 4496 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 5564 KB Output is correct
2 Correct 34 ms 5536 KB Output is correct
3 Correct 34 ms 5692 KB Output is correct
4 Correct 22 ms 4120 KB Output is correct
5 Incorrect 22 ms 5148 KB Output isn't correct
6 Halted 0 ms 0 KB -