#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 10;
int n, m, k;
vector<int> g[N];
int mt[N];
bool mark[N];
bool dfs(int u) {
if(mark[u]) return false;
mark[u] = true;
for(int v : g[u]) {
if(mt[v] == -1 || dfs(mt[v])) {
mt[v] = u;
return true;
}
}
return false;
}
int max_matching(int l, int r) {
for(int i = 1; i <= m; i++) mt[i] = -1;
int ans = 0;
for(int i = l; i <= r; i++) {
for(int j = l; j <= r; j++) mark[i] = false;
if(dfs(i)) ans++;
}
return ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m >> k;
for(int i = 1; i <= k; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
}
int ans = 0;
for(int l = 1; l <= n; l++) for(int r = l; r <= n; r++) if(max_matching(l, r) == m) ans++;
cout << ans;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
3420 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
3420 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
3420 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
3420 KB |
Output isn't correct |
| 5 |
Correct |
1 ms |
3348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
3420 KB |
Output is correct |
| 7 |
Incorrect |
1 ms |
3420 KB |
Output isn't correct |
| 8 |
Correct |
1 ms |
3420 KB |
Output is correct |
| 9 |
Correct |
1 ms |
3420 KB |
Output is correct |
| 10 |
Correct |
1 ms |
3420 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
3420 KB |
Output isn't correct |
| 12 |
Correct |
1 ms |
3420 KB |
Output is correct |
| 13 |
Correct |
1 ms |
3420 KB |
Output is correct |
| 14 |
Incorrect |
1 ms |
3420 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
3420 KB |
Output isn't correct |
| 16 |
Incorrect |
1 ms |
3416 KB |
Output isn't correct |
| 17 |
Correct |
1 ms |
3420 KB |
Output is correct |
| 18 |
Correct |
1 ms |
3420 KB |
Output is correct |
| 19 |
Incorrect |
2 ms |
3420 KB |
Output isn't correct |
| 20 |
Incorrect |
2 ms |
3420 KB |
Output isn't correct |
| 21 |
Correct |
2 ms |
3420 KB |
Output is correct |
| 22 |
Incorrect |
2 ms |
3420 KB |
Output isn't correct |
| 23 |
Correct |
2 ms |
3420 KB |
Output is correct |
| 24 |
Correct |
2 ms |
3420 KB |
Output is correct |
| 25 |
Incorrect |
403 ms |
3420 KB |
Output isn't correct |
| 26 |
Incorrect |
117 ms |
3420 KB |
Output isn't correct |
| 27 |
Correct |
68 ms |
3416 KB |
Output is correct |
| 28 |
Incorrect |
66 ms |
3420 KB |
Output isn't correct |
| 29 |
Correct |
534 ms |
3420 KB |
Output is correct |
| 30 |
Correct |
472 ms |
3596 KB |
Output is correct |
| 31 |
Execution timed out |
1570 ms |
3932 KB |
Time limit exceeded |
| 32 |
Incorrect |
784 ms |
3576 KB |
Output isn't correct |
| 33 |
Correct |
621 ms |
3420 KB |
Output is correct |
| 34 |
Incorrect |
610 ms |
3420 KB |
Output isn't correct |
| 35 |
Execution timed out |
1546 ms |
4440 KB |
Time limit exceeded |
| 36 |
Execution timed out |
1562 ms |
4444 KB |
Time limit exceeded |
| 37 |
Execution timed out |
1568 ms |
4188 KB |
Time limit exceeded |
| 38 |
Execution timed out |
1557 ms |
4956 KB |
Time limit exceeded |
| 39 |
Execution timed out |
1553 ms |
3420 KB |
Time limit exceeded |
| 40 |
Execution timed out |
1569 ms |
3676 KB |
Time limit exceeded |
| 41 |
Execution timed out |
1567 ms |
3924 KB |
Time limit exceeded |
| 42 |
Execution timed out |
1575 ms |
3932 KB |
Time limit exceeded |
| 43 |
Execution timed out |
1564 ms |
3932 KB |
Time limit exceeded |
| 44 |
Execution timed out |
1562 ms |
4528 KB |
Time limit exceeded |
| 45 |
Execution timed out |
1567 ms |
4180 KB |
Time limit exceeded |
| 46 |
Execution timed out |
1522 ms |
4952 KB |
Time limit exceeded |
| 47 |
Execution timed out |
1540 ms |
4696 KB |
Time limit exceeded |
| 48 |
Execution timed out |
1556 ms |
4828 KB |
Time limit exceeded |
| 49 |
Execution timed out |
1534 ms |
5132 KB |
Time limit exceeded |
| 50 |
Execution timed out |
1512 ms |
3664 KB |
Time limit exceeded |
