oj.uz

Submission #45915

# Submission time Handle Problem Language Result Execution time Memory
45915 2018-04-16T13:20:54 Z golub Port Facility (JOI17_port_facility) C++11
100 / 100
 5194 ms 333044 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse4")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("unroll-all-loops")

#include<cstring>
#include<iostream>

using namespace std;

char buf[(long long)5e8];
size_t p_ = 0;

void *operator new(size_t n_) {
    p_ += n_;
    return buf + p_ - n_;
}
void operator delete(void*) {};

#include <bits/stdc++.h>

//#define TASK "lca"

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define pb push_back
//#define int long long
#define pii pair<int, int>

//typedef long long ll;
//typedef long double ld;



const int INF = 1e9 + 100;
const int MAXN = 1e6 * 2;
const int MOD = 1e9 + 7;
const double EPS = 1e-12;

//ll power(ll x, ll n, ll mod = 1e9 + 7) {
//    if (n == 0) return 1ll;
//    if (n & 1ll) return power(x, n - 1ll, mod) * x % mod;
//    ll tmp = power(x, n >> 1ll, mod);
//    return (tmp * tmp) % mod;
//}
//
//ll gcd(ll a, ll b) {
//    if (b == 0) return a;
//    return gcd (b, a % b);
//}
//
//ll lcm(ll a, ll b) {
//    return a / gcd(a, b) * b;
//}

struct seg_max {
    vector<int> d;
    int SZ = 1;
    
    seg_max(int n = 0) {
        while(SZ < n) SZ *= 2;
        d.resize(SZ * 2, -INF);
    }
    
    void update(int x, int dx, int v, int l, int r) {
        if (x < l || x >= r) return;
        if (l + 1 >= r) {
            d[v] = dx;
            return;
        }
        int c = (r + l) / 2;
        update(x, dx, v * 2 + 1, l, c);
        update(x, dx, v * 2 + 2, c, r);
        d[v] = max(d[v * 2 + 1], d[v * 2 + 2]);
    }
    
    void update(int x, int dx) {
        update(x, dx, 0, 0, SZ);
    }
    
    int query(int ql, int qr, int v, int l, int r) {
        if (qr <= l || r <= ql) return -INF;
        if (ql <= l && r <= qr) return d[v];
        int c = (l + r) / 2;
        return max(query(ql, qr, 2 * v + 1, l, c), query(ql, qr, 2 * v + 2, c, r));
    }
    
    int query(int ql, int qr) {
        return query(ql, qr, 0, 0, SZ);
    }
};

struct seg_min {
    vector<int> d;
    int SZ = 1;
    
    seg_min(int n = 0) {
        while(SZ < n) SZ *= 2;
        d.resize(SZ * 2, INF);
    }
    
    void update(int x, int dx, int v, int l, int r) {
        if (x < l || x >= r) return;
        if (l + 1 >= r) {
            d[v] = dx;
            return;
        }
        int c = (r + l) / 2;
        update(x, dx, v * 2 + 1, l, c);
        update(x, dx, v * 2 + 2, c, r);
        d[v] = min(d[v * 2 + 1], d[v * 2 + 2]);
    }
    
    void update(int x, int dx) {
        update(x, dx, 0, 0, SZ);
    }
    
    int query(int ql, int qr, int v, int l, int r) {
        if (qr <= l || r <= ql) return INF;
        if (ql <= l && r <= qr) return d[v];
        int c = (l + r) / 2;
        return min(query(ql, qr, 2 * v + 1, l, c), query(ql, qr, 2 * v + 2, c, r));
    }
    
    int query(int ql, int qr) {
        return query(ql, qr, 0, 0, SZ);
    }
};

vector<pair<int, int>> a;
vector<vector<int>> g;
vector<int> used;
unordered_map<int, int> num1, num2;
seg_max seg_ma(MAXN);
seg_min seg_mi(MAXN);

