oj.uz

Submission #443031

# Submission time Handle Problem Language Result Execution time Memory
443031 2021-07-09T13:57:46 Z leaked Marriage questions (IZhO14_marriage) C++14
96 / 100
 1500 ms 3152 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+M];
int uk;
int mt[N+M];
int h[N+M],u[N+M],tt,n,m;
int tr;
bool kuhn(int v){
    if(u[v]==tt) return 0;
    u[v]=tt;
    for(auto &z : g[v]){
        if(h[z] && mt[z]==-1){
            mt[z]=v;mt[v]=z;
            return 1;
        }
    }
    for(auto &z : g[v]){
        if(h[z] && kuhn(mt[z])){
            mt[z]=v;mt[v]=z;
            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;
        g[v].pb(u+n);
        g[u+n].pb(v);
    }
    fill(mt,mt+n+m,-1);
    for(int i=0;i<m;i++) h[i+n]=1;
    int r=-1;
    int c=0;
    ll ans=0;
    for(int l=0;l<n;l++){
        if(l){
            h[l-1]=0;
            if(mt[l-1]!=-1){
                tt++;
                mt[mt[l-1]]=-1;
                c--;c+=kuhn(mt[l-1]);
                mt[l-1]=-1;
            }
        }
        while(r<n && c!=m){
            r++;tt++;
            h[r]=1;c+=kuhn(r);
        }
        ans+=n-r;
//        cerr<<l<<' '<<r<<endl;
    }
    cout<<ans;
    return 0;
}

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

Subtask #1
96.0 / 100.0

# Verdict Execution time Memory 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 4 ms 1100 KB Output is correct
20 Correct 2 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 1 ms 1100 KB Output is correct
24 Correct 1 ms 972 KB Output is correct
25 Correct 48 ms 1228 KB Output is correct
26 Correct 7 ms 1100 KB Output is correct
27 Correct 1 ms 1100 KB Output is correct
28 Correct 1 ms 1100 KB Output is correct
29 Correct 7 ms 1100 KB Output is correct
30 Correct 6 ms 1100 KB Output is correct
31 Correct 557 ms 1704 KB Output is correct
32 Correct 28 ms 1100 KB Output is correct
33 Correct 1 ms 1100 KB Output is correct
34 Correct 2 ms 1100 KB Output is correct
35 Correct 135 ms 2180 KB Output is correct
36 Correct 97 ms 2124 KB Output is correct
37 Correct 1481 ms 1860 KB Output is correct
38 Correct 182 ms 2396 KB Output is correct
39 Correct 10 ms 1476 KB Output is correct
40 Correct 5 ms 1612 KB Output is correct
41 Correct 82 ms 1668 KB Output is correct
42 Correct 153 ms 1904 KB Output is correct
43 Correct 219 ms 1884 KB Output is correct
44 Correct 603 ms 2308 KB Output is correct
45 Correct 17 ms 2252 KB Output is correct
46 Execution timed out 1586 ms 3116 KB Time limit exceeded
47 Correct 927 ms 2872 KB Output is correct
48 Correct 908 ms 2872 KB Output is correct
49 Execution timed out 1588 ms 3152 KB Time limit exceeded
50 Correct 11 ms 1612 KB Output is correct