Submission #213204

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
213204	2020-03-25T08:57:35 Z	dorijanlendvaj	Port Facility (JOI17_port_facility)	C++14	100 / 100	3768 ms	141672 KB

port_facility

//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll
#define all(a) begin(a),end(a)

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

const int N=2000010,M=1<<21;
int n,r[N],cn=100,don;
bool col[N];
pii xse[M*2+10];
int nse[M*2+10];

void rem(int i)
{
	nse[r[i]+M]=MOD;
	xse[i+M]={-1,-1};
	for (int j=(i+M)/2;j;j/=2) xse[j]=max(xse[j*2],xse[j*2+1]);
	for (int j=(r[i]+M)/2;j;j/=2) nse[j]=min(nse[j*2],nse[j*2+1]);
}

int ge1(int l,int r,int lo=0,int hi=M,int i=1)
{
	//if (cn) --cn,cout<<l<<' '<<r<<' '<<lo<<' '<<hi<<' '<<i<<' '<<nse[i]<<endl;
	if (lo>=l && hi<=r) return nse[i];
	if (lo>=r || hi<=l) return MOD;
	int mid=(lo+hi)/2;
	return min(ge1(l,r,lo,mid,i*2),ge1(l,r,mid,hi,i*2+1));
}

pii ge2(int l,int r,int lo=0,int hi=M,int i=1)
{
	//cout<<l<<' '<<r<<' '<<lo<<' '<<hi<<' '<<i<<' '<<xse[i].x<<' '<<xse[i].y<<en;
	if (lo>=l && hi<=r) return xse[i];
	if (lo>=r || hi<=l) return {-1,-1};
	int mid=(lo+hi)/2;
	return max(ge2(l,r,lo,mid,i*2),ge2(l,r,mid,hi,i*2+1));
}

