Submission #716423

#	Time	Username	Problem	Language	Result	Execution time	Memory
716423		AranMaster	Paths (BOI18_paths)	C++17	23 / 100	3082 ms	6256 KiB

paths

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
vector <int> adj[maxn];
int n, k , m;
long long ans = 0;
int c[maxn] , cl[6] ,dive = 0;
bool mark[maxn];

void dfs(int v){
    if(dive == k)return;
    if(mark[v])return;
    dive++;
    mark[v] = 1;
    cl[c[v]]++;
    for(int u : adj[v])
        dfs(u);
    if(cl[1] <= 1 and cl[2] <= 1 and cl[3] <= 1 and cl[4] <= 1 and cl[5] <= 1 and dive > 1)
        ans++;
    mark[v] = 0;
    cl[c[v]]--;
    dive--;
}

int main(){
    cin >> n >> m >> k;
    for(int i = 0; i < n; i++)
        cin >> c[i + 1];
    for(int i = 0; i < m; i++){
        int a, b; cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    for(int i = 0; i < n; i++){
        dfs(i + 1);

    }
    cout << ans << endl;
}

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