oj.uz

Submission #543303

# Submission time Handle Problem Language Result Execution time Memory
543303 2022-03-30T06:04:24 Z Fysty Port Facility (JOI17_port_facility) C++17
100 / 100
 3634 ms 442748 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
//#define int ll
#define MottoHayaku ios::sync_with_stdio(0);cin.tie(0);
#define F first
#define S second
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define uni(c) c.resize(distance(c.begin(),unique(c.begin(),c.end())))
#define unisort(c) sort(c.begin(),c.end());uni(c);
#define X first
#define Y second

const int MOD=1e9+7;
const int N=1e6+5;
int bid[N*2],a[N],b[N],now[N<<3];
vector<int> st[N<<3];

int par[N],c[N];
bool vis[N];

int fp(int x)
{
    if(par[x]==x) return x;
    int tmp=fp(par[x]);
    c[x]^=c[par[x]];
    return par[x]=tmp;
}
bool unite(int u,int v,int w)
{
    //cout<<u<<" "<<v<<" "<<w<<"\n";
    int x=fp(u),y=fp(v);
    if(x==y)
    {
        if(c[u]^c[v]!=w) return false;
        else return true;
    }
    c[y]=c[u]^c[v]^w;
    par[y]=x;
    return true;
}

void build(int l,int r,int id)
{
    now[id]=1;
    if(l==r)
    {
        if(bid[l]!=0) st[id]={bid[l]};
        //cout<<l<<" "<<r<<" "<<st[id].size()<<"\n";
    }
    else
    {
        int mid=l+r>>1;
        build(l,mid,id<<1);
        build(mid+1,r,id<<1|1);
        int cur=0;
        rep(i,st[id<<1].size())
        {
            while(cur<st[id<<1|1].size()&&a[st[id<<1|1][cur]]<a[st[id<<1][i]])
            {
                st[id].pb(st[id<<1|1][cur]);
                cur++;
            }
            st[id].pb(st[id<<1][i]);
        }
        while(cur<st[id<<1|1].size())
        {
            st[id].pb(st[id<<1|1][cur]);
            cur++;
        }
        //cout<<l<<" "<<r<<" "<<st[id].size()<<"\n";
    }
}
bool add(int l,int r,int ql,int qr,int i,int id)
{
    if(ql<=l&&r<=qr)
    {
        //cout<<l<<" "<<r<<" "<<ql<<" "<<qr<<" "<<i<<"\n";
        if(st[id].size()==0||a[st[id][0]]>a[i]) return true;
        bool ret=1;
        ret&=unite(i,st[id][0],1);
        //cout<<st[id].size()<<"size\n";
        while(now[id]<st[id].size()&&a[st[id][now[id]]]<a[i])
        {
            ret&=unite(st[id][now[id]],st[id][now[id]-1],0);
            now[id]++;
        }
        return ret;
    }
    else
    {
        int mid=l+r>>1;
        if(qr<=mid) return add(l,mid,ql,qr,i,id<<1);
        else if(ql>mid) return add(mid+1,r,ql,qr,i,id<<1|1);
        else return add(l,mid,ql,mid,i,id<<1)&add(mid+1,r,mid+1,qr,i,id<<1|1);
    }
}
signed main()
{
    MottoHayaku
    ll n;
    cin>>n;
    vector<pll> tmp(n);
    rep(i,n) cin>>tmp[i].F>>tmp[i].S;
    sort(tmp.begin(),tmp.end());
    rep1(i,n)
    {
        a[i]=tmp[i-1].F,b[i]=tmp[i-1].S;
        bid[b[i]]=i;
    }
    rep1(i,n) par[i]=i;
    build(1,2*n,1);
    bool can=1;
    rep1(i,n)
    {
        can&=add(1,2*n,a[i],b[i]-1,i,1);
    }
    if(!can)
    {
        cout<<0;
        return 0;
    }
    ll ans=1;
    rep1(i,n)
    {
        if(vis[fp(i)]) continue;
        vis[fp(i)]=1;
        ans=ans*2%MOD;
    }
    cout<<ans;
}

