oj.uz

Submission #443063

# Submission time Handle Problem Language Result Execution time Memory
443063 2021-07-09T14:58:42 Z leaked Marriage questions (IZhO14_marriage) C++14
94 / 100
 1500 ms 2936 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;
vec<int>rem;
bool kuhn(int v){
    if(u[v]==tt) return 0;
    u[v]=tt;
    for(auto &z : g[v]){
//        if(h[z] && mt[z]==v){
//            assert(false);
//        }
        if(!h[z]) assert(mt[z]==-1);
    }
    for(auto &z : g[v]){
        if(h[z] && (mt[z]==-1 || 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;
    scanf("%d%d%d",&n,&m,&k);
    for(int i=0;i<k;i++){
        int v,u;
        scanf("%d%d",&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,rem.pb(i+n);
    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++;
                rem.pb(mt[l-1]);
                mt[rem.back()]=-1;
                mt[l-1]=-1;
            }
        }
        while(sz(rem) && kuhn(rem.back())){
            rem.pop_back();
        }
        while(r<n && sz(rem)){
            r++;tt++;h[r]=1;
            while(sz(rem) && kuhn(rem.back())){
                rem.pop_back();
            }
        }
        ans+=n-r;
    }
    printf("%lld",ans);
    return 0;
}

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

Compilation message

marriage.cpp: In function 'int main()':
marriage.cpp:62:9: warning: unused variable 'c' [-Wunused-variable]
   62 |     int c=0;
      |         ^
marriage.cpp:52:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |     scanf("%d%d%d",&n,&m,&k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
marriage.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |         scanf("%d%d",&v,&u);--v;--u;
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
94.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 Incorrect 1 ms 972 KB Output isn't 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 5 ms 1100 KB Output is correct
20 Correct 2 ms 972 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 972 KB Output is correct
24 Correct 1 ms 972 KB Output is correct
25 Correct 61 ms 1240 KB Output is correct
26 Correct 7 ms 1116 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 1 ms 972 KB Output is correct
29 Correct 8 ms 1100 KB Output is correct
30 Correct 4 ms 1100 KB Output is correct
31 Correct 777 ms 1788 KB Output is correct
32 Correct 15 ms 1100 KB Output is correct
33 Correct 1 ms 1100 KB Output is correct
34 Correct 3 ms 1100 KB Output is correct
35 Correct 219 ms 2200 KB Output is correct
36 Correct 154 ms 2044 KB Output is correct
37 Execution timed out 1584 ms 1856 KB Time limit exceeded
38 Correct 56 ms 2380 KB Output is correct
39 Correct 69 ms 1348 KB Output is correct
40 Correct 4 ms 1356 KB Output is correct
41 Correct 11 ms 1564 KB Output is correct
42 Correct 14 ms 1776 KB Output is correct
43 Correct 24 ms 1904 KB Output is correct
44 Correct 39 ms 2252 KB Output is correct
45 Correct 14 ms 2112 KB Output is correct
46 Incorrect 131 ms 2888 KB Output isn't correct
47 Correct 46 ms 2656 KB Output is correct
48 Correct 41 ms 2636 KB Output is correct
49 Correct 236 ms 2936 KB Output is correct
50 Correct 217 ms 1460 KB Output is correct