Submission #440748

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
440748	2021-07-02T22:03:34 Z	arwaeystoamneg	Port Facility (JOI17_port_facility)	C++17	100 / 100	1200 ms	83308 KB

port_facility

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
int n;
vpi a;
vi link;
int find(int i)
{
	return i == link[i] ? i : link[i] = find(link[i]);
}
void unite(int i, int j)
{
	link[find(i)] = find(j);
}
void merge(int i, int j)
{
	// connect i and j -> i means not j and j means not i ( like 2 - sat )
	unite(i, j + n);
	unite(i + n, j);
	if (find(i) == find(i + n) || find(j) == find(j + n))
	{
		cout << 0 << endl;
		exit(0);
	}
}
int main()
{
	setIO("test1");
	cin >> n;
	a.rsz(n);
	trav(x, a)cin >> x.f >> x.s;
	sort(all(a));
	link.rsz(2 * n);
	iota(all(link), 0);
	map<int, int>todo;
	F0R(i, n)
	{
		// find the range of segments intersecting the current range
		auto L = todo.lower_bound(a[i].f);
		auto R = todo.upper_bound(a[i].s);
		if (R != todo.begin())
		{
			auto R1 = R; R1--;
			while (L != R)
			{
				merge(i, L->s);
				// if the current one's link node is the same as the one at the end, all of them in between must have the same linke node. 
				if (find(R1->s) == find(L->s))break;
				L++;
			}
		}
		todo.insert({ a[i].s,i });
	}
	ll ans = 1;
	F0R(i, n)
	{
		if (find(i) == i)ans = (ans * 2) % inf;
	}
	cout << ans << endl;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	308 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	316 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	316 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	308 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	316 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	316 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	2 ms	460 KB	Output is correct
26	Correct	2 ms	460 KB	Output is correct
27	Correct	2 ms	460 KB	Output is correct
28	Correct	2 ms	332 KB	Output is correct
29	Correct	2 ms	460 KB	Output is correct
30	Correct	2 ms	460 KB	Output is correct
31	Correct	2 ms	460 KB	Output is correct
32	Correct	2 ms	460 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	460 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	2 ms	332 KB	Output is correct
40	Correct	2 ms	332 KB	Output is correct
41	Correct	1 ms	460 KB	Output is correct
42	Correct	1 ms	460 KB	Output is correct
43	Correct	1 ms	460 KB	Output is correct
44	Correct	1 ms	460 KB	Output is correct
45	Correct	68 ms	7728 KB	Output is correct
46	Correct	69 ms	7836 KB	Output is correct
47	Correct	70 ms	7820 KB	Output is correct
48	Correct	81 ms	7748 KB	Output is correct
49	Correct	68 ms	7732 KB	Output is correct
50	Correct	38 ms	4036 KB	Output is correct
51	Correct	45 ms	5036 KB	Output is correct
52	Correct	74 ms	7748 KB	Output is correct
53	Correct	84 ms	7864 KB	Output is correct
54	Correct	31 ms	3136 KB	Output is correct
55	Correct	31 ms	3140 KB	Output is correct
56	Correct	31 ms	3008 KB	Output is correct
57	Correct	73 ms	7748 KB	Output is correct
58	Correct	72 ms	7772 KB	Output is correct
59	Correct	64 ms	7748 KB	Output is correct
60	Correct	68 ms	7736 KB	Output is correct
61	Correct	80 ms	7760 KB	Output is correct
62	Correct	31 ms	3140 KB	Output is correct
63	Correct	31 ms	3140 KB	Output is correct
64	Correct	34 ms	3136 KB	Output is correct
65	Correct	31 ms	3140 KB	Output is correct
66	Correct	32 ms	3132 KB	Output is correct
67	Correct	80 ms	8328 KB	Output is correct
68	Correct	81 ms	8384 KB	Output is correct
69	Correct	77 ms	8132 KB	Output is correct
70	Correct	75 ms	8124 KB	Output is correct
71	Correct	79 ms	8396 KB	Output is correct
72	Correct	82 ms	8380 KB	Output is correct
73	Correct	83 ms	8136 KB	Output is correct
74	Correct	79 ms	8136 KB	Output is correct
75	Correct	77 ms	7732 KB	Output is correct
76	Correct	78 ms	7744 KB	Output is correct
77	Correct	75 ms	7724 KB	Output is correct
78	Correct	70 ms	7748 KB	Output is correct
79	Correct	71 ms	7748 KB	Output is correct

Subtask #4
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	308 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	316 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	316 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	2 ms	460 KB	Output is correct
26	Correct	2 ms	460 KB	Output is correct
27	Correct	2 ms	460 KB	Output is correct
28	Correct	2 ms	332 KB	Output is correct
29	Correct	2 ms	460 KB	Output is correct
30	Correct	2 ms	460 KB	Output is correct
31	Correct	2 ms	460 KB	Output is correct
32	Correct	2 ms	460 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	460 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	2 ms	332 KB	Output is correct
40	Correct	2 ms	332 KB	Output is correct
41	Correct	1 ms	460 KB	Output is correct
42	Correct	1 ms	460 KB	Output is correct
43	Correct	1 ms	460 KB	Output is correct
44	Correct	1 ms	460 KB	Output is correct
45	Correct	68 ms	7728 KB	Output is correct
46	Correct	69 ms	7836 KB	Output is correct
47	Correct	70 ms	7820 KB	Output is correct
48	Correct	81 ms	7748 KB	Output is correct
49	Correct	68 ms	7732 KB	Output is correct
50	Correct	38 ms	4036 KB	Output is correct
51	Correct	45 ms	5036 KB	Output is correct
52	Correct	74 ms	7748 KB	Output is correct
53	Correct	84 ms	7864 KB	Output is correct
54	Correct	31 ms	3136 KB	Output is correct
55	Correct	31 ms	3140 KB	Output is correct
56	Correct	31 ms	3008 KB	Output is correct
57	Correct	73 ms	7748 KB	Output is correct
58	Correct	72 ms	7772 KB	Output is correct
59	Correct	64 ms	7748 KB	Output is correct
60	Correct	68 ms	7736 KB	Output is correct
61	Correct	80 ms	7760 KB	Output is correct
62	Correct	31 ms	3140 KB	Output is correct
63	Correct	31 ms	3140 KB	Output is correct
64	Correct	34 ms	3136 KB	Output is correct
65	Correct	31 ms	3140 KB	Output is correct
66	Correct	32 ms	3132 KB	Output is correct
67	Correct	80 ms	8328 KB	Output is correct
68	Correct	81 ms	8384 KB	Output is correct
69	Correct	77 ms	8132 KB	Output is correct
70	Correct	75 ms	8124 KB	Output is correct
71	Correct	79 ms	8396 KB	Output is correct
72	Correct	82 ms	8380 KB	Output is correct
73	Correct	83 ms	8136 KB	Output is correct
74	Correct	79 ms	8136 KB	Output is correct
75	Correct	77 ms	7732 KB	Output is correct
76	Correct	78 ms	7744 KB	Output is correct
77	Correct	75 ms	7724 KB	Output is correct
78	Correct	70 ms	7748 KB	Output is correct
79	Correct	71 ms	7748 KB	Output is correct
80	Correct	757 ms	77388 KB	Output is correct
81	Correct	761 ms	77504 KB	Output is correct
82	Correct	780 ms	77540 KB	Output is correct
83	Correct	766 ms	77416 KB	Output is correct
84	Correct	779 ms	77500 KB	Output is correct
85	Correct	488 ms	48460 KB	Output is correct
86	Correct	534 ms	54396 KB	Output is correct
87	Correct	1162 ms	77616 KB	Output is correct
88	Correct	1190 ms	77412 KB	Output is correct
89	Correct	337 ms	30516 KB	Output is correct
90	Correct	338 ms	30540 KB	Output is correct
91	Correct	341 ms	30512 KB	Output is correct
92	Correct	1200 ms	77428 KB	Output is correct
93	Correct	1162 ms	77512 KB	Output is correct
94	Correct	747 ms	77380 KB	Output is correct
95	Correct	788 ms	77456 KB	Output is correct
96	Correct	795 ms	77496 KB	Output is correct
97	Correct	434 ms	43336 KB	Output is correct
98	Correct	492 ms	49552 KB	Output is correct
99	Correct	392 ms	36924 KB	Output is correct
100	Correct	350 ms	30420 KB	Output is correct
101	Correct	351 ms	30528 KB	Output is correct
102	Correct	1123 ms	83308 KB	Output is correct
103	Correct	1076 ms	83264 KB	Output is correct
104	Correct	1000 ms	81340 KB	Output is correct
105	Correct	1037 ms	81392 KB	Output is correct
106	Correct	1068 ms	83288 KB	Output is correct
107	Correct	1151 ms	83264 KB	Output is correct
108	Correct	1109 ms	81424 KB	Output is correct
109	Correct	1037 ms	81440 KB	Output is correct
110	Correct	1160 ms	77588 KB	Output is correct
111	Correct	1185 ms	77512 KB	Output is correct
112	Correct	1168 ms	77472 KB	Output is correct
113	Correct	797 ms	77452 KB	Output is correct
114	Correct	790 ms	77436 KB	Output is correct

Submission #440748

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 56.0 / 56.0

Subtask #4 22.0 / 22.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
56.0 / 56.0

Subtask #4
22.0 / 22.0