oj.uz

답안 #171785

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
171785 2019-12-30T11:56:59 Z VEGAnn 결혼 문제 (IZhO14_marriage) C++14
66 / 100
 1500 ms 12768 KB 
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define PB push_back
#define MP make_pair
#define ft first
#define sd second
#define pii pair<int, int>
#define pi3 pair<pii, int>
#define MP3(a,b,c) MP(MP(a, b), c)
using namespace std;
const int oo = 1e9;
const int N = 32000;
const int K = 110;
const int PW = 20;

struct edge{
    int x, y, cap, flow;

    edge(int _x, int _y, int _c, int _f): x(_x), y(_y), cap(_c), flow(_f) {}
};

vector<edge> edges;
queue<int> q;
vector<int> g[N];
int ans = 0, s, t, n, m, k, dst[N], ptr[N];

void add_edge(int x, int y, int cap){

    g[x].PB(sz(edges));
    edges.PB(edge(x, y, cap, 0));

    g[y].PB(sz(edges));
    edges.PB(edge(y, x, 0, 0));

}

bool bad(int l, int r, int v){
    if (v == s || v == t || v < m) return 0;
    return !(m + l <= v && v <= m + r);
}

bool bfs(int l, int r){
    fill(dst, dst + t + 1, oo);

    dst[s] = 0;
    while (sz(q)) q.pop();
    q.push(s);

    while (sz(q)){
        int v = q.front(); q.pop();

        for (int nm : g[v]){
            edge u = edges[nm];
            if (!bad(l, r, u.y) && u.cap > u.flow && dst[u.y] > dst[v] + 1){
                dst[u.y] = dst[v] + 1;
                q.push(u.y);
            }
        }
    }

    return (dst[t] < oo);
}

int dfs(int v, int pshd){
    if (pshd == 0) return 0;
    if (v == t) return pshd;
    for (; ptr[v] < sz(g[v]); ptr[v]++){
        int nm = g[v][ptr[v]];
        edge u = edges[nm];
        if (dst[u.y] != dst[v] + 1) continue;
        int nw = dfs(u.y, min(pshd, u.cap - u.flow));
        if (nw){
            edges[nm].flow += nw;
            edges[nm ^ 1].flow -= nw;
            return nw;
        }
    }
    return 0;
}

bool ok(int l, int r){

    for (int it = 0; it < sz(edges); it += 2){
        edge u = edges[it];
        if (bad(l, r, u.x) || bad(l, r, u.y)) continue;
        edges[it].flow = 0;
        edges[it ^ 1].flow = 0;
    }

    int flow = 0;

    while (bfs(l, r)){
        fill(ptr, ptr + t + 1, 0);
        int pshd = dfs(s, oo);
        while (pshd > 0){
            flow += pshd;
            pshd = dfs(s, oo);
        }
    }

    return (flow == m);
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m >> k;

    for (int i = 0; i < k; i++){
        int x, y; cin >> y >> x;
        x--; y--;
        add_edge(x, m + y, 1);
    }

    s = n + m;
    t = n + m + 1;

    for (int i = 0; i < m; i++)
        add_edge(s, i, 1);

    for (int i = 0; i < n; i++)
        add_edge(i + m, t, 1);

    for (int l = 0, r = 0; l < n; l++){
        while (r < n && !ok(l, r))
            r++;
        if (r >= n) break;
        ans += n - r;
    }

    cout << ans;

    return 0;
}

Subtask #1
66.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 3 ms 1016 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 3 ms 1144 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 3 ms 1016 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 3 ms 1148 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 3 ms 1144 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 3 ms 1144 KB Output is correct
18 Correct 3 ms 1144 KB Output is correct
19 Correct 20 ms 1400 KB Output is correct
20 Correct 12 ms 1144 KB Output is correct
21 Correct 4 ms 1144 KB Output is correct
22 Correct 4 ms 1144 KB Output is correct
23 Correct 7 ms 1272 KB Output is correct
24 Correct 6 ms 1272 KB Output is correct
25 Correct 638 ms 1852 KB Output is correct
26 Correct 202 ms 1400 KB Output is correct
27 Correct 24 ms 1272 KB Output is correct
28 Correct 16 ms 1144 KB Output is correct
29 Correct 120 ms 1964 KB Output is correct
30 Correct 101 ms 1844 KB Output is correct
31 Execution timed out 1558 ms 4024 KB Time limit exceeded
32 Correct 707 ms 1704 KB Output is correct
33 Correct 139 ms 1272 KB Output is correct
34 Correct 105 ms 1400 KB Output is correct
35 Execution timed out 1573 ms 6552 KB Time limit exceeded
36 Execution timed out 1561 ms 6680 KB Time limit exceeded
37 Execution timed out 1559 ms 4036 KB Time limit exceeded
38 Execution timed out 1575 ms 6816 KB Time limit exceeded
39 Execution timed out 1567 ms 2420 KB Time limit exceeded
40 Execution timed out 1578 ms 2548 KB Time limit exceeded
41 Execution timed out 1570 ms 2920 KB Time limit exceeded
42 Execution timed out 1579 ms 4032 KB Time limit exceeded
43 Execution timed out 1544 ms 6692 KB Time limit exceeded
44 Execution timed out 1566 ms 6820 KB Time limit exceeded
45 Runtime error 19 ms 5996 KB Execution killed with signal 11 (could be triggered by violating memory limits)
46 Runtime error 46 ms 11900 KB Execution killed with signal 11 (could be triggered by violating memory limits)
47 Runtime error 44 ms 12320 KB Execution killed with signal 11 (could be triggered by violating memory limits)
48 Runtime error 41 ms 11556 KB Execution killed with signal 11 (could be triggered by violating memory limits)
49 Runtime error 51 ms 12768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Runtime error 6 ms 2680 KB Execution killed with signal 11 (could be triggered by violating memory limits)