oj.uz

Submission #137031

# Submission time Handle Problem Language Result Execution time Memory
137031 2019-07-26T23:13:42 Z osaaateiasavtnl Amusement Park (JOI17_amusement_park) C++14
73 / 100
 36 ms 5736 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];
int CUR = -1;
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] |= mem[v];
    }   
    mem[u] |= !want0 && want[u];
}   
bool comp(int u, int v) {
    return mem[u] < mem[v];
}   
void check(int v) {
    bool c = 0;
    for (int e : g[CUR]) {
        c |= e == v;
    }   
}   
void dfs2(int u, int p) {
    if (tree[u].empty()) return;
    sort(tree[u].begin(), tree[u].end(), comp);

    int ch = 0;
    for (int v : tree[u]) {
        if (want[v]) {
            ch += mem[v];
        }   
    }   
    if (ch > 1) exit(1);

    for (int v : tree[u]) {
        if (want[v]) {
            vert[tin[v] % 60] = v;

            check(v);
            ans[v] = move(v);
            CUR = v;

            dfs2(v, u);
            if (!mem[v]) {
                check(u);
                move(u);
                CUR = 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]);
    CUR = 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 6 ms 2416 KB Output is correct
2 Correct 5 ms 2184 KB Output is correct
3 Correct 6 ms 2436 KB Output is correct
4 Correct 5 ms 2184 KB Output is correct
5 Correct 5 ms 2164 KB Output is correct
6 Correct 6 ms 2300 KB Output is correct
7 Correct 6 ms 2404 KB Output is correct
8 Correct 5 ms 2408 KB Output is correct
9 Correct 6 ms 2308 KB Output is correct
10 Correct 6 ms 2428 KB Output is correct
11 Correct 9 ms 2688 KB Output is correct
12 Correct 6 ms 2192 KB Output is correct
13 Correct 6 ms 2404 KB Output is correct
14 Correct 6 ms 2176 KB Output is correct
15 Correct 6 ms 2172 KB Output is correct
16 Correct 6 ms 2308 KB Output is correct
17 Correct 6 ms 2180 KB Output is correct
18 Correct 7 ms 2408 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 5528 KB Output is correct
2 Correct 33 ms 5492 KB Output is correct
3 Correct 35 ms 5500 KB Output is correct
4 Correct 22 ms 4156 KB Output is correct
5 Correct 22 ms 4540 KB Output is correct
6 Correct 20 ms 4408 KB Output is correct
7 Correct 22 ms 4416 KB Output is correct
8 Correct 20 ms 4548 KB Output is correct
9 Correct 22 ms 4512 KB Output is correct
10 Correct 18 ms 4152 KB Output is correct
11 Correct 20 ms 4128 KB Output is correct
12 Correct 19 ms 3916 KB Output is correct
13 Correct 20 ms 3960 KB Output is correct
14 Correct 20 ms 3932 KB Output is correct
15 Correct 22 ms 4160 KB Output is correct
16 Correct 23 ms 4188 KB Output is correct
17 Correct 20 ms 4032 KB Output is correct
18 Correct 22 ms 4284 KB Output is correct
19 Runtime error 20 ms 3896 KB Execution failed because the return code was nonzero
20 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2168 KB Output is correct
2 Correct 5 ms 2296 KB Output is correct
3 Correct 5 ms 2296 KB Output is correct
4 Correct 8 ms 2960 KB Output is correct
5 Correct 8 ms 2740 KB Output is correct
6 Correct 7 ms 2704 KB Output is correct
7 Correct 7 ms 2708 KB Output is correct
8 Correct 7 ms 2940 KB Output is correct
9 Correct 19 ms 5300 KB Output is correct
10 Correct 19 ms 5292 KB Output is correct
11 Correct 19 ms 5288 KB Output is correct
12 Correct 5 ms 2548 KB Output is correct
13 Correct 5 ms 2296 KB Output is correct
14 Correct 5 ms 2172 KB Output is correct
15 Correct 5 ms 2288 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 5440 KB Output is correct
2 Correct 33 ms 5736 KB Output is correct
3 Correct 33 ms 5568 KB Output is correct
4 Correct 20 ms 4032 KB Output is correct
5 Correct 20 ms 4920 KB Output is correct
6 Correct 20 ms 4580 KB Output is correct
7 Correct 20 ms 4460 KB Output is correct
8 Correct 20 ms 4380 KB Output is correct
9 Correct 22 ms 4340 KB Output is correct
10 Correct 18 ms 4132 KB Output is correct
11 Correct 19 ms 4024 KB Output is correct
12 Correct 20 ms 3960 KB Output is correct
13 Correct 20 ms 3960 KB Output is correct
14 Correct 20 ms 4020 KB Output is correct
15 Correct 20 ms 4164 KB Output is correct
16 Correct 20 ms 4032 KB Output is correct
17 Correct 20 ms 4148 KB Output is correct
18 Correct 20 ms 4160 KB Output is correct
19 Correct 20 ms 4024 KB Output is correct
20 Correct 17 ms 4548 KB Output is correct
21 Correct 17 ms 4452 KB Output is correct
22 Correct 20 ms 4464 KB Output is correct
23 Correct 20 ms 4408 KB Output is correct
24 Correct 20 ms 4480 KB Output is correct
25 Correct 20 ms 4416 KB Output is correct
26 Correct 20 ms 4408 KB Output is correct
27 Correct 20 ms 4536 KB Output is correct
28 Correct 20 ms 4324 KB Output is correct
29 Correct 20 ms 4400 KB Output is correct
30 Correct 20 ms 4484 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 5568 KB Output is correct
2 Correct 33 ms 5448 KB Output is correct
3 Correct 33 ms 5548 KB Output is correct
4 Correct 20 ms 4156 KB Output is correct
5 Correct 23 ms 5064 KB Output is correct
6 Correct 20 ms 4412 KB Output is correct
7 Correct 20 ms 4476 KB Output is correct
8 Correct 22 ms 4416 KB Output is correct
9 Correct 22 ms 4476 KB Output is correct
10 Correct 19 ms 4252 KB Output is correct
11 Correct 20 ms 4160 KB Output is correct
12 Correct 19 ms 3968 KB Output is correct
13 Correct 19 ms 3884 KB Output is correct
14 Correct 20 ms 3936 KB Output is correct
15 Correct 20 ms 4152 KB Output is correct
16 Correct 20 ms 4152 KB Output is correct
17 Correct 20 ms 4040 KB Output is correct
18 Correct 22 ms 4284 KB Output is correct
19 Correct 22 ms 3896 KB Output is correct
20 Correct 18 ms 4660 KB Output is correct
21 Correct 17 ms 4416 KB Output is correct
22 Correct 20 ms 4416 KB Output is correct
23 Correct 20 ms 4292 KB Output is correct
24 Correct 23 ms 4380 KB Output is correct
25 Correct 23 ms 4408 KB Output is correct
26 Correct 20 ms 4284 KB Output is correct
27 Correct 20 ms 4564 KB Output is correct
28 Correct 20 ms 4408 KB Output is correct
29 Correct 20 ms 4392 KB Output is correct
30 Correct 20 ms 4412 KB Output is correct
31 Runtime error 5 ms 2424 KB Execution failed because the return code was nonzero
32 Halted 0 ms 0 KB -