oj.uz

Submission #345376

# Submission time Handle Problem Language Result Execution time Memory
345376 2021-01-07T08:07:02 Z vonatlus Marriage questions (IZhO14_marriage) C++14
52 / 100
 1500 ms 4584 KB 
/// wa 

#pragma GCC optimize("O3")
//#pragma comment(linker, "/STACK:36777216")

#include<bits/stdc++.h>

#define x first
#define y second
#define pb push_back
#define sz(x) (int) x.size()
#define all(z) (z).begin(), (z).end()
 
using namespace std;

using ll = long long;
using pii = pair<int, int>;                                   

const int MOD = 1e9 + 7; 
const int INF = 1e9 + 1e2;
  
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void fin() {
#ifdef AM
    freopen(".in", "r", stdin);
#endif        
}                   

const bool flag = 0;

const int N = 5e4+10;

int was[N];

int mt[N], p[N], tmp;

vector<int> adj[N], g[N];
                     
bool dfs(int x) {
    if (was[x] == tmp) return 0;
    was[x] = tmp;
    for (int to : adj[x]) {
        if (mt[to] == -1) {
            mt[to] = x;
            p[x] = to;
            return 1;
        }
    }
    for (int to : adj[x]) {
        if (dfs(to)) {
            mt[to] = x;
            p[x] = to;
            return 1;
        }
    }
    return 0;
}

int n, m, k;

bool check(int l, int r) {
    for (int i = 0; i < m; ++i) {
        adj[i].clear();
    }
    for (int i = l; i <= r; ++i) {
        for (int to : g[i]) {
            adj[to].pb(i);
        }
    }
    fill(p, p+m, -1);
    for (int i = 0; i < m; ++i) {
        tmp++;
        dfs(i);
    }
    int ok = 1;
    for (int i = 0; i < m; ++i) {
        if (~p[i]) {
            mt[p[i]] = -1;
        } else {          
            ok = 0;
        }
    }
    return ok;
}

void ma1n() {
    cin >> n >> m >> k;
    for (int u, v; k--;) {
        cin >> u >> v;
        u--, v--;
        g[u].pb(v);
    }
    ll ans = 0;
    memset(mt, -1, sizeof(mt));
    for (int i = 0; i < n; ++i) {
        int l = i+m-1;
        int r = n-1;
        int j = -1;            
        while (l <= r) {
            int mid = l+r >> 1;
            if (check(i, mid)) {
                j = mid, r = mid-1;        
            } else {
                l = mid+1;
            }
        }
        if (~j) {
            ans += n-j;
        } else break;
    }
    cout << ans;
} 

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr), fin();
    int ts = 1;
    if (flag) {
        cin >> ts;
    }
    while (ts--) {
        ma1n(); 
    }
    return 0;
}

Compilation message

marriage.cpp: In function 'void ma1n()':
marriage.cpp:101:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  101 |             int mid = l+r >> 1;
      |                       ~^~

Subtask #1
52.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 2924 KB Output isn't correct
2 Incorrect 3 ms 2924 KB Output isn't correct
3 Incorrect 3 ms 2924 KB Output isn't correct
4 Incorrect 3 ms 2924 KB Output isn't correct
5 Correct 3 ms 2924 KB Output is correct
6 Correct 2 ms 2924 KB Output is correct
7 Incorrect 3 ms 2924 KB Output isn't correct
8 Correct 2 ms 2924 KB Output is correct
9 Correct 2 ms 2924 KB Output is correct
10 Correct 2 ms 2924 KB Output is correct
11 Correct 2 ms 2924 KB Output is correct
12 Correct 3 ms 2924 KB Output is correct
13 Correct 3 ms 2924 KB Output is correct
14 Incorrect 3 ms 2924 KB Output isn't correct
15 Incorrect 3 ms 2924 KB Output isn't correct
16 Incorrect 3 ms 2924 KB Output isn't correct
17 Correct 3 ms 2928 KB Output is correct
18 Correct 2 ms 2924 KB Output is correct
19 Incorrect 6 ms 2924 KB Output isn't correct
20 Incorrect 5 ms 2924 KB Output isn't correct
21 Correct 2 ms 2924 KB Output is correct
22 Incorrect 2 ms 2924 KB Output isn't correct
23 Correct 3 ms 2924 KB Output is correct
24 Correct 3 ms 2924 KB Output is correct
25 Incorrect 83 ms 3100 KB Output isn't correct
26 Incorrect 26 ms 2924 KB Output isn't correct
27 Correct 3 ms 2924 KB Output is correct
28 Incorrect 2 ms 2924 KB Output isn't correct
29 Correct 57 ms 3056 KB Output is correct
30 Correct 42 ms 3052 KB Output is correct
31 Incorrect 635 ms 3560 KB Output isn't correct
32 Incorrect 52 ms 3052 KB Output isn't correct
33 Correct 4 ms 2924 KB Output is correct
34 Incorrect 4 ms 2924 KB Output isn't correct
35 Correct 721 ms 4016 KB Output is correct
36 Correct 782 ms 3980 KB Output is correct
37 Execution timed out 1588 ms 3644 KB Time limit exceeded
38 Correct 755 ms 4244 KB Output is correct
39 Incorrect 4 ms 3052 KB Output isn't correct
40 Correct 8 ms 3180 KB Output is correct
41 Incorrect 84 ms 3436 KB Output isn't correct
42 Correct 189 ms 3536 KB Output is correct
43 Correct 290 ms 3568 KB Output is correct
44 Correct 400 ms 4108 KB Output is correct
45 Execution timed out 1583 ms 3792 KB Time limit exceeded
46 Execution timed out 1591 ms 4460 KB Time limit exceeded
47 Correct 711 ms 4376 KB Output is correct
48 Correct 672 ms 4376 KB Output is correct
49 Execution timed out 1589 ms 4584 KB Time limit exceeded
50 Incorrect 5 ms 3052 KB Output isn't correct