답안 #257454

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
257454	2020-08-04T09:37:50 Z	islingr	Amusement Park (JOI17_amusement_park)	C++17	80 / 100	37 ms	4624 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 cur = 0, x = 0;
bool add(int u, ll z) {
  int s = in[u] % B;
  cur |= 1ll << s;
  x |= z << s;
	return __builtin_popcountll(cur) == B;
}
bool dfs(int u, int z) {
	if (add(u, z)) 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 (true) {
		if (add(P, V)) break;
		if (out[P] - in[P] < B)
			V = Move(p[P]), P = p[P];
		else break;
	}
	assert(dfs(P, V));
  return x;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	4164 KB	Output is correct
2	Correct	31 ms	4132 KB	Output is correct
3	Correct	28 ms	4132 KB	Output is correct
4	Correct	19 ms	3400 KB	Output is correct
5	Correct	22 ms	4012 KB	Output is correct
6	Correct	17 ms	3772 KB	Output is correct
7	Correct	18 ms	3756 KB	Output is correct
8	Correct	17 ms	4116 KB	Output is correct
9	Correct	17 ms	3980 KB	Output is correct
10	Correct	18 ms	3504 KB	Output is correct
11	Correct	15 ms	3624 KB	Output is correct
12	Correct	17 ms	3484 KB	Output is correct
13	Correct	16 ms	3456 KB	Output is correct
14	Correct	19 ms	3432 KB	Output is correct
15	Correct	18 ms	3412 KB	Output is correct
16	Correct	17 ms	3412 KB	Output is correct
17	Correct	19 ms	3612 KB	Output is correct
18	Correct	18 ms	3400 KB	Output is correct
19	Correct	17 ms	3244 KB	Output is correct
20	Correct	16 ms	3968 KB	Output is correct
21	Correct	13 ms	3884 KB	Output is correct
22	Correct	16 ms	3500 KB	Output is correct
23	Correct	17 ms	4004 KB	Output is correct
24	Correct	16 ms	3628 KB	Output is correct
25	Correct	17 ms	3768 KB	Output is correct
26	Correct	17 ms	3756 KB	Output is correct
27	Correct	18 ms	4132 KB	Output is correct
28	Correct	17 ms	3992 KB	Output is correct
29	Correct	17 ms	3604 KB	Output is correct
30	Correct	17 ms	3792 KB	Output is correct
31	Correct	2 ms	1544 KB	Output is correct
32	Correct	2 ms	1776 KB	Output is correct
33	Correct	2 ms	1552 KB	Output is correct
34	Correct	2 ms	1776 KB	Output is correct
35	Correct	2 ms	1672 KB	Output is correct
36	Correct	2 ms	1772 KB	Output is correct
37	Correct	2 ms	1544 KB	Output is correct
38	Correct	2 ms	1788 KB	Output is correct
39	Correct	2 ms	1544 KB	Output is correct
40	Correct	2 ms	1784 KB	Output is correct
41	Correct	2 ms	1544 KB	Output is correct
42	Correct	2 ms	1904 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	1672 KB	Output is correct
2	Correct	2 ms	1784 KB	Output is correct
3	Correct	2 ms	1776 KB	Output is correct
4	Correct	4 ms	1972 KB	Output is correct
5	Correct	3 ms	2004 KB	Output is correct
6	Correct	3 ms	2100 KB	Output is correct
7	Correct	3 ms	2000 KB	Output is correct
8	Correct	4 ms	2124 KB	Output is correct
9	Correct	13 ms	4624 KB	Output is correct
10	Correct	14 ms	4528 KB	Output is correct
11	Correct	13 ms	4524 KB	Output is correct
12	Correct	2 ms	1776 KB	Output is correct
13	Correct	2 ms	1776 KB	Output is correct
14	Correct	2 ms	1672 KB	Output is correct
15	Correct	2 ms	1792 KB	Output is correct

Subtask #4
52.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	37 ms	4160 KB	Output is correct
2	Correct	28 ms	4172 KB	Output is correct
3	Partially correct	27 ms	4152 KB	Partially correct
4	Correct	17 ms	3408 KB	Output is correct
5	Partially correct	18 ms	4268 KB	Partially correct
6	Correct	18 ms	3884 KB	Output is correct
7	Correct	19 ms	3756 KB	Output is correct
8	Correct	17 ms	3628 KB	Output is correct
9	Correct	19 ms	3756 KB	Output is correct
10	Correct	15 ms	3504 KB	Output is correct
11	Correct	16 ms	3624 KB	Output is correct
12	Correct	16 ms	3220 KB	Output is correct
13	Correct	16 ms	3348 KB	Output is correct
14	Correct	17 ms	3232 KB	Output is correct
15	Correct	17 ms	3244 KB	Output is correct
16	Correct	17 ms	3372 KB	Output is correct
17	Correct	19 ms	3400 KB	Output is correct
18	Partially correct	17 ms	3408 KB	Partially correct
19	Correct	17 ms	3244 KB	Output is correct
20	Correct	14 ms	3956 KB	Output is correct
21	Correct	13 ms	3756 KB	Output is correct
22	Correct	18 ms	4016 KB	Output is correct
23	Correct	17 ms	3788 KB	Output is correct
24	Correct	18 ms	3756 KB	Output is correct
25	Correct	24 ms	4128 KB	Output is correct
26	Correct	17 ms	4016 KB	Output is correct
27	Correct	17 ms	3756 KB	Output is correct
28	Correct	17 ms	3628 KB	Output is correct
29	Correct	15 ms	3476 KB	Output is correct
30	Correct	16 ms	3744 KB	Output is correct

Subtask #5
0 / 17.0

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

답안 #257454

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