oj.uz

Submission #398094

# Submission time Handle Problem Language Result Execution time Memory
398094 2021-05-03T16:38:43 Z AmineWeslati Love Polygon (BOI18_polygon) C++14
21 / 100
 574 ms 13316 KB 
#include "bits/stdc++.h"
using namespace std; 

typedef long long ll;
typedef vector<int>vi;
#define pb push_back
#define sz(v) (int)v.size()
typedef string str;
#define FOR(i,a,b) for(int i=a; i<b; i++)

void IO(){
#ifdef LOCAL
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
#endif
}
//------------------------------------------------------//

void ckmin(int &x, int y){x=min(x,y);}

const int MX=2e5;
int N;
map<str,int>mp;
vi out(MX);

vi memo((1<<20),-1);

int solve(int m){
	if(m+1==(1<<N)) return 0;
	if(memo[m]!=-1) return memo[m];

	int ans=1e9;
	FOR(i,0,N) FOR(j,i+1,N) if(!((m>>i)&1) && !((m>>j)&1)){
		int nm=m;
		nm|=(1<<i);
		nm|=(1<<j);
		int c=(out[i]!=j)+(out[j]!=i);
		ckmin(ans,solve(nm)+c);
	}
	return memo[m]=ans;
}

int main(){
	IO();

	cin>>N;
	int cnt=0;
	FOR(i,0,N){
		str s,ss; cin>>s>>ss;
		if(!mp.count(s)) mp[s]=cnt++;
		if(!mp.count(ss)) mp[ss]=cnt++;

		out[mp[s]]=mp[ss];
	}
	if(N&1){
		cout << -1 << endl;
		return 0;
	}

	cout << solve(0) << endl;

	
	
	
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 537 ms 5196 KB Output is correct
2 Correct 502 ms 5176 KB Output is correct
3 Correct 527 ms 5196 KB Output is correct
4 Correct 4 ms 5196 KB Output is correct
5 Correct 4 ms 5196 KB Output is correct
6 Correct 3 ms 5196 KB Output is correct
7 Correct 574 ms 5196 KB Output is correct
8 Correct 503 ms 5196 KB Output is correct
9 Correct 537 ms 5192 KB Output is correct
10 Correct 556 ms 5196 KB Output is correct
11 Correct 516 ms 5196 KB Output is correct
12 Correct 4 ms 5196 KB Output is correct
13 Correct 4 ms 5196 KB Output is correct
14 Correct 4 ms 5196 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5196 KB Output is correct
2 Correct 3 ms 5196 KB Output is correct
3 Correct 3 ms 5196 KB Output is correct
4 Incorrect 273 ms 13316 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 284 ms 13252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 537 ms 5196 KB Output is correct
2 Correct 502 ms 5176 KB Output is correct
3 Correct 527 ms 5196 KB Output is correct
4 Correct 4 ms 5196 KB Output is correct
5 Correct 4 ms 5196 KB Output is correct
6 Correct 3 ms 5196 KB Output is correct
7 Correct 574 ms 5196 KB Output is correct
8 Correct 503 ms 5196 KB Output is correct
9 Correct 537 ms 5192 KB Output is correct
10 Correct 556 ms 5196 KB Output is correct
11 Correct 516 ms 5196 KB Output is correct
12 Correct 4 ms 5196 KB Output is correct
13 Correct 4 ms 5196 KB Output is correct
14 Correct 4 ms 5196 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 3 ms 5196 KB Output is correct
17 Correct 3 ms 5196 KB Output is correct
18 Correct 3 ms 5196 KB Output is correct
19 Incorrect 273 ms 13316 KB Output isn't correct
20 Halted 0 ms 0 KB -