oj.uz

Submission #905041

# Submission time Handle Problem Language Result Execution time Memory
905041 2024-01-12T13:20:53 Z khachatur25 Marriage questions (IZhO14_marriage) C++14
100 / 100
 334 ms 3412 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 50005;

int n,m,k;
vector<int>g[N];

bool used[N];
int mt[N];

bool kuhn(int v,int L,int R){
    if(used[v])return false;
    used[v] = true;
    for(int i = 0;i < (int)g[v].size();i++){
        int to = g[v][i];
        if(to < L)continue;
        if(to > R)break;
        if(mt[to] == -1 || kuhn(mt[to],L,R)){
            mt[to] = v;
            return true;
        }
    }
    return false;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin.tie(NULL);
    cin >> n >> m >> k;
    for(int i = 1;i <= k;i++){
        //scanf("%d""%d",&a,&b);
        int a,b;
        cin >> a >> b;
        a += m;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    
    for(int i = 1;i <= m;i++){
        sort(g[i].begin(),g[i].end());
    }
    int ina = m, inb = n, idx = -1;
    while(ina <= inb){
        int mid = (ina + inb) >> 1;
        for(int i = 1;i <= mid;i++){
            mt[i + m] = -1;
        }
        int cnt = 0;
        for(int i = 1;i <= m;i++){
            for(int j = 1;j <= m;j++){
                used[j] = false;
            }
            bool f = kuhn(i,1,mid + m);
            if(f)cnt++;
        }
        if(cnt == m){
            idx = mid;
            inb = mid - 1;
        }
        else{
            ina = mid + 1;
        }
    }
    if(idx == -1){
        cout << 0;
        return 0;
    }
    for(int i = 1;i <= n;i++){
        mt[i + m] = -1;
    }
    for(int i = 1;i <= m;i++){
        for(int j = 1;j <= m;j++){
            used[j] = false;
        }
        kuhn(i,1,idx + m);
    }
    int ans = n - idx + 1;
    for(int i = 1;i <= n;i++){
        if(mt[i + m] == -1){
            ans += n - idx + 1;
            continue;
        }
        int girl = mt[i + m];
        while(idx <= n){
            for(int j = 1;j <= m;j++){
                used[j] = false;
            }
            bool f = kuhn(girl,i + 1 + m,idx + m);
            if(f)break;
            idx++;
        }
        if(idx == n + 1)break;
        ans += n - idx + 1;
    }
    cout << ans;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1396 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 1624 KB Output is correct
10 Correct 1 ms 1624 KB Output is correct
11 Correct 1 ms 1624 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 1 ms 1628 KB Output is correct
15 Correct 1 ms 1628 KB Output is correct
16 Correct 1 ms 1628 KB Output is correct
17 Correct 1 ms 1628 KB Output is correct
18 Correct 1 ms 1628 KB Output is correct
19 Correct 2 ms 1628 KB Output is correct
20 Correct 2 ms 1628 KB Output is correct
21 Correct 2 ms 1628 KB Output is correct
22 Correct 2 ms 1628 KB Output is correct
23 Correct 1 ms 1628 KB Output is correct
24 Correct 2 ms 1624 KB Output is correct
25 Correct 11 ms 1628 KB Output is correct
26 Correct 3 ms 1628 KB Output is correct
27 Correct 1 ms 1628 KB Output is correct
28 Correct 2 ms 1628 KB Output is correct
29 Correct 2 ms 1628 KB Output is correct
30 Correct 2 ms 1628 KB Output is correct
31 Correct 124 ms 2236 KB Output is correct
32 Correct 6 ms 1628 KB Output is correct
33 Correct 1 ms 1628 KB Output is correct
34 Correct 14 ms 1692 KB Output is correct
35 Correct 59 ms 2540 KB Output is correct
36 Correct 45 ms 2636 KB Output is correct
37 Correct 297 ms 2372 KB Output is correct
38 Correct 13 ms 2904 KB Output is correct
39 Correct 243 ms 1936 KB Output is correct
40 Correct 6 ms 1884 KB Output is correct
41 Correct 9 ms 1884 KB Output is correct
42 Correct 6 ms 2136 KB Output is correct
43 Correct 13 ms 2396 KB Output is correct
44 Correct 15 ms 2648 KB Output is correct
45 Correct 10 ms 2592 KB Output is correct
46 Correct 152 ms 3176 KB Output is correct
47 Correct 20 ms 3164 KB Output is correct
48 Correct 16 ms 3164 KB Output is correct
49 Correct 198 ms 3412 KB Output is correct
50 Correct 334 ms 2016 KB Output is correct