#include <bits/stdc++.h>
using namespace std;
const int N = 3e4 + 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;
}
int 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 |
1368 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
1276 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
1116 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
1116 KB |
Output isn't correct |
| 5 |
Correct |
1 ms |
1116 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1116 KB |
Output is correct |
| 7 |
Incorrect |
1 ms |
1116 KB |
Output isn't correct |
| 8 |
Correct |
1 ms |
1116 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1116 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
1116 KB |
Output isn't correct |
| 12 |
Correct |
1 ms |
1116 KB |
Output is correct |
| 13 |
Correct |
1 ms |
1116 KB |
Output is correct |
| 14 |
Incorrect |
1 ms |
1116 KB |
Output isn't correct |
| 15 |
Incorrect |
0 ms |
1116 KB |
Output isn't correct |
| 16 |
Incorrect |
1 ms |
1116 KB |
Output isn't correct |
| 17 |
Correct |
1 ms |
1116 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1168 KB |
Output is correct |
| 19 |
Incorrect |
2 ms |
1116 KB |
Output isn't correct |
| 20 |
Incorrect |
1 ms |
1116 KB |
Output isn't correct |
| 21 |
Correct |
1 ms |
1116 KB |
Output is correct |
| 22 |
Incorrect |
1 ms |
1112 KB |
Output isn't correct |
| 23 |
Correct |
2 ms |
1116 KB |
Output is correct |
| 24 |
Correct |
2 ms |
1116 KB |
Output is correct |
| 25 |
Incorrect |
353 ms |
1116 KB |
Output isn't correct |
| 26 |
Incorrect |
115 ms |
1196 KB |
Output isn't correct |
| 27 |
Correct |
73 ms |
1112 KB |
Output is correct |
| 28 |
Incorrect |
68 ms |
1112 KB |
Output isn't correct |
| 29 |
Correct |
457 ms |
1116 KB |
Output is correct |
| 30 |
Correct |
441 ms |
1268 KB |
Output is correct |
| 31 |
Execution timed out |
1531 ms |
1628 KB |
Time limit exceeded |
| 32 |
Incorrect |
758 ms |
1116 KB |
Output isn't correct |
| 33 |
Correct |
511 ms |
1112 KB |
Output is correct |
| 34 |
Incorrect |
586 ms |
1112 KB |
Output isn't correct |
| 35 |
Execution timed out |
1550 ms |
2396 KB |
Time limit exceeded |
| 36 |
Execution timed out |
1552 ms |
2140 KB |
Time limit exceeded |
| 37 |
Execution timed out |
1533 ms |
1880 KB |
Time limit exceeded |
| 38 |
Execution timed out |
1559 ms |
2652 KB |
Time limit exceeded |
| 39 |
Execution timed out |
1561 ms |
1116 KB |
Time limit exceeded |
| 40 |
Execution timed out |
1571 ms |
1448 KB |
Time limit exceeded |
| 41 |
Execution timed out |
1542 ms |
1628 KB |
Time limit exceeded |
| 42 |
Execution timed out |
1561 ms |
1628 KB |
Time limit exceeded |
| 43 |
Execution timed out |
1550 ms |
2052 KB |
Time limit exceeded |
| 44 |
Execution timed out |
1549 ms |
2396 KB |
Time limit exceeded |
| 45 |
Execution timed out |
1573 ms |
2052 KB |
Time limit exceeded |
| 46 |
Execution timed out |
1551 ms |
2908 KB |
Time limit exceeded |
| 47 |
Execution timed out |
1565 ms |
3032 KB |
Time limit exceeded |
| 48 |
Execution timed out |
1545 ms |
3184 KB |
Time limit exceeded |
| 49 |
Execution timed out |
1561 ms |
3164 KB |
Time limit exceeded |
| 50 |
Execution timed out |
1578 ms |
1284 KB |
Time limit exceeded |
