Submission #46587

# Submission time Handle Problem Language Result Execution time Memory
46587 2018-04-21T15:01:06 Z maksim_gaponov Port Facility (JOI17_port_facility) C++14
78 / 100
6000 ms 67092 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 mem_size = 0;
char mem[20 * MAXN];

inline void* operator new (size_t n) {
    char *res = mem + mem_size;
    mem_size += n;
    return res;
}

inline void operator delete (void*) noexcept { }

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 * n, segment_end[i], i);
		update_ends(0, 0, 2 * n, 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 * n, segment_start[cur], -1);
			update_starts(0, 0, 2 * n, segment_end[cur], -1);
			while (true) {
				int f = query_ends(0, 0, 2 * n, segment_start[cur], segment_end[cur] + 1);
				if (f == -1 || segment_end[f] < segment_end[cur])
					break;
				update_ends(0, 0, 2 * n, segment_start[f], -1);
				color[f] = -color[cur];
				q.push(f);
			}
			while (true) {
				int f = query_starts(0, 0, 2 * n, segment_start[cur], segment_end[cur] + 1);
				if (f == -1 || segment_start[f] > segment_start[cur])
					break;
				update_starts(0, 0, 2 * n, 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:126:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
port_facility.cpp:130: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 29 ms 33144 KB Output is correct
2 Correct 26 ms 33380 KB Output is correct
3 Correct 25 ms 33428 KB Output is correct
4 Correct 26 ms 33428 KB Output is correct
5 Correct 26 ms 33428 KB Output is correct
6 Correct 28 ms 33428 KB Output is correct
7 Correct 27 ms 33428 KB Output is correct
8 Correct 25 ms 33428 KB Output is correct
9 Correct 29 ms 33488 KB Output is correct
10 Correct 30 ms 33604 KB Output is correct
11 Correct 32 ms 33604 KB Output is correct
12 Correct 26 ms 33604 KB Output is correct
13 Correct 28 ms 33604 KB Output is correct
14 Correct 28 ms 33604 KB Output is correct
15 Correct 26 ms 33604 KB Output is correct
16 Correct 27 ms 33604 KB Output is correct
17 Correct 26 ms 33604 KB Output is correct
18 Correct 26 ms 33604 KB Output is correct
19 Correct 27 ms 33604 KB Output is correct
20 Correct 27 ms 33604 KB Output is correct
21 Correct 26 ms 33604 KB Output is correct
22 Correct 29 ms 33604 KB Output is correct
23 Correct 28 ms 33604 KB Output is correct
24 Correct 30 ms 33604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 29 ms 33144 KB Output is correct
2 Correct 26 ms 33380 KB Output is correct
3 Correct 25 ms 33428 KB Output is correct
4 Correct 26 ms 33428 KB Output is correct
5 Correct 26 ms 33428 KB Output is correct
6 Correct 28 ms 33428 KB Output is correct
7 Correct 27 ms 33428 KB Output is correct
8 Correct 25 ms 33428 KB Output is correct
9 Correct 29 ms 33488 KB Output is correct
10 Correct 30 ms 33604 KB Output is correct
11 Correct 32 ms 33604 KB Output is correct
12 Correct 26 ms 33604 KB Output is correct
13 Correct 28 ms 33604 KB Output is correct
14 Correct 28 ms 33604 KB Output is correct
15 Correct 26 ms 33604 KB Output is correct
16 Correct 27 ms 33604 KB Output is correct
17 Correct 26 ms 33604 KB Output is correct
18 Correct 26 ms 33604 KB Output is correct
19 Correct 27 ms 33604 KB Output is correct
20 Correct 27 ms 33604 KB Output is correct
21 Correct 26 ms 33604 KB Output is correct
22 Correct 29 ms 33604 KB Output is correct
23 Correct 28 ms 33604 KB Output is correct
24 Correct 30 ms 33604 KB Output is correct
25 Correct 32 ms 33604 KB Output is correct
26 Correct 32 ms 33604 KB Output is correct
27 Correct 31 ms 33604 KB Output is correct
28 Correct 34 ms 33604 KB Output is correct
29 Correct 32 ms 33664 KB Output is correct
30 Correct 31 ms 33664 KB Output is correct
31 Correct 29 ms 33664 KB Output is correct
32 Correct 33 ms 33664 KB Output is correct
33 Correct 31 ms 33664 KB Output is correct
34 Correct 30 ms 33664 KB Output is correct
35 Correct 28 ms 33664 KB Output is correct
36 Correct 33 ms 33664 KB Output is correct
37 Correct 32 ms 33664 KB Output is correct
38 Correct 31 ms 33664 KB Output is correct
39 Correct 30 ms 33664 KB Output is correct
40 Correct 30 ms 33664 KB Output is correct
41 Correct 28 ms 33664 KB Output is correct
42 Correct 31 ms 33664 KB Output is correct
43 Correct 39 ms 33664 KB Output is correct
44 Correct 32 ms 33664 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 29 ms 33144 KB Output is correct
2 Correct 26 ms 33380 KB Output is correct
3 Correct 25 ms 33428 KB Output is correct
4 Correct 26 ms 33428 KB Output is correct
5 Correct 26 ms 33428 KB Output is correct
6 Correct 28 ms 33428 KB Output is correct
7 Correct 27 ms 33428 KB Output is correct
8 Correct 25 ms 33428 KB Output is correct
9 Correct 29 ms 33488 KB Output is correct
10 Correct 30 ms 33604 KB Output is correct
11 Correct 32 ms 33604 KB Output is correct
12 Correct 26 ms 33604 KB Output is correct
13 Correct 28 ms 33604 KB Output is correct
14 Correct 28 ms 33604 KB Output is correct
15 Correct 26 ms 33604 KB Output is correct
16 Correct 27 ms 33604 KB Output is correct
17 Correct 26 ms 33604 KB Output is correct
18 Correct 26 ms 33604 KB Output is correct
19 Correct 27 ms 33604 KB Output is correct
20 Correct 27 ms 33604 KB Output is correct
21 Correct 26 ms 33604 KB Output is correct
22 Correct 29 ms 33604 KB Output is correct
23 Correct 28 ms 33604 KB Output is correct
24 Correct 30 ms 33604 KB Output is correct
25 Correct 32 ms 33604 KB Output is correct
26 Correct 32 ms 33604 KB Output is correct
27 Correct 31 ms 33604 KB Output is correct
28 Correct 34 ms 33604 KB Output is correct
29 Correct 32 ms 33664 KB Output is correct
30 Correct 31 ms 33664 KB Output is correct
31 Correct 29 ms 33664 KB Output is correct
32 Correct 33 ms 33664 KB Output is correct
33 Correct 31 ms 33664 KB Output is correct
34 Correct 30 ms 33664 KB Output is correct
35 Correct 28 ms 33664 KB Output is correct
36 Correct 33 ms 33664 KB Output is correct
37 Correct 32 ms 33664 KB Output is correct
38 Correct 31 ms 33664 KB Output is correct
39 Correct 30 ms 33664 KB Output is correct
40 Correct 30 ms 33664 KB Output is correct
41 Correct 28 ms 33664 KB Output is correct
42 Correct 31 ms 33664 KB Output is correct
43 Correct 39 ms 33664 KB Output is correct
44 Correct 32 ms 33664 KB Output is correct
45 Correct 361 ms 36544 KB Output is correct
46 Correct 362 ms 36572 KB Output is correct
47 Correct 369 ms 36572 KB Output is correct
48 Correct 354 ms 36572 KB Output is correct
49 Correct 350 ms 36572 KB Output is correct
50 Correct 346 ms 36572 KB Output is correct
51 Correct 410 ms 36692 KB Output is correct
52 Correct 298 ms 36692 KB Output is correct
53 Correct 348 ms 36988 KB Output is correct
54 Correct 478 ms 37372 KB Output is correct
55 Correct 506 ms 37372 KB Output is correct
56 Correct 517 ms 37372 KB Output is correct
57 Correct 307 ms 37372 KB Output is correct
58 Correct 300 ms 37372 KB Output is correct
59 Correct 327 ms 37372 KB Output is correct
60 Correct 368 ms 37372 KB Output is correct
61 Correct 365 ms 37372 KB Output is correct
62 Correct 387 ms 37372 KB Output is correct
63 Correct 400 ms 37372 KB Output is correct
64 Correct 368 ms 37372 KB Output is correct
65 Correct 607 ms 37372 KB Output is correct
66 Correct 617 ms 37372 KB Output is correct
67 Correct 322 ms 37372 KB Output is correct
68 Correct 327 ms 37372 KB Output is correct
69 Correct 311 ms 37372 KB Output is correct
70 Correct 315 ms 37372 KB Output is correct
71 Correct 316 ms 37372 KB Output is correct
72 Correct 348 ms 37372 KB Output is correct
73 Correct 345 ms 37372 KB Output is correct
74 Correct 307 ms 37372 KB Output is correct
75 Correct 300 ms 37372 KB Output is correct
76 Correct 290 ms 37372 KB Output is correct
77 Correct 300 ms 37372 KB Output is correct
78 Correct 361 ms 37372 KB Output is correct
79 Correct 340 ms 37372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 29 ms 33144 KB Output is correct
2 Correct 26 ms 33380 KB Output is correct
3 Correct 25 ms 33428 KB Output is correct
4 Correct 26 ms 33428 KB Output is correct
5 Correct 26 ms 33428 KB Output is correct
6 Correct 28 ms 33428 KB Output is correct
7 Correct 27 ms 33428 KB Output is correct
8 Correct 25 ms 33428 KB Output is correct
9 Correct 29 ms 33488 KB Output is correct
10 Correct 30 ms 33604 KB Output is correct
11 Correct 32 ms 33604 KB Output is correct
12 Correct 26 ms 33604 KB Output is correct
13 Correct 28 ms 33604 KB Output is correct
14 Correct 28 ms 33604 KB Output is correct
15 Correct 26 ms 33604 KB Output is correct
16 Correct 27 ms 33604 KB Output is correct
17 Correct 26 ms 33604 KB Output is correct
18 Correct 26 ms 33604 KB Output is correct
19 Correct 27 ms 33604 KB Output is correct
20 Correct 27 ms 33604 KB Output is correct
21 Correct 26 ms 33604 KB Output is correct
22 Correct 29 ms 33604 KB Output is correct
23 Correct 28 ms 33604 KB Output is correct
24 Correct 30 ms 33604 KB Output is correct
25 Correct 32 ms 33604 KB Output is correct
26 Correct 32 ms 33604 KB Output is correct
27 Correct 31 ms 33604 KB Output is correct
28 Correct 34 ms 33604 KB Output is correct
29 Correct 32 ms 33664 KB Output is correct
30 Correct 31 ms 33664 KB Output is correct
31 Correct 29 ms 33664 KB Output is correct
32 Correct 33 ms 33664 KB Output is correct
33 Correct 31 ms 33664 KB Output is correct
34 Correct 30 ms 33664 KB Output is correct
35 Correct 28 ms 33664 KB Output is correct
36 Correct 33 ms 33664 KB Output is correct
37 Correct 32 ms 33664 KB Output is correct
38 Correct 31 ms 33664 KB Output is correct
39 Correct 30 ms 33664 KB Output is correct
40 Correct 30 ms 33664 KB Output is correct
41 Correct 28 ms 33664 KB Output is correct
42 Correct 31 ms 33664 KB Output is correct
43 Correct 39 ms 33664 KB Output is correct
44 Correct 32 ms 33664 KB Output is correct
45 Correct 361 ms 36544 KB Output is correct
46 Correct 362 ms 36572 KB Output is correct
47 Correct 369 ms 36572 KB Output is correct
48 Correct 354 ms 36572 KB Output is correct
49 Correct 350 ms 36572 KB Output is correct
50 Correct 346 ms 36572 KB Output is correct
51 Correct 410 ms 36692 KB Output is correct
52 Correct 298 ms 36692 KB Output is correct
53 Correct 348 ms 36988 KB Output is correct
54 Correct 478 ms 37372 KB Output is correct
55 Correct 506 ms 37372 KB Output is correct
56 Correct 517 ms 37372 KB Output is correct
57 Correct 307 ms 37372 KB Output is correct
58 Correct 300 ms 37372 KB Output is correct
59 Correct 327 ms 37372 KB Output is correct
60 Correct 368 ms 37372 KB Output is correct
61 Correct 365 ms 37372 KB Output is correct
62 Correct 387 ms 37372 KB Output is correct
63 Correct 400 ms 37372 KB Output is correct
64 Correct 368 ms 37372 KB Output is correct
65 Correct 607 ms 37372 KB Output is correct
66 Correct 617 ms 37372 KB Output is correct
67 Correct 322 ms 37372 KB Output is correct
68 Correct 327 ms 37372 KB Output is correct
69 Correct 311 ms 37372 KB Output is correct
70 Correct 315 ms 37372 KB Output is correct
71 Correct 316 ms 37372 KB Output is correct
72 Correct 348 ms 37372 KB Output is correct
73 Correct 345 ms 37372 KB Output is correct
74 Correct 307 ms 37372 KB Output is correct
75 Correct 300 ms 37372 KB Output is correct
76 Correct 290 ms 37372 KB Output is correct
77 Correct 300 ms 37372 KB Output is correct
78 Correct 361 ms 37372 KB Output is correct
79 Correct 340 ms 37372 KB Output is correct
80 Correct 4633 ms 63084 KB Output is correct
81 Correct 4533 ms 63084 KB Output is correct
82 Correct 4623 ms 63084 KB Output is correct
83 Correct 5000 ms 63220 KB Output is correct
84 Correct 4705 ms 63220 KB Output is correct
85 Correct 4863 ms 63220 KB Output is correct
86 Correct 5081 ms 63416 KB Output is correct
87 Correct 4357 ms 63416 KB Output is correct
88 Correct 5081 ms 67092 KB Output is correct
89 Execution timed out 6039 ms 67092 KB Time limit exceeded
90 Halted 0 ms 0 KB -