#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e5+5;
pii p[N];
int ed[N], st[N], n, m, k, love[N];
bool vis[N], vis1[N];
vector<pii> v;
vector<int> adj[N];
bool check(){
set<int> st;
for(auto &i : v)
st.insert(i.ss);
return ((int)st.size() == m);
}
bool kuhn(int x){
if(vis[x])
return 0;
vis[x] = 1;
for(auto i : adj[x])
if(love[i] == -1 or kuhn(love[i])){
love[i] = x;
return 1;
}
return 0;
}
int main(){
// freopen("file.in", "r", stdin);
scanf("%d%d%d", &n, &m, &k);
for(int i = 1; i <= k; ++i){
int a, b;
scanf("%d%d", &a, &b);
p[i].ff = a, p[i].ss = b;
}
sort(p+1, p+k+1);
int _ = -1;
for(int i = 1; i <= k; ++i){
ed[p[i].ff] = i;
if(p[i].ff != _)
st[p[i].ff] = i;
_ = p[i].ff;
}
for (int i = 1; i <= n; i++)
if (!ed[i])
ed[i] = ed[i-1];
st[n+1] = k+1;
for (int i = n; i >= 1; i--)
if (!st[i])
st[i] = st[i+1];
int answer = 0;
for(int l = 1; l <= n; ++l)
for(int r = l; r <= n; ++r){
v.clear();
for(int j = st[l]; j <= ed[r]; ++j)
v.pb(p[j]);
if(!check())
continue;
// .ff = men, .ss = women
for(auto &i : v)
adj[i.ff].pb(i.ss);
// for(int x = l; x <= r; ++x){
// printf("%d: ", x);
// for(auto i : adj[x])
// printf("%d ", i);
// puts("");
// }
for (int j = 1; j <= m; j++)
love[j] = -1;
// Improved Kuhn starts here
for (int j = l; j <= r; j++)
vis1[j] = 0;
for (int j = l; j <= r; j++)
for (int to : adj[j])
if (love[to] == -1) {
love[to] = j;
vis1[j] = true;
break;
}
for (int i = l; i <= r; i++){
if (vis1[i])
continue;
// Improved Kuhn ends here
for (int j = l; j <= r; j++)
vis[j] = 0;
kuhn(i);
}
bool ok = 1;
for (int i = 1; i <= m and ok; i++)
ok &= (love[i] != -1);
answer += ok;
// wr;
for(int i = l; i <= r; ++i)
adj[i].clear();
}
printf("%d\n", answer);
return 0;
}
Compilation message
marriage.cpp: In function 'int main()':
marriage.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
43 | scanf("%d%d%d", &n, &m, &k);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~
marriage.cpp:46:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
46 | scanf("%d%d", &a, &b);
| ~~~~~^~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
2656 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2648 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2652 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2792 KB |
Output is correct |
| 7 |
Correct |
3 ms |
2792 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2796 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2652 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 16 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 17 |
Correct |
1 ms |
2732 KB |
Output is correct |
| 18 |
Correct |
2 ms |
2648 KB |
Output is correct |
| 19 |
Correct |
105 ms |
2652 KB |
Output is correct |
| 20 |
Correct |
30 ms |
2652 KB |
Output is correct |
| 21 |
Correct |
7 ms |
2648 KB |
Output is correct |
| 22 |
Correct |
6 ms |
2652 KB |
Output is correct |
| 23 |
Correct |
53 ms |
2820 KB |
Output is correct |
| 24 |
Correct |
24 ms |
2648 KB |
Output is correct |
| 25 |
Execution timed out |
1525 ms |
3160 KB |
Time limit exceeded |
| 26 |
Execution timed out |
1524 ms |
2868 KB |
Time limit exceeded |
| 27 |
Correct |
348 ms |
2652 KB |
Output is correct |
| 28 |
Correct |
467 ms |
2652 KB |
Output is correct |
| 29 |
Execution timed out |
1543 ms |
3160 KB |
Time limit exceeded |
| 30 |
Execution timed out |
1571 ms |
3056 KB |
Time limit exceeded |
| 31 |
Execution timed out |
1548 ms |
4300 KB |
Time limit exceeded |
| 32 |
Execution timed out |
1546 ms |
2980 KB |
Time limit exceeded |
| 33 |
Execution timed out |
1502 ms |
2648 KB |
Time limit exceeded |
| 34 |
Execution timed out |
1506 ms |
2904 KB |
Time limit exceeded |
| 35 |
Execution timed out |
1557 ms |
5684 KB |
Time limit exceeded |
| 36 |
Execution timed out |
1555 ms |
5044 KB |
Time limit exceeded |
| 37 |
Execution timed out |
1532 ms |
3976 KB |
Time limit exceeded |
| 38 |
Execution timed out |
1542 ms |
5924 KB |
Time limit exceeded |
| 39 |
Execution timed out |
1567 ms |
3244 KB |
Time limit exceeded |
| 40 |
Execution timed out |
1550 ms |
3100 KB |
Time limit exceeded |
| 41 |
Execution timed out |
1561 ms |
3412 KB |
Time limit exceeded |
| 42 |
Execution timed out |
1568 ms |
3724 KB |
Time limit exceeded |
| 43 |
Execution timed out |
1563 ms |
4048 KB |
Time limit exceeded |
| 44 |
Execution timed out |
1563 ms |
4852 KB |
Time limit exceeded |
| 45 |
Execution timed out |
1556 ms |
3600 KB |
Time limit exceeded |
| 46 |
Execution timed out |
1514 ms |
4688 KB |
Time limit exceeded |
| 47 |
Execution timed out |
1536 ms |
5068 KB |
Time limit exceeded |
| 48 |
Execution timed out |
1547 ms |
4848 KB |
Time limit exceeded |
| 49 |
Execution timed out |
1528 ms |
4944 KB |
Time limit exceeded |
| 50 |
Execution timed out |
1542 ms |
3388 KB |
Time limit exceeded |
