oj.uz

답안 #36018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
36018 2017-12-04T08:37:55 Z cheater2k Amusement Park (JOI17_amusement_park) C++14
100 / 100
 245 ms 11580 KB 
#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;

const int MAX = 10005;

namespace JOI {
	int n, m;
	int pos[MAX];
	int par[MAX];
	int id[MAX];
	bool vis[MAX];
	int ncomp;
	vector<int> comp[MAX];
	vector<int> G[MAX];
	long long X;
	
	void build() {
		vector< pair<int,int> > edges;
		for (int i = 0; i < n; ++i) pos[i] = 0;
		queue <int> q; q.push(0); pos[0] = 1;
	
		while(!q.empty()) {
			int u = q.front(); q.pop();
			for (int v : G[u]) {
				if (!pos[v]) q.push(v), pos[v] = 1, edges.push_back(make_pair(u,v));
			}
		}
		for (int i = 0; i < n; ++i) G[i].clear(), pos[i] = 0;
		for (auto e : edges) G[e.first].push_back(e.second), G[e.second].push_back(e.first);
	}

	void dfs(int u) {
		if (comp[ncomp].size() == 60) return;
		pos[u] = ncomp;
		comp[ncomp].push_back(u);
		for (int v : G[u]) if (!pos[v]) {
			par[v] = u;
			dfs(v);
		}
	}

	void add(int u, int c) {
		if (comp[c].size() == 60) return;
		comp[c].push_back(u);
		vis[u] = 1;
		for (int v : G[u]) {
			if (pos[v] == pos[u] && !vis[v]) add(v, c);
		}
	}

	void prepare() {
		build();
		for (int i = 0; i < n; ++i) if (!pos[i]) ++ncomp, dfs(i);

		for (int i = 1; i <= ncomp; ++i) if (comp[i].size() == 60) {
			for (int j = 0; j < comp[i].size(); ++j) id[comp[i][j]] = j;
		}
		if (comp[ncomp].empty()) --ncomp;
		
		for (int i = 1; i <= ncomp; ++i) {
			if (comp[i].size() < 60) {
				int sz = comp[i].size();
				int root = -1;
				for (int u : comp[i]) {
					if (root != -1) break;
					for (int v : G[u]) if (pos[u] != pos[v] && comp[pos[v]].size() == 60) {
						root = v;
						break;
					}
				}
				add(root, i);

				long long mask = 0;
				vector<int> rem;
				for (int j = sz; j < 60; ++j) mask |= (1LL << id[comp[i][j]]);
				for (int j = 0; j < 60; ++j) if (!(mask >> j & 1)) rem.push_back(j);
				for (int j = 0; j < sz; ++j) id[comp[i][j]] = rem.back(), rem.pop_back();
				for (int u : comp[i]) vis[u] = false;
			}
		}
	}

	void assign() {
		JOI::prepare();
		for (int i = 0; i < n; ++i) MessageBoard(i, (X >> id[i] & 1));
	}
};

void Joi(int N, int M, int A[], int B[], long long X, int T) {
  JOI::n = N; 
  JOI::m = M;
  JOI::X = X;
  for (int i = 0; i < M; ++i) JOI::G[A[i]].push_back(B[i]), JOI::G[B[i]].push_back(A[i]);
  JOI::assign();
}

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

const int MAX = 10005;

namespace IOI {
	int n, m;
	int pos[MAX];
	int id[MAX];
	bool vis[MAX];
	int ncomp;
	vector<int> comp[MAX];
	vector<int> G[MAX];
	long long X;
	
	void build() {
		vector< pair<int,int> > edges;
		for (int i = 0; i < n; ++i) pos[i] = 0;
		queue <int> q; q.push(0); pos[0] = 1;
	
		while(!q.empty()) {
			int u = q.front(); q.pop();
			for (int v : G[u]) {
				if (!pos[v]) q.push(v), pos[v] = 1, edges.push_back(make_pair(u,v));
			}
		}
		for (int i = 0; i < n; ++i) G[i].clear(), pos[i] = 0;
		for (auto e : edges) G[e.first].push_back(e.second), G[e.second].push_back(e.first);
	}

	void dfs(int u) {
		if (comp[ncomp].size() == 60) return;
		pos[u] = ncomp;
		comp[ncomp].push_back(u);
		for (int v : G[u]) if (!pos[v]) {
			dfs(v);
		}
	}

	void add(int u, int c) {
		if (comp[c].size() == 60) return;
		comp[c].push_back(u);
		vis[u] = 1;
		for (int v : G[u]) {
			if (pos[v] == pos[u] && !vis[v]) add(v, c);
		}
	}

