oj.uz

Submission #821020

# Submission time Handle Problem Language Result Execution time Memory
821020 2023-08-11T07:01:55 Z vjudge1 Simurgh (IOI17_simurgh) C++17
30 / 100
 3000 ms 9144 KB 
#include<bits/stdc++.h>
#include "simurgh.h"

using namespace std;

const int N = 510;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

struct DSU {
	vector<int> p;
	vector<vector<int>> st;
	void init(int n) {
		p.resize(n), st.resize(n);
		for(int i = 0; i < n; i++) {
			p[i] = i;
			st[i].push_back(i);
		}
	}
	int find(int x) {
		return p[x] = (p[x] == x ? x : find(p[x]));
	}
	void merge(int u, int v) {
		u = find(u);
		v = find(v);
		if(u == v) return;
		if((int)st[u].size() < (int)st[v].size()) 
			swap(u, v);
		p[v] = u;
		for(auto c : st[v]) 
			st[u].push_back(c);
	}
};

struct edge {
	int u, v, inx;
	int to(int u) {
		return (this->u == u ? this->v : this->u);
	}
};

DSU ds;
vector<int> g[N];
edge e[N * N];
int type[N * N], royal_cnt = 0;
// 0 = unknown, 1 = royal, 2 = common
void coloring(int x, int cl) {
	x = ds.find(x);
	for(int c : ds.st[x]) {
		type[c] = cl;
		royal_cnt += (cl == 1);
	}
}

int n, m;
int tin[N], tout[N], T = 0;
vector<bool> vis;
vector<int> used;

void dfs(int s = 0) {
	vis[s] = 1;
	tin[s] = T++;
	for(int i : g[s]) {
		if(!vis[e[i].to(s)] && !type[i]) {
			used.push_back(i);
			dfs(e[i].to(s));
		}
	}
	for(int i : g[s]) {
		if(!vis[e[i].to(s)] && type[i] == 1) {
			used.push_back(i);
			dfs(e[i].to(s));
		} 
	}
	tout[s] = T++;
}

bool up(int u, int v) {
	return tin[u] <= tin[v] && tout[u] >= tout[v];
}
vector<int> travel() {
	vis.assign(n, false);
	used.clear();
	T = 0;
	dfs();
	return used;
}

bool isAble(int i, int j) {
	int u = e[i].u, v = e[i].v;
	int x = e[j].u, y = e[j].v;
	if(tin[u] > tin[v]) swap(u, v);
	if(tin[x] > tin[y]) swap(x, y);
	return (up(v, y) && up(x, u));
}

