oj.uz

답안 #790780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
790780 2023-07-23T07:56:02 Z PoonYaPat Simurgh (IOI17_simurgh) C++14
30 / 100
 141 ms 5452 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
 
struct Edge {
	int a,idx,mode;
};
 
int n,m,deg[505],cnt;
vector<int> adj2[505],comp[505];
vector<pii> edge,adj[505];
int mat[505][505];
bool ans[250010];
 
int p[505],r[505];
bool vis[505];


void reset() {
	cnt=0;
	for (int i=0; i<n; ++i) p[i]=i, r[i]=1, adj2[i].clear(), comp[i].clear(), vis[i]=false;
}

void dfs(int x) {
	vis[x]=true;
	comp[cnt].push_back(x);
	for (auto s : adj2[x]) if (!vis[s]) dfs(s);
}
 
int find(int x) {
	while (x!=p[x]) x=p[x];
	return x; 
} 
 
void unite(int x, int y) {
	x=find(x); y=find(y);
	if (r[x]<r[y]) swap(x,y);
	p[y]=x;
	if (r[x]==r[y]) ++r[x];
}
 
void solve1(int x) {
	vector<int> v;
	int ma=0;
	reset();
 
	for (int i=0; i<m; ++i) {
		if (edge[i].first==x || edge[i].second==x) continue;

		if (find(edge[i].first)!=find(edge[i].second)) {

			adj2[edge[i].first].push_back(edge[i].second);
			adj2[edge[i].second].push_back(edge[i].first);

			//cout<<edge[i].first<<" "<<edge[i].second<<"\n";

			unite(edge[i].first,edge[i].second);
			v.push_back(i);
		}
	}
 
	for (int i=0; i<n; ++i) if (!vis[i] && i!=x) dfs(i), ++cnt;

	for (int i=0; i<cnt; ++i) {
		//consider edge from x to comp[i]

		//add edge to every comp except comp[i]
		for (int j=0; j<cnt; ++j) {
			if (j==i) continue;
			for (auto s : comp[j]) {
				if (mat[s][x]!=-1) {
					v.push_back(mat[s][x]);
					break;
				} 
			}
		}

		//consider every edge to comp[i]
		vector<pii> temp;
		int ma=0;
		for (auto s : comp[i]) {
			if (mat[s][x]!=-1) {
				v.push_back(mat[s][x]);
				int h=count_common_roads(v);
				ma=max(ma,h);
				temp.push_back(pii(h,mat[s][x]));
				v.pop_back();
			}
		}

		for (auto s : temp) if (s.first==ma) ans[s.second]=true;

		for (int j=0; j<cnt-1; ++j) v.pop_back();
	}
	
	
}
 
 
vector<int> find_roads(int N, vector<int> u, vector<int> v) {
	n=N;
	m=u.size();
	memset(mat,-1,sizeof(mat));
	for (int i=0; i<m; ++i) {
		edge.push_back(pii(u[i],v[i]));
		adj[u[i]].push_back(pii(v[i],i));
		adj[v[i]].push_back(pii(u[i],i));
		mat[u[i]][v[i]]=mat[v[i]][u[i]]=i;
	}
	
	vector<int> Ans;
	for (int i=0; i<n; ++i) solve1(i);
	for (int i=0; i<m; ++i) if (ans[i]) Ans.push_back(i);
	return Ans;
}

Compilation message

simurgh.cpp: In function 'void solve1(int)':
simurgh.cpp:45:6: warning: unused variable 'ma' [-Wunused-variable]
   45 |  int ma=0;
      |      ^~

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1236 KB correct
2 Correct 1 ms 1236 KB correct
3 Correct 1 ms 1236 KB correct
4 Correct 1 ms 1236 KB correct
5 Correct 1 ms 1236 KB correct
6 Correct 1 ms 1236 KB correct
7 Correct 1 ms 1236 KB correct
8 Correct 1 ms 1236 KB correct
9 Correct 1 ms 1236 KB correct
10 Correct 1 ms 1236 KB correct
11 Correct 1 ms 1236 KB correct
12 Correct 1 ms 1236 KB correct
13 Correct 1 ms 1236 KB correct
14 Correct 3 ms 1364 KB correct
15 Correct 3 ms 1364 KB correct
16 Correct 3 ms 1364 KB correct
17 Correct 3 ms 1364 KB correct
18 Correct 1 ms 1364 KB correct
19 Correct 2 ms 1364 KB correct
20 Correct 2 ms 1364 KB correct
21 Correct 2 ms 1364 KB correct
22 Correct 2 ms 1364 KB correct
23 Correct 2 ms 1364 KB correct
24 Correct 2 ms 1364 KB correct
25 Correct 1 ms 1236 KB correct
26 Correct 2 ms 1364 KB correct
27 Correct 2 ms 1364 KB correct
28 Correct 1 ms 1364 KB correct
29 Correct 1 ms 1236 KB correct
30 Correct 2 ms 1364 KB correct
31 Correct 2 ms 1364 KB correct
32 Correct 2 ms 1364 KB correct
33 Correct 2 ms 1364 KB correct
34 Incorrect 141 ms 2620 KB WA in grader: NO
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1236 KB correct
2 Correct 1 ms 1236 KB correct
3 Incorrect 110 ms 5452 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1236 KB correct
2 Correct 1 ms 1236 KB correct
3 Correct 1 ms 1236 KB correct
4 Correct 1 ms 1236 KB correct
5 Correct 1 ms 1236 KB correct
6 Correct 1 ms 1236 KB correct
7 Correct 1 ms 1236 KB correct
8 Correct 1 ms 1236 KB correct
9 Correct 1 ms 1236 KB correct
10 Correct 1 ms 1236 KB correct
11 Correct 1 ms 1236 KB correct
12 Correct 1 ms 1236 KB correct
13 Correct 1 ms 1236 KB correct
14 Correct 3 ms 1364 KB correct
15 Correct 3 ms 1364 KB correct
16 Correct 3 ms 1364 KB correct
17 Correct 3 ms 1364 KB correct
18 Correct 1 ms 1364 KB correct
19 Correct 2 ms 1364 KB correct
20 Correct 2 ms 1364 KB correct
21 Correct 2 ms 1364 KB correct
22 Correct 2 ms 1364 KB correct
23 Correct 2 ms 1364 KB correct
24 Correct 2 ms 1364 KB correct
25 Correct 1 ms 1236 KB correct
26 Correct 2 ms 1364 KB correct
27 Correct 2 ms 1364 KB correct
28 Correct 1 ms 1364 KB correct
29 Correct 1 ms 1236 KB correct
30 Correct 2 ms 1364 KB correct
31 Correct 2 ms 1364 KB correct
32 Correct 2 ms 1364 KB correct
33 Correct 2 ms 1364 KB correct
34 Incorrect 141 ms 2620 KB WA in grader: NO
35 Halted 0 ms 0 KB -