oj.uz

Submission #90679

# Submission time Handle Problem Language Result Execution time Memory
90679 2018-12-23T13:42:34 Z popovicirobert Marriage questions (IZhO14_marriage) C++14
94 / 100
 1500 ms 7336 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 {
    set <int> g[MAXM + 1];
    vector <int> vis, l, r;
    int n, now;
    int ans;
    inline void init(int _n) {
        n = _n;
        l.resize(n + 1);
        r.resize(n + 1);
        vis.resize(n + 1);
        ans = now = 0;
    }
    inline void addEdge(int x, int y) {
        g[x].insert(y);
    }
    inline void delEdge(int x, int y) {
        g[x].erase(g[x].find(y));
        if(l[x] == y) {
            l[x] = r[y] = 0;
            ans--;
        }
    }
    bool match(int nod) {
        for(auto it : g[nod]) {
            if(r[it] == 0) {
                l[nod] = it;
                r[it] = nod;
                return 1;
            }
        }
        vis[nod] = now;
        for(auto it : g[nod]) {
            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
94.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1144 KB Output is correct
2 Correct 2 ms 1144 KB Output is correct
3 Correct 2 ms 1160 KB Output is correct
4 Correct 2 ms 1304 KB Output is correct
5 Correct 2 ms 1304 KB Output is correct
6 Correct 2 ms 1304 KB Output is correct
7 Correct 2 ms 1304 KB Output is correct
8 Correct 2 ms 1460 KB Output is correct
9 Correct 2 ms 1460 KB Output is correct
10 Correct 2 ms 1460 KB Output is correct
11 Correct 2 ms 1460 KB Output is correct
12 Correct 2 ms 1460 KB Output is correct
13 Correct 2 ms 1460 KB Output is correct
14 Correct 2 ms 1460 KB Output is correct
15 Correct 2 ms 1460 KB Output is correct
16 Correct 2 ms 1460 KB Output is correct
17 Correct 2 ms 1460 KB Output is correct
18 Correct 2 ms 1460 KB Output is correct
19 Correct 7 ms 1460 KB Output is correct
20 Correct 3 ms 1460 KB Output is correct
21 Correct 3 ms 1460 KB Output is correct
22 Correct 4 ms 1460 KB Output is correct
23 Correct 3 ms 1460 KB Output is correct
24 Correct 3 ms 1460 KB Output is correct
25 Correct 54 ms 1608 KB Output is correct
26 Correct 7 ms 1608 KB Output is correct
27 Correct 3 ms 1608 KB Output is correct
28 Correct 3 ms 1608 KB Output is correct
29 Correct 5 ms 1856 KB Output is correct
30 Correct 5 ms 1856 KB Output is correct
31 Execution timed out 1567 ms 2940 KB Time limit exceeded
32 Correct 49 ms 2940 KB Output is correct
33 Correct 8 ms 2940 KB Output is correct
34 Correct 14 ms 2940 KB Output is correct
35 Execution timed out 1559 ms 6288 KB Time limit exceeded
36 Correct 1070 ms 6288 KB Output is correct
37 Execution timed out 1574 ms 6288 KB Time limit exceeded
38 Correct 117 ms 6784 KB Output is correct
39 Correct 371 ms 6784 KB Output is correct
40 Correct 213 ms 6784 KB Output is correct
41 Correct 281 ms 6784 KB Output is correct
42 Correct 124 ms 6784 KB Output is correct
43 Correct 132 ms 6784 KB Output is correct
44 Correct 264 ms 6784 KB Output is correct
45 Correct 296 ms 6784 KB Output is correct
46 Correct 685 ms 6784 KB Output is correct
47 Correct 517 ms 7336 KB Output is correct
48 Correct 481 ms 7336 KB Output is correct
49 Correct 856 ms 7336 KB Output is correct
50 Correct 773 ms 7336 KB Output is correct