Submission #651126

#	Time	Username	Problem	Language	Result	Execution time	Memory
651126		dooompy	Paths (BOI18_paths)	C++17	23 / 100	3092 ms	774556 KiB

paths

#include "bits/stdc++.h"

using namespace std;

void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.first >> a.second;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.first << ", " << a.second << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}

#ifdef local
#define test(args...) abc("[" + string(#args) + "]", args)
#else
#define test(args...) void(0)
#endif

using ll = long long;

int col[300005];
vector<int> adj[300005];
multiset<set<int>> cur[300005][6];

ll total = 0;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
//    freopen("", "r", stdin);
//    freopen("", "w", stdout);
    int n, m, k; cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
        cin >> col[i];
        cur[i][1].insert({col[i]});
    }

    for (int i = 1; i <= m; i++) {
        int a, b; cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    for (int len = 2; len <= k; len++) {
        for (int i = 1; i <= n; i++) {
            int curcol = col[i];
            for (auto nxt : adj[i]) {
                for (auto st : cur[nxt][len - 1]) {
                    if (st.count(curcol) == 0) {
                        set<int> tmp = st;
                        tmp.insert(curcol);
                        cur[i][len].insert(tmp);
                        total++;
                    }
                }
            }

        }
    }

    cout << total;
}

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