oj.uz

Submission #392055

# Submission time Handle Problem Language Result Execution time Memory
392055 2021-04-20T10:45:06 Z peijar Port Facility (JOI17_port_facility) C++17
100 / 100
 1100 ms 165104 KB 
#include <bits/stdc++.h>
using namespace std;

struct UnionFind
{
	vector<int> id;

	UnionFind(int N) : id(N, -1) {}

	int find(int i)
	{
		return id[i] < 0 ? i : id[i] = find(id[i]);
	}

	void merge(int a, int b)
	{
		a = find(a), b = find(b);
		if (a == b) return;
		id[a] += id[b];
		id[b] = a;
	}
};

const int MOD = 1e9 + 7;
const int MAXN = 1e6;
vector<int> adj[MAXN];
int event[2 * MAXN];
priority_queue<int, vector<int>, greater<int>> pqCC[MAXN];
bool vu[MAXN],seen[MAXN];
int side[MAXN];
UnionFind uf(MAXN);

auto comp = [](int i, int j)
{
	return pqCC[i].top() > pqCC[j].top();
};

priority_queue<int, vector<int>, decltype(comp)> ccEnVies(comp);

signed main(void)
{
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	int nbConteneurs;
	cin >> nbConteneurs;

	vector<pair<int, int>> conteneurs(nbConteneurs);
	for (auto &[deb, fin] : conteneurs)
	{
		cin >> deb >> fin;
		--deb, --fin;
	}
	sort(conteneurs.begin(), conteneurs.end());
	for (int i(0); i < nbConteneurs; ++i)
		event[conteneurs[i].first] = event[conteneurs[i].second] = i;


	vector<int> block(2 * nbConteneurs, -1);
	
	for (int iCont(0); iCont < nbConteneurs; ++iCont)
	{
		auto [deb, fin] = conteneurs[iCont];
		int curCC = iCont;
		pqCC[curCC].push(fin);

		while (!ccEnVies.empty())
		{
			int iCC = ccEnVies.top(); ccEnVies.pop();
		
			// On vire les inutiles : 
			if (pqCC[iCC].top() < deb)
			{
				while (!pqCC[iCC].empty() and pqCC[iCC].top() < deb)
					pqCC[iCC].pop();
				if (!pqCC[iCC].empty())
					ccEnVies.push(iCC);
				continue;
			}

			// On a plus d'aretes :
			if (pqCC[iCC].top() > fin)
			{
				ccEnVies.push(iCC);
				break;
			}

			block[iCont] = event[pqCC[iCC].top()];
			adj[iCont].push_back(block[iCont]);
			adj[block[iCont]].push_back(iCont);
			// On a une arete : 
			// On fusionne les cc
			if (uf.id[curCC] > uf.id[iCC])
				swap(curCC, iCC);
			uf.merge(curCC, iCC);
			assert(uf.find(curCC) == curCC);
			while (!pqCC[iCC].empty())
			{
				pqCC[curCC].push(pqCC[iCC].top());
				pqCC[iCC].pop();
			}
		}
		ccEnVies.push(curCC);
	}
	
	queue<int> q;
	for (int i = 0; i < nbConteneurs; ++i) 
		if (uf.id[i] < 0)
			q.push(i);

	while (!q.empty())
	{
		auto cur = q.front(); q.pop();
		seen[cur] = true;
		for (auto nxt : adj[cur])
			if (!seen[nxt])
			{
				side[nxt] = !side[cur];
				q.push(nxt);
			}
	}

	stack<int> stk[2];
	for (int t(0); t < 2 * nbConteneurs; ++t)
	{
		int id = event[t];
		if (vu[id])
		{
			if (stk[side[id]].top() != id)
			{
				cout << 0 << endl;
				return 0;
			}
			stk[side[id]].pop();
		}
		else
		{
			vu[id] = true;
			stk[side[id]].push(id);
		}
	}
	int nbCC(0);
	for (int i(0); i < nbConteneurs; ++i)
		nbCC += uf.id[i] < 0;
	int ret = 1;
	for (int i(0); i < nbCC; ++i)
		ret = (ret * 2) % MOD;
	cout << ret << endl;

}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 58948 KB Output is correct
2 Correct 36 ms 59012 KB Output is correct
3 Correct 35 ms 58968 KB Output is correct
4 Correct 41 ms 58956 KB Output is correct
5 Correct 36 ms 58956 KB Output is correct
6 Correct 35 ms 59036 KB Output is correct
7 Correct 34 ms 59036 KB Output is correct
8 Correct 36 ms 59052 KB Output is correct
9 Correct 35 ms 58996 KB Output is correct
10 Correct 37 ms 58936 KB Output is correct
11 Correct 35 ms 59036 KB Output is correct
12 Correct 35 ms 58996 KB Output is correct
13 Correct 36 ms 59052 KB Output is correct
14 Correct 36 ms 59032 KB Output is correct
15 Correct 34 ms 58956 KB Output is correct
16 Correct 36 ms 58956 KB Output is correct
17 Correct 36 ms 58956 KB Output is correct
18 Correct 35 ms 59040 KB Output is correct
19 Correct 34 ms 58964 KB Output is correct
20 Correct 34 ms 58956 KB Output is correct
21 Correct 35 ms 58996 KB Output is correct
22 Correct 37 ms 59012 KB Output is correct
23 Correct 35 ms 58980 KB Output is correct
24 Correct 36 ms 58960 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 58948 KB Output is correct
2 Correct 36 ms 59012 KB Output is correct
3 Correct 35 ms 58968 KB Output is correct
4 Correct 41 ms 58956 KB Output is correct
5 Correct 36 ms 58956 KB Output is correct
6 Correct 35 ms 59036 KB Output is correct
7 Correct 34 ms 59036 KB Output is correct
8 Correct 36 ms 59052 KB Output is correct
9 Correct 35 ms 58996 KB Output is correct
10 Correct 37 ms 58936 KB Output is correct
11 Correct 35 ms 59036 KB Output is correct
12 Correct 35 ms 58996 KB Output is correct
13 Correct 36 ms 59052 KB Output is correct
14 Correct 36 ms 59032 KB Output is correct
15 Correct 34 ms 58956 KB Output is correct
16 Correct 36 ms 58956 KB Output is correct
17 Correct 36 ms 58956 KB Output is correct
18 Correct 35 ms 59040 KB Output is correct
19 Correct 34 ms 58964 KB Output is correct
20 Correct 34 ms 58956 KB Output is correct
21 Correct 35 ms 58996 KB Output is correct
22 Correct 37 ms 59012 KB Output is correct
23 Correct 35 ms 58980 KB Output is correct
24 Correct 36 ms 58960 KB Output is correct
25 Correct 35 ms 59212 KB Output is correct
26 Correct 37 ms 59156 KB Output is correct
27 Correct 36 ms 59228 KB Output is correct
28 Correct 36 ms 59248 KB Output is correct
29 Correct 37 ms 59176 KB Output is correct
30 Correct 37 ms 59124 KB Output is correct
31 Correct 38 ms 59216 KB Output is correct
32 Correct 36 ms 59212 KB Output is correct
33 Correct 37 ms 59224 KB Output is correct
34 Correct 36 ms 59156 KB Output is correct
35 Correct 35 ms 59136 KB Output is correct
36 Correct 39 ms 59092 KB Output is correct
37 Correct 36 ms 59160 KB Output is correct
38 Correct 36 ms 59212 KB Output is correct
39 Correct 37 ms 59232 KB Output is correct
40 Correct 35 ms 59076 KB Output is correct
41 Correct 36 ms 59244 KB Output is correct
42 Correct 37 ms 59252 KB Output is correct
43 Correct 41 ms 59192 KB Output is correct
44 Correct 37 ms 59188 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 58948 KB Output is correct
2 Correct 36 ms 59012 KB Output is correct
3 Correct 35 ms 58968 KB Output is correct
4 Correct 41 ms 58956 KB Output is correct
5 Correct 36 ms 58956 KB Output is correct
6 Correct 35 ms 59036 KB Output is correct
7 Correct 34 ms 59036 KB Output is correct
8 Correct 36 ms 59052 KB Output is correct
9 Correct 35 ms 58996 KB Output is correct
10 Correct 37 ms 58936 KB Output is correct
11 Correct 35 ms 59036 KB Output is correct
12 Correct 35 ms 58996 KB Output is correct
13 Correct 36 ms 59052 KB Output is correct
14 Correct 36 ms 59032 KB Output is correct
15 Correct 34 ms 58956 KB Output is correct
16 Correct 36 ms 58956 KB Output is correct
17 Correct 36 ms 58956 KB Output is correct
18 Correct 35 ms 59040 KB Output is correct
19 Correct 34 ms 58964 KB Output is correct
20 Correct 34 ms 58956 KB Output is correct
21 Correct 35 ms 58996 KB Output is correct
22 Correct 37 ms 59012 KB Output is correct
23 Correct 35 ms 58980 KB Output is correct
24 Correct 36 ms 58960 KB Output is correct
25 Correct 35 ms 59212 KB Output is correct
26 Correct 37 ms 59156 KB Output is correct
27 Correct 36 ms 59228 KB Output is correct
28 Correct 36 ms 59248 KB Output is correct
29 Correct 37 ms 59176 KB Output is correct
30 Correct 37 ms 59124 KB Output is correct
31 Correct 38 ms 59216 KB Output is correct
32 Correct 36 ms 59212 KB Output is correct
33 Correct 37 ms 59224 KB Output is correct
34 Correct 36 ms 59156 KB Output is correct
35 Correct 35 ms 59136 KB Output is correct
36 Correct 39 ms 59092 KB Output is correct
37 Correct 36 ms 59160 KB Output is correct
38 Correct 36 ms 59212 KB Output is correct
39 Correct 37 ms 59232 KB Output is correct
40 Correct 35 ms 59076 KB Output is correct
41 Correct 36 ms 59244 KB Output is correct
42 Correct 37 ms 59252 KB Output is correct
43 Correct 41 ms 59192 KB Output is correct
44 Correct 37 ms 59188 KB Output is correct
45 Correct 119 ms 68176 KB Output is correct
46 Correct 112 ms 68144 KB Output is correct
47 Correct 123 ms 68164 KB Output is correct
48 Correct 115 ms 68168 KB Output is correct
49 Correct 118 ms 68220 KB Output is correct
50 Correct 114 ms 68164 KB Output is correct
51 Correct 118 ms 68156 KB Output is correct
52 Correct 75 ms 65128 KB Output is correct
53 Correct 98 ms 65508 KB Output is correct
54 Correct 83 ms 69428 KB Output is correct
55 Correct 86 ms 69408 KB Output is correct
56 Correct 91 ms 69304 KB Output is correct
57 Correct 84 ms 68472 KB Output is correct
58 Correct 77 ms 65088 KB Output is correct
59 Correct 111 ms 66120 KB Output is correct
60 Correct 128 ms 67392 KB Output is correct
61 Correct 127 ms 67884 KB Output is correct
62 Correct 106 ms 66788 KB Output is correct
63 Correct 112 ms 67504 KB Output is correct
64 Correct 125 ms 67964 KB Output is correct
65 Correct 104 ms 68852 KB Output is correct
66 Correct 105 ms 68864 KB Output is correct
67 Correct 109 ms 69224 KB Output is correct
68 Correct 108 ms 69056 KB Output is correct
69 Correct 102 ms 69160 KB Output is correct
70 Correct 101 ms 69168 KB Output is correct
71 Correct 107 ms 69672 KB Output is correct
72 Correct 113 ms 69672 KB Output is correct
73 Correct 114 ms 69512 KB Output is correct
74 Correct 93 ms 69576 KB Output is correct
75 Correct 90 ms 68252 KB Output is correct
76 Correct 89 ms 68148 KB Output is correct
77 Correct 95 ms 68168 KB Output is correct
78 Correct 114 ms 68140 KB Output is correct
79 Correct 120 ms 68128 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 58948 KB Output is correct
2 Correct 36 ms 59012 KB Output is correct
3 Correct 35 ms 58968 KB Output is correct
4 Correct 41 ms 58956 KB Output is correct
5 Correct 36 ms 58956 KB Output is correct
6 Correct 35 ms 59036 KB Output is correct
7 Correct 34 ms 59036 KB Output is correct
8 Correct 36 ms 59052 KB Output is correct
9 Correct 35 ms 58996 KB Output is correct
10 Correct 37 ms 58936 KB Output is correct
11 Correct 35 ms 59036 KB Output is correct
12 Correct 35 ms 58996 KB Output is correct
13 Correct 36 ms 59052 KB Output is correct
14 Correct 36 ms 59032 KB Output is correct
15 Correct 34 ms 58956 KB Output is correct
16 Correct 36 ms 58956 KB Output is correct
17 Correct 36 ms 58956 KB Output is correct
18 Correct 35 ms 59040 KB Output is correct
19 Correct 34 ms 58964 KB Output is correct
20 Correct 34 ms 58956 KB Output is correct
21 Correct 35 ms 58996 KB Output is correct
22 Correct 37 ms 59012 KB Output is correct
23 Correct 35 ms 58980 KB Output is correct
24 Correct 36 ms 58960 KB Output is correct
25 Correct 35 ms 59212 KB Output is correct
26 Correct 37 ms 59156 KB Output is correct
27 Correct 36 ms 59228 KB Output is correct
28 Correct 36 ms 59248 KB Output is correct
29 Correct 37 ms 59176 KB Output is correct
30 Correct 37 ms 59124 KB Output is correct
31 Correct 38 ms 59216 KB Output is correct
32 Correct 36 ms 59212 KB Output is correct
33 Correct 37 ms 59224 KB Output is correct
34 Correct 36 ms 59156 KB Output is correct
35 Correct 35 ms 59136 KB Output is correct
36 Correct 39 ms 59092 KB Output is correct
37 Correct 36 ms 59160 KB Output is correct
38 Correct 36 ms 59212 KB Output is correct
39 Correct 37 ms 59232 KB Output is correct
40 Correct 35 ms 59076 KB Output is correct
41 Correct 36 ms 59244 KB Output is correct
42 Correct 37 ms 59252 KB Output is correct
43 Correct 41 ms 59192 KB Output is correct
44 Correct 37 ms 59188 KB Output is correct
45 Correct 119 ms 68176 KB Output is correct
46 Correct 112 ms 68144 KB Output is correct
47 Correct 123 ms 68164 KB Output is correct
48 Correct 115 ms 68168 KB Output is correct
49 Correct 118 ms 68220 KB Output is correct
50 Correct 114 ms 68164 KB Output is correct
51 Correct 118 ms 68156 KB Output is correct
52 Correct 75 ms 65128 KB Output is correct
53 Correct 98 ms 65508 KB Output is correct
54 Correct 83 ms 69428 KB Output is correct
55 Correct 86 ms 69408 KB Output is correct
56 Correct 91 ms 69304 KB Output is correct
57 Correct 84 ms 68472 KB Output is correct
58 Correct 77 ms 65088 KB Output is correct
59 Correct 111 ms 66120 KB Output is correct
60 Correct 128 ms 67392 KB Output is correct
61 Correct 127 ms 67884 KB Output is correct
62 Correct 106 ms 66788 KB Output is correct
63 Correct 112 ms 67504 KB Output is correct
64 Correct 125 ms 67964 KB Output is correct
65 Correct 104 ms 68852 KB Output is correct
66 Correct 105 ms 68864 KB Output is correct
67 Correct 109 ms 69224 KB Output is correct
68 Correct 108 ms 69056 KB Output is correct
69 Correct 102 ms 69160 KB Output is correct
70 Correct 101 ms 69168 KB Output is correct
71 Correct 107 ms 69672 KB Output is correct
72 Correct 113 ms 69672 KB Output is correct
73 Correct 114 ms 69512 KB Output is correct
74 Correct 93 ms 69576 KB Output is correct
75 Correct 90 ms 68252 KB Output is correct
76 Correct 89 ms 68148 KB Output is correct
77 Correct 95 ms 68168 KB Output is correct
78 Correct 114 ms 68140 KB Output is correct
79 Correct 120 ms 68128 KB Output is correct
80 Correct 993 ms 150328 KB Output is correct
81 Correct 1088 ms 150580 KB Output is correct
82 Correct 1036 ms 150844 KB Output is correct
83 Correct 1000 ms 150612 KB Output is correct
84 Correct 935 ms 150376 KB Output is correct
85 Correct 1062 ms 150468 KB Output is correct
86 Correct 1026 ms 150076 KB Output is correct
87 Correct 467 ms 119876 KB Output is correct
88 Correct 735 ms 123932 KB Output is correct
89 Correct 550 ms 162996 KB Output is correct
90 Correct 580 ms 162464 KB Output is correct
91 Correct 593 ms 162448 KB Output is correct
92 Correct 563 ms 153144 KB Output is correct
93 Correct 464 ms 119796 KB Output is correct
94 Correct 1010 ms 135556 KB Output is correct
95 Correct 1100 ms 146824 KB Output is correct
96 Correct 1062 ms 149956 KB Output is correct
97 Correct 992 ms 138620 KB Output is correct
98 Correct 1089 ms 146916 KB Output is correct
99 Correct 1002 ms 149400 KB Output is correct
100 Correct 956 ms 157096 KB Output is correct
101 Correct 903 ms 157080 KB Output is correct
102 Correct 856 ms 159684 KB Output is correct
103 Correct 857 ms 159600 KB Output is correct
104 Correct 795 ms 160560 KB Output is correct
105 Correct 781 ms 160580 KB Output is correct
106 Correct 816 ms 165104 KB Output is correct
107 Correct 798 ms 165008 KB Output is correct
108 Correct 718 ms 164332 KB Output is correct
109 Correct 699 ms 164272 KB Output is correct
110 Correct 591 ms 150928 KB Output is correct
111 Correct 592 ms 150968 KB Output is correct
112 Correct 606 ms 150904 KB Output is correct
113 Correct 1099 ms 150732 KB Output is correct
114 Correct 1006 ms 150432 KB Output is correct