oj.uz

Submission #862823

# Submission time Handle Problem Language Result Execution time Memory
862823 2023-10-19T05:06:21 Z maks007 Love Polygon (BOI18_polygon) C++14
0 / 100
 2000 ms 13004 KB 
//Bismi Allah
#include "bits/stdc++.h"

using namespace std;

signed main () {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, ans = 1e9;
	cin >> n;
	vector <int> who(n, -1), used(n, 0);
	map <string,int> mp;
	function<void(int,int)> f=[&](int numUsed, int cnt) {
		if(numUsed == n) {
			ans = min(ans, cnt);
			return;
		}
		for(int i = 0; i < n; i ++) {
			if(used[i] == 1) continue;
			for(int j = i + 1; j < n; j ++) {
				if(used[j] == 1) continue;
				int newcnt = cnt;
				if(who[i] != j) newcnt ++;
				if(who[j] != i) newcnt ++;
				used[i] = 1;
				used[j] = 1;
				f(numUsed + 2, newcnt); 
				used[i] = 0;
				used[j] = 0;
			}
		}
	};
	int cnt = 0;
	for(int i = 0; i < n; i ++) {
		string u, v;
		cin >> u >> v;
		if(mp.count(u) == 0) mp[u] = mp.size();
		if(mp.count(v) == 0) mp[v] = mp.size();
		if(mp[u] == mp[v]) cnt ++;
		who[mp[u]] = mp[v];
	}
	if(n % 2 == 1) {
		cout << "-1";
		return 0;
	}
	int usedbefore = 0;
	for(int i = 0; i < n; i ++) {
		for(int j = i + 1; j < n; j ++) {
			if(who[i] == j && who[j] == i) {
				used[i] = 1;
				used[j] = 1;
				usedbefore += 2;
			}
		}
	}
	f(usedbefore,0);
	cout << ans;
	return 0;
}

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2067 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 708 KB Output is correct
4 Execution timed out 2059 ms 13004 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2044 ms 12944 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2067 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -