oj.uz

Submission #974434

# Submission time Handle Problem Language Result Execution time Memory
974434 2024-05-03T10:30:12 Z vjudge1 Duathlon (APIO18_duathlon) C++17
66 / 100
 221 ms 38484 KB 
#include <bits/stdc++.h>

#define int long long int
#define lli int
#define ld long double
#define pb push_back
#define MP make_pair
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

const int N = 2e5 + 5;
const int INF = 1e9 + 500;
int n, m;
vector<vector<array<int, 2> > > adj(N, vector<array<int, 2> >());
int tim = 0;
vector<int> tin(N, -1), low(N, 0);
vector<array<int, 2> > edg(N);
vector<bool> isBr(N, 0);
vector<int> comp(N, -1), cmpsz(N, 0);
vector<vector<int> > cadj(N, vector<int>());
vector<int> subsz(N, 0);
vector<int> rt;
vector<int> vis(N, 0);
lli ans = 0;
void find_bridge(int node, int par) {
    tin[node] = low[node] = tim++;
    for(auto c : adj[node]) {
        if(c[0] == par) {
            continue;
        }
        if(tin[c[0]] != -1) {
            low[node] = min(low[node], tin[c[0]]);
        }
        else {
            find_bridge(c[0], node);
            low[node] = min(low[node], low[c[0]]);
            // cout << "c[1]:"  << c[1] << " node:" << node << " lowc0:" << low[c[0]] << " tin[node]:" << tin[node] << "\n";
            if(low[c[0]] > tin[node]) {
                //bridge
                isBr[c[1]] = 1;
            }
        }
    }
}

void get_comp(int node, int cm) {
    comp[node] = cm;
    cmpsz[cm]++;
    for(auto c : adj[node]) {
        if(comp[c[0]] != -1 || isBr[c[1]]) continue;
        get_comp(c[0], cm);
    }
}

void prec(int node, int par) {
    subsz[node] = cmpsz[node];
    for(auto c : cadj[node]) {
        if(c == par) continue;
        prec(c, node);
        subsz[node] += subsz[c];
    }
}

void dfs(int node, int par, int root) {
    // cout << "node:" << node << "\n";
    lli ret = 0;
    lli x = subsz[root] - cmpsz[node];
    for(auto c : cadj[node]) {
        if(c == par) {
            int sbt = subsz[root] - subsz[node];
            ret += 1ll * cmpsz[node] * sbt * (x - sbt); 
            continue;
        }
        int sbt = subsz[c];
        ret += 1ll * cmpsz[node] * sbt * (x - sbt);
        dfs(c, node, root);
    }
    // cout << "node: " << node << " ret:" << ret << "\n";
    ans += ret;
}

void dfs2(int node, int par, int root) {
    // cout << "node:" << node << "\n";
    int conn = 0;
    vis[node] = 1;
    for(auto c : adj[node]) {
        if(!isBr[c[1]]) {
            if(vis[c[0]]) continue;
            dfs2(c[0], node, root);
            continue;
        }
        if(c[0] == par) {
            conn += subsz[root] - subsz[comp[node]];
            continue;
        }    
        conn += subsz[comp[c[0]]];
        dfs2(c[0], node, root);
    }
    
    // cout << "node:" << node << "conn: " << conn << "\n";
    // cout << "add : " << 2ll * (cmpsz[comp[node]] - 1) * (subsz[root] - conn - cmpsz[comp[node]]) << "\n";

    for(auto c : adj[node]) {
        if(!isBr[c[1]]) continue;
        int sbt;
        if(c[0] == par) {
            sbt = subsz[root] - subsz[comp[node]];
        }
        else {
            sbt = subsz[comp[c[0]]];
        }
        ans -= 1ll * (cmpsz[comp[node]] - 1) * sbt * (conn - sbt);
    }
    if(cmpsz[comp[node]] < 2) return;
    ans += 2ll * (cmpsz[comp[node]] - 1) * (subsz[root] - conn - cmpsz[comp[node]]);
}

void solve() {
    cin >> n >> m;
    REP(i, m) {
        int u, v;
        cin >> u >> v;
        edg[i] = {u, v};
        adj[u].pb({v, i});
        adj[v].pb({u, i});
    }    
    for(int i = 1; i <= n; i++) {
        if(tin[i] != -1) continue;
        rt.pb(i);
        find_bridge(i, 0);
    }
    int cur = 1;
    for(int i = 1; i <= n; i++) {
        if(comp[i] == -1) {
            get_comp(i, cur++);
        }
        // cout << "i:" << i << " comp:" << comp[i] << "\n";
    }
    for(int i = 0; i < m; i++) {
        if(isBr[i]) {
            // cout << edg[i][0] << " " << edg[i][1] << endl;
            cadj[comp[edg[i][0]]].pb(comp[edg[i][1]]);
            cadj[comp[edg[i][1]]].pb(comp[edg[i][0]]);
        }
    }
    for(auto c : rt) {
        prec(comp[c], 0);
    }
    for(int i = 1; i < cur; i++) {
        ans += 1ll * cmpsz[i] * (cmpsz[i] - 1) * (cmpsz[i] - 2);
    }
    // cout << "ans: " << ans << "\n";
    for(int c : rt) {
        dfs(comp[c], 0, comp[c]);
    }
    // cout << "ans:" << ans << "\n";
    for(int c : rt) {
        dfs2(c, 0, comp[c]);
    }

    cout << ans << "\n";
}