	void prepare() {
		build();
		for (int i = 0; i < n; ++i) if (!pos[i]) ++ncomp, dfs(i);

		for (int i = 1; i <= ncomp; ++i) if (comp[i].size() == 60) {
			for (int j = 0; j < comp[i].size(); ++j) id[comp[i][j]] = j;
		}
		if (comp[ncomp].empty()) --ncomp;

		for (int i = 1; i <= ncomp; ++i) {
			if (comp[i].size() < 60) {
				int sz = comp[i].size();
				int root = -1;
				for (int u : comp[i]) {
					if (root != -1) break;
					for (int v : G[u]) {
						if (pos[v] != i && comp[pos[v]].size() == 60) { root = v; break; }
					}
				}
				add(root, i);

				long long mask = 0;
				vector<int> rem;
				for (int j = sz; j < 60; ++j) mask |= (1LL << id[comp[i][j]]);
				for (int j = 0; j < 60; ++j) if (!(mask >> j & 1)) rem.push_back(j);
				for (int j = 0; j < sz; ++j) id[comp[i][j]] = rem.back(), rem.pop_back();
				for (int u : comp[i]) vis[u] = false;
			}
		}
	}

	void Ask(int u, int p, int c) {
		pos[u] = 1;
		for (int v : G[u]) if (find(comp[c].begin(), comp[c].end(), v) != comp[c].end()) {
			if (pos[v] == 0) {
				int k = Move(v); X |= ((1LL << id[v]) * k);
				//cerr << "ASK " << id[v] << ' ' << k << ' ' << (X >> id[v] & 1) << endl;
				Ask(v, u, c);
			}
		}
		if (p != -1) Move(p);
	}

	void solve(int P, int V) {
		prepare();
		int c = pos[P];
		X |= ((1LL << id[P]) * V);
		for (int i = 0; i < n; ++i) pos[i] = 0;
		Ask(P, -1, c);
	}
};

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
  IOI::n = N; 
  IOI::m = M;
  for (int i = 0; i < M; ++i) IOI::G[A[i]].push_back(B[i]), IOI::G[B[i]].push_back(A[i]);
  IOI::solve(P, V);
	return IOI::X;
}

Compilation message

Joi.cpp: In function 'void JOI::prepare()':
Joi.cpp:57:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < comp[i].size(); ++j) id[comp[i][j]] = j;
                      ^

Ioi.cpp: In function 'void IOI::prepare()':
Ioi.cpp:55:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < comp[i].size(); ++j) id[comp[i][j]] = j;
                      ^

