oj.uz

Submission #345379

# Submission time Handle Problem Language Result Execution time Memory
345379 2021-01-07T08:13:05 Z vonatlus Marriage questions (IZhO14_marriage) C++14
52 / 100
 1500 ms 7024 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 = 1e5+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();
        p[i] = -1;
    }
    for (int i = l; i <= r; ++i) {
        for (int to : g[i]) {
            adj[to].pb(i);
        }
    }
    for (int i = 0; i < m; ++i) {
        tmp++;
        dfs(i);
    }
    int ok = 1;
    for (int i = 0; i < m; ++i) {
        if (p[i] == -1) {
            ok = 0;
        } else {
            mt[p[i]] = -1;
        }
    }
    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:103:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  103 |             int mid = l+r >> 1;
      |                       ~^~

Subtask #1
52.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 5504 KB Output isn't correct
2 Incorrect 4 ms 5484 KB Output isn't correct
3 Incorrect 4 ms 5484 KB Output isn't correct
4 Incorrect 4 ms 5484 KB Output isn't correct
5 Correct 4 ms 5484 KB Output is correct
6 Correct 4 ms 5484 KB Output is correct
7 Incorrect 4 ms 5484 KB Output isn't correct
8 Correct 5 ms 5484 KB Output is correct
9 Correct 5 ms 5484 KB Output is correct
10 Correct 6 ms 5484 KB Output is correct
11 Correct 6 ms 5428 KB Output is correct
12 Correct 6 ms 5484 KB Output is correct
13 Correct 4 ms 5484 KB Output is correct
14 Incorrect 7 ms 5388 KB Output isn't correct
15 Incorrect 4 ms 5484 KB Output isn't correct
16 Incorrect 4 ms 5484 KB Output isn't correct
17 Correct 5 ms 5484 KB Output is correct
18 Correct 5 ms 5484 KB Output is correct
19 Incorrect 8 ms 5484 KB Output isn't correct
20 Incorrect 7 ms 5484 KB Output isn't correct
21 Correct 4 ms 5476 KB Output is correct
22 Incorrect 5 ms 5484 KB Output isn't correct
23 Correct 5 ms 5484 KB Output is correct
24 Correct 7 ms 5484 KB Output is correct
25 Incorrect 84 ms 5612 KB Output isn't correct
26 Incorrect 28 ms 5488 KB Output isn't correct
27 Correct 6 ms 5484 KB Output is correct
28 Incorrect 5 ms 5488 KB Output isn't correct
29 Correct 34 ms 5484 KB Output is correct
30 Correct 41 ms 5484 KB Output is correct
31 Incorrect 648 ms 6116 KB Output isn't correct
32 Incorrect 57 ms 5484 KB Output isn't correct
33 Correct 6 ms 5484 KB Output is correct
34 Incorrect 6 ms 5484 KB Output isn't correct
35 Correct 909 ms 6544 KB Output is correct
36 Correct 768 ms 6508 KB Output is correct
37 Execution timed out 1590 ms 6192 KB Time limit exceeded
38 Correct 637 ms 6784 KB Output is correct
39 Incorrect 6 ms 5612 KB Output isn't correct
40 Correct 11 ms 5740 KB Output is correct
41 Incorrect 85 ms 5996 KB Output isn't correct
42 Correct 183 ms 5996 KB Output is correct
43 Correct 350 ms 6204 KB Output is correct
44 Correct 561 ms 6636 KB Output is correct
45 Execution timed out 1580 ms 6252 KB Time limit exceeded
46 Execution timed out 1584 ms 7020 KB Time limit exceeded
47 Correct 755 ms 6916 KB Output is correct
48 Correct 733 ms 6892 KB Output is correct
49 Execution timed out 1571 ms 7024 KB Time limit exceeded
50 Incorrect 9 ms 5612 KB Output isn't correct