oj.uz

Submission #370686

# Submission time Handle Problem Language Result Execution time Memory
370686 2021-02-24T13:28:13 Z Leonardo_Paes Duathlon (APIO18_duathlon) C++17
23 / 100
 242 ms 26904 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ar array
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(),(a).end()
typedef pair<int,int> pii;
#define f first
#define s second
const int maxn = 1e5+10;
vector<int> grafo[maxn], aux[maxn];
int n, m, dp[maxn], sz[maxn], qtd[maxn], qtd2[maxn], color[maxn], c;
bool instack[maxn], mark[maxn];
stack<int> s;
void compress(int u, int p = 0){
    instack[u] = mark[u] = 1;
    s.push(u);
    //cout << "entrei em " << u << endl;
    for(int v : grafo[u]){
        if(instack[v] and v != p){
            c++;
            int vv;
            do{
                vv = s.top();
                //cout << vv << endl;
                color[vv] = c;
                instack[vv] = 0;
                s.pop();
            }while(vv != v);
        }
        if(!mark[v]) compress(v, u);
    }
    if(instack[u]) s.pop();
    instack[u] = 0;
}
int solve(int u, int p = 0){ // lca of path is u, 1 as a root
    int ans = qtd[u]*(qtd[u]-1)*(qtd[u]-2)/6; // sum of dps
    sz[u] = qtd[u];
    for(int v : grafo[u]){
        if(v == p) continue;
        ans += solve(v, u);
        sz[u] += sz[v];
        qtd2[u] += qtd2[v] + (sz[v] * qtd[u]);
    }
    int qtdd = sz[u] - 1;
    for(int v : grafo[u]){
        if(v == p) continue;
        qtdd -= sz[v];
        dp[u] += sz[v] * qtdd * qtd[u];
        dp[u] += (sz[u]  - sz[v]) * qtd2[v];
    }
    return ans + dp[u];
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin >> n >> m;
    for(int i=1; i<=m; i++){
        int u, v;
        cin >> u >> v;
        grafo[u].push_back(v);
        grafo[v].push_back(u);
    }
    for(int i=1; i<=n; i++) aux[i] = grafo[i];
    for(int i=1; i<=n; i++) if(!mark[i]) compress(1);
    for(int i=1; i<=n; i++) grafo[i].clear();
    set<pair<int,int>> edges;
    for(int i=1; i<=n; i++){
        if(!color[i]) color[i] = ++c;
        qtd[color[i]]++;
    }
    for(int i=1; i<=n; i++){
        for(int e : aux[i]){
            int u = color[i], v = color[e];
            if(u > v) swap(u, v);
            if(u == v or edges.count({u, v})) continue;
            edges.insert({u, v});
            grafo[u].push_back(v);
            grafo[v].push_back(u);
        }
    }
    int ans = 0;
    for(int i=1; i<=n; i++){
        if(!sz[i]) ans += solve(i);
    }
    cout << 2*ans << "\n";
    return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 8.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 22636 KB Output is correct
2 Correct 222 ms 22508 KB Output is correct
3 Correct 189 ms 22508 KB Output is correct
4 Correct 204 ms 22508 KB Output is correct
5 Correct 235 ms 22508 KB Output is correct
6 Correct 242 ms 26904 KB Output is correct
7 Correct 203 ms 25452 KB Output is correct
8 Correct 238 ms 24940 KB Output is correct
9 Correct 212 ms 24044 KB Output is correct
10 Correct 203 ms 22636 KB Output is correct
11 Correct 231 ms 22628 KB Output is correct
12 Correct 190 ms 22636 KB Output is correct
13 Correct 193 ms 22596 KB Output is correct
14 Correct 180 ms 21484 KB Output is correct
15 Correct 143 ms 20460 KB Output is correct
16 Correct 87 ms 16876 KB Output is correct
17 Correct 165 ms 21772 KB Output is correct
18 Correct 192 ms 21752 KB Output is correct
19 Correct 148 ms 21716 KB Output is correct
20 Correct 148 ms 21724 KB Output is correct

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 22508 KB Output is correct
2 Correct 193 ms 22380 KB Output is correct
3 Incorrect 174 ms 20204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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