oj.uz

Submission #252712

# Submission time Handle Problem Language Result Execution time Memory
252712 2020-07-26T07:18:34 Z khangal Duathlon (APIO18_duathlon) C++14
0 / 100
 163 ms 39464 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long , long long > pl;
const int N=1e6+1;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18 
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll sz,n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<ll> v[1234567];
vl vec;
void dfs(ll x, ll y){
    d[x] = 1;
    used[x] = 1;
    for(auto u : v[x]){
        if(u == y) continue;
        if(used[u]){
            c[u] = 1;
            continue;
        }
        dfs(u , x);
        d[x] += d[u];
    }
}
void solve(ll x , ll y, ll sum){
    ans += 2 * (d[x] - 1) * (sum - d[x]); 
    ll res = 0;
    for(auto u : v[x]){
        if(u == y) continue;
        ans += 2 * d[y] * res;
        res += d[y];
    }
    for(auto u : v[x]){
        if(u == y) continue;
        solve(u , x, sum);
    }
}
int main(){
    cin>>n>>m;
    for(ll i = 0; i < m; i++){
        cin>>x>>y;
        v[x].pb(y);
        v[y].pb(x);
    }
    for(ll i = 1; i <= n; i++){
        if(d[i] == 0) dfs(i , -1), vec.pb(i);
    }
    for(auto i : vec){
        if(c[i]==0) solve(i , -1 , d[i]);
        else ans += d[i] * (d[i] - 1) * (d[i] - 2);
    }
    cout<<ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 29312 KB Output is correct
2 Correct 17 ms 29312 KB Output is correct
3 Correct 17 ms 29312 KB Output is correct
4 Correct 24 ms 29312 KB Output is correct
5 Correct 18 ms 29312 KB Output is correct
6 Correct 18 ms 29312 KB Output is correct
7 Incorrect 18 ms 29312 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 29312 KB Output is correct
2 Correct 17 ms 29312 KB Output is correct
3 Correct 17 ms 29312 KB Output is correct
4 Correct 24 ms 29312 KB Output is correct
5 Correct 18 ms 29312 KB Output is correct
6 Correct 18 ms 29312 KB Output is correct
7 Incorrect 18 ms 29312 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 39224 KB Output is correct
2 Correct 163 ms 39464 KB Output is correct
3 Incorrect 150 ms 36984 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

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

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 29312 KB Output is correct
2 Correct 17 ms 29312 KB Output is correct
3 Correct 17 ms 29312 KB Output is correct
4 Correct 24 ms 29312 KB Output is correct
5 Correct 18 ms 29312 KB Output is correct
6 Correct 18 ms 29312 KB Output is correct
7 Incorrect 18 ms 29312 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 29312 KB Output is correct
2 Correct 17 ms 29312 KB Output is correct
3 Correct 17 ms 29312 KB Output is correct
4 Correct 24 ms 29312 KB Output is correct
5 Correct 18 ms 29312 KB Output is correct
6 Correct 18 ms 29312 KB Output is correct
7 Incorrect 18 ms 29312 KB Output isn't correct
8 Halted 0 ms 0 KB -