oj.uz

답안 #252690

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252690 2020-07-26T06:33:02 Z khangal 철인 이종 경기 (APIO18_duathlon) C++14
0 / 100
 1000 ms 35676 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];
void dfs(ll x,ll y){
    if(y != 0) ans += y-1;
    used[x] = 1;
    for(ll i=0;i<v[x].size();i++){
        ll u = v[x][i];
        if(used[u]==0) dfs(u,y+1);
    }
}
ll C(ll x){
    return x*(x-1)*(x-2)/6;
}
void dps(ll x){
    used[x]=1;
    sz++;
    mx+=v[x].size();
    for(auto u:v[x]){
        if(used[u]==0)dps(u);
    }
}
int main(){
    cin>>n>>m;
    for(ll i=0;i<m;i++){
        ll a,b;
        cin>>a>>b;
        a--;
        b--;
        v[a].pb(b);
        v[b].pb(a);
        if(v[a].size() > 2)cnt++;
        if(v[b].size() > 2)cnt++;
    }
    if(cnt==0){
        rep(i,0,n-1){
            if(used[i]==0){
            sz=0;
            mx=0;
            dps(i);
            if(sz * 2 == mx){
                ans += C(n)*6;
            }
            else{
                ans += C(n)*2;
            }}
        }
    }
    for(ll i=0;i<n;i++){
        rep(j,0,n)used[j]=0;
        dfs(i,0);
    }
    cout<<ans;
}

Compilation message

count_triplets.cpp: In function 'void dfs(ll, ll)':
count_triplets.cpp:36:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(ll i=0;i<v[x].size();i++){
                ~^~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 29312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 29312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1098 ms 35676 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 29312 KB Output is correct
2 Correct 29 ms 29312 KB Output is correct
3 Correct 37 ms 29312 KB Output is correct
4 Incorrect 39 ms 29312 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1097 ms 33144 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 29312 KB Output is correct
2 Correct 34 ms 29312 KB Output is correct
3 Incorrect 36 ms 29312 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1091 ms 33140 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 29312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 29312 KB Output isn't correct
2 Halted 0 ms 0 KB -