void solve(int i, int color = 1) {
    seg_ma.update(a[i].F, -INF);
    seg_mi.update(a[i].S, INF);
    used[i] = color;
    
    vector<int> next;
    int l = a[i].F;
    int r = a[i].S;
    int ans = INF;
    while (ans > r) {
        ans = seg_ma.query(l, r + 1);
        if (ans <= r) break;
        int p = num1[ans];
        if (used[p] && used[p] == color) {
            cout << 0 << '\n';
            exit(0);
        }
        used[p] = color % 2 + 1;
        next.pb(p);
//        if (!used[p]) {
//            g[i].pb(p);
//            g[p].pb(i);
//
//        }
        seg_ma.update(a[p].F, -INF);
    }
    ans = -INF;
    while (ans < l) {
        ans = seg_mi.query(l, r + 1);
        if (ans >= l) break;
        int p = num2[ans];
        
        if (used[p] && used[p] == color) {
            cout << 0 << '\n';
            exit(0);
        }
        used[p] = color % 2 + 1;
        next.pb(p);
//        if (!used[p]) {
//            g[i].pb(p);
//            g[p].pb(i);
//
//        }
        seg_mi.update(a[p].S, INF);
    }
    for (auto x: next) {
        solve(x, color % 2 + 1);
    }
}

void dfs(int v, int color = 1) {
    used[v] = color;
    for (auto u: g[v]) {
        if (u != v && used[u] && used[u] == color) {
            cout << 0 << "\n";
            exit(0);
        }
        if (!used[u]) dfs(u, color % 2 + 1);
    }
}

int n;
int ans = 1ll;

signed main() {
#ifndef LOCAL
#ifdef TASK
    freopen(TASK".in", "r", stdin);
    freopen(TASK".out", "w", stdout);
#endif
#endif
#ifdef LOCAL
    //freopen("/Users/alekseygolub/Desktop/с++/ABS/ABS/input.txt", "r", stdin);
#endif
    iostream::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    srand(924653523);
    // == SOLUTION == //
    scanf("%d", &n);
    
    a.resize(n);
    used.resize(n);
    g.resize(n);
    
    for (int i = 0; i < n; i++) {
        pair<int, int> x;
        scanf("%d%d", &x.F, &x.S);
        x.F--; x.S--;
        a[i] = x;
        num1[x.S] = i;
        num2[x.F] = i;
        seg_ma.update(x.F, x.S);
        seg_mi.update(x.S, x.F);
    }
    for (int i = 0; i < n; i++) {
        if (!used[i]) {
            solve(i);
            ans = ans << 1ll;
            ans %= MOD;
        }
    }
//    fill(all(used), 0);
//    for (int i = 0; i < n; i++) {
//        if (!used[i]) {
//            dfs(i);
//        }
//    }
    cout << ans << '\n';
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:218:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
port_facility.cpp:226:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &x.F, &x.S);
         ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 33144 KB Output is correct
