oj.uz

Submission #131900

# Submission time Handle Problem Language Result Execution time Memory
131900 2019-07-18T01:37:46 Z songc Port Facility (JOI17_port_facility) C++14
100 / 100
 5880 ms 146936 KB 
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;

int N, cnt, ans;
int A[1010101], B[1010101], C[1010101], P[2020202];
pii Max[8080808], Min[8080808];
vector<int> St1, St2;

void updMax(int id, int s, int e, int t, pii v){
    if (e < t || t < s) return;
    if (s == e){
        Max[id] = v;
        return;
    }
    int mid=(s+e)/2;
    updMax(id*2, s, mid, t, v);
    updMax(id*2+1, mid+1, e, t, v);
    Max[id] = max(Max[id*2], Max[id*2+1]);
}

void updMin(int id, int s, int e, int t, pii v){
    if (e < t || t < s) return;
    if (s == e){
        Min[id] = v;
        return;
    }
    int mid=(s+e)/2;
    updMin(id*2, s, mid, t, v);
    updMin(id*2+1, mid+1, e, t, v);
    Min[id] = min(Min[id*2], Min[id*2+1]);
}

pii MaxQ(int id, int s, int e, int ts, int te){
    if (e < ts || te < s) return pii(0, 0);
    if (ts <= s && e <= te) return Max[id];
    int mid = (s+e)/2;
    return max(MaxQ(id*2, s, mid, ts, te), MaxQ(id*2+1, mid+1, e, ts, te));
}

pii MinQ(int id, int s, int e, int ts, int te){
    if (e < ts || te < s) return pii(1234567890, 0);
    if (ts <= s && e <= te) return Min[id];
    int mid = (s+e)/2;
    return min(MinQ(id*2, s, mid, ts, te), MinQ(id*2+1, mid+1, e, ts, te));
}

void dfs(int u, int c){
    C[u] = c;
    while (1){
        pii t = MaxQ(1, 1, 2*N, A[u], B[u]);
        if (t.first > B[u]){
            updMax(1, 1, 2*N, A[t.second], pii(0, 0));
            updMin(1, 1, 2*N, B[t.second], pii(1234567890, 0));
            dfs(t.second, -c);
            continue;
        }

        t = MinQ(1, 1, 2*N, A[u], B[u]);
        if (t.first < A[u]){
            updMax(1, 1, 2*N, A[t.second], pii(0, 0));
            updMin(1, 1, 2*N, B[t.second], pii(1234567890, 0));
            dfs(t.second, -c);
            continue;
        }
        return;
    }
}

