답안 #257423

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
257423	2020-08-04T09:00:01 Z	islingr	Amusement Park (JOI17_amusement_park)	C++17	80 / 100	35 ms	4172 KB

#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)

using ll = long long;

namespace {
const int N = 1 << 14, B = 60;
int nxt[N];
int head(int u) { return nxt[u] != u ? nxt[u] = head(nxt[u]) : u; }
bool unite(int u, int v) {
  u = head(u); v = head(v);
  if (u == v) return 0;
  nxt[u] = v; return 1;
}

vector<int> g[N]; int timer = 0; ll x;
void dfs(int u, int p) {
  MessageBoard(u, x >> timer & 1);
  if (++timer == B) timer = 0;
  for (int v : g[u]) if (v != p) dfs(v, u);
}
}

void Joi(int n, int m, int a[], int b[], ll X, int t) {
  rep(u, 0, n) nxt[u] = u;
  rep(e, 0, m) {
    if (unite(a[e], b[e])) {
      g[a[e]].push_back(b[e]);
      g[b[e]].push_back(a[e]);
    }
  }
  x = X; dfs(0, -1);
}

#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)

using ll = long long;

namespace {
const int N = 1 << 14, B = 60;
int nxt[N];
int head(int u) { return nxt[u] != u ? nxt[u] = head(nxt[u]) : u; }
bool unite(int u, int v) {
  u = head(u); v = head(v);
  if (u == v) return 0;
  nxt[u] = v; return 1;
}

vector<int> g[N];
int p[N], in[N], out[N], timer = 0;
void init(int u) {
  in[u] = timer++;
  for (int v : g[u]) {
    g[v].erase(find(all(g[v]), u));
    p[v] = u;
    init(v);
  }
  out[u] = timer;
}

ll U = (1ll << B) - 1, cur = 0, x = 0;
bool dfs(int u, ll z) {
  int s = in[u] % B;
  cur |= 1ll << s;
  x |= z << s;
  if (cur == U) return true;
  for (int v : g[u]) {
    if (dfs(v, Move(v))) return true;
    Move(u);
  }
  return false;
}
}

