oj.uz

Submission #207014

# Submission time Handle Problem Language Result Execution time Memory
207014 2020-03-06T05:13:02 Z E869120 Meetings (JOI19_meetings) C++14
100 / 100
 1138 ms 3320 KB 
#include "meetings.h"
#include <vector>
#include <map>
#include <ctime>
#include <iostream>
#include <algorithm>
using namespace std;

// 同じコードを提出して，https://oj.uz/submission/206974 では 100 点取れているんですけど，
// ひどい仕打ちをやめてくれ！
// おい，なめてんのか，grader の Query 関数は LCA で O(log N) で実装できるのに，なんで実装サボってんだ！！！！！！

vector<int> G[2009];
vector<int> I, J1, J2;
int ret1, ret2, ret3, ret4, allret;
bool passed[2009];
bool forced[2009];
map<pair<int, int>, int> Map[2009];

void init() {
	for (int i = 0; i < 2009; i++) G[i].clear();
	for (int i = 0; i < 2009; i++) { passed[i] = false; forced[i] = false; Map[i].clear(); }
	ret1 = 0; ret2 = 0; ret3 = 0; ret4 = 0; allret = 0;
	I.clear(); J1.clear(); J2.clear();
}

int Ask(int u, int v, int w) {
	int x[3] = { u, v, w };
	sort(x, x + 3);
	if (Map[x[0]][make_pair(x[1], x[2])] >= 1) return Map[x[0]][make_pair(x[1], x[2])] - 1;
	int Z = Query(x[0], x[1], x[2]);
	Map[x[0]][make_pair(x[1], x[2])] = Z + 1;
	return Z;
}

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 = Ask(root, I[i - mi], I[i]); ret3++;
		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>>{};
	}
	else if (A.size() == 2) {
		return vector<pair<int, int>>{make_pair(A[0], A[1])};
	}
	else if (A.size() == 3) {
		ret4++;
		int R = Ask(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;
	}
	else if (A.size() == 4) {
		vector<int> G1[24], G2[24];
		for (int i = 1; i < A.size(); i++) {
			for (int j = i + 1; j < A.size(); j++) {
				int V = Ask(A[0], A[i], A[j]); ret4++;
				if (V == A[i]) { G1[i].push_back(j); G2[j].push_back(i); }
				if (V == A[j]) { G1[j].push_back(i); G2[i].push_back(j); }
			}
		}
		vector<int> dist(24, 0);
		for (int i = 0; i < A.size(); i++) {
			for (int j = 0; j < A.size(); j++) {
				for (int k : G1[j]) dist[k] = max(dist[k], dist[j] + 1);
			}
		}
		vector<pair<int, int>> E;
		for (int i = 1; i < A.size(); i++) {
			int s = 0;
			for (int j : G2[i]) {
				if (dist[j] == dist[i] - 1) s = j;
			}
			E.push_back(make_pair(A[i], A[s]));
		}
		return E;
	}
	else {
		allret += A.size();
		//cout << allret << " " << A.size() << endl;
	}

	// 重心っぽい頂点を見つける
	int grav = -1;
	while (true) {
		int s = rand() % A.size(), cnt = 0; bool flag = false;
		int maxlim = 0;
		if (A.size() <= 7) maxlim = 0;
		else if (A.size() <= 20) maxlim = 1;
		else if (A.size() <= 50) maxlim = 3;
		else if (A.size() <= 200) maxlim = 6;
		else if (A.size() <= 500) maxlim = 13;
		else if (A.size() <= 1000) maxlim = 24;
		else if (A.size() <= 2000) maxlim = 37;
		for (int i = 1; i <= maxlim; 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()];
			}
			ret1++;
			if (Ask(A[s], t, u) == A[s]) cnt++;
			if (i == 1 && cnt <= 0) { flag = true; break; }
			if (i == 3 && cnt <= 1) { flag = true; break; }
			if (i == 6 && cnt <= 2) { flag = true; break; }
			if (i == 9 && cnt <= 3) { flag = true; break; }
			if (i == 13 && cnt <= 4) { flag = true; break; }
			if (i == 16 && cnt <= 5) { flag = true; break; }
			if (i == 20 && cnt <= 6) { flag = true; break; }
			if (i == 24 && cnt <= 7) { flag = true; break; }
			if (i == 28 && cnt <= 8) { flag = true; break; }
			if (i == 32 && cnt <= 9) { flag = true; break; }
			if (i == 37 && cnt <= 10) { flag = true; break; }
		}
		if (flag == false) { grav = s; break; }
	}
	//cout << A.size() << " " << ret1 << endl;

	// 重心分解をする
	vector<int> cand;
	for (int i = 0; i < A.size(); i++) { if (i != grav) cand.push_back(i); }
	for (int i = 0; i < A.size() * 20; i++) swap(cand[rand() % cand.size()], cand[rand() % cand.size()]);

	vector<vector<int>> centroid;
	for (int i : cand) {
		vector<pair<int, int>> Z;
		for (int j = 0; j < centroid.size(); j++) Z.push_back(make_pair(centroid[j].size(), j));
		sort(Z.begin(), Z.end());
		reverse(Z.begin(), Z.end());

		if (Z.size() == 0) {
			centroid.push_back(vector<int>{A[i]});
		}
		else {
			int method1 = 0, method2 = 0; int rem1 = 0, rem2 = 0;
			for (int j = 0; j < Z.size(); j++) {
				int teisuu1 = j + 1, teisuu2 = 0;
				if (Z.size() % 2 == 0) teisuu2 = (j / 2) + 2;
				if (Z.size() % 2 == 1) { if (j == 0) teisuu2 = 1; else teisuu2 = ((j + 1) / 2) + 2; }
				method1 += teisuu1 * Z[j].first;
				method2 += teisuu2 * Z[j].first;
				rem1 = max(rem1, teisuu1);
				rem2 = max(rem2, teisuu2);
			}
			method1 += rem1;
			method2 += rem2;

			bool flag = false; 
			if (method1 < method2) {
				for (int j = 0; j < Z.size(); j++) {
					int num = Z[j].second;
					int root = centroid[num][0];
					int V = Ask(A[grav], A[i], root); ret2++;
					if (V != A[grav]) { centroid[num].push_back(A[i]); flag = true; break; }
				}
			}
			else {
				int j = 0;
				while (j < (int)Z.size()) {
					if (j == 0 && Z.size() % 2 == 1) {
						int num = Z[j].second;
						int root = centroid[num][0];
						int V = Ask(A[grav], A[i], root); ret2++;
						if (V != A[grav]) { centroid[num].push_back(A[i]); flag = true; break; }
						j += 1;
					}
					else {
						int num1 = Z[j].second, num2 = Z[j + 1].second;
						int root1 = centroid[num1][0], root2 = centroid[num2][0];
						int V = Ask(root1, root2, A[i]); ret2++;
						if (V == A[grav]) { j += 2; continue; }
						int V1 = Ask(A[grav], A[i], root1); ret2++;
						if (V1 != A[grav]) { centroid[num1].push_back(A[i]); flag = true; break; }
						if (V1 == A[grav]) { centroid[num2].push_back(A[i]); flag = true; break; }
						j += 2;
					}
				}
			}
			if (flag == false) {
				centroid.push_back(vector<int>{A[i]});
			}
		}
	}

	// 復元をする
	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) {
	init();
	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:38: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:48: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:65: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:66: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:71:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < E.size(); i++) {
                  ~~^~~~~~~~~~
meetings.cpp:79:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = mi; i < I.size(); i++) {
                   ~~^~~~~~~~~~
meetings.cpp:83: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:86: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:111:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 1; i < A.size(); i++) {
                   ~~^~~~~~~~~~
meetings.cpp:112:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = i + 1; j < A.size(); j++) {
                        ~~^~~~~~~~~~
meetings.cpp:119:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < A.size(); i++) {
                   ~~^~~~~~~~~~
meetings.cpp:120:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < A.size(); j++) {
                    ~~^~~~~~~~~~
meetings.cpp:125:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 1; i < A.size(); i++) {
                   ~~^~~~~~~~~~
meetings.cpp:177:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < A.size(); i++) { if (i != grav) cand.push_back(i); }
                  ~~^~~~~~~~~~
