oj.uz

Submission #90674

# Submission time Handle Problem Language Result Execution time Memory
90674 2018-12-23T13:23:39 Z popovicirobert Marriage questions (IZhO14_marriage) C++14
64 / 100
 1500 ms 8572 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;

struct Match {
    vector < vector <int> > g;
    vector <int> vis, l, r;
    map < pair <int, int>, bool > mp;
    int n, now;
    int ans;
    inline void init(int _n) {
        n = _n;
        g.resize(n + 1);
        l.resize(n + 1);
        r.resize(n + 1);
        vis.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) {
        mp[{x, y}] = 1;
        if(l[x] == y) {
            l[x] = r[y] = 0;
        }
    }
    bool match(int nod) {
        for(auto it : g[nod]) {
            if(r[it] == 0 && mp[{nod, it}] == 0) {
                l[nod] = it;
                r[it] = nod;
                return 1;
            }
        }
        vis[nod] = now;
        for(auto it : g[nod]) {
            if(mp[{nod, it}] == 0 && 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) {
            flag = 0;
            now++;
            for(i = 1; i <= m; i++) {
                if(l[i] == 0) {
                    flag |= match(i);
                }
            }
        }
        ans = 0;
        for(i = 1; i <= m; 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);
    }
    Match M;
    M.init(n + m);
    int pos = 1;
    ll ans = 0;
    for(i = 1; i <= n; i++) {
        bool ok = 0;
        while(M.solve(m) < m && pos <= n) {
            for(auto it : g[pos]) {
                M.addEdge(it, pos + m);
            }
            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
64.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1016 KB Output is correct
2 Correct 2 ms 1148 KB Output is correct
3 Correct 2 ms 1148 KB Output is correct
4 Correct 2 ms 1288 KB Output is correct
5 Correct 2 ms 1356 KB Output is correct
6 Correct 2 ms 1356 KB Output is correct
7 Correct 3 ms 1356 KB Output is correct
8 Correct 2 ms 1356 KB Output is correct
9 Correct 2 ms 1356 KB Output is correct
10 Correct 2 ms 1356 KB Output is correct
11 Correct 2 ms 1356 KB Output is correct
12 Correct 2 ms 1356 KB Output is correct
13 Correct 2 ms 1356 KB Output is correct
14 Correct 2 ms 1356 KB Output is correct
15 Correct 3 ms 1356 KB Output is correct
16 Correct 2 ms 1356 KB Output is correct
17 Correct 3 ms 1356 KB Output is correct
18 Correct 2 ms 1356 KB Output is correct
19 Correct 65 ms 1632 KB Output is correct
20 Correct 12 ms 1632 KB Output is correct
21 Correct 3 ms 1632 KB Output is correct
22 Correct 3 ms 1632 KB Output is correct
23 Correct 19 ms 1632 KB Output is correct
24 Correct 15 ms 1632 KB Output is correct
25 Execution timed out 1547 ms 2400 KB Time limit exceeded
26 Correct 135 ms 2400 KB Output is correct
27 Correct 19 ms 2400 KB Output is correct
28 Correct 8 ms 2400 KB Output is correct
29 Correct 658 ms 2400 KB Output is correct
30 Correct 556 ms 2400 KB Output is correct
31 Execution timed out 1580 ms 3808 KB Time limit exceeded
32 Correct 870 ms 3808 KB Output is correct
33 Correct 41 ms 3808 KB Output is correct
34 Correct 153 ms 3808 KB Output is correct
35 Execution timed out 1549 ms 8572 KB Time limit exceeded
36 Execution timed out 1572 ms 8572 KB Time limit exceeded
37 Execution timed out 1570 ms 8572 KB Time limit exceeded
38 Execution timed out 1578 ms 8572 KB Time limit exceeded
39 Execution timed out 1576 ms 8572 KB Time limit exceeded
40 Execution timed out 1575 ms 8572 KB Time limit exceeded
41 Execution timed out 1570 ms 8572 KB Time limit exceeded
42 Execution timed out 1571 ms 8572 KB Time limit exceeded
43 Execution timed out 1588 ms 8572 KB Time limit exceeded
44 Execution timed out 1581 ms 8572 KB Time limit exceeded
45 Execution timed out 1581 ms 8572 KB Time limit exceeded
46 Execution timed out 1567 ms 8572 KB Time limit exceeded
47 Execution timed out 1575 ms 8572 KB Time limit exceeded
48 Execution timed out 1574 ms 8572 KB Time limit exceeded
49 Execution timed out 1579 ms 8572 KB Time limit exceeded
50 Execution timed out 1570 ms 8572 KB Time limit exceeded