#include <iostream>
#include <cmath>
#include <cctype>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <deque>
#include <stack>
#include <unordered_set>
#include <sstream>
#include <cstring>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <random>
#include <cfloat>
#include <chrono>
#include <bitset>
#include <complex>
#include <immintrin.h>
#include <cassert>
bool try_kuhn(int32_t v, bool* vis, std::vector<int32_t>* graph, int32_t* matched, int32_t left, int32_t right) {
vis[v] = true;
for(int32_t i = 0; i < graph[v].size(); i++)
if(graph[v][i] >= left && graph[v][i] <= right && matched[graph[v][i]] == -1) {
matched[graph[v][i]] = v;
return true;
}
for(int32_t i = 0; i < graph[v].size(); i++)
if(graph[v][i] >= left && graph[v][i] <= right && !vis[matched[graph[v][i]]] && try_kuhn(matched[graph[v][i]], vis, graph, matched, left, right)) {
matched[graph[v][i]] = v;
return true;
}
return false;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int32_t n, m, k;
std::cin >> n >> m >> k;
std::vector<int32_t>* graph = new std::vector<int32_t>[m];
for(int32_t i = 0; i < k; i++) {
int32_t src, dst;
std::cin >> src >> dst;
src--;
dst--;
//int32_t src = rand() % n, dst = rand() % m;
graph[dst].push_back(src);
}
bool* vis = new bool[m];
int32_t* matched = new int32_t[n];
int32_t left = m - 2, right = n + 1;
while(right - left > 1) {
int32_t mid = (left + right) / 2;
int32_t matched_cnt = 0;
for(int32_t i = 0; i < n; i++)
matched[i] = -1;
for(int32_t i = 0; i < m; i++) {
for(int32_t j = 0; j < m; j++)
vis[j] = false;
if(try_kuhn(i, vis, graph, matched, 0, mid))
matched_cnt++;
}
if(matched_cnt == m)
right = mid;
else
left = mid;
}
if(left == n) {
std::cout << 0;
return 0;
}
int32_t matched_cnt = 0;
for(int32_t i = 0; i < n; i++)
matched[i] = -1;
for(int32_t i = 0; i < m; i++) {
for(int32_t j = 0; j < m; j++)
vis[j] = false;
if(try_kuhn(i, vis, graph, matched, 0, right))
matched_cnt++;
}
int32_t right_ptr = right;
int32_t ans = n - right_ptr;
for(int32_t i = 1; i < n; i++) {
int32_t rematched = -1;
if(matched[i - 1] != -1) {
matched_cnt--;
rematched = matched[i - 1];
}
if(rematched != -1) {
while(right_ptr < n - 1 && matched_cnt < m) {
right_ptr++;
for(int32_t j = 0; j < m; j++)
vis[j] = false;
if(try_kuhn(rematched, vis, graph, matched, i, right_ptr))
matched_cnt++;
}
}
if(matched_cnt < m)
break;
ans += n - right_ptr;
}
std::cout << ans << "\n";
return 0;
}
Compilation message
marriage.cpp: In function 'bool try_kuhn(int32_t, bool*, std::vector<int>*, int32_t*, int32_t, int32_t)':
marriage.cpp:26:26: warning: comparison of integer expressions of different signedness: 'int32_t' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | for(int32_t i = 0; i < graph[v].size(); i++)
| ~~^~~~~~~~~~~~~~~~~
marriage.cpp:31:26: warning: comparison of integer expressions of different signedness: 'int32_t' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
31 | for(int32_t i = 0; i < graph[v].size(); i++)
| ~~^~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
0 ms |
204 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| 13 |
Correct |
0 ms |
204 KB |
Output is correct |
| 14 |
Correct |
1 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
0 ms |
204 KB |
Output is correct |
| 17 |
Correct |
0 ms |
204 KB |
Output is correct |
| 18 |
Correct |
0 ms |
204 KB |
Output is correct |
| 19 |
Correct |
1 ms |
332 KB |
Output is correct |
| 20 |
Correct |
0 ms |
204 KB |
Output is correct |
| 21 |
Correct |
1 ms |
204 KB |
Output is correct |
| 22 |
Correct |
0 ms |
204 KB |
Output is correct |
| 23 |
Correct |
1 ms |
332 KB |
Output is correct |
| 24 |
Correct |
0 ms |
204 KB |
Output is correct |
| 25 |
Correct |
4 ms |
460 KB |
Output is correct |
| 26 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 27 |
Correct |
0 ms |
204 KB |
Output is correct |
| 28 |
Correct |
1 ms |
204 KB |
Output is correct |
| 29 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 30 |
Incorrect |
1 ms |
368 KB |
Output isn't correct |
| 31 |
Correct |
9 ms |
996 KB |
Output is correct |
| 32 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 33 |
Correct |
1 ms |
332 KB |
Output is correct |
| 34 |
Correct |
2 ms |
332 KB |
Output is correct |
| 35 |
Correct |
42 ms |
1592 KB |
Output is correct |
| 36 |
Correct |
28 ms |
1484 KB |
Output is correct |
| 37 |
Correct |
29 ms |
1100 KB |
Output is correct |
| 38 |
Incorrect |
14 ms |
1612 KB |
Output isn't correct |
| 39 |
Correct |
65 ms |
628 KB |
Output is correct |
| 40 |
Correct |
6 ms |
588 KB |
Output is correct |
| 41 |
Incorrect |
7 ms |
716 KB |
Output isn't correct |
| 42 |
Incorrect |
5 ms |
460 KB |
Output isn't correct |
| 43 |
Incorrect |
8 ms |
580 KB |
Output isn't correct |
| 44 |
Incorrect |
16 ms |
844 KB |
Output isn't correct |
| 45 |
Incorrect |
9 ms |
716 KB |
Output isn't correct |
| 46 |
Incorrect |
20 ms |
972 KB |
Output isn't correct |
| 47 |
Incorrect |
17 ms |
908 KB |
Output isn't correct |
| 48 |
Incorrect |
17 ms |
972 KB |
Output isn't correct |
| 49 |
Incorrect |
24 ms |
1168 KB |
Output isn't correct |
| 50 |
Correct |
166 ms |
716 KB |
Output is correct |