Compilation message

port_facility.cpp: In function 'bool unite(int, int, int)':
port_facility.cpp:38:21: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
   38 |         if(c[u]^c[v]!=w) return false;
      |                 ~~~~^~~
port_facility.cpp: In function 'void build(int, int, int)':
port_facility.cpp:56:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   56 |         int mid=l+r>>1;
      |                 ~^~
port_facility.cpp:9:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 | #define rep(i,n) for(int i=0;i<n;i++)
......
   60 |         rep(i,st[id<<1].size())
      |             ~~~~~~~~~~~~~~~~~~ 
port_facility.cpp:60:9: note: in expansion of macro 'rep'
   60 |         rep(i,st[id<<1].size())
      |         ^~~
port_facility.cpp:62:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             while(cur<st[id<<1|1].size()&&a[st[id<<1|1][cur]]<a[st[id<<1][i]])
      |                   ~~~^~~~~~~~~~~~~~~~~~~
port_facility.cpp:69:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         while(cur<st[id<<1|1].size())
      |               ~~~^~~~~~~~~~~~~~~~~~~
port_facility.cpp: In function 'bool add(int, int, int, int, int, int)':
port_facility.cpp:86:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |         while(now[id]<st[id].size()&&a[st[id][now[id]]]<a[i])
      |               ~~~~~~~^~~~~~~~~~~~~~
port_facility.cpp:95:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   95 |         int mid=l+r>>1;
      |                 ~^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 188108 KB Output is correct
