oj.uz

Submission #156617

# Submission time Handle Problem Language Result Execution time Memory
156617 2019-10-06T16:26:16 Z popovicirobert Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 836 KB 
#include "meetings.h"
#include <bits/stdc++.h>

using namespace std;

struct DSU {
	vector <int> par;
	int n;

	inline void init(int _n) {
		n = _n;
		par.resize(n, -1);	
	}

	int root(int x) {
		if(par[x] == -1) return x;
		return par[x] = root(par[x]);
	}
	
	inline void join(int x, int y) {
		x = root(x), y = root(y);
		if(x != y) {
			par[x] = y;
		}
	}

}dsu;

const int MAXN = 2000;

static int vis[MAXN], now = 0;

inline void add(int *special, int x, int &sz) {
	vis[x] = now;
	special[sz++] = x;
}

inline void del(int *special, int x, int &sz) {
	int i, j;
	for(i = 0; i < sz; i++) {
		if(special[i] == x) {
			for(j = i; j + 1 < sz; j++) {
				special[j] = special[j + 1];
			}
			sz--;
			break;

		}
	}
}

void solve(vector <int> &nodes) {
	if(nodes.empty()) return ;

	int n = nodes.size();
	random_shuffle(nodes.begin(), nodes.end());
	int root = nodes[rand() % n];
	vis[root] = ++now;

	for(auto it : nodes) {
		dsu.par[it] = -1;
	}

	int special[20], sz = 0;

	for(auto it : nodes) {
		if(vis[it] == now) continue;

		bool ok = 0;
		for(int i = 0; i < sz; i++) {
			int x = special[i];
			//cerr << x << " " << it << " " << root << "\n";
			int cur = Query(x, it, root);
			if(cur == root) continue;

			dsu.join(x, cur);
			dsu.join(it, cur);
			if(x != cur) {
				del(special, x, sz);
				add(special, cur, sz);
			}
			ok = 1;
			break;
		}
		if(ok == 0) {
			add(special, it, sz);
		}
	}

	for(int i = 0; i < sz; i++) {
		int cur = special[i];
		//cerr << root << " " << cur << "\n";
		Bridge(min(root, cur), max(root, cur));
		vector <int> aux;
		for(auto it : nodes) {
			if(dsu.root(it) == cur) {
				aux.push_back(it);
			}
		}
		solve(aux);
	}
	
}

void Solve(int n) {
	srand(time(NULL));

  	vector <int> nodes(n);
	iota(nodes.begin(), nodes.end(), 0);
	
	dsu.init(n);
	solve(nodes);
}

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 248 KB Output is correct
10 Correct 2 ms 248 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 276 KB Output is correct
18 Correct 2 ms 248 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 248 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 252 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 35 ms 504 KB Output is correct
28 Correct 57 ms 536 KB Output is correct
29 Correct 50 ms 436 KB Output is correct
30 Correct 38 ms 424 KB Output is correct
31 Correct 42 ms 376 KB Output is correct
32 Correct 56 ms 516 KB Output is correct
33 Correct 54 ms 556 KB Output is correct
34 Correct 67 ms 552 KB Output is correct
35 Correct 54 ms 508 KB Output is correct
36 Correct 46 ms 504 KB Output is correct
37 Correct 12 ms 532 KB Output is correct
38 Correct 14 ms 376 KB Output is correct
39 Correct 13 ms 380 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3021 ms 836 KB Time limit exceeded
2 Halted 0 ms 0 KB -