oj.uz

Submission #372799

# Submission time Handle Problem Language Result Execution time Memory
372799 2021-03-01T18:12:56 Z BartolM Duathlon (APIO18_duathlon) C++17
31 / 100
 194 ms 26856 KB 
#include <bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;

const int INF=0x3f3f3f3f;
const int N=1e5+5;

int n, m, dtime=1;
ll sol=0;
int cnt[N], siz[N], P[N];
int dt[N], lw[N];
vector <int> ls[N], ls2[N], komp[N];
vector <pii> ed;
#define DEBUG 0

int name(int x) {
    if (x==P[x]) return x;
    P[x]=name(P[x]);
    return P[x];
}

void mrg(int a, int b) {
    a=name(a); b=name(b);
    if (a==b) return;
    P[a]=b;
    siz[b]+=siz[a];
}

void rek(int node, int par) {
    dt[node]=dtime++;
    lw[node]=dt[node];
    for (int sus:ls[node]) {
        if (sus==par) continue;
        if (dt[sus]==0) {
            rek(sus, node);
            lw[node]=min(lw[node], lw[sus]);
        }
        else { //backedge
            lw[node]=min(lw[node], dt[sus]);
        }
    }
    if (par && lw[node]==dt[node]) { //bridge
        ed.pb(mp(node, par));
        #if DEBUG
            printf("bridge %d -> %d\n", node, par);
        #endif
    }
    else if (par) {
        mrg(node, par);
        #if DEBUG
            printf("mrgam %d i %d\n", node, par);
        #endif
    }
}

void dfs(int node, int par) {
    cnt[node]=siz[node];
    for (int sus:ls2[node]) {
        if (sus==par) continue;
        dfs(sus, node);
        cnt[node]+=cnt[sus];
    }
}

void calc(int node, int par, int uk) {
    sol+=(ll)siz[node]*(siz[node]-1)*(siz[node]-2);
    int iz=uk-siz[node];
    for (int sus:ls2[node]) {
        if (sus==par) continue;
        calc(sus, node, uk);
        iz-=cnt[sus];
        sol+=(ll)cnt[sus]*(uk-cnt[sus]-siz[node])*siz[node];
        if (siz[node]>2) sol+=(ll)cnt[sus]*(siz[node]-1)*(siz[node]-1)*2;
    }

    for (int x:komp[node]) {
        int curr=0;
        for (int sus:ls[x]) {
            if (P[sus]==P[x]) continue;
            if (sus==par) curr+=iz;
            else curr+=cnt[sus];
        }
        for (int sus:ls[x]) {
            if (P[sus]==P[x]) continue;
            int br=iz;
            if (sus!=par) br=cnt[sus];
            sol-=(siz[node]-1)*br*(curr-br);
        }
    }

    sol+=(ll)iz*(uk-iz-siz[node])*siz[node];
    if (siz[node]>2) sol+=(ll)iz*(siz[node]-1)*(siz[node]-1)*2;
}

void solve() {
    for (int i=1; i<=n; ++i) P[i]=i, siz[i]=1;
    for (int i=1; i<=n; ++i) {
        if (dt[i]) continue;
        dtime=1;
        ed.clear();
        rek(i, 0);
        for (pii pp:ed) {
            ls2[name(pp.X)].pb(name(pp.Y));
            ls2[name(pp.Y)].pb(name(pp.X));
        }
    }
    for (int i=1; i<=n; ++i) komp[name(i)].pb(i);

    for (int i=1; i<=n; ++i) {
        sort(ls2[i].begin(), ls2[i].end());
        ls2[i].erase(unique(ls2[i].begin(), ls2[i].end()), ls2[i].end());

        #if DEBUG
            printf("node: %d, siz: %d, sus: ", i, siz[i]);
            for (int sus:ls2[i]) printf("%d ", sus);
            printf("\n");
        #endif // DEBUG
    }

    for (int i=1; i<=n; ++i) {
        if (cnt[i] || P[i]!=i) continue;
        dfs(i, 0);
        calc(i, 0, cnt[i]);
    }
    printf("%lld\n", sol);
}

void load() {
    scanf("%d %d", &n, &m);
    for (int i=0; i<m; ++i) {
        int a, b;
        scanf("%d %d", &a, &b);
        ls[a].pb(b); ls[b].pb(a);
    }
}

int main() {
    load();
    solve();
    return 0;
}

