oj.uz

답안 #443020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443020 2021-07-09T13:28:23 Z leaked 결혼 문제 (IZhO14_marriage) C++14
94 / 100
 1500 ms 1860 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("-O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define vec vector
#define sz(x) ( int)x.size()
#define m_p make_pair
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;
typedef long long ll;
typedef pair<ll, int> pli;
typedef pair<int,ll> pil;
typedef pair<int,int> pii;
typedef unsigned long long ull;
auto rng=bind(uniform_int_distribution<int>(1,1000),mt19937(time(0)));
template<class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
template<class T> bool umin(T &a,const T &b){return (a>b?a=b,1:0);}
const int N=3e4+1;
const int K=165;
const int M=2001;
vec<int> g[N];
int mt[N];
int wh[N];
int u[N],tt,n,m;
int tl,tr;
bool kuhn(int v){
    if(u[v]==tt) return 0;
    u[v]=tt;
    for(auto &z : g[v]){
        if(z>=tl && z<=tr && mt[z]==-1){
            mt[z]=v;
            wh[v]=z;
            return 1;
        }
    }
    for(auto &z : g[v]){
        if(z>=tl && z<=tr && kuhn(mt[z])){
            mt[z]=v;
            wh[v]=z;
            return 1;
        }
    }
    return 0;
}
int check(int l,int r){
    tl=l;tr=r;
    for(int i=0;i<m;i++){
        if(wh[i]==-1) continue;
        mt[wh[i]]=-1;
        wh[i]=-1;
    }
    for(int i=0;i<m;i++){
        tt++;
        if(!kuhn(i)) return 0;
    }
    return 1;
}
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int k;
    cin>>n>>m>>k;
    for(int i=0;i<k;i++){
        int v,u;
        cin>>v>>u;--v;--u;
        g[u].pb(v);
    }
    for(int i=0;i<N;i++){
        mt[i]=-1;
        wh[i]=-1;
    }
    int l=0,r=n;
    while(l!=r){
        int tm=(l+r)>>1;
        if(check(tm,n-1)) l=tm+1;
        else r=tm;
    }
    l--;
    r=n-1;
    ll ans=0;
//    cout<<check(1,4);
    for(int i=l;i>=0;i--){
//        cerr<<i<<' '<<r<<endl;
        while(check(i,r-1)) r--;
//        cout<<i<<' '<<r<<endl;
        ans+=(n-r);
    }
    cout<<ans;
    return 0;
}

/*
5
1 2
2 3
3 4
4 5
5 1
*/

Subtask #1
94.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1228 KB Output is correct
2 Correct 1 ms 1252 KB Output is correct
3 Correct 1 ms 1228 KB Output is correct
4 Correct 1 ms 1228 KB Output is correct
5 Correct 1 ms 1228 KB Output is correct
6 Correct 1 ms 1228 KB Output is correct
7 Correct 1 ms 1228 KB Output is correct
8 Correct 1 ms 1228 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 1 ms 1228 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Correct 1 ms 1228 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1228 KB Output is correct
16 Correct 1 ms 1228 KB Output is correct
17 Correct 1 ms 1228 KB Output is correct
18 Correct 1 ms 1228 KB Output is correct
19 Correct 4 ms 1228 KB Output is correct
20 Correct 2 ms 1228 KB Output is correct
21 Correct 1 ms 1228 KB Output is correct
22 Correct 1 ms 1228 KB Output is correct
23 Correct 1 ms 1228 KB Output is correct
24 Correct 1 ms 1228 KB Output is correct
25 Correct 75 ms 1356 KB Output is correct
26 Correct 17 ms 1288 KB Output is correct
27 Correct 1 ms 1228 KB Output is correct
28 Correct 2 ms 1228 KB Output is correct
29 Correct 3 ms 1228 KB Output is correct
30 Correct 3 ms 1228 KB Output is correct
31 Correct 447 ms 1560 KB Output is correct
32 Correct 5 ms 1228 KB Output is correct
33 Correct 1 ms 1228 KB Output is correct
34 Correct 8 ms 1228 KB Output is correct
35 Correct 206 ms 1860 KB Output is correct
36 Correct 156 ms 1828 KB Output is correct
37 Execution timed out 1570 ms 1612 KB Time limit exceeded
38 Correct 45 ms 1740 KB Output is correct
39 Correct 430 ms 1420 KB Output is correct
40 Correct 4 ms 1356 KB Output is correct
41 Correct 102 ms 1448 KB Output is correct
42 Correct 19 ms 1368 KB Output is correct
43 Correct 23 ms 1536 KB Output is correct
44 Correct 64 ms 1764 KB Output is correct
45 Correct 949 ms 1480 KB Output is correct
46 Execution timed out 1584 ms 1732 KB Time limit exceeded
47 Correct 67 ms 1728 KB Output is correct
48 Correct 64 ms 1784 KB Output is correct
49 Execution timed out 1577 ms 1796 KB Time limit exceeded
50 Correct 1452 ms 1408 KB Output is correct