oj.uz

Submission #790679

# Submission time Handle Problem Language Result Execution time Memory
790679 2023-07-23T05:26:32 Z ttamx Simurgh (IOI17_simurgh) C++14
13 / 100
 16 ms 3636 KB 
#include "simurgh.h"
#include<bits/stdc++.h>

using namespace std;

const int N=505;
const int M=15005;

int n,m;
vector<int> adj[N];
vector<int> edge,ans;
int eu[M],ev[M];
bool vis[N],used[M];
int pa[N],pa2[M];
int val[M];

int fp(int u){
	if(pa[u]==u)return u;
	return pa[u]=fp(pa[u]);
}

int fp2(int u){
	if(pa2[u]==u)return u;
	return pa2[u]=fp2(pa2[u]);
}

int go(int u,int i){
	return u^eu[i]^ev[i];
}

bool valid(){
	iota(pa,pa+n,0);
	for(auto i:edge){
		int u=fp(eu[i]),v=fp(ev[i]);
		if(u==v)return false;
		pa[u]=v;
	}
	return true;
}

vector<int> find_roads(int n, vector<int> u, vector<int> v) {
	::n=n;
	m=u.size();
	for(int i=0;i<u.size();i++){
		eu[i]=u[i];
		ev[i]=v[i];
		adj[u[i]].emplace_back(i);
		adj[v[i]].emplace_back(i);
	}
	iota(pa2,pa2+m,0);
	queue<int> q;
	vis[0]=true;
	q.emplace(0);
	while(!q.empty()){
		int u=q.front();
		q.pop();
		for(auto i:adj[u]){
			int v=go(u,i);
			if(vis[v])continue;
			vis[v]=true;
			q.emplace(v);
			edge.emplace_back(i);
		}
	}
	int res=count_common_roads(edge);
	if(res==n-1)return edge;
	for(auto i:edge)used[i]=true;
	for(int i=0;i<n-1;i++){
		int e=edge[i];
		for(int j=0;j<m;j++){
			if(used[j])continue;
			edge[i]=j;
			if(!valid()){
				edge[i]=e;
				continue;
			}
			int tmp=count_common_roads(edge);
			edge[i]=e;
			if(res==tmp){
				if(fp2(e)!=fp2(j)){
					pa2[fp2(e)]=fp2(j);
					val[fp2(e)]|=val[fp2(j)];
				}
			}else if(tmp>res){
				val[fp2(j)]|=1;
				val[fp2(e)]|=2;
			}else{
				val[fp2(j)]|=2;
				val[fp2(e)]|=1;
			}
		}
	}
	for(int i=0;i<m;i++)if(val[fp2(i)]==1)ans.emplace_back(i);
	return ans;
}

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:44:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |  for(int i=0;i<u.size();i++){
      |              ~^~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB correct
2 Correct 0 ms 340 KB correct
3 Correct 0 ms 340 KB correct
4 Correct 0 ms 340 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 0 ms 340 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 0 ms 340 KB correct
9 Correct 0 ms 212 KB correct
10 Correct 0 ms 340 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 1 ms 212 KB correct
14 Correct 15 ms 340 KB correct
15 Correct 15 ms 396 KB correct
16 Correct 16 ms 396 KB correct
17 Correct 15 ms 340 KB correct
18 Correct 5 ms 340 KB correct
19 Correct 13 ms 392 KB correct
20 Correct 12 ms 384 KB correct
21 Correct 11 ms 340 KB correct
22 Incorrect 8 ms 376 KB WA in grader: NO
23 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB correct
2 Correct 0 ms 340 KB correct
3 Correct 0 ms 340 KB correct
4 Correct 0 ms 340 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 0 ms 340 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 0 ms 340 KB correct
9 Correct 0 ms 212 KB correct
10 Correct 0 ms 340 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 1 ms 212 KB correct
14 Correct 15 ms 340 KB correct
15 Correct 15 ms 396 KB correct
16 Correct 16 ms 396 KB correct
17 Correct 15 ms 340 KB correct
18 Correct 5 ms 340 KB correct
19 Correct 13 ms 392 KB correct
20 Correct 12 ms 384 KB correct
21 Correct 11 ms 340 KB correct
22 Incorrect 8 ms 376 KB WA in grader: NO
23 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB correct
2 Correct 0 ms 340 KB correct
3 Runtime error 12 ms 3636 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB correct
2 Correct 0 ms 340 KB correct
3 Correct 0 ms 340 KB correct
4 Correct 0 ms 340 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 0 ms 340 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 0 ms 340 KB correct
9 Correct 0 ms 212 KB correct
10 Correct 0 ms 340 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 1 ms 212 KB correct
14 Correct 15 ms 340 KB correct
15 Correct 15 ms 396 KB correct
16 Correct 16 ms 396 KB correct
17 Correct 15 ms 340 KB correct
18 Correct 5 ms 340 KB correct
19 Correct 13 ms 392 KB correct
20 Correct 12 ms 384 KB correct
21 Correct 11 ms 340 KB correct
22 Incorrect 8 ms 376 KB WA in grader: NO
23 Halted 0 ms 0 KB -