Submission #887670

#	Time	Username	Problem	Language	Result	Execution time	Memory
887670		votranngocvy	Paths (BOI18_paths)	C++14	23 / 100	3053 ms	11172 KiB

paths

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

const int N = 3e5 + 5;
int n,m,k,ans,a[N];
bool vis[10];
vector<int>g[N];

void dfs(int u) {
    vis[a[u]] = true;
    for (auto v: g[u]) {
        if (vis[a[v]]) continue;
        ans++;
        dfs(v);
    }
    vis[a[u]] = false;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i]--;
    }
    for (int i = 1; i <= m; i++) {
        int u,v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for (int i = 1; i <= n; i++) dfs(i);
    cout << ans << "\n";
}

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