Submission #46592

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
46592	2018-04-21T15:52:22 Z	maksim_gaponov	Port Facility (JOI17_port_facility)	C++14	78 / 100	6000 ms	221776 KB

port_facility

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops,unroll-all-loops")
#pragma GCC target("sse,sse2,sse3,sse4,tune=native")
#ifdef KEK
#define FILE_IN "input.txt"
#define FILE_OUT "output.txt"
#endif
#include <iostream>
#include <cstdlib>
#include <climits>
#include <set>
#include <map>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <vector>
#include <algorithm>
#include <queue>
 
using namespace std;
const int mod = 1000000007;
 
void openFiles() {
#ifdef KEK
	assert(freopen(FILE_IN, "r", stdin));
	assert(freopen(FILE_OUT, "w", stdout));
#endif
}
 
const int MAXN = 1048576;
 
int max_end[2 * 2 * MAXN];
int min_start[2 * 2 * MAXN];
int color[MAXN];
int segment_start[MAXN], segment_end[MAXN];
bool used[MAXN];
bool active[MAXN];
 
int actions[2 * MAXN];
queue<int> q;
 
int get_max_end(int i, int j) {
	if (i == -1)
		return j;
	if (j == -1)
		return i;
	if (segment_end[i] > segment_end[j])
		return i;
	return j;
}
 
int get_min_start(int i, int j) {
	if (i == -1)
		return j;
	if (j == -1)
		return i;
	if (segment_start[i] < segment_start[j])
		return i;
	return j;
}
 
void update_ends(int x, int l, int r, int i, int val) {
	if (l > i || r <= i)
		return;
	if (r - l == 1) {
		max_end[x] = val;
		return;
	}
	int c = (l + r) / 2;
	update_ends(2 * x + 1, l, c, i, val);
	update_ends(2 * x + 2, c, r, i, val);
	max_end[x] = get_max_end(max_end[2 * x + 1], max_end[2 * x + 2]);
}
 
void update_starts(int x, int l, int r, int i, int val) {
	if (l > i || r <= i)
		return;
	if (r - l == 1) {
		min_start[x] = val;
		return;
	}
	int c = (l + r) / 2;
	update_starts(2 * x + 1, l, c, i, val);
	update_starts(2 * x + 2, c, r, i, val);
	min_start[x] = get_min_start(min_start[2 * x + 1], min_start[2 * x + 2]);
}
 
int query_ends(int x, int l, int r, int ql, int qr) {
	if (l >= qr || r <= ql)
		return -1;
	if (ql <= l && r <= qr)
		return max_end[x];
	int c = (l + r) / 2;
	return get_max_end(
		query_ends(2 * x + 1, l, c, ql, qr),
		query_ends(2 * x + 2, c, r, ql, qr)
	);
}
 
int query_starts(int x, int l, int r, int ql, int qr) {
	if (l >= qr || r <= ql)
		return -1;
	if (ql <= l && r <= qr)
		return min_start[x];
	int c = (l + r) / 2;
	return get_min_start(
		query_starts(2 * x + 1, l, c, ql, qr),
		query_starts(2 * x + 2, c, r, ql, qr)
	);
}
 
vector<int> v[2];
 