signed main() {
    fastio();
    solve();
} //

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 22364 KB Output is correct
2 Correct 9 ms 22364 KB Output is correct
3 Correct 11 ms 22364 KB Output is correct
4 Correct 10 ms 22364 KB Output is correct
5 Correct 11 ms 22304 KB Output is correct
6 Correct 12 ms 22360 KB Output is correct
7 Correct 9 ms 22364 KB Output is correct
8 Incorrect 11 ms 22364 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 167 ms 38480 KB Output is correct
2 Correct 68 ms 38484 KB Output is correct
3 Correct 105 ms 34340 KB Output is correct
4 Correct 106 ms 36176 KB Output is correct
5 Correct 136 ms 32020 KB Output is correct
6 Correct 89 ms 32540 KB Output is correct
7 Correct 85 ms 31240 KB Output is correct
8 Correct 201 ms 32340 KB Output is correct
9 Correct 78 ms 30260 KB Output is correct
10 Correct 75 ms 30872 KB Output is correct
11 Correct 155 ms 28344 KB Output is correct
12 Correct 61 ms 28368 KB Output is correct
13 Correct 60 ms 28152 KB Output is correct
14 Correct 88 ms 28112 KB Output is correct
15 Correct 76 ms 27596 KB Output is correct
16 Correct 84 ms 27340 KB Output is correct
17 Correct 13 ms 23504 KB Output is correct
18 Correct 13 ms 23508 KB Output is correct
19 Correct 11 ms 23508 KB Output is correct
20 Correct 17 ms 23508 KB Output is correct
21 Correct 11 ms 23504 KB Output is correct
22 Correct 12 ms 23508 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 31184 KB Output is correct
2 Correct 75 ms 31060 KB Output is correct
3 Correct 143 ms 31372 KB Output is correct
4 Correct 79 ms 31192 KB Output is correct
5 Correct 81 ms 31060 KB Output is correct
6 Correct 120 ms 36432 KB Output is correct
7 Correct 221 ms 35056 KB Output is correct
8 Correct 102 ms 34040 KB Output is correct
9 Correct 97 ms 33068 KB Output is correct
10 Correct 111 ms 31252 KB Output is correct
11 Correct 180 ms 31056 KB Output is correct
12 Correct 121 ms 31224 KB Output is correct
13 Correct 99 ms 31060 KB Output is correct
14 Correct 89 ms 30696 KB Output is correct
15 Correct 79 ms 29908 KB Output is correct
16 Correct 46 ms 27860 KB Output is correct
17 Correct 78 ms 30916 KB Output is correct
18 Correct 58 ms 30996 KB Output is correct
19 Correct 102 ms 31756 KB Output is correct
20 Correct 61 ms 31100 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 22364 KB Output is correct
2 Correct 9 ms 22364 KB Output is correct
3 Correct 11 ms 22372 KB Output is correct
4 Correct 11 ms 22364 KB Output is correct
5 Correct 11 ms 22364 KB Output is correct
6 Correct 11 ms 22364 KB Output is correct
7 Correct 10 ms 22364 KB Output is correct
8 Correct 10 ms 22364 KB Output is correct
9 Correct 9 ms 22364 KB Output is correct
10 Correct 9 ms 22308 KB Output is correct
11 Correct 10 ms 22360 KB Output is correct
12 Correct 9 ms 22364 KB Output is correct
13 Correct 10 ms 22364 KB Output is correct
14 Correct 13 ms 22360 KB Output is correct
15 Correct 9 ms 22364 KB Output is correct
16 Correct 10 ms 22364 KB Output is correct
17 Correct 11 ms 22364 KB Output is correct
18 Correct 11 ms 22364 KB Output is correct
19 Correct 10 ms 22460 KB Output is correct
20 Correct 10 ms 22364 KB Output is correct
21 Correct 9 ms 22364 KB Output is correct
22 Correct 11 ms 22364 KB Output is correct
23 Correct 10 ms 22276 KB Output is correct
24 Correct 10 ms 22364 KB Output is correct
25 Correct 10 ms 22364 KB Output is correct
26 Correct 10 ms 22360 KB Output is correct
27 Correct 13 ms 22364 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 31148 KB Output is correct
2 Correct 162 ms 30848 KB Output is correct
3 Correct 86 ms 30544 KB Output is correct
4 Correct 75 ms 29664 KB Output is correct
5 Correct 73 ms 28752 KB Output is correct
6 Correct 62 ms 28500 KB Output is correct
7 Correct 65 ms 28124 KB Output is correct
8 Correct 164 ms 28028 KB Output is correct
9 Correct 58 ms 27740 KB Output is correct
10 Correct 66 ms 27732 KB Output is correct
11 Correct 101 ms 27856 KB Output is correct
12 Correct 65 ms 27728 KB Output is correct
13 Correct 67 ms 28052 KB Output is correct
14 Correct 60 ms 30424 KB Output is correct
15 Correct 198 ms 34944 KB Output is correct
16 Correct 155 ms 33620 KB Output is correct
17 Correct 90 ms 34096 KB Output is correct
18 Correct 110 ms 32916 KB Output is correct
19 Correct 128 ms 29776 KB Output is correct
20 Correct 74 ms 29664 KB Output is correct
21 Correct 74 ms 29776 KB Output is correct
22 Correct 70 ms 29264 KB Output is correct
23 Correct 70 ms 28580 KB Output is correct
24 Correct 95 ms 30272 KB Output is correct
25 Correct 80 ms 30584 KB Output is correct
26 Correct 118 ms 30048 KB Output is correct
27 Correct 90 ms 30068 KB Output is correct

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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