답안 #137011

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
137011	2019-07-26T22:18:41 Z	osaaateiasavtnl	Amusement Park (JOI17_amusement_park)	C++14	80 / 100	53 ms	5936 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];
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;
    for (int v : tree[u]) {
        if (v != p) {
            dfs1(v, u);
            want[u] |= want[v];
        }   
    }   
}   
void dfs2(int u, int p) {
    for (int v : tree[u]) {
        if (v != p && want[v]) {
            vert[tin[v] % 60] = v;
            ans[v] = move(v);
            dfs2(v, 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

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	2164 KB	Output is correct
2	Correct	6 ms	2300 KB	Output is correct
3	Correct	6 ms	2184 KB	Output is correct
4	Correct	5 ms	2164 KB	Output is correct
5	Correct	6 ms	2164 KB	Output is correct
6	Correct	6 ms	2420 KB	Output is correct
7	Correct	6 ms	2380 KB	Output is correct
8	Correct	5 ms	2172 KB	Output is correct
9	Correct	6 ms	2172 KB	Output is correct
10	Correct	5 ms	2320 KB	Output is correct
11	Correct	8 ms	2688 KB	Output is correct
12	Correct	5 ms	2556 KB	Output is correct
13	Correct	6 ms	2436 KB	Output is correct
14	Correct	5 ms	2176 KB	Output is correct
15	Correct	6 ms	2436 KB	Output is correct
16	Correct	6 ms	2196 KB	Output is correct
17	Correct	6 ms	2180 KB	Output is correct
18	Correct	5 ms	2172 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	34 ms	5760 KB	Output is correct
2	Correct	33 ms	5760 KB	Output is correct
3	Correct	33 ms	5888 KB	Output is correct
4	Correct	20 ms	4304 KB	Output is correct
5	Correct	22 ms	4764 KB	Output is correct
6	Correct	40 ms	4552 KB	Output is correct
7	Correct	23 ms	4648 KB	Output is correct
8	Correct	23 ms	4760 KB	Output is correct
9	Correct	24 ms	4632 KB	Output is correct
10	Correct	20 ms	4188 KB	Output is correct
11	Correct	19 ms	4388 KB	Output is correct
12	Correct	22 ms	3968 KB	Output is correct
13	Correct	20 ms	3972 KB	Output is correct
14	Correct	20 ms	4136 KB	Output is correct
15	Correct	23 ms	4356 KB	Output is correct
16	Correct	23 ms	4372 KB	Output is correct
17	Correct	20 ms	4248 KB	Output is correct
18	Correct	20 ms	4128 KB	Output is correct
19	Correct	20 ms	4232 KB	Output is correct
20	Correct	18 ms	4804 KB	Output is correct
21	Correct	16 ms	4640 KB	Output is correct
22	Correct	20 ms	4376 KB	Output is correct
23	Correct	24 ms	4452 KB	Output is correct
24	Correct	25 ms	4632 KB	Output is correct
25	Correct	22 ms	4652 KB	Output is correct
26	Correct	23 ms	4640 KB	Output is correct
27	Correct	22 ms	4504 KB	Output is correct
28	Correct	20 ms	4632 KB	Output is correct
29	Correct	20 ms	4480 KB	Output is correct
30	Correct	20 ms	4492 KB	Output is correct
31	Correct	5 ms	2164 KB	Output is correct
32	Correct	6 ms	2288 KB	Output is correct
33	Correct	6 ms	2216 KB	Output is correct
34	Correct	5 ms	2416 KB	Output is correct
35	Correct	5 ms	2164 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	2428 KB	Output is correct
39	Correct	6 ms	2292 KB	Output is correct
40	Correct	5 ms	2160 KB	Output is correct
41	Correct	5 ms	2300 KB	Output is correct
42	Correct	5 ms	2300 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	2184 KB	Output is correct
2	Correct	6 ms	2392 KB	Output is correct
3	Correct	6 ms	2356 KB	Output is correct
4	Correct	7 ms	2728 KB	Output is correct
5	Correct	7 ms	2720 KB	Output is correct
6	Correct	8 ms	2876 KB	Output is correct
7	Correct	8 ms	2724 KB	Output is correct
8	Correct	7 ms	2720 KB	Output is correct
9	Correct	18 ms	5280 KB	Output is correct
10	Correct	18 ms	5348 KB	Output is correct
11	Correct	18 ms	5272 KB	Output is correct
12	Correct	6 ms	2164 KB	Output is correct
13	Correct	5 ms	2420 KB	Output is correct
14	Correct	6 ms	2168 KB	Output is correct
15	Correct	5 ms	2164 KB	Output is correct

Subtask #4
52.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	36 ms	5872 KB	Output is correct
2	Correct	37 ms	5696 KB	Output is correct
3	Correct	35 ms	5936 KB	Output is correct
4	Correct	23 ms	4284 KB	Output is correct
5	Partially correct	24 ms	5124 KB	Partially correct
6	Correct	22 ms	4632 KB	Output is correct
7	Correct	22 ms	4632 KB	Output is correct
8	Correct	53 ms	4608 KB	Output is correct
9	Correct	25 ms	4440 KB	Output is correct
10	Correct	20 ms	4252 KB	Output is correct
11	Correct	20 ms	4124 KB	Output is correct
12	Correct	20 ms	3968 KB	Output is correct
13	Partially correct	20 ms	4052 KB	Partially correct
14	Partially correct	20 ms	4116 KB	Partially correct
15	Partially correct	20 ms	4380 KB	Partially correct
16	Correct	22 ms	4376 KB	Output is correct
17	Correct	24 ms	4120 KB	Output is correct
18	Correct	23 ms	4228 KB	Output is correct
19	Correct	22 ms	4116 KB	Output is correct
20	Correct	24 ms	4664 KB	Output is correct
21	Correct	18 ms	4632 KB	Output is correct
22	Correct	22 ms	4640 KB	Output is correct
23	Correct	22 ms	4632 KB	Output is correct
24	Correct	23 ms	4716 KB	Output is correct
25	Correct	23 ms	4632 KB	Output is correct
26	Correct	24 ms	4700 KB	Output is correct
27	Correct	22 ms	4640 KB	Output is correct
28	Correct	23 ms	4632 KB	Output is correct
29	Correct	20 ms	4352 KB	Output is correct
30	Correct	20 ms	4628 KB	Output is correct

Subtask #5
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	5900 KB	Output is correct
2	Correct	35 ms	5844 KB	Output is correct
3	Correct	33 ms	5888 KB	Output is correct
4	Correct	22 ms	4164 KB	Output is correct
5	Incorrect	22 ms	5280 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

답안 #137011

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 10.0 / 10.0

Subtask #3 10.0 / 10.0

Subtask #4 52.0 / 55.0

Subtask #5 0 / 17.0

Subtask #1
8.0 / 8.0

Subtask #2
10.0 / 10.0

Subtask #3
10.0 / 10.0

Subtask #4
52.0 / 55.0

Subtask #5
0 / 17.0