Submission #1150248

#	Time	Username	Problem	Language	Result	Execution time	Memory
1150248		arafatenok	Paths (BOI18_paths)	C++20	23 / 100	2697 ms	1114112 KiB

paths

#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization("unroll-loops")
// #pragma ("reroll")
#define skip continue;
#define gold ios_base::sync_with_stdio(false);cin.tie(NULL);
#define xa "\n"
#define int long long
#define all(a) a.begin(), a.end()
#define pb push_back
#define F first
#define S second
using namespace std;

const int mod = 1e9 + 7;
const int N = 1e6 + 7;
const int MAX = 1e9;
const int inf = 1e18;

int gcd(int a, int b) { if (b == 0) return a; else if(a == 0) return b; else return gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }

int n, m, k;
int a[N];
vector < int > g[N];
vector < int > ans;
map < vector < int >, int > mp;
vector < vector < int > > vec;

void dfs(int v, int p, int cnt){
    ans.pb(v);
    if(mp[ans] == 0) {
        mp[ans]++;
        vec.pb(ans);
    }
    if(cnt == k){
        return;
    }
    for(int to : g[v]){
        if(to == p){
            skip;
        }
        dfs(to, v, cnt + 1);
        ans.pop_back();
    }
}

void solve() {
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    for(int i = 1; i <= m; i++){
        int u, v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }
    for(int i = 1; i <= n; i++){
        dfs(i, i, 1);
        ans.clear();
    }
    int otvet = 0;
    for(auto x : vec){
        if(x.size() == 1) skip;
        set < int > check;
        for(int to : x){
            check.insert(a[to]);
        }
        if(check.size() == x.size()) otvet++;
    }
    cout << otvet;
}

signed main() {
    gold;
    //freopen("rmq.in", "r", stdin);
    //freopen("rmq.out", "w", stdout);
    int t = 1;
    int ti = 1;
    //cin >> t;
    while (t--) {
        //cout << "Case " << ti << ": ";
        solve();
        ti++;
    }
}

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