oj.uz

답안 #341230

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341230 2020-12-29T09:12:07 Z juggernaut 결혼 문제 (IZhO14_marriage) C++14
56 / 100
 1500 ms 4076 KB 
#include<bits/stdc++.h>
using namespace std;
vector<int>g[100005];
int mt[100005];
int n,m,q;
bool used[100001];
int X,Y;
bool kuhn(int v){
    if(used[v]||v<X||v>Y)return false;
    used[v]=true;
    for(int to:g[v]){
        if(mt[to]==0||kuhn(mt[to])){
            mt[to]=v;
            return true;
        }
    }
    return false;
}
bool check(int l,int r){
    X=l,Y=r;
    for(int i=1;i<=n;i++)mt[i]=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)used[j]=false;
        kuhn(i);
    }
    int c=0;
    for(int i=1;i<=n;i++)if(mt[i])c++;
    return c==m;
}
int main(){
    scanf("%d%d%d",&n,&m,&q);
    if(n<m||q<m)return puts("0"),0;
    while(q--){
        int x,y;
        scanf("%d%d",&x,&y);
        g[x].push_back(y);
    }
    int ans=0;
    for(int GL=1;GL<=n;GL++){
        int l=GL,r=n+1;
        while(l<r){
            int mid=(l+r)>>1;
            if(check(GL,mid))r=mid;
            else l=mid+1;
        }
        ans+=n-l+1;
    }
    cout<<ans;
}

Compilation message

marriage.cpp: In function 'int main()':
marriage.cpp:31:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   31 |     scanf("%d%d%d",&n,&m,&q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
marriage.cpp:35:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   35 |         scanf("%d%d",&x,&y);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
56.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 2 ms 2796 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2668 KB Output is correct
16 Correct 2 ms 2668 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 2 ms 2668 KB Output is correct
19 Correct 10 ms 2668 KB Output is correct
20 Correct 9 ms 2688 KB Output is correct
21 Correct 8 ms 2668 KB Output is correct
22 Correct 8 ms 2668 KB Output is correct
23 Correct 12 ms 2668 KB Output is correct
24 Correct 10 ms 2668 KB Output is correct
25 Correct 851 ms 2796 KB Output is correct
26 Correct 732 ms 2668 KB Output is correct
27 Correct 488 ms 2796 KB Output is correct
28 Correct 576 ms 2796 KB Output is correct
29 Execution timed out 1593 ms 2668 KB Time limit exceeded
30 Execution timed out 1589 ms 2668 KB Time limit exceeded
31 Execution timed out 1588 ms 3052 KB Time limit exceeded
32 Execution timed out 1590 ms 2668 KB Time limit exceeded
33 Execution timed out 1582 ms 2668 KB Time limit exceeded
34 Execution timed out 1577 ms 2816 KB Time limit exceeded
35 Execution timed out 1554 ms 3180 KB Time limit exceeded
36 Execution timed out 1588 ms 3180 KB Time limit exceeded
37 Execution timed out 1589 ms 3180 KB Time limit exceeded
38 Execution timed out 1581 ms 3436 KB Time limit exceeded
39 Execution timed out 1590 ms 2924 KB Time limit exceeded
40 Execution timed out 1576 ms 2924 KB Time limit exceeded
41 Execution timed out 1593 ms 3052 KB Time limit exceeded
42 Execution timed out 1590 ms 3368 KB Time limit exceeded
43 Execution timed out 1583 ms 3436 KB Time limit exceeded
44 Execution timed out 1575 ms 3548 KB Time limit exceeded
45 Execution timed out 1574 ms 3436 KB Time limit exceeded
46 Execution timed out 1542 ms 3820 KB Time limit exceeded
47 Execution timed out 1580 ms 4076 KB Time limit exceeded
48 Execution timed out 1590 ms 3820 KB Time limit exceeded
49 Execution timed out 1580 ms 3948 KB Time limit exceeded
50 Execution timed out 1573 ms 2924 KB Time limit exceeded