oj.uz

답안 #876626

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
876626 2023-11-22T06:19:56 Z serifefedartar Love Polygon (BOI18_polygon) C++17
0 / 100
 240 ms 15896 KB 
#include <bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 998244353;
const ll LOGN = 21;
const ll MAXN = 2e5 + 100;

vector<vector<int>> graph;
map<string, int> mp;
int last = 0;

int main() {
	fast
	int n;
	cin >> n;

	graph = vector<vector<int>>(n+1, vector<int>());
	for (int i = 0; i < n; i++) {
		string x, y;
		cin >> x >> y;
		mp[x] = mp[x] ? mp[x] : last++;
		mp[y] = mp[y] ? mp[y] : last++;
		graph[mp[x]].push_back(mp[y]);
		graph[mp[y]].push_back(mp[x]);
	}

	if (n % 2)
		cout << "-1\n";
	else
		cout << n / 2 << "\n";
}

Subtask #1
0 / 21.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 29.0

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

Subtask #4
0 / 25.0

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