# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
341189 | 2020-12-29T05:33:47 Z | juggernaut | 결혼 문제 (IZhO14_marriage) | C++14 | 1500 ms | 4588 KB |
//Just try and the idea will come! #include<bits/stdc++.h> #define int long long int using namespace std; int n,m,k,x,y,cnt,mt[100001]; vector<vector<int>>g(100001); bool used[100001]; 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){ 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; } main(){ scanf("%lld%lld%lld",&n,&m,&k); while(k--){ scanf("%lld%lld",&x,&y); g[x].push_back(y); } for(x=1;x<=n;x++) for(y=x;y<=n;y++){ if(check(x,y)){ cnt+=n-y+1; break; } } printf("%lld",cnt); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | 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 | 2668 KB | Output is correct |
13 | Correct | 2 ms | 2668 KB | Output is correct |
14 | Correct | 2 ms | 2688 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 | 36 ms | 2668 KB | Output is correct |
20 | Correct | 31 ms | 2668 KB | Output is correct |
21 | Correct | 41 ms | 2668 KB | Output is correct |
22 | Correct | 43 ms | 2668 KB | Output is correct |
23 | Correct | 46 ms | 2796 KB | Output is correct |
24 | Correct | 43 ms | 2668 KB | Output is correct |
25 | Execution timed out | 1582 ms | 2796 KB | Time limit exceeded |
26 | Execution timed out | 1591 ms | 2668 KB | Time limit exceeded |
27 | Execution timed out | 1583 ms | 2668 KB | Time limit exceeded |
28 | Execution timed out | 1592 ms | 2668 KB | Time limit exceeded |
29 | Execution timed out | 1597 ms | 2796 KB | Time limit exceeded |
30 | Execution timed out | 1580 ms | 2796 KB | Time limit exceeded |
31 | Execution timed out | 1592 ms | 3308 KB | Time limit exceeded |
32 | Execution timed out | 1591 ms | 2924 KB | Time limit exceeded |
33 | Execution timed out | 1583 ms | 2668 KB | Time limit exceeded |
34 | Execution timed out | 1591 ms | 2796 KB | Time limit exceeded |
35 | Execution timed out | 1592 ms | 3820 KB | Time limit exceeded |
36 | Execution timed out | 1595 ms | 3692 KB | Time limit exceeded |
37 | Execution timed out | 1590 ms | 3436 KB | Time limit exceeded |
38 | Execution timed out | 1593 ms | 4204 KB | Time limit exceeded |
39 | Execution timed out | 1551 ms | 2796 KB | Time limit exceeded |
40 | Execution timed out | 1593 ms | 2924 KB | Time limit exceeded |
41 | Execution timed out | 1589 ms | 3052 KB | Time limit exceeded |
42 | Execution timed out | 1592 ms | 3308 KB | Time limit exceeded |
43 | Execution timed out | 1585 ms | 3436 KB | Time limit exceeded |
44 | Execution timed out | 1586 ms | 3820 KB | Time limit exceeded |
45 | Execution timed out | 1594 ms | 3564 KB | Time limit exceeded |
46 | Execution timed out | 1540 ms | 4588 KB | Time limit exceeded |
47 | Execution timed out | 1586 ms | 4204 KB | Time limit exceeded |
48 | Execution timed out | 1600 ms | 4204 KB | Time limit exceeded |
49 | Execution timed out | 1594 ms | 4588 KB | Time limit exceeded |
50 | Execution timed out | 1586 ms | 3052 KB | Time limit exceeded |