oj.uz

답안 #443028

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443028 2021-07-09T13:44:19 Z leaked 결혼 문제 (IZhO14_marriage) C++14
84 / 100
 1500 ms 2884 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[M];
vec<int>gr[N];
int uk;
int vl[N];
int mt[N];
int u[N],tt,n,m;
int tr;
bool kuhn(int v){
    if(u[v]==tt) return 0;
    u[v]=tt;
    for(auto &z : g[v]){
        if(z<=tr && (mt[z]==-1 || kuhn(mt[z]))){
            mt[z]=v;
            vl[uk++]=z;
            return 1;
        }
    }
    return 0;
}
int check(int l,int r){
    tr=r;
    for(int i=0;i<uk;i++){
        mt[vl[i]]=-1;
    }
    uk=0;
    for(int i=0;i<m;i++){
        tt++;
        if(!kuhn(i)) return 0;
    }
    return 1;
}
bool kuhn2(int v){
    if(u[v]==tt) return 0;
    u[v]=tt;
    for(auto &z : gr[v]){
        if(mt[z]==-1 || kuhn2(mt[z])){
            mt[z]=v;
            return 1;
        }
    }
    return 0;
}
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;
        gr[v].pb(u);
    }
    fill(mt,mt+m,-1);
    int l=n;
    int h=0;
    while(h!=m && l>0){
        l--;
        tt++;
        h+=kuhn2(l);
    }
    if(h!=m){
        cout<<0;
        return 0;
    }
    fill(mt,mt+n,-1);
    for(int i=n-1;i>l;i--){
        for(auto &z : gr[i]) g[z].pb(i);
    }
    int r=n-1;
    ll ans=0;
    for(int i=l;i>=0;i--){
//        cout<<i<<endl;
        for(auto &z : gr[i]) g[z].pb(i);
        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
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 972 KB Output is correct
11 Correct 1 ms 972 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 1 ms 972 KB Output is correct
15 Correct 1 ms 972 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 1 ms 972 KB Output is correct
18 Correct 1 ms 972 KB Output is correct
19 Correct 12 ms 1132 KB Output is correct
20 Correct 3 ms 1100 KB Output is correct
21 Correct 1 ms 972 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 2 ms 1100 KB Output is correct
24 Correct 1 ms 972 KB Output is correct
25 Correct 491 ms 1592 KB Output is correct
26 Correct 55 ms 1132 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 3 ms 1100 KB Output is correct
29 Correct 10 ms 1212 KB Output is correct
30 Correct 6 ms 1100 KB Output is correct
31 Execution timed out 1591 ms 1696 KB Time limit exceeded
32 Correct 202 ms 1244 KB Output is correct
33 Correct 1 ms 1100 KB Output is correct
34 Correct 8 ms 1100 KB Output is correct
35 Execution timed out 1575 ms 2380 KB Time limit exceeded
36 Execution timed out 1575 ms 2460 KB Time limit exceeded
37 Execution timed out 1579 ms 2020 KB Time limit exceeded
38 Correct 201 ms 2500 KB Output is correct
39 Correct 456 ms 1444 KB Output is correct
40 Correct 4 ms 1228 KB Output is correct
41 Correct 452 ms 1776 KB Output is correct
42 Correct 114 ms 1820 KB Output is correct
43 Correct 144 ms 1852 KB Output is correct
44 Correct 561 ms 2416 KB Output is correct
45 Execution timed out 1581 ms 2196 KB Time limit exceeded
46 Execution timed out 1580 ms 2684 KB Time limit exceeded
47 Correct 549 ms 2756 KB Output is correct
48 Correct 545 ms 2756 KB Output is correct
49 Execution timed out 1539 ms 2884 KB Time limit exceeded
50 Execution timed out 1557 ms 1604 KB Time limit exceeded