oj.uz

Submission #57689

# Submission time Handle Problem Language Result Execution time Memory
57689 2018-07-15T19:55:32 Z spencercompton Port Facility (JOI17_port_facility) C++17
100 / 100
 3291 ms 239432 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> comp[1000000];
vector<int> sz;
vector<int> id;
vector<bool> red;
class Ed{
	public:
		int id, s, e;
		Ed(int a, int b, int c){
			id = a;
			s = b;
			e = c;
		}
		bool operator<(const Ed &o) const{
			return s<o.s;
		}
};
vector<Ed> li;
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	ll mod = 1000000007LL;
	int n;
	cin >> n;
	int st[n];
	int en[n];
	for(int i = 0; i<n; i++){
		red.push_back(true);
		id.push_back(i);
		sz.push_back(1);
		comp[i].push_back(i);
		int a, b;
		cin >> a >> b;
		st[i] = a;
		en[i] = b;
		li.push_back(Ed(i,a,b));
	}
	sort(li.begin(),li.end());
	priority_queue<Ed> pq; 
	int po = n;
	bool in[n];
	//talking about components
	bool inside[n];
	//talking about elements
	int last[n];
	priority_queue<Ed> all[n];
	for(int i = 0; i<n; i++){
		inside[i] = false;
		in[i] = false;
		last[i] = i;
		all[i].push(Ed(i,-en[i],69));
	}

	for(int i = 0; i<li.size(); i++){
		vector<int> conflict;
		while(pq.size()>0 && -pq.top().s<li[i].s){
			int cur = pq.top().id;
			pq.pop();
			inside[cur] = false;
			while(all[id[cur]].size()>0 && -all[id[cur]].top().s<li[i].s){
				all[id[cur]].pop();
			}
			if(all[id[cur]].size()>0 && !inside[all[id[cur]].top().id]){
				int to = all[id[cur]].top().id;
				inside[to] = true;
				pq.push(all[id[cur]].top());
			}
		}
		while(pq.size()>0 && -pq.top().s<li[i].e){
			int now = pq.top().id;
			conflict.push_back(now);
			inside[now] = false;
			pq.pop();
			int ca = id[now];
			int cb = id[li[i].id];
			if(ca==cb){
				continue;
			}
			po--;
			bool flip = red[now]==red[li[i].id];
			if(sz[ca]>sz[cb]){
				swap(ca,cb);
			}
			for(int j = 0; j<comp[ca].size(); j++){
				comp[cb].push_back(comp[ca][j]);
				sz[cb]++;
				id[comp[ca][j]] = cb;
				if(flip){
					red[comp[ca][j]] = !red[comp[ca][j]];
				}
			}
			comp[ca].clear();
			while(all[ca].size()>0){
				all[cb].push(all[ca].top());
				all[ca].pop();
			}
		}
		conflict.push_back(li[i].id);
		for(int j = 0; j<conflict.size(); j++){
			int now = conflict[j];
			if(last[now] != id[now]){
				last[now] = id[now];
				all[id[now]].push(Ed(now,-en[now],69));
			}
		}
		inside[li[i].id] = false;
		vector<int> use;
		for(int j = 0; j<conflict.size(); j++){
			int now = conflict[j];
			if(!in[id[now]]){
				in[id[now]] = true;
				use.push_back(id[now]);
			}
		}
		for(int j = 0; j<use.size(); j++){
			int cur = use[j];
			if(all[cur].size()>0 && !inside[all[cur].top().id]){
				pq.push(all[cur].top());
				inside[all[cur].top().id] = true;
			}
			in[cur] = false;
		}
	}


















	// for(int i = 0; i<li.size(); i++){
	// 	for(int j = 0; j<i; j++){
	// 		if(li[j].e > li[i].s && li[j].e < li[i].e){
	// 			int ca = id[li[i].id];
	// 			int cb = id[li[j].id];
	// 			if(ca==cb){
	// 				continue;
	// 			}
	// 			po--;
	// 			bool flip = red[li[i].id] == red[li[j].id];
	// 			if(sz[ca]>sz[cb]){
	// 				swap(ca,cb);
	// 			}
	// 			//ca into cb
	// 			for(int k = 0; k<comp[ca].size(); k++){
	// 				comp[cb].push_back(comp[ca][k]);
	// 				sz[cb]++;
	// 				if(flip){
	// 					red[comp[ca][k]] = !red[comp[ca][k]];
	// 				}
	// 				id[comp[ca][k]] = cb;
	// 			}
	// 		}
	// 	}
		// vector<int> conflict;
		// while(pq.size()>0 && -pq.top().s <li[i].s){
		// 	int cur = pq.top().id;
		// 	inside[cur] = false;
		// 	pq.pop();
		// 	while(all[id[cur]].size()>0 && -all[id[cur]].top().s<li[i].s){
		// 		inside[all[id[cur]].top().id] = false;
		// 		all[id[cur]].pop();
		// 	}
		// 	if(all[id[cur]].size()>0 && !inside[all[id[cur]].top().id]){
		// 		Ed ee = all[id[cur]].top();
		// 		pq.push(Ed(ee.id, ee.s,6969));
		// 		inside[ee.id] = true;
		// 	}
		// }
		// while(pq.size()>0 && -pq.top().s <li[i].e){
		// 	int cur = pq.top().id;
		// 	conflict.push_back(cur);

		// 	inside[cur] = false;
		// 	int ca = id[li[i].id];
		// 	int cb = id[cur];

			
		// 	pq.pop();
		// 	if(ca==cb){
		// 		continue;
		// 	}
		// 	po--;
		// 	bool flip = red[li[i].id] == red[cur];
		// 	if(sz[ca]>sz[cb]){
		// 		swap(ca,cb);
		// 	}
		// 	//ca into cb
		// 	for(int j = 0; j<comp[ca].size(); j++){
		// 		comp[cb].push_back(comp[ca][j]);
		// 		sz[cb]++;
		// 		if(flip){
		// 			red[comp[ca][j]] = !red[comp[ca][j]];
		// 		}
		// 		id[comp[ca][j]] = cb;
		// 	}
		// 	comp[ca].clear();
		// 	while(all[ca].size()>0){
		// 		all[ca].pop();
		// 	}
		// }
		// conflict.push_back(li[i].id);
		// inside[li[i].id] = false;
		// vector<int> use;
		// for(int j = 0; j<conflict.size(); j++){
		// 	if(!in[id[conflict[j]]]){
		// 		use.push_back(id[conflict[j]]);
		// 		in[id[conflict[j]]] = true;
		// 	}
		// 	if(last[conflict[j]] != id[conflict[j]]){
		// 		all[id[conflict[j]]].push(Ed(conflict[j],-en[conflict[j]],696969));
		// 		last[conflict[j]] = id[conflict[j]];
		// 	}
		// }
		// for(int j = 0; j<use.size(); j++){
		// 	int cur = use[j];
		// 	if(all[cur].size()>0 && !inside[all[cur].top().id]){
		// 		inside[all[cur].top().id] = true;
		// 		pq.push(all[cur].top());
		// 	}
		// 	in[cur] = false;
		// }
	// }
	ll ans = 1LL;
	for(int i = 0; i<po; i++){
		ans *= 2LL;
		ans %= mod;
	}
	bool ok = true;
	priority_queue<int> reds;
	priority_queue<int> blues;
	// for(int i = 0; i<n; i++){
	// 	for(int j = i+1; j<n; j++){
	// 		if(li[i].e > li[j].s && li[i].e < li[j].e && red[li[i].id] == red[li[j].id]){
	// 			ok = false;
	// 		}
	// 	}
	// }
	for(int i = 0; i<li.size(); i++){
		while(reds.size()>0 && -reds.top() < li[i].s){
			reds.pop();
		}
		while(blues.size()>0 && -blues.top() < li[i].s){
			blues.pop();
		}
		if(!red[li[i].id]){
			if(blues.size()>0 && -blues.top()<li[i].e){
				ok = false;
			}
			blues.push(-li[i].e);
		}
		else{
			if(reds.size()>0 && -reds.top() < li[i].e){
				ok = false;
			}
			reds.push(-li[i].e);
		}
	}
	if(!ok){
		ans = 0LL;
	}
	assert(ans>=0);
	cout << ans << endl;
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:56:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i<li.size(); i++){
                 ~^~~~~~~~~~
port_facility.cpp:86:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int j = 0; j<comp[ca].size(); j++){
                   ~^~~~~~~~~~~~~~~~
port_facility.cpp:101:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j<conflict.size(); j++){
                  ~^~~~~~~~~~~~~~~~
port_facility.cpp:110:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j<conflict.size(); j++){
                  ~^~~~~~~~~~~~~~~~
port_facility.cpp:117:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j<use.size(); j++){
                  ~^~~~~~~~~~~
port_facility.cpp:252:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i<li.size(); i++){
                 ~^~~~~~~~~~
port_facility.cpp:27:6: warning: variable 'st' set but not used [-Wunused-but-set-variable]
  int st[n];
      ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 27 ms 23908 KB Output is correct
3 Correct 27 ms 24088 KB Output is correct
4 Correct 24 ms 24088 KB Output is correct
5 Correct 25 ms 24088 KB Output is correct
6 Correct 22 ms 24088 KB Output is correct
7 Correct 39 ms 24088 KB Output is correct
8 Correct 24 ms 24088 KB Output is correct
9 Correct 27 ms 24088 KB Output is correct
10 Correct 25 ms 24088 KB Output is correct
11 Correct 28 ms 24156 KB Output is correct
12 Correct 24 ms 24156 KB Output is correct
13 Correct 24 ms 24156 KB Output is correct
14 Correct 26 ms 24156 KB Output is correct
15 Correct 20 ms 24156 KB Output is correct
16 Correct 20 ms 24156 KB Output is correct
17 Correct 20 ms 24156 KB Output is correct
18 Correct 20 ms 24156 KB Output is correct
19 Correct 20 ms 24156 KB Output is correct
20 Correct 20 ms 24156 KB Output is correct
21 Correct 19 ms 24156 KB Output is correct
22 Correct 22 ms 24172 KB Output is correct
23 Correct 21 ms 24172 KB Output is correct
24 Correct 20 ms 24172 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 27 ms 23908 KB Output is correct
3 Correct 27 ms 24088 KB Output is correct
4 Correct 24 ms 24088 KB Output is correct
5 Correct 25 ms 24088 KB Output is correct
6 Correct 22 ms 24088 KB Output is correct
7 Correct 39 ms 24088 KB Output is correct
8 Correct 24 ms 24088 KB Output is correct
9 Correct 27 ms 24088 KB Output is correct
10 Correct 25 ms 24088 KB Output is correct
11 Correct 28 ms 24156 KB Output is correct
12 Correct 24 ms 24156 KB Output is correct
13 Correct 24 ms 24156 KB Output is correct
14 Correct 26 ms 24156 KB Output is correct
15 Correct 20 ms 24156 KB Output is correct
16 Correct 20 ms 24156 KB Output is correct
17 Correct 20 ms 24156 KB Output is correct
18 Correct 20 ms 24156 KB Output is correct
19 Correct 20 ms 24156 KB Output is correct
20 Correct 20 ms 24156 KB Output is correct
21 Correct 19 ms 24156 KB Output is correct
22 Correct 22 ms 24172 KB Output is correct
23 Correct 21 ms 24172 KB Output is correct
24 Correct 20 ms 24172 KB Output is correct
25 Correct 26 ms 24444 KB Output is correct
26 Correct 23 ms 24444 KB Output is correct
27 Correct 26 ms 24444 KB Output is correct
28 Correct 29 ms 24444 KB Output is correct
29 Correct 31 ms 24444 KB Output is correct
30 Correct 27 ms 24444 KB Output is correct
31 Correct 26 ms 24444 KB Output is correct
32 Correct 27 ms 24444 KB Output is correct
33 Correct 27 ms 24444 KB Output is correct
34 Correct 27 ms 24444 KB Output is correct
35 Correct 26 ms 24444 KB Output is correct
36 Correct 22 ms 24444 KB Output is correct
37 Correct 21 ms 24444 KB Output is correct
38 Correct 24 ms 24444 KB Output is correct
39 Correct 27 ms 24444 KB Output is correct
40 Correct 22 ms 24444 KB Output is correct
41 Correct 21 ms 24504 KB Output is correct
42 Correct 22 ms 24504 KB Output is correct
43 Correct 21 ms 24504 KB Output is correct
44 Correct 28 ms 24504 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 27 ms 23908 KB Output is correct
3 Correct 27 ms 24088 KB Output is correct
4 Correct 24 ms 24088 KB Output is correct
5 Correct 25 ms 24088 KB Output is correct
6 Correct 22 ms 24088 KB Output is correct
7 Correct 39 ms 24088 KB Output is correct
8 Correct 24 ms 24088 KB Output is correct
9 Correct 27 ms 24088 KB Output is correct
10 Correct 25 ms 24088 KB Output is correct
11 Correct 28 ms 24156 KB Output is correct
12 Correct 24 ms 24156 KB Output is correct
13 Correct 24 ms 24156 KB Output is correct
14 Correct 26 ms 24156 KB Output is correct
15 Correct 20 ms 24156 KB Output is correct
16 Correct 20 ms 24156 KB Output is correct
17 Correct 20 ms 24156 KB Output is correct
18 Correct 20 ms 24156 KB Output is correct
19 Correct 20 ms 24156 KB Output is correct
20 Correct 20 ms 24156 KB Output is correct
21 Correct 19 ms 24156 KB Output is correct
22 Correct 22 ms 24172 KB Output is correct
23 Correct 21 ms 24172 KB Output is correct
24 Correct 20 ms 24172 KB Output is correct
25 Correct 26 ms 24444 KB Output is correct
26 Correct 23 ms 24444 KB Output is correct
27 Correct 26 ms 24444 KB Output is correct
28 Correct 29 ms 24444 KB Output is correct
29 Correct 31 ms 24444 KB Output is correct
30 Correct 27 ms 24444 KB Output is correct
31 Correct 26 ms 24444 KB Output is correct
32 Correct 27 ms 24444 KB Output is correct
33 Correct 27 ms 24444 KB Output is correct
34 Correct 27 ms 24444 KB Output is correct
35 Correct 26 ms 24444 KB Output is correct
36 Correct 22 ms 24444 KB Output is correct
37 Correct 21 ms 24444 KB Output is correct
38 Correct 24 ms 24444 KB Output is correct
39 Correct 27 ms 24444 KB Output is correct
40 Correct 22 ms 24444 KB Output is correct
41 Correct 21 ms 24504 KB Output is correct
42 Correct 22 ms 24504 KB Output is correct
43 Correct 21 ms 24504 KB Output is correct
44 Correct 28 ms 24504 KB Output is correct
45 Correct 248 ms 40108 KB Output is correct
46 Correct 225 ms 41040 KB Output is correct
47 Correct 242 ms 42664 KB Output is correct
48 Correct 263 ms 43700 KB Output is correct
49 Correct 234 ms 45028 KB Output is correct
50 Correct 272 ms 46236 KB Output is correct
51 Correct 256 ms 47424 KB Output is correct
52 Correct 157 ms 47424 KB Output is correct
53 Correct 142 ms 49300 KB Output is correct
54 Correct 199 ms 52924 KB Output is correct
55 Correct 216 ms 53676 KB Output is correct
56 Correct 215 ms 54972 KB Output is correct
57 Correct 210 ms 54972 KB Output is correct
58 Correct 104 ms 54972 KB Output is correct
59 Correct 214 ms 55732 KB Output is correct
60 Correct 248 ms 58248 KB Output is correct
61 Correct 187 ms 60276 KB Output is correct
62 Correct 224 ms 60276 KB Output is correct
63 Correct 197 ms 62028 KB Output is correct
64 Correct 211 ms 63672 KB Output is correct
65 Correct 244 ms 64836 KB Output is correct
66 Correct 262 ms 66064 KB Output is correct
67 Correct 286 ms 68420 KB Output is correct
68 Correct 281 ms 69604 KB Output is correct
69 Correct 228 ms 72472 KB Output is correct
70 Correct 211 ms 73676 KB Output is correct
71 Correct 228 ms 75244 KB Output is correct
72 Correct 196 ms 76680 KB Output is correct
73 Correct 191 ms 77632 KB Output is correct
74 Correct 203 ms 78704 KB Output is correct
75 Correct 199 ms 78704 KB Output is correct
76 Correct 194 ms 78704 KB Output is correct
77 Correct 185 ms 78704 KB Output is correct
78 Correct 204 ms 81568 KB Output is correct
79 Correct 248 ms 82752 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 27 ms 23908 KB Output is correct
3 Correct 27 ms 24088 KB Output is correct
4 Correct 24 ms 24088 KB Output is correct
5 Correct 25 ms 24088 KB Output is correct
6 Correct 22 ms 24088 KB Output is correct
7 Correct 39 ms 24088 KB Output is correct
8 Correct 24 ms 24088 KB Output is correct
9 Correct 27 ms 24088 KB Output is correct
10 Correct 25 ms 24088 KB Output is correct
11 Correct 28 ms 24156 KB Output is correct
12 Correct 24 ms 24156 KB Output is correct
13 Correct 24 ms 24156 KB Output is correct
14 Correct 26 ms 24156 KB Output is correct
15 Correct 20 ms 24156 KB Output is correct
16 Correct 20 ms 24156 KB Output is correct
17 Correct 20 ms 24156 KB Output is correct
18 Correct 20 ms 24156 KB Output is correct
19 Correct 20 ms 24156 KB Output is correct
20 Correct 20 ms 24156 KB Output is correct
21 Correct 19 ms 24156 KB Output is correct
22 Correct 22 ms 24172 KB Output is correct
23 Correct 21 ms 24172 KB Output is correct
24 Correct 20 ms 24172 KB Output is correct
25 Correct 26 ms 24444 KB Output is correct
26 Correct 23 ms 24444 KB Output is correct
27 Correct 26 ms 24444 KB Output is correct
28 Correct 29 ms 24444 KB Output is correct
29 Correct 31 ms 24444 KB Output is correct
30 Correct 27 ms 24444 KB Output is correct
31 Correct 26 ms 24444 KB Output is correct
32 Correct 27 ms 24444 KB Output is correct
33 Correct 27 ms 24444 KB Output is correct
34 Correct 27 ms 24444 KB Output is correct
35 Correct 26 ms 24444 KB Output is correct
36 Correct 22 ms 24444 KB Output is correct
37 Correct 21 ms 24444 KB Output is correct
38 Correct 24 ms 24444 KB Output is correct
39 Correct 27 ms 24444 KB Output is correct
40 Correct 22 ms 24444 KB Output is correct
41 Correct 21 ms 24504 KB Output is correct
42 Correct 22 ms 24504 KB Output is correct
43 Correct 21 ms 24504 KB Output is correct
44 Correct 28 ms 24504 KB Output is correct
45 Correct 248 ms 40108 KB Output is correct
46 Correct 225 ms 41040 KB Output is correct
47 Correct 242 ms 42664 KB Output is correct
48 Correct 263 ms 43700 KB Output is correct
49 Correct 234 ms 45028 KB Output is correct
50 Correct 272 ms 46236 KB Output is correct
51 Correct 256 ms 47424 KB Output is correct
52 Correct 157 ms 47424 KB Output is correct
53 Correct 142 ms 49300 KB Output is correct
54 Correct 199 ms 52924 KB Output is correct
55 Correct 216 ms 53676 KB Output is correct
56 Correct 215 ms 54972 KB Output is correct
57 Correct 210 ms 54972 KB Output is correct
58 Correct 104 ms 54972 KB Output is correct
59 Correct 214 ms 55732 KB Output is correct
60 Correct 248 ms 58248 KB Output is correct
61 Correct 187 ms 60276 KB Output is correct
62 Correct 224 ms 60276 KB Output is correct
63 Correct 197 ms 62028 KB Output is correct
64 Correct 211 ms 63672 KB Output is correct
65 Correct 244 ms 64836 KB Output is correct
66 Correct 262 ms 66064 KB Output is correct
67 Correct 286 ms 68420 KB Output is correct
68 Correct 281 ms 69604 KB Output is correct
69 Correct 228 ms 72472 KB Output is correct
70 Correct 211 ms 73676 KB Output is correct
71 Correct 228 ms 75244 KB Output is correct
72 Correct 196 ms 76680 KB Output is correct
73 Correct 191 ms 77632 KB Output is correct
74 Correct 203 ms 78704 KB Output is correct
75 Correct 199 ms 78704 KB Output is correct
76 Correct 194 ms 78704 KB Output is correct
77 Correct 185 ms 78704 KB Output is correct
78 Correct 204 ms 81568 KB Output is correct
79 Correct 248 ms 82752 KB Output is correct
80 Correct 2718 ms 223452 KB Output is correct
81 Correct 2907 ms 223892 KB Output is correct
82 Correct 2632 ms 224240 KB Output is correct
83 Correct 2708 ms 224240 KB Output is correct
84 Correct 2792 ms 224240 KB Output is correct
85 Correct 2628 ms 224240 KB Output is correct
86 Correct 2680 ms 224240 KB Output is correct
87 Correct 1351 ms 224240 KB Output is correct
88 Correct 1455 ms 224240 KB Output is correct
89 Correct 1969 ms 230656 KB Output is correct
90 Correct 2077 ms 231920 KB Output is correct
91 Correct 2116 ms 232244 KB Output is correct
92 Correct 2291 ms 232244 KB Output is correct
93 Correct 1407 ms 232244 KB Output is correct
94 Correct 2166 ms 232244 KB Output is correct
95 Correct 2322 ms 232244 KB Output is correct
96 Correct 2439 ms 232244 KB Output is correct
97 Correct 2287 ms 232244 KB Output is correct
98 Correct 2664 ms 232244 KB Output is correct
99 Correct 2724 ms 232244 KB Output is correct
100 Correct 3250 ms 232244 KB Output is correct
101 Correct 3291 ms 232244 KB Output is correct
102 Correct 2876 ms 232244 KB Output is correct
103 Correct 2961 ms 232244 KB Output is correct
104 Correct 2800 ms 237464 KB Output is correct
105 Correct 2843 ms 237464 KB Output is correct
106 Correct 2558 ms 239288 KB Output is correct
107 Correct 2828 ms 239432 KB Output is correct
108 Correct 2605 ms 239432 KB Output is correct
109 Correct 2769 ms 239432 KB Output is correct
110 Correct 2533 ms 239432 KB Output is correct
111 Correct 2429 ms 239432 KB Output is correct
112 Correct 2321 ms 239432 KB Output is correct
113 Correct 2396 ms 239432 KB Output is correct
114 Correct 2761 ms 239432 KB Output is correct