oj.uz

답안 #909514

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
909514 2024-01-17T08:33:43 Z bachhoangxuan 우호 조약 체결 (JOI14_friends) C++17
100 / 100
 72 ms 19228 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

vector<int> edge[maxn];
int n,m,par[maxn],x[maxn];
vector<pii> e;

int findpar(int u){
    if(u!=par[u]) return par[u]=findpar(par[u]);
    return u;
}

void unions(int u,int v){
    u=findpar(u);v=findpar(v);
    if(u==v) return;
    if(x[u] && x[v]) e.push_back({x[u],x[v]});
    if(x[v]) e.push_back({u,x[v]});
    if(x[u]) e.push_back({v,x[u]});
    x[u]=max(x[u],x[v]);
    if(!x[u]) x[u]=u;
    par[v]=u;
    return;
}

void solve(){
    cin >> n >> m;
    for(int i=1;i<=m;i++){
        int u,v;cin >> u >> v;
        edge[u].push_back(v);
    }
    for(int i=1;i<=n;i++){
        par[i]=i;
        if(!edge[i].empty()) x[i]=edge[i].back();
        for(int j=1;j<(int)edge[i].size();j++) e.push_back({edge[i][j-1],edge[i][j]});
    }
    while(!e.empty()){
        pii x=e.back();e.pop_back();
        unions(x.fi,x.se);
    }
    int cnt=0;
    map<int,int> mp;
    for(int i=1;i<=n;i++){
        mp[findpar(i)]++;
        for(int v:edge[i]) if(findpar(i)!=findpar(v)) cnt++;
    }
    for(auto x:mp) cnt+=(x.se-1)*x.se;
    cout << cnt << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8116 KB Output is correct
2 Correct 3 ms 8024 KB Output is correct
3 Correct 3 ms 8028 KB Output is correct
4 Correct 2 ms 8028 KB Output is correct
5 Correct 2 ms 8028 KB Output is correct
6 Correct 3 ms 8024 KB Output is correct
7 Correct 3 ms 8028 KB Output is correct
8 Correct 3 ms 8188 KB Output is correct
9 Correct 2 ms 8008 KB Output is correct
10 Correct 3 ms 8024 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 2 ms 8024 KB Output is correct
13 Correct 3 ms 8028 KB Output is correct
14 Correct 2 ms 8112 KB Output is correct
15 Correct 3 ms 8028 KB Output is correct
16 Correct 3 ms 8028 KB Output is correct
17 Correct 2 ms 8028 KB Output is correct
18 Correct 3 ms 8028 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8344 KB Output is correct
2 Correct 5 ms 8284 KB Output is correct
3 Correct 8 ms 9048 KB Output is correct
4 Correct 39 ms 15836 KB Output is correct
5 Correct 22 ms 12760 KB Output is correct
6 Correct 34 ms 17600 KB Output is correct
7 Correct 3 ms 8028 KB Output is correct
8 Correct 5 ms 8796 KB Output is correct
9 Correct 9 ms 9468 KB Output is correct
10 Correct 12 ms 10436 KB Output is correct
11 Correct 35 ms 18860 KB Output is correct
12 Correct 6 ms 8792 KB Output is correct
13 Correct 4 ms 8280 KB Output is correct
14 Correct 4 ms 8280 KB Output is correct
15 Correct 5 ms 8540 KB Output is correct
16 Correct 9 ms 9412 KB Output is correct
17 Correct 34 ms 17612 KB Output is correct
18 Correct 4 ms 8536 KB Output is correct
19 Correct 4 ms 8284 KB Output is correct
20 Correct 35 ms 17092 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 5 ms 8284 KB Output is correct
23 Correct 6 ms 8792 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8536 KB Output is correct
26 Correct 6 ms 8284 KB Output is correct
27 Correct 4 ms 8636 KB Output is correct
28 Correct 5 ms 8280 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 18316 KB Output is correct
2 Correct 56 ms 16580 KB Output is correct
3 Correct 69 ms 16744 KB Output is correct
4 Correct 36 ms 14548 KB Output is correct
5 Correct 40 ms 15052 KB Output is correct
6 Correct 52 ms 19228 KB Output is correct
7 Correct 53 ms 16584 KB Output is correct
8 Correct 52 ms 16580 KB Output is correct
9 Correct 38 ms 15056 KB Output is correct
10 Correct 46 ms 15308 KB Output is correct
11 Correct 72 ms 16736 KB Output is correct
12 Correct 56 ms 16064 KB Output is correct
13 Correct 38 ms 18588 KB Output is correct
14 Correct 51 ms 18884 KB Output is correct
15 Correct 31 ms 15312 KB Output is correct
16 Correct 25 ms 14428 KB Output is correct
17 Correct 18 ms 14172 KB Output is correct
18 Correct 59 ms 18628 KB Output is correct
19 Correct 58 ms 18892 KB Output is correct
20 Correct 35 ms 14540 KB Output is correct
21 Correct 28 ms 14856 KB Output is correct
22 Correct 21 ms 14424 KB Output is correct
23 Correct 19 ms 12496 KB Output is correct
24 Correct 37 ms 14028 KB Output is correct
25 Correct 45 ms 18768 KB Output is correct
26 Correct 26 ms 13520 KB Output is correct
27 Correct 53 ms 16328 KB Output is correct
28 Correct 30 ms 13768 KB Output is correct
29 Correct 32 ms 13628 KB Output is correct
30 Correct 55 ms 16328 KB Output is correct
31 Correct 28 ms 12240 KB Output is correct
32 Correct 41 ms 18788 KB Output is correct
33 Correct 54 ms 18656 KB Output is correct
34 Correct 48 ms 14792 KB Output is correct
35 Correct 40 ms 18640 KB Output is correct
36 Correct 39 ms 15044 KB Output is correct
37 Correct 33 ms 13520 KB Output is correct