2 Correct 101 ms 188252 KB Output is correct
3 Correct 109 ms 188216 KB Output is correct
4 Correct 98 ms 188108 KB Output is correct
5 Correct 97 ms 188132 KB Output is correct
6 Correct 88 ms 188192 KB Output is correct
7 Correct 90 ms 188124 KB Output is correct
8 Correct 92 ms 188148 KB Output is correct
9 Correct 90 ms 188120 KB Output is correct
10 Correct 90 ms 188108 KB Output is correct
11 Correct 95 ms 188172 KB Output is correct
12 Correct 91 ms 188232 KB Output is correct
13 Correct 94 ms 188296 KB Output is correct
14 Correct 90 ms 188140 KB Output is correct
15 Correct 91 ms 188192 KB Output is correct
16 Correct 93 ms 188200 KB Output is correct
17 Correct 100 ms 188352 KB Output is correct
18 Correct 91 ms 188204 KB Output is correct
19 Correct 92 ms 188116 KB Output is correct
20 Correct 90 ms 188176 KB Output is correct
21 Correct 90 ms 188096 KB Output is correct
22 Correct 91 ms 188136 KB Output is correct
23 Correct 91 ms 188164 KB Output is correct
24 Correct 90 ms 188108 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 188108 KB Output is correct
2 Correct 101 ms 188252 KB Output is correct
3 Correct 109 ms 188216 KB Output is correct
4 Correct 98 ms 188108 KB Output is correct
5 Correct 97 ms 188132 KB Output is correct
6 Correct 88 ms 188192 KB Output is correct
7 Correct 90 ms 188124 KB Output is correct
8 Correct 92 ms 188148 KB Output is correct
9 Correct 90 ms 188120 KB Output is correct
10 Correct 90 ms 188108 KB Output is correct
11 Correct 95 ms 188172 KB Output is correct
12 Correct 91 ms 188232 KB Output is correct
13 Correct 94 ms 188296 KB Output is correct
14 Correct 90 ms 188140 KB Output is correct
15 Correct 91 ms 188192 KB Output is correct
16 Correct 93 ms 188200 KB Output is correct
17 Correct 100 ms 188352 KB Output is correct
18 Correct 91 ms 188204 KB Output is correct
19 Correct 92 ms 188116 KB Output is correct
20 Correct 90 ms 188176 KB Output is correct
21 Correct 90 ms 188096 KB Output is correct
22 Correct 91 ms 188136 KB Output is correct
23 Correct 91 ms 188164 KB Output is correct
24 Correct 90 ms 188108 KB Output is correct
25 Correct 92 ms 188548 KB Output is correct
26 Correct 94 ms 188664 KB Output is correct
27 Correct 92 ms 188496 KB Output is correct
28 Correct 90 ms 188492 KB Output is correct
29 Correct 91 ms 188492 KB Output is correct
30 Correct 90 ms 188496 KB Output is correct
31 Correct 93 ms 188492 KB Output is correct
32 Correct 92 ms 188608 KB Output is correct
33 Correct 92 ms 188564 KB Output is correct
34 Correct 89 ms 188488 KB Output is correct
35 Correct 91 ms 188544 KB Output is correct
36 Correct 92 ms 188432 KB Output is correct
37 Correct 93 ms 188560 KB Output is correct
38 Correct 93 ms 188492 KB Output is correct
39 Correct 93 ms 188592 KB Output is correct
40 Correct 92 ms 188548 KB Output is correct
41 Correct 92 ms 188552 KB Output is correct
42 Correct 105 ms 188532 KB Output is correct
43 Correct 90 ms 188560 KB Output is correct
44 Correct 91 ms 188580 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 188108 KB Output is correct
2 Correct 101 ms 188252 KB Output is correct
3 Correct 109 ms 188216 KB Output is correct
4 Correct 98 ms 188108 KB Output is correct
5 Correct 97 ms 188132 KB Output is correct
6 Correct 88 ms 188192 KB Output is correct
7 Correct 90 ms 188124 KB Output is correct
8 Correct 92 ms 188148 KB Output is correct
9 Correct 90 ms 188120 KB Output is correct
10 Correct 90 ms 188108 KB Output is correct
11 Correct 95 ms 188172 KB Output is correct
12 Correct 91 ms 188232 KB Output is correct
13 Correct 94 ms 188296 KB Output is correct
14 Correct 90 ms 188140 KB Output is correct
15 Correct 91 ms 188192 KB Output is correct
16 Correct 93 ms 188200 KB Output is correct
17 Correct 100 ms 188352 KB Output is correct
18 Correct 91 ms 188204 KB Output is correct
19 Correct 92 ms 188116 KB Output is correct
20 Correct 90 ms 188176 KB Output is correct
21 Correct 90 ms 188096 KB Output is correct
22 Correct 91 ms 188136 KB Output is correct
23 Correct 91 ms 188164 KB Output is correct
24 Correct 90 ms 188108 KB Output is correct
25 Correct 92 ms 188548 KB Output is correct
26 Correct 94 ms 188664 KB Output is correct
27 Correct 92 ms 188496 KB Output is correct
28 Correct 90 ms 188492 KB Output is correct
29 Correct 91 ms 188492 KB Output is correct
30 Correct 90 ms 188496 KB Output is correct
31 Correct 93 ms 188492 KB Output is correct
32 Correct 92 ms 188608 KB Output is correct
33 Correct 92 ms 188564 KB Output is correct
34 Correct 89 ms 188488 KB Output is correct
35 Correct 91 ms 188544 KB Output is correct
36 Correct 92 ms 188432 KB Output is correct
37 Correct 93 ms 188560 KB Output is correct
38 Correct 93 ms 188492 KB Output is correct
39 Correct 93 ms 188592 KB Output is correct
40 Correct 92 ms 188548 KB Output is correct
41 Correct 92 ms 188552 KB Output is correct
42 Correct 105 ms 188532 KB Output is correct
43 Correct 90 ms 188560 KB Output is correct
44 Correct 91 ms 188580 KB Output is correct
45 Correct 201 ms 211268 KB Output is correct
46 Correct 203 ms 211324 KB Output is correct
47 Correct 197 ms 211272 KB Output is correct
48 Correct 197 ms 211308 KB Output is correct
49 Correct 196 ms 211268 KB Output is correct
50 Correct 196 ms 211144 KB Output is correct
51 Correct 199 ms 211140 KB Output is correct
52 Correct 178 ms 211468 KB Output is correct
53 Correct 176 ms 208608 KB Output is correct
54 Correct 203 ms 208888 KB Output is correct
55 Correct 209 ms 208660 KB Output is correct
56 Correct 210 ms 208576 KB Output is correct
57 Correct 173 ms 211264 KB Output is correct
58 Correct 173 ms 210960 KB Output is correct
59 Correct 188 ms 212524 KB Output is correct
60 Correct 200 ms 211912 KB Output is correct
61 Correct 200 ms 211648 KB Output is correct
62 Correct 187 ms 212520 KB Output is correct
63 Correct 191 ms 211860 KB Output is correct
64 Correct 193 ms 211580 KB Output is correct
65 Correct 318 ms 210108 KB Output is correct
66 Correct 312 ms 209876 KB Output is correct
67 Correct 208 ms 210504 KB Output is correct
68 Correct 202 ms 210524 KB Output is correct
69 Correct 199 ms 210736 KB Output is correct
70 Correct 200 ms 210736 KB Output is correct
71 Correct 178 ms 210520 KB Output is correct
72 Correct 178 ms 210480 KB Output is correct
73 Correct 182 ms 210376 KB Output is correct
74 Correct 180 ms 210412 KB Output is correct
75 Correct 181 ms 214852 KB Output is correct
76 Correct 176 ms 214876 KB Output is correct
77 Correct 179 ms 214852 KB Output is correct
78 Correct 201 ms 211252 KB Output is correct
79 Correct 199 ms 211260 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 188108 KB Output is correct
2 Correct 101 ms 188252 KB Output is correct
3 Correct 109 ms 188216 KB Output is correct
4 Correct 98 ms 188108 KB Output is correct
5 Correct 97 ms 188132 KB Output is correct
6 Correct 88 ms 188192 KB Output is correct
7 Correct 90 ms 188124 KB Output is correct
8 Correct 92 ms 188148 KB Output is correct
9 Correct 90 ms 188120 KB Output is correct
10 Correct 90 ms 188108 KB Output is correct
11 Correct 95 ms 188172 KB Output is correct
12 Correct 91 ms 188232 KB Output is correct
13 Correct 94 ms 188296 KB Output is correct
14 Correct 90 ms 188140 KB Output is correct
15 Correct 91 ms 188192 KB Output is correct
16 Correct 93 ms 188200 KB Output is correct
17 Correct 100 ms 188352 KB Output is correct
18 Correct 91 ms 188204 KB Output is correct
19 Correct 92 ms 188116 KB Output is correct
20 Correct 90 ms 188176 KB Output is correct
21 Correct 90 ms 188096 KB Output is correct
22 Correct 91 ms 188136 KB Output is correct
23 Correct 91 ms 188164 KB Output is correct
24 Correct 90 ms 188108 KB Output is correct
25 Correct 92 ms 188548 KB Output is correct
26 Correct 94 ms 188664 KB Output is correct
27 Correct 92 ms 188496 KB Output is correct
28 Correct 90 ms 188492 KB Output is correct
29 Correct 91 ms 188492 KB Output is correct
30 Correct 90 ms 188496 KB Output is correct
31 Correct 93 ms 188492 KB Output is correct
32 Correct 92 ms 188608 KB Output is correct
33 Correct 92 ms 188564 KB Output is correct
34 Correct 89 ms 188488 KB Output is correct
35 Correct 91 ms 188544 KB Output is correct
36 Correct 92 ms 188432 KB Output is correct
37 Correct 93 ms 188560 KB Output is correct
38 Correct 93 ms 188492 KB Output is correct
39 Correct 93 ms 188592 KB Output is correct
40 Correct 92 ms 188548 KB Output is correct
41 Correct 92 ms 188552 KB Output is correct
42 Correct 105 ms 188532 KB Output is correct
43 Correct 90 ms 188560 KB Output is correct
44 Correct 91 ms 188580 KB Output is correct
45 Correct 201 ms 211268 KB Output is correct
46 Correct 203 ms 211324 KB Output is correct
47 Correct 197 ms 211272 KB Output is correct
48 Correct 197 ms 211308 KB Output is correct
49 Correct 196 ms 211268 KB Output is correct
50 Correct 196 ms 211144 KB Output is correct
51 Correct 199 ms 211140 KB Output is correct
52 Correct 178 ms 211468 KB Output is correct
53 Correct 176 ms 208608 KB Output is correct
54 Correct 203 ms 208888 KB Output is correct
55 Correct 209 ms 208660 KB Output is correct
56 Correct 210 ms 208576 KB Output is correct
57 Correct 173 ms 211264 KB Output is correct
58 Correct 173 ms 210960 KB Output is correct
59 Correct 188 ms 212524 KB Output is correct
60 Correct 200 ms 211912 KB Output is correct
61 Correct 200 ms 211648 KB Output is correct
62 Correct 187 ms 212520 KB Output is correct
63 Correct 191 ms 211860 KB Output is correct
64 Correct 193 ms 211580 KB Output is correct
65 Correct 318 ms 210108 KB Output is correct
66 Correct 312 ms 209876 KB Output is correct
67 Correct 208 ms 210504 KB Output is correct
68 Correct 202 ms 210524 KB Output is correct
69 Correct 199 ms 210736 KB Output is correct
70 Correct 200 ms 210736 KB Output is correct
71 Correct 178 ms 210520 KB Output is correct
72 Correct 178 ms 210480 KB Output is correct
73 Correct 182 ms 210376 KB Output is correct
74 Correct 180 ms 210412 KB Output is correct
75 Correct 181 ms 214852 KB Output is correct
76 Correct 176 ms 214876 KB Output is correct
77 Correct 179 ms 214852 KB Output is correct
78 Correct 201 ms 211252 KB Output is correct
79 Correct 199 ms 211260 KB Output is correct
80 Correct 1335 ms 417440 KB Output is correct
81 Correct 1270 ms 417912 KB Output is correct
82 Correct 1242 ms 417820 KB Output is correct
83 Correct 1273 ms 417564 KB Output is correct
84 Correct 1259 ms 417736 KB Output is correct
85 Correct 1228 ms 416960 KB Output is correct
86 Correct 1234 ms 416868 KB Output is correct
87 Correct 969 ms 413112 KB Output is correct
88 Correct 1031 ms 383876 KB Output is correct
89 Correct 1336 ms 385656 KB Output is correct
90 Correct 1322 ms 383320 KB Output is correct
91 Correct 1305 ms 383252 KB Output is correct
92 Correct 960 ms 408116 KB Output is correct
93 Correct 970 ms 404076 KB Output is correct
94 Correct 1136 ms 427324 KB Output is correct
95 Correct 1212 ms 422944 KB Output is correct
96 Correct 1263 ms 419552 KB Output is correct
97 Correct 1146 ms 430500 KB Output is correct
98 Correct 1204 ms 422920 KB Output is correct
99 Correct 1210 ms 419312 KB Output is correct
100 Correct 3634 ms 398008 KB Output is correct
101 Correct 3600 ms 397388 KB Output is correct
102 Correct 1323 ms 405160 KB Output is correct
103 Correct 1291 ms 405380 KB Output is correct
104 Correct 1301 ms 406692 KB Output is correct
105 Correct 1283 ms 406556 KB Output is correct
106 Correct 1056 ms 397832 KB Output is correct
107 Correct 1028 ms 397804 KB Output is correct
108 Correct 1087 ms 397816 KB Output is correct
109 Correct 1044 ms 397824 KB Output is correct
110 Correct 998 ms 442748 KB Output is correct
111 Correct 1006 ms 442688 KB Output is correct
112 Correct 1016 ms 442624 KB Output is correct
113 Correct 1237 ms 412792 KB Output is correct
114 Correct 1258 ms 413064 KB Output is correct