vector<int> find_roads(int N, vector<int> u, vector<int> v) {
	n = N;
	m = (int)u.size();
	for(int i = 0; i < m; i++) {
		e[i] = {u[i], v[i], i}; 
		g[u[i]].push_back(i);
		g[v[i]].push_back(i);
	}
	ds.init(m);
	while(royal_cnt < n - 1) {
		vector<int> w = travel();
		int res0 = count_common_roads(w);
		if(res0 == n - 1) return w;
		vector<int> un_w;
		for(int inx : w) {
			if(!type[inx])
				un_w.push_back(inx);
		}
		int chosen = un_w[rnd() % ((int)un_w.size())], sec_ch = -1;
		vector<int> rep_e;
		for(int i = 0; i < m; ++i) {
			if(isAble(chosen, i)) 
				rep_e.push_back(i);
		}
		if(rep_e.empty()) {
			coloring(chosen, 1);
			continue;
		}
		for(int c : rep_e) {
			if(type[c]) {
				sec_ch = c;
				break;
			}
		}

		if(sec_ch != -1) {
			w.erase(find(w.begin(), w.end(), chosen));
			w.push_back(sec_ch);
			int res1 = count_common_roads(w);
			if(res0 == res1) coloring(chosen, type[sec_ch]);
			else coloring(chosen, 1 + (res0 < res1));
		} else {
			for(int c : rep_e) {
				if(ds.find(c) != ds.find(chosen)) {
					sec_ch = c;
					break;
				}
			}
			if(sec_ch == -1) continue;
			w.erase(find(w.begin(), w.end(), chosen));
			w.push_back(sec_ch);
			int res1 = count_common_roads(w);
			if(res0 == res1) ds.merge(chosen, sec_ch);
			else {
				if(res0 < res1) 
					coloring(chosen, 2),
					coloring(sec_ch, 1);
				else 
					coloring(chosen, 1),
					coloring(sec_ch, 2);
			}
		}
	}
	vector<int> r;
	for(int i = 0; i < m; i++) {
		if(type[i] == 1) 
			r.push_back(i);
	}
	return r;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 1 ms 324 KB correct
3 Correct 0 ms 328 KB correct
4 Correct 1 ms 340 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 1 ms 340 KB correct
7 Correct 1 ms 324 KB correct
8 Correct 0 ms 340 KB correct
9 Correct 0 ms 212 KB correct
10 Correct 1 ms 328 KB correct
11 Correct 1 ms 340 KB correct
12 Correct 0 ms 340 KB correct
13 Correct 1 ms 340 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 1 ms 324 KB correct
3 Correct 0 ms 328 KB correct
4 Correct 1 ms 340 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 1 ms 340 KB correct
7 Correct 1 ms 324 KB correct
8 Correct 0 ms 340 KB correct
9 Correct 0 ms 212 KB correct
10 Correct 1 ms 328 KB correct
11 Correct 1 ms 340 KB correct
12 Correct 0 ms 340 KB correct
13 Correct 1 ms 340 KB correct
14 Correct 57 ms 468 KB correct
15 Correct 49 ms 468 KB correct
16 Correct 66 ms 476 KB correct
17 Correct 45 ms 440 KB correct
18 Correct 6 ms 340 KB correct
19 Correct 40 ms 452 KB correct
20 Correct 35 ms 432 KB correct
21 Correct 29 ms 340 KB correct
22 Correct 18 ms 340 KB correct
23 Correct 15 ms 408 KB correct
24 Correct 16 ms 400 KB correct
25 Correct 1 ms 340 KB correct
26 Correct 5 ms 340 KB correct
27 Correct 6 ms 328 KB correct
28 Correct 3 ms 328 KB correct
29 Correct 2 ms 340 KB correct
30 Correct 6 ms 332 KB correct
31 Correct 7 ms 328 KB correct
32 Correct 4 ms 340 KB correct
33 Correct 5 ms 340 KB correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 1 ms 324 KB correct
3 Correct 0 ms 328 KB correct
4 Correct 1 ms 340 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 1 ms 340 KB correct
7 Correct 1 ms 324 KB correct
8 Correct 0 ms 340 KB correct
9 Correct 0 ms 212 KB correct
10 Correct 1 ms 328 KB correct
11 Correct 1 ms 340 KB correct
12 Correct 0 ms 340 KB correct
13 Correct 1 ms 340 KB correct
14 Correct 57 ms 468 KB correct
15 Correct 49 ms 468 KB correct
16 Correct 66 ms 476 KB correct
17 Correct 45 ms 440 KB correct
18 Correct 6 ms 340 KB correct
19 Correct 40 ms 452 KB correct
20 Correct 35 ms 432 KB correct
21 Correct 29 ms 340 KB correct
22 Correct 18 ms 340 KB correct
23 Correct 15 ms 408 KB correct
24 Correct 16 ms 400 KB correct
25 Correct 1 ms 340 KB correct
26 Correct 5 ms 340 KB correct
27 Correct 6 ms 328 KB correct
28 Correct 3 ms 328 KB correct
29 Correct 2 ms 340 KB correct
30 Correct 6 ms 332 KB correct
31 Correct 7 ms 328 KB correct
32 Correct 4 ms 340 KB correct
33 Correct 5 ms 340 KB correct
34 Execution timed out 3076 ms 3576 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 1 ms 328 KB correct
3 Execution timed out 3076 ms 9144 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 1 ms 324 KB correct
3 Correct 0 ms 328 KB correct
4 Correct 1 ms 340 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 1 ms 340 KB correct
7 Correct 1 ms 324 KB correct
8 Correct 0 ms 340 KB correct
9 Correct 0 ms 212 KB correct
10 Correct 1 ms 328 KB correct
11 Correct 1 ms 340 KB correct
12 Correct 0 ms 340 KB correct
13 Correct 1 ms 340 KB correct
14 Correct 57 ms 468 KB correct
15 Correct 49 ms 468 KB correct
16 Correct 66 ms 476 KB correct
17 Correct 45 ms 440 KB correct
18 Correct 6 ms 340 KB correct
19 Correct 40 ms 452 KB correct
20 Correct 35 ms 432 KB correct
21 Correct 29 ms 340 KB correct
22 Correct 18 ms 340 KB correct
23 Correct 15 ms 408 KB correct
24 Correct 16 ms 400 KB correct
25 Correct 1 ms 340 KB correct
26 Correct 5 ms 340 KB correct
27 Correct 6 ms 328 KB correct
28 Correct 3 ms 328 KB correct
29 Correct 2 ms 340 KB correct
30 Correct 6 ms 332 KB correct
31 Correct 7 ms 328 KB correct
32 Correct 4 ms 340 KB correct
33 Correct 5 ms 340 KB correct
34 Execution timed out 3076 ms 3576 KB Time limit exceeded
35 Halted 0 ms 0 KB -