oj.uz

답안 #39329

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39329 2018-01-11T15:11:17 Z UncleGrandpa925 Amusement Park (JOI17_amusement_park) C++14
59 / 100
 32 ms 7020 KB 
#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define bit(x,y) ((x>>(y))&1LL)
#define NMAX 10000
#define MMAX 20000
#define MOVEMAX 20000

struct dsu {
	int par[NMAX + 5];
	dsu() {
		for (int i = 0; i < NMAX; i++) par[i] = i;
	}
	int find(int x) {
		if (par[x] == x) return x;
		return par[x] = find(par[x]);
	}
	void uni(int x, int y) {
		x = find(x); y = find(y);
		if (x != y) par[x] = y;
	}
} d;
int Time = 0; int sta[NMAX + 5], par[NMAX + 5];
vector<vector<int> > a(NMAX + 5);
void dfs(int u, int p) {
	sta[u] = ++Time;
	for (auto v : a[u]) {
		if (v == p) continue;
		par[v] = u;
		dfs(v, u);
	}
}
void makeTree(int N, int M, int A[], int B[]) {
	for (int i = 0; i < M; i++) {
		if (d.find(A[i]) != d.find(B[i])) {
			d.uni(A[i], B[i]);
			a[A[i]].push_back(B[i]);
			a[B[i]].push_back(A[i]);
		}
	}
	dfs(0, 0);
}
// end of the common part
void Joi(int N, int M, int A[], int B[], long long X, int T) {
	makeTree(N, M, A, B);
	for (int i = 0; i < N; i++)
		MessageBoard(i, bit(X, sta[i] % 60));
}

#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define bit(x,y) ((x>>(y))&1LL)
#define NMAX 10000
#define MMAX 20000
#define MOVEMAX 20000

struct dsu {
	int par[NMAX + 5];
	dsu() {
		for (int i = 0; i < NMAX; i++) par[i] = i;
	}
	int find(int x) {
		if (par[x] == x) return x;
		return par[x] = find(par[x]);
	}
	void uni(int x, int y) {
		x = find(x); y = find(y);
		if (x != y) par[x] = y;
	}
} d;
int Time = 0; int sta[NMAX + 5], par[NMAX + 5], child[NMAX + 5];
vector<vector<int> > a(NMAX + 5);
int mark[60]; bool visited[NMAX + 5]; int rem;
void dfs(int u, int p) {
	sta[u] = ++Time;
	child[u] = 1;
	for (auto v : a[u]) {
		if (v == p) continue;
		par[v] = u;
		dfs(v, u);
		child[u] += child[v];
	}
}
void makeTree(int N, int M, int A[], int B[]) {
	for (int i = 0; i < M; i++) {
		if (d.find(A[i]) != d.find(B[i])) {
			d.uni(A[i], B[i]);
			a[A[i]].push_back(B[i]);
			a[B[i]].push_back(A[i]);
		}
	}
	dfs(0, 0);
}
int Lab(int u) {
	return sta[u] % 60;
}
bool cmp(int u, int v) {
	return child[u] < child[v];
}
void dfs(int u, int root, int Z, int from) {
	if (mark[Lab(u)] == -1) {
		mark[Lab(u)] = Z; rem--;
		if (rem == 0) throw 1;
	}
	visited[u] = true;
	sort(a[u].begin(), a[u].end(), cmp);
	for (int i = 0; i < a[u].size(); i++) {
		int v = a[u][i];
		if (v == par[u] || visited[v]) continue;
		dfs(v, root, Move(v), from);
	}
	if (u != root)
		Move(par[u]);
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
	long long ret = 0;
	makeTree(N, M, A, B);
	memset(mark, -1, sizeof(mark)); rem = 60;
	int last = V;
	while (child[P] < 60) {
		last = Move(par[P]);
		P = par[P];
	}
	try {
		dfs(P, P, last, P);
	}
	catch (...) {
		for (int i = 0; i < 60; i++) {
			if (mark[i] == 1) ret += (1LL << i);
		}
	}
	return ret;
}

Compilation message

