oj.uz

Submission #373543

# Submission time Handle Problem Language Result Execution time Memory
373543 2021-03-05T03:30:51 Z 8e7 Port Facility (JOI17_port_facility) C++14
100 / 100
 4601 ms 164600 KB 
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#define ll long long
#define maxn 2000005
#define mod 1000000007
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;


struct obj{
	int l, r, id;
	obj() {
		l = 0, r = 0, id = 0;
	}
	obj(int a, int b, int c) {
		l = a, r = b, id = c;
	}
};
obj a[maxn];

int mi[4 * maxn], ma[4 * maxn];
void modify(int cur, int l, int r, int ind, int val, int type) {
	if (r <= l) return;
	if (r - l == 1) {
		if (type == 0) mi[cur] = val;
		else ma[cur] = val;
		return;
	}
	int mid = (l + r) / 2;
	if (ind < mid) modify(cur * 2, l, mid, ind, val, type);
	else modify(cur * 2 + 1, mid, r, ind, val, type);
	if (type == 0) mi[cur] = min(mi[cur * 2], mi[cur * 2 + 1]);
	else ma[cur] = max(ma[cur * 2], ma[cur * 2 + 1]);
}
int query(int cur, int l, int r, int ql, int qr, int type) {
	if (r <= l || ql >= r || qr <= l) return type ? -1 : 1<<30;
	if (ql <= l && qr >= r) return type ? ma[cur] : mi[cur];
	int mid = (l + r) / 2;
	if (type) return max(query(cur * 2, l, mid, ql, qr, type), query(cur * 2 + 1, mid, r, ql, qr, type));
	else return min(query(cur * 2, l, mid, ql, qr, type), query(cur * 2 + 1, mid, r, ql, qr, type));
}

int other[maxn], id[maxn], col[maxn];
bool islef[maxn], vis[maxn];

vector<vector<int> > com;

int n;
inline void del(int val, int type) {
	//cout << a[id[val]].l << " " << a[id[val]].r << endl;
	//cout << other[val] << " " << (type ? -1 : 1<<30) << endl;
	if (vis[id[val]]) return;
	vis[id[val]] = 1;
	modify(1, 0, 2 * n, other[val], type ? -1 : 1<<30, type);
	modify(1, 0, 2 * n, val, type ? 1<<30 : -1, type ^ 1);
}

inline bool cmp(int x, int y) {
	return a[x].l < a[y].l;
}
bool poss(vector<int> &x) {
	stack<int> stk;
	sort(x.begin(), x.end(), cmp);
	bool ret = true;
	for (int c = 0;c < 2;c++) {
		for (int i = 0;i < x.size();i++) {
			if (col[x[i]] != c) continue;
			while (stk.size() && a[x[i]].l > stk.top()) stk.pop();
			if (stk.size() && a[x[i]].r > stk.top()) return false;
			else stk.push(a[x[i]].r);
		}
		while (stk.size()) stk.pop();
	}
	return ret;
}
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin >> n;
    for (int i = 0;i < 4 * maxn;i++) mi[i] = 1<<30, ma[i] = -1; //0 based values
    for (int i = 0;i < n;i++) {
    	cin >> a[i].l >> a[i].r, a[i].id = i;
    	a[i].l--, a[i].r--;
    	islef[a[i].l] = 1;
    	other[a[i].l] = a[i].r, other[a[i].r] = a[i].l;
    	id[a[i].l] = id[a[i].r] = i;

    	modify(1, 0, 2 * n, a[i].l, a[i].r, 1);
    	modify(1, 0, 2 * n, a[i].r, a[i].l, 0);
    }
    for (int st = 0;st < n;st++) {
    	if (vis[st]) continue;
    	queue<pii> que;
    	que.push(make_pair(st, 1));
    	vector<int> add;
    	while (que.size()) {
    		int cur = que.front().ff;
    		col[cur] = que.front().ss;
    		que.pop();
    		add.push_back(cur);
    		//cout << cur << endl;
    		del(a[cur].r, 1);
        	int val = query(1, 0, 2 * n, a[cur].l, a[cur].r + 1, 1); //max part
        	while (val > a[cur].r) {
        		//cout << val << endl;
        		del(val, 1);
        		que.push(make_pair(id[val], col[cur] ^ 1));
        		val = query(1, 0, 2 * n, a[cur].l, a[cur].r + 1, 1);
        	}
        	val = query(1, 0, 2 * n, a[cur].l, a[cur].r + 1, 0);
        	while (val < a[cur].l) {
        		//cout << a[id[val]].l << "  " << a[id[val]].r << endl;

        		del(val, 0);
        		que.push(make_pair(id[val], col[cur] ^ 1));
        		val = query(1, 0, 2 * n, a[cur].l, a[cur].r + 1, 0);
        	}
    	}
    	//cout << endl;
    	com.push_back(add);

    }
    ll ans = 1;
    for (int i = 0;i < com.size();i++) {
    	ans = (ans * (poss(com[i]) ? 2 : 0)) % mod;
    	if (ans == 0) break;
    }
    cout << ans << "\n";

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

