oj.uz

Submission #234727

# Submission time Handle Problem Language Result Execution time Memory
234727 2020-05-25T11:25:58 Z Charis02 Port Facility (JOI17_port_facility) C++14
100 / 100
 4008 ms 238676 KB 
#include<iostream>
#include<stdio.h>
#include<vector>
#include<cmath>
#include<queue>
#include<string.h>
#include<map>
#include<set>
#include<stack>
#include<algorithm>
#define ll long long
#define pi pair < ll,ll >
#define mp(a,b) make_pair(a,b)
#define mid (low+high)/2
#define rep(i,a,b) for(int i = a;i < b;i++)
#define N 2000004
#define INF 1e9+7

using namespace std;

ll n,mod=1e9+7;
pi ar[N];
ll seg[4*N][2];
bool vis[N];
ll col[N];
ll points[N];
vector < ll > graph[N];

void init(ll low,ll high,ll pos)
{
    seg[pos][0]=2*n+1;
    seg[pos][1]=0;
    if(low==high)
        return;
    init(low,mid,pos*2+1);
    init(mid+1,high,pos*2+2);
    return;
}

void update(ll low,ll high,ll pos,ll slow,ll val,ll id)
{
    if(low==high&&low==slow)
    {
        seg[pos][id]=val;
        return;
    }
    if(low>slow||high<slow)
        return;
    update(low,mid,pos*2+1,slow,val,id);
    update(mid+1,high,pos*2+2,slow,val,id);
    seg[pos][0]=min(seg[pos*2+1][0],seg[pos*2+2][0]);
    seg[pos][1]=max(seg[pos*2+1][1],seg[pos*2+2][1]);
    return;
}

ll query(ll low,ll high,ll pos,ll slow,ll shigh,ll id)
{
    //cout << low << " " << high << " " << pos << " " << slow<< " " << shigh << " " << id << " " << seg[pos][id] << endl;
    if(low>=slow&&high<=shigh)
        return seg[pos][id];
    if(low>shigh||high<slow)
    {
        if(id==1)
            return 0;
        return 2*n+1;
    }
    if(id==1)
        return max(query(low,mid,pos*2+1,slow,shigh,id),query(mid+1,high,pos*2+2,slow,shigh,id));
    else
        return min(query(low,mid,pos*2+1,slow,shigh,id),query(mid+1,high,pos*2+2,slow,shigh,id));
}

void dfs(ll cur,ll c)
{
    if(vis[cur])
        return;
    col[cur] = c;
    vis[cur]=true;

    update(0,2*n,0,ar[cur].second,2*n+1,0);
    update(0,2*n,0,ar[cur].first,0,1);

   // cout << "here " << cur << " " << c << endl;

    // find left intersections

    ll q = query(0,2*n,0,ar[cur].first,ar[cur].second,0);

    while(q < ar[cur].first)
    {
        q=points[q];
        dfs(q,!c);
        q = query(0,2*n,0,ar[cur].first,ar[cur].second,0);
    }

    // find right intersections

    q = query(0,2*n,0,ar[cur].first,ar[cur].second,1);

    while(q > ar[cur].second)
    {
        q=points[q];
        dfs(q,!c);
        q = query(0,2*n,0,ar[cur].first,ar[cur].second,1);
    }

  //  cout << "out " << cur << " " << c << endl;

    return;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;

    rep(i,0,n)
    {
        cin >> ar[i].first >> ar[i].second;
    }

    init(0,2*n,0);

    rep(i,0,n)
    {
        points[ar[i].first]=points[ar[i].second]=i;
        update(0,2*n,0,ar[i].second,ar[i].first,0);
        update(0,2*n,0,ar[i].first,ar[i].second,1);
    }

    ll ans = 1;
    rep(i,0,n)
    {
        if(!vis[i])
            ans=(ans*2)%mod;
        dfs(i,0);
    }

    stack < ll > s[2];

    rep(i,1,2*n+1)
    {
        ll ind = points[i];
        if(ar[ind].first==i)
        {
            s[col[ind]].push(ind);
        }
        else
        {
            if(s[col[ind]].top() != ind)
            {
                ans=0;
                break;
            }
            else
                s[col[ind]].pop();
        }
    }

    cout << ans << endl;

    return 0;
}

