oj.uz

답안 #658405

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658405 2022-11-13T05:42:10 Z Foxyy Logičari (COCI21_logicari) C++17
10 / 110
 41 ms 6036 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define Foxyy cin.tie(0); cout.sync_with_stdio(0); cout.tie(0);

struct Solver {
	int& n;
	vector<vector<int>>& adj;
	
	void solve() {
		if (n % 4 != 0) {
			cout << "-1\n";
			return;
		}
		cout << n/2 << '\n';
	}
};

signed main() {
	Foxyy
	
	int T = 1;
//	cin >> T;
	while(T--) {
		int n;
		cin >> n;
		vector<vector<int>> adj(n);
		for (int i = 0; i < n; i++) {
			int a, b;
			cin >> a >> b;
			a--, b--;
			adj[a].push_back(b);
			adj[b].push_back(a);
		}
		
		Solver solver{n, adj};
		solver.solve();
	}
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 37 ms 6032 KB Output is correct
6 Correct 41 ms 6036 KB Output is correct
7 Correct 37 ms 5928 KB Output is correct
8 Correct 40 ms 5928 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 40.0

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

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 37 ms 6032 KB Output is correct
6 Correct 41 ms 6036 KB Output is correct
7 Correct 37 ms 5928 KB Output is correct
8 Correct 40 ms 5928 KB Output is correct
9 Incorrect 1 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -