oj.uz

답안 #345385

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
345385 2021-01-07T08:19:42 Z vonatlus 결혼 문제 (IZhO14_marriage) C++17
86 / 100
 1500 ms 4376 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(mt[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
86.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2924 KB Output is correct
2 Correct 2 ms 2924 KB Output is correct
3 Correct 2 ms 2924 KB Output is correct
4 Correct 2 ms 2924 KB Output is correct
5 Correct 2 ms 2924 KB Output is correct
6 Correct 3 ms 2924 KB Output is correct
7 Correct 3 ms 2924 KB Output is correct
8 Correct 3 ms 2924 KB Output is correct
9 Correct 3 ms 2924 KB Output is correct
10 Correct 2 ms 2924 KB Output is correct
11 Correct 3 ms 2924 KB Output is correct
12 Correct 3 ms 2924 KB Output is correct
13 Correct 2 ms 2924 KB Output is correct
14 Correct 3 ms 2924 KB Output is correct
15 Correct 3 ms 2924 KB Output is correct
16 Correct 3 ms 2924 KB Output is correct
17 Correct 3 ms 2924 KB Output is correct
18 Correct 3 ms 2924 KB Output is correct
19 Correct 6 ms 2924 KB Output is correct
20 Correct 4 ms 2924 KB Output is correct
21 Correct 3 ms 2924 KB Output is correct
22 Correct 3 ms 2924 KB Output is correct
23 Correct 3 ms 2924 KB Output is correct
24 Correct 3 ms 2924 KB Output is correct
25 Correct 39 ms 3052 KB Output is correct
26 Correct 28 ms 2924 KB Output is correct
27 Correct 3 ms 2924 KB Output is correct
28 Correct 11 ms 2924 KB Output is correct
29 Correct 48 ms 3052 KB Output is correct
30 Correct 37 ms 3052 KB Output is correct
31 Correct 822 ms 3520 KB Output is correct
32 Correct 64 ms 3052 KB Output is correct
33 Correct 2 ms 2924 KB Output is correct
34 Correct 53 ms 2924 KB Output is correct
35 Correct 1180 ms 3948 KB Output is correct
36 Correct 700 ms 3852 KB Output is correct
37 Execution timed out 1578 ms 3616 KB Time limit exceeded
38 Correct 766 ms 4244 KB Output is correct
39 Execution timed out 1579 ms 3216 KB Time limit exceeded
40 Correct 9 ms 3180 KB Output is correct
41 Execution timed out 1533 ms 3428 KB Time limit exceeded
42 Correct 161 ms 3436 KB Output is correct
43 Correct 375 ms 3564 KB Output is correct
44 Correct 418 ms 4108 KB Output is correct
45 Execution timed out 1586 ms 3692 KB Time limit exceeded
46 Execution timed out 1572 ms 4332 KB Time limit exceeded
47 Correct 712 ms 4376 KB Output is correct
48 Correct 662 ms 4376 KB Output is correct
49 Execution timed out 1571 ms 4332 KB Time limit exceeded
50 Execution timed out 1550 ms 3180 KB Time limit exceeded