oj.uz

Submission #201107

# Submission time Handle Problem Language Result Execution time Memory
201107 2020-02-09T11:00:08 Z extraterrestrial Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 9032 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;
short nh[20][N], have[N][N], sz_nh[20], sz_have[N];
vector<pair<short, short>> pars[N];
short ptr[N], color[N];
bool was[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;
}

vector<pair<int, int>> edge;

void Solve(int n) {
  short root = rnd() % n;
  for (int i = 0; i < n; i++) {
  	have[root][sz_have[root]++] = i;
  }
  queue<short> q;
  q.push(root);
  while (!q.empty()) {
  	int root = q.front();
  	assert(!was[root]);
  	was[root] = true;
  	q.pop();
  	if (sz_have[root] == 1) {
  		continue;
  	}
  	shuffle(have[root], have[root] + sz_have[root], rnd);
		for (int i = 0; i < sz_have[root]; i++) {
			color[have[root][i]] = -1;
		}
		short id = (have[root][0] == root ? 1 : 0);
		short cc = 1;
		nh[0][0] = have[root][id];
		sz_nh[0] = 1;
		up[root][0] = have[root][id];
		color[have[root][id]] = 0;
		timer++;
		used[have[root][id]] = timer;
		vector<short> order;
		for (int i = 1; i < sz_have[root]; i++) {
			if (used[have[root][i]] == timer || have[root][i] == root) {
				continue;
			}
			used[have[root][i]] = timer;
			while (ptr[have[root][i]] < SZ(pars[have[root][i]]) && was[pars[have[root][i]][ptr[have[root][i]]].S]) {
				ptr[have[root][i]]++;
			}
			if (ptr[have[root][i]] < SZ(pars[have[root][i]])) {
				continue;
			}
			color[have[root][i]] = -1;
			for (int j = 0; j < cc; j++) {
				short v;
				v = (up[root][j] == have[root][i] ? have[root][i] : Query(root, up[root][j], have[root][i]));
				if (v != root) {
					if (v != up[root][j] && v != have[root][i]) pars[max(up[root][j], have[root][i])].pb({min(up[root][j], have[root][i]), v});
					up[root][j] = v;
					nh[j][sz_nh[j]] = have[root][i];
					sz_nh[j]++;
					color[have[root][i]] = j;
					break;
				}
			}
			if (color[have[root][i]] == -1) {
				nh[cc][0] = have[root][i];
				sz_nh[cc] = 1;
				up[root][cc] = have[root][i];
				color[have[root][i]] = cc;
				cc++;
			}
		}
		for (int i = 0; i < cc; i++) {
			edge.pb({root, up[root][i]});
		}
		for (int i = 0; i < n; i++) {
			if (used[i] == timer && color[i] == -1) {
				color[i] = color[pars[i][ptr[i]].F];
				nh[color[i]][sz_nh[color[i]]] = i;
				sz_nh[color[i]]++;
			}
		}
		for (int i = 0; i < cc; i++) {
			for (int j = 0; j < sz_nh[i]; j++) {
				have[up[root][i]][j] = nh[i][j];
			}
			sz_have[up[root][i]] = sz_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);
  	}
  	Bridge(it.F, it.S);
  }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 504 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 6 ms 504 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 504 KB Output is correct
12 Correct 5 ms 632 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 6 ms 504 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 6 ms 504 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 504 KB Output is correct
12 Correct 5 ms 632 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 760 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 5 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 636 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 5 ms 760 KB Output is correct
23 Correct 5 ms 632 KB Output is correct
24 Correct 6 ms 636 KB Output is correct
25 Correct 5 ms 632 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 6 ms 504 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 6 ms 504 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 504 KB Output is correct
12 Correct 5 ms 632 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 760 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 5 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 636 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 5 ms 760 KB Output is correct
23 Correct 5 ms 632 KB Output is correct
24 Correct 6 ms 636 KB Output is correct
25 Correct 5 ms 632 KB Output is correct
26 Correct 5 ms 632 KB Output is correct
27 Correct 20 ms 1708 KB Output is correct
28 Correct 16 ms 1784 KB Output is correct
29 Correct 16 ms 1784 KB Output is correct
30 Correct 18 ms 1656 KB Output is correct
31 Correct 16 ms 1656 KB Output is correct
32 Correct 19 ms 1912 KB Output is correct
33 Correct 22 ms 1656 KB Output is correct
34 Correct 22 ms 1784 KB Output is correct
35 Correct 23 ms 1784 KB Output is correct
36 Correct 21 ms 1656 KB Output is correct
37 Correct 205 ms 1656 KB Output is correct
38 Correct 130 ms 1656 KB Output is correct
39 Correct 161 ms 1656 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1423 ms 9032 KB Output is correct
2 Correct 1305 ms 8696 KB Output is correct
3 Correct 1313 ms 8824 KB Output is correct
4 Correct 1280 ms 8824 KB Output is correct
5 Correct 1369 ms 8952 KB Output is correct
6 Correct 913 ms 8696 KB Output is correct
7 Correct 983 ms 8824 KB Output is correct
8 Correct 912 ms 8620 KB Output is correct
9 Correct 894 ms 8696 KB Output is correct
10 Correct 919 ms 8688 KB Output is correct
11 Correct 996 ms 8760 KB Output is correct
12 Execution timed out 3069 ms 1784 KB Time limit exceeded
13 Halted 0 ms 0 KB -