Ioi.cpp: In function 'void dfs(int, int, int, int)':
Ioi.cpp:64:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a[u].size(); i++) {
                    ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5648 KB Output is correct
2 Correct 3 ms 5648 KB Output is correct
3 Correct 3 ms 5652 KB Output is correct
4 Correct 3 ms 5648 KB Output is correct
5 Correct 3 ms 5648 KB Output is correct
6 Correct 3 ms 5648 KB Output is correct
7 Correct 3 ms 5652 KB Output is correct
8 Correct 3 ms 5656 KB Output is correct
9 Correct 3 ms 5652 KB Output is correct
10 Correct 3 ms 5648 KB Output is correct
11 Correct 6 ms 5648 KB Output is correct
12 Correct 0 ms 5648 KB Output is correct
13 Correct 3 ms 5652 KB Output is correct
14 Correct 3 ms 5652 KB Output is correct
15 Correct 3 ms 5652 KB Output is correct
16 Correct 3 ms 5652 KB Output is correct
17 Correct 3 ms 5652 KB Output is correct
18 Correct 0 ms 5652 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 6296 KB Output is correct
2 Correct 32 ms 6324 KB Output is correct
3 Correct 25 ms 6324 KB Output is correct
4 Correct 15 ms 6296 KB Output is correct
5 Correct 22 ms 6432 KB Output is correct
6 Correct 18 ms 6388 KB Output is correct
7 Correct 15 ms 6424 KB Output is correct
8 Correct 15 ms 6464 KB Output is correct
9 Correct 22 ms 6484 KB Output is correct
10 Correct 9 ms 6424 KB Output is correct
11 Correct 15 ms 6424 KB Output is correct
12 Correct 12 ms 6192 KB Output is correct
13 Correct 12 ms 6192 KB Output is correct
14 Correct 15 ms 6176 KB Output is correct
15 Correct 18 ms 6324 KB Output is correct
16 Correct 15 ms 6296 KB Output is correct
17 Correct 15 ms 6296 KB Output is correct
18 Correct 18 ms 6296 KB Output is correct
19 Correct 12 ms 6296 KB Output is correct
20 Correct 9 ms 6488 KB Output is correct
21 Correct 12 ms 6468 KB Output is correct
22 Correct 22 ms 6220 KB Output is correct
23 Correct 22 ms 6368 KB Output is correct
24 Correct 18 ms 6264 KB Output is correct
25 Correct 15 ms 6324 KB Output is correct
26 Correct 22 ms 6372 KB Output is correct
27 Correct 25 ms 6376 KB Output is correct
28 Correct 19 ms 6404 KB Output is correct
29 Correct 15 ms 6316 KB Output is correct
30 Correct 22 ms 6292 KB Output is correct
31 Correct 3 ms 5648 KB Output is correct
32 Correct 0 ms 5648 KB Output is correct
33 Correct 3 ms 5656 KB Output is correct
34 Correct 3 ms 5648 KB Output is correct
35 Correct 3 ms 5648 KB Output is correct
36 Correct 3 ms 5648 KB Output is correct
37 Correct 3 ms 5648 KB Output is correct
38 Correct 0 ms 5648 KB Output is correct
39 Correct 0 ms 5648 KB Output is correct
40 Correct 3 ms 5648 KB Output is correct
41 Correct 3 ms 5648 KB Output is correct
42 Correct 3 ms 5648 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5648 KB Output is correct
2 Correct 3 ms 5648 KB Output is correct
3 Correct 3 ms 5648 KB Output is correct
4 Correct 3 ms 5796 KB Output is correct
5 Correct 3 ms 5796 KB Output is correct
6 Correct 3 ms 5796 KB Output is correct
7 Correct 0 ms 5796 KB Output is correct
8 Correct 3 ms 5796 KB Output is correct
9 Correct 18 ms 7016 KB Output is correct
10 Correct 22 ms 7012 KB Output is correct
11 Correct 12 ms 7020 KB Output is correct
12 Correct 3 ms 5648 KB Output is correct
13 Correct 0 ms 5648 KB Output is correct
14 Correct 0 ms 5648 KB Output is correct
15 Correct 3 ms 5648 KB Output is correct

Subtask #4
31.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 28 ms 6296 KB Partially correct
2 Partially correct 32 ms 6296 KB Partially correct
3 Partially correct 26 ms 6296 KB Partially correct
4 Partially correct 15 ms 6296 KB Partially correct
5 Correct 22 ms 6708 KB Output is correct
6 Partially correct 25 ms 6512 KB Partially correct
7 Correct 19 ms 6468 KB Output is correct
8 Correct 15 ms 6300 KB Output is correct
9 Correct 15 ms 6380 KB Output is correct
10 Partially correct 15 ms 6424 KB Partially correct
11 Partially correct 15 ms 6424 KB Partially correct
12 Correct 12 ms 6192 KB Output is correct
13 Correct 15 ms 6192 KB Output is correct
14 Correct 22 ms 6176 KB Output is correct
15 Partially correct 18 ms 6296 KB Partially correct
16 Partially correct 19 ms 6296 KB Partially correct
17 Partially correct 15 ms 6296 KB Partially correct
18 Partially correct 15 ms 6296 KB Partially correct
19 Partially correct 19 ms 6296 KB Partially correct
20 Correct 12 ms 6484 KB Output is correct
21 Correct 15 ms 6472 KB Output is correct
22 Partially correct 12 ms 6344 KB Partially correct
23 Correct 15 ms 6296 KB Output is correct
24 Correct 15 ms 6292 KB Output is correct
25 Correct 15 ms 6372 KB Output is correct
26 Correct 12 ms 6348 KB Output is correct
27 Correct 18 ms 6436 KB Output is correct
28 Correct 19 ms 6240 KB Output is correct
29 Correct 19 ms 6284 KB Output is correct
30 Correct 19 ms 6320 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 27 ms 6296 KB Output isn't correct
2 Halted 0 ms 0 KB -