oj.uz

Submission #45918

# Submission time Handle Problem Language Result Execution time Memory
45918 2018-04-16T13:28:44 Z golub Port Facility (JOI17_port_facility) C++14
100 / 100
 5917 ms 293216 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse4")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("unroll-all-loops")

#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;

using namespace std;

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

//char buf[(int)1e9];
//size_t p_ = 0;
//
//inline void *operator new(size_t n_) {
//    p_ += n_;
//    return buf + p_ - n_;
//}
//inline void operator delete(void*) {};


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<int> used;
unordered_map<int, int> num1, num2;
seg_max seg_ma;
seg_min seg_mi;

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);
        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);
        seg_mi.update(a[p].S, INF);
    }
    for (auto x: next) {
        solve(x, color % 2 + 1);
    }
}

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 == //
    int n;
    cin >> n;
    
    a.resize(n);
    used.resize(n);
    seg_mi = seg_min(2 * n);
    seg_ma = seg_max(2 * n);
    
    for (int i = 0; i < n; i++) {
        pii x;
        cin >> 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);
    }
    ll ans = 1;
    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';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 2 ms 676 KB Output is correct
11 Correct 2 ms 676 KB Output is correct
12 Correct 2 ms 676 KB Output is correct
13 Correct 2 ms 676 KB Output is correct
14 Correct 2 ms 676 KB Output is correct
15 Correct 2 ms 676 KB Output is correct
16 Correct 2 ms 676 KB Output is correct
17 Correct 2 ms 676 KB Output is correct
18 Correct 2 ms 676 KB Output is correct
19 Correct 2 ms 676 KB Output is correct
20 Correct 2 ms 676 KB Output is correct
21 Correct 2 ms 676 KB Output is correct
22 Correct 2 ms 676 KB Output is correct
23 Correct 2 ms 676 KB Output is correct
24 Correct 2 ms 676 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 2 ms 676 KB Output is correct
11 Correct 2 ms 676 KB Output is correct
12 Correct 2 ms 676 KB Output is correct
13 Correct 2 ms 676 KB Output is correct
14 Correct 2 ms 676 KB Output is correct
15 Correct 2 ms 676 KB Output is correct
16 Correct 2 ms 676 KB Output is correct
17 Correct 2 ms 676 KB Output is correct
18 Correct 2 ms 676 KB Output is correct
19 Correct 2 ms 676 KB Output is correct
20 Correct 2 ms 676 KB Output is correct
21 Correct 2 ms 676 KB Output is correct
22 Correct 2 ms 676 KB Output is correct
23 Correct 2 ms 676 KB Output is correct
24 Correct 2 ms 676 KB Output is correct
25 Correct 6 ms 892 KB Output is correct
26 Correct 9 ms 892 KB Output is correct
27 Correct 7 ms 892 KB Output is correct
28 Correct 6 ms 892 KB Output is correct
29 Correct 6 ms 892 KB Output is correct
30 Correct 6 ms 892 KB Output is correct
31 Correct 9 ms 892 KB Output is correct
32 Correct 9 ms 900 KB Output is correct
33 Correct 6 ms 900 KB Output is correct
34 Correct 5 ms 900 KB Output is correct
35 Correct 5 ms 900 KB Output is correct
36 Correct 6 ms 900 KB Output is correct
37 Correct 5 ms 900 KB Output is correct
38 Correct 4 ms 900 KB Output is correct
39 Correct 7 ms 900 KB Output is correct
40 Correct 6 ms 900 KB Output is correct
41 Correct 5 ms 900 KB Output is correct
42 Correct 8 ms 900 KB Output is correct
43 Correct 8 ms 1148 KB Output is correct
44 Correct 5 ms 1168 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 2 ms 676 KB Output is correct
11 Correct 2 ms 676 KB Output is correct
12 Correct 2 ms 676 KB Output is correct
13 Correct 2 ms 676 KB Output is correct
14 Correct 2 ms 676 KB Output is correct
15 Correct 2 ms 676 KB Output is correct
16 Correct 2 ms 676 KB Output is correct
17 Correct 2 ms 676 KB Output is correct
18 Correct 2 ms 676 KB Output is correct
19 Correct 2 ms 676 KB Output is correct
20 Correct 2 ms 676 KB Output is correct
21 Correct 2 ms 676 KB Output is correct
22 Correct 2 ms 676 KB Output is correct
23 Correct 2 ms 676 KB Output is correct
24 Correct 2 ms 676 KB Output is correct
25 Correct 6 ms 892 KB Output is correct
26 Correct 9 ms 892 KB Output is correct
27 Correct 7 ms 892 KB Output is correct
28 Correct 6 ms 892 KB Output is correct
29 Correct 6 ms 892 KB Output is correct
30 Correct 6 ms 892 KB Output is correct
31 Correct 9 ms 892 KB Output is correct
32 Correct 9 ms 900 KB Output is correct
33 Correct 6 ms 900 KB Output is correct
34 Correct 5 ms 900 KB Output is correct
35 Correct 5 ms 900 KB Output is correct
36 Correct 6 ms 900 KB Output is correct
37 Correct 5 ms 900 KB Output is correct
38 Correct 4 ms 900 KB Output is correct
39 Correct 7 ms 900 KB Output is correct
40 Correct 6 ms 900 KB Output is correct
41 Correct 5 ms 900 KB Output is correct
42 Correct 8 ms 900 KB Output is correct
43 Correct 8 ms 1148 KB Output is correct
44 Correct 5 ms 1168 KB Output is correct
45 Correct 429 ms 14128 KB Output is correct
46 Correct 478 ms 14128 KB Output is correct
47 Correct 399 ms 14128 KB Output is correct
48 Correct 409 ms 14180 KB Output is correct
49 Correct 410 ms 14180 KB Output is correct
50 Correct 211 ms 14180 KB Output is correct
51 Correct 216 ms 14180 KB Output is correct
52 Correct 316 ms 14180 KB Output is correct
53 Correct 313 ms 14180 KB Output is correct
54 Correct 258 ms 14692 KB Output is correct
55 Correct 235 ms 14692 KB Output is correct
56 Correct 264 ms 14692 KB Output is correct
57 Correct 374 ms 14692 KB Output is correct
58 Correct 298 ms 14692 KB Output is correct
59 Correct 326 ms 14692 KB Output is correct
60 Correct 375 ms 14692 KB Output is correct
61 Correct 369 ms 14692 KB Output is correct
62 Correct 214 ms 14692 KB Output is correct
63 Correct 181 ms 14692 KB Output is correct
64 Correct 191 ms 14692 KB Output is correct
65 Correct 237 ms 14692 KB Output is correct
66 Correct 249 ms 14692 KB Output is correct
67 Correct 349 ms 14692 KB Output is correct
68 Correct 385 ms 14692 KB Output is correct
69 Correct 345 ms 14716 KB Output is correct
70 Correct 378 ms 14716 KB Output is correct
71 Correct 329 ms 14716 KB Output is correct
72 Correct 321 ms 14716 KB Output is correct
73 Correct 405 ms 14716 KB Output is correct
74 Correct 358 ms 14756 KB Output is correct
75 Correct 356 ms 23180 KB Output is correct
76 Correct 376 ms 29468 KB Output is correct
77 Correct 415 ms 29668 KB Output is correct
78 Correct 414 ms 29668 KB Output is correct
79 Correct 413 ms 29668 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 2 ms 676 KB Output is correct
11 Correct 2 ms 676 KB Output is correct
12 Correct 2 ms 676 KB Output is correct
13 Correct 2 ms 676 KB Output is correct
14 Correct 2 ms 676 KB Output is correct
15 Correct 2 ms 676 KB Output is correct
16 Correct 2 ms 676 KB Output is correct
17 Correct 2 ms 676 KB Output is correct
18 Correct 2 ms 676 KB Output is correct
19 Correct 2 ms 676 KB Output is correct
20 Correct 2 ms 676 KB Output is correct
21 Correct 2 ms 676 KB Output is correct
22 Correct 2 ms 676 KB Output is correct
23 Correct 2 ms 676 KB Output is correct
24 Correct 2 ms 676 KB Output is correct
25 Correct 6 ms 892 KB Output is correct
26 Correct 9 ms 892 KB Output is correct
27 Correct 7 ms 892 KB Output is correct
28 Correct 6 ms 892 KB Output is correct
29 Correct 6 ms 892 KB Output is correct
30 Correct 6 ms 892 KB Output is correct
31 Correct 9 ms 892 KB Output is correct
32 Correct 9 ms 900 KB Output is correct
33 Correct 6 ms 900 KB Output is correct
34 Correct 5 ms 900 KB Output is correct
35 Correct 5 ms 900 KB Output is correct
36 Correct 6 ms 900 KB Output is correct
37 Correct 5 ms 900 KB Output is correct
38 Correct 4 ms 900 KB Output is correct
39 Correct 7 ms 900 KB Output is correct
40 Correct 6 ms 900 KB Output is correct
41 Correct 5 ms 900 KB Output is correct
42 Correct 8 ms 900 KB Output is correct
43 Correct 8 ms 1148 KB Output is correct
44 Correct 5 ms 1168 KB Output is correct
45 Correct 429 ms 14128 KB Output is correct
46 Correct 478 ms 14128 KB Output is correct
47 Correct 399 ms 14128 KB Output is correct
48 Correct 409 ms 14180 KB Output is correct
49 Correct 410 ms 14180 KB Output is correct
50 Correct 211 ms 14180 KB Output is correct
51 Correct 216 ms 14180 KB Output is correct
52 Correct 316 ms 14180 KB Output is correct
53 Correct 313 ms 14180 KB Output is correct
54 Correct 258 ms 14692 KB Output is correct
55 Correct 235 ms 14692 KB Output is correct
56 Correct 264 ms 14692 KB Output is correct
57 Correct 374 ms 14692 KB Output is correct
58 Correct 298 ms 14692 KB Output is correct
59 Correct 326 ms 14692 KB Output is correct
60 Correct 375 ms 14692 KB Output is correct
61 Correct 369 ms 14692 KB Output is correct
62 Correct 214 ms 14692 KB Output is correct
63 Correct 181 ms 14692 KB Output is correct
64 Correct 191 ms 14692 KB Output is correct
65 Correct 237 ms 14692 KB Output is correct
66 Correct 249 ms 14692 KB Output is correct
67 Correct 349 ms 14692 KB Output is correct
68 Correct 385 ms 14692 KB Output is correct
69 Correct 345 ms 14716 KB Output is correct
70 Correct 378 ms 14716 KB Output is correct
71 Correct 329 ms 14716 KB Output is correct
72 Correct 321 ms 14716 KB Output is correct
73 Correct 405 ms 14716 KB Output is correct
74 Correct 358 ms 14756 KB Output is correct
75 Correct 356 ms 23180 KB Output is correct
76 Correct 376 ms 29468 KB Output is correct
77 Correct 415 ms 29668 KB Output is correct
78 Correct 414 ms 29668 KB Output is correct
79 Correct 413 ms 29668 KB Output is correct
80 Correct 5405 ms 137784 KB Output is correct
81 Correct 5266 ms 137840 KB Output is correct
82 Correct 5214 ms 137840 KB Output is correct
83 Correct 5198 ms 137840 KB Output is correct
84 Correct 5138 ms 137840 KB Output is correct
85 Correct 3067 ms 137840 KB Output is correct
86 Correct 3046 ms 137840 KB Output is correct
87 Correct 4166 ms 137840 KB Output is correct
88 Correct 4769 ms 137840 KB Output is correct
89 Correct 3397 ms 144620 KB Output is correct
90 Correct 3279 ms 144620 KB Output is correct
91 Correct 3304 ms 144620 KB Output is correct
92 Correct 5206 ms 144620 KB Output is correct
93 Correct 5134 ms 144620 KB Output is correct
94 Correct 5689 ms 144620 KB Output is correct
95 Correct 5917 ms 144620 KB Output is correct
96 Correct 5757 ms 144620 KB Output is correct
97 Correct 3347 ms 144620 KB Output is correct
98 Correct 3273 ms 144620 KB Output is correct
99 Correct 3375 ms 144620 KB Output is correct
100 Correct 3847 ms 144620 KB Output is correct
101 Correct 3531 ms 144620 KB Output is correct
102 Correct 5025 ms 144620 KB Output is correct
103 Correct 4978 ms 144620 KB Output is correct
104 Correct 5062 ms 144620 KB Output is correct
105 Correct 5344 ms 144620 KB Output is correct
106 Correct 4965 ms 144620 KB Output is correct
107 Correct 4745 ms 144620 KB Output is correct
108 Correct 4765 ms 144684 KB Output is correct
109 Correct 4658 ms 144684 KB Output is correct
110 Correct 4606 ms 290104 KB Output is correct
111 Correct 4539 ms 293200 KB Output is correct
112 Correct 4523 ms 293216 KB Output is correct
113 Correct 5256 ms 293216 KB Output is correct
114 Correct 5223 ms 293216 KB Output is correct