oj.uz

답안 #201081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201081 2020-02-09T09:58:03 Z extraterrestrial Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 17304 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, up[N][20];
//bitset<N> dk[N], em, cur[18], kek;
vector<int> nh[20], have[N];
inline int get(int a, int b) {
	if (a > b) {
		swap(a, b);
	}
	return lca[a][b];
}

inline 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;
	//dk[a][b] = dk[b][a] = 0;
}

vector<pair<int, int>> edge;

void dfs(int root) {
	if (SZ(have[root]) == 1) {
		return;
	}
	/*for (int i = 0; i < 18; i++) {
		cur[i] = em;
	}*/
	//shuffle(all(have), rnd);
	//vector<vector<int>> nh(1);
	//vector<int> up(1);
	int id = (have[root][0] == root ? 1 : 0);
	int 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);*/
		for (int j = 0; j < cc; j++) {
			if (ok) {
				break;
			}
			int 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]);
			}
			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++) {
		dfs(up[root][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;
  			//dk[i][j] = dk[j][i] = 1;
  		}
  	}
  }
  int root = rnd() % n;
  //cerr << root << '\n';
  for (int i = 0; i < n; i++) {
  	have[root].pb(i);
  }
  dfs(root);
  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

# 결과 실행 시간 메모리 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 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 4 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 6 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

# 결과 실행 시간 메모리 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 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 4 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 6 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 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 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 632 KB Output is correct
21 Correct 7 ms 632 KB Output is correct
22 Correct 5 ms 636 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 632 KB Output is correct
26 Correct 5 ms 632 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 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 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 4 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 6 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 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 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 632 KB Output is correct
21 Correct 7 ms 632 KB Output is correct
22 Correct 5 ms 636 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 632 KB Output is correct
26 Correct 5 ms 632 KB Output is correct
27 Correct 16 ms 2040 KB Output is correct
28 Correct 15 ms 2044 KB Output is correct
29 Correct 17 ms 2040 KB Output is correct
30 Correct 19 ms 2040 KB Output is correct
31 Correct 17 ms 2040 KB Output is correct
32 Correct 18 ms 2040 KB Output is correct
33 Correct 20 ms 2040 KB Output is correct
34 Correct 22 ms 2168 KB Output is correct
35 Correct 22 ms 2040 KB Output is correct
36 Correct 23 ms 2040 KB Output is correct
37 Correct 177 ms 2496 KB Output is correct
38 Correct 127 ms 2168 KB Output is correct
39 Correct 151 ms 2168 KB Output is correct

Subtask #4
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1335 ms 17092 KB Output is correct
2 Correct 1092 ms 16956 KB Output is correct
3 Correct 1266 ms 16760 KB Output is correct
4 Correct 1284 ms 16760 KB Output is correct
5 Correct 1277 ms 17016 KB Output is correct
6 Correct 857 ms 16760 KB Output is correct
7 Correct 916 ms 16632 KB Output is correct
8 Correct 899 ms 16632 KB Output is correct
9 Correct 893 ms 16896 KB Output is correct
10 Correct 860 ms 16760 KB Output is correct
11 Correct 966 ms 16888 KB Output is correct
12 Execution timed out 3076 ms 17304 KB Time limit exceeded
13 Halted 0 ms 0 KB -