Compilation message

count_triplets.cpp: In function 'void load()':
count_triplets.cpp:139:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  139 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
count_triplets.cpp:142:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  142 |         scanf("%d %d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7404 KB Output is correct
3 Correct 6 ms 7404 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 5 ms 7404 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Incorrect 5 ms 7404 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7404 KB Output is correct
3 Correct 6 ms 7404 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 5 ms 7404 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Incorrect 5 ms 7404 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 23280 KB Output is correct
2 Correct 108 ms 23408 KB Output is correct
3 Correct 165 ms 22096 KB Output is correct
4 Correct 105 ms 22760 KB Output is correct
5 Correct 118 ms 19716 KB Output is correct
6 Correct 147 ms 21612 KB Output is correct
7 Correct 133 ms 19824 KB Output is correct
8 Correct 133 ms 20460 KB Output is correct
9 Correct 142 ms 18816 KB Output is correct
10 Correct 163 ms 18928 KB Output is correct
11 Correct 104 ms 17260 KB Output is correct
12 Correct 107 ms 17132 KB Output is correct
13 Correct 105 ms 17388 KB Output is correct
14 Correct 136 ms 17132 KB Output is correct
15 Correct 82 ms 17004 KB Output is correct
16 Correct 80 ms 16748 KB Output is correct
17 Correct 15 ms 12524 KB Output is correct
18 Correct 16 ms 12524 KB Output is correct
19 Correct 16 ms 12544 KB Output is correct
20 Correct 16 ms 12524 KB Output is correct
21 Correct 16 ms 12396 KB Output is correct
22 Correct 16 ms 12396 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7532 KB Output is correct
2 Correct 6 ms 7532 KB Output is correct
3 Correct 6 ms 7532 KB Output is correct
4 Correct 6 ms 7660 KB Output is correct
5 Correct 6 ms 7532 KB Output is correct
6 Correct 8 ms 7532 KB Output is correct
7 Correct 6 ms 7532 KB Output is correct
8 Correct 6 ms 7532 KB Output is correct
9 Correct 6 ms 7532 KB Output is correct
10 Correct 6 ms 7532 KB Output is correct
11 Correct 6 ms 7532 KB Output is correct
12 Correct 6 ms 7532 KB Output is correct
13 Correct 6 ms 7532 KB Output is correct
14 Correct 6 ms 7532 KB Output is correct
15 Correct 6 ms 7532 KB Output is correct
16 Correct 6 ms 7532 KB Output is correct
17 Correct 7 ms 7532 KB Output is correct
18 Correct 7 ms 7532 KB Output is correct
19 Correct 6 ms 7532 KB Output is correct
20 Correct 6 ms 7532 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 20964 KB Output is correct
2 Correct 153 ms 20964 KB Output is correct
3 Correct 177 ms 20960 KB Output is correct
4 Correct 137 ms 20984 KB Output is correct
5 Correct 136 ms 20964 KB Output is correct
6 Correct 194 ms 26856 KB Output is correct
7 Correct 189 ms 24808 KB Output is correct
8 Correct 152 ms 23656 KB Output is correct
9 Correct 169 ms 22884 KB Output is correct
10 Correct 150 ms 20712 KB Output is correct
11 Correct 151 ms 20832 KB Output is correct
12 Correct 162 ms 20456 KB Output is correct
13 Correct 163 ms 20456 KB Output is correct
14 Correct 138 ms 19980 KB Output is correct
15 Correct 137 ms 19692 KB Output is correct
16 Correct 83 ms 17772 KB Output is correct
17 Correct 89 ms 21600 KB Output is correct
18 Correct 94 ms 21596 KB Output is correct
19 Correct 94 ms 21592 KB Output is correct
20 Correct 109 ms 21600 KB Output is correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7532 KB Output is correct
2 Correct 6 ms 7532 KB Output is correct
3 Incorrect 6 ms 7532 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 20960 KB Output is correct
2 Correct 152 ms 20832 KB Output is correct
3 Incorrect 153 ms 18952 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7404 KB Output is correct
3 Correct 6 ms 7404 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 5 ms 7404 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Incorrect 5 ms 7404 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7404 KB Output is correct
3 Correct 6 ms 7404 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 5 ms 7404 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Incorrect 5 ms 7404 KB Output isn't correct
9 Halted 0 ms 0 KB -