oj.uz

Submission #201142

# Submission time Handle Problem Language Result Execution time Memory
201142 2020-02-09T12:20:57 Z extraterrestrial Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1916 KB 
#include "meetings.h"
#pragma GCC optimize("Ofast")
#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 up[N][20];
vector<short> have[N];
vector<pair<short, short>> pars[N];
short ptr[N], color[N];
int opers, opers2	;
bool was[N];

int get_color(int v) {
	if (color[v] != -1) {
		return color[v];
	}
	return color[v] = get_color(pars[v][ptr[v]].F);
}

vector<pair<short, short>> edge;

void Solve(int n) {
  short root = rnd() % n;
  for (int i = 0; i < n; i++) {
  	have[root].pb(i);
  }
  assert(n <= 2000);
  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;
  	}
  	for (int i = 0; i < SZ(have[root]); i++) {
  		color[have[root][i]] = -1;
  	}
		short cc = 0;
		for (short v : have[root]) {
			if (v == root) {
				continue;
			}
			while (ptr[v] < SZ(pars[v]) && was[pars[v][ptr[v]].S]) {
				ptr[v]++;
				opers2++;
			}
			if (ptr[v] < SZ(pars[v]) || color[v] != -1) {
				continue;
			}
			for (int j = 0; j < cc; j++) {
				opers++;
				short V = Query(root, up[root][j], v);
				if (V != root) {
					if (V != up[root][j]) pars[up[root][j]].pb({v, V});
					else pars[v].pb({up[root][j], V});
					up[root][j] = V;
					color[V] = j;
					color[v] = j;
					break;
				}
			}
			if (color[v] == -1) {
				up[root][cc] = v;
				color[v] = cc++;
			}
		}
		assert(opers <= (int)n * n);
		assert(opers2 <= (int)n * n);
		for (int i = 0; i < cc; i++) {
			edge.pb({root, up[root][i]});
		}
		for (short v : have[root]) {
			if (v != root) {
				have[up[root][get_color(v)]].pb(v);			
			}
		}
		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 5 ms 504 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 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 504 KB Output is correct
9 Correct 5 ms 508 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 504 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 5 ms 504 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 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 504 KB Output is correct
9 Correct 5 ms 508 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 504 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 504 KB Output is correct
23 Correct 5 ms 504 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 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 504 KB Output is correct
9 Correct 5 ms 508 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 504 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 504 KB Output is correct
23 Correct 5 ms 504 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 14 ms 632 KB Output is correct
28 Correct 15 ms 504 KB Output is correct
29 Correct 16 ms 632 KB Output is correct
30 Correct 17 ms 508 KB Output is correct
31 Correct 16 ms 504 KB Output is correct
32 Correct 16 ms 504 KB Output is correct
33 Correct 19 ms 504 KB Output is correct
34 Correct 22 ms 504 KB Output is correct
35 Correct 20 ms 504 KB Output is correct
36 Correct 19 ms 504 KB Output is correct
37 Correct 93 ms 760 KB Output is correct
38 Correct 70 ms 760 KB Output is correct
39 Correct 9 ms 632 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1144 ms 1400 KB Output is correct
2 Correct 1016 ms 1144 KB Output is correct
3 Correct 1175 ms 1032 KB Output is correct
4 Correct 1147 ms 1272 KB Output is correct
5 Correct 1153 ms 1144 KB Output is correct
6 Correct 844 ms 1144 KB Output is correct
7 Correct 853 ms 1148 KB Output is correct
8 Correct 862 ms 1016 KB Output is correct
9 Correct 855 ms 1016 KB Output is correct
10 Correct 847 ms 1040 KB Output is correct
11 Correct 943 ms 1064 KB Output is correct
12 Execution timed out 3085 ms 1916 KB Time limit exceeded
13 Halted 0 ms 0 KB -