oj.uz

Submission #952429

# Submission time Handle Problem Language Result Execution time Memory
952429 2024-03-23T21:13:34 Z Itamar Duathlon (APIO18_duathlon) C++14
31 / 100
 111 ms 20540 KB 
#include <iostream>
using namespace std;
#include <vector>
#define vi vector<int>
#define ll long long
#include <algorithm>
#include <set>
#include <string>
#include <bitset>
#include <cmath>
#include <math.h>
#define pll pair<ll,ll>
#define vll vector<ll>
#define pi pair<int,int>
#include <map>
#include <queue>
#define pd pair<double,double>
#include <stack>

const int siz = 1e5 + 1;
int c[siz];
vi fr[siz];
bool vis[siz];
int pad[siz];
vi frt[siz];
ll w[siz];
int sor[siz];
int cum[siz];
void dfs(int i, int so) {
    if (vis[i])return;
    sor[i] = so;
    cum[so]++;
    vis[i] = 1;
    for (int f : fr[i]) {
        if (!vis[f]) {
            pad[f] = i;
            dfs(f,so);
        }
        else if ((f != pad[i]) && (c[i]==i)&&(c[f]==f)) {
            int k = pad[i];
            while (k != f) {
                w[i]++;
                c[k] = i;
                k = pad[k];
            }
            w[i]++;
            c[k] = i;
        }
    }
}
ll ans = 0;
int n, m;
bool vist[siz];
int dfst(int i, int t) {
    if (vist[i])return 0;
    vist[i] = 1;
    vll v;
    int sum = w[i];
    for (int f : frt[i]) {
        if (!vist[f]) {
            v.push_back(dfst(f,t));
            sum += v.back();
        }
    }
    v.push_back(t - sum);
    ans += (w[i] * (t - 1)) * (t - 2);
    for (ll k : v) {
        ans -= w[i] * k * (k - 1);
        ans -= k * 2 * (w[i] - 1);
    }
    return sum;
}
int main()
{
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        fr[a].push_back(b);
        fr[b].push_back(a);
    }
    for (int i = 0; i < n; i++) {
        w[i] = 1;
        c[i] = i;
    }
    for (int i = 0; i < n; i++) {
        if (!vis[i]) {
            pad[i] = i;
            dfs(i,i);
        }
    }
    for (int i = 0; i < n; i++) {
        for (int f : fr[i]) {
            if (c[i] != c[f]) {
                frt[c[i]].push_back(c[f]);
            }
        }
    }
    for(int i = 0; i < n; i++)if(!vist[c[i]])dfst(c[i],cum[sor[i]]);
    cout << ans;
}
/*
4 3
1 2
2 3
3 4
*/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7004 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7004 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 16792 KB Output is correct
2 Correct 63 ms 16824 KB Output is correct
3 Correct 81 ms 17408 KB Output is correct
4 Correct 67 ms 15952 KB Output is correct
5 Correct 79 ms 15256 KB Output is correct
6 Correct 71 ms 16468 KB Output is correct
7 Correct 76 ms 14996 KB Output is correct
8 Correct 71 ms 15184 KB Output is correct
9 Correct 71 ms 13828 KB Output is correct
10 Correct 70 ms 13908 KB Output is correct
11 Correct 63 ms 12324 KB Output is correct
12 Correct 58 ms 12116 KB Output is correct
13 Correct 52 ms 12372 KB Output is correct
14 Correct 52 ms 12112 KB Output is correct
15 Correct 42 ms 11856 KB Output is correct
16 Correct 52 ms 11604 KB Output is correct
17 Correct 4 ms 7516 KB Output is correct
18 Correct 4 ms 7516 KB Output is correct
19 Correct 4 ms 7512 KB Output is correct
20 Correct 5 ms 7512 KB Output is correct
21 Correct 4 ms 7516 KB Output is correct
22 Correct 5 ms 7516 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 13960 KB Output is correct
2 Correct 74 ms 14052 KB Output is correct
3 Correct 79 ms 13812 KB Output is correct
4 Correct 89 ms 14160 KB Output is correct
5 Correct 76 ms 13868 KB Output is correct
6 Correct 111 ms 20540 KB Output is correct
7 Correct 79 ms 18516 KB Output is correct
8 Correct 79 ms 17236 KB Output is correct
9 Correct 77 ms 16112 KB Output is correct
10 Correct 73 ms 14008 KB Output is correct
11 Correct 73 ms 13912 KB Output is correct
12 Correct 73 ms 13904 KB Output is correct
13 Correct 82 ms 13876 KB Output is correct
14 Correct 105 ms 14204 KB Output is correct
15 Correct 65 ms 13648 KB Output is correct
16 Correct 40 ms 12380 KB Output is correct
17 Correct 63 ms 15572 KB Output is correct
18 Correct 63 ms 15608 KB Output is correct
19 Correct 61 ms 15560 KB Output is correct
20 Correct 63 ms 15276 KB Output is correct

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 13820 KB Output is correct
2 Correct 74 ms 13908 KB Output is correct
3 Incorrect 106 ms 12696 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7004 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7004 KB Output isn't correct
2 Halted 0 ms 0 KB -