oj.uz

Submission #771907

# Submission time Handle Problem Language Result Execution time Memory
771907 2023-07-03T11:41:54 Z bachhoangxuan Port Facility (JOI17_port_facility) C++17
100 / 100
 1004 ms 69676 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
//const int inf=1e18;
const int mod=1e9+7;
const int maxn=1000005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;
struct node;
struct DSU{
    int par[maxn],col[maxn],r[maxn],cnt;
    void init(int N){
        cnt=N;
        for(int i=1;i<=N;i++) par[i]=i,r[i]=1;
    }
    int findpar(int u){
        if(u!=par[u]){
            int p=findpar(par[u]);
            col[u]^=col[par[u]];
            return par[u]=p;
        }
        return u;
    }
    bool unions(int u,int v,int val){
        int pu=findpar(u),pv=findpar(v);
        val^=col[u]^col[v];
        if(pu==pv){
            if(val==0) return true;
            else return false;
        }
        if(r[pu]<r[pv]) swap(pu,pv);
        par[pv]=pu;r[pu]+=r[pv];
        col[pv]^=val;cnt--;
        return true;
    }
}dsu;
struct node{
    int x=0,d=0;
    node(int x=0,int d=0):x(x),d(d){}
    friend node operator+(node &a,node &b){
        a=a.update();b=b.update();
        if(a.x==0) return b;
        else if(b.x==0) return a;
        else if(a.x==b.x && a.d && b.d) return node(a.x,a.d|b.d);
        else return node(a.x,0);
    }
    node update(){
        int p=dsu.findpar(x);
        if(d==3 || d==0) return node(p,d);
        else return node(p,((d-1)^dsu.col[x])+1);
    }
};
int ans=1;
namespace Segtree{
    node tree[4*maxn];
    void update(int l,int r,int id,int p,int x){
        if(l==r){
            tree[id]=node(x,1);
            return;
        }
        int mid=(l+r)>>1;
        if(p<=mid) update(l,mid,id<<1,p,x);
        else update(mid+1,r,id<<1|1,p,x);
        tree[id]=tree[id<<1]+tree[id<<1|1];
    }
    node add(node a,int x){
        if(a.d==3){ans=0;return a;}
        ans*=dsu.unions(a.x,x,(a.d-1)^1);
        return a.update();
    }
    void query(int l,int r,int id,int tl,int tr,int x){
        if(r<tl || tr<l || tree[id].x==0) return;
        if(tl<=l && r<=tr && tree[id].d){tree[id]=add(tree[id],x);return;}
        int mid=(l+r)>>1;
        query(l,mid,id<<1,tl,tr,x);query(mid+1,r,id<<1|1,tl,tr,x);
        tree[id]=tree[id<<1]+tree[id<<1|1];
    }
}
void solve(){
    int n;cin >> n;
    vector<int> cc(n);
    vector<pii> p(n);
    for(int i=0;i<n;i++){
        cin >> p[i].fi >> p[i].se;
        cc[i]=p[i].se;
    }
    sort(p.begin(),p.end());
    sort(cc.begin(),cc.end());
    dsu.init(n);
    for(int i=0;i<n;i++){
        int l=p[i].fi,r=p[i].se;
        l=lower_bound(cc.begin(),cc.end(),l)-cc.begin()+1;
        r=lower_bound(cc.begin(),cc.end(),r)-cc.begin()+1;
        Segtree::query(1,n,1,l,r,i+1);
        Segtree::update(1,n,1,r,i+1);
        if(ans==0){
            cout << 0 << '\n';
            return;
        }
    }
    /*
    for(int i=0;i<n;i++){
        for(int j=0;j<i;j++){
            if(p[j].fi<=p[i].fi && p[i].fi<=p[j].se && p[i].fi<=p[j].se && p[j].se<=p[i].se) ans*=dsu.unions(i+1,j+1,1);
        }
    }
    */
    for(int i=1;i<=dsu.cnt;i++) ans=ans*2%mod;
    cout << ans << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31572 KB Output is correct
2 Correct 16 ms 31636 KB Output is correct
3 Correct 14 ms 31572 KB Output is correct
4 Correct 14 ms 31540 KB Output is correct
5 Correct 15 ms 31624 KB Output is correct
6 Correct 14 ms 31592 KB Output is correct
7 Correct 14 ms 31608 KB Output is correct
8 Correct 14 ms 31640 KB Output is correct
9 Correct 14 ms 31572 KB Output is correct
10 Correct 14 ms 31556 KB Output is correct
11 Correct 16 ms 31604 KB Output is correct
12 Correct 14 ms 31604 KB Output is correct
13 Correct 14 ms 31588 KB Output is correct
14 Correct 15 ms 31540 KB Output is correct
15 Correct 14 ms 31572 KB Output is correct
16 Correct 14 ms 31540 KB Output is correct
17 Correct 14 ms 31576 KB Output is correct
18 Correct 14 ms 31572 KB Output is correct
19 Correct 14 ms 31572 KB Output is correct
20 Correct 14 ms 31604 KB Output is correct
21 Correct 17 ms 31624 KB Output is correct
22 Correct 14 ms 31584 KB Output is correct
23 Correct 14 ms 31532 KB Output is correct
24 Correct 14 ms 31572 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31572 KB Output is correct
2 Correct 16 ms 31636 KB Output is correct
3 Correct 14 ms 31572 KB Output is correct
4 Correct 14 ms 31540 KB Output is correct
5 Correct 15 ms 31624 KB Output is correct
6 Correct 14 ms 31592 KB Output is correct
7 Correct 14 ms 31608 KB Output is correct
8 Correct 14 ms 31640 KB Output is correct
9 Correct 14 ms 31572 KB Output is correct
10 Correct 14 ms 31556 KB Output is correct
11 Correct 16 ms 31604 KB Output is correct
12 Correct 14 ms 31604 KB Output is correct
13 Correct 14 ms 31588 KB Output is correct
14 Correct 15 ms 31540 KB Output is correct
15 Correct 14 ms 31572 KB Output is correct
16 Correct 14 ms 31540 KB Output is correct
17 Correct 14 ms 31576 KB Output is correct
18 Correct 14 ms 31572 KB Output is correct
19 Correct 14 ms 31572 KB Output is correct
20 Correct 14 ms 31604 KB Output is correct
21 Correct 17 ms 31624 KB Output is correct
22 Correct 14 ms 31584 KB Output is correct
23 Correct 14 ms 31532 KB Output is correct
24 Correct 14 ms 31572 KB Output is correct
25 Correct 15 ms 31572 KB Output is correct
26 Correct 15 ms 31700 KB Output is correct
27 Correct 15 ms 31700 KB Output is correct
28 Correct 17 ms 31596 KB Output is correct
29 Correct 16 ms 31700 KB Output is correct
30 Correct 15 ms 31700 KB Output is correct
31 Correct 15 ms 31616 KB Output is correct
32 Correct 15 ms 31580 KB Output is correct
33 Correct 15 ms 31700 KB Output is correct
34 Correct 14 ms 31572 KB Output is correct
35 Correct 15 ms 31628 KB Output is correct
36 Correct 14 ms 31588 KB Output is correct
37 Correct 15 ms 31596 KB Output is correct
38 Correct 17 ms 31572 KB Output is correct
39 Correct 14 ms 31700 KB Output is correct
40 Correct 14 ms 31640 KB Output is correct
41 Correct 15 ms 31700 KB Output is correct
42 Correct 15 ms 31660 KB Output is correct
43 Correct 16 ms 31692 KB Output is correct
44 Correct 15 ms 31700 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31572 KB Output is correct
2 Correct 16 ms 31636 KB Output is correct
3 Correct 14 ms 31572 KB Output is correct
4 Correct 14 ms 31540 KB Output is correct
5 Correct 15 ms 31624 KB Output is correct
6 Correct 14 ms 31592 KB Output is correct
7 Correct 14 ms 31608 KB Output is correct
8 Correct 14 ms 31640 KB Output is correct
9 Correct 14 ms 31572 KB Output is correct
10 Correct 14 ms 31556 KB Output is correct
11 Correct 16 ms 31604 KB Output is correct
12 Correct 14 ms 31604 KB Output is correct
13 Correct 14 ms 31588 KB Output is correct
14 Correct 15 ms 31540 KB Output is correct
15 Correct 14 ms 31572 KB Output is correct
16 Correct 14 ms 31540 KB Output is correct
17 Correct 14 ms 31576 KB Output is correct
18 Correct 14 ms 31572 KB Output is correct
19 Correct 14 ms 31572 KB Output is correct
20 Correct 14 ms 31604 KB Output is correct
21 Correct 17 ms 31624 KB Output is correct
22 Correct 14 ms 31584 KB Output is correct
23 Correct 14 ms 31532 KB Output is correct
24 Correct 14 ms 31572 KB Output is correct
25 Correct 15 ms 31572 KB Output is correct
26 Correct 15 ms 31700 KB Output is correct
27 Correct 15 ms 31700 KB Output is correct
28 Correct 17 ms 31596 KB Output is correct
29 Correct 16 ms 31700 KB Output is correct
30 Correct 15 ms 31700 KB Output is correct
31 Correct 15 ms 31616 KB Output is correct
32 Correct 15 ms 31580 KB Output is correct
33 Correct 15 ms 31700 KB Output is correct
34 Correct 14 ms 31572 KB Output is correct
35 Correct 15 ms 31628 KB Output is correct
36 Correct 14 ms 31588 KB Output is correct
37 Correct 15 ms 31596 KB Output is correct
38 Correct 17 ms 31572 KB Output is correct
39 Correct 14 ms 31700 KB Output is correct
40 Correct 14 ms 31640 KB Output is correct
41 Correct 15 ms 31700 KB Output is correct
42 Correct 15 ms 31660 KB Output is correct
43 Correct 16 ms 31692 KB Output is correct
44 Correct 15 ms 31700 KB Output is correct
45 Correct 107 ms 33896 KB Output is correct
46 Correct 103 ms 35272 KB Output is correct
47 Correct 100 ms 35240 KB Output is correct
48 Correct 116 ms 35232 KB Output is correct
49 Correct 107 ms 35224 KB Output is correct
50 Correct 54 ms 34892 KB Output is correct
51 Correct 67 ms 35020 KB Output is correct
52 Correct 77 ms 34852 KB Output is correct
53 Correct 89 ms 34848 KB Output is correct
54 Correct 39 ms 34856 KB Output is correct
55 Correct 40 ms 34764 KB Output is correct
56 Correct 40 ms 34848 KB Output is correct
57 Correct 91 ms 35200 KB Output is correct
58 Correct 94 ms 34760 KB Output is correct
59 Correct 92 ms 35276 KB Output is correct
60 Correct 90 ms 35148 KB Output is correct
61 Correct 98 ms 35232 KB Output is correct
62 Correct 41 ms 34844 KB Output is correct
63 Correct 41 ms 34852 KB Output is correct
64 Correct 40 ms 34756 KB Output is correct
65 Correct 43 ms 34848 KB Output is correct
66 Correct 40 ms 34852 KB Output is correct
67 Correct 92 ms 35212 KB Output is correct
68 Correct 92 ms 35256 KB Output is correct
69 Correct 94 ms 35248 KB Output is correct
70 Correct 97 ms 35244 KB Output is correct
71 Correct 79 ms 35152 KB Output is correct
72 Correct 80 ms 35208 KB Output is correct
73 Correct 79 ms 35260 KB Output is correct
74 Correct 79 ms 35164 KB Output is correct
75 Correct 95 ms 35224 KB Output is correct
76 Correct 83 ms 35276 KB Output is correct
77 Correct 80 ms 35228 KB Output is correct
78 Correct 100 ms 35172 KB Output is correct
79 Correct 100 ms 35228 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31572 KB Output is correct
2 Correct 16 ms 31636 KB Output is correct
3 Correct 14 ms 31572 KB Output is correct
4 Correct 14 ms 31540 KB Output is correct
5 Correct 15 ms 31624 KB Output is correct
6 Correct 14 ms 31592 KB Output is correct
7 Correct 14 ms 31608 KB Output is correct
8 Correct 14 ms 31640 KB Output is correct
9 Correct 14 ms 31572 KB Output is correct
10 Correct 14 ms 31556 KB Output is correct
11 Correct 16 ms 31604 KB Output is correct
12 Correct 14 ms 31604 KB Output is correct
13 Correct 14 ms 31588 KB Output is correct
14 Correct 15 ms 31540 KB Output is correct
15 Correct 14 ms 31572 KB Output is correct
16 Correct 14 ms 31540 KB Output is correct
17 Correct 14 ms 31576 KB Output is correct
18 Correct 14 ms 31572 KB Output is correct
19 Correct 14 ms 31572 KB Output is correct
20 Correct 14 ms 31604 KB Output is correct
21 Correct 17 ms 31624 KB Output is correct
22 Correct 14 ms 31584 KB Output is correct
23 Correct 14 ms 31532 KB Output is correct
24 Correct 14 ms 31572 KB Output is correct
25 Correct 15 ms 31572 KB Output is correct
26 Correct 15 ms 31700 KB Output is correct
27 Correct 15 ms 31700 KB Output is correct
28 Correct 17 ms 31596 KB Output is correct
29 Correct 16 ms 31700 KB Output is correct
30 Correct 15 ms 31700 KB Output is correct
31 Correct 15 ms 31616 KB Output is correct
32 Correct 15 ms 31580 KB Output is correct
33 Correct 15 ms 31700 KB Output is correct
34 Correct 14 ms 31572 KB Output is correct
35 Correct 15 ms 31628 KB Output is correct
36 Correct 14 ms 31588 KB Output is correct
37 Correct 15 ms 31596 KB Output is correct
38 Correct 17 ms 31572 KB Output is correct
39 Correct 14 ms 31700 KB Output is correct
40 Correct 14 ms 31640 KB Output is correct
41 Correct 15 ms 31700 KB Output is correct
42 Correct 15 ms 31660 KB Output is correct
43 Correct 16 ms 31692 KB Output is correct
44 Correct 15 ms 31700 KB Output is correct
45 Correct 107 ms 33896 KB Output is correct
46 Correct 103 ms 35272 KB Output is correct
47 Correct 100 ms 35240 KB Output is correct
48 Correct 116 ms 35232 KB Output is correct
49 Correct 107 ms 35224 KB Output is correct
50 Correct 54 ms 34892 KB Output is correct
51 Correct 67 ms 35020 KB Output is correct
52 Correct 77 ms 34852 KB Output is correct
53 Correct 89 ms 34848 KB Output is correct
54 Correct 39 ms 34856 KB Output is correct
55 Correct 40 ms 34764 KB Output is correct
56 Correct 40 ms 34848 KB Output is correct
57 Correct 91 ms 35200 KB Output is correct
58 Correct 94 ms 34760 KB Output is correct
59 Correct 92 ms 35276 KB Output is correct
60 Correct 90 ms 35148 KB Output is correct
61 Correct 98 ms 35232 KB Output is correct
62 Correct 41 ms 34844 KB Output is correct
63 Correct 41 ms 34852 KB Output is correct
64 Correct 40 ms 34756 KB Output is correct
65 Correct 43 ms 34848 KB Output is correct
66 Correct 40 ms 34852 KB Output is correct
67 Correct 92 ms 35212 KB Output is correct
68 Correct 92 ms 35256 KB Output is correct
69 Correct 94 ms 35248 KB Output is correct
70 Correct 97 ms 35244 KB Output is correct
71 Correct 79 ms 35152 KB Output is correct
72 Correct 80 ms 35208 KB Output is correct
73 Correct 79 ms 35260 KB Output is correct
74 Correct 79 ms 35164 KB Output is correct
75 Correct 95 ms 35224 KB Output is correct
76 Correct 83 ms 35276 KB Output is correct
77 Correct 80 ms 35228 KB Output is correct
78 Correct 100 ms 35172 KB Output is correct
79 Correct 100 ms 35228 KB Output is correct
80 Correct 994 ms 69588 KB Output is correct
81 Correct 988 ms 69640 KB Output is correct
82 Correct 1004 ms 69620 KB Output is correct
83 Correct 986 ms 69576 KB Output is correct
84 Correct 998 ms 69584 KB Output is correct
85 Correct 615 ms 67288 KB Output is correct
86 Correct 679 ms 67772 KB Output is correct
87 Correct 737 ms 65784 KB Output is correct
88 Correct 760 ms 65788 KB Output is correct
89 Correct 305 ms 65764 KB Output is correct
90 Correct 305 ms 65772 KB Output is correct
91 Correct 337 ms 65780 KB Output is correct
92 Correct 738 ms 69616 KB Output is correct
93 Correct 759 ms 65784 KB Output is correct
94 Correct 857 ms 69608 KB Output is correct
95 Correct 910 ms 69564 KB Output is correct
96 Correct 967 ms 69660 KB Output is correct
97 Correct 469 ms 66808 KB Output is correct
98 Correct 572 ms 67304 KB Output is correct
99 Correct 404 ms 66180 KB Output is correct
100 Correct 307 ms 65764 KB Output is correct
101 Correct 303 ms 65760 KB Output is correct
102 Correct 935 ms 69600 KB Output is correct
103 Correct 908 ms 69620 KB Output is correct
104 Correct 993 ms 69676 KB Output is correct
105 Correct 950 ms 69632 KB Output is correct
106 Correct 765 ms 69624 KB Output is correct
107 Correct 764 ms 69652 KB Output is correct
108 Correct 768 ms 69636 KB Output is correct
109 Correct 772 ms 69608 KB Output is correct
110 Correct 782 ms 69624 KB Output is correct
111 Correct 763 ms 69608 KB Output is correct
112 Correct 766 ms 69628 KB Output is correct
113 Correct 979 ms 69608 KB Output is correct
114 Correct 987 ms 69648 KB Output is correct