oj.uz

Submission #206965

# Submission time Handle Problem Language Result Execution time Memory
206965 2020-03-06T02:09:41 Z E869120 Meetings (JOI19_meetings) C++14
100 / 100
 1704 ms 1068 KB 
#include "meetings.h"
#include <vector>
#include <algorithm>
using namespace std;

vector<int> G[2009];
vector<int> I, J1, J2;
bool passed[2009];
bool forced[2009];

void dfs(int pos) {
	passed[pos] = true; int cnts = 0;
	for (int i = 0; i < G[pos].size(); i++) {
		if (passed[G[pos][i]] == true) continue;
		dfs(G[pos][i]); cnts++;
	}
	if (cnts == 0) I.push_back(pos);
}

void dfs2(int pos, int to) {
	if (pos == to) { J2 = J1; return; }
	passed[pos] = true;
	for (int i = 0; i < G[pos].size(); i++) {
		if (passed[G[pos][i]] == true) continue;
		J1.push_back(G[pos][i]);
		dfs2(G[pos][i], to);
		J1.pop_back();
	}
}

vector<int> getpath(int u, int v) {
	J1.clear(); J2.clear();
	J1.push_back(u);
	dfs2(u, v);
	return J2;
}

int getlca(int root, vector<pair<int, int>> E) {
	vector<int> cand; I.clear();
	for (int i = 0; i < E.size(); i++) cand.push_back(E[i].first);
	for (int i = 0; i < E.size(); i++) cand.push_back(E[i].second);
	for (int i : cand) G[i].clear();
	for (int i : cand) passed[i] = false;
	for (int i : cand) forced[i] = false;

	for (int i = 0; i < E.size(); i++) {
		G[E[i].first].push_back(E[i].second);
		G[E[i].second].push_back(E[i].first);
	}
	dfs(E[0].first);
	if (G[E[0].first].size() == 1) I.push_back(E[0].first);

	int mi = I.size() / 2;
	for (int i = mi; i < I.size(); i++) {
		int R = Query(root, I[i - mi], I[i]);
		for (int j : cand) passed[j] = false;
		vector<int> C1 = getpath(I[i - mi], R);
		for (int j = 0; j < C1.size() - 1; j++) forced[C1[j]] = true;
		for (int j : cand) passed[j] = false;
		vector<int> C2 = getpath(I[i], R);
		for (int j = 0; j < C2.size() - 1; j++) forced[C2[j]] = true;
	}

	for (int i : cand) {
		if (forced[i] == false) return i;
	}
	return -1;
}

vector<pair<int, int>> dfs(vector<int> A) {
	if (A.size() == 1) {
		return vector<pair<int, int>>{};
	}
	if (A.size() == 2) {
		return vector<pair<int, int>>{make_pair(A[0], A[1])};
	}
	if (A.size() == 3) {
		int R = Query(A[0], A[1], A[2]);
		vector<pair<int, int>> E;
		for (int i : A) { if (i != R) E.push_back(make_pair(i, R)); }
		return E;
	}

	// 重心っぽい頂点を見つける
	int grav = -1;
	while (true) {
		int s = rand() % A.size(), cnt = 0; bool flag = false;
		for (int i = 1; i <= 6; i++) {
			int t = -1, u = -1;
			while (A[s] == t || t == u || A[s] == u) {
				t = A[rand() % A.size()];
				u = A[rand() % A.size()];
			}
			if (Query(A[s], t, u) == A[s]) cnt++;
			if (i == 2 && cnt <= 0) { flag = true; break; }
			if (i == 4 && cnt <= 1) { flag = true; break; }
			if (i == 6 && cnt <= 2) { flag = true; break; }
			//if (i == 8 && cnt <= 3) { flag = true; break; }
		}
		if (flag == false) { grav = s; break; }
	}

	// 重心分解をする
	vector<bool> used(A.size(), 0);
	used[grav] = true; int rem = A.size() - 1;
	vector<vector<int>> centroid;
	while (rem > 0) {
		int p = -1;
		while (p == -1 || used[p] == true) {
			p = rand() % A.size();
		}
		vector<int> cand; cand.push_back(A[p]); used[p] = true; rem--;
		for (int i = 0; i < A.size(); i++) {
			if (used[i] == true || i == p) continue;
			if (Query(A[grav], A[p], A[i]) != A[grav]) { cand.push_back(A[i]); used[i] = true; rem--; }
		}
		centroid.push_back(cand);
	}

	// 復元をする
	vector<pair<int, int>> ans;
	for (vector<int> f : centroid) {
		vector<pair<int, int>> Z = dfs(f);
		for (pair<int, int> i : Z) ans.push_back(i);
		int U = f[0];
		if (Z.size() >= 1) U = getlca(A[grav], Z);
		ans.push_back(make_pair(A[grav], U));
	}
	return ans;
}

void Solve(int N) {
	vector<int> L;
	for (int i = 0; i < N; i++) L.push_back(i);

	vector<pair<int, int>> V = dfs(L);

	for (int i = 0; i < V.size(); i++) {
		if (V[i].first > V[i].second) swap(V[i].first, V[i].second);
		Bridge(V[i].first, V[i].second);
	}
	return;
}

Compilation message