/*
4
1 5
2 6
3 4
7 8
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 47360 KB Output is correct
2 Correct 35 ms 47296 KB Output is correct
3 Correct 32 ms 47360 KB Output is correct
4 Correct 33 ms 47360 KB Output is correct
5 Correct 32 ms 47360 KB Output is correct
6 Correct 34 ms 47352 KB Output is correct
7 Correct 32 ms 47352 KB Output is correct
8 Correct 32 ms 47360 KB Output is correct
9 Correct 34 ms 47352 KB Output is correct
10 Correct 34 ms 47360 KB Output is correct
11 Correct 33 ms 47352 KB Output is correct
12 Correct 34 ms 47360 KB Output is correct
13 Correct 33 ms 47352 KB Output is correct
14 Correct 32 ms 47360 KB Output is correct
15 Correct 34 ms 47352 KB Output is correct
16 Correct 32 ms 47360 KB Output is correct
17 Correct 33 ms 47360 KB Output is correct
18 Correct 32 ms 47360 KB Output is correct
19 Correct 34 ms 47360 KB Output is correct
20 Correct 32 ms 47360 KB Output is correct
21 Correct 32 ms 47360 KB Output is correct
22 Correct 35 ms 47356 KB Output is correct
23 Correct 32 ms 47360 KB Output is correct
24 Correct 31 ms 47360 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 47360 KB Output is correct
2 Correct 35 ms 47296 KB Output is correct
3 Correct 32 ms 47360 KB Output is correct
4 Correct 33 ms 47360 KB Output is correct
5 Correct 32 ms 47360 KB Output is correct
6 Correct 34 ms 47352 KB Output is correct
7 Correct 32 ms 47352 KB Output is correct
8 Correct 32 ms 47360 KB Output is correct
9 Correct 34 ms 47352 KB Output is correct
10 Correct 34 ms 47360 KB Output is correct
11 Correct 33 ms 47352 KB Output is correct
12 Correct 34 ms 47360 KB Output is correct
13 Correct 33 ms 47352 KB Output is correct
14 Correct 32 ms 47360 KB Output is correct
15 Correct 34 ms 47352 KB Output is correct
16 Correct 32 ms 47360 KB Output is correct
17 Correct 33 ms 47360 KB Output is correct
18 Correct 32 ms 47360 KB Output is correct
19 Correct 34 ms 47360 KB Output is correct
20 Correct 32 ms 47360 KB Output is correct
21 Correct 32 ms 47360 KB Output is correct
22 Correct 35 ms 47356 KB Output is correct
23 Correct 32 ms 47360 KB Output is correct
24 Correct 31 ms 47360 KB Output is correct
25 Correct 36 ms 47684 KB Output is correct
26 Correct 35 ms 47620 KB Output is correct
27 Correct 35 ms 47616 KB Output is correct
28 Correct 35 ms 47616 KB Output is correct
29 Correct 35 ms 47588 KB Output is correct
30 Correct 36 ms 47616 KB Output is correct
31 Correct 35 ms 47872 KB Output is correct
32 Correct 35 ms 47616 KB Output is correct
33 Correct 36 ms 47616 KB Output is correct
34 Correct 35 ms 47616 KB Output is correct
35 Correct 35 ms 47616 KB Output is correct
36 Correct 35 ms 47616 KB Output is correct
37 Correct 36 ms 47744 KB Output is correct
38 Correct 37 ms 47616 KB Output is correct
39 Correct 35 ms 47616 KB Output is correct
40 Correct 34 ms 47616 KB Output is correct
41 Correct 34 ms 47736 KB Output is correct
42 Correct 38 ms 47736 KB Output is correct
43 Correct 35 ms 47744 KB Output is correct
44 Correct 37 ms 47744 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 47360 KB Output is correct
2 Correct 35 ms 47296 KB Output is correct
3 Correct 32 ms 47360 KB Output is correct
4 Correct 33 ms 47360 KB Output is correct
5 Correct 32 ms 47360 KB Output is correct
6 Correct 34 ms 47352 KB Output is correct
7 Correct 32 ms 47352 KB Output is correct
8 Correct 32 ms 47360 KB Output is correct
9 Correct 34 ms 47352 KB Output is correct
10 Correct 34 ms 47360 KB Output is correct
11 Correct 33 ms 47352 KB Output is correct
12 Correct 34 ms 47360 KB Output is correct
13 Correct 33 ms 47352 KB Output is correct
14 Correct 32 ms 47360 KB Output is correct
15 Correct 34 ms 47352 KB Output is correct
16 Correct 32 ms 47360 KB Output is correct
17 Correct 33 ms 47360 KB Output is correct
18 Correct 32 ms 47360 KB Output is correct
19 Correct 34 ms 47360 KB Output is correct
20 Correct 32 ms 47360 KB Output is correct
21 Correct 32 ms 47360 KB Output is correct
22 Correct 35 ms 47356 KB Output is correct
23 Correct 32 ms 47360 KB Output is correct
24 Correct 31 ms 47360 KB Output is correct
25 Correct 36 ms 47684 KB Output is correct
26 Correct 35 ms 47620 KB Output is correct
27 Correct 35 ms 47616 KB Output is correct
28 Correct 35 ms 47616 KB Output is correct
29 Correct 35 ms 47588 KB Output is correct
30 Correct 36 ms 47616 KB Output is correct
31 Correct 35 ms 47872 KB Output is correct
32 Correct 35 ms 47616 KB Output is correct
33 Correct 36 ms 47616 KB Output is correct
34 Correct 35 ms 47616 KB Output is correct
35 Correct 35 ms 47616 KB Output is correct
36 Correct 35 ms 47616 KB Output is correct
37 Correct 36 ms 47744 KB Output is correct
38 Correct 37 ms 47616 KB Output is correct
39 Correct 35 ms 47616 KB Output is correct
40 Correct 34 ms 47616 KB Output is correct
41 Correct 34 ms 47736 KB Output is correct
42 Correct 38 ms 47736 KB Output is correct
43 Correct 35 ms 47744 KB Output is correct
44 Correct 37 ms 47744 KB Output is correct
45 Correct 276 ms 62072 KB Output is correct
46 Correct 283 ms 62968 KB Output is correct
47 Correct 260 ms 61560 KB Output is correct
48 Correct 277 ms 62968 KB Output is correct
49 Correct 268 ms 61688 KB Output is correct
50 Correct 269 ms 62840 KB Output is correct
51 Correct 269 ms 62712 KB Output is correct
52 Correct 226 ms 60792 KB Output is correct
53 Correct 304 ms 61688 KB Output is correct
54 Correct 317 ms 67960 KB Output is correct
55 Correct 274 ms 64504 KB Output is correct
56 Correct 289 ms 64392 KB Output is correct
57 Correct 261 ms 60920 KB Output is correct
58 Correct 263 ms 60796 KB Output is correct
59 Correct 262 ms 61048 KB Output is correct
60 Correct 322 ms 61180 KB Output is correct
61 Correct 284 ms 61176 KB Output is correct
62 Correct 280 ms 61132 KB Output is correct
63 Correct 263 ms 60924 KB Output is correct
64 Correct 269 ms 60796 KB Output is correct
65 Correct 348 ms 67448 KB Output is correct
66 Correct 325 ms 67576 KB Output is correct
67 Correct 307 ms 64504 KB Output is correct
68 Correct 323 ms 64380 KB Output is correct
69 Correct 328 ms 64120 KB Output is correct
70 Correct 308 ms 64120 KB Output is correct
71 Correct 282 ms 67960 KB Output is correct
72 Correct 291 ms 67960 KB Output is correct
73 Correct 276 ms 65912 KB Output is correct
74 Correct 304 ms 65788 KB Output is correct
75 Correct 220 ms 64504 KB Output is correct
76 Correct 247 ms 67192 KB Output is correct
77 Correct 233 ms 67192 KB Output is correct
78 Correct 278 ms 62716 KB Output is correct
79 Correct 276 ms 62328 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 47360 KB Output is correct
2 Correct 35 ms 47296 KB Output is correct
3 Correct 32 ms 47360 KB Output is correct
4 Correct 33 ms 47360 KB Output is correct
5 Correct 32 ms 47360 KB Output is correct
6 Correct 34 ms 47352 KB Output is correct
7 Correct 32 ms 47352 KB Output is correct
8 Correct 32 ms 47360 KB Output is correct
9 Correct 34 ms 47352 KB Output is correct
10 Correct 34 ms 47360 KB Output is correct
11 Correct 33 ms 47352 KB Output is correct
12 Correct 34 ms 47360 KB Output is correct
13 Correct 33 ms 47352 KB Output is correct
14 Correct 32 ms 47360 KB Output is correct
15 Correct 34 ms 47352 KB Output is correct
16 Correct 32 ms 47360 KB Output is correct
17 Correct 33 ms 47360 KB Output is correct
18 Correct 32 ms 47360 KB Output is correct
19 Correct 34 ms 47360 KB Output is correct
20 Correct 32 ms 47360 KB Output is correct
21 Correct 32 ms 47360 KB Output is correct
22 Correct 35 ms 47356 KB Output is correct
23 Correct 32 ms 47360 KB Output is correct
24 Correct 31 ms 47360 KB Output is correct
25 Correct 36 ms 47684 KB Output is correct
26 Correct 35 ms 47620 KB Output is correct
27 Correct 35 ms 47616 KB Output is correct
28 Correct 35 ms 47616 KB Output is correct
29 Correct 35 ms 47588 KB Output is correct
30 Correct 36 ms 47616 KB Output is correct
31 Correct 35 ms 47872 KB Output is correct
32 Correct 35 ms 47616 KB Output is correct
33 Correct 36 ms 47616 KB Output is correct
34 Correct 35 ms 47616 KB Output is correct
35 Correct 35 ms 47616 KB Output is correct
36 Correct 35 ms 47616 KB Output is correct
37 Correct 36 ms 47744 KB Output is correct
38 Correct 37 ms 47616 KB Output is correct
39 Correct 35 ms 47616 KB Output is correct
40 Correct 34 ms 47616 KB Output is correct
41 Correct 34 ms 47736 KB Output is correct
42 Correct 38 ms 47736 KB Output is correct
43 Correct 35 ms 47744 KB Output is correct
44 Correct 37 ms 47744 KB Output is correct
45 Correct 276 ms 62072 KB Output is correct
46 Correct 283 ms 62968 KB Output is correct
47 Correct 260 ms 61560 KB Output is correct
48 Correct 277 ms 62968 KB Output is correct
49 Correct 268 ms 61688 KB Output is correct
50 Correct 269 ms 62840 KB Output is correct
51 Correct 269 ms 62712 KB Output is correct
52 Correct 226 ms 60792 KB Output is correct
53 Correct 304 ms 61688 KB Output is correct
54 Correct 317 ms 67960 KB Output is correct
55 Correct 274 ms 64504 KB Output is correct
56 Correct 289 ms 64392 KB Output is correct
57 Correct 261 ms 60920 KB Output is correct
58 Correct 263 ms 60796 KB Output is correct
59 Correct 262 ms 61048 KB Output is correct
60 Correct 322 ms 61180 KB Output is correct
61 Correct 284 ms 61176 KB Output is correct
62 Correct 280 ms 61132 KB Output is correct
63 Correct 263 ms 60924 KB Output is correct
64 Correct 269 ms 60796 KB Output is correct
65 Correct 348 ms 67448 KB Output is correct
66 Correct 325 ms 67576 KB Output is correct
67 Correct 307 ms 64504 KB Output is correct
68 Correct 323 ms 64380 KB Output is correct
69 Correct 328 ms 64120 KB Output is correct
70 Correct 308 ms 64120 KB Output is correct
71 Correct 282 ms 67960 KB Output is correct
72 Correct 291 ms 67960 KB Output is correct
73 Correct 276 ms 65912 KB Output is correct
74 Correct 304 ms 65788 KB Output is correct
75 Correct 220 ms 64504 KB Output is correct
76 Correct 247 ms 67192 KB Output is correct
77 Correct 233 ms 67192 KB Output is correct
78 Correct 278 ms 62716 KB Output is correct
79 Correct 276 ms 62328 KB Output is correct
80 Correct 3241 ms 175608 KB Output is correct
81 Correct 3175 ms 174964 KB Output is correct
82 Correct 3125 ms 172428 KB Output is correct
83 Correct 3146 ms 175016 KB Output is correct
84 Correct 3163 ms 175676 KB Output is correct
85 Correct 2986 ms 172884 KB Output is correct
86 Correct 2984 ms 175224 KB Output is correct
87 Correct 2617 ms 167980 KB Output is correct
88 Correct 3345 ms 176032 KB Output is correct
89 Correct 3276 ms 238620 KB Output is correct
90 Correct 3193 ms 203220 KB Output is correct
91 Correct 3259 ms 203184 KB Output is correct
92 Correct 2895 ms 167800 KB Output is correct
93 Correct 2597 ms 167952 KB Output is correct
94 Correct 2975 ms 170528 KB Output is correct
95 Correct 3086 ms 170540 KB Output is correct
96 Correct 3028 ms 170412 KB Output is correct
97 Correct 2905 ms 170412 KB Output is correct
98 Correct 2983 ms 170232 KB Output is correct
99 Correct 2883 ms 170492 KB Output is correct
100 Correct 3988 ms 234524 KB Output is correct
101 Correct 4008 ms 234420 KB Output is correct
102 Correct 3357 ms 203292 KB Output is correct
103 Correct 3449 ms 203460 KB Output is correct
104 Correct 3326 ms 201116 KB Output is correct
105 Correct 3235 ms 200984 KB Output is correct
106 Correct 3313 ms 238676 KB Output is correct
107 Correct 3445 ms 238432 KB Output is correct
108 Correct 3303 ms 217780 KB Output is correct
109 Correct 3340 ms 217992 KB Output is correct
110 Correct 2665 ms 229036 KB Output is correct
111 Correct 2694 ms 230436 KB Output is correct
112 Correct 2599 ms 230268 KB Output is correct
113 Correct 3080 ms 172364 KB Output is correct
114 Correct 3101 ms 174960 KB Output is correct