oj.uz

Submission #201063

# Submission time Handle Problem Language Result Execution time Memory
201063 2020-02-09T09:20:24 Z extraterrestrial Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 16888 KB 
#include "meetings.h"
#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;
int lca[N][N], used[N], timer;

int get(int a, int b) {
	if (a > b) {
		swap(a, b);
	}
	return lca[a][b];
}

void update_lca(int a, int b, int c) {
	if (a > b) {
		swap(a, b);
	}
	if (lca[a][b] != -1) {
		assert(lca[a][b] == c);
	}
	lca[a][b] = c;
}

vector<pair<int, int>> edge;

void dfs(int root, vector<int> have) {
	if (have.empty()) {
		return;
	}
	shuffle(all(have), rnd);
	vector<vector<int>> nh(1);
	vector<int> up(1);
	nh[0].pb(have[0]);
	up[0] = have[0];
	timer++;
	used[have[0]] = timer;
	for (int i = 1; i < SZ(have); i++) {
		if (used[have[i]] == timer) {
			continue;
		}
		used[have[i]] = timer;
		bool ok = false;
		vector<int> order;
		for (int j = 0; j < SZ(nh); j++) {
			order.pb(j);
		}
		shuffle(all(order), rnd);
		for (int j : order) {
			if (ok) {
				break;
			}
			int v;
			if (get(up[j], have[i]) != -1) {
				v = get(up[j], have[i]);
			}
			else {
				v = Query(root, up[j], have[i]);
			}
			if (v != root) {
				if (v == up[j]) {
					update_lca(v, up[j], up[j]);
					nh[j].pb(have[i]);
					ok = true;
					break;
				}
				else {
					for (auto it : nh[j]) {
						update_lca(it, have[i], v);
						update_lca(it, v, v);
					}
					update_lca(have[i], v, v);
					used[v] = timer;
					up[j] = v;
					nh[j].pb(have[i]);
					if (v != have[i]) {
						nh[j].pb(v);
					}
					ok = true;
					break;
				}
			}
		}
		if (!ok) {
			nh.pb({have[i]});
			up.pb(have[i]);
		}
	}
	for (auto it : up) {
		edge.pb({root, it});
	}
	for (int i = 0; i < SZ(nh); i++) {
		for (int j = 0; j < SZ(nh[i]); j++) {
			if (nh[i][j] == up[i]) {
				nh[i].erase(nh[i].begin() + j);
				break;
			}
		}
		dfs(up[i], nh[i]);
	}
}

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;
  		}
  	}
  }
  int root = rnd() % n;
  vector<int> have;
  for (int i = 0; i < n; i++) {
  	if (i != root) {
  		have.pb(i);
  	}
  }
  dfs(root, have);
  for (auto &it : edge) {
  	if (it.F > it.S) {
  		swap(it.F, it.S);
  	}
  	Bridge(it.F, it.S);
  }
}

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 300 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 376 KB Output is correct
6 Correct 5 ms 376 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 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 6 ms 376 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 300 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 376 KB Output is correct
6 Correct 5 ms 376 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 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 5 ms 632 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 5 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 632 KB Output is correct
21 Correct 5 ms 504 KB Output is correct
22 Correct 5 ms 508 KB Output is correct
23 Correct 5 ms 636 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 6 ms 504 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 5 ms 376 KB Output is correct
2 Correct 5 ms 300 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 376 KB Output is correct
6 Correct 5 ms 376 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 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 5 ms 632 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 5 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 632 KB Output is correct
21 Correct 5 ms 504 KB Output is correct
22 Correct 5 ms 508 KB Output is correct
23 Correct 5 ms 636 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 6 ms 504 KB Output is correct
26 Correct 5 ms 632 KB Output is correct
27 Correct 22 ms 2168 KB Output is correct
28 Correct 20 ms 1912 KB Output is correct
29 Correct 23 ms 1912 KB Output is correct
30 Correct 27 ms 2040 KB Output is correct
31 Correct 20 ms 2040 KB Output is correct
32 Correct 22 ms 2040 KB Output is correct
33 Correct 28 ms 2040 KB Output is correct
34 Correct 30 ms 2040 KB Output is correct
35 Correct 24 ms 1912 KB Output is correct
36 Correct 23 ms 1912 KB Output is correct
37 Correct 149 ms 2552 KB Output is correct
38 Correct 100 ms 2296 KB Output is correct
39 Correct 127 ms 2296 KB Output is correct

Subtask #4
0 / 71.0

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