Submission #953456

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
953456	2024-03-26T01:54:02 Z	willychan	Port Facility (JOI17_port_facility)	C++17	10 / 100	188 ms	596 KB

port_facility

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds
/*

is I know the division, checking will be if there a segment that intersegt and not entirly contain.
*/
const int MOD = 1e9+7;

int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int n;cin>>n;	
	if(n>20) return 0;
	vector<pair<int,int> > seg(n+1);
	for(int i=1;i<=n;i++) cin>>seg[i].first>>seg[i].second;
	vector<int> action(2*n+1);
	for(int i=1;i<=n;i++){
		action[seg[i].first]=i;
		action[seg[i].second]=-i;
	}
	sort(seg.begin(),seg.end());
	int ans=0;
	for(int m=0;m<(1<<n);m++){
		bool ok=1;
		stack<int> f[2];
		for(int i=1;i<=2*n;i++){
			bool k = (m>>(abs(action[i])-1))&1;
			if(action[i]>0){
				f[k].push(action[i]);
			}else{
				if(f[k].top()!=-action[i]){
				 	ok=0;
					break;
				}
				f[k].pop();
			}
		}
		if(ok) ans++;
	}

	cout<<ans<<"\n";

	return 0;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	448 KB	Output is correct
2	Correct	16 ms	348 KB	Output is correct
3	Correct	75 ms	424 KB	Output is correct
4	Correct	47 ms	448 KB	Output is correct
5	Correct	24 ms	348 KB	Output is correct
6	Correct	77 ms	428 KB	Output is correct
7	Correct	38 ms	348 KB	Output is correct
8	Correct	20 ms	348 KB	Output is correct
9	Correct	92 ms	424 KB	Output is correct
10	Correct	40 ms	348 KB	Output is correct
11	Correct	22 ms	348 KB	Output is correct
12	Correct	91 ms	596 KB	Output is correct
13	Correct	39 ms	344 KB	Output is correct
14	Correct	39 ms	344 KB	Output is correct
15	Correct	188 ms	348 KB	Output is correct
16	Correct	58 ms	428 KB	Output is correct
17	Correct	16 ms	344 KB	Output is correct
18	Correct	65 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct

Subtask #2

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	448 KB	Output is correct
2	Correct	16 ms	348 KB	Output is correct
3	Correct	75 ms	424 KB	Output is correct
4	Correct	47 ms	448 KB	Output is correct
5	Correct	24 ms	348 KB	Output is correct
6	Correct	77 ms	428 KB	Output is correct
7	Correct	38 ms	348 KB	Output is correct
8	Correct	20 ms	348 KB	Output is correct
9	Correct	92 ms	424 KB	Output is correct
10	Correct	40 ms	348 KB	Output is correct
11	Correct	22 ms	348 KB	Output is correct
12	Correct	91 ms	596 KB	Output is correct
13	Correct	39 ms	344 KB	Output is correct
14	Correct	39 ms	344 KB	Output is correct
15	Correct	188 ms	348 KB	Output is correct
16	Correct	58 ms	428 KB	Output is correct
17	Correct	16 ms	344 KB	Output is correct
18	Correct	65 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Incorrect	0 ms	348 KB	Output isn't correct
26	Halted	0 ms	0 KB	-

Subtask #3

0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	448 KB	Output is correct
2	Correct	16 ms	348 KB	Output is correct
3	Correct	75 ms	424 KB	Output is correct
4	Correct	47 ms	448 KB	Output is correct
5	Correct	24 ms	348 KB	Output is correct
6	Correct	77 ms	428 KB	Output is correct
7	Correct	38 ms	348 KB	Output is correct
8	Correct	20 ms	348 KB	Output is correct
9	Correct	92 ms	424 KB	Output is correct
10	Correct	40 ms	348 KB	Output is correct
11	Correct	22 ms	348 KB	Output is correct
12	Correct	91 ms	596 KB	Output is correct
13	Correct	39 ms	344 KB	Output is correct
14	Correct	39 ms	344 KB	Output is correct
15	Correct	188 ms	348 KB	Output is correct
16	Correct	58 ms	428 KB	Output is correct
17	Correct	16 ms	344 KB	Output is correct
18	Correct	65 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Incorrect	0 ms	348 KB	Output isn't correct
26	Halted	0 ms	0 KB	-

Subtask #4

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	448 KB	Output is correct
2	Correct	16 ms	348 KB	Output is correct
3	Correct	75 ms	424 KB	Output is correct
4	Correct	47 ms	448 KB	Output is correct
5	Correct	24 ms	348 KB	Output is correct
6	Correct	77 ms	428 KB	Output is correct
7	Correct	38 ms	348 KB	Output is correct
8	Correct	20 ms	348 KB	Output is correct
9	Correct	92 ms	424 KB	Output is correct
10	Correct	40 ms	348 KB	Output is correct
11	Correct	22 ms	348 KB	Output is correct
12	Correct	91 ms	596 KB	Output is correct
13	Correct	39 ms	344 KB	Output is correct
14	Correct	39 ms	344 KB	Output is correct
15	Correct	188 ms	348 KB	Output is correct
16	Correct	58 ms	428 KB	Output is correct
17	Correct	16 ms	344 KB	Output is correct
18	Correct	65 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Incorrect	0 ms	348 KB	Output isn't correct
26	Halted	0 ms	0 KB	-