oj.uz

Submission #60033

# Submission time Handle Problem Language Result Execution time Memory
60033 2018-07-23T13:25:35 Z Diuven Port Facility (JOI17_port_facility) C++11
100 / 100
 5542 ms 195016 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MX=1000010, inf=2e9, MOD=1e9+7;

int n, S[MX], E[MX];

inline pii _min(const pii &a, const pii &b){ return a.first<b.first ? a : b; }
inline pii _max(const pii &a, const pii &b){ return a.first>b.first ? a : b; }
const pii pninf=pii(inf,-1), pxinf=pii(0, -1);

pii ntree[1<<22], xtree[1<<22];

void init(){
    for(int i=1; i<(1<<22); i++)
        ntree[i]=pninf, xtree[i]=pxinf;
}

pii mn(int v, int s, int e, int l, int r){
    if(l<=s && e<=r) return ntree[v];
    int m=(s+e)/2;
    if(r<=m) return mn(v*2,s,(s+e)/2,l,r);
    if(m+1<=l) return mn(v*2+1,(s+e)/2+1,e,l,r);
    return _min(mn(v*2,s,(s+e)/2,l,r), mn(v*2+1,(s+e)/2+1,e,l,r));
}
pii mx(int v, int s, int e, int l, int r){
    if(l<=s && e<=r) return xtree[v];
    int m=(s+e)/2;
    if(r<=m) return mx(v*2,s,(s+e)/2,l,r);
    if(m+1<=l) return mx(v*2+1,(s+e)/2+1,e,l,r);
    return _max(mx(v*2,s,(s+e)/2,l,r), mx(v*2+1,(s+e)/2+1,e,l,r));
}
pii mn(int l, int r){
    return mn(1,1,2*n,l,r);
}
pii mx(int l, int r){
    return mx(1,1,2*n,l,r);
}

void nupt(int v, int s, int e, int pos, const pii &val){
    if(s==e){
        ntree[v]=val;
        return;
    }
    int m=(s+e)/2;
    if(pos<=m) nupt(v*2,s,(s+e)/2,pos,val);
    else nupt(v*2+1,(s+e)/2+1,e,pos,val);
    ntree[v]=_min(ntree[v*2], ntree[v*2+1]);
}
void xupt(int v, int s, int e, int pos, const pii &val){
    if(s==e){
        xtree[v]=val;
        return;
    }
    int m=(s+e)/2;
    if(pos<=m) xupt(v*2,s,(s+e)/2,pos,val);
    else xupt(v*2+1,(s+e)/2+1,e,pos,val);
    xtree[v]=_max(xtree[v*2], xtree[v*2+1]);
}

void nupt(int pos, const pii &val){
    nupt(1,1,2*n,pos,val);
}

void xupt(int pos, const pii &val){
    xupt(1,1,2*n,pos,val);
}

bool vis[MX];
int col[MX];

void dfs(int v, int c=0){
    vis[v]=true; col[v]=c;
    nupt(E[v], pninf);
    xupt(S[v], pxinf);
    while(true){
        pii q=mx(S[v], E[v]);
        if(q.first<E[v]) break;
        else dfs(q.second, 1-c);
    }
    while(true){
        pii q=mn(S[v], E[v]);
        if(S[v]<q.first) break;
        else dfs(q.second, 1-c);
    }
}

