oj.uz

Submission #301040

# Submission time Handle Problem Language Result Execution time Memory
301040 2020-09-17T15:58:56 Z JPN20 Simurgh (IOI17_simurgh) C++17
70 / 100
 501 ms 13856 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;

// Input
int N, M;
int A[1 << 18], B[1 << 18];
int C[509][509];
int idxs[509][509];
int ret[509][509];

// DFS Tree
bool used[1 << 18];
bool istree[1 << 18];
int par[1 << 18];
int wei[1 << 18];
int cl[1 << 18], cr[1 << 18];
vector<int> ord;
vector<int> X[1 << 18];

// DFS Tree Base
int BASE = 0;
vector<int> R;

void dfs(int pos) {
	used[pos] = true;
	cl[pos] = ord.size();
	ord.push_back(pos);
	for (int i : X[pos]) {
		if (used[i] == true) continue;
		par[i] = pos;
		istree[idxs[pos][i]] = true;
		dfs(i);
	}
	cr[pos] = ord.size() - 1;
}

vector<int> find_roads(int n, vector<int> u, vector<int> v) {
	// INPUT
	N = n;
	M = u.size();
	for (int i = 0; i < M; i++) A[i] = u[i];
	for (int i = 0; i < M; i++) B[i] = v[i];
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) idxs[i][j] = -1;
	}
	for (int i = 0; i < M; i++) idxs[A[i]][B[i]] = i;
	for (int i = 0; i < M; i++) idxs[B[i]][A[i]] = i;
	
	// DFSTR
	for (int i = 0; i < M; i++) X[A[i]].push_back(B[i]);
	for (int i = 0; i < M; i++) X[B[i]].push_back(A[i]);
	dfs(0);
	for (int i = 0; i < M; i++) {
		if (istree[i] == true) R.push_back(i);
	}
	BASE = count_common_roads(R);
	
	// PRTRH
	for (int i = 0; i < N; i++) wei[i] = -1;
	for (int i = 0; i < M; i++) {
		if (cl[A[i]] > cl[B[i]]) swap(A[i], B[i]);
		int cx = B[i];
		while (cx != A[i]) { C[A[i]][B[i]] = cx; C[B[i]][A[i]] = cx; cx = par[cx]; }
	}
	
	// TRHNT
	//for (int i = 0; i < ord.size(); i++) cout << ord[i] << " -> ";
	//cout << endl << endl;
	for (int i : ord) {
		if (i == 0 || wei[i] != -1) continue;
		int idx1 = -1;
		for (int j = 0; j < M; j++) {
			if (istree[j] == true) continue;
			if (!(cl[i] <= cl[B[j]] && cl[B[j]] <= cr[i])) continue;
			if (cl[par[i]] <= cl[A[j]]) continue;
			idx1 = j;
		}
		if (idx1 != -1) {
			//cout << "# "<< i << ": " << idx1 << endl;
			int s0 = i, s1 = par[i], s2 = par[par[i]];
			vector<int> r1, r2;
			for (int j : R) { if (j != idxs[s0][s1]) r1.push_back(j); }
			for (int j : R) { if (j != idxs[s1][s2]) r2.push_back(j); }
			r1.push_back(idx1);
			r2.push_back(idx1);
			int p1 = count_common_roads(r1);
			int p2 = count_common_roads(r2);
			int eval = p2 - (BASE - wei[s1]);
			wei[i] = BASE - (p1 - eval);
		}
		else {
			int idx2 = -1, maxid = -1; vector<int> idx3;
			for (int j = 0; j < M; j++) {
				if (istree[j] == true) continue;
				if (!(cl[i] <= cl[B[j]] && cl[B[j]] <= cr[i])) continue;
				if (par[i] != A[j]) continue;
				idx3.push_back(j);
				if (maxid < cl[B[j]]) { maxid = cl[B[j]]; idx2 = j; }
			}
			if (idx2 != -1) {
				//cout << "! " << i << ": " << idx2 << endl;
				int cx = B[idx2];
				vector<pair<int, int>> vals;
				while (true) {
					vector<int> r;
					for (int j : R) { if (j != idxs[cx][par[cx]]) r.push_back(j); }
					r.push_back(idx2);
					vals.push_back(make_pair(cx, BASE - count_common_roads(r)));
					cx = par[cx];
					if (cx == A[idx2]) break;
				}
				int maxv = 0, minv = 0;
				for (int j = 0; j < (int)vals.size(); j++) maxv = max(maxv, vals[j].second);
				for (int j = 0; j < (int)vals.size(); j++) minv = min(minv, vals[j].second);
				for (int j = 0; j < (int)vals.size(); j++) wei[vals[j].first] = vals[j].second;
				if (maxv == 0 && minv == -1) {
					for (int j = 0; j < (int)vals.size(); j++) wei[vals[j].first] += 1;
				}
				if (maxv == 0 && minv == 0) {
					bool flg = false;
					for (int j : idx3) {
						vector<int> r;
						for (int k : R) { if (k != idxs[i][par[i]]) r.push_back(k); }
						r.push_back(j);
						int eval = BASE - count_common_roads(r);
						if (eval == -1) flg = true;
					}
					if (flg == false) {
						for (int j = 0; j < (int)vals.size(); j++) wei[vals[j].first] += 1;
					}
				}
			}
			else {
				//cout << "? " << i << endl;
				wei[i] = 1;
			}
		}
	}
	
	// PRFNL
	for (int i = 1; i < N; i++) {
		ret[par[i]][i] = wei[i];
		ret[i][par[i]] = wei[i];
	}
	//for (int i = 1; i < N; i++) cout << i << ": " << wei[i] << endl;
	
	// FINAL
	for (int t = 2; t < ord.size(); t++) {
		int i = ord[t];
		vector<int> vec;
		for (int j = 0; j < M; j++) {
			if (istree[j] == true) continue;
			if (B[j] == i) vec.push_back(A[j]);
		}
		int cx = vec.size(), cnt = 0;
		while (cx >= 1) {
			int cl = 0, cr = cx, cm, maxn = -1;
			for (int j = 0; j < 11; j++) {
				cm = (cl + cr) / 2;
				vector<int> r;
				vector<bool> uses(N, false);
				int ExpCost = BASE + cnt;
				for (int k = cm; k < vec.size(); k++) r.push_back(idxs[vec[k]][i]);
				for (int k = cm; k < vec.size(); k++) uses[C[vec[k]][i]] = true;
				for (int k = 1; k < N; k++) { if (uses[k] == true) ExpCost -= ret[k][par[k]]; }
				for (int k = 1; k < N; k++) { if (uses[k] == false) r.push_back(idxs[k][par[k]]); }
				int val = count_common_roads(r);
				if (val > ExpCost) { maxn = max(maxn, cm); cl = cm; }
				else { cr = cm; }
			}
			if (maxn == -1) break;
			cnt += 1;
			ret[i][vec[maxn]] = 1;
			ret[vec[maxn]][i] = 1;
			cx = maxn;
		}
	}
	
	// FLARE
	vector<int> FinalAns;
	for (int i = 0; i < M; i++) {
		if (ret[A[i]][B[i]] == 1) FinalAns.push_back(i);
	}
	return FinalAns;
}

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:149:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  149 |  for (int t = 2; t < ord.size(); t++) {
      |                  ~~^~~~~~~~~~~~
simurgh.cpp:164:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  164 |     for (int k = cm; k < vec.size(); k++) r.push_back(idxs[vec[k]][i]);
      |                      ~~^~~~~~~~~~~~
simurgh.cpp:165:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |     for (int k = cm; k < vec.size(); k++) uses[C[vec[k]][i]] = true;
      |                      ~~^~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6528 KB correct
2 Correct 5 ms 6528 KB correct
3 Correct 5 ms 6604 KB correct
4 Correct 5 ms 6528 KB correct
5 Correct 5 ms 6528 KB correct
6 Correct 5 ms 6528 KB correct
7 Correct 6 ms 6528 KB correct
8 Correct 6 ms 6528 KB correct
9 Correct 6 ms 6528 KB correct
10 Correct 5 ms 6528 KB correct
11 Correct 5 ms 6528 KB correct
12 Correct 5 ms 6528 KB correct
13 Correct 5 ms 6528 KB correct
14 Correct 8 ms 6912 KB correct
15 Correct 8 ms 6912 KB correct
16 Correct 26 ms 6912 KB correct
17 Correct 8 ms 6912 KB correct
18 Correct 7 ms 6784 KB correct
19 Correct 8 ms 6912 KB correct
20 Correct 8 ms 6912 KB correct
21 Correct 8 ms 6912 KB correct
22 Correct 6 ms 6912 KB correct
23 Correct 6 ms 6912 KB correct
24 Correct 7 ms 6912 KB correct
25 Correct 5 ms 6784 KB correct
26 Correct 8 ms 6912 KB correct
27 Correct 7 ms 6912 KB correct
28 Correct 6 ms 6912 KB correct
29 Correct 6 ms 6912 KB correct
30 Correct 7 ms 6912 KB correct
31 Correct 7 ms 6912 KB correct
32 Correct 7 ms 6912 KB correct
33 Correct 7 ms 6912 KB correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6528 KB correct
2 Correct 5 ms 6528 KB correct
3 Correct 5 ms 6604 KB correct
4 Correct 5 ms 6528 KB correct
5 Correct 5 ms 6528 KB correct
6 Correct 5 ms 6528 KB correct
7 Correct 6 ms 6528 KB correct
8 Correct 6 ms 6528 KB correct
9 Correct 6 ms 6528 KB correct
10 Correct 5 ms 6528 KB correct
11 Correct 5 ms 6528 KB correct
12 Correct 5 ms 6528 KB correct
13 Correct 5 ms 6528 KB correct
14 Correct 8 ms 6912 KB correct
15 Correct 8 ms 6912 KB correct
16 Correct 26 ms 6912 KB correct
17 Correct 8 ms 6912 KB correct
18 Correct 7 ms 6784 KB correct
19 Correct 8 ms 6912 KB correct
20 Correct 8 ms 6912 KB correct
21 Correct 8 ms 6912 KB correct
22 Correct 6 ms 6912 KB correct
23 Correct 6 ms 6912 KB correct
24 Correct 7 ms 6912 KB correct
25 Correct 5 ms 6784 KB correct
26 Correct 8 ms 6912 KB correct
27 Correct 7 ms 6912 KB correct
28 Correct 6 ms 6912 KB correct
29 Correct 6 ms 6912 KB correct
30 Correct 7 ms 6912 KB correct
31 Correct 7 ms 6912 KB correct
32 Correct 7 ms 6912 KB correct
33 Correct 7 ms 6912 KB correct
34 Correct 90 ms 8960 KB correct
35 Correct 96 ms 8960 KB correct
36 Correct 85 ms 8824 KB correct
37 Correct 38 ms 8064 KB correct
38 Correct 93 ms 8960 KB correct
39 Correct 91 ms 8832 KB correct
40 Correct 86 ms 8704 KB correct
41 Correct 92 ms 8952 KB correct
42 Correct 94 ms 8960 KB correct
43 Correct 50 ms 8576 KB correct
44 Correct 46 ms 8448 KB correct
45 Correct 51 ms 8448 KB correct
46 Correct 45 ms 8320 KB correct
47 Correct 37 ms 8192 KB correct
48 Correct 19 ms 8064 KB correct
49 Correct 29 ms 8064 KB correct
50 Correct 43 ms 8192 KB correct
51 Correct 59 ms 8440 KB correct
52 Correct 55 ms 8448 KB correct
53 Correct 53 ms 8320 KB correct
54 Correct 55 ms 8576 KB correct
55 Correct 52 ms 8448 KB correct
56 Correct 51 ms 8528 KB correct
57 Correct 51 ms 8448 KB correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6528 KB correct
2 Correct 5 ms 6560 KB correct
3 Correct 298 ms 11768 KB correct
4 Correct 501 ms 13856 KB correct
5 Correct 493 ms 13816 KB correct
6 Correct 477 ms 13816 KB correct
7 Correct 476 ms 13688 KB correct
8 Correct 477 ms 13816 KB correct
9 Correct 482 ms 13816 KB correct
10 Correct 489 ms 13688 KB correct
11 Correct 501 ms 13688 KB correct
12 Correct 474 ms 13816 KB correct
13 Correct 6 ms 6528 KB correct
14 Correct 468 ms 13816 KB correct
15 Correct 477 ms 13688 KB correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6528 KB correct
2 Correct 5 ms 6528 KB correct
3 Correct 5 ms 6604 KB correct
4 Correct 5 ms 6528 KB correct
5 Correct 5 ms 6528 KB correct
6 Correct 5 ms 6528 KB correct
7 Correct 6 ms 6528 KB correct
8 Correct 6 ms 6528 KB correct
9 Correct 6 ms 6528 KB correct
10 Correct 5 ms 6528 KB correct
11 Correct 5 ms 6528 KB correct
12 Correct 5 ms 6528 KB correct
13 Correct 5 ms 6528 KB correct
14 Correct 8 ms 6912 KB correct
15 Correct 8 ms 6912 KB correct
16 Correct 26 ms 6912 KB correct
17 Correct 8 ms 6912 KB correct
18 Correct 7 ms 6784 KB correct
19 Correct 8 ms 6912 KB correct
20 Correct 8 ms 6912 KB correct
21 Correct 8 ms 6912 KB correct
22 Correct 6 ms 6912 KB correct
23 Correct 6 ms 6912 KB correct
24 Correct 7 ms 6912 KB correct
25 Correct 5 ms 6784 KB correct
26 Correct 8 ms 6912 KB correct
27 Correct 7 ms 6912 KB correct
28 Correct 6 ms 6912 KB correct
29 Correct 6 ms 6912 KB correct
30 Correct 7 ms 6912 KB correct
31 Correct 7 ms 6912 KB correct
32 Correct 7 ms 6912 KB correct
33 Correct 7 ms 6912 KB correct
34 Correct 90 ms 8960 KB correct
35 Correct 96 ms 8960 KB correct
36 Correct 85 ms 8824 KB correct
37 Correct 38 ms 8064 KB correct
38 Correct 93 ms 8960 KB correct
39 Correct 91 ms 8832 KB correct
40 Correct 86 ms 8704 KB correct
41 Correct 92 ms 8952 KB correct
42 Correct 94 ms 8960 KB correct
43 Correct 50 ms 8576 KB correct
44 Correct 46 ms 8448 KB correct
45 Correct 51 ms 8448 KB correct
46 Correct 45 ms 8320 KB correct
47 Correct 37 ms 8192 KB correct
48 Correct 19 ms 8064 KB correct
49 Correct 29 ms 8064 KB correct
50 Correct 43 ms 8192 KB correct
51 Correct 59 ms 8440 KB correct
52 Correct 55 ms 8448 KB correct
53 Correct 53 ms 8320 KB correct
54 Correct 55 ms 8576 KB correct
55 Correct 52 ms 8448 KB correct
56 Correct 51 ms 8528 KB correct
57 Correct 51 ms 8448 KB correct
58 Correct 5 ms 6528 KB correct
59 Correct 5 ms 6560 KB correct
60 Correct 298 ms 11768 KB correct
61 Correct 501 ms 13856 KB correct
62 Correct 493 ms 13816 KB correct
63 Correct 477 ms 13816 KB correct
64 Correct 476 ms 13688 KB correct
65 Correct 477 ms 13816 KB correct
66 Correct 482 ms 13816 KB correct
67 Correct 489 ms 13688 KB correct
68 Correct 501 ms 13688 KB correct
69 Correct 474 ms 13816 KB correct
70 Correct 6 ms 6528 KB correct
71 Correct 468 ms 13816 KB correct
72 Correct 477 ms 13688 KB correct
73 Correct 4 ms 6528 KB correct
74 Incorrect 346 ms 13692 KB WA in grader: NO
75 Halted 0 ms 0 KB -