oj.uz

Submission #201086

# Submission time Handle Problem Language Result Execution time Memory
201086 2020-02-09T10:07:28 Z extraterrestrial Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 9224 KB 
#include "meetings.h"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
mt19937 rnd(228);

const int N = 2010;
short lca[N][N], used[N], timer, up[N][20], all;
//bitset<N> dk[N], em, cur[18], kek;
vector<short> nh[20], have[N];
inline short get(short a, short b) {
	if (a > b) {
		swap(a, b);
	}
	return lca[a][b];
}

inline void update_lca(short a, short b, short c) {
	if (a > b) {
		swap(a, b);
	}
	lca[a][b] = c;
	//dk[a][b] = dk[b][a] = 0;
}

vector<pair<int, int>> edge;

void Solve(int n) {
  for (int i = 0; i < n; i++) {
  	for (int j = 0; j < n; j++) {
  		if (i == j) {
  			lca[i][j] = i;
  		}
  		else {
  			lca[i][j] = -1;
  			//dk[i][j] = dk[j][i] = 1;
  		}
  	}
  }
  short root = rnd() % n;
  for (int i = 0; i < n; i++) {
  	have[root].pb(i);
  }
  queue<short> q;
  q.push(root);
  while (!q.empty()) {
  	int root = q.front();
  	q.pop();
  	if (SZ(have[root]) == 1) {
			continue;
		}
		/*for (int i = 0; i < 18; i++) {
			cur[i] = em;
		}*/
		//shuffle(all(have), rnd);
		//vector<vector<int>> nh(1);
		//vector<int> up(1);
		short id = (have[root][0] == root ? 1 : 0);
		short cc = 1;
		nh[0] = {have[root][id]};
		up[root][0] = have[root][id];
		//cur[0][have[0]] = 1;
		timer++;
		used[have[root][id]] = timer;
		for (int i = 1; i < SZ(have[root]); i++) {
			if (used[have[root][i]] == timer || have[root][i] == root) {
				continue;
			}
			//cerr << root << ' ' << have[root][i] << '\n';
			used[have[root][i]] = timer;
			bool ok = false;
			/*vector<int> order;
			for (int j = 0; j < SZ(nh); j++) {
				order.pb(j);
			}
			shuffle(all(order), rnd);*/
			assert(cc < 20);
			for (int j = 0; j < cc; j++) {
				if (ok) {
					break;
				}
				short v;
				if (get(up[root][j], have[root][i]) != -1) {
					v = get(up[root][j], have[root][i]);
				}
				else {
					v = Query(root, up[root][j], have[root][i]);
					all++;
					if (all > 1e5) {
						exit(0);
					}
				}
				if (v != root) {
					/*if (get(up[root][j], have[root][i]) != -1) {
						cerr << "CASE 1\n";
					}
					else {
						cerr << "CASE 2\n";
					}*/
					//cerr << root << ' ' << have[root][i] << ' ' << up[root][j] << ' ' << v << '\n'; 
					if (v == up[root][j]) {
						update_lca(v, up[root][j], up[root][j]);
						nh[j].pb(have[root][i]);
						//cur[j][have[i]] = 1;
						ok = true;
						break;
					}
					else {
						/*kek = dk[have[i]] & cur[j];
						int cnt = kek.count();
						for (int iter = 0; iter < cnt; iter++) {
							int pos = kek._Find_first();
							kek[pos] = 0;
							update_lca(pos, have[i], v);
						}
						kek = dk[v] & cur[j];
						cnt = kek.count();
						for (int iter = 0; iter < cnt; iter++) {
							int pos = kek._Find_first();
							kek[pos] = 0;
							update_lca(pos, v, v);
						}*/
						update_lca(have[root][i], v, v);
						used[v] = timer;
						up[root][j] = v;
						nh[j].pb(have[root][i]);
						//cur[j][have[i]] = 1;
						if (v != have[root][i]) {
							nh[j].pb(v);
							//cur[j][v] = 1;
						}
						ok = true;
						break;
					}
				}
			}
			if (!ok) {
				nh[cc] = {have[root][i]};
				up[root][cc] = have[root][i];
				cc++;
			}
		}
		for (int i = 0; i < cc; i++) {
			edge.pb({root, up[root][i]});
		}
		/*for (auto it : up[root]) {
			edge.pb({root, it});
		}*/
		for (int i = 0; i < cc; i++) {
			have[up[root][i]] = nh[i];
		}
		for (int i = 0; i < cc; i++) {
			q.push(up[root][i]);	
		}	
  }
  for (auto &it : edge) {
  	if (it.F > it.S) {
  		swap(it.F, it.S);
  	}
  	//cerr << it.F << ' ' << it.S << '\n';
  	Bridge(it.F, it.S);
  }
}

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1384 ms 8848 KB Output is correct
2 Correct 1140 ms 8824 KB Output is correct
3 Correct 1325 ms 8952 KB Output is correct
4 Correct 1331 ms 8696 KB Output is correct
5 Correct 1290 ms 8888 KB Output is correct
6 Correct 862 ms 8952 KB Output is correct
7 Correct 893 ms 8696 KB Output is correct
8 Correct 888 ms 8696 KB Output is correct
9 Correct 854 ms 8696 KB Output is correct
10 Correct 807 ms 8780 KB Output is correct
11 Correct 944 ms 8720 KB Output is correct
12 Execution timed out 3081 ms 9224 KB Time limit exceeded
13 Halted 0 ms 0 KB -