제출 #863333

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
863333		maks007	Paths (BOI18_paths)	C++14	23 / 100	3055 ms	7792 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], used(n);
	set <int> colorUsed;
	function <void(int)> dfs=[&](int v) {
		//if(colorUsed.size() > 1)
			ans ++;
		used[v] = 1;
		colorUsed.insert(color[v]);
		for(auto u : g[v] ) {
			if(!used[u] && colorUsed.count(color[u]) == 0) dfs(u);
		}
		used[v]=0;
		colorUsed.erase(color[v]);
	};
	
	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);
	}
	//cout << "\n";
	/*for(int firstColor = 1; firstColor <= k; firstColor ++) {
		for(int i = 0; i < n; i ++) {
			if(color[i] == firstColor) {
				assert(colorUsed.size() == 0);
				//cout << i << " " << color[i] << "\n";
				assert(count(used.begin(), used.end(), 1) == 0);
				dfs(i);
				for(int j = 0; j < used.size(); j ++) used[j]=0;
				//colorUsed.clear();
			}
		}
	}
	cout << ans;*/
	for(int i = 0; i < n; i ++) {
		dfs(i);
	}
	cout << ans - n;
	return 0;
}

• Subtask 1: 23 / 23
• Subtask 2: 0 / 20
• Subtask 3: 0 / 27
• Subtask 4: 0 / 30