Submission #46588

# Submission time Handle Problem Language Result Execution time Memory
46588 2018-04-21T15:13:06 Z maksim_gaponov Port Facility (JOI17_port_facility) C++14
78 / 100
6000 ms 60460 KB
#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:115:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
port_facility.cpp:119: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]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 25 ms 33144 KB Output is correct
2 Correct 58 ms 33252 KB Output is correct
3 Correct 25 ms 33328 KB Output is correct
4 Correct 26 ms 33328 KB Output is correct
5 Correct 26 ms 33328 KB Output is correct
6 Correct 25 ms 33328 KB Output is correct
7 Correct 30 ms 33328 KB Output is correct
8 Correct 25 ms 33384 KB Output is correct
9 Correct 25 ms 33384 KB Output is correct
10 Correct 26 ms 33432 KB Output is correct
11 Correct 27 ms 33480 KB Output is correct
12 Correct 29 ms 33480 KB Output is correct
13 Correct 26 ms 33480 KB Output is correct
14 Correct 28 ms 33480 KB Output is correct
15 Correct 28 ms 33480 KB Output is correct
16 Correct 27 ms 33480 KB Output is correct
17 Correct 26 ms 33480 KB Output is correct
18 Correct 25 ms 33480 KB Output is correct
19 Correct 25 ms 33508 KB Output is correct
20 Correct 27 ms 33508 KB Output is correct
21 Correct 30 ms 33508 KB Output is correct
22 Correct 26 ms 33508 KB Output is correct
23 Correct 25 ms 33508 KB Output is correct
24 Correct 26 ms 33508 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 25 ms 33144 KB Output is correct
2 Correct 58 ms 33252 KB Output is correct
3 Correct 25 ms 33328 KB Output is correct
4 Correct 26 ms 33328 KB Output is correct
5 Correct 26 ms 33328 KB Output is correct
6 Correct 25 ms 33328 KB Output is correct
7 Correct 30 ms 33328 KB Output is correct
8 Correct 25 ms 33384 KB Output is correct
9 Correct 25 ms 33384 KB Output is correct
10 Correct 26 ms 33432 KB Output is correct
11 Correct 27 ms 33480 KB Output is correct
12 Correct 29 ms 33480 KB Output is correct
13 Correct 26 ms 33480 KB Output is correct
14 Correct 28 ms 33480 KB Output is correct
15 Correct 28 ms 33480 KB Output is correct
16 Correct 27 ms 33480 KB Output is correct
17 Correct 26 ms 33480 KB Output is correct
18 Correct 25 ms 33480 KB Output is correct
19 Correct 25 ms 33508 KB Output is correct
20 Correct 27 ms 33508 KB Output is correct
21 Correct 30 ms 33508 KB Output is correct
22 Correct 26 ms 33508 KB Output is correct
23 Correct 25 ms 33508 KB Output is correct
24 Correct 26 ms 33508 KB Output is correct
25 Correct 31 ms 33516 KB Output is correct
26 Correct 31 ms 33520 KB Output is correct
27 Correct 35 ms 33644 KB Output is correct
28 Correct 31 ms 33644 KB Output is correct
29 Correct 34 ms 33644 KB Output is correct
30 Correct 30 ms 33644 KB Output is correct
31 Correct 34 ms 33644 KB Output is correct
32 Correct 31 ms 33644 KB Output is correct
33 Correct 31 ms 33644 KB Output is correct
34 Correct 32 ms 33644 KB Output is correct
35 Correct 30 ms 33644 KB Output is correct
36 Correct 33 ms 33644 KB Output is correct
37 Correct 44 ms 33644 KB Output is correct
38 Correct 36 ms 33644 KB Output is correct
39 Correct 31 ms 33644 KB Output is correct
40 Correct 31 ms 33644 KB Output is correct
41 Correct 32 ms 33644 KB Output is correct
42 Correct 34 ms 33644 KB Output is correct
43 Correct 31 ms 33644 KB Output is correct
44 Correct 37 ms 33644 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 25 ms 33144 KB Output is correct
2 Correct 58 ms 33252 KB Output is correct
3 Correct 25 ms 33328 KB Output is correct
4 Correct 26 ms 33328 KB Output is correct
5 Correct 26 ms 33328 KB Output is correct
6 Correct 25 ms 33328 KB Output is correct
7 Correct 30 ms 33328 KB Output is correct
8 Correct 25 ms 33384 KB Output is correct
9 Correct 25 ms 33384 KB Output is correct
10 Correct 26 ms 33432 KB Output is correct
11 Correct 27 ms 33480 KB Output is correct
12 Correct 29 ms 33480 KB Output is correct
13 Correct 26 ms 33480 KB Output is correct
14 Correct 28 ms 33480 KB Output is correct
15 Correct 28 ms 33480 KB Output is correct
16 Correct 27 ms 33480 KB Output is correct
17 Correct 26 ms 33480 KB Output is correct
18 Correct 25 ms 33480 KB Output is correct
19 Correct 25 ms 33508 KB Output is correct
20 Correct 27 ms 33508 KB Output is correct
21 Correct 30 ms 33508 KB Output is correct
22 Correct 26 ms 33508 KB Output is correct
23 Correct 25 ms 33508 KB Output is correct
24 Correct 26 ms 33508 KB Output is correct
25 Correct 31 ms 33516 KB Output is correct
26 Correct 31 ms 33520 KB Output is correct
27 Correct 35 ms 33644 KB Output is correct
28 Correct 31 ms 33644 KB Output is correct
29 Correct 34 ms 33644 KB Output is correct
30 Correct 30 ms 33644 KB Output is correct
31 Correct 34 ms 33644 KB Output is correct
32 Correct 31 ms 33644 KB Output is correct
33 Correct 31 ms 33644 KB Output is correct
34 Correct 32 ms 33644 KB Output is correct
35 Correct 30 ms 33644 KB Output is correct
36 Correct 33 ms 33644 KB Output is correct
37 Correct 44 ms 33644 KB Output is correct
38 Correct 36 ms 33644 KB Output is correct
39 Correct 31 ms 33644 KB Output is correct
40 Correct 31 ms 33644 KB Output is correct
41 Correct 32 ms 33644 KB Output is correct
42 Correct 34 ms 33644 KB Output is correct
43 Correct 31 ms 33644 KB Output is correct
44 Correct 37 ms 33644 KB Output is correct
45 Correct 401 ms 36080 KB Output is correct
46 Correct 389 ms 36080 KB Output is correct
47 Correct 382 ms 36080 KB Output is correct
48 Correct 369 ms 36080 KB Output is correct
49 Correct 377 ms 36080 KB Output is correct
50 Correct 374 ms 36080 KB Output is correct
51 Correct 413 ms 36080 KB Output is correct
52 Correct 322 ms 36080 KB Output is correct
53 Correct 369 ms 36368 KB Output is correct
54 Correct 558 ms 36808 KB Output is correct
55 Correct 566 ms 36808 KB Output is correct
56 Correct 555 ms 36808 KB Output is correct
57 Correct 343 ms 36808 KB Output is correct
58 Correct 315 ms 36808 KB Output is correct
59 Correct 380 ms 36808 KB Output is correct
60 Correct 397 ms 36808 KB Output is correct
61 Correct 387 ms 36808 KB Output is correct
62 Correct 426 ms 36808 KB Output is correct
63 Correct 433 ms 36808 KB Output is correct
64 Correct 401 ms 36808 KB Output is correct
65 Correct 664 ms 36808 KB Output is correct
66 Correct 659 ms 36808 KB Output is correct
67 Correct 350 ms 36808 KB Output is correct
68 Correct 365 ms 36808 KB Output is correct
69 Correct 349 ms 36808 KB Output is correct
70 Correct 365 ms 36808 KB Output is correct
71 Correct 363 ms 36808 KB Output is correct
72 Correct 360 ms 36808 KB Output is correct
73 Correct 383 ms 36808 KB Output is correct
74 Correct 351 ms 36808 KB Output is correct
75 Correct 344 ms 36808 KB Output is correct
76 Correct 331 ms 36808 KB Output is correct
77 Correct 338 ms 36808 KB Output is correct
78 Correct 389 ms 36808 KB Output is correct
79 Correct 384 ms 36808 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 25 ms 33144 KB Output is correct
2 Correct 58 ms 33252 KB Output is correct
3 Correct 25 ms 33328 KB Output is correct
4 Correct 26 ms 33328 KB Output is correct
5 Correct 26 ms 33328 KB Output is correct
6 Correct 25 ms 33328 KB Output is correct
7 Correct 30 ms 33328 KB Output is correct
8 Correct 25 ms 33384 KB Output is correct
9 Correct 25 ms 33384 KB Output is correct
10 Correct 26 ms 33432 KB Output is correct
11 Correct 27 ms 33480 KB Output is correct
12 Correct 29 ms 33480 KB Output is correct
13 Correct 26 ms 33480 KB Output is correct
14 Correct 28 ms 33480 KB Output is correct
15 Correct 28 ms 33480 KB Output is correct
16 Correct 27 ms 33480 KB Output is correct
17 Correct 26 ms 33480 KB Output is correct
18 Correct 25 ms 33480 KB Output is correct
19 Correct 25 ms 33508 KB Output is correct
20 Correct 27 ms 33508 KB Output is correct
21 Correct 30 ms 33508 KB Output is correct
22 Correct 26 ms 33508 KB Output is correct
23 Correct 25 ms 33508 KB Output is correct
24 Correct 26 ms 33508 KB Output is correct
25 Correct 31 ms 33516 KB Output is correct
26 Correct 31 ms 33520 KB Output is correct
27 Correct 35 ms 33644 KB Output is correct
28 Correct 31 ms 33644 KB Output is correct
29 Correct 34 ms 33644 KB Output is correct
30 Correct 30 ms 33644 KB Output is correct
31 Correct 34 ms 33644 KB Output is correct
32 Correct 31 ms 33644 KB Output is correct
33 Correct 31 ms 33644 KB Output is correct
34 Correct 32 ms 33644 KB Output is correct
35 Correct 30 ms 33644 KB Output is correct
36 Correct 33 ms 33644 KB Output is correct
37 Correct 44 ms 33644 KB Output is correct
38 Correct 36 ms 33644 KB Output is correct
39 Correct 31 ms 33644 KB Output is correct
40 Correct 31 ms 33644 KB Output is correct
41 Correct 32 ms 33644 KB Output is correct
42 Correct 34 ms 33644 KB Output is correct
43 Correct 31 ms 33644 KB Output is correct
44 Correct 37 ms 33644 KB Output is correct
45 Correct 401 ms 36080 KB Output is correct
46 Correct 389 ms 36080 KB Output is correct
47 Correct 382 ms 36080 KB Output is correct
48 Correct 369 ms 36080 KB Output is correct
49 Correct 377 ms 36080 KB Output is correct
50 Correct 374 ms 36080 KB Output is correct
51 Correct 413 ms 36080 KB Output is correct
52 Correct 322 ms 36080 KB Output is correct
53 Correct 369 ms 36368 KB Output is correct
54 Correct 558 ms 36808 KB Output is correct
55 Correct 566 ms 36808 KB Output is correct
56 Correct 555 ms 36808 KB Output is correct
57 Correct 343 ms 36808 KB Output is correct
58 Correct 315 ms 36808 KB Output is correct
59 Correct 380 ms 36808 KB Output is correct
60 Correct 397 ms 36808 KB Output is correct
61 Correct 387 ms 36808 KB Output is correct
62 Correct 426 ms 36808 KB Output is correct
63 Correct 433 ms 36808 KB Output is correct
64 Correct 401 ms 36808 KB Output is correct
65 Correct 664 ms 36808 KB Output is correct
66 Correct 659 ms 36808 KB Output is correct
67 Correct 350 ms 36808 KB Output is correct
68 Correct 365 ms 36808 KB Output is correct
69 Correct 349 ms 36808 KB Output is correct
70 Correct 365 ms 36808 KB Output is correct
71 Correct 363 ms 36808 KB Output is correct
72 Correct 360 ms 36808 KB Output is correct
73 Correct 383 ms 36808 KB Output is correct
74 Correct 351 ms 36808 KB Output is correct
75 Correct 344 ms 36808 KB Output is correct
76 Correct 331 ms 36808 KB Output is correct
77 Correct 338 ms 36808 KB Output is correct
78 Correct 389 ms 36808 KB Output is correct
79 Correct 384 ms 36808 KB Output is correct
80 Correct 4675 ms 57104 KB Output is correct
81 Correct 4718 ms 57148 KB Output is correct
82 Correct 4746 ms 57148 KB Output is correct
83 Correct 4742 ms 57148 KB Output is correct
84 Correct 4773 ms 57236 KB Output is correct
85 Correct 4910 ms 57236 KB Output is correct
86 Correct 5129 ms 57332 KB Output is correct
87 Correct 4329 ms 57332 KB Output is correct
88 Correct 5023 ms 59460 KB Output is correct
89 Execution timed out 6012 ms 60460 KB Time limit exceeded
90 Halted 0 ms 0 KB -