Submission #125216

#	Time	Username	Problem	Language	Result	Execution time	Memory
125216		Sorting	Simurgh (IOI17_simurgh)	C++14	0 / 100	3043 ms	376 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, score;
 
	edge();
	edge(int from, int to, int idx){
		this->from = from;
		this->to = to;
		this->idx = idx;
		score = 0;
	}
};

bool cmp(edge lvalue, edge rvalue){
	return lvalue.score > rvalue.score;
}
 
vector<int> adj[N];
vector<edge> ev;
int m, par[N], sz[N], r[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));
	}
 
	for(int j = 0; j < 30000; j++){
		for(int i = 0; i < n; i++){
			par[i] = i;
			sz[i] = 1;
		}
		for(int i = 0; i < m; i++){
			ev[i].score = r[ev[i].idx];
		}
 
		if(j % 10){
			random_shuffle(ev.begin(), ev.end(), rnd);
		}
		else{
			sort(ev.begin(), ev.end(), cmp);
		}
		vector<int> v;
 
		for(edge e: ev){
			if(unite(e.from, e.to)){
				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;
		}
	}

	while(true);
}

Compilation message (stderr)

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:93: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