2 Correct 26 ms 33300 KB Output is correct
3 Correct 27 ms 33368 KB Output is correct
4 Correct 29 ms 33368 KB Output is correct
5 Correct 25 ms 33368 KB Output is correct
6 Correct 30 ms 33368 KB Output is correct
7 Correct 30 ms 33436 KB Output is correct
8 Correct 25 ms 33436 KB Output is correct
9 Correct 25 ms 33444 KB Output is correct
10 Correct 26 ms 33520 KB Output is correct
11 Correct 29 ms 33548 KB Output is correct
12 Correct 25 ms 33548 KB Output is correct
13 Correct 25 ms 33548 KB Output is correct
14 Correct 31 ms 33564 KB Output is correct
15 Correct 26 ms 33564 KB Output is correct
16 Correct 31 ms 33564 KB Output is correct
17 Correct 28 ms 33564 KB Output is correct
18 Correct 25 ms 33564 KB Output is correct
19 Correct 25 ms 33564 KB Output is correct
20 Correct 25 ms 33580 KB Output is correct
21 Correct 27 ms 33580 KB Output is correct
22 Correct 25 ms 33580 KB Output is correct
23 Correct 27 ms 33580 KB Output is correct
24 Correct 32 ms 33580 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 33144 KB Output is correct
2 Correct 26 ms 33300 KB Output is correct
3 Correct 27 ms 33368 KB Output is correct
4 Correct 29 ms 33368 KB Output is correct
5 Correct 25 ms 33368 KB Output is correct
6 Correct 30 ms 33368 KB Output is correct
7 Correct 30 ms 33436 KB Output is correct
8 Correct 25 ms 33436 KB Output is correct
9 Correct 25 ms 33444 KB Output is correct
10 Correct 26 ms 33520 KB Output is correct
11 Correct 29 ms 33548 KB Output is correct
12 Correct 25 ms 33548 KB Output is correct
13 Correct 25 ms 33548 KB Output is correct
14 Correct 31 ms 33564 KB Output is correct
15 Correct 26 ms 33564 KB Output is correct
16 Correct 31 ms 33564 KB Output is correct
17 Correct 28 ms 33564 KB Output is correct
18 Correct 25 ms 33564 KB Output is correct
19 Correct 25 ms 33564 KB Output is correct
20 Correct 25 ms 33580 KB Output is correct
21 Correct 27 ms 33580 KB Output is correct
22 Correct 25 ms 33580 KB Output is correct
23 Correct 27 ms 33580 KB Output is correct
24 Correct 32 ms 33580 KB Output is correct
25 Correct 33 ms 33708 KB Output is correct
26 Correct 39 ms 33708 KB Output is correct
27 Correct 34 ms 33708 KB Output is correct
28 Correct 35 ms 33708 KB Output is correct
29 Correct 32 ms 33708 KB Output is correct
30 Correct 30 ms 33708 KB Output is correct
31 Correct 31 ms 33712 KB Output is correct
32 Correct 31 ms 33712 KB Output is correct
33 Correct 28 ms 33712 KB Output is correct
34 Correct 28 ms 33712 KB Output is correct
35 Correct 29 ms 33712 KB Output is correct
36 Correct 34 ms 33712 KB Output is correct
37 Correct 29 ms 33712 KB Output is correct
38 Correct 34 ms 33712 KB Output is correct
39 Correct 29 ms 33712 KB Output is correct
40 Correct 28 ms 33712 KB Output is correct
41 Correct 38 ms 33712 KB Output is correct
42 Correct 29 ms 33712 KB Output is correct
43 Correct 30 ms 33968 KB Output is correct
44 Correct 34 ms 33968 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 33144 KB Output is correct
2 Correct 26 ms 33300 KB Output is correct
3 Correct 27 ms 33368 KB Output is correct
4 Correct 29 ms 33368 KB Output is correct
5 Correct 25 ms 33368 KB Output is correct
6 Correct 30 ms 33368 KB Output is correct
7 Correct 30 ms 33436 KB Output is correct
8 Correct 25 ms 33436 KB Output is correct
9 Correct 25 ms 33444 KB Output is correct
10 Correct 26 ms 33520 KB Output is correct
11 Correct 29 ms 33548 KB Output is correct
12 Correct 25 ms 33548 KB Output is correct
13 Correct 25 ms 33548 KB Output is correct
14 Correct 31 ms 33564 KB Output is correct
15 Correct 26 ms 33564 KB Output is correct
16 Correct 31 ms 33564 KB Output is correct
17 Correct 28 ms 33564 KB Output is correct
18 Correct 25 ms 33564 KB Output is correct
19 Correct 25 ms 33564 KB Output is correct
20 Correct 25 ms 33580 KB Output is correct
21 Correct 27 ms 33580 KB Output is correct
22 Correct 25 ms 33580 KB Output is correct
23 Correct 27 ms 33580 KB Output is correct
24 Correct 32 ms 33580 KB Output is correct
25 Correct 33 ms 33708 KB Output is correct
26 Correct 39 ms 33708 KB Output is correct
27 Correct 34 ms 33708 KB Output is correct
28 Correct 35 ms 33708 KB Output is correct
29 Correct 32 ms 33708 KB Output is correct
30 Correct 30 ms 33708 KB Output is correct
31 Correct 31 ms 33712 KB Output is correct
32 Correct 31 ms 33712 KB Output is correct
33 Correct 28 ms 33712 KB Output is correct
34 Correct 28 ms 33712 KB Output is correct
35 Correct 29 ms 33712 KB Output is correct
36 Correct 34 ms 33712 KB Output is correct
37 Correct 29 ms 33712 KB Output is correct
38 Correct 34 ms 33712 KB Output is correct
39 Correct 29 ms 33712 KB Output is correct
40 Correct 28 ms 33712 KB Output is correct
41 Correct 38 ms 33712 KB Output is correct
42 Correct 29 ms 33712 KB Output is correct
43 Correct 30 ms 33968 KB Output is correct
44 Correct 34 ms 33968 KB Output is correct
45 Correct 464 ms 45024 KB Output is correct
46 Correct 376 ms 45024 KB Output is correct
47 Correct 420 ms 45024 KB Output is correct
48 Correct 438 ms 45024 KB Output is correct
49 Correct 414 ms 45024 KB Output is correct
50 Correct 268 ms 45024 KB Output is correct
51 Correct 207 ms 45024 KB Output is correct
52 Correct 362 ms 45024 KB Output is correct
53 Correct 384 ms 45024 KB Output is correct
54 Correct 223 ms 45616 KB Output is correct
55 Correct 250 ms 45616 KB Output is correct
56 Correct 254 ms 45616 KB Output is correct
57 Correct 343 ms 45616 KB Output is correct
58 Correct 332 ms 45616 KB Output is correct
59 Correct 427 ms 45616 KB Output is correct
60 Correct 408 ms 45616 KB Output is correct
61 Correct 398 ms 45764 KB Output is correct
62 Correct 245 ms 45764 KB Output is correct
63 Correct 249 ms 45764 KB Output is correct
64 Correct 259 ms 45764 KB Output is correct
65 Correct 240 ms 45828 KB Output is correct
66 Correct 289 ms 45828 KB Output is correct
67 Correct 381 ms 46184 KB Output is correct
68 Correct 352 ms 46184 KB Output is correct
69 Correct 403 ms 46340 KB Output is correct
70 Correct 393 ms 46568 KB Output is correct
71 Correct 398 ms 46568 KB Output is correct
72 Correct 343 ms 46568 KB Output is correct
73 Correct 381 ms 46568 KB Output is correct
74 Correct 370 ms 46568 KB Output is correct
75 Correct 351 ms 54120 KB Output is correct
76 Correct 360 ms 59656 KB Output is correct
77 Correct 349 ms 59764 KB Output is correct
78 Correct 413 ms 59764 KB Output is correct
79 Correct 387 ms 59764 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 33144 KB Output is correct
2 Correct 26 ms 33300 KB Output is correct
3 Correct 27 ms 33368 KB Output is correct
4 Correct 29 ms 33368 KB Output is correct
5 Correct 25 ms 33368 KB Output is correct
6 Correct 30 ms 33368 KB Output is correct
7 Correct 30 ms 33436 KB Output is correct
8 Correct 25 ms 33436 KB Output is correct
9 Correct 25 ms 33444 KB Output is correct
10 Correct 26 ms 33520 KB Output is correct
11 Correct 29 ms 33548 KB Output is correct
12 Correct 25 ms 33548 KB Output is correct
13 Correct 25 ms 33548 KB Output is correct
14 Correct 31 ms 33564 KB Output is correct
15 Correct 26 ms 33564 KB Output is correct
16 Correct 31 ms 33564 KB Output is correct
17 Correct 28 ms 33564 KB Output is correct
18 Correct 25 ms 33564 KB Output is correct
19 Correct 25 ms 33564 KB Output is correct
20 Correct 25 ms 33580 KB Output is correct
21 Correct 27 ms 33580 KB Output is correct
22 Correct 25 ms 33580 KB Output is correct
23 Correct 27 ms 33580 KB Output is correct
24 Correct 32 ms 33580 KB Output is correct
25 Correct 33 ms 33708 KB Output is correct
26 Correct 39 ms 33708 KB Output is correct
27 Correct 34 ms 33708 KB Output is correct
28 Correct 35 ms 33708 KB Output is correct
29 Correct 32 ms 33708 KB Output is correct
30 Correct 30 ms 33708 KB Output is correct
31 Correct 31 ms 33712 KB Output is correct
32 Correct 31 ms 33712 KB Output is correct
33 Correct 28 ms 33712 KB Output is correct
34 Correct 28 ms 33712 KB Output is correct
35 Correct 29 ms 33712 KB Output is correct
36 Correct 34 ms 33712 KB Output is correct
37 Correct 29 ms 33712 KB Output is correct
38 Correct 34 ms 33712 KB Output is correct
39 Correct 29 ms 33712 KB Output is correct
40 Correct 28 ms 33712 KB Output is correct
41 Correct 38 ms 33712 KB Output is correct
42 Correct 29 ms 33712 KB Output is correct
43 Correct 30 ms 33968 KB Output is correct
44 Correct 34 ms 33968 KB Output is correct
45 Correct 464 ms 45024 KB Output is correct
46 Correct 376 ms 45024 KB Output is correct
47 Correct 420 ms 45024 KB Output is correct
48 Correct 438 ms 45024 KB Output is correct
49 Correct 414 ms 45024 KB Output is correct
50 Correct 268 ms 45024 KB Output is correct
51 Correct 207 ms 45024 KB Output is correct
52 Correct 362 ms 45024 KB Output is correct
53 Correct 384 ms 45024 KB Output is correct
54 Correct 223 ms 45616 KB Output is correct
55 Correct 250 ms 45616 KB Output is correct
56 Correct 254 ms 45616 KB Output is correct
57 Correct 343 ms 45616 KB Output is correct
58 Correct 332 ms 45616 KB Output is correct
59 Correct 427 ms 45616 KB Output is correct
60 Correct 408 ms 45616 KB Output is correct
61 Correct 398 ms 45764 KB Output is correct
62 Correct 245 ms 45764 KB Output is correct
63 Correct 249 ms 45764 KB Output is correct
64 Correct 259 ms 45764 KB Output is correct
65 Correct 240 ms 45828 KB Output is correct
66 Correct 289 ms 45828 KB Output is correct
67 Correct 381 ms 46184 KB Output is correct
68 Correct 352 ms 46184 KB Output is correct
69 Correct 403 ms 46340 KB Output is correct
70 Correct 393 ms 46568 KB Output is correct
71 Correct 398 ms 46568 KB Output is correct
72 Correct 343 ms 46568 KB Output is correct
73 Correct 381 ms 46568 KB Output is correct
74 Correct 370 ms 46568 KB Output is correct
75 Correct 351 ms 54120 KB Output is correct
76 Correct 360 ms 59656 KB Output is correct
77 Correct 349 ms 59764 KB Output is correct
78 Correct 413 ms 59764 KB Output is correct
79 Correct 387 ms 59764 KB Output is correct
80 Correct 4872 ms 166968 KB Output is correct
81 Correct 4718 ms 166968 KB Output is correct
82 Correct 4619 ms 166968 KB Output is correct
83 Correct 4723 ms 166968 KB Output is correct
84 Correct 4965 ms 166968 KB Output is correct
85 Correct 2696 ms 166968 KB Output is correct
86 Correct 2833 ms 166968 KB Output is correct
87 Correct 3888 ms 166968 KB Output is correct
88 Correct 4468 ms 166968 KB Output is correct
89 Correct 3203 ms 166968 KB Output is correct
90 Correct 3064 ms 166968 KB Output is correct
91 Correct 3413 ms 166968 KB Output is correct
92 Correct 4561 ms 166968 KB Output is correct
93 Correct 4802 ms 166968 KB Output is correct
94 Correct 5138 ms 166968 KB Output is correct
95 Correct 5194 ms 166968 KB Output is correct
96 Correct 5091 ms 166968 KB Output is correct
97 Correct 2749 ms 166968 KB Output is correct
98 Correct 2675 ms 166968 KB Output is correct
99 Correct 2727 ms 166968 KB Output is correct
100 Correct 3200 ms 166968 KB Output is correct
101 Correct 3273 ms 166968 KB Output is correct
102 Correct 4581 ms 167336 KB Output is correct
103 Correct 4706 ms 167336 KB Output is correct
104 Correct 4649 ms 167932 KB Output is correct
105 Correct 4937 ms 168272 KB Output is correct
106 Correct 4501 ms 168272 KB Output is correct
107 Correct 4399 ms 168272 KB Output is correct
108 Correct 4399 ms 169104 KB Output is correct
109 Correct 4280 ms 169200 KB Output is correct
110 Correct 4082 ms 301088 KB Output is correct
111 Correct 3917 ms 318580 KB Output is correct
112 Correct 3948 ms 333044 KB Output is correct
113 Correct 4641 ms 333044 KB Output is correct
114 Correct 4663 ms 333044 KB Output is correct