Submission #889175

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
889175	2023-12-19T05:25:50 Z	Aiperiii	Port Facility (JOI17_port_facility)	C++14	10 / 100	6000 ms	976 KB

port_facility

#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
bool check(vector <vector <int> > v){
    stack <int> st;
    for(auto x : v){
        if(x[1]==0)st.push(x[2]);
        else{
            if(st.size()!=0 && st.top()==x[2])st.pop();
            else return false;
        }
    }
    return true;
}
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);
    int n;
    cin>>n;
    vector <pair <int,int> > v(n);
    for(int i=0;i<n;i++){
        cin>>v[i].ff>>v[i].ss;
    }
    int cnt=0;
    for(int i=0;i<(1<<n);i++){
        vector <vector <int> > gr1,gr2;
        for(int j=0;j<n;j++){
            if((i & (1<<j))!=0){
                gr1.pb({v[j].ff,0,j});
                gr1.pb({v[j].ss,1,j});
            }
            else{
                
                gr2.pb({v[j].ff,0,j});
                gr2.pb({v[j].ss,1,j});
            }
        }
        sort(all(gr1));
        sort(all(gr2));
        if(check(gr1) && check(gr2))cnt++;
    }
    cout<<cnt<<"\n";
}
/*
0 2 1
0 4 2
0 6 3
1 5 1
1 7 3
1 8 2

0 2 1
1 5 1
*/

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1257 ms	432 KB	Output is correct
2	Correct	581 ms	428 KB	Output is correct
3	Correct	2631 ms	428 KB	Output is correct
4	Correct	1305 ms	600 KB	Output is correct
5	Correct	607 ms	344 KB	Output is correct
6	Correct	2741 ms	428 KB	Output is correct
7	Correct	1294 ms	424 KB	Output is correct
8	Correct	606 ms	424 KB	Output is correct
9	Correct	2673 ms	596 KB	Output is correct
10	Correct	1215 ms	348 KB	Output is correct
11	Correct	590 ms	348 KB	Output is correct
12	Correct	2659 ms	424 KB	Output is correct
13	Correct	1277 ms	596 KB	Output is correct
14	Correct	800 ms	352 KB	Output is correct
15	Correct	3551 ms	424 KB	Output is correct
16	Correct	1227 ms	428 KB	Output is correct
17	Correct	572 ms	348 KB	Output is correct
18	Correct	2489 ms	428 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	600 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	1257 ms	432 KB	Output is correct
2	Correct	581 ms	428 KB	Output is correct
3	Correct	2631 ms	428 KB	Output is correct
4	Correct	1305 ms	600 KB	Output is correct
5	Correct	607 ms	344 KB	Output is correct
6	Correct	2741 ms	428 KB	Output is correct
7	Correct	1294 ms	424 KB	Output is correct
8	Correct	606 ms	424 KB	Output is correct
9	Correct	2673 ms	596 KB	Output is correct
10	Correct	1215 ms	348 KB	Output is correct
11	Correct	590 ms	348 KB	Output is correct
12	Correct	2659 ms	424 KB	Output is correct
13	Correct	1277 ms	596 KB	Output is correct
14	Correct	800 ms	352 KB	Output is correct
15	Correct	3551 ms	424 KB	Output is correct
16	Correct	1227 ms	428 KB	Output is correct
17	Correct	572 ms	348 KB	Output is correct
18	Correct	2489 ms	428 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	600 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	Execution timed out	6075 ms	976 KB	Time limit exceeded
26	Halted	0 ms	0 KB	-

Subtask #3

0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1257 ms	432 KB	Output is correct
2	Correct	581 ms	428 KB	Output is correct
3	Correct	2631 ms	428 KB	Output is correct
4	Correct	1305 ms	600 KB	Output is correct
5	Correct	607 ms	344 KB	Output is correct
6	Correct	2741 ms	428 KB	Output is correct
7	Correct	1294 ms	424 KB	Output is correct
8	Correct	606 ms	424 KB	Output is correct
9	Correct	2673 ms	596 KB	Output is correct
10	Correct	1215 ms	348 KB	Output is correct
11	Correct	590 ms	348 KB	Output is correct
12	Correct	2659 ms	424 KB	Output is correct
13	Correct	1277 ms	596 KB	Output is correct
14	Correct	800 ms	352 KB	Output is correct
15	Correct	3551 ms	424 KB	Output is correct
16	Correct	1227 ms	428 KB	Output is correct
17	Correct	572 ms	348 KB	Output is correct
18	Correct	2489 ms	428 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	600 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	Execution timed out	6075 ms	976 KB	Time limit exceeded
26	Halted	0 ms	0 KB	-

Subtask #4

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1257 ms	432 KB	Output is correct
2	Correct	581 ms	428 KB	Output is correct
3	Correct	2631 ms	428 KB	Output is correct
4	Correct	1305 ms	600 KB	Output is correct
5	Correct	607 ms	344 KB	Output is correct
6	Correct	2741 ms	428 KB	Output is correct
7	Correct	1294 ms	424 KB	Output is correct
8	Correct	606 ms	424 KB	Output is correct
9	Correct	2673 ms	596 KB	Output is correct
10	Correct	1215 ms	348 KB	Output is correct
11	Correct	590 ms	348 KB	Output is correct
12	Correct	2659 ms	424 KB	Output is correct
13	Correct	1277 ms	596 KB	Output is correct
14	Correct	800 ms	352 KB	Output is correct
15	Correct	3551 ms	424 KB	Output is correct
16	Correct	1227 ms	428 KB	Output is correct
17	Correct	572 ms	348 KB	Output is correct
18	Correct	2489 ms	428 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	600 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	Execution timed out	6075 ms	976 KB	Time limit exceeded
26	Halted	0 ms	0 KB	-