oj.uz

답안 #433856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
433856 2021-06-20T11:31:41 Z AmineWeslati Love Polygon (BOI18_polygon) C++14
29 / 100
 366 ms 25920 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int>vi;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)

typedef string str; 

#define FOR(i,a,b) for(int i=a; i<b; i++)
#define ROF(i,a,b) for(int i=b-1; i>=a; i--)


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


const int MX=1e5+10;
int N; 
vi adj[MX];

int memo[MX][2];
int solve(int u, int st){
	int &ind=memo[u][st];
	if(ind!=-1) return ind; 

	int x=0;
	for(int v: adj[u]) x+=solve(v,1)+1;
	int ans=x; 
	if(st){
		for(int v: adj[u]){
			ckmin(ans,x-solve(v,1)-1+solve(v,0));
		}
	}
	return ind=ans; 


}

int main(){
	cin>>N;

	if(N&1){
		cout << -1 << endl;
		return 0;
	}

	map<string,int>mp;
	int cnt=-1;
	vi nxt(N),root(N,0);
	FOR(i,0,N){
		str s,t; cin>>s>>t;
		if(!mp.count(s)) mp[s]=++cnt; 
		if(!mp.count(t)) mp[t]=++cnt; 
	
		int u=mp[s],v=mp[t];
		if(u!=v){
			adj[v].pb(u);
		}
		else root[u]=1;
	}

	memset(memo,-1,sizeof(memo));
	int ans=0;
	FOR(i,0,N) if(root[i]) ans+=solve(i,1)+1;
	cout << ans << endl;
}

Subtask #1
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 3 ms 3404 KB Output is correct
3 Correct 3 ms 3404 KB Output is correct
4 Incorrect 3 ms 3404 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Incorrect 3 ms 3404 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 327 ms 14444 KB Output is correct
2 Correct 322 ms 18900 KB Output is correct
3 Correct 248 ms 14112 KB Output is correct
4 Correct 2 ms 2664 KB Output is correct
5 Correct 366 ms 25920 KB Output is correct
6 Correct 312 ms 15812 KB Output is correct
7 Correct 334 ms 15752 KB Output is correct
8 Correct 287 ms 15328 KB Output is correct
9 Correct 346 ms 15324 KB Output is correct
10 Correct 261 ms 14508 KB Output is correct
11 Correct 2 ms 3404 KB Output is correct
12 Correct 2 ms 3404 KB Output is correct
13 Correct 2 ms 3404 KB Output is correct
14 Correct 3 ms 3404 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 3 ms 3404 KB Output is correct
3 Correct 3 ms 3404 KB Output is correct
4 Incorrect 3 ms 3404 KB Output isn't correct
5 Halted 0 ms 0 KB -