Submission #864396

#TimeUsernameProblemLanguageResultExecution timeMemory
864396iskhakkutbilimPaths (BOI18_paths)C++17
23 / 100
3075 ms17752 KiB
#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; }

Compilation message (stderr)

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