oj.uz

답안 #103463

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
103463 2019-03-30T19:03:57 Z figter001 Simurgh (IOI17_simurgh) C++17
0 / 100
 3 ms 384 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],in[nax];
int m;
bool used[nax];
vector<pair<int,int>> g[nax];

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

vector<int> find_roads(int n, vector<int> u, vector<int> v) {
	vector<int> ans;
	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);
		in[a]++;
		in[b]++;
		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];
		if(in[a] != 1){
			for(pair<int,int> cur : g[b]){
				if(used[cur.second] == 1)
					continue;
				ans[i] = cur.second;
				int r = count_common_roads(ans);
				if(r < lst){
					ans[i] = id;
					break;
				}
				if(r > lst){
					lst = r;
					in[a]--;
					in[cur.first]++;
					used[cur.second] = 1;
					used[id] = 0;
					break;
				}
				ans[i] = id;
			}
		}
		if(in[b] != 1){
			for(pair<int,int> cur : g[a]){
				if(used[cur.second] == 1)
					continue;
				ans[i] = cur.second;
				int r = count_common_roads(ans);
				if(r < lst){
					ans[i] = id;
					break;
				}
				if(r > lst){
					lst = r;
					in[b]--;
					in[cur.first]++;
					used[cur.second] = 1;
					used[id] = 0;
					break;
				}
				ans[i] = id;
			}
		}
	}
	// for(int i : ans)
	// 	printf("%d ", i);
	// printf("\n");
	return ans;
}

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:42:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<ans.size();i++){
              ~^~~~~~~~~~~

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 384 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 384 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 384 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB correct
2 Incorrect 2 ms 256 KB WA in grader: NO
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 384 KB WA in grader: NO
2 Halted 0 ms 0 KB -