oj.uz

답안 #1053473

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053473 2024-08-11T12:20:46 Z Unforgettablepl Simurgh (IOI17_simurgh) C++17
30 / 100
 3000 ms 2200 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_roads(int n, vector<int> u, vector<int> v){
	int m = u.size();
	set<int> graph;
	vector<set<pair<int,int>>> adj(n);
	vector<bool> confirmed(m);
	function<bool(int,int,int)> finder = [&](int x,int p,int tar) {
		if(x==tar)return true;
		for(auto[v,idx]:adj[x])if(v!=p)if(finder(v,x,tar))return true;
		return false;
	};
	auto differential = [&](int x){
		stack<int> edges;
		function<bool(int,int)> dfs = [&](int xx,int p) {
			if(xx==v[x])return true;
			for(auto[v,idx]:adj[xx])if(v!=p){
				edges.emplace(idx);
				if(dfs(v,xx))return true;
				edges.pop();
			}
			return false;
		};
		dfs(u[x],-1);
		if(edges.empty()) {
			graph.insert(x);
			adj[u[x]].emplace(v[x],x);
			adj[v[x]].emplace(u[x],x);
		}
		vector<int> finaledges;
		while(!edges.empty()) {
			finaledges.emplace_back(edges.top());
			edges.pop();
		}
		vector<int> sameas;
		bool included = false;
		for(int&i:finaledges) {
			if(confirmed[i])continue;
			auto base = count_common_roads(vector(graph.begin(),graph.end()));
			graph.erase(i);
			graph.insert(x);
			auto diff = count_common_roads(vector(graph.begin(),graph.end()));
			graph.erase(x);
			graph.insert(i);
			if(diff==base) {
				sameas.emplace_back(i);
				continue;
			}
			if(diff>base) {
				included=true;
				graph.erase(i);
				adj[u[i]].erase({v[i],i});
				adj[v[i]].erase({u[i],i});
			}
			break;
		}
		if(included) {
			graph.insert(x);
			adj[u[x]].emplace(v[x],x);
			adj[v[x]].emplace(u[x],x);
			confirmed[x]=true;
			for(int&i:sameas)confirmed[i]=true;
		} else {
			for(int&i:sameas) {
				graph.erase(i);
				adj[u[i]].erase({v[i],i});
				adj[v[i]].erase({u[i],i});
			}
		}
	};
	vector<bool> visited(m);
	for(int i=0;i<m;i++) {
		if(graph.size()!=n-1) {
			for(int j=i;j<m;j++) {
				if(visited[j])continue;
				if(finder(u[j],-1,v[j])==false) {
					visited[j]=true;
					graph.insert(j);
					adj[u[j]].emplace(v[j],j);
					adj[v[j]].emplace(u[j],j);
				}
			}
		}
		if(visited[i])continue;
		differential(i);
	}
	return vector(graph.begin(), graph.end());
}

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:75:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   75 |   if(graph.size()!=n-1) {
      |      ~~~~~~~~~~~~^~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 432 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 1 ms 348 KB correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 432 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 1 ms 348 KB correct
14 Correct 30 ms 344 KB correct
15 Correct 33 ms 348 KB correct
16 Correct 37 ms 468 KB correct
17 Correct 27 ms 344 KB correct
18 Correct 4 ms 344 KB correct
19 Correct 26 ms 344 KB correct
20 Correct 20 ms 348 KB correct
21 Correct 17 ms 344 KB correct
22 Correct 2 ms 348 KB correct
23 Correct 1 ms 348 KB correct
24 Correct 1 ms 348 KB correct
25 Correct 0 ms 348 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 348 KB correct
28 Correct 1 ms 348 KB correct
29 Correct 0 ms 348 KB correct
30 Correct 1 ms 452 KB correct
31 Correct 2 ms 596 KB correct
32 Correct 2 ms 348 KB correct
33 Correct 2 ms 348 KB correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 432 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 1 ms 348 KB correct
14 Correct 30 ms 344 KB correct
15 Correct 33 ms 348 KB correct
16 Correct 37 ms 468 KB correct
17 Correct 27 ms 344 KB correct
18 Correct 4 ms 344 KB correct
19 Correct 26 ms 344 KB correct
20 Correct 20 ms 348 KB correct
21 Correct 17 ms 344 KB correct
22 Correct 2 ms 348 KB correct
23 Correct 1 ms 348 KB correct
24 Correct 1 ms 348 KB correct
25 Correct 0 ms 348 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 348 KB correct
28 Correct 1 ms 348 KB correct
29 Correct 0 ms 348 KB correct
30 Correct 1 ms 452 KB correct
31 Correct 2 ms 596 KB correct
32 Correct 2 ms 348 KB correct
33 Correct 2 ms 348 KB correct
34 Execution timed out 3022 ms 1116 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB correct
2 Correct 0 ms 348 KB correct
3 Execution timed out 3095 ms 2200 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 432 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 1 ms 348 KB correct
14 Correct 30 ms 344 KB correct
15 Correct 33 ms 348 KB correct
16 Correct 37 ms 468 KB correct
17 Correct 27 ms 344 KB correct
18 Correct 4 ms 344 KB correct
19 Correct 26 ms 344 KB correct
20 Correct 20 ms 348 KB correct
21 Correct 17 ms 344 KB correct
22 Correct 2 ms 348 KB correct
23 Correct 1 ms 348 KB correct
24 Correct 1 ms 348 KB correct
25 Correct 0 ms 348 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 348 KB correct
28 Correct 1 ms 348 KB correct
29 Correct 0 ms 348 KB correct
30 Correct 1 ms 452 KB correct
31 Correct 2 ms 596 KB correct
32 Correct 2 ms 348 KB correct
33 Correct 2 ms 348 KB correct
34 Execution timed out 3022 ms 1116 KB Time limit exceeded
35 Halted 0 ms 0 KB -