oj.uz

답안 #257477

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
257477 2020-08-04T10:30:39 Z islingr Amusement Park (JOI17_amusement_park) C++17
64 / 100
 32 ms 4652 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);
	int right = out[P];
	while (right - in[P] < B)
		V = Move(p[P]), P = p[P];
	assert(dfs(P, V));
  return x;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1644 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 4164 KB Output is correct
2 Correct 27 ms 4132 KB Output is correct
3 Correct 28 ms 4160 KB Output is correct
4 Correct 17 ms 3396 KB Output is correct
5 Correct 17 ms 3968 KB Output is correct
6 Correct 17 ms 3628 KB Output is correct
7 Correct 22 ms 3780 KB Output is correct
8 Correct 20 ms 3756 KB Output is correct
9 Correct 17 ms 3992 KB Output is correct
10 Correct 15 ms 3376 KB Output is correct
11 Correct 19 ms 3628 KB Output is correct
12 Correct 16 ms 3460 KB Output is correct
13 Correct 23 ms 3452 KB Output is correct
14 Correct 16 ms 3428 KB Output is correct
15 Correct 17 ms 3372 KB Output is correct
16 Correct 18 ms 3260 KB Output is correct
17 Correct 17 ms 3408 KB Output is correct
18 Correct 17 ms 3408 KB Output is correct
19 Correct 17 ms 3404 KB Output is correct
20 Correct 13 ms 3884 KB Output is correct
21 Correct 14 ms 3968 KB Output is correct
22 Correct 17 ms 3628 KB Output is correct
23 Correct 17 ms 4004 KB Output is correct
24 Correct 17 ms 3628 KB Output is correct
25 Correct 19 ms 3628 KB Output is correct
26 Correct 17 ms 3756 KB Output is correct
27 Correct 18 ms 3756 KB Output is correct
28 Correct 17 ms 3756 KB Output is correct
29 Correct 15 ms 3688 KB Output is correct
30 Correct 16 ms 3796 KB Output is correct
31 Correct 2 ms 1672 KB Output is correct
32 Correct 2 ms 1784 KB Output is correct
33 Correct 2 ms 1620 KB Output is correct
34 Incorrect 2 ms 1784 KB Wrong Answer [7]
35 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1772 KB Output is correct
2 Correct 2 ms 1540 KB Output is correct
3 Correct 2 ms 1904 KB Output is correct
4 Correct 3 ms 2132 KB Output is correct
5 Correct 4 ms 1972 KB Output is correct
6 Correct 4 ms 2140 KB Output is correct
7 Correct 3 ms 1972 KB Output is correct
8 Correct 3 ms 2004 KB Output is correct
9 Correct 13 ms 4396 KB Output is correct
10 Correct 15 ms 4624 KB Output is correct
11 Correct 14 ms 4652 KB Output is correct
12 Correct 1 ms 1780 KB Output is correct
13 Correct 1 ms 1544 KB Output is correct
14 Correct 2 ms 1672 KB Output is correct
15 Correct 2 ms 1784 KB Output is correct

Subtask #4
54.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 4132 KB Output is correct
2 Correct 32 ms 4156 KB Output is correct
3 Correct 27 ms 4280 KB Output is correct
4 Correct 19 ms 3652 KB Output is correct
5 Correct 17 ms 4140 KB Output is correct
6 Partially correct 17 ms 3996 KB Partially correct
7 Correct 17 ms 3812 KB Output is correct
8 Correct 19 ms 3704 KB Output is correct
9 Correct 22 ms 3628 KB Output is correct
10 Correct 16 ms 3636 KB Output is correct
11 Correct 15 ms 3624 KB Output is correct
12 Correct 15 ms 3220 KB Output is correct
13 Correct 15 ms 3760 KB Output is correct
14 Correct 15 ms 3232 KB Output is correct
15 Correct 17 ms 3420 KB Output is correct
16 Correct 22 ms 3244 KB Output is correct
17 Correct 17 ms 3244 KB Output is correct
18 Partially correct 17 ms 3244 KB Partially correct
19 Correct 22 ms 3392 KB Output is correct
20 Correct 14 ms 4016 KB Output is correct
21 Correct 13 ms 3964 KB Output is correct
22 Correct 17 ms 3628 KB Output is correct
23 Correct 17 ms 3780 KB Output is correct
24 Correct 17 ms 3780 KB Output is correct
25 Correct 19 ms 3884 KB Output is correct
26 Correct 18 ms 3904 KB Output is correct
27 Correct 17 ms 3884 KB Output is correct
28 Correct 17 ms 3628 KB Output is correct
29 Correct 15 ms 3604 KB Output is correct
30 Correct 15 ms 3788 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 4004 KB Output is correct
2 Correct 27 ms 4168 KB Output is correct
3 Correct 27 ms 4124 KB Output is correct
4 Correct 17 ms 3244 KB Output is correct
5 Correct 17 ms 4312 KB Output is correct
6 Correct 17 ms 3792 KB Output is correct
7 Correct 17 ms 3628 KB Output is correct
8 Correct 17 ms 3988 KB Output is correct
9 Correct 17 ms 3628 KB Output is correct
10 Correct 15 ms 3504 KB Output is correct
11 Correct 15 ms 3504 KB Output is correct
12 Correct 16 ms 3348 KB Output is correct
13 Correct 17 ms 3348 KB Output is correct
14 Correct 16 ms 3232 KB Output is correct
15 Correct 22 ms 3408 KB Output is correct
16 Correct 17 ms 3244 KB Output is correct
17 Correct 17 ms 3404 KB Output is correct
18 Incorrect 17 ms 3372 KB Output isn't correct
19 Halted 0 ms 0 KB -