oj.uz

답안 #443036

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443036 2021-07-09T14:01:49 Z leaked 결혼 문제 (IZhO14_marriage) C++14
88 / 100
 1500 ms 3044 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;
    random_shuffle(all(g[v]));
    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;
    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;
    }
    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:46:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |     scanf("%d%d%d",&n,&m,&k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
marriage.cpp:49:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         scanf("%d%d",&v,&u);--v;--u;
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
88.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 1100 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 8 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 3 ms 972 KB Output is correct
24 Correct 3 ms 972 KB Output is correct
25 Correct 154 ms 1228 KB Output is correct
26 Correct 19 ms 1112 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 1 ms 972 KB Output is correct
29 Correct 22 ms 1100 KB Output is correct
30 Correct 18 ms 1100 KB Output is correct
31 Correct 1224 ms 1668 KB Output is correct
32 Correct 66 ms 1100 KB Output is correct
33 Correct 1 ms 1100 KB Output is correct
34 Correct 4 ms 1100 KB Output is correct
35 Correct 1114 ms 2160 KB Output is correct
36 Correct 862 ms 2116 KB Output is correct
37 Execution timed out 1591 ms 1868 KB Time limit exceeded
38 Correct 1425 ms 2356 KB Output is correct
39 Correct 57 ms 1356 KB Output is correct
40 Correct 7 ms 1484 KB Output is correct
41 Correct 158 ms 1604 KB Output is correct
42 Correct 568 ms 1884 KB Output is correct
43 Correct 808 ms 2248 KB Output is correct
44 Execution timed out 1566 ms 2464 KB Time limit exceeded
45 Correct 24 ms 2176 KB Output is correct
46 Execution timed out 1584 ms 3044 KB Time limit exceeded
47 Execution timed out 1592 ms 2832 KB Time limit exceeded
48 Execution timed out 1598 ms 2732 KB Time limit exceeded
49 Execution timed out 1591 ms 3020 KB Time limit exceeded
50 Correct 56 ms 1632 KB Output is correct