int main() {
	openFiles();
	int n;
	scanf("%d", &n);
	memset(max_end, 255, sizeof(max_end));
	memset(min_start, 255, sizeof(min_start));
	for (int i = 0; i < n; i++) {
        scanf("%d%d", &segment_start[i], &segment_end[i]);
		segment_start[i]--;
		segment_end[i]--;
		update_starts(0, 0, 2 * MAXN, segment_end[i], i);
		update_ends(0, 0, 2 * MAXN, segment_start[i], i);
		actions[segment_start[i]] = i;
		actions[segment_end[i]] = i;
	}
	int ans = 1;
	int itr = 0;
	while (true) {
		while (itr != n && used[itr])
			itr++;
		if (itr == n)
			break;
		ans *= 2;
		ans %= mod;
		q.push(itr);
		color[itr] = 1;
		while (!q.empty()) {
			int cur = q.front();
			q.pop();
			used[cur] = true;
			update_ends(0, 0, 2 * MAXN, segment_start[cur], -1);
			update_starts(0, 0, 2 * MAXN, segment_end[cur], -1);
			while (true) {
				int f = query_ends(0, 0, 2 * MAXN, segment_start[cur], segment_end[cur] + 1);
				if (f == -1 || segment_end[f] < segment_end[cur])
					break;
				update_ends(0, 0, 2 * MAXN, segment_start[f], -1);
				color[f] = -color[cur];
				q.push(f);
			}
			while (true) {
				int f = query_starts(0, 0, 2 * MAXN, segment_start[cur], segment_end[cur] + 1);
				if (f == -1 || segment_start[f] > segment_start[cur])
					break;
				update_starts(0, 0, 2 * MAXN, segment_end[f], -1);
				color[f] = -color[cur];
				q.push(f);
			}
		}
	}
	for (int i = 0; i < 2 * n; i++) {
		int id = actions[i];
		int type = !active[id];
		if (type == true) {
            type = active[id] = true;
		}
		if (type) {
			v[(color[id] + 1) / 2].push_back(id);
		}
		else {
			if (v[(color[id] + 1) / 2].back() != id) {
				printf("0");
				return 0;
			}
			v[(color[id] + 1) / 2].pop_back();
		}
	}
	printf("%d", ans);
	return 0;
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:118:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
port_facility.cpp:122:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &segment_start[i], &segment_end[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	27 ms	33144 KB	Output is correct
2	Correct	25 ms	33252 KB	Output is correct
3	Correct	26 ms	33328 KB	Output is correct
4	Correct	27 ms	33404 KB	Output is correct
5	Correct	24 ms	33404 KB	Output is correct
6	Correct	25 ms	33404 KB	Output is correct
7	Correct	26 ms	33500 KB	Output is correct
8	Correct	25 ms	33500 KB	Output is correct
9	Correct	24 ms	33500 KB	Output is correct
10	Correct	28 ms	33500 KB	Output is correct
11	Correct	25 ms	33500 KB	Output is correct
12	Correct	25 ms	33500 KB	Output is correct
13	Correct	33 ms	33504 KB	Output is correct
14	Correct	24 ms	33504 KB	Output is correct
15	Correct	25 ms	33504 KB	Output is correct
16	Correct	26 ms	33504 KB	Output is correct
17	Correct	25 ms	33504 KB	Output is correct
18	Correct	25 ms	33516 KB	Output is correct
19	Correct	25 ms	33516 KB	Output is correct
20	Correct	26 ms	33516 KB	Output is correct
21	Correct	25 ms	33532 KB	Output is correct
22	Correct	25 ms	33532 KB	Output is correct
23	Correct	26 ms	33532 KB	Output is correct
24	Correct	25 ms	33532 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	27 ms	33144 KB	Output is correct
2	Correct	25 ms	33252 KB	Output is correct
3	Correct	26 ms	33328 KB	Output is correct
4	Correct	27 ms	33404 KB	Output is correct
5	Correct	24 ms	33404 KB	Output is correct
6	Correct	25 ms	33404 KB	Output is correct
7	Correct	26 ms	33500 KB	Output is correct
8	Correct	25 ms	33500 KB	Output is correct
9	Correct	24 ms	33500 KB	Output is correct
10	Correct	28 ms	33500 KB	Output is correct
11	Correct	25 ms	33500 KB	Output is correct
12	Correct	25 ms	33500 KB	Output is correct
13	Correct	33 ms	33504 KB	Output is correct
14	Correct	24 ms	33504 KB	Output is correct
15	Correct	25 ms	33504 KB	Output is correct
16	Correct	26 ms	33504 KB	Output is correct
17	Correct	25 ms	33504 KB	Output is correct
18	Correct	25 ms	33516 KB	Output is correct
19	Correct	25 ms	33516 KB	Output is correct
20	Correct	26 ms	33516 KB	Output is correct
21	Correct	25 ms	33532 KB	Output is correct
22	Correct	25 ms	33532 KB	Output is correct
23	Correct	26 ms	33532 KB	Output is correct
24	Correct	25 ms	33532 KB	Output is correct
25	Correct	30 ms	33532 KB	Output is correct
26	Correct	38 ms	33532 KB	Output is correct
27	Correct	29 ms	33532 KB	Output is correct
28	Correct	29 ms	33532 KB	Output is correct
29	Correct	36 ms	33608 KB	Output is correct
30	Correct	30 ms	33608 KB	Output is correct
31	Correct	31 ms	33608 KB	Output is correct
32	Correct	37 ms	33608 KB	Output is correct
33	Correct	30 ms	33608 KB	Output is correct
34	Correct	31 ms	33608 KB	Output is correct
35	Correct	29 ms	33608 KB	Output is correct
36	Correct	29 ms	33608 KB	Output is correct
37	Correct	31 ms	33608 KB	Output is correct
38	Correct	34 ms	33608 KB	Output is correct
39	Correct	29 ms	33608 KB	Output is correct
40	Correct	28 ms	33636 KB	Output is correct
41	Correct	31 ms	33636 KB	Output is correct
42	Correct	29 ms	33636 KB	Output is correct
43	Correct	29 ms	33636 KB	Output is correct
44	Correct	29 ms	33636 KB	Output is correct

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	27 ms	33144 KB	Output is correct
2	Correct	25 ms	33252 KB	Output is correct
3	Correct	26 ms	33328 KB	Output is correct
4	Correct	27 ms	33404 KB	Output is correct
5	Correct	24 ms	33404 KB	Output is correct
6	Correct	25 ms	33404 KB	Output is correct
7	Correct	26 ms	33500 KB	Output is correct
8	Correct	25 ms	33500 KB	Output is correct
9	Correct	24 ms	33500 KB	Output is correct
10	Correct	28 ms	33500 KB	Output is correct
11	Correct	25 ms	33500 KB	Output is correct
12	Correct	25 ms	33500 KB	Output is correct
13	Correct	33 ms	33504 KB	Output is correct
14	Correct	24 ms	33504 KB	Output is correct
15	Correct	25 ms	33504 KB	Output is correct
16	Correct	26 ms	33504 KB	Output is correct
17	Correct	25 ms	33504 KB	Output is correct
18	Correct	25 ms	33516 KB	Output is correct
19	Correct	25 ms	33516 KB	Output is correct
20	Correct	26 ms	33516 KB	Output is correct
21	Correct	25 ms	33532 KB	Output is correct
22	Correct	25 ms	33532 KB	Output is correct
23	Correct	26 ms	33532 KB	Output is correct
24	Correct	25 ms	33532 KB	Output is correct
25	Correct	30 ms	33532 KB	Output is correct
26	Correct	38 ms	33532 KB	Output is correct
27	Correct	29 ms	33532 KB	Output is correct
28	Correct	29 ms	33532 KB	Output is correct
29	Correct	36 ms	33608 KB	Output is correct
30	Correct	30 ms	33608 KB	Output is correct
31	Correct	31 ms	33608 KB	Output is correct
32	Correct	37 ms	33608 KB	Output is correct
33	Correct	30 ms	33608 KB	Output is correct
34	Correct	31 ms	33608 KB	Output is correct
35	Correct	29 ms	33608 KB	Output is correct
36	Correct	29 ms	33608 KB	Output is correct
37	Correct	31 ms	33608 KB	Output is correct
38	Correct	34 ms	33608 KB	Output is correct
39	Correct	29 ms	33608 KB	Output is correct
40	Correct	28 ms	33636 KB	Output is correct
41	Correct	31 ms	33636 KB	Output is correct
42	Correct	29 ms	33636 KB	Output is correct
43	Correct	29 ms	33636 KB	Output is correct
44	Correct	29 ms	33636 KB	Output is correct
45	Correct	309 ms	36044 KB	Output is correct
46	Correct	292 ms	36044 KB	Output is correct
47	Correct	297 ms	36044 KB	Output is correct
48	Correct	307 ms	36044 KB	Output is correct
49	Correct	303 ms	36044 KB	Output is correct
50	Correct	318 ms	36044 KB	Output is correct
51	Correct	321 ms	36044 KB	Output is correct
52	Correct	252 ms	36044 KB	Output is correct
53	Correct	284 ms	36384 KB	Output is correct
54	Correct	389 ms	36676 KB	Output is correct
55	Correct	383 ms	36676 KB	Output is correct
56	Correct	372 ms	36676 KB	Output is correct
57	Correct	249 ms	36676 KB	Output is correct
58	Correct	240 ms	36676 KB	Output is correct
59	Correct	285 ms	36676 KB	Output is correct
60	Correct	291 ms	36676 KB	Output is correct
61	Correct	289 ms	36676 KB	Output is correct
62	Correct	312 ms	36676 KB	Output is correct
63	Correct	305 ms	36676 KB	Output is correct
64	Correct	313 ms	36676 KB	Output is correct
65	Correct	502 ms	36676 KB	Output is correct
66	Correct	493 ms	36676 KB	Output is correct
67	Correct	266 ms	36676 KB	Output is correct
68	Correct	255 ms	36676 KB	Output is correct
69	Correct	261 ms	36732 KB	Output is correct
70	Correct	261 ms	36732 KB	Output is correct
71	Correct	259 ms	36732 KB	Output is correct
72	Correct	270 ms	36732 KB	Output is correct
73	Correct	248 ms	36732 KB	Output is correct
74	Correct	248 ms	36732 KB	Output is correct
75	Correct	245 ms	36732 KB	Output is correct
76	Correct	234 ms	36732 KB	Output is correct
77	Correct	246 ms	36732 KB	Output is correct
78	Correct	291 ms	36732 KB	Output is correct
79	Correct	292 ms	36732 KB	Output is correct

Subtask #4
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	27 ms	33144 KB	Output is correct
2	Correct	25 ms	33252 KB	Output is correct
3	Correct	26 ms	33328 KB	Output is correct
4	Correct	27 ms	33404 KB	Output is correct
5	Correct	24 ms	33404 KB	Output is correct
6	Correct	25 ms	33404 KB	Output is correct
7	Correct	26 ms	33500 KB	Output is correct
8	Correct	25 ms	33500 KB	Output is correct
9	Correct	24 ms	33500 KB	Output is correct
10	Correct	28 ms	33500 KB	Output is correct
11	Correct	25 ms	33500 KB	Output is correct
12	Correct	25 ms	33500 KB	Output is correct
13	Correct	33 ms	33504 KB	Output is correct
14	Correct	24 ms	33504 KB	Output is correct
15	Correct	25 ms	33504 KB	Output is correct
16	Correct	26 ms	33504 KB	Output is correct
17	Correct	25 ms	33504 KB	Output is correct
18	Correct	25 ms	33516 KB	Output is correct
19	Correct	25 ms	33516 KB	Output is correct
20	Correct	26 ms	33516 KB	Output is correct
21	Correct	25 ms	33532 KB	Output is correct
22	Correct	25 ms	33532 KB	Output is correct
23	Correct	26 ms	33532 KB	Output is correct
24	Correct	25 ms	33532 KB	Output is correct
25	Correct	30 ms	33532 KB	Output is correct
26	Correct	38 ms	33532 KB	Output is correct
27	Correct	29 ms	33532 KB	Output is correct
28	Correct	29 ms	33532 KB	Output is correct
29	Correct	36 ms	33608 KB	Output is correct
30	Correct	30 ms	33608 KB	Output is correct
31	Correct	31 ms	33608 KB	Output is correct
32	Correct	37 ms	33608 KB	Output is correct
33	Correct	30 ms	33608 KB	Output is correct
34	Correct	31 ms	33608 KB	Output is correct
35	Correct	29 ms	33608 KB	Output is correct
36	Correct	29 ms	33608 KB	Output is correct
37	Correct	31 ms	33608 KB	Output is correct
38	Correct	34 ms	33608 KB	Output is correct
39	Correct	29 ms	33608 KB	Output is correct
40	Correct	28 ms	33636 KB	Output is correct
41	Correct	31 ms	33636 KB	Output is correct
42	Correct	29 ms	33636 KB	Output is correct
43	Correct	29 ms	33636 KB	Output is correct
44	Correct	29 ms	33636 KB	Output is correct
45	Correct	309 ms	36044 KB	Output is correct
46	Correct	292 ms	36044 KB	Output is correct
47	Correct	297 ms	36044 KB	Output is correct
48	Correct	307 ms	36044 KB	Output is correct
49	Correct	303 ms	36044 KB	Output is correct
50	Correct	318 ms	36044 KB	Output is correct
51	Correct	321 ms	36044 KB	Output is correct
52	Correct	252 ms	36044 KB	Output is correct
53	Correct	284 ms	36384 KB	Output is correct
54	Correct	389 ms	36676 KB	Output is correct
55	Correct	383 ms	36676 KB	Output is correct
56	Correct	372 ms	36676 KB	Output is correct
57	Correct	249 ms	36676 KB	Output is correct
58	Correct	240 ms	36676 KB	Output is correct
59	Correct	285 ms	36676 KB	Output is correct
60	Correct	291 ms	36676 KB	Output is correct
61	Correct	289 ms	36676 KB	Output is correct
62	Correct	312 ms	36676 KB	Output is correct
63	Correct	305 ms	36676 KB	Output is correct
64	Correct	313 ms	36676 KB	Output is correct
65	Correct	502 ms	36676 KB	Output is correct
66	Correct	493 ms	36676 KB	Output is correct
67	Correct	266 ms	36676 KB	Output is correct
68	Correct	255 ms	36676 KB	Output is correct
69	Correct	261 ms	36732 KB	Output is correct
70	Correct	261 ms	36732 KB	Output is correct
71	Correct	259 ms	36732 KB	Output is correct
72	Correct	270 ms	36732 KB	Output is correct
73	Correct	248 ms	36732 KB	Output is correct
74	Correct	248 ms	36732 KB	Output is correct
75	Correct	245 ms	36732 KB	Output is correct
76	Correct	234 ms	36732 KB	Output is correct
77	Correct	246 ms	36732 KB	Output is correct
78	Correct	291 ms	36732 KB	Output is correct
79	Correct	292 ms	36732 KB	Output is correct
80	Correct	3618 ms	57092 KB	Output is correct
81	Correct	3647 ms	57092 KB	Output is correct
82	Correct	3623 ms	57092 KB	Output is correct
83	Correct	3603 ms	57128 KB	Output is correct
84	Correct	3629 ms	57128 KB	Output is correct
85	Correct	4109 ms	57128 KB	Output is correct
86	Correct	4029 ms	57348 KB	Output is correct
87	Correct	3252 ms	57348 KB	Output is correct
88	Correct	4204 ms	59236 KB	Output is correct
89	Correct	5513 ms	60808 KB	Output is correct
90	Correct	5380 ms	75656 KB	Output is correct
91	Correct	5282 ms	90000 KB	Output is correct
92	Correct	3256 ms	98740 KB	Output is correct
93	Correct	3343 ms	113580 KB	Output is correct
94	Correct	3921 ms	130692 KB	Output is correct
95	Correct	3842 ms	144364 KB	Output is correct
96	Correct	3655 ms	158828 KB	Output is correct
97	Correct	4135 ms	173412 KB	Output is correct
98	Correct	4054 ms	187596 KB	Output is correct
99	Correct	4497 ms	202924 KB	Output is correct
100	Execution timed out	6076 ms	221776 KB	Time limit exceeded
101	Halted	0 ms	0 KB	-

Submission #46592

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 56.0 / 56.0

Subtask #4 0 / 22.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
56.0 / 56.0

Subtask #4
0 / 22.0