void dfs(int i,bool chc=1)
{
	rem(i);
	auto a=ge2(i+1,r[i]);
	while (a.x>r[i])
	{
		++don;
		if (chc) col[a.y]=!col[i];
		//if (cn) --cn,cout<<"m1 "<<i<<' '<<a.y<<en;
		dfs(a.y,chc);
		a=ge2(i+1,r[i]);
	}
	int b=ge1(i+1,r[i]);
	while (b<i)
	{
		++don;
		if (chc) col[b]=!col[i];
		//if (cn) --cn,cout<<"m2 "<<i<<' '<<b<<en;
		dfs(b,chc);
		b=ge1(i+1,r[i]);
	}
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
	cin>>n;
	for (int i=0;i<n;++i)
	{
		int a,b;
		cin>>a>>b;
		r[a]=b;
	}
	for (int i=M;i<M*2;++i) nse[i]=MOD,xse[i]={-1,-1};
	for (int i=1;i<=2*n;++i) if (r[i]) nse[r[i]+M]=i,xse[i+M]={r[i],i};
	for (int i=M-1;i;--i) nse[i]=min(nse[i*2],nse[i*2+1]),xse[i]=max(xse[i*2],xse[i*2+1]);
	int cc=0;
	for (int i=1;i<=2*n;++i) if (r[i] && xse[i+M]!=mp(-1,-1))
	{
		//cout<<"dfs("<<i<<")"<<endl;
		++cc;
		dfs(i);
	}
	for (int i=M;i<M*2;++i) nse[i]=MOD,xse[i]={-1,-1};
	for (int i=1;i<=2*n;++i) if (r[i] && col[i]) nse[r[i]+M]=i,xse[i+M]={r[i],i};
	for (int i=M-1;i;--i) nse[i]=min(nse[i*2],nse[i*2+1]),xse[i]=max(xse[i*2],xse[i*2+1]);
	vi nc;
	for (int i=1;i<=2*n;++i) if (r[i] && col[i]) nc.pb(i);
	don=0;
	for (auto i: nc) if (r[i] && !don) dfs(i,0);
	if (don==0)
	{
		for (int i=M;i<M*2;++i) nse[i]=MOD,xse[i]={-1,-1};
		for (int i=1;i<=2*n;++i) if (r[i] && !col[i]) nse[r[i]+M]=i,xse[i+M]={r[i],i};
		for (int i=M-1;i;--i) nse[i]=min(nse[i*2],nse[i*2+1]),xse[i]=max(xse[i*2],xse[i*2+1]);
		vi nc;
		for (int i=1;i<=2*n;++i) if (r[i] && !col[i]) nc.pb(i);
		don=0;
		for (auto i: nc) if (r[i] && !don) dfs(i,0);
		if (don==0) cout<<pot(2,cc)<<en;
		else cout<<0<<en;
	}
	else cout<<0<<en;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	50 ms	49664 KB	Output is correct
2	Correct	51 ms	49656 KB	Output is correct
3	Correct	50 ms	49664 KB	Output is correct
4	Correct	51 ms	49656 KB	Output is correct
5	Correct	51 ms	49656 KB	Output is correct
6	Correct	50 ms	49656 KB	Output is correct
7	Correct	50 ms	49656 KB	Output is correct
8	Correct	51 ms	49656 KB	Output is correct
9	Correct	50 ms	49656 KB	Output is correct
10	Correct	51 ms	49664 KB	Output is correct
11	Correct	42 ms	49664 KB	Output is correct
12	Correct	40 ms	49656 KB	Output is correct
13	Correct	51 ms	49664 KB	Output is correct
14	Correct	51 ms	49660 KB	Output is correct
15	Correct	50 ms	49656 KB	Output is correct
16	Correct	41 ms	49784 KB	Output is correct
17	Correct	52 ms	49664 KB	Output is correct
18	Correct	52 ms	49656 KB	Output is correct
19	Correct	50 ms	49656 KB	Output is correct
20	Correct	51 ms	49664 KB	Output is correct
21	Correct	50 ms	49656 KB	Output is correct
22	Correct	50 ms	49656 KB	Output is correct
23	Correct	51 ms	49528 KB	Output is correct
24	Correct	50 ms	49664 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	50 ms	49664 KB	Output is correct
2	Correct	51 ms	49656 KB	Output is correct
3	Correct	50 ms	49664 KB	Output is correct
4	Correct	51 ms	49656 KB	Output is correct
5	Correct	51 ms	49656 KB	Output is correct
6	Correct	50 ms	49656 KB	Output is correct
7	Correct	50 ms	49656 KB	Output is correct
8	Correct	51 ms	49656 KB	Output is correct
9	Correct	50 ms	49656 KB	Output is correct
10	Correct	51 ms	49664 KB	Output is correct
11	Correct	42 ms	49664 KB	Output is correct
12	Correct	40 ms	49656 KB	Output is correct
13	Correct	51 ms	49664 KB	Output is correct
14	Correct	51 ms	49660 KB	Output is correct
15	Correct	50 ms	49656 KB	Output is correct
16	Correct	41 ms	49784 KB	Output is correct
17	Correct	52 ms	49664 KB	Output is correct
18	Correct	52 ms	49656 KB	Output is correct
19	Correct	50 ms	49656 KB	Output is correct
20	Correct	51 ms	49664 KB	Output is correct
21	Correct	50 ms	49656 KB	Output is correct
22	Correct	50 ms	49656 KB	Output is correct
23	Correct	51 ms	49528 KB	Output is correct
24	Correct	50 ms	49664 KB	Output is correct
25	Correct	58 ms	49664 KB	Output is correct
26	Correct	54 ms	49784 KB	Output is correct
27	Correct	54 ms	49656 KB	Output is correct
28	Correct	55 ms	49664 KB	Output is correct
29	Correct	55 ms	49784 KB	Output is correct
30	Correct	54 ms	49784 KB	Output is correct
31	Correct	54 ms	49912 KB	Output is correct
32	Correct	54 ms	49784 KB	Output is correct
33	Correct	44 ms	49664 KB	Output is correct
34	Correct	44 ms	49656 KB	Output is correct
35	Correct	52 ms	49664 KB	Output is correct
36	Correct	54 ms	49656 KB	Output is correct
37	Correct	45 ms	49784 KB	Output is correct
38	Correct	45 ms	49664 KB	Output is correct
39	Correct	55 ms	49656 KB	Output is correct
40	Correct	53 ms	49656 KB	Output is correct
41	Correct	55 ms	49792 KB	Output is correct
42	Correct	54 ms	49784 KB	Output is correct
43	Correct	53 ms	49792 KB	Output is correct
44	Correct	53 ms	49792 KB	Output is correct

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	50 ms	49664 KB	Output is correct
2	Correct	51 ms	49656 KB	Output is correct
3	Correct	50 ms	49664 KB	Output is correct
4	Correct	51 ms	49656 KB	Output is correct
5	Correct	51 ms	49656 KB	Output is correct
6	Correct	50 ms	49656 KB	Output is correct
7	Correct	50 ms	49656 KB	Output is correct
8	Correct	51 ms	49656 KB	Output is correct
9	Correct	50 ms	49656 KB	Output is correct
10	Correct	51 ms	49664 KB	Output is correct
11	Correct	42 ms	49664 KB	Output is correct
12	Correct	40 ms	49656 KB	Output is correct
13	Correct	51 ms	49664 KB	Output is correct
14	Correct	51 ms	49660 KB	Output is correct
15	Correct	50 ms	49656 KB	Output is correct
16	Correct	41 ms	49784 KB	Output is correct
17	Correct	52 ms	49664 KB	Output is correct
18	Correct	52 ms	49656 KB	Output is correct
19	Correct	50 ms	49656 KB	Output is correct
20	Correct	51 ms	49664 KB	Output is correct
21	Correct	50 ms	49656 KB	Output is correct
22	Correct	50 ms	49656 KB	Output is correct
23	Correct	51 ms	49528 KB	Output is correct
24	Correct	50 ms	49664 KB	Output is correct
25	Correct	58 ms	49664 KB	Output is correct
26	Correct	54 ms	49784 KB	Output is correct
27	Correct	54 ms	49656 KB	Output is correct
28	Correct	55 ms	49664 KB	Output is correct
29	Correct	55 ms	49784 KB	Output is correct
30	Correct	54 ms	49784 KB	Output is correct
31	Correct	54 ms	49912 KB	Output is correct
32	Correct	54 ms	49784 KB	Output is correct
33	Correct	44 ms	49664 KB	Output is correct
34	Correct	44 ms	49656 KB	Output is correct
35	Correct	52 ms	49664 KB	Output is correct
36	Correct	54 ms	49656 KB	Output is correct
37	Correct	45 ms	49784 KB	Output is correct
38	Correct	45 ms	49664 KB	Output is correct
39	Correct	55 ms	49656 KB	Output is correct
40	Correct	53 ms	49656 KB	Output is correct
41	Correct	55 ms	49792 KB	Output is correct
42	Correct	54 ms	49784 KB	Output is correct
43	Correct	53 ms	49792 KB	Output is correct
44	Correct	53 ms	49792 KB	Output is correct
45	Correct	274 ms	52088 KB	Output is correct
46	Correct	265 ms	54136 KB	Output is correct
47	Correct	275 ms	52728 KB	Output is correct
48	Correct	271 ms	54136 KB	Output is correct
49	Correct	278 ms	52856 KB	Output is correct
50	Correct	182 ms	53752 KB	Output is correct
51	Correct	209 ms	53752 KB	Output is correct
52	Correct	173 ms	52344 KB	Output is correct
53	Correct	250 ms	51960 KB	Output is correct
54	Correct	258 ms	58104 KB	Output is correct
55	Correct	221 ms	54904 KB	Output is correct
56	Correct	227 ms	54904 KB	Output is correct
57	Correct	208 ms	52468 KB	Output is correct
58	Correct	198 ms	52344 KB	Output is correct
59	Correct	233 ms	52596 KB	Output is correct
60	Correct	238 ms	52724 KB	Output is correct
61	Correct	257 ms	52472 KB	Output is correct
62	Correct	152 ms	51960 KB	Output is correct
63	Correct	166 ms	52088 KB	Output is correct
64	Correct	173 ms	52216 KB	Output is correct
65	Correct	325 ms	58232 KB	Output is correct
66	Correct	325 ms	58232 KB	Output is correct
67	Correct	286 ms	55416 KB	Output is correct
68	Correct	312 ms	55412 KB	Output is correct
69	Correct	287 ms	55044 KB	Output is correct
70	Correct	298 ms	55032 KB	Output is correct
71	Correct	294 ms	58232 KB	Output is correct
72	Correct	271 ms	58232 KB	Output is correct
73	Correct	283 ms	56184 KB	Output is correct
74	Correct	271 ms	56184 KB	Output is correct
75	Correct	215 ms	58748 KB	Output is correct
76	Correct	202 ms	58744 KB	Output is correct
77	Correct	176 ms	58744 KB	Output is correct
78	Correct	262 ms	54008 KB	Output is correct
79	Correct	256 ms	53368 KB	Output is correct

Subtask #4
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	50 ms	49664 KB	Output is correct
2	Correct	51 ms	49656 KB	Output is correct
3	Correct	50 ms	49664 KB	Output is correct
4	Correct	51 ms	49656 KB	Output is correct
5	Correct	51 ms	49656 KB	Output is correct
6	Correct	50 ms	49656 KB	Output is correct
7	Correct	50 ms	49656 KB	Output is correct
8	Correct	51 ms	49656 KB	Output is correct
9	Correct	50 ms	49656 KB	Output is correct
10	Correct	51 ms	49664 KB	Output is correct
11	Correct	42 ms	49664 KB	Output is correct
12	Correct	40 ms	49656 KB	Output is correct
13	Correct	51 ms	49664 KB	Output is correct
14	Correct	51 ms	49660 KB	Output is correct
15	Correct	50 ms	49656 KB	Output is correct
16	Correct	41 ms	49784 KB	Output is correct
17	Correct	52 ms	49664 KB	Output is correct
18	Correct	52 ms	49656 KB	Output is correct
19	Correct	50 ms	49656 KB	Output is correct
20	Correct	51 ms	49664 KB	Output is correct
21	Correct	50 ms	49656 KB	Output is correct
22	Correct	50 ms	49656 KB	Output is correct
23	Correct	51 ms	49528 KB	Output is correct
24	Correct	50 ms	49664 KB	Output is correct
25	Correct	58 ms	49664 KB	Output is correct
26	Correct	54 ms	49784 KB	Output is correct
27	Correct	54 ms	49656 KB	Output is correct
28	Correct	55 ms	49664 KB	Output is correct
29	Correct	55 ms	49784 KB	Output is correct
30	Correct	54 ms	49784 KB	Output is correct
31	Correct	54 ms	49912 KB	Output is correct
32	Correct	54 ms	49784 KB	Output is correct
33	Correct	44 ms	49664 KB	Output is correct
34	Correct	44 ms	49656 KB	Output is correct
35	Correct	52 ms	49664 KB	Output is correct
36	Correct	54 ms	49656 KB	Output is correct
37	Correct	45 ms	49784 KB	Output is correct
38	Correct	45 ms	49664 KB	Output is correct
39	Correct	55 ms	49656 KB	Output is correct
40	Correct	53 ms	49656 KB	Output is correct
41	Correct	55 ms	49792 KB	Output is correct
42	Correct	54 ms	49784 KB	Output is correct
43	Correct	53 ms	49792 KB	Output is correct
44	Correct	53 ms	49792 KB	Output is correct
45	Correct	274 ms	52088 KB	Output is correct
46	Correct	265 ms	54136 KB	Output is correct
47	Correct	275 ms	52728 KB	Output is correct
48	Correct	271 ms	54136 KB	Output is correct
49	Correct	278 ms	52856 KB	Output is correct
50	Correct	182 ms	53752 KB	Output is correct
51	Correct	209 ms	53752 KB	Output is correct
52	Correct	173 ms	52344 KB	Output is correct
53	Correct	250 ms	51960 KB	Output is correct
54	Correct	258 ms	58104 KB	Output is correct
55	Correct	221 ms	54904 KB	Output is correct
56	Correct	227 ms	54904 KB	Output is correct
57	Correct	208 ms	52468 KB	Output is correct
58	Correct	198 ms	52344 KB	Output is correct
59	Correct	233 ms	52596 KB	Output is correct
60	Correct	238 ms	52724 KB	Output is correct
61	Correct	257 ms	52472 KB	Output is correct
62	Correct	152 ms	51960 KB	Output is correct
63	Correct	166 ms	52088 KB	Output is correct
64	Correct	173 ms	52216 KB	Output is correct
65	Correct	325 ms	58232 KB	Output is correct
66	Correct	325 ms	58232 KB	Output is correct
67	Correct	286 ms	55416 KB	Output is correct
68	Correct	312 ms	55412 KB	Output is correct
69	Correct	287 ms	55044 KB	Output is correct
70	Correct	298 ms	55032 KB	Output is correct
71	Correct	294 ms	58232 KB	Output is correct
72	Correct	271 ms	58232 KB	Output is correct
73	Correct	283 ms	56184 KB	Output is correct
74	Correct	271 ms	56184 KB	Output is correct
75	Correct	215 ms	58748 KB	Output is correct
76	Correct	202 ms	58744 KB	Output is correct
77	Correct	176 ms	58744 KB	Output is correct
78	Correct	262 ms	54008 KB	Output is correct
79	Correct	256 ms	53368 KB	Output is correct
80	Correct	2358 ms	83688 KB	Output is correct
81	Correct	2405 ms	82920 KB	Output is correct
82	Correct	2242 ms	80872 KB	Output is correct
83	Correct	2274 ms	83052 KB	Output is correct
84	Correct	2414 ms	83688 KB	Output is correct
85	Correct	1654 ms	77296 KB	Output is correct
86	Correct	1753 ms	79472 KB	Output is correct
87	Correct	1376 ms	76268 KB	Output is correct
88	Correct	2130 ms	72428 KB	Output is correct
89	Correct	2123 ms	133872 KB	Output is correct
90	Correct	1933 ms	102640 KB	Output is correct
91	Correct	1797 ms	102640 KB	Output is correct
92	Correct	1515 ms	79080 KB	Output is correct
93	Correct	1382 ms	76268 KB	Output is correct
94	Correct	1915 ms	78956 KB	Output is correct
95	Correct	2108 ms	79720 KB	Output is correct
96	Correct	2220 ms	79844 KB	Output is correct
97	Correct	1450 ms	76144 KB	Output is correct
98	Correct	1595 ms	76144 KB	Output is correct
99	Correct	1574 ms	76272 KB	Output is correct
100	Correct	3768 ms	136308 KB	Output is correct
101	Correct	3574 ms	136432 KB	Output is correct
102	Correct	2518 ms	107880 KB	Output is correct
103	Correct	2474 ms	107880 KB	Output is correct
104	Correct	2495 ms	104544 KB	Output is correct
105	Correct	2701 ms	104544 KB	Output is correct
106	Correct	2435 ms	136808 KB	Output is correct
107	Correct	2400 ms	136808 KB	Output is correct
108	Correct	2496 ms	116836 KB	Output is correct
109	Correct	2439 ms	116832 KB	Output is correct
110	Correct	1875 ms	141640 KB	Output is correct
111	Correct	1697 ms	141672 KB	Output is correct
112	Correct	1407 ms	141672 KB	Output is correct
113	Correct	2422 ms	80360 KB	Output is correct
114	Correct	2246 ms	82792 KB	Output is correct

Submission #213204

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