제출 #864396

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
864396		iskhakkutbilim	Paths (BOI18_paths)	C++17	23 / 100	3075 ms	17752 KiB

paths

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 3e5;
int n, m, col[N+1];
int k;
vector<int> g[N+1];
int ans;

int used[N+10], used_c[N+10];
int timer = 1, closed;
void dfs(int v){
	used[v] = timer, used_c[col[v]] = timer;
	ans++;
	if(closed == k){
		used[v] = timer-1, used_c[col[v]] = timer-1, closed--;
		return;
	}
	for(int to : g[v]){
		if(used[to] !=timer && used_c[col[to]] != timer){
			closed++;
			dfs(to);
			closed--;
		}	
	}
	used[v] = timer-1, used_c[col[v]] = timer-1;
}

main(){
   ios::sync_with_stdio(0);
   cin.tie(0); cout.tie(0);
	cin >> n >> m >> k;
	for(int i = 1;i <= n; i++){
		cin >> col[i];
	}
	for(int i = 0;i < m; i++){
		int a, b; cin >> a >> b;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	
	
	for(int i = 1;i <= n; i++){
		closed = 1;
		dfs(i);
		ans--;
		timer++;
	}
	
	cout << ans;
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

paths.cpp:33:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   33 | main(){
      | ^~~~

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