int main(){
    scanf("%d", &N);
    fill(Min, Min+8*N, pii(1234567890, 0));
    for (int i=1; i<=N; i++) {
        scanf("%d %d", &A[i], &B[i]);
        updMin(1, 1, 2*N, B[i], pii(A[i], i));
        updMax(1, 1, 2*N, A[i], pii(B[i], i));
        P[A[i]] = P[B[i]] = i;
    }
    for (int i=1; i<=N; i++) if (!C[i]) cnt++, dfs(i, 1);
    for(int i=1; i<=2*N; i++){
        if (!St1.empty() && St1.back() == P[i]) St1.pop_back();
        else if (!St2.empty() && St2.back() == P[i]) St2.pop_back();
        else{
            if (C[P[i]] == 1) St1.push_back(P[i]);
            else St2.push_back(P[i]);
        }
    }
    if (!St1.empty() || !St2.empty()){
        puts("0");
        return 0;
    }
    ans = 1;
    for (int i=1; i<=cnt; i++) ans = ans * 2 % MOD;
    printf("%d\n", ans);
    return 0;
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:73:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
     ~~~~~^~~~~~~~~~
port_facility.cpp:76:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &A[i], &B[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 424 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 424 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 6 ms 632 KB Output is correct
26 Correct 6 ms 664 KB Output is correct
27 Correct 6 ms 604 KB Output is correct
28 Correct 6 ms 632 KB Output is correct
29 Correct 6 ms 632 KB Output is correct
30 Correct 6 ms 632 KB Output is correct
31 Correct 6 ms 664 KB Output is correct
32 Correct 6 ms 632 KB Output is correct
33 Correct 6 ms 632 KB Output is correct
34 Correct 6 ms 628 KB Output is correct
35 Correct 4 ms 628 KB Output is correct
36 Correct 5 ms 632 KB Output is correct
37 Correct 6 ms 632 KB Output is correct
38 Correct 6 ms 632 KB Output is correct
39 Correct 6 ms 632 KB Output is correct
40 Correct 4 ms 632 KB Output is correct
41 Correct 7 ms 632 KB Output is correct
42 Correct 6 ms 632 KB Output is correct
43 Correct 5 ms 604 KB Output is correct
44 Correct 5 ms 632 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 424 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 6 ms 632 KB Output is correct
26 Correct 6 ms 664 KB Output is correct
27 Correct 6 ms 604 KB Output is correct
28 Correct 6 ms 632 KB Output is correct
29 Correct 6 ms 632 KB Output is correct
30 Correct 6 ms 632 KB Output is correct
31 Correct 6 ms 664 KB Output is correct
32 Correct 6 ms 632 KB Output is correct
33 Correct 6 ms 632 KB Output is correct
34 Correct 6 ms 628 KB Output is correct
35 Correct 4 ms 628 KB Output is correct
36 Correct 5 ms 632 KB Output is correct
37 Correct 6 ms 632 KB Output is correct
38 Correct 6 ms 632 KB Output is correct
39 Correct 6 ms 632 KB Output is correct
40 Correct 4 ms 632 KB Output is correct
41 Correct 7 ms 632 KB Output is correct
42 Correct 6 ms 632 KB Output is correct
43 Correct 5 ms 604 KB Output is correct
44 Correct 5 ms 632 KB Output is correct
45 Correct 311 ms 13584 KB Output is correct
46 Correct 314 ms 13960 KB Output is correct
47 Correct 311 ms 13244 KB Output is correct
48 Correct 308 ms 13952 KB Output is correct
49 Correct 305 ms 13276 KB Output is correct
50 Correct 307 ms 13816 KB Output is correct
51 Correct 313 ms 14204 KB Output is correct
52 Correct 189 ms 12792 KB Output is correct
53 Correct 222 ms 11480 KB Output is correct
54 Correct 321 ms 15012 KB Output is correct
55 Correct 322 ms 13300 KB Output is correct
56 Correct 311 ms 13420 KB Output is correct
57 Correct 317 ms 12848 KB Output is correct
58 Correct 200 ms 12792 KB Output is correct
59 Correct 245 ms 13048 KB Output is correct
60 Correct 304 ms 12972 KB Output is correct
61 Correct 301 ms 13108 KB Output is correct
62 Correct 246 ms 13176 KB Output is correct
63 Correct 289 ms 13132 KB Output is correct
64 Correct 298 ms 13176 KB Output is correct
65 Correct 403 ms 16020 KB Output is correct
66 Correct 409 ms 15880 KB Output is correct
67 Correct 324 ms 13924 KB Output is correct
68 Correct 319 ms 13972 KB Output is correct
69 Correct 316 ms 13640 KB Output is correct
70 Correct 318 ms 13668 KB Output is correct
71 Correct 312 ms 14552 KB Output is correct
72 Correct 321 ms 14500 KB Output is correct
73 Correct 306 ms 13680 KB Output is correct
74 Correct 304 ms 13692 KB Output is correct
75 Correct 274 ms 14800 KB Output is correct
76 Correct 266 ms 15864 KB Output is correct
77 Correct 260 ms 15864 KB Output is correct
78 Correct 312 ms 13944 KB Output is correct
79 Correct 303 ms 13600 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 424 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 6 ms 632 KB Output is correct
26 Correct 6 ms 664 KB Output is correct
27 Correct 6 ms 604 KB Output is correct
28 Correct 6 ms 632 KB Output is correct
29 Correct 6 ms 632 KB Output is correct
30 Correct 6 ms 632 KB Output is correct
31 Correct 6 ms 664 KB Output is correct
32 Correct 6 ms 632 KB Output is correct
33 Correct 6 ms 632 KB Output is correct
34 Correct 6 ms 628 KB Output is correct
35 Correct 4 ms 628 KB Output is correct
36 Correct 5 ms 632 KB Output is correct
37 Correct 6 ms 632 KB Output is correct
38 Correct 6 ms 632 KB Output is correct
39 Correct 6 ms 632 KB Output is correct
40 Correct 4 ms 632 KB Output is correct
41 Correct 7 ms 632 KB Output is correct
42 Correct 6 ms 632 KB Output is correct
43 Correct 5 ms 604 KB Output is correct
44 Correct 5 ms 632 KB Output is correct
45 Correct 311 ms 13584 KB Output is correct
46 Correct 314 ms 13960 KB Output is correct
47 Correct 311 ms 13244 KB Output is correct
48 Correct 308 ms 13952 KB Output is correct
49 Correct 305 ms 13276 KB Output is correct
50 Correct 307 ms 13816 KB Output is correct
51 Correct 313 ms 14204 KB Output is correct
52 Correct 189 ms 12792 KB Output is correct
53 Correct 222 ms 11480 KB Output is correct
54 Correct 321 ms 15012 KB Output is correct
55 Correct 322 ms 13300 KB Output is correct
56 Correct 311 ms 13420 KB Output is correct
57 Correct 317 ms 12848 KB Output is correct
58 Correct 200 ms 12792 KB Output is correct
59 Correct 245 ms 13048 KB Output is correct
60 Correct 304 ms 12972 KB Output is correct
61 Correct 301 ms 13108 KB Output is correct
62 Correct 246 ms 13176 KB Output is correct
63 Correct 289 ms 13132 KB Output is correct
64 Correct 298 ms 13176 KB Output is correct
65 Correct 403 ms 16020 KB Output is correct
66 Correct 409 ms 15880 KB Output is correct
67 Correct 324 ms 13924 KB Output is correct
68 Correct 319 ms 13972 KB Output is correct
69 Correct 316 ms 13640 KB Output is correct
70 Correct 318 ms 13668 KB Output is correct
71 Correct 312 ms 14552 KB Output is correct
72 Correct 321 ms 14500 KB Output is correct
73 Correct 306 ms 13680 KB Output is correct
74 Correct 304 ms 13692 KB Output is correct
75 Correct 274 ms 14800 KB Output is correct
76 Correct 266 ms 15864 KB Output is correct
77 Correct 260 ms 15864 KB Output is correct
78 Correct 312 ms 13944 KB Output is correct
79 Correct 303 ms 13600 KB Output is correct
80 Correct 3974 ms 119640 KB Output is correct
81 Correct 4016 ms 119276 KB Output is correct
82 Correct 3970 ms 117968 KB Output is correct
83 Correct 4088 ms 119252 KB Output is correct
84 Correct 4073 ms 119620 KB Output is correct
85 Correct 3925 ms 119708 KB Output is correct
86 Correct 3991 ms 121052 KB Output is correct
87 Correct 2556 ms 115576 KB Output is correct
88 Correct 3191 ms 103708 KB Output is correct
89 Correct 4190 ms 138920 KB Output is correct
90 Correct 4232 ms 122792 KB Output is correct
91 Correct 4217 ms 123064 KB Output is correct
92 Correct 4091 ms 115528 KB Output is correct
93 Correct 2517 ms 115672 KB Output is correct
94 Correct 3549 ms 118336 KB Output is correct
95 Correct 3916 ms 117576 KB Output is correct
96 Correct 3929 ms 117596 KB Output is correct
97 Correct 3618 ms 118416 KB Output is correct
98 Correct 3866 ms 118556 KB Output is correct
99 Correct 3990 ms 119024 KB Output is correct
100 Correct 5880 ms 146756 KB Output is correct
101 Correct 5808 ms 146776 KB Output is correct
102 Correct 4227 ms 128020 KB Output is correct
103 Correct 4195 ms 127992 KB Output is correct
104 Correct 4099 ms 124256 KB Output is correct
105 Correct 4086 ms 124312 KB Output is correct
106 Correct 4161 ms 135568 KB Output is correct
107 Correct 4160 ms 135652 KB Output is correct
108 Correct 4051 ms 125780 KB Output is correct
109 Correct 4073 ms 125616 KB Output is correct
110 Correct 3730 ms 146280 KB Output is correct
111 Correct 3530 ms 146936 KB Output is correct
112 Correct 3461 ms 146896 KB Output is correct
113 Correct 3926 ms 117876 KB Output is correct
114 Correct 4010 ms 119304 KB Output is correct