Subtask #1
8.0 / 8.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 7244 KB Output is correct
2 Correct 28 ms 7244 KB Output is correct
3 Correct 32 ms 7252 KB Output is correct
4 Correct 15 ms 7236 KB Output is correct
5 Correct 15 ms 6964 KB Output is correct
6 Correct 32 ms 7756 KB Output is correct
7 Correct 35 ms 7748 KB Output is correct
8 Correct 19 ms 7492 KB Output is correct
9 Correct 32 ms 7484 KB Output is correct
10 Correct 245 ms 11316 KB Output is correct
11 Correct 229 ms 11580 KB Output is correct
12 Correct 15 ms 7020 KB Output is correct
13 Correct 12 ms 7020 KB Output is correct
14 Correct 12 ms 6988 KB Output is correct
15 Correct 22 ms 7220 KB Output is correct
16 Correct 15 ms 7220 KB Output is correct
17 Correct 22 ms 7236 KB Output is correct
18 Correct 22 ms 7236 KB Output is correct
19 Correct 19 ms 7236 KB Output is correct
20 Correct 9 ms 6964 KB Output is correct
21 Correct 9 ms 6972 KB Output is correct
22 Correct 49 ms 8532 KB Output is correct
23 Correct 45 ms 8532 KB Output is correct
24 Correct 49 ms 8532 KB Output is correct
25 Correct 49 ms 8532 KB Output is correct
26 Correct 49 ms 8532 KB Output is correct
27 Correct 52 ms 8532 KB Output is correct
28 Correct 41 ms 8268 KB Output is correct
29 Correct 35 ms 8212 KB Output is correct
30 Correct 46 ms 8236 KB Output is correct
31 Correct 0 ms 5908 KB Output is correct
32 Correct 0 ms 5908 KB Output is correct
33 Correct 0 ms 6172 KB Output is correct
34 Correct 0 ms 5908 KB Output is correct
35 Correct 0 ms 5908 KB Output is correct
36 Correct 0 ms 5908 KB Output is correct
37 Correct 0 ms 5908 KB Output is correct
38 Correct 0 ms 5908 KB Output is correct
39 Correct 0 ms 5908 KB Output is correct
40 Correct 0 ms 5908 KB Output is correct
41 Correct 0 ms 5908 KB Output is correct
42 Correct 0 ms 5908 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5908 KB Output is correct
2 Correct 0 ms 5908 KB Output is correct
3 Correct 0 ms 5908 KB Output is correct
4 Correct 0 ms 6172 KB Output is correct
5 Correct 0 ms 6172 KB Output is correct
6 Correct 0 ms 6172 KB Output is correct
7 Correct 0 ms 6172 KB Output is correct
8 Correct 0 ms 6172 KB Output is correct
9 Correct 9 ms 6972 KB Output is correct
10 Correct 9 ms 6972 KB Output is correct
11 Correct 6 ms 6972 KB Output is correct
12 Correct 0 ms 5908 KB Output is correct
13 Correct 0 ms 5908 KB Output is correct
14 Correct 0 ms 5908 KB Output is correct
15 Correct 0 ms 5908 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 7252 KB Output is correct
2 Correct 28 ms 7244 KB Output is correct
3 Correct 32 ms 7252 KB Output is correct
4 Correct 22 ms 7236 KB Output is correct
5 Correct 22 ms 6964 KB Output is correct
6 Correct 39 ms 7748 KB Output is correct
7 Correct 27 ms 7492 KB Output is correct
8 Correct 28 ms 7492 KB Output is correct
9 Correct 32 ms 7484 KB Output is correct
10 Correct 239 ms 11316 KB Output is correct
11 Correct 218 ms 11316 KB Output is correct
12 Correct 15 ms 7020 KB Output is correct
13 Correct 15 ms 7020 KB Output is correct
14 Correct 15 ms 6988 KB Output is correct
15 Correct 18 ms 7220 KB Output is correct
16 Correct 18 ms 7228 KB Output is correct
17 Correct 18 ms 7236 KB Output is correct
18 Correct 18 ms 7236 KB Output is correct
19 Correct 15 ms 7236 KB Output is correct
20 Correct 0 ms 6964 KB Output is correct
21 Correct 9 ms 6972 KB Output is correct
22 Correct 46 ms 8532 KB Output is correct
23 Correct 41 ms 8532 KB Output is correct
24 Correct 41 ms 8532 KB Output is correct
25 Correct 38 ms 8268 KB Output is correct
26 Correct 41 ms 8532 KB Output is correct
27 Correct 35 ms 8268 KB Output is correct
28 Correct 35 ms 8532 KB Output is correct
29 Correct 48 ms 8212 KB Output is correct
30 Correct 39 ms 8236 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 7244 KB Output is correct
2 Correct 32 ms 7244 KB Output is correct
3 Correct 27 ms 7252 KB Output is correct
4 Correct 22 ms 7236 KB Output is correct
5 Correct 19 ms 6964 KB Output is correct
6 Correct 25 ms 7484 KB Output is correct
7 Correct 28 ms 7492 KB Output is correct
8 Correct 25 ms 7748 KB Output is correct
9 Correct 25 ms 7492 KB Output is correct
10 Correct 235 ms 11316 KB Output is correct
11 Correct 235 ms 11316 KB Output is correct
12 Correct 15 ms 7020 KB Output is correct
13 Correct 15 ms 7020 KB Output is correct
14 Correct 18 ms 6988 KB Output is correct
15 Correct 22 ms 7220 KB Output is correct
16 Correct 32 ms 7228 KB Output is correct
17 Correct 15 ms 7236 KB Output is correct
18 Correct 22 ms 7236 KB Output is correct
19 Correct 12 ms 7236 KB Output is correct
20 Correct 15 ms 6964 KB Output is correct
21 Correct 15 ms 6972 KB Output is correct
22 Correct 35 ms 8532 KB Output is correct
23 Correct 52 ms 8532 KB Output is correct
24 Correct 46 ms 8532 KB Output is correct
25 Correct 49 ms 8532 KB Output is correct
26 Correct 39 ms 8532 KB Output is correct
27 Correct 52 ms 8532 KB Output is correct
28 Correct 52 ms 8532 KB Output is correct
29 Correct 38 ms 8212 KB Output is correct
30 Correct 46 ms 8236 KB Output is correct
31 Correct 0 ms 5908 KB Output is correct
32 Correct 0 ms 5908 KB Output is correct
33 Correct 0 ms 6172 KB Output is correct
34 Correct 0 ms 5908 KB Output is correct
35 Correct 0 ms 5908 KB Output is correct
36 Correct 0 ms 5908 KB Output is correct
37 Correct 0 ms 5908 KB Output is correct
38 Correct 0 ms 5908 KB Output is correct
39 Correct 0 ms 5908 KB Output is correct
40 Correct 0 ms 5908 KB Output is correct
41 Correct 0 ms 5908 KB Output is correct
42 Correct 0 ms 5908 KB Output is correct