ll Ioi(int n, int m, int a[], int b[], int P, int V, int T) {
  rep(u, 0, n) nxt[u] = u;
  rep(e, 0, m) {
    if (unite(a[e], b[e])) {
      g[a[e]].push_back(b[e]);
      g[b[e]].push_back(a[e]);
    }
  }
  init(0);
  while (out[P] - in[P] < B) V = Move(p[P]), P = p[P];
  dfs(P, V);
  return x;
}

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	1788 KB	Output is correct
2	Correct	2 ms	1784 KB	Output is correct
3	Correct	2 ms	1552 KB	Output is correct
4	Correct	2 ms	1784 KB	Output is correct
5	Correct	2 ms	1544 KB	Output is correct
6	Correct	2 ms	1544 KB	Output is correct
7	Correct	2 ms	1760 KB	Output is correct
8	Correct	2 ms	1680 KB	Output is correct
9	Correct	2 ms	1764 KB	Output is correct
10	Correct	2 ms	1544 KB	Output is correct
11	Correct	6 ms	1876 KB	Output is correct
12	Correct	2 ms	1544 KB	Output is correct
13	Correct	3 ms	1772 KB	Output is correct
14	Correct	2 ms	1760 KB	Output is correct
15	Correct	3 ms	1760 KB	Output is correct
16	Correct	4 ms	1552 KB	Output is correct
17	Correct	3 ms	1760 KB	Output is correct
18	Correct	3 ms	1764 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	3908 KB	Output is correct
2	Correct	26 ms	3912 KB	Output is correct
3	Correct	27 ms	3684 KB	Output is correct
4	Correct	17 ms	3148 KB	Output is correct
5	Correct	17 ms	3660 KB	Output is correct
6	Correct	16 ms	3784 KB	Output is correct
7	Correct	16 ms	3780 KB	Output is correct
8	Correct	19 ms	3748 KB	Output is correct
9	Correct	18 ms	3736 KB	Output is correct
10	Correct	15 ms	3276 KB	Output is correct
11	Correct	17 ms	3372 KB	Output is correct
12	Correct	16 ms	3004 KB	Output is correct
13	Correct	17 ms	3200 KB	Output is correct
14	Correct	16 ms	3184 KB	Output is correct
15	Correct	17 ms	3160 KB	Output is correct
16	Correct	16 ms	3148 KB	Output is correct
17	Correct	17 ms	3148 KB	Output is correct
18	Correct	17 ms	3148 KB	Output is correct
19	Correct	17 ms	3148 KB	Output is correct
20	Correct	13 ms	3696 KB	Output is correct
21	Correct	14 ms	3660 KB	Output is correct
22	Correct	17 ms	3404 KB	Output is correct
23	Correct	18 ms	4004 KB	Output is correct
24	Correct	17 ms	3628 KB	Output is correct
25	Correct	17 ms	3764 KB	Output is correct
26	Correct	17 ms	3996 KB	Output is correct
27	Correct	17 ms	4004 KB	Output is correct
28	Correct	17 ms	3992 KB	Output is correct
29	Correct	15 ms	3604 KB	Output is correct
30	Correct	16 ms	3744 KB	Output is correct
31	Correct	2 ms	1544 KB	Output is correct
32	Correct	2 ms	1780 KB	Output is correct
33	Correct	2 ms	1756 KB	Output is correct
34	Correct	2 ms	1780 KB	Output is correct
35	Correct	2 ms	1544 KB	Output is correct
36	Correct	2 ms	1672 KB	Output is correct
37	Correct	2 ms	1544 KB	Output is correct
38	Correct	2 ms	1780 KB	Output is correct
39	Correct	1 ms	1544 KB	Output is correct
40	Correct	2 ms	1784 KB	Output is correct
41	Correct	2 ms	1784 KB	Output is correct
42	Correct	2 ms	1772 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	1668 KB	Output is correct
2	Correct	2 ms	1668 KB	Output is correct
3	Correct	2 ms	1784 KB	Output is correct
4	Correct	3 ms	2012 KB	Output is correct
5	Correct	3 ms	2128 KB	Output is correct
6	Correct	3 ms	2084 KB	Output is correct
7	Correct	4 ms	2084 KB	Output is correct
8	Correct	3 ms	2128 KB	Output is correct
9	Correct	15 ms	4172 KB	Output is correct
10	Correct	14 ms	4172 KB	Output is correct
11	Correct	14 ms	4172 KB	Output is correct
12	Correct	2 ms	1796 KB	Output is correct
13	Correct	1 ms	1668 KB	Output is correct
14	Correct	2 ms	1784 KB	Output is correct
15	Correct	1 ms	1668 KB	Output is correct

Subtask #4
52.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	3900 KB	Output is correct
2	Correct	33 ms	3908 KB	Output is correct
3	Partially correct	27 ms	3812 KB	Partially correct
4	Correct	17 ms	3148 KB	Output is correct
5	Partially correct	17 ms	4044 KB	Partially correct
6	Correct	18 ms	3532 KB	Output is correct
7	Correct	17 ms	3532 KB	Output is correct
8	Correct	18 ms	3404 KB	Output is correct
9	Correct	17 ms	3404 KB	Output is correct
10	Correct	15 ms	3380 KB	Output is correct
11	Correct	18 ms	3376 KB	Output is correct
12	Correct	15 ms	3200 KB	Output is correct
13	Correct	16 ms	3200 KB	Output is correct
14	Correct	16 ms	3012 KB	Output is correct
15	Correct	17 ms	3148 KB	Output is correct
16	Correct	17 ms	3020 KB	Output is correct
17	Correct	17 ms	3148 KB	Output is correct
18	Partially correct	17 ms	3364 KB	Partially correct
19	Correct	18 ms	3392 KB	Output is correct
20	Correct	13 ms	3704 KB	Output is correct
21	Correct	14 ms	3660 KB	Output is correct
22	Correct	18 ms	3768 KB	Output is correct
23	Correct	17 ms	3776 KB	Output is correct
24	Correct	17 ms	3776 KB	Output is correct
25	Correct	18 ms	3660 KB	Output is correct
26	Correct	20 ms	3660 KB	Output is correct
27	Correct	20 ms	3732 KB	Output is correct
28	Correct	17 ms	3416 KB	Output is correct
29	Correct	19 ms	3388 KB	Output is correct
30	Correct	17 ms	3528 KB	Output is correct

Subtask #5
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	26 ms	3684 KB	Output is correct
2	Correct	27 ms	3812 KB	Output is correct
3	Incorrect	28 ms	3904 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

답안 #257423

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