oj.uz

Submission #103474

# Submission time Handle Problem Language Result Execution time Memory
103474 2019-03-30T19:42:39 Z figter001 Simurgh (IOI17_simurgh) C++17
0 / 100
 20 ms 4768 KB 
#include "simurgh.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 250;

int dsu[nax];
int m,n;
bool used[nax];
vector<pair<int,int>> g[nax];
vector<int> u,v;

int find(int u){
	return u == dsu[u] ? u : dsu[u] = find(dsu[u]);
}

bool good(vector<int> ans){
	for(int i=0;i<n;i++)
		dsu[i] = i;
	for(int i=0;i<ans.size();i++){
		int id = ans[i];
		int a = u[id];
		int b = v[id];
		if(find(a) == find(b))
			continue;
		dsu[find(b)] = find(a);
	}
	for(int i=0;i<n;i++)
		if(find(i) != find(0))
			return 0;
	return 1;
}

vector<int> find_roads(int N, vector<int> U, vector<int> V) {
	vector<int> ans;
	u = U;
	v = V;
	n = N;
	m = u.size();

	for(int i=0;i<n;i++)
		dsu[i] = i;

	int lst;
	for(int i=0;i<m;i++){
		int a = u[i];
		int b = v[i];
		g[a].push_back({b,i});
		g[b].push_back({a,i});
		if(find(a) == find(b))
			continue;
		used[i] = 1;
		ans.push_back(i);
		dsu[find(b)] = find(a);
	}
	lst = count_common_roads(ans);
	for(int i=0;i<ans.size();i++){
		int id = ans[i];
		int a = u[id];
		int b = v[id];
		for(int j=0;j<m;j++){
			if(used[j])
				continue;
			ans[i] = j;
			if(good(ans) == 1){
				int r = count_common_roads(ans);
				if(r < lst){
					ans[i] = id;
					break;
				}
				if(r > lst){
					lst = r;
					used[j] = 1;
					used[id] = 0;
					break;
				}
			}else
				ans[i] = id;
		}
	}
	// for(int i : ans)
	// 	printf("%d ", i);
	// printf("\n");
	return ans;
}

Compilation message

simurgh.cpp: In function 'bool good(std::vector<int>)':
simurgh.cpp:24:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<ans.size();i++){
              ~^~~~~~~~~~~
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:61:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<ans.size();i++){
              ~^~~~~~~~~~~
simurgh.cpp:63:7: warning: unused variable 'a' [-Wunused-variable]
   int a = u[id];
       ^
simurgh.cpp:64:7: warning: unused variable 'b' [-Wunused-variable]
   int b = v[id];
       ^

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB correct
2 Correct 2 ms 256 KB correct
3 Correct 2 ms 384 KB correct
4 Correct 3 ms 384 KB correct
5 Correct 2 ms 256 KB correct
6 Correct 2 ms 256 KB correct
7 Correct 3 ms 256 KB correct
8 Incorrect 3 ms 384 KB WA in grader: NO
9 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB correct
2 Correct 2 ms 256 KB correct
3 Correct 2 ms 384 KB correct
4 Correct 3 ms 384 KB correct
5 Correct 2 ms 256 KB correct
6 Correct 2 ms 256 KB correct
7 Correct 3 ms 256 KB correct
8 Incorrect 3 ms 384 KB WA in grader: NO
9 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB correct
2 Correct 2 ms 256 KB correct
3 Correct 2 ms 384 KB correct
4 Correct 3 ms 384 KB correct
5 Correct 2 ms 256 KB correct
6 Correct 2 ms 256 KB correct
7 Correct 3 ms 256 KB correct
8 Incorrect 3 ms 384 KB WA in grader: NO
9 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB correct
2 Correct 3 ms 384 KB correct
3 Runtime error 20 ms 4768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB correct
2 Correct 2 ms 256 KB correct
3 Correct 2 ms 384 KB correct
4 Correct 3 ms 384 KB correct
5 Correct 2 ms 256 KB correct
6 Correct 2 ms 256 KB correct
7 Correct 3 ms 256 KB correct
8 Incorrect 3 ms 384 KB WA in grader: NO
9 Halted 0 ms 0 KB -