oj.uz

Submission #601068

# Submission time Handle Problem Language Result Execution time Memory
601068 2022-07-21T10:52:44 Z Lucpp Simurgh (IOI17_simurgh) C++17
51 / 100
 2904 ms 4680 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;

int n, m;
vector<pair<int, int>> edges;
vector<vector<pair<int, int>>> g;
vector<int> good;

void calc(int i){
	int start = edges[i].first, goal = edges[i].second;
	queue<int> q;
	q.push(start);
	vector<bool> vis(n);
	vis[start] = true;
	vector<pair<int, int>> last(n);
	while(!q.empty()){
		int u = q.front();
		q.pop();
		for(auto [v, ind] : g[u]){
			if(ind == i || good[ind] == 0) continue;
			if(!vis[v]){
				vis[v] = true;
				q.push(v);
				last[v] = {u, ind};
			}
		}
	}
	if(!vis[goal]){ // bridge
		good[i] = true;
		return;
	}
	vector<int> cycle;
	vector<int> inCycle(m);
	int u = goal;
	while(u != start){
		inCycle[last[u].second] = true;
		cycle.push_back(last[u].second);
		u = last[u].first;
	}
	inCycle[i] = true;
	cycle.push_back(i);
	vector<int> forest;
	for(u = 0; u < n; u++){
		if(u != start){
			int e = last[u].second;
			if(!inCycle[e]) forest.push_back(e);
		}
	}
	int c = (int)cycle.size();
	vector<int> ans(c);
	for(int j = 0; j < c; j++){
		if(good[cycle[j]] == 1) ans[j] = -1;
		else{
			vector<int> v;
			for(int k = 0; k < c; k++){
				if(k != j) v.push_back(cycle[k]);
			}
			for(int e : forest) v.push_back(e);
			ans[j] = count_common_roads(v);
		}
	}
	for(int j = 0; j < c; j++){
		int ma = 0;
		for(int k = 0; k < c; k++){
			if(j != k) ma = max(ma, ans[k]);
		}
		good[cycle[j]] = ma > ans[j];
	}
}

vector<bool> vis, evis;
vector<int> path;
void dfs(int u){
	vis[u] = true;
	for(auto [v, ind] : g[u]){
		if(vis[v] || evis[ind]) continue;
		dfs(v);
		path.push_back(ind);
		evis[ind] = true;
	}
}

