oj.uz

답안 #90675

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90675 2018-12-23T13:26:08 Z popovicirobert 결혼 문제 (IZhO14_marriage) C++14
66 / 100
 1500 ms 8204 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;
    unordered_map <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 int get(int x, int y) {
        return x * (MAXN + 1) + y;
    }
    inline void addEdge(int x, int y) {
        g[x].push_back(y);
    }
    inline void delEdge(int x, int y) {
        mp[get(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[get(nod, it)] == 0) {
                l[nod] = it;
                r[it] = nod;
                return 1;
            }
        }
        vis[nod] = now;
        for(auto it : g[nod]) {
            if(mp[get(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;
    int 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
66.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1016 KB Output is correct
2 Correct 2 ms 1176 KB Output is correct
3 Correct 2 ms 1176 KB Output is correct
4 Correct 3 ms 1176 KB Output is correct
5 Correct 3 ms 1176 KB Output is correct
6 Correct 2 ms 1272 KB Output is correct
7 Correct 2 ms 1272 KB Output is correct
8 Correct 2 ms 1272 KB Output is correct
9 Correct 2 ms 1288 KB Output is correct
10 Correct 2 ms 1288 KB Output is correct
11 Correct 2 ms 1288 KB Output is correct
12 Correct 2 ms 1288 KB Output is correct
13 Correct 2 ms 1288 KB Output is correct
14 Correct 2 ms 1288 KB Output is correct
15 Correct 2 ms 1288 KB Output is correct
16 Correct 2 ms 1288 KB Output is correct
17 Correct 2 ms 1288 KB Output is correct
18 Correct 2 ms 1288 KB Output is correct
19 Correct 23 ms 1320 KB Output is correct
20 Correct 7 ms 1320 KB Output is correct
21 Correct 8 ms 1320 KB Output is correct
22 Correct 3 ms 1320 KB Output is correct
23 Correct 9 ms 1376 KB Output is correct
24 Correct 7 ms 1376 KB Output is correct
25 Correct 675 ms 2232 KB Output is correct
26 Correct 60 ms 2232 KB Output is correct
27 Correct 7 ms 2232 KB Output is correct
28 Correct 7 ms 2232 KB Output is correct
29 Correct 252 ms 2232 KB Output is correct
30 Correct 214 ms 2232 KB Output is correct
31 Execution timed out 1556 ms 4008 KB Time limit exceeded
32 Correct 367 ms 4008 KB Output is correct
33 Correct 27 ms 4008 KB Output is correct
34 Correct 53 ms 4008 KB Output is correct
35 Execution timed out 1570 ms 6744 KB Time limit exceeded
36 Execution timed out 1562 ms 6744 KB Time limit exceeded
37 Execution timed out 1570 ms 6744 KB Time limit exceeded
38 Execution timed out 1572 ms 6744 KB Time limit exceeded
39 Execution timed out 1579 ms 6744 KB Time limit exceeded
40 Execution timed out 1569 ms 6744 KB Time limit exceeded
41 Execution timed out 1578 ms 6744 KB Time limit exceeded
42 Execution timed out 1565 ms 6744 KB Time limit exceeded
43 Execution timed out 1562 ms 6744 KB Time limit exceeded
44 Execution timed out 1585 ms 6744 KB Time limit exceeded
45 Execution timed out 1579 ms 6744 KB Time limit exceeded
46 Execution timed out 1577 ms 7856 KB Time limit exceeded
47 Execution timed out 1586 ms 7856 KB Time limit exceeded
48 Execution timed out 1570 ms 7856 KB Time limit exceeded
49 Execution timed out 1576 ms 8204 KB Time limit exceeded
50 Execution timed out 1579 ms 8204 KB Time limit exceeded