oj.uz

Submission #57667

# Submission time Handle Problem Language Result Execution time Memory
57667 2018-07-15T18:48:36 Z Benq Port Facility (JOI17_port_facility) C++14
100 / 100
 3491 ms 752648 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 1000001;

int N;
pi par[MX];
vi rap[MX][2];
map<int,int> M[MX];
vpi p;
map<int,int> m;

void input() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N; p.resize(N);
    m.clear();
    F0R(i,N) {
        F0R(j,2) rap[i][j].clear();
        M[i].clear();
    }
    F0R(i,N) {
        cin >> p[i].f >> p[i].s;
    }
    sort(all(p));
    F0R(i,N) {
        par[i] = {i,0};
        rap[i][0].pb(i);
        M[i][p[i].s] = i;
    }
}

void unite(int a, int b) {
    // cout << "AH " << a << " " << b << "\n";
    if (par[a].f == par[b].f) {
        if (par[a].s == par[b].s) {
            cout << 0;
            exit(0);
        }
        return;
    }
    bool eq = (par[a].s == par[b].s); 
    a = par[a].f, b = par[b].f;
    if (sz(rap[a][0])+sz(rap[a][1]) < sz(rap[b][0])+sz(rap[b][1])) swap(a,b);
    
    F0R(j,2) for (int i: rap[b][j]) {
        par[i] = {a,j^eq};
        rap[a][j^eq].pb(i);
        M[a][p[i].s] = i;
    }
    F0R(j,2) rap[b][j].clear();
    M[b].clear();
}

void del(int mn) {
    int x = par[m.begin()->s].f;
    m.erase(m.begin());
    auto IT = M[x].lb(mn);
    if (IT == M[x].end()) return;
    // cout << "OOPS " << x << " " << IT->f << " " << IT->s << "\n";
    m[IT->f] = IT->s;
}

void check(vi v) {
    sort(all(v));
    /*for (int i: v) cout << i << " * ";
    cout << "BAD\n";
    for (int i: v) cout << p[i].f << " " << p[i].s << " | ";
    cout << "\n";*/
    set<int> z;
    for (int i: v) {
        while (sz(z) && *z.begin() < p[i].f) z.erase(z.begin());
        if (sz(z) && *z.begin() < p[i].s) {
            // cout << "\nAH " << i << " " << p[i].f << " " << p[i].s << " " << *z.begin() << " " << sz(z) << "\n";
            cout << 0;
            exit(0);
        }
        z.insert(p[i].s);
    }
}

void solve() {
    input();
    F0R(i,sz(p)) {
        while (sz(m) && m.begin()->f < p[i].f) del(p[i].f);
        vi to;
        for (auto a: m) {
            if (a.f < p[i].s) to.pb(a.s);
            else break;
        }
        // for (int j: to) cout << p[j].f << " " << p[j].s << " " << j << " " << i << "\n";
        for (int j: to) {
            m.erase(p[j].s);
            unite(j,i);
        }
        to.pb(i);
        m[p[to.front()].s] = to.front();
    }
    int ans = 1;
    F0R(i,N) if (par[i].f == i) {
        ans = 2*ans%MOD;
        check(rap[i][0]);
        check(rap[i][1]);
    }
    cout << ans << "\n";
}

