oj.uz

Submission #742131

# Submission time Handle Problem Language Result Execution time Memory
742131 2023-05-15T16:32:22 Z speedyArda Duathlon (APIO18_duathlon) C++14
8 / 100
 469 ms 1048576 KB 
#include "bits/stdc++.h"

using namespace std;
const int MAXN = 1e5+5;
vector< vector<int> > adj(MAXN);
bool visited[MAXN];
long long sz[MAXN];
long long bgsz[MAXN];
int par[MAXN];
long long add[MAXN];
int n, m;
int find(int v)
{
    if(par[v] == v)
        return v;
    return par[v] = find(par[v]); 
}

void merge(int a, int b)
{
    a = find(a), b = find(b);
    if(a == b)
        return;
    if(bgsz[a] < bgsz[b])
        swap(a, b);
    par[b] = a;
    bgsz[a] += bgsz[b];
}
pair<long long, bool> subtask3(int v, int p)
{
    pair<long long, bool> ans = {1, false};
    visited[v] = true;

    for(int e : adj[v])
    {
        if(e == p)
            continue;
        if(visited[e]) {
            ans.second = true;
            continue;
        }
        pair<long long, bool> temp = subtask3(e, v);
        ans.first += temp.first;
        ans.second |= temp.second;
    }
    return ans;
}

long long subtask5(int v, int p)
{
    long long ans = 0;
    visited[v] = true;
    sz[v] = 1;
    long long chi_size = 0;
    for(int e : adj[v])
    {
        if(e == p)
            continue;
        ans += subtask5(e, v);
        sz[v] += sz[e];
        chi_size += sz[e];
    }
    int bigpar = find(v);
    long long par_size = bgsz[bigpar] - chi_size - 1;
    ans += par_size * chi_size;
    for(int e : adj[v])
    {
        if(e == p)
            continue;
        ans += sz[e] * (bgsz[bigpar] - sz[e] - 1LL);
    }
    return ans;
}
int main() 
{
    long long temp = 0;
    add[0] = 0;
    for(long long i = 1; i < MAXN; i++)
    {
        temp += i;
        add[i] = add[i - 1] + temp;
        par[i] = i;
    }
    cin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int f, s;
        cin >> f >> s;
        adj[f].push_back(s);
        adj[s].push_back(f);
        merge(f, s);
    }

    int max_size = 0;
    for(int i = 1; i <= n; i++)
    {
        max_size = max(max_size, (int)adj[i].size());
    }
    long long ans = 0;
    if(max_size <= 2) // Subtask 3
    {
        for(int i = 1; i <= n; i++)
        {
            if(visited[i])
                continue;
            pair<long long, bool> curr = subtask3(i, -1);
            if(curr.second)
            {
                ans += curr.first * (curr.first - 1) * (curr.first - 2);
            } else if(curr.first >= 3)
            {
                ans += add[curr.first - 2] * 2LL;
            }
        }   
    } else 
    {
        for(int i = 1; i <= n; i++)
        {
            if(visited[i])
                continue;
            ans += subtask5(i, -1);
        }
    }


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

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 469 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 469 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 15528 KB Output is correct
2 Correct 100 ms 15540 KB Output is correct
3 Correct 95 ms 11712 KB Output is correct
4 Correct 101 ms 13720 KB Output is correct
5 Correct 99 ms 10448 KB Output is correct
6 Correct 109 ms 10420 KB Output is correct
7 Correct 91 ms 9400 KB Output is correct
8 Correct 93 ms 9964 KB Output is correct
9 Correct 85 ms 8572 KB Output is correct
10 Correct 90 ms 9420 KB Output is correct
11 Correct 74 ms 7724 KB Output is correct
12 Correct 72 ms 7600 KB Output is correct
13 Correct 69 ms 7624 KB Output is correct
14 Correct 68 ms 7540 KB Output is correct
15 Correct 52 ms 7176 KB Output is correct
16 Correct 57 ms 7124 KB Output is correct
17 Correct 3 ms 4436 KB Output is correct
18 Correct 4 ms 4436 KB Output is correct
19 Correct 3 ms 4308 KB Output is correct
20 Correct 4 ms 4308 KB Output is correct
21 Correct 3 ms 4180 KB Output is correct
22 Correct 3 ms 4180 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

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

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 469 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 469 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -