Submission #973339

#	Time	Username	Problem	Language	Result	Execution time	Memory
973339		Circling	Šarenlist (COCI22_sarenlist)	C++17	110 / 110	38 ms	468 KiB

Main

/*The British Royal Family and a small cadre of English Fabian Socialists, in
conjunction with the Rockefellers and the Rothchilds, are engaged in a
conspiracy to greatly reduce the population of the human race in order to head
off a Malthusian catastrophe, a catastrophe that could easily be avoided by
simply building a massive amount of nuclear power plants and a number of massive
superhighways and bridges to connect all of the world's continents. But doing
that would cut into the conspiracy's profits. So the British Royal Family
invented environmentalism and neoliberalism in order to hide the truth. And in
order to further reduce the population, the British Royal Family is also the
world's foremost drug trafficking conspiracy. And it uses its control of the IMF
to push austerity in order to kill as many people in the global south as
possible.
And also Henry Kissinger is a gay KGB agent. */
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;


int64_t n, m, k, p[61], mod = 1000000007, a, b, edgebm[61], aanc, banc, powmod[60], ans = 0, coeff, grc, dsup[61], dsus[61];
vector<vector<int>> graph;
set<int> apath;


void dfs(int nd, int pr){
    p[nd] = pr;
    for (int i: graph[nd]) if (i != pr) dfs(i, nd);
}


int finddsup(int nd){
    if (dsup[nd] == nd) return nd;
    finddsup(dsup[nd]);
    dsup[nd] = dsup[dsup[nd]];
    return dsup[nd];
}


bool unite(int nda, int ndb){
    int pa = finddsup(nda);
    int pb = finddsup(ndb);
    if (pa == pb) return false;
    if (dsus[pa] > dsus[pb]) swap(pa, pb);
    dsup[pa] = pb;
    dsus[pb] += dsus[pa];
    return true;
}


int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    cin >> n >> m >> k;
    graph.resize(n + 1);
    for (int i = 1; i < n; i++){
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
        edgebm[i + 1] = 0;
    }
    dfs(1, 0);
    for (int i = 0; i < m; i++){
        cin >> a >> b;
        apath.clear();
        for (aanc = a; aanc != 0; aanc = p[aanc]) apath.insert(aanc);
        for (banc = b; apath.find(banc) == apath.end(); banc = p[banc]);
        for (; a != banc; a = p[a]) edgebm[a] += 1 << i;
        for (; b != banc; b = p[b]) edgebm[b] += 1 << i;
    }
    powmod[0] = 1;
    for (int i = 1; i < n; i++) powmod[i] = (powmod[i - 1] * k) % mod;
    for (int i = 0; i < (1 << m); i++){
        coeff = 1;
        for (int j = 0; j < m; j++) if (((i >> j) & 1) == 1) coeff *= -1;
        grc = n - 1;
        for (int j = 2; j <= n; j++){
            dsup[j] = j;
            dsus[j] = 1;
        }
        for (int e1 = 2; e1 <= n; e1++) for (int e2 = 2; e2 < e1; e2++) if (((edgebm[e1] & edgebm[e2] & i) > 0) && unite(e1, e2)) grc--;
        ans = (ans + coeff * powmod[grc] + mod) % mod;
    }
    cout << ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 65 / 65