Submission #963677

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
963677	2024-04-15T13:04:14 Z	Cookie	Port Facility (JOI17_port_facility)	C++14	10 / 100	1030 ms	11092 KB

port_facility

#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#define sz(a) (int)a.size()
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mpp make_pair
const ld PI = 3.14159265359, prec = 1e-9;;
//using u128 = __uint128_t;
//const int x[4] = {1, 0, -1, 0};
//const int y[4] = {0, -1, 0, 1};
const ll mod = 1e9 + 7, pr = 31;
const int mxn = 1e5 + 5, mxq = 1e5 + 5, sq = 500, mxv = 5e4 + 1;
//const int base = (1 <<18);
const ll inf = 1e9 + 5, neg = -69420, inf2 = 1e14;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// have fun!
//JOIIIIIIIIIIIIIII
int n;
int c[mxn + 1];
pii p[mxn + 1];
vt<int>adj[mxn + 1];
bool bad = 0, used[mxn + 1];
void dfs(int s){
    for(auto i: adj[s]){
        if(c[i] == -1){
            c[i] = c[s] ^ 1; dfs(i);
        }else if(c[i] != (c[s] ^ 1))bad = 1;
    }
}
void solve(){
    cin >> n;
    for(int i = 1; i <= n; i++)cin >> p[i].fi >> p[i].se;
    sort(p + 1, p + n + 1);
    for(int i = 1; i <= n; i++){
        for(int j = i + 1; j <= n; j++){
            for(int k = j + 1; k <= n; k++){
                if(p[i].se < p[j].se && p[j].se < p[k].se && p[i].se > p[k].fi){
                    cout << 0;
                    return;
                }
            }
        }
    }
    
    for(int i = 1; i <= n; i++){
        for(int j = i + 1; j <= n; j++){
            if(p[j].fi < p[i].se && p[i].se < p[j].se){
                adj[i].pb(j); adj[j].pb(i);
            }
        }
    }
    ll ans = 1;
    for(int i = 1; i <= n; i++)c[i] = -1;
    for(int i = 1; i <= n; i++){
        if(c[i] == -1){
            c[i] = 1; dfs(i);
            ans = (ans * 2) % mod;
        }
    }
    if(bad)assert(0);
    if(bad){
        cout << 0; return;
    }
    cout << ans;
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("DATA.inp", "r", stdin);
    //freopen("DATA.out", "w", stdout);
    int tt; tt = 1;
    while(tt--){
        solve();
 
    }
    return(0);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2648 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2648 KB	Output is correct
5	Correct	2 ms	2648 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2652 KB	Output is correct
8	Correct	2 ms	2652 KB	Output is correct
9	Correct	1 ms	2652 KB	Output is correct
10	Correct	1 ms	2652 KB	Output is correct
11	Correct	1 ms	2652 KB	Output is correct
12	Correct	1 ms	2820 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	1 ms	2652 KB	Output is correct
15	Correct	1 ms	2652 KB	Output is correct
16	Correct	1 ms	2648 KB	Output is correct
17	Correct	1 ms	2804 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	1 ms	2652 KB	Output is correct
20	Correct	1 ms	2648 KB	Output is correct
21	Correct	1 ms	2652 KB	Output is correct
22	Correct	1 ms	2652 KB	Output is correct
23	Correct	1 ms	2652 KB	Output is correct
24	Correct	1 ms	2652 KB	Output is correct
25	Correct	1027 ms	3088 KB	Output is correct
26	Correct	925 ms	3088 KB	Output is correct
27	Correct	1020 ms	3152 KB	Output is correct
28	Correct	940 ms	3340 KB	Output is correct
29	Correct	995 ms	3084 KB	Output is correct
30	Correct	991 ms	3156 KB	Output is correct
31	Correct	1030 ms	3100 KB	Output is correct
32	Correct	987 ms	3088 KB	Output is correct
33	Correct	920 ms	2836 KB	Output is correct
34	Correct	151 ms	2648 KB	Output is correct
35	Correct	837 ms	2844 KB	Output is correct
36	Correct	841 ms	2828 KB	Output is correct
37	Correct	1 ms	2652 KB	Output is correct
38	Correct	1 ms	2652 KB	Output is correct
39	Correct	832 ms	2832 KB	Output is correct
40	Correct	1018 ms	2832 KB	Output is correct
41	Correct	970 ms	11020 KB	Output is correct
42	Correct	956 ms	11092 KB	Output is correct
43	Runtime error	856 ms	5648 KB	Execution killed with signal 6
44	Halted	0 ms	0 KB	-

Subtask #3
0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2648 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2648 KB	Output is correct
5	Correct	2 ms	2648 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2652 KB	Output is correct
8	Correct	2 ms	2652 KB	Output is correct
9	Correct	1 ms	2652 KB	Output is correct
10	Correct	1 ms	2652 KB	Output is correct
11	Correct	1 ms	2652 KB	Output is correct
12	Correct	1 ms	2820 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	1 ms	2652 KB	Output is correct
15	Correct	1 ms	2652 KB	Output is correct
16	Correct	1 ms	2648 KB	Output is correct
17	Correct	1 ms	2804 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	1 ms	2652 KB	Output is correct
20	Correct	1 ms	2648 KB	Output is correct
21	Correct	1 ms	2652 KB	Output is correct
22	Correct	1 ms	2652 KB	Output is correct
23	Correct	1 ms	2652 KB	Output is correct
24	Correct	1 ms	2652 KB	Output is correct
25	Correct	1027 ms	3088 KB	Output is correct
26	Correct	925 ms	3088 KB	Output is correct
27	Correct	1020 ms	3152 KB	Output is correct
28	Correct	940 ms	3340 KB	Output is correct
29	Correct	995 ms	3084 KB	Output is correct
30	Correct	991 ms	3156 KB	Output is correct
31	Correct	1030 ms	3100 KB	Output is correct
32	Correct	987 ms	3088 KB	Output is correct
33	Correct	920 ms	2836 KB	Output is correct
34	Correct	151 ms	2648 KB	Output is correct
35	Correct	837 ms	2844 KB	Output is correct
36	Correct	841 ms	2828 KB	Output is correct
37	Correct	1 ms	2652 KB	Output is correct
38	Correct	1 ms	2652 KB	Output is correct
39	Correct	832 ms	2832 KB	Output is correct
40	Correct	1018 ms	2832 KB	Output is correct
41	Correct	970 ms	11020 KB	Output is correct
42	Correct	956 ms	11092 KB	Output is correct
43	Runtime error	856 ms	5648 KB	Execution killed with signal 6
44	Halted	0 ms	0 KB	-

Subtask #4
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2648 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2648 KB	Output is correct
5	Correct	2 ms	2648 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2652 KB	Output is correct
8	Correct	2 ms	2652 KB	Output is correct
9	Correct	1 ms	2652 KB	Output is correct
10	Correct	1 ms	2652 KB	Output is correct
11	Correct	1 ms	2652 KB	Output is correct
12	Correct	1 ms	2820 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	1 ms	2652 KB	Output is correct
15	Correct	1 ms	2652 KB	Output is correct
16	Correct	1 ms	2648 KB	Output is correct
17	Correct	1 ms	2804 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	1 ms	2652 KB	Output is correct
20	Correct	1 ms	2648 KB	Output is correct
21	Correct	1 ms	2652 KB	Output is correct
22	Correct	1 ms	2652 KB	Output is correct
23	Correct	1 ms	2652 KB	Output is correct
24	Correct	1 ms	2652 KB	Output is correct
25	Correct	1027 ms	3088 KB	Output is correct
26	Correct	925 ms	3088 KB	Output is correct
27	Correct	1020 ms	3152 KB	Output is correct
28	Correct	940 ms	3340 KB	Output is correct
29	Correct	995 ms	3084 KB	Output is correct
30	Correct	991 ms	3156 KB	Output is correct
31	Correct	1030 ms	3100 KB	Output is correct
32	Correct	987 ms	3088 KB	Output is correct
33	Correct	920 ms	2836 KB	Output is correct
34	Correct	151 ms	2648 KB	Output is correct
35	Correct	837 ms	2844 KB	Output is correct
36	Correct	841 ms	2828 KB	Output is correct
37	Correct	1 ms	2652 KB	Output is correct
38	Correct	1 ms	2652 KB	Output is correct
39	Correct	832 ms	2832 KB	Output is correct
40	Correct	1018 ms	2832 KB	Output is correct
41	Correct	970 ms	11020 KB	Output is correct
42	Correct	956 ms	11092 KB	Output is correct
43	Runtime error	856 ms	5648 KB	Execution killed with signal 6
44	Halted	0 ms	0 KB	-

Submission #963677

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 0 / 12.0

Subtask #3 0 / 56.0

Subtask #4 0 / 22.0

Subtask #1
10.0 / 10.0

Subtask #2
0 / 12.0

Subtask #3
0 / 56.0

Subtask #4
0 / 22.0