oj.uz

Submission #58140

# Submission time Handle Problem Language Result Execution time Memory
58140 2018-07-17T03:22:27 Z Benq Marriage questions (IZhO14_marriage) C++14
66 / 100
 1500 ms 11460 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

struct Edge {
    int v;
    ll flow, C;
    int rev;
};
 
template<int SZ> struct Dinic {
    int level[SZ], start[SZ];
    vector<Edge> adj[SZ]; 
     
    void addEdge(int u, int v, ll C) {
        Edge a{v, 0, C, sz(adj[v])};
        Edge b{u, 0, 0, sz(adj[u])};
        adj[u].pb(a), adj[v].pb(b); 
    } 
     
    bool bfs(int s, int t) {
        F0R(i,SZ) level[i] = -1;
        level[s] = 0;  
      
        queue<int> q; q.push(s);
        while (!q.empty()) {
            int u = q.front(); q.pop();
            for (auto e: adj[u]) 
                if (level[e.v] < 0  && e.flow < e.C) {
                    level[e.v] = level[u] + 1;
                    q.push(e.v);
                }
        }
     
        return level[t] >= 0;
    }
      
    ll sendFlow(int u, ll flow, int t) {
        if (u == t) return flow;
      
        for (  ; start[u] < sz(adj[u]); start[u] ++) {
            Edge &e = adj[u][start[u]]; 
                                          
            if (level[e.v] == level[u]+1 && e.flow < e.C) {
                ll curr_flow = min(flow, e.C - e.flow);
                ll temp_flow = sendFlow(e.v, curr_flow, t);
    
                if (temp_flow > 0) {
                    e.flow += temp_flow;
                    adj[e.v][e.rev].flow -= temp_flow;
                    return temp_flow;
                }
            }
        }
      
        return 0;
    }
     
    ll total = 0;  
    
    ll maxFlow(int s, int t) {
        if (s == t) return -1;
      
        while (bfs(s, t)) {
            F0R(i,SZ) start[i] = 0;
            while (ll flow = sendFlow(s, INT_MAX, t)) total += flow;
        }
     
        return total;
    } 
};

Dinic<1502> D;
vi adj[1001];
int N,M,K;

void ad(int lst) {
    for (int i: adj[lst]) D.addEdge(i,M+lst,1);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M >> K;
    F0R(i,K) {
        int A,B; cin >> A >> B;
        adj[A].pb(B);
    }
    ll ans = 0;
    int lst = 0;
    FOR(i,1,N+1) {
        D = Dinic<1502>();
        FOR(j,1,M+1) D.addEdge(0,j,1);
        FOR(j,1,N+1) D.addEdge(M+j,N+M+1,1);
        FOR(j,i,lst+1) ad(j);
        while (lst <= N && D.maxFlow(0,N+M+1) != M) {
            lst ++; 
            if (lst <= N) ad(lst);
            else break;
        }
        ans += N+1-lst;
    }
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
66.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 592 KB Output is correct
2 Correct 2 ms 744 KB Output is correct
3 Correct 2 ms 744 KB Output is correct
4 Correct 2 ms 744 KB Output is correct
5 Correct 2 ms 752 KB Output is correct
6 Correct 2 ms 752 KB Output is correct
7 Correct 3 ms 804 KB Output is correct
8 Correct 2 ms 804 KB Output is correct
9 Correct 3 ms 820 KB Output is correct
10 Correct 2 ms 820 KB Output is correct
11 Correct 3 ms 820 KB Output is correct
12 Correct 2 ms 820 KB Output is correct
13 Correct 2 ms 868 KB Output is correct
14 Correct 4 ms 872 KB Output is correct
15 Correct 5 ms 908 KB Output is correct
16 Correct 4 ms 912 KB Output is correct
17 Correct 4 ms 972 KB Output is correct
18 Correct 3 ms 1100 KB Output is correct
19 Correct 22 ms 1108 KB Output is correct
20 Correct 11 ms 1108 KB Output is correct
21 Correct 6 ms 1108 KB Output is correct
22 Correct 6 ms 1108 KB Output is correct
23 Correct 8 ms 1192 KB Output is correct
24 Correct 8 ms 1192 KB Output is correct
25 Correct 301 ms 1572 KB Output is correct
26 Correct 101 ms 1572 KB Output is correct
27 Correct 65 ms 1572 KB Output is correct
28 Correct 44 ms 1572 KB Output is correct
29 Correct 231 ms 2200 KB Output is correct
30 Correct 206 ms 2200 KB Output is correct
31 Execution timed out 1559 ms 4584 KB Time limit exceeded
32 Correct 712 ms 4584 KB Output is correct
33 Correct 209 ms 4584 KB Output is correct
34 Correct 262 ms 4584 KB Output is correct
35 Execution timed out 1578 ms 11128 KB Time limit exceeded
36 Execution timed out 1571 ms 11460 KB Time limit exceeded
37 Runtime error 21 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
38 Runtime error 29 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
39 Runtime error 4 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
40 Runtime error 4 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
41 Runtime error 3 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
42 Runtime error 7 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
43 Runtime error 7 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
44 Runtime error 11 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
45 Runtime error 5 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
46 Runtime error 5 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
47 Runtime error 7 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
48 Runtime error 5 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
49 Runtime error 3 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Runtime error 3 ms 11460 KB Execution killed with signal 11 (could be triggered by violating memory limits)