3
1 4
2 5
3 6

5
1 4
2 10
6 9
7 8
3 5

8
1 15
2 5
3 8
4 6
14 16
7 9
10 13
11 12

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

Compilation message

port_facility.cpp: In function 'bool poss(std::vector<int>&)':
port_facility.cpp:75:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |   for (int i = 0;i < x.size();i++) {
      |                  ~~^~~~~~~~~~
port_facility.cpp: In function 'int main()':
port_facility.cpp:132:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |     for (int i = 0;i < com.size();i++) {
      |                    ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 86508 KB Output is correct
2 Correct 55 ms 86508 KB Output is correct
3 Correct 55 ms 86508 KB Output is correct
4 Correct 55 ms 86508 KB Output is correct
5 Correct 55 ms 86508 KB Output is correct
6 Correct 55 ms 86508 KB Output is correct
7 Correct 56 ms 86508 KB Output is correct
8 Correct 55 ms 86508 KB Output is correct
9 Correct 58 ms 86508 KB Output is correct
10 Correct 56 ms 86508 KB Output is correct
11 Correct 56 ms 86508 KB Output is correct
12 Correct 57 ms 86508 KB Output is correct
13 Correct 56 ms 86508 KB Output is correct
14 Correct 58 ms 86636 KB Output is correct
15 Correct 56 ms 86508 KB Output is correct
16 Correct 55 ms 86464 KB Output is correct
17 Correct 59 ms 86508 KB Output is correct
18 Correct 56 ms 86508 KB Output is correct
19 Correct 55 ms 86508 KB Output is correct
20 Correct 56 ms 86508 KB Output is correct
21 Correct 56 ms 86456 KB Output is correct
22 Correct 56 ms 86508 KB Output is correct
23 Correct 55 ms 86508 KB Output is correct
24 Correct 55 ms 86508 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 86508 KB Output is correct
2 Correct 55 ms 86508 KB Output is correct
3 Correct 55 ms 86508 KB Output is correct
4 Correct 55 ms 86508 KB Output is correct
5 Correct 55 ms 86508 KB Output is correct
6 Correct 55 ms 86508 KB Output is correct
7 Correct 56 ms 86508 KB Output is correct
8 Correct 55 ms 86508 KB Output is correct
9 Correct 58 ms 86508 KB Output is correct
10 Correct 56 ms 86508 KB Output is correct
11 Correct 56 ms 86508 KB Output is correct
12 Correct 57 ms 86508 KB Output is correct
13 Correct 56 ms 86508 KB Output is correct
14 Correct 58 ms 86636 KB Output is correct
15 Correct 56 ms 86508 KB Output is correct
16 Correct 55 ms 86464 KB Output is correct
17 Correct 59 ms 86508 KB Output is correct
18 Correct 56 ms 86508 KB Output is correct
19 Correct 55 ms 86508 KB Output is correct
20 Correct 56 ms 86508 KB Output is correct
21 Correct 56 ms 86456 KB Output is correct
22 Correct 56 ms 86508 KB Output is correct
23 Correct 55 ms 86508 KB Output is correct
24 Correct 55 ms 86508 KB Output is correct
25 Correct 58 ms 86508 KB Output is correct
26 Correct 58 ms 86508 KB Output is correct
27 Correct 59 ms 86636 KB Output is correct
28 Correct 59 ms 86508 KB Output is correct
29 Correct 59 ms 86528 KB Output is correct
30 Correct 58 ms 86508 KB Output is correct
31 Correct 59 ms 86508 KB Output is correct
32 Correct 58 ms 86508 KB Output is correct
33 Correct 60 ms 86508 KB Output is correct
34 Correct 60 ms 86636 KB Output is correct
35 Correct 58 ms 86636 KB Output is correct
36 Correct 59 ms 86636 KB Output is correct
37 Correct 58 ms 86508 KB Output is correct
38 Correct 60 ms 86636 KB Output is correct
39 Correct 58 ms 86636 KB Output is correct
40 Correct 58 ms 86636 KB Output is correct
41 Correct 58 ms 86508 KB Output is correct
42 Correct 59 ms 86636 KB Output is correct
43 Correct 64 ms 86508 KB Output is correct
44 Correct 59 ms 86508 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 86508 KB Output is correct
2 Correct 55 ms 86508 KB Output is correct
3 Correct 55 ms 86508 KB Output is correct
4 Correct 55 ms 86508 KB Output is correct
5 Correct 55 ms 86508 KB Output is correct
6 Correct 55 ms 86508 KB Output is correct
7 Correct 56 ms 86508 KB Output is correct
8 Correct 55 ms 86508 KB Output is correct
9 Correct 58 ms 86508 KB Output is correct
10 Correct 56 ms 86508 KB Output is correct
11 Correct 56 ms 86508 KB Output is correct
12 Correct 57 ms 86508 KB Output is correct
13 Correct 56 ms 86508 KB Output is correct
14 Correct 58 ms 86636 KB Output is correct
15 Correct 56 ms 86508 KB Output is correct
16 Correct 55 ms 86464 KB Output is correct
17 Correct 59 ms 86508 KB Output is correct
18 Correct 56 ms 86508 KB Output is correct
19 Correct 55 ms 86508 KB Output is correct
20 Correct 56 ms 86508 KB Output is correct
21 Correct 56 ms 86456 KB Output is correct
22 Correct 56 ms 86508 KB Output is correct
23 Correct 55 ms 86508 KB Output is correct
24 Correct 55 ms 86508 KB Output is correct
25 Correct 58 ms 86508 KB Output is correct
26 Correct 58 ms 86508 KB Output is correct
27 Correct 59 ms 86636 KB Output is correct
28 Correct 59 ms 86508 KB Output is correct
29 Correct 59 ms 86528 KB Output is correct
30 Correct 58 ms 86508 KB Output is correct
31 Correct 59 ms 86508 KB Output is correct
32 Correct 58 ms 86508 KB Output is correct
33 Correct 60 ms 86508 KB Output is correct
34 Correct 60 ms 86636 KB Output is correct
35 Correct 58 ms 86636 KB Output is correct
36 Correct 59 ms 86636 KB Output is correct
37 Correct 58 ms 86508 KB Output is correct
38 Correct 60 ms 86636 KB Output is correct
39 Correct 58 ms 86636 KB Output is correct
40 Correct 58 ms 86636 KB Output is correct
41 Correct 58 ms 86508 KB Output is correct
42 Correct 59 ms 86636 KB Output is correct
43 Correct 64 ms 86508 KB Output is correct
44 Correct 59 ms 86508 KB Output is correct
45 Correct 312 ms 90280 KB Output is correct
46 Correct 315 ms 90300 KB Output is correct
47 Correct 308 ms 90280 KB Output is correct
48 Correct 312 ms 90708 KB Output is correct
49 Correct 311 ms 90280 KB Output is correct
50 Correct 298 ms 90312 KB Output is correct
51 Correct 302 ms 90328 KB Output is correct
52 Correct 295 ms 94240 KB Output is correct
53 Correct 337 ms 94108 KB Output is correct
54 Correct 318 ms 90344 KB Output is correct
55 Correct 296 ms 89804 KB Output is correct
56 Correct 292 ms 89784 KB Output is correct
57 Correct 293 ms 91568 KB Output is correct
58 Correct 296 ms 94236 KB Output is correct
59 Correct 317 ms 93856 KB Output is correct
60 Correct 323 ms 91808 KB Output is correct
61 Correct 308 ms 90532 KB Output is correct
62 Correct 304 ms 92260 KB Output is correct
63 Correct 316 ms 91424 KB Output is correct
64 Correct 312 ms 90588 KB Output is correct
65 Correct 338 ms 90212 KB Output is correct
66 Correct 340 ms 90476 KB Output is correct
67 Correct 309 ms 90340 KB Output is correct
68 Correct 307 ms 90220 KB Output is correct
69 Correct 300 ms 90504 KB Output is correct
70 Correct 320 ms 90348 KB Output is correct
71 Correct 300 ms 90344 KB Output is correct
72 Correct 288 ms 90344 KB Output is correct
73 Correct 300 ms 90344 KB Output is correct
74 Correct 302 ms 90344 KB Output is correct
75 Correct 268 ms 89580 KB Output is correct
76 Correct 270 ms 89696 KB Output is correct
77 Correct 265 ms 89708 KB Output is correct
78 Correct 310 ms 90328 KB Output is correct
79 Correct 307 ms 90340 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 86508 KB Output is correct
2 Correct 55 ms 86508 KB Output is correct
3 Correct 55 ms 86508 KB Output is correct
4 Correct 55 ms 86508 KB Output is correct
5 Correct 55 ms 86508 KB Output is correct
6 Correct 55 ms 86508 KB Output is correct
7 Correct 56 ms 86508 KB Output is correct
8 Correct 55 ms 86508 KB Output is correct
9 Correct 58 ms 86508 KB Output is correct
10 Correct 56 ms 86508 KB Output is correct
11 Correct 56 ms 86508 KB Output is correct
12 Correct 57 ms 86508 KB Output is correct
13 Correct 56 ms 86508 KB Output is correct
14 Correct 58 ms 86636 KB Output is correct
15 Correct 56 ms 86508 KB Output is correct
16 Correct 55 ms 86464 KB Output is correct
17 Correct 59 ms 86508 KB Output is correct
18 Correct 56 ms 86508 KB Output is correct
19 Correct 55 ms 86508 KB Output is correct
20 Correct 56 ms 86508 KB Output is correct
21 Correct 56 ms 86456 KB Output is correct
22 Correct 56 ms 86508 KB Output is correct
23 Correct 55 ms 86508 KB Output is correct
24 Correct 55 ms 86508 KB Output is correct
25 Correct 58 ms 86508 KB Output is correct
26 Correct 58 ms 86508 KB Output is correct
27 Correct 59 ms 86636 KB Output is correct
28 Correct 59 ms 86508 KB Output is correct
29 Correct 59 ms 86528 KB Output is correct
30 Correct 58 ms 86508 KB Output is correct
31 Correct 59 ms 86508 KB Output is correct
32 Correct 58 ms 86508 KB Output is correct
33 Correct 60 ms 86508 KB Output is correct
34 Correct 60 ms 86636 KB Output is correct
35 Correct 58 ms 86636 KB Output is correct
36 Correct 59 ms 86636 KB Output is correct
37 Correct 58 ms 86508 KB Output is correct
38 Correct 60 ms 86636 KB Output is correct
39 Correct 58 ms 86636 KB Output is correct
40 Correct 58 ms 86636 KB Output is correct
41 Correct 58 ms 86508 KB Output is correct
42 Correct 59 ms 86636 KB Output is correct
43 Correct 64 ms 86508 KB Output is correct
44 Correct 59 ms 86508 KB Output is correct
45 Correct 312 ms 90280 KB Output is correct
46 Correct 315 ms 90300 KB Output is correct
47 Correct 308 ms 90280 KB Output is correct
48 Correct 312 ms 90708 KB Output is correct
49 Correct 311 ms 90280 KB Output is correct
50 Correct 298 ms 90312 KB Output is correct
51 Correct 302 ms 90328 KB Output is correct
52 Correct 295 ms 94240 KB Output is correct
53 Correct 337 ms 94108 KB Output is correct
54 Correct 318 ms 90344 KB Output is correct
55 Correct 296 ms 89804 KB Output is correct
56 Correct 292 ms 89784 KB Output is correct
57 Correct 293 ms 91568 KB Output is correct
58 Correct 296 ms 94236 KB Output is correct
59 Correct 317 ms 93856 KB Output is correct
60 Correct 323 ms 91808 KB Output is correct
61 Correct 308 ms 90532 KB Output is correct
62 Correct 304 ms 92260 KB Output is correct
63 Correct 316 ms 91424 KB Output is correct
64 Correct 312 ms 90588 KB Output is correct
65 Correct 338 ms 90212 KB Output is correct
66 Correct 340 ms 90476 KB Output is correct
67 Correct 309 ms 90340 KB Output is correct
68 Correct 307 ms 90220 KB Output is correct
69 Correct 300 ms 90504 KB Output is correct
70 Correct 320 ms 90348 KB Output is correct
71 Correct 300 ms 90344 KB Output is correct
72 Correct 288 ms 90344 KB Output is correct
73 Correct 300 ms 90344 KB Output is correct
74 Correct 302 ms 90344 KB Output is correct
75 Correct 268 ms 89580 KB Output is correct
76 Correct 270 ms 89696 KB Output is correct
77 Correct 265 ms 89708 KB Output is correct
78 Correct 310 ms 90328 KB Output is correct
79 Correct 307 ms 90340 KB Output is correct
80 Correct 3480 ms 123860 KB Output is correct
81 Correct 3444 ms 124424 KB Output is correct
82 Correct 3427 ms 124468 KB Output is correct
83 Correct 3493 ms 124464 KB Output is correct
84 Correct 3553 ms 124472 KB Output is correct
85 Correct 3298 ms 124436 KB Output is correct
86 Correct 3372 ms 124364 KB Output is correct
87 Correct 3176 ms 164580 KB Output is correct
88 Correct 4144 ms 163564 KB Output is correct
89 Correct 4108 ms 121460 KB Output is correct
90 Correct 3410 ms 119048 KB Output is correct
91 Correct 3299 ms 119076 KB Output is correct
92 Correct 3173 ms 137176 KB Output is correct
93 Correct 3160 ms 164600 KB Output is correct
94 Correct 3658 ms 152308 KB Output is correct
95 Correct 3489 ms 132208 KB Output is correct
96 Correct 3389 ms 125296 KB Output is correct
97 Correct 3450 ms 151660 KB Output is correct
98 Correct 3403 ms 132544 KB Output is correct
99 Correct 3406 ms 124856 KB Output is correct
100 Correct 4601 ms 124660 KB Output is correct
101 Correct 4363 ms 124260 KB Output is correct
102 Correct 4480 ms 121132 KB Output is correct
103 Correct 3755 ms 121840 KB Output is correct
104 Correct 3889 ms 123860 KB Output is correct
105 Correct 4193 ms 120816 KB Output is correct
106 Correct 3477 ms 121200 KB Output is correct
107 Correct 3522 ms 121200 KB Output is correct
108 Correct 3492 ms 121200 KB Output is correct
109 Correct 3542 ms 121072 KB Output is correct
110 Correct 2998 ms 117724 KB Output is correct
111 Correct 3090 ms 117340 KB Output is correct
112 Correct 3046 ms 117724 KB Output is correct
113 Correct 3435 ms 124076 KB Output is correct
114 Correct 3488 ms 124336 KB Output is correct