oj.uz

Submission #252987

# Submission time Handle Problem Language Result Execution time Memory
252987 2020-07-26T15:15:04 Z infinite_iq Duathlon (APIO18_duathlon) C++14
0 / 100
 1000 ms 9720 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mp make_pair
#define mid (l+r)/2
#define le node * 2 
#define ri node * 2 + 1 
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
#define all(x) x.begin(), x.end()
#define gc getchar_unlocked
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef pair<double,ll>pdi;
const ll inf=1e18;
const ll mod=987654321;
const ld Pi=acos(-1);
ll n , m , ans , nodes , edges ;
vll v [100009] ;
ll dp [100009] , done [100009] ; ;
void calc ( int node ) {
        if ( done [node] ) return ;
        done [node] = 1 ;
        nodes ++ , edges += v [node] .size () ;
        for ( auto u : v [node] )
                calc ( u ) ;
}
void solve ( int node , int p ) {
        dp [node] = 1 ;
        for ( auto u : v [node] ) {
                if ( u == p ) C ;
                solve ( u , node ) ;
                dp [node] += dp [u] ;
        }
        ll up = nodes - dp [node] ;
        for ( auto u : v [node] ) {
                if ( u == p ) C ;
                ans += up * dp [u] * 2ll ;
        }
}
int main () {
        cin >> n >> m ;
        for ( int i = 0 ; i < m ; i ++ ) {
                int a , b ;
                cin >> a >> b ;
                a -- , b -- ;
                v [a] .pb ( b ) ;
                v [b] .pb ( a ) ;
        }
        for ( int i = 0 ; i < n ; i ++ ) {
                if ( done [i] ) C ;
                nodes = 0 , edges = 0 ;
                calc ( i ) ;
                if ( nodes * 2ll == edges ) {
                        if ( nodes >= 3ll ) {
                                ans += ( nodes ) * ( nodes - 1ll ) * ( nodes - 2ll ) ;
                        }
                }
                else {
                  if ( nodes * 2 - 1 != edges && nodes >= 3 ) {
                                while ( 1 ) {

                                }
                        }

                        solve ( i , i ) ;
                }
        }
        cout << ans << endl ;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 2688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 2688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 9720 KB Output is correct
2 Correct 157 ms 9636 KB Output is correct
3 Execution timed out 1085 ms 8056 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1094 ms 2688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 7160 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 2688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1075 ms 7160 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 2688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 2688 KB Time limit exceeded
2 Halted 0 ms 0 KB -