제출 #125192

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
125192		Sorting	Simurgh (IOI17_simurgh)	C++14	0 / 100	2 ms	380 KiB

simurgh

#include <bits/stdc++.h>
#include "simurgh.h"

using namespace std;

//int count_common_roads(vector<int> &r);

const int N = 507;
const int M = N * (N - 1) / 2 + 1;

mt19937 mt;

int rnd(int mod){
	return mt() % mod;
}

struct edge{
	int from, to, idx;

	edge();
	edge(int from, int to, int idx){
		this->from = from;
		this->to = to;
		this->idx = idx;
	}
};

vector<int> adj[N];
vector<edge> ev;
int m, par[N], sz[N], r[N];
pair<int, int> pr[M];

void find_par(int u){
	if(u == par[u]){
		return;
	}

	find_par(par[u]);
	par[u] = par[par[u]];
}

bool unite(int u, int v){
	find_par(u);
	find_par(v);

	if(par[u] == par[v]){
		return false;
	}
	if(sz[par[u]] < sz[par[v]]){
		swap(u, v);
	}

	sz[par[u]] += sz[par[v]];
	par[par[v]] = par[u];

	return true;
}

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

	for(int i = 0; i < m; i++){
		//adj[ u[i] ].push_back(v[i]);
		//adj[ v[i] ].push_back(u[i]);
		ev.push_back(edge(u[i], v[i], i));
	}

	while(true){
		for(int i = 0; i < n; i++){
			par[i] = i;
			sz[i] = 1;
			pr[i].first = r[i];
			pr[i].second = i;
		}

		//sort(pr, pr + m);

		/*for(int i = 0; i < 3 * m; i++){
			int x = rnd(m);
			int y = rnd(m);

			swap(pr[x], pr[y]);
		}*/
		random_shuffle(pr, pr + m, rnd);
		vector<int> v;

		for(int i = 0; i < m; i++){
			edge e = ev[pr[i].second];

			if(unite(e.from, e.to)){
				while(pr[i].second != e.idx);

				v.push_back(e.idx);

				if(v.size() == n - 1){
					break;
				}
			}
		}

		int ans = count_common_roads(v);

		if(ans == n - 1){
			return v;
		}

		for(int x: v){
			r[x] += ans - (n / 2);
		}
	}
}

컴파일 시 표준 에러 (stderr) 메시지

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:95:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(v.size() == n - 1){
        ~~~~~~~~~^~~~~~~~

• Subtask 1: 0 / 13
• Subtask 2: 0 / 17
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30