vector<int> find_roads(int n_, vector<int> u, vector<int> v) {
	n = n_;
	m = (int)u.size();
	g.resize(n);
	for(int i = 0; i < m; i++){
		edges.emplace_back(u[i], v[i]);
		g[u[i]].emplace_back(v[i], i);
		g[v[i]].emplace_back(u[i], i);
	}
	good.resize(m, -1);
	evis.resize(m);
	while(true){
		path.clear();
		vis.assign(n, false);
		dfs(0);
		if((int)path.size() != n-1) break;
		if(count_common_roads(path) == 0){
			for(int e : path) good[e] = 0;
		}
	}
	for(int i = 0; i < m; i++){
		if(good[i] == -1){
			calc(i);
		}
	}
	vector<int> r;
	for(int i = 0; i < m; i++) if(good[i] == 1) r.push_back(i);
	return r;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 0 ms 212 KB correct
3 Correct 1 ms 212 KB correct
4 Correct 0 ms 212 KB correct
5 Correct 1 ms 212 KB correct
6 Correct 0 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 0 ms 212 KB correct
10 Correct 0 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 0 ms 212 KB correct
14 Correct 7 ms 340 KB correct
15 Correct 9 ms 340 KB correct
16 Correct 9 ms 376 KB correct
17 Correct 6 ms 468 KB correct
18 Correct 2 ms 212 KB correct
19 Correct 6 ms 340 KB correct
20 Correct 6 ms 340 KB correct
21 Correct 4 ms 340 KB correct
22 Correct 4 ms 340 KB correct
23 Correct 3 ms 212 KB correct
24 Correct 3 ms 340 KB correct
25 Correct 1 ms 212 KB correct
26 Correct 3 ms 340 KB correct
27 Correct 3 ms 340 KB correct
28 Correct 1 ms 212 KB correct
29 Correct 1 ms 212 KB correct
30 Correct 3 ms 340 KB correct
31 Correct 3 ms 340 KB correct
32 Correct 3 ms 340 KB correct
33 Correct 3 ms 340 KB correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 0 ms 212 KB correct
3 Correct 1 ms 212 KB correct
4 Correct 0 ms 212 KB correct
5 Correct 1 ms 212 KB correct
6 Correct 0 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 0 ms 212 KB correct
10 Correct 0 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 0 ms 212 KB correct
14 Correct 7 ms 340 KB correct
15 Correct 9 ms 340 KB correct
16 Correct 9 ms 376 KB correct
17 Correct 6 ms 468 KB correct
18 Correct 2 ms 212 KB correct
19 Correct 6 ms 340 KB correct
20 Correct 6 ms 340 KB correct
21 Correct 4 ms 340 KB correct
22 Correct 4 ms 340 KB correct
23 Correct 3 ms 212 KB correct
24 Correct 3 ms 340 KB correct
25 Correct 1 ms 212 KB correct
26 Correct 3 ms 340 KB correct
27 Correct 3 ms 340 KB correct
28 Correct 1 ms 212 KB correct
29 Correct 1 ms 212 KB correct
30 Correct 3 ms 340 KB correct
31 Correct 3 ms 340 KB correct
32 Correct 3 ms 340 KB correct
33 Correct 3 ms 340 KB correct
34 Correct 2159 ms 1804 KB correct
35 Correct 1981 ms 1760 KB correct
36 Correct 968 ms 1504 KB correct
37 Correct 20 ms 340 KB correct
38 Correct 2360 ms 1784 KB correct
39 Correct 1857 ms 1652 KB correct
40 Correct 1140 ms 1488 KB correct
41 Correct 2728 ms 1784 KB correct
42 Correct 2552 ms 1788 KB correct
43 Correct 784 ms 1256 KB correct
44 Correct 543 ms 904 KB correct
45 Correct 731 ms 1072 KB correct
46 Correct 456 ms 924 KB correct
47 Correct 116 ms 596 KB correct
48 Correct 5 ms 340 KB correct
49 Correct 20 ms 340 KB correct
50 Correct 112 ms 596 KB correct
51 Correct 726 ms 1084 KB correct
52 Correct 549 ms 980 KB correct
53 Correct 440 ms 924 KB correct
54 Correct 804 ms 1268 KB correct
55 Correct 644 ms 1108 KB correct
56 Correct 648 ms 1108 KB correct
57 Correct 689 ms 1108 KB correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 1 ms 212 KB correct
3 Incorrect 2904 ms 4680 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 0 ms 212 KB correct
3 Correct 1 ms 212 KB correct
4 Correct 0 ms 212 KB correct
5 Correct 1 ms 212 KB correct
6 Correct 0 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 0 ms 212 KB correct
10 Correct 0 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 0 ms 212 KB correct
14 Correct 7 ms 340 KB correct
15 Correct 9 ms 340 KB correct
16 Correct 9 ms 376 KB correct
17 Correct 6 ms 468 KB correct
18 Correct 2 ms 212 KB correct
19 Correct 6 ms 340 KB correct
20 Correct 6 ms 340 KB correct
21 Correct 4 ms 340 KB correct
22 Correct 4 ms 340 KB correct
23 Correct 3 ms 212 KB correct
24 Correct 3 ms 340 KB correct
25 Correct 1 ms 212 KB correct
26 Correct 3 ms 340 KB correct
27 Correct 3 ms 340 KB correct
28 Correct 1 ms 212 KB correct
29 Correct 1 ms 212 KB correct
30 Correct 3 ms 340 KB correct
31 Correct 3 ms 340 KB correct
32 Correct 3 ms 340 KB correct
33 Correct 3 ms 340 KB correct
34 Correct 2159 ms 1804 KB correct
35 Correct 1981 ms 1760 KB correct
36 Correct 968 ms 1504 KB correct
37 Correct 20 ms 340 KB correct
38 Correct 2360 ms 1784 KB correct
39 Correct 1857 ms 1652 KB correct
40 Correct 1140 ms 1488 KB correct
41 Correct 2728 ms 1784 KB correct
42 Correct 2552 ms 1788 KB correct
43 Correct 784 ms 1256 KB correct
44 Correct 543 ms 904 KB correct
45 Correct 731 ms 1072 KB correct
46 Correct 456 ms 924 KB correct
47 Correct 116 ms 596 KB correct
48 Correct 5 ms 340 KB correct
49 Correct 20 ms 340 KB correct
50 Correct 112 ms 596 KB correct
51 Correct 726 ms 1084 KB correct
52 Correct 549 ms 980 KB correct
53 Correct 440 ms 924 KB correct
54 Correct 804 ms 1268 KB correct
55 Correct 644 ms 1108 KB correct
56 Correct 648 ms 1108 KB correct
57 Correct 689 ms 1108 KB correct
58 Correct 0 ms 212 KB correct
59 Correct 1 ms 212 KB correct
60 Incorrect 2904 ms 4680 KB WA in grader: NO
61 Halted 0 ms 0 KB -