oj.uz

답안 #90681

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90681 2018-12-23T13:54:14 Z popovicirobert 결혼 문제 (IZhO14_marriage) C++14
100 / 100
 597 ms 4220 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44

using namespace std;

const int MAXN = 30000;
const int MAXM = 2000;

struct Match {
    vector <int> g[MAXN + 1];
    vector <int> vis, l, r, pos;
    int n, now;
    int ans;
    inline void init(int _n) {
        n = _n;
        l.resize(n + 1);
        r.resize(n + 1);
        vis.resize(n + 1);
        pos.resize(n + 1);
        ans = now = 0;
    }
    inline void addEdge(int x, int y) {
        g[x].push_back(y);
    }
    inline void delEdge(int x, int y) {
        int sz = g[x].size();
        while(pos[x] < sz && g[x][pos[x]] == y) {
            pos[x]++;
        }
        if(l[x] == y) {
            l[x] = r[y] = 0;
            ans--;
        }
    }
    bool match(int nod) {
        int sz = g[nod].size();
        for(int i = pos[nod]; i < sz; i++) {
            auto it = g[nod][i];
            if(r[it] == 0) {
                l[nod] = it;
                r[it] = nod;
                return 1;
            }
        }
        vis[nod] = now;
        for(int i = pos[nod]; i < sz; i++) {
            auto it = g[nod][i];
            if(vis[r[it]] != now && match(r[it])) {
                l[nod] = it;
                r[it] = nod;
                return 1;
            }
        }
        return 0;
    }
    inline int solve(int m) {
        bool flag = 1;
        int i;
        while(flag && ans < m) {
            flag = 0;
            now++;
            for(i = 1; i <= m; i++) {
                if(l[i] == 0) {
                    flag |= match(i);
                    ans += (l[i] > 0);
                }
            }
        }
        return ans;
    }
}M;

vector <int> g[MAXN + 1];

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, n, m, k;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> m >> k;
    for(i = 1; i <= k; i++) {
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
    }
    M.init(n + m);
    int pos = 1, mx = 0;
    int ans = 0;
    for(i = 1; i <= n; i++) {
        bool ok = 0;
        while(M.solve(m) < m && pos <= n) {
            if(mx < pos) {
                for(auto it : g[pos]) {
                    M.addEdge(it, pos + m);
                }
            }
            mx = max(mx, pos);
            pos++;
            ok = 1;
        }
        pos -= ok;
        if(M.ans == m) {
            ans += n - pos + 1;
        }
        for(auto it : g[i]) {
            M.delEdge(it, i + m);
        }
    }
    cout << ans;
    //cin.close();
    //cout.close();
    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1784 KB Output is correct
2 Correct 3 ms 2004 KB Output is correct
3 Correct 2 ms 2004 KB Output is correct
4 Correct 3 ms 2004 KB Output is correct
5 Correct 3 ms 2004 KB Output is correct
6 Correct 3 ms 2004 KB Output is correct
7 Correct 3 ms 2004 KB Output is correct
8 Correct 2 ms 2004 KB Output is correct
9 Correct 3 ms 2004 KB Output is correct
10 Correct 3 ms 2004 KB Output is correct
11 Correct 2 ms 2004 KB Output is correct
12 Correct 2 ms 2100 KB Output is correct
13 Correct 2 ms 2100 KB Output is correct
14 Correct 3 ms 2100 KB Output is correct
15 Correct 3 ms 2100 KB Output is correct
16 Correct 2 ms 2100 KB Output is correct
17 Correct 3 ms 2100 KB Output is correct
18 Correct 3 ms 2100 KB Output is correct
19 Correct 5 ms 2100 KB Output is correct
20 Correct 3 ms 2100 KB Output is correct
21 Correct 3 ms 2100 KB Output is correct
22 Correct 3 ms 2100 KB Output is correct
23 Correct 3 ms 2100 KB Output is correct
24 Correct 3 ms 2100 KB Output is correct
25 Correct 18 ms 2116 KB Output is correct
26 Correct 5 ms 2116 KB Output is correct
27 Correct 4 ms 2116 KB Output is correct
28 Correct 3 ms 2116 KB Output is correct
29 Correct 5 ms 2232 KB Output is correct
30 Correct 5 ms 2232 KB Output is correct
31 Correct 221 ms 2628 KB Output is correct
32 Correct 28 ms 2628 KB Output is correct
33 Correct 9 ms 2628 KB Output is correct
34 Correct 13 ms 2628 KB Output is correct
35 Correct 149 ms 3024 KB Output is correct
36 Correct 124 ms 3024 KB Output is correct
37 Correct 594 ms 3024 KB Output is correct
38 Correct 43 ms 3280 KB Output is correct
39 Correct 262 ms 3280 KB Output is correct
40 Correct 183 ms 3280 KB Output is correct
41 Correct 223 ms 3280 KB Output is correct
42 Correct 128 ms 3280 KB Output is correct
43 Correct 129 ms 3280 KB Output is correct
44 Correct 254 ms 3560 KB Output is correct
45 Correct 284 ms 3560 KB Output is correct
46 Correct 408 ms 4092 KB Output is correct
47 Correct 488 ms 4092 KB Output is correct
48 Correct 480 ms 4092 KB Output is correct
49 Correct 480 ms 4220 KB Output is correct
50 Correct 597 ms 4220 KB Output is correct