oj.uz

Submission #201146

# Submission time Handle Problem Language Result Execution time Memory
201146 2020-02-09T12:29:17 Z extraterrestrial Meetings (JOI19_meetings) C++14
17 / 100
 1242 ms 1868 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];

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

void Solve(int n) {
  short root = 0;
  for (int i = 0; i < n; i++) {
  	have[root].pb(i);
  }
  queue<short> q;
  q.push(root);
  while (!q.empty()) {
  	short root = q.front();
  	was[root] = true;
  	q.pop();
  	if (SZ(have[root]) == 1) {
  		continue;
  	}
  	for (short v : have[root]) {
  		color[v] = -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]++;
			}
			if (ptr[v] < SZ(pars[v]) || color[v] != -1) {
				continue;
			}
			for (short j = 0; j < cc; j++) {
				short V = Query(root, up[root][j], v);
				opers++;
				assert(opers <= 40000);
				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++;
			}
		}
		for (int i = 0; i < cc; i++) {
			Bridge(min(root, up[root][i]), max(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]);	
		}	
  }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 504 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 5 ms 504 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 5 ms 380 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 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 5 ms 504 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 5 ms 380 KB Output is correct
14 Correct 6 ms 540 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 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 376 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 504 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 5 ms 504 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 5 ms 380 KB Output is correct
14 Correct 6 ms 540 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 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 376 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 16 ms 504 KB Output is correct
28 Correct 13 ms 504 KB Output is correct
29 Correct 16 ms 504 KB Output is correct
30 Correct 14 ms 504 KB Output is correct
31 Correct 15 ms 504 KB Output is correct
32 Correct 15 ms 504 KB Output is correct
33 Correct 19 ms 504 KB Output is correct
34 Correct 23 ms 632 KB Output is correct
35 Correct 22 ms 632 KB Output is correct
36 Correct 18 ms 504 KB Output is correct
37 Correct 77 ms 760 KB Output is correct
38 Correct 73 ms 632 KB Output is correct
39 Runtime error 145 ms 1580 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 936 ms 1004 KB Output is correct
2 Correct 1035 ms 1016 KB Output is correct
3 Correct 1106 ms 1196 KB Output is correct
4 Correct 1242 ms 1320 KB Output is correct
5 Correct 1095 ms 1272 KB Output is correct
6 Correct 829 ms 1272 KB Output is correct
7 Correct 823 ms 1016 KB Output is correct
8 Correct 864 ms 1016 KB Output is correct
9 Runtime error 767 ms 1868 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Halted 0 ms 0 KB -