oj.uz

Submission #39282

# Submission time Handle Problem Language Result Execution time Memory
39282 2018-01-10T15:46:12 Z UncleGrandpa925 Amusement Park (JOI17_amusement_park) C++14
10 / 100
 32 ms 6820 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];
	vector<vector<int> > a(NMAX + 5);
	int mark[60]; bool visited[NMAX + 5]; int rem;
	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);
	}
	int Lab(int u) {
		return sta[u] % 60;
	}
	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;
		if (u == root) {
			int p = 0;
			for (int i = 0; i < a[u].size(); i++) {
				int v = a[u][i];
				if (v == from) {
					p = i; break;
				}
			}
			for (int i = p; i < a[u].size(); i++) {
				int v = a[u][i];
				if (v == par[u] || visited[v]) continue;
				dfs(v, root, Move(v), from);
			}
		}
		else {
			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]);
		}
		else {
			dfs(par[u], par[u], Move(par[u]), 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;
		try {
			dfs(P, P, V, 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:60:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0; i < a[u].size(); i++) {
                      ^
Ioi.cpp:66:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = p; i < a[u].size(); i++) {
                      ^
Ioi.cpp:73:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0; i < a[u].size(); i++) {
                      ^

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5464 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 6256 KB Output is correct
2 Correct 26 ms 6284 KB Output is correct
3 Correct 28 ms 6284 KB Output is correct
4 Correct 26 ms 6256 KB Output is correct
5 Correct 22 ms 6324 KB Output is correct
6 Correct 18 ms 6300 KB Output is correct
7 Correct 22 ms 6336 KB Output is correct
8 Correct 25 ms 6364 KB Output is correct
9 Correct 26 ms 6384 KB Output is correct
10 Correct 22 ms 6384 KB Output is correct
11 Correct 9 ms 6384 KB Output is correct
12 Correct 12 ms 6152 KB Output is correct
13 Correct 22 ms 6152 KB Output is correct
14 Correct 15 ms 6136 KB Output is correct
15 Correct 19 ms 6284 KB Output is correct
16 Correct 12 ms 6256 KB Output is correct
17 Correct 18 ms 6256 KB Output is correct
18 Correct 15 ms 6256 KB Output is correct
19 Correct 18 ms 6256 KB Output is correct
20 Incorrect 9 ms 6216 KB Wrong Answer [7]
21 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5608 KB Output is correct
2 Correct 0 ms 5608 KB Output is correct
3 Correct 3 ms 5608 KB Output is correct
4 Correct 0 ms 5756 KB Output is correct
5 Correct 3 ms 5756 KB Output is correct
6 Correct 3 ms 5756 KB Output is correct
7 Correct 3 ms 5756 KB Output is correct
8 Correct 3 ms 5756 KB Output is correct
9 Correct 6 ms 6820 KB Output is correct
10 Correct 18 ms 6820 KB Output is correct
11 Correct 15 ms 6816 KB Output is correct
12 Correct 0 ms 5608 KB Output is correct
13 Correct 0 ms 5608 KB Output is correct
14 Correct 3 ms 5604 KB Output is correct
15 Correct 0 ms 5604 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 6256 KB Output is correct
2 Correct 25 ms 6256 KB Output is correct
3 Correct 22 ms 6256 KB Output is correct
4 Correct 18 ms 6256 KB Output is correct
5 Partially correct 15 ms 6564 KB Partially correct
6 Correct 15 ms 6408 KB Output is correct
7 Correct 15 ms 6364 KB Output is correct
8 Correct 18 ms 6256 KB Output is correct
9 Correct 18 ms 6296 KB Output is correct
10 Correct 12 ms 6384 KB Output is correct
11 Correct 15 ms 6384 KB Output is correct
12 Correct 12 ms 6152 KB Output is correct
13 Correct 22 ms 6152 KB Output is correct
14 Correct 15 ms 6136 KB Output is correct
15 Correct 12 ms 6256 KB Output is correct
16 Correct 12 ms 6256 KB Output is correct
17 Correct 15 ms 6256 KB Output is correct
18 Correct 18 ms 6256 KB Output is correct
19 Correct 15 ms 6256 KB Output is correct
20 Incorrect 6 ms 6204 KB Wrong Answer [7]
21 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 6256 KB Output is correct
2 Correct 32 ms 6256 KB Output is correct
3 Correct 22 ms 6256 KB Output is correct
4 Correct 18 ms 6256 KB Output is correct
5 Correct 15 ms 6672 KB Output is correct
6 Correct 12 ms 6304 KB Output is correct
7 Correct 12 ms 6256 KB Output is correct
8 Correct 15 ms 6376 KB Output is correct
9 Correct 15 ms 6324 KB Output is correct
10 Correct 15 ms 6384 KB Output is correct
11 Correct 12 ms 6384 KB Output is correct
12 Correct 12 ms 6152 KB Output is correct
13 Correct 12 ms 6152 KB Output is correct
14 Correct 18 ms 6136 KB Output is correct
15 Correct 22 ms 6256 KB Output is correct
16 Correct 22 ms 6256 KB Output is correct
17 Correct 25 ms 6256 KB Output is correct
18 Correct 18 ms 6256 KB Output is correct
19 Correct 18 ms 6256 KB Output is correct
20 Incorrect 12 ms 6216 KB Wrong Answer [7]
21 Halted 0 ms 0 KB -