oj.uz

답안 #433796

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
433796 2021-06-20T10:55:15 Z AmineWeslati Love Polygon (BOI18_polygon) C++14
25 / 100
 302 ms 11020 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);}
//------------------------------------


int main(){
	int N; cin>>N;

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

	map<string,int>mp;
	int cnt=-1;
	vi nxt(N);
	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];
		nxt[u]=v;
	}

	int ans=0;
	vi vis(N,0);
	FOR(i,0,N) if(!vis[i]){
		int n=0,cur=i;
		while(!vis[cur]){
			n++;
			vis[cur]=1;
			cur=nxt[cur];
		}
		if(n!=2) ans+=(n+1)/2;
	}
	cout << ans << endl;
}

Subtask #1
0 / 21.0

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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 271 ms 8888 KB Output is correct
5 Correct 285 ms 10948 KB Output is correct
6 Correct 302 ms 11020 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 272 ms 8904 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

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