int H[2*MX], cnt[2*MX];
bool valid(){
    for(int i=1; i<=n; i++){
        assert(vis[i]);
        if(col[i]!=0) continue;
        cnt[S[i]]++, cnt[E[i]+1]--;
    }
    for(int i=1, now=0; i<=2*n+1; i++){
        now+=cnt[i]; cnt[i]=0;
        H[i]=now;
    }
    for(int i=1; i<=n; i++){
        if(col[i]!=0) continue;
        if(H[S[i]]!=H[E[i]]) return false;
    }
    for(int i=1; i<=n; i++){
        if(col[i]!=1) continue;
        cnt[S[i]]++, cnt[E[i]+1]--;
    }
    for(int i=1, now=0; i<=2*n+1; i++){
        now+=cnt[i]; cnt[i]=0;
        H[i]=now;
    }
    for(int i=1; i<=n; i++){
        if(col[i]!=1) continue;
        if(H[S[i]]!=H[E[i]]) return false;
    }
    return true;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>n;
    init();
    for(int i=1; i<=n; i++){
        cin>>S[i]>>E[i];
        nupt(E[i], pii(S[i], i));
        xupt(S[i], pii(E[i], i));
    }
    int ans=1;
    for(int i=1; i<=n; i++){
        if(!vis[i]) dfs(i), ans=ans*2%MOD;
    }
    cout<<(valid() ? ans : 0);
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 66040 KB Output is correct
2 Correct 58 ms 66060 KB Output is correct
3 Correct 59 ms 66224 KB Output is correct
4 Correct 72 ms 66300 KB Output is correct
5 Correct 67 ms 66300 KB Output is correct
6 Correct 55 ms 66300 KB Output is correct
7 Correct 66 ms 66300 KB Output is correct
8 Correct 63 ms 66300 KB Output is correct
9 Correct 72 ms 66300 KB Output is correct
10 Correct 67 ms 66300 KB Output is correct
11 Correct 55 ms 66300 KB Output is correct
12 Correct 67 ms 66300 KB Output is correct
13 Correct 83 ms 66300 KB Output is correct
14 Correct 79 ms 66300 KB Output is correct
15 Correct 66 ms 66368 KB Output is correct
16 Correct 61 ms 66372 KB Output is correct
17 Correct 58 ms 66412 KB Output is correct
18 Correct 66 ms 66412 KB Output is correct
19 Correct 54 ms 66412 KB Output is correct
20 Correct 59 ms 66412 KB Output is correct
21 Correct 69 ms 66412 KB Output is correct
22 Correct 72 ms 66412 KB Output is correct
23 Correct 66 ms 66412 KB Output is correct
24 Correct 64 ms 66428 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 66040 KB Output is correct
2 Correct 58 ms 66060 KB Output is correct
3 Correct 59 ms 66224 KB Output is correct
4 Correct 72 ms 66300 KB Output is correct
5 Correct 67 ms 66300 KB Output is correct
6 Correct 55 ms 66300 KB Output is correct
7 Correct 66 ms 66300 KB Output is correct
8 Correct 63 ms 66300 KB Output is correct
9 Correct 72 ms 66300 KB Output is correct
10 Correct 67 ms 66300 KB Output is correct
11 Correct 55 ms 66300 KB Output is correct
12 Correct 67 ms 66300 KB Output is correct
13 Correct 83 ms 66300 KB Output is correct
14 Correct 79 ms 66300 KB Output is correct
15 Correct 66 ms 66368 KB Output is correct
16 Correct 61 ms 66372 KB Output is correct
17 Correct 58 ms 66412 KB Output is correct
18 Correct 66 ms 66412 KB Output is correct
19 Correct 54 ms 66412 KB Output is correct
20 Correct 59 ms 66412 KB Output is correct
21 Correct 69 ms 66412 KB Output is correct
22 Correct 72 ms 66412 KB Output is correct
23 Correct 66 ms 66412 KB Output is correct
24 Correct 64 ms 66428 KB Output is correct
25 Correct 76 ms 66428 KB Output is correct
26 Correct 63 ms 66428 KB Output is correct
27 Correct 80 ms 66428 KB Output is correct
28 Correct 81 ms 66428 KB Output is correct
29 Correct 63 ms 66428 KB Output is correct
30 Correct 76 ms 66428 KB Output is correct
31 Correct 80 ms 66428 KB Output is correct
32 Correct 71 ms 66428 KB Output is correct
33 Correct 58 ms 66428 KB Output is correct
34 Correct 71 ms 66428 KB Output is correct
35 Correct 82 ms 66428 KB Output is correct
36 Correct 70 ms 66428 KB Output is correct
37 Correct 64 ms 66428 KB Output is correct
38 Correct 61 ms 66428 KB Output is correct
39 Correct 82 ms 66428 KB Output is correct
40 Correct 73 ms 66428 KB Output is correct
41 Correct 68 ms 66428 KB Output is correct
42 Correct 65 ms 66432 KB Output is correct
43 Correct 82 ms 66556 KB Output is correct
44 Correct 84 ms 66556 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 66040 KB Output is correct
2 Correct 58 ms 66060 KB Output is correct
3 Correct 59 ms 66224 KB Output is correct
4 Correct 72 ms 66300 KB Output is correct
5 Correct 67 ms 66300 KB Output is correct
6 Correct 55 ms 66300 KB Output is correct
7 Correct 66 ms 66300 KB Output is correct
8 Correct 63 ms 66300 KB Output is correct
9 Correct 72 ms 66300 KB Output is correct
10 Correct 67 ms 66300 KB Output is correct
11 Correct 55 ms 66300 KB Output is correct
12 Correct 67 ms 66300 KB Output is correct
13 Correct 83 ms 66300 KB Output is correct
14 Correct 79 ms 66300 KB Output is correct
15 Correct 66 ms 66368 KB Output is correct
16 Correct 61 ms 66372 KB Output is correct
17 Correct 58 ms 66412 KB Output is correct
18 Correct 66 ms 66412 KB Output is correct
19 Correct 54 ms 66412 KB Output is correct
20 Correct 59 ms 66412 KB Output is correct
21 Correct 69 ms 66412 KB Output is correct
22 Correct 72 ms 66412 KB Output is correct
23 Correct 66 ms 66412 KB Output is correct
24 Correct 64 ms 66428 KB Output is correct
25 Correct 76 ms 66428 KB Output is correct
26 Correct 63 ms 66428 KB Output is correct
27 Correct 80 ms 66428 KB Output is correct
28 Correct 81 ms 66428 KB Output is correct
29 Correct 63 ms 66428 KB Output is correct
30 Correct 76 ms 66428 KB Output is correct
31 Correct 80 ms 66428 KB Output is correct
32 Correct 71 ms 66428 KB Output is correct
33 Correct 58 ms 66428 KB Output is correct
34 Correct 71 ms 66428 KB Output is correct
35 Correct 82 ms 66428 KB Output is correct
36 Correct 70 ms 66428 KB Output is correct
37 Correct 64 ms 66428 KB Output is correct
38 Correct 61 ms 66428 KB Output is correct
39 Correct 82 ms 66428 KB Output is correct
40 Correct 73 ms 66428 KB Output is correct
41 Correct 68 ms 66428 KB Output is correct
42 Correct 65 ms 66432 KB Output is correct
43 Correct 82 ms 66556 KB Output is correct
44 Correct 84 ms 66556 KB Output is correct
45 Correct 396 ms 69520 KB Output is correct
46 Correct 378 ms 70012 KB Output is correct
47 Correct 335 ms 70012 KB Output is correct
48 Correct 381 ms 70012 KB Output is correct
49 Correct 403 ms 70012 KB Output is correct
50 Correct 340 ms 70012 KB Output is correct
51 Correct 376 ms 70012 KB Output is correct
52 Correct 267 ms 70012 KB Output is correct
53 Correct 361 ms 70012 KB Output is correct
54 Correct 373 ms 72360 KB Output is correct
55 Correct 333 ms 72360 KB Output is correct
56 Correct 350 ms 72360 KB Output is correct
57 Correct 281 ms 72360 KB Output is correct
58 Correct 327 ms 72360 KB Output is correct
59 Correct 315 ms 72360 KB Output is correct
60 Correct 337 ms 72360 KB Output is correct
61 Correct 365 ms 72360 KB Output is correct
62 Correct 354 ms 72360 KB Output is correct
63 Correct 343 ms 72360 KB Output is correct
64 Correct 309 ms 72360 KB Output is correct
65 Correct 441 ms 72388 KB Output is correct
66 Correct 430 ms 72388 KB Output is correct
67 Correct 327 ms 72388 KB Output is correct
68 Correct 377 ms 72388 KB Output is correct
69 Correct 319 ms 72388 KB Output is correct
70 Correct 325 ms 72388 KB Output is correct
71 Correct 331 ms 72388 KB Output is correct
72 Correct 351 ms 72388 KB Output is correct
73 Correct 423 ms 72388 KB Output is correct
74 Correct 348 ms 72388 KB Output is correct
75 Correct 311 ms 72388 KB Output is correct
76 Correct 320 ms 72388 KB Output is correct
77 Correct 267 ms 72388 KB Output is correct
78 Correct 338 ms 72388 KB Output is correct
79 Correct 413 ms 72388 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 66040 KB Output is correct
2 Correct 58 ms 66060 KB Output is correct
3 Correct 59 ms 66224 KB Output is correct
4 Correct 72 ms 66300 KB Output is correct
5 Correct 67 ms 66300 KB Output is correct
6 Correct 55 ms 66300 KB Output is correct
7 Correct 66 ms 66300 KB Output is correct
8 Correct 63 ms 66300 KB Output is correct
9 Correct 72 ms 66300 KB Output is correct
10 Correct 67 ms 66300 KB Output is correct
11 Correct 55 ms 66300 KB Output is correct
12 Correct 67 ms 66300 KB Output is correct
13 Correct 83 ms 66300 KB Output is correct
14 Correct 79 ms 66300 KB Output is correct
15 Correct 66 ms 66368 KB Output is correct
16 Correct 61 ms 66372 KB Output is correct
17 Correct 58 ms 66412 KB Output is correct
18 Correct 66 ms 66412 KB Output is correct
19 Correct 54 ms 66412 KB Output is correct
20 Correct 59 ms 66412 KB Output is correct
21 Correct 69 ms 66412 KB Output is correct
22 Correct 72 ms 66412 KB Output is correct
23 Correct 66 ms 66412 KB Output is correct
24 Correct 64 ms 66428 KB Output is correct
25 Correct 76 ms 66428 KB Output is correct
26 Correct 63 ms 66428 KB Output is correct
27 Correct 80 ms 66428 KB Output is correct
28 Correct 81 ms 66428 KB Output is correct
29 Correct 63 ms 66428 KB Output is correct
30 Correct 76 ms 66428 KB Output is correct
31 Correct 80 ms 66428 KB Output is correct
32 Correct 71 ms 66428 KB Output is correct
33 Correct 58 ms 66428 KB Output is correct
34 Correct 71 ms 66428 KB Output is correct
35 Correct 82 ms 66428 KB Output is correct
36 Correct 70 ms 66428 KB Output is correct
37 Correct 64 ms 66428 KB Output is correct
38 Correct 61 ms 66428 KB Output is correct
39 Correct 82 ms 66428 KB Output is correct
40 Correct 73 ms 66428 KB Output is correct
41 Correct 68 ms 66428 KB Output is correct
42 Correct 65 ms 66432 KB Output is correct
43 Correct 82 ms 66556 KB Output is correct
44 Correct 84 ms 66556 KB Output is correct
45 Correct 396 ms 69520 KB Output is correct
46 Correct 378 ms 70012 KB Output is correct
47 Correct 335 ms 70012 KB Output is correct
48 Correct 381 ms 70012 KB Output is correct
49 Correct 403 ms 70012 KB Output is correct
50 Correct 340 ms 70012 KB Output is correct
51 Correct 376 ms 70012 KB Output is correct
52 Correct 267 ms 70012 KB Output is correct
53 Correct 361 ms 70012 KB Output is correct
54 Correct 373 ms 72360 KB Output is correct
55 Correct 333 ms 72360 KB Output is correct
56 Correct 350 ms 72360 KB Output is correct
57 Correct 281 ms 72360 KB Output is correct
58 Correct 327 ms 72360 KB Output is correct
59 Correct 315 ms 72360 KB Output is correct
60 Correct 337 ms 72360 KB Output is correct
61 Correct 365 ms 72360 KB Output is correct
62 Correct 354 ms 72360 KB Output is correct
63 Correct 343 ms 72360 KB Output is correct
64 Correct 309 ms 72360 KB Output is correct
65 Correct 441 ms 72388 KB Output is correct
66 Correct 430 ms 72388 KB Output is correct
67 Correct 327 ms 72388 KB Output is correct
68 Correct 377 ms 72388 KB Output is correct
69 Correct 319 ms 72388 KB Output is correct
70 Correct 325 ms 72388 KB Output is correct
71 Correct 331 ms 72388 KB Output is correct
72 Correct 351 ms 72388 KB Output is correct
73 Correct 423 ms 72388 KB Output is correct
74 Correct 348 ms 72388 KB Output is correct
75 Correct 311 ms 72388 KB Output is correct
76 Correct 320 ms 72388 KB Output is correct
77 Correct 267 ms 72388 KB Output is correct
78 Correct 338 ms 72388 KB Output is correct
79 Correct 413 ms 72388 KB Output is correct
80 Correct 4038 ms 96764 KB Output is correct
81 Correct 3883 ms 96764 KB Output is correct
82 Correct 3929 ms 96764 KB Output is correct
83 Correct 3895 ms 96764 KB Output is correct
84 Correct 3834 ms 96764 KB Output is correct
85 Correct 3673 ms 96764 KB Output is correct
86 Correct 3744 ms 96764 KB Output is correct
87 Correct 2907 ms 96764 KB Output is correct
88 Correct 4348 ms 96764 KB Output is correct
89 Correct 3698 ms 126204 KB Output is correct
90 Correct 3633 ms 126204 KB Output is correct
91 Correct 3962 ms 126204 KB Output is correct
92 Correct 3187 ms 126204 KB Output is correct
93 Correct 3404 ms 126204 KB Output is correct
94 Correct 3645 ms 126204 KB Output is correct
95 Correct 4194 ms 126204 KB Output is correct
96 Correct 4050 ms 126204 KB Output is correct
97 Correct 3730 ms 126204 KB Output is correct
98 Correct 3674 ms 126204 KB Output is correct
99 Correct 3407 ms 126204 KB Output is correct
100 Correct 5542 ms 126232 KB Output is correct
101 Correct 5345 ms 126232 KB Output is correct
102 Correct 3952 ms 126232 KB Output is correct
103 Correct 3734 ms 126232 KB Output is correct
104 Correct 3957 ms 126232 KB Output is correct
105 Correct 3535 ms 126232 KB Output is correct
106 Correct 3629 ms 126232 KB Output is correct
107 Correct 3987 ms 139060 KB Output is correct
108 Correct 3693 ms 143092 KB Output is correct
109 Correct 3745 ms 157736 KB Output is correct
110 Correct 3287 ms 181984 KB Output is correct
111 Correct 3035 ms 195016 KB Output is correct
112 Correct 3258 ms 195016 KB Output is correct
113 Correct 3776 ms 195016 KB Output is correct
114 Correct 4117 ms 195016 KB Output is correct