meetings.cpp:178:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < A.size() * 20; i++) swap(cand[rand() % cand.size()], cand[rand() % cand.size()]);
                  ~~^~~~~~~~~~~~~~~
meetings.cpp:183:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < centroid.size(); j++) Z.push_back(make_pair(centroid[j].size(), j));
                   ~~^~~~~~~~~~~~~~~~~
meetings.cpp:192:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < Z.size(); j++) {
                    ~~^~~~~~~~~~
meetings.cpp:206:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j = 0; j < Z.size(); j++) {
                     ~~^~~~~~~~~~
meetings.cpp: In function 'void Solve(int)':
meetings.cpp:260: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 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 508 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 508 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 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 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 508 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 508 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 632 KB Output is correct
15 Correct 5 ms 508 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 6 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 504 KB Output is correct
20 Correct 5 ms 504 KB Output is correct
21 Correct 5 ms 504 KB Output is correct
22 Correct 5 ms 504 KB Output is correct
23 Correct 5 ms 504 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 5 ms 504 KB Output is correct
26 Correct 5 ms 504 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1051 ms 2836 KB Output is correct
2 Correct 911 ms 2820 KB Output is correct
3 Correct 1138 ms 2928 KB Output is correct
4 Correct 966 ms 2680 KB Output is correct
5 Correct 1075 ms 3028 KB Output is correct
6 Correct 770 ms 2948 KB Output is correct
7 Correct 783 ms 3064 KB Output is correct
8 Correct 787 ms 2936 KB Output is correct
9 Correct 812 ms 3268 KB Output is correct
10 Correct 625 ms 3112 KB Output is correct
11 Correct 745 ms 3192 KB Output is correct
12 Correct 1095 ms 3064 KB Output is correct
13 Correct 1060 ms 3064 KB Output is correct
14 Correct 838 ms 3320 KB Output is correct
15 Correct 810 ms 3192 KB Output is correct
16 Correct 836 ms 3064 KB Output is correct
17 Correct 720 ms 2968 KB Output is correct
18 Correct 819 ms 3064 KB Output is correct
19 Correct 924 ms 3064 KB Output is correct
20 Correct 972 ms 3256 KB Output is correct
21 Correct 1012 ms 3192 KB Output is correct
22 Correct 1042 ms 3224 KB Output is correct
23 Correct 1020 ms 3320 KB Output is correct
24 Correct 969 ms 3192 KB Output is correct
25 Correct 987 ms 3196 KB Output is correct
26 Correct 949 ms 3024 KB Output is correct
27 Correct 997 ms 3064 KB Output is correct
28 Correct 747 ms 3192 KB Output is correct
29 Correct 542 ms 2936 KB Output is correct
30 Correct 755 ms 3244 KB Output is correct
31 Correct 645 ms 2964 KB Output is correct
32 Correct 1002 ms 2924 KB Output is correct
33 Correct 760 ms 2812 KB Output is correct
34 Correct 18 ms 708 KB Output is correct
35 Correct 19 ms 760 KB Output is correct
36 Correct 19 ms 760 KB Output is correct
37 Correct 22 ms 888 KB Output is correct
38 Correct 17 ms 760 KB Output is correct
39 Correct 20 ms 760 KB Output is correct
40 Correct 17 ms 760 KB Output is correct
41 Correct 18 ms 760 KB Output is correct
42 Correct 22 ms 760 KB Output is correct
43 Correct 21 ms 760 KB Output is correct
44 Correct 19 ms 760 KB Output is correct
45 Correct 20 ms 760 KB Output is correct
46 Correct 17 ms 760 KB Output is correct
47 Correct 5 ms 504 KB Output is correct
48 Correct 5 ms 504 KB Output is correct
49 Correct 5 ms 504 KB Output is correct
50 Correct 5 ms 504 KB Output is correct
51 Correct 5 ms 504 KB Output is correct
52 Correct 6 ms 504 KB Output is correct
53 Correct 5 ms 504 KB Output is correct
54 Correct 5 ms 504 KB Output is correct
55 Correct 5 ms 632 KB Output is correct
56 Correct 5 ms 504 KB Output is correct
57 Correct 5 ms 508 KB Output is correct
58 Correct 5 ms 632 KB Output is correct
59 Correct 5 ms 504 KB Output is correct
60 Correct 5 ms 504 KB Output is correct
61 Correct 5 ms 504 KB Output is correct
62 Correct 5 ms 508 KB Output is correct
63 Correct 5 ms 504 KB Output is correct
64 Correct 5 ms 504 KB Output is correct
65 Correct 5 ms 508 KB Output is correct
66 Correct 5 ms 504 KB Output is correct
67 Correct 5 ms 504 KB Output is correct
68 Correct 5 ms 504 KB Output is correct
69 Correct 5 ms 504 KB Output is correct
70 Correct 5 ms 504 KB Output is correct
71 Correct 5 ms 504 KB Output is correct
72 Correct 5 ms 504 KB Output is correct