oj.uz

답안 #283789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283789 2020-08-26T07:20:59 Z emanIaicepsa Simurgh (IOI17_simurgh) C++14
30 / 100
 64 ms 5992 KB 
#include "simurgh.h"
#include<bits/stdc++.h>
#define pb emplace_back
#define vi vector<int>
#define pii pair<int,int>
#define fi first
#define se second
#define all(n) (n).begin(),(n).end()
using namespace std;

vi ans, pos, pos2, U, V;

int pa[505], N, M;
void init(){
	for(int i=0;i<N;i++) pa[i] = i;
}
int fp(int x){
	if(pa[x] == x) return x;
	return pa[x] = fp(pa[x]);
}
void uni(int x,int y){
	x = fp(x), y = fp(y);
	assert(x != y);
	pa[x] = y;
}

bool dead[25005];
void search_next(){
	init();
	int cnt = N;
	pos.clear();
	for(int i=0;i<M;i++) if(!dead[i]) pos.pb(i);
	random_shuffle(all(pos));
	vi cur;
	for(auto &i:ans){
		uni(U[i], V[i]);
		cur.pb(i);
		cnt--;
	}
	vector<pii> tried;
	for(auto &i:pos){
		if(cnt == 2){
			if(fp(U[i]) != fp(V[i])){
				cur.pb(i);
				assert(cur.size() == N-1);
				int common = count_common_roads(cur); 
				/* cout<<common<<" "<<i<<'\n'; */
				tried.pb(common,i);
				cur.pop_back();
			}
			else pos2.pb(i);
		}
		else{
			if(fp(U[i]) != fp(V[i])){
				cur.pb(i);
				uni(U[i], V[i]);
				cnt--;
			}
			pos2.pb(i);
		}
	}
	pair<int,int> mx = *max_element(all(tried));
	int presiz = ans.size();
	for(auto &x : tried){
		bool notmore = 0;
		if(x.fi == mx.fi){
			ans.pb(x.se), dead[x.se] = 1;
		}
		else if(x.fi == presiz && !notmore){
			notmore = 1;
			for(auto &i:cur) dead[x.se] = 1;
		}
	}
	/* for(auto i:pos) cout<<i<<" "; cout<<'\n'; */
}
// count_common_roads(vi v);

std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
	srand(time(0));
	M = u.size(), N = n;
	U = u, V = v;
	for(int i=0;i<M;i++) pos.pb(i);
	while(ans.size() < N - 1) search_next();
	/* for(auto i:ans) cout<<i<<" "; cout<<'\n'; */
	return ans;
}

Compilation message

In file included from /usr/include/c++/9/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:33,
                 from simurgh.cpp:2:
simurgh.cpp: In function 'void search_next()':
simurgh.cpp:45:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |     assert(cur.size() == N-1);
      |            ~~~~~~~~~~~^~~~~~
simurgh.cpp:71:14: warning: unused variable 'i' [-Wunused-variable]
   71 |    for(auto &i:cur) dead[x.se] = 1;
      |              ^
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:83:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   83 |  while(ans.size() < N - 1) search_next();
      |        ~~~~~~~~~~~^~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB correct
2 Correct 1 ms 256 KB correct
3 Correct 0 ms 256 KB correct
4 Correct 1 ms 256 KB correct
5 Correct 1 ms 256 KB correct
6 Correct 0 ms 256 KB correct
7 Correct 0 ms 256 KB correct
8 Correct 1 ms 256 KB correct
9 Correct 1 ms 256 KB correct
10 Correct 0 ms 256 KB correct
11 Correct 0 ms 256 KB correct
12 Correct 0 ms 256 KB correct
13 Correct 1 ms 256 KB correct
14 Correct 5 ms 640 KB correct
15 Correct 5 ms 768 KB correct
16 Correct 5 ms 640 KB correct
17 Correct 4 ms 512 KB correct
18 Correct 2 ms 384 KB correct
19 Correct 3 ms 556 KB correct
20 Correct 4 ms 512 KB correct
21 Correct 4 ms 540 KB correct
22 Correct 2 ms 512 KB correct
23 Correct 2 ms 512 KB correct
24 Correct 3 ms 508 KB correct
25 Correct 1 ms 384 KB correct
26 Correct 2 ms 512 KB correct
27 Correct 2 ms 512 KB correct
28 Correct 2 ms 384 KB correct
29 Correct 1 ms 384 KB correct
30 Correct 2 ms 512 KB correct
31 Correct 3 ms 512 KB correct
32 Correct 2 ms 512 KB correct
33 Correct 2 ms 512 KB correct
34 Runtime error 64 ms 5992 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB correct
2 Correct 0 ms 256 KB correct
3 Runtime error 24 ms 5100 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB correct
2 Correct 1 ms 256 KB correct
3 Correct 0 ms 256 KB correct
4 Correct 1 ms 256 KB correct
5 Correct 1 ms 256 KB correct
6 Correct 0 ms 256 KB correct
7 Correct 0 ms 256 KB correct
8 Correct 1 ms 256 KB correct
9 Correct 1 ms 256 KB correct
10 Correct 0 ms 256 KB correct
11 Correct 0 ms 256 KB correct
12 Correct 0 ms 256 KB correct
13 Correct 1 ms 256 KB correct
14 Correct 5 ms 640 KB correct
15 Correct 5 ms 768 KB correct
16 Correct 5 ms 640 KB correct
17 Correct 4 ms 512 KB correct
18 Correct 2 ms 384 KB correct
19 Correct 3 ms 556 KB correct
20 Correct 4 ms 512 KB correct
21 Correct 4 ms 540 KB correct
22 Correct 2 ms 512 KB correct
23 Correct 2 ms 512 KB correct
24 Correct 3 ms 508 KB correct
25 Correct 1 ms 384 KB correct
26 Correct 2 ms 512 KB correct
27 Correct 2 ms 512 KB correct
28 Correct 2 ms 384 KB correct
29 Correct 1 ms 384 KB correct
30 Correct 2 ms 512 KB correct
31 Correct 3 ms 512 KB correct
32 Correct 2 ms 512 KB correct
33 Correct 2 ms 512 KB correct
34 Runtime error 64 ms 5992 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -