oj.uz

답안 #345381

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
345381 2021-01-07T08:16:42 Z vonatlus 결혼 문제 (IZhO14_marriage) C++14
52 / 100
 1500 ms 53188 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 = 1e6+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;
        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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 43 ms 51180 KB Output isn't correct
2 Incorrect 36 ms 51180 KB Output isn't correct
3 Incorrect 36 ms 51180 KB Output isn't correct
4 Incorrect 38 ms 51180 KB Output isn't correct
5 Correct 36 ms 51180 KB Output is correct
6 Correct 34 ms 51288 KB Output is correct
7 Incorrect 35 ms 51180 KB Output isn't correct
8 Correct 38 ms 51180 KB Output is correct
9 Correct 34 ms 51180 KB Output is correct
10 Correct 38 ms 51180 KB Output is correct
11 Correct 35 ms 51180 KB Output is correct
12 Correct 36 ms 51180 KB Output is correct
13 Correct 46 ms 51180 KB Output is correct
14 Incorrect 39 ms 51180 KB Output isn't correct
15 Incorrect 34 ms 51180 KB Output isn't correct
16 Incorrect 35 ms 51180 KB Output isn't correct
17 Correct 36 ms 51192 KB Output is correct
18 Correct 43 ms 51180 KB Output is correct
19 Incorrect 44 ms 51308 KB Output isn't correct
20 Incorrect 35 ms 51180 KB Output isn't correct
21 Correct 34 ms 51220 KB Output is correct
22 Incorrect 35 ms 51180 KB Output isn't correct
23 Correct 37 ms 51284 KB Output is correct
24 Correct 39 ms 51180 KB Output is correct
25 Incorrect 130 ms 51444 KB Output isn't correct
26 Incorrect 54 ms 51328 KB Output isn't correct
27 Correct 43 ms 51312 KB Output is correct
28 Incorrect 45 ms 51180 KB Output isn't correct
29 Correct 79 ms 51320 KB Output is correct
30 Correct 75 ms 51400 KB Output is correct
31 Incorrect 928 ms 51920 KB Output isn't correct
32 Incorrect 105 ms 51436 KB Output isn't correct
33 Correct 44 ms 51308 KB Output is correct
34 Incorrect 38 ms 51272 KB Output isn't correct
35 Correct 1420 ms 52364 KB Output is correct
36 Correct 944 ms 52332 KB Output is correct
37 Execution timed out 1593 ms 52040 KB Time limit exceeded
38 Correct 813 ms 52588 KB Output is correct
39 Incorrect 44 ms 51436 KB Output isn't correct
40 Correct 43 ms 51564 KB Output is correct
41 Incorrect 122 ms 51820 KB Output isn't correct
42 Correct 199 ms 51820 KB Output is correct
43 Correct 350 ms 51948 KB Output is correct
44 Correct 317 ms 52332 KB Output is correct
45 Execution timed out 1553 ms 52076 KB Time limit exceeded
46 Execution timed out 1576 ms 53060 KB Time limit exceeded
47 Correct 696 ms 52716 KB Output is correct
48 Correct 704 ms 52844 KB Output is correct
49 Execution timed out 1562 ms 53188 KB Time limit exceeded
50 Incorrect 36 ms 51340 KB Output isn't correct