meetings.cpp: In function 'void dfs(int)':
meetings.cpp:13:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < G[pos].size(); i++) {
                  ~~^~~~~~~~~~~~~~~
meetings.cpp: In function 'void dfs2(int, int)':
meetings.cpp:23:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < G[pos].size(); i++) {
                  ~~^~~~~~~~~~~~~~~
meetings.cpp: In function 'int getlca(int, std::vector<std::pair<int, int> >)':
meetings.cpp:40:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < E.size(); i++) cand.push_back(E[i].first);
                  ~~^~~~~~~~~~
meetings.cpp:41:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < E.size(); i++) cand.push_back(E[i].second);
                  ~~^~~~~~~~~~
meetings.cpp:46:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < E.size(); i++) {
                  ~~^~~~~~~~~~
meetings.cpp:54:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = mi; i < I.size(); i++) {
                   ~~^~~~~~~~~~
meetings.cpp:58:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < C1.size() - 1; j++) forced[C1[j]] = true;
                   ~~^~~~~~~~~~~~~~~
meetings.cpp:61:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < C2.size() - 1; j++) forced[C2[j]] = true;
                   ~~^~~~~~~~~~~~~~~
meetings.cpp: In function 'std::vector<std::pair<int, int> > dfs(std::vector<int>)':
meetings.cpp:113:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < A.size(); i++) {
                   ~~^~~~~~~~~~
meetings.cpp: In function 'void Solve(int)':
meetings.cpp:138:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < V.size(); i++) {
                  ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 504 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 380 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 6 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 380 KB Output is correct
26 Correct 5 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 380 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 6 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 380 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 22 ms 376 KB Output is correct
28 Correct 27 ms 376 KB Output is correct
29 Correct 27 ms 376 KB Output is correct
30 Correct 20 ms 504 KB Output is correct
31 Correct 19 ms 504 KB Output is correct
32 Correct 28 ms 504 KB Output is correct
33 Correct 29 ms 376 KB Output is correct
34 Correct 26 ms 376 KB Output is correct
35 Correct 26 ms 376 KB Output is correct
36 Correct 22 ms 376 KB Output is correct
37 Correct 20 ms 376 KB Output is correct
38 Correct 19 ms 376 KB Output is correct
39 Correct 17 ms 376 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1443 ms 944 KB Output is correct
2 Correct 1509 ms 760 KB Output is correct
3 Correct 1704 ms 908 KB Output is correct
4 Correct 1361 ms 760 KB Output is correct
5 Correct 1447 ms 816 KB Output is correct
6 Correct 1265 ms 848 KB Output is correct
7 Correct 1170 ms 816 KB Output is correct
8 Correct 1244 ms 900 KB Output is correct
9 Correct 1077 ms 664 KB Output is correct
10 Correct 1025 ms 888 KB Output is correct
11 Correct 1149 ms 816 KB Output is correct
12 Correct 1421 ms 1016 KB Output is correct
13 Correct 1429 ms 1004 KB Output is correct
14 Correct 1150 ms 888 KB Output is correct
15 Correct 1141 ms 888 KB Output is correct
16 Correct 1210 ms 876 KB Output is correct
17 Correct 1062 ms 812 KB Output is correct
18 Correct 1047 ms 888 KB Output is correct
19 Correct 1261 ms 836 KB Output is correct
20 Correct 1366 ms 932 KB Output is correct
21 Correct 1400 ms 760 KB Output is correct
22 Correct 1340 ms 1016 KB Output is correct
23 Correct 1317 ms 832 KB Output is correct
24 Correct 1323 ms 760 KB Output is correct
25 Correct 1380 ms 760 KB Output is correct
26 Correct 1360 ms 984 KB Output is correct
27 Correct 1327 ms 888 KB Output is correct
28 Correct 1258 ms 864 KB Output is correct
29 Correct 1087 ms 824 KB Output is correct
30 Correct 1180 ms 940 KB Output is correct
31 Correct 1160 ms 888 KB Output is correct
32 Correct 1233 ms 1068 KB Output is correct
33 Correct 1083 ms 1048 KB Output is correct
34 Correct 23 ms 504 KB Output is correct
35 Correct 23 ms 504 KB Output is correct
36 Correct 25 ms 504 KB Output is correct
37 Correct 19 ms 376 KB Output is correct
38 Correct 18 ms 376 KB Output is correct
39 Correct 25 ms 376 KB Output is correct
40 Correct 26 ms 508 KB Output is correct
41 Correct 26 ms 376 KB Output is correct
42 Correct 24 ms 376 KB Output is correct
43 Correct 22 ms 376 KB Output is correct
44 Correct 19 ms 504 KB Output is correct
45 Correct 19 ms 376 KB Output is correct
46 Correct 17 ms 380 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Correct 6 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
54 Correct 5 ms 376 KB Output is correct
55 Correct 5 ms 372 KB Output is correct
56 Correct 5 ms 376 KB Output is correct
57 Correct 5 ms 376 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 5 ms 376 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 5 ms 376 KB Output is correct
62 Correct 5 ms 376 KB Output is correct
63 Correct 5 ms 376 KB Output is correct
64 Correct 4 ms 376 KB Output is correct
65 Correct 5 ms 376 KB Output is correct
66 Correct 5 ms 376 KB Output is correct
67 Correct 5 ms 376 KB Output is correct
68 Correct 4 ms 376 KB Output is correct
69 Correct 4 ms 376 KB Output is correct
70 Correct 4 ms 376 KB Output is correct
71 Correct 5 ms 376 KB Output is correct
72 Correct 4 ms 376 KB Output is correct