int main() {
    F0R(i,1) solve();
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 94200 KB Output is correct
2 Correct 99 ms 94460 KB Output is correct
3 Correct 94 ms 94460 KB Output is correct
4 Correct 99 ms 94524 KB Output is correct
5 Correct 96 ms 94524 KB Output is correct
6 Correct 92 ms 94524 KB Output is correct
7 Correct 94 ms 94524 KB Output is correct
8 Correct 99 ms 94608 KB Output is correct
9 Correct 104 ms 94720 KB Output is correct
10 Correct 102 ms 94720 KB Output is correct
11 Correct 98 ms 94720 KB Output is correct
12 Correct 96 ms 94720 KB Output is correct
13 Correct 99 ms 94720 KB Output is correct
14 Correct 105 ms 94720 KB Output is correct
15 Correct 93 ms 94720 KB Output is correct
16 Correct 98 ms 94720 KB Output is correct
17 Correct 100 ms 94720 KB Output is correct
18 Correct 103 ms 94720 KB Output is correct
19 Correct 93 ms 94720 KB Output is correct
20 Correct 100 ms 94720 KB Output is correct
21 Correct 97 ms 94720 KB Output is correct
22 Correct 100 ms 94720 KB Output is correct
23 Correct 106 ms 94720 KB Output is correct
24 Correct 96 ms 94720 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 94200 KB Output is correct
2 Correct 99 ms 94460 KB Output is correct
3 Correct 94 ms 94460 KB Output is correct
4 Correct 99 ms 94524 KB Output is correct
5 Correct 96 ms 94524 KB Output is correct
6 Correct 92 ms 94524 KB Output is correct
7 Correct 94 ms 94524 KB Output is correct
8 Correct 99 ms 94608 KB Output is correct
9 Correct 104 ms 94720 KB Output is correct
10 Correct 102 ms 94720 KB Output is correct
11 Correct 98 ms 94720 KB Output is correct
12 Correct 96 ms 94720 KB Output is correct
13 Correct 99 ms 94720 KB Output is correct
14 Correct 105 ms 94720 KB Output is correct
15 Correct 93 ms 94720 KB Output is correct
16 Correct 98 ms 94720 KB Output is correct
17 Correct 100 ms 94720 KB Output is correct
18 Correct 103 ms 94720 KB Output is correct
19 Correct 93 ms 94720 KB Output is correct
20 Correct 100 ms 94720 KB Output is correct
21 Correct 97 ms 94720 KB Output is correct
22 Correct 100 ms 94720 KB Output is correct
23 Correct 106 ms 94720 KB Output is correct
24 Correct 96 ms 94720 KB Output is correct
25 Correct 107 ms 94720 KB Output is correct
26 Correct 102 ms 94888 KB Output is correct
27 Correct 105 ms 94888 KB Output is correct
28 Correct 102 ms 94888 KB Output is correct
29 Correct 107 ms 94888 KB Output is correct
30 Correct 111 ms 94888 KB Output is correct
31 Correct 107 ms 94888 KB Output is correct
32 Correct 119 ms 94888 KB Output is correct
33 Correct 121 ms 94888 KB Output is correct
34 Correct 103 ms 94888 KB Output is correct
35 Correct 101 ms 94888 KB Output is correct
36 Correct 98 ms 94888 KB Output is correct
37 Correct 91 ms 94888 KB Output is correct
38 Correct 97 ms 94932 KB Output is correct
39 Correct 111 ms 94932 KB Output is correct
40 Correct 96 ms 94932 KB Output is correct
41 Correct 98 ms 94932 KB Output is correct
42 Correct 98 ms 94932 KB Output is correct
43 Correct 98 ms 94932 KB Output is correct
44 Correct 107 ms 94932 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 94200 KB Output is correct
2 Correct 99 ms 94460 KB Output is correct
3 Correct 94 ms 94460 KB Output is correct
4 Correct 99 ms 94524 KB Output is correct
5 Correct 96 ms 94524 KB Output is correct
6 Correct 92 ms 94524 KB Output is correct
7 Correct 94 ms 94524 KB Output is correct
8 Correct 99 ms 94608 KB Output is correct
9 Correct 104 ms 94720 KB Output is correct
10 Correct 102 ms 94720 KB Output is correct
11 Correct 98 ms 94720 KB Output is correct
12 Correct 96 ms 94720 KB Output is correct
13 Correct 99 ms 94720 KB Output is correct
14 Correct 105 ms 94720 KB Output is correct
15 Correct 93 ms 94720 KB Output is correct
16 Correct 98 ms 94720 KB Output is correct
17 Correct 100 ms 94720 KB Output is correct
18 Correct 103 ms 94720 KB Output is correct
19 Correct 93 ms 94720 KB Output is correct
20 Correct 100 ms 94720 KB Output is correct
21 Correct 97 ms 94720 KB Output is correct
22 Correct 100 ms 94720 KB Output is correct
23 Correct 106 ms 94720 KB Output is correct
24 Correct 96 ms 94720 KB Output is correct
25 Correct 107 ms 94720 KB Output is correct
26 Correct 102 ms 94888 KB Output is correct
27 Correct 105 ms 94888 KB Output is correct
28 Correct 102 ms 94888 KB Output is correct
29 Correct 107 ms 94888 KB Output is correct
30 Correct 111 ms 94888 KB Output is correct
31 Correct 107 ms 94888 KB Output is correct
32 Correct 119 ms 94888 KB Output is correct
33 Correct 121 ms 94888 KB Output is correct
34 Correct 103 ms 94888 KB Output is correct
35 Correct 101 ms 94888 KB Output is correct
36 Correct 98 ms 94888 KB Output is correct
37 Correct 91 ms 94888 KB Output is correct
38 Correct 97 ms 94932 KB Output is correct
39 Correct 111 ms 94932 KB Output is correct
40 Correct 96 ms 94932 KB Output is correct
41 Correct 98 ms 94932 KB Output is correct
42 Correct 98 ms 94932 KB Output is correct
43 Correct 98 ms 94932 KB Output is correct
44 Correct 107 ms 94932 KB Output is correct
45 Correct 297 ms 105300 KB Output is correct
46 Correct 284 ms 106904 KB Output is correct
47 Correct 299 ms 107832 KB Output is correct
48 Correct 279 ms 109476 KB Output is correct
49 Correct 340 ms 110496 KB Output is correct
50 Correct 281 ms 111768 KB Output is correct
51 Correct 298 ms 113220 KB Output is correct
52 Correct 216 ms 113220 KB Output is correct
53 Correct 264 ms 118752 KB Output is correct
54 Correct 278 ms 118752 KB Output is correct
55 Correct 256 ms 118752 KB Output is correct
56 Correct 222 ms 118820 KB Output is correct
57 Correct 258 ms 120848 KB Output is correct
58 Correct 230 ms 120848 KB Output is correct
59 Correct 244 ms 123544 KB Output is correct
60 Correct 278 ms 124448 KB Output is correct
61 Correct 291 ms 125452 KB Output is correct
62 Correct 211 ms 125996 KB Output is correct
63 Correct 242 ms 127944 KB Output is correct
64 Correct 307 ms 129100 KB Output is correct
65 Correct 351 ms 130092 KB Output is correct
66 Correct 363 ms 131496 KB Output is correct
67 Correct 288 ms 134992 KB Output is correct
68 Correct 285 ms 136232 KB Output is correct
69 Correct 299 ms 138240 KB Output is correct
70 Correct 312 ms 139380 KB Output is correct
71 Correct 283 ms 139916 KB Output is correct
72 Correct 294 ms 141308 KB Output is correct
73 Correct 278 ms 143204 KB Output is correct
74 Correct 257 ms 144404 KB Output is correct
75 Correct 314 ms 144404 KB Output is correct
76 Correct 284 ms 144404 KB Output is correct
77 Correct 267 ms 145116 KB Output is correct
78 Correct 277 ms 147404 KB Output is correct
79 Correct 287 ms 148408 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 94200 KB Output is correct
2 Correct 99 ms 94460 KB Output is correct
3 Correct 94 ms 94460 KB Output is correct
4 Correct 99 ms 94524 KB Output is correct
5 Correct 96 ms 94524 KB Output is correct
6 Correct 92 ms 94524 KB Output is correct
7 Correct 94 ms 94524 KB Output is correct
8 Correct 99 ms 94608 KB Output is correct
9 Correct 104 ms 94720 KB Output is correct
10 Correct 102 ms 94720 KB Output is correct
11 Correct 98 ms 94720 KB Output is correct
12 Correct 96 ms 94720 KB Output is correct
13 Correct 99 ms 94720 KB Output is correct
14 Correct 105 ms 94720 KB Output is correct
15 Correct 93 ms 94720 KB Output is correct
16 Correct 98 ms 94720 KB Output is correct
17 Correct 100 ms 94720 KB Output is correct
18 Correct 103 ms 94720 KB Output is correct
19 Correct 93 ms 94720 KB Output is correct
20 Correct 100 ms 94720 KB Output is correct
21 Correct 97 ms 94720 KB Output is correct
22 Correct 100 ms 94720 KB Output is correct
23 Correct 106 ms 94720 KB Output is correct
24 Correct 96 ms 94720 KB Output is correct
25 Correct 107 ms 94720 KB Output is correct
26 Correct 102 ms 94888 KB Output is correct
27 Correct 105 ms 94888 KB Output is correct
28 Correct 102 ms 94888 KB Output is correct
29 Correct 107 ms 94888 KB Output is correct
30 Correct 111 ms 94888 KB Output is correct
31 Correct 107 ms 94888 KB Output is correct
32 Correct 119 ms 94888 KB Output is correct
33 Correct 121 ms 94888 KB Output is correct
34 Correct 103 ms 94888 KB Output is correct
35 Correct 101 ms 94888 KB Output is correct
36 Correct 98 ms 94888 KB Output is correct
37 Correct 91 ms 94888 KB Output is correct
38 Correct 97 ms 94932 KB Output is correct
39 Correct 111 ms 94932 KB Output is correct
40 Correct 96 ms 94932 KB Output is correct
41 Correct 98 ms 94932 KB Output is correct
42 Correct 98 ms 94932 KB Output is correct
43 Correct 98 ms 94932 KB Output is correct
44 Correct 107 ms 94932 KB Output is correct
45 Correct 297 ms 105300 KB Output is correct
46 Correct 284 ms 106904 KB Output is correct
47 Correct 299 ms 107832 KB Output is correct
48 Correct 279 ms 109476 KB Output is correct
49 Correct 340 ms 110496 KB Output is correct
50 Correct 281 ms 111768 KB Output is correct
51 Correct 298 ms 113220 KB Output is correct
52 Correct 216 ms 113220 KB Output is correct
53 Correct 264 ms 118752 KB Output is correct
54 Correct 278 ms 118752 KB Output is correct
55 Correct 256 ms 118752 KB Output is correct
56 Correct 222 ms 118820 KB Output is correct
57 Correct 258 ms 120848 KB Output is correct
58 Correct 230 ms 120848 KB Output is correct
59 Correct 244 ms 123544 KB Output is correct
60 Correct 278 ms 124448 KB Output is correct
61 Correct 291 ms 125452 KB Output is correct
62 Correct 211 ms 125996 KB Output is correct
63 Correct 242 ms 127944 KB Output is correct
64 Correct 307 ms 129100 KB Output is correct
65 Correct 351 ms 130092 KB Output is correct
66 Correct 363 ms 131496 KB Output is correct
67 Correct 288 ms 134992 KB Output is correct
68 Correct 285 ms 136232 KB Output is correct
69 Correct 299 ms 138240 KB Output is correct
70 Correct 312 ms 139380 KB Output is correct
71 Correct 283 ms 139916 KB Output is correct
72 Correct 294 ms 141308 KB Output is correct
73 Correct 278 ms 143204 KB Output is correct
74 Correct 257 ms 144404 KB Output is correct
75 Correct 314 ms 144404 KB Output is correct
76 Correct 284 ms 144404 KB Output is correct
77 Correct 267 ms 145116 KB Output is correct
78 Correct 277 ms 147404 KB Output is correct
79 Correct 287 ms 148408 KB Output is correct
80 Correct 2406 ms 257612 KB Output is correct
81 Correct 2430 ms 271928 KB Output is correct
82 Correct 2615 ms 286432 KB Output is correct
83 Correct 2846 ms 300816 KB Output is correct
84 Correct 2638 ms 315840 KB Output is correct
85 Correct 2497 ms 329212 KB Output is correct
86 Correct 2511 ms 343956 KB Output is correct
87 Correct 1353 ms 348152 KB Output is correct
88 Correct 3424 ms 409696 KB Output is correct
89 Correct 1580 ms 409696 KB Output is correct
90 Correct 1684 ms 409696 KB Output is correct
91 Correct 1682 ms 412632 KB Output is correct
92 Correct 1965 ms 436836 KB Output is correct
93 Correct 1282 ms 436836 KB Output is correct
94 Correct 1765 ms 466572 KB Output is correct
95 Correct 1917 ms 476188 KB Output is correct
96 Correct 2281 ms 490076 KB Output is correct
97 Correct 2094 ms 504984 KB Output is correct
98 Correct 2323 ms 519128 KB Output is correct
99 Correct 1701 ms 531852 KB Output is correct
100 Correct 3191 ms 543740 KB Output is correct
101 Correct 3108 ms 558260 KB Output is correct
102 Correct 3491 ms 596120 KB Output is correct
103 Correct 2856 ms 610928 KB Output is correct
104 Correct 3084 ms 633748 KB Output is correct
105 Correct 2435 ms 648240 KB Output is correct
106 Correct 2507 ms 654628 KB Output is correct
107 Correct 2865 ms 669184 KB Output is correct
108 Correct 2986 ms 692240 KB Output is correct
109 Correct 2291 ms 706664 KB Output is correct
110 Correct 2053 ms 706664 KB Output is correct
111 Correct 2047 ms 706664 KB Output is correct
112 Correct 2477 ms 718656 KB Output is correct
113 Correct 2834 ms 737840 KB Output is correct
114 Correct 2795 ms 752648 KB Output is correct