제출 #863420

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
863420		maks007	Paths (BOI18_paths)	C++14	20 / 100	143 ms	25172 KiB

paths

// 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
• Subtask 2: 20 / 20
• Subtask 3: 0 / 27
• Subtask 4: 0 / 30