oj.uz

Submission #952432

# Submission time Handle Problem Language Result Execution time Memory
952432 2024-03-23T21:15:49 Z Itamar Duathlon (APIO18_duathlon) C++14
31 / 100
 94 ms 20560 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) {
                c[k] = i;
                k = pad[k];
            }
            c[k] = i;
        }
    }
}
ll ans = 0;
int n, m;
bool vist[siz];
int dfst(int i, int t) {
    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++) {
        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++)w[c[i]]++;
    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 7000 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 7000 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 59 ms 16720 KB Output is correct
2 Correct 62 ms 16724 KB Output is correct
3 Correct 68 ms 17460 KB Output is correct
4 Correct 62 ms 15952 KB Output is correct
5 Correct 71 ms 14896 KB Output is correct
6 Correct 68 ms 16464 KB Output is correct
7 Correct 69 ms 14852 KB Output is correct
8 Correct 69 ms 15188 KB Output is correct
9 Correct 69 ms 13804 KB Output is correct
10 Correct 67 ms 13908 KB Output is correct
11 Correct 57 ms 12368 KB Output is correct
12 Correct 55 ms 12108 KB Output is correct
13 Correct 58 ms 12288 KB Output is correct
14 Correct 51 ms 12116 KB Output is correct
15 Correct 46 ms 11932 KB Output is correct
16 Correct 40 ms 11612 KB Output is correct
17 Correct 5 ms 7516 KB Output is correct
18 Correct 5 ms 7516 KB Output is correct
19 Correct 5 ms 7516 KB Output is correct
20 Correct 4 ms 7692 KB Output is correct
21 Correct 4 ms 7512 KB Output is correct
22 Correct 4 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 7004 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 2 ms 7004 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 7064 KB Output is correct
11 Correct 2 ms 7004 KB Output is correct
12 Correct 2 ms 7004 KB Output is correct
13 Correct 3 ms 7000 KB Output is correct
14 Correct 2 ms 7000 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 7000 KB Output is correct
19 Correct 2 ms 7004 KB Output is correct
20 Correct 2 ms 7000 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 13908 KB Output is correct
2 Correct 74 ms 14060 KB Output is correct
3 Correct 71 ms 13904 KB Output is correct
4 Correct 73 ms 13816 KB Output is correct
5 Correct 94 ms 14300 KB Output is correct
6 Correct 79 ms 20560 KB Output is correct
7 Correct 80 ms 18516 KB Output is correct
8 Correct 76 ms 17400 KB Output is correct
9 Correct 76 ms 16212 KB Output is correct
10 Correct 81 ms 13868 KB Output is correct
11 Correct 73 ms 14056 KB Output is correct
12 Correct 71 ms 13832 KB Output is correct
13 Correct 74 ms 13908 KB Output is correct
14 Correct 67 ms 13888 KB Output is correct
15 Correct 63 ms 13652 KB Output is correct
16 Correct 45 ms 12364 KB Output is correct
17 Correct 62 ms 15568 KB Output is correct
18 Correct 65 ms 15744 KB Output is correct
19 Correct 61 ms 15564 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 3 ms 7000 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 72 ms 14044 KB Output is correct
2 Correct 77 ms 13904 KB Output is correct
3 Incorrect 89 ms 12880 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 7000 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 7000 KB Output isn't correct
2 Halted 0 ms 0 KB -