oj.uz

답안 #863420

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
863420 2023-10-20T08:05:58 Z maks007 Paths (BOI18_paths) C++14
20 / 100
 143 ms 25172 KB 
// Bismi Allah
#include "bits/stdc++.h"

using namespace std;

#define int long long

signed main () {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, m, k, ans = 0;
	cin >> n >> m >> k;
	vector <int> color(n), g[n];
	for(int i = 0; i < n; i ++) cin >> color[i];
	for(int i = 0; i < m; i ++) {
		int u, v;
		cin >> u >> v;
		u --, v --;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	for(int i = 0; i < n; i ++) {
		for(auto u : g[i]) {
			if(color[i] != color[u]) ans ++;
		}
		int color1 = 0, color2 = 0, forOne = -1;
		for(auto u : g[i]) {
			if(color[u] == color[i]) continue;
			if(forOne == -1) {
				forOne = color[u];
				color1 ++;
			}else {
				if(forOne == color[u]) color1 ++;
				else color2 ++;
			}
		}
		ans += 2 * color1 * color2;
	}
	cout << ans;
	return 0;
}

Subtask #1
0 / 23.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 7764 KB Output is correct
2 Correct 38 ms 7516 KB Output is correct
3 Correct 135 ms 20112 KB Output is correct
4 Correct 66 ms 9300 KB Output is correct
5 Correct 58 ms 9296 KB Output is correct
6 Correct 98 ms 15328 KB Output is correct
7 Correct 143 ms 24968 KB Output is correct
8 Correct 114 ms 25172 KB Output is correct

Subtask #3
0 / 27.0

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

Subtask #4
0 / 30.0

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