oj.uz

Submission #488316

# Submission time Handle Problem Language Result Execution time Memory
488316 2021-11-18T14:15:11 Z i_am_noob Port Facility (JOI17_port_facility) C++17
100 / 100
 1086 ms 220232 KB 
#pragma GCC target("avx2")
#include<bits/stdc++.h>
#include<x86intrin.h>
#include<immintrin.h>
//#pragma GCC optimize("unroll-loops")
using namespace std;

#define ll long long
//#define int ll
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); i>=((int)(a)); i--)
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pb push_back
#define inf 1010000000
//#define inf 4000000000000000000
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll<<(x))
//#define ceiling(a,b) (((a)+(b)-1)/(b))
#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 826
#endif

inline char readchar(){
    const int maxn=1000000;
    static char buf[maxn],*p=buf,*q=buf;
    if(p==q&&(q=(p=buf)+fread(buf,1,maxn,stdin))==buf) return EOF;
    else return *p++;
}
inline int readint(){
    int c=readchar(),x=0,neg=0;
    while((c<'0'||c>'9')&&c!='-'&&c!=EOF) c=readchar();
    if(c=='-') neg=1,c=readchar();
    while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^'0'),c=readchar();
    return neg?-x:x;
}

const int Mod=1000000007,Mod2=998244353;
const int MOD=Mod;
const int maxn=1000005;
//i_am_noob
#define v8si __attribute__ (( vector_size(32) )) signed

int val[maxn*8];

void pull(int k){val[k]=max(val[k<<1],val[k<<1|1]);}

void modify(int k, int l, int r, int p, int x){
    if(l==r){
        val[k]=x;
        return;
    }
    int mid=l+r>>1;
    if(p<=mid) modify(k<<1,l,mid,p,x);
    else modify(k<<1|1,mid+1,r,p,x);
    pull(k);
}

int query(int k, int l, int r, int ql, int qr){
    if(l>qr||r<ql) return -inf;
    if(ql<=l&&qr>=r) return val[k];
    int mid=l+r>>1;
    return max(query(k<<1,l,mid,ql,qr),query(k<<1|1,mid+1,r,ql,qr));
}

int par[maxn*2];
bool same[maxn*2];
vector<int> child[maxn*2];

int Find(int x){return par[x]==x?x:par[x]=Find(par[x]);}
void Union(int x, int y){
    bug(x,y);
    if(sz(child[Find(x)])<sz(child[Find(y)])) swap(x,y);
    int a=Find(x),b=Find(y);
    if(a==b){
        bug(x,y,same[x],same[y]);
        if(!(same[x]^same[y])){
            cout << "0\n";
            exit(0);
        }
        return;
    }
    if(!(same[x]^same[y])){
        for(auto i: child[b]) same[i]^=1;
    }
    for(auto i: child[b]) child[a].pb(i);
    bug(a);
    for(auto i: child[a]) bug(i,same[i]);
    child[b].clear();
    par[b]=a;
}

int n,a[maxn*2];

void orzck(){
    rep(maxn*8) val[i]=-inf;
    rep(maxn*2) par[i]=i,child[i].pb(i),same[i]=1;
    cin >> n;
    rep(n){
        int x,y;
        cin >> x >> y;
        x--,y--;
        a[x]=y,a[y]=x;
    }
    rep(2*n) if(a[i]<i){
        int x=query(1,0,2*n-1,0,a[i]-1);
        if(x<a[i]){
            modify(1,0,2*n-1,a[i],i);
            continue;
        }
        Union(a[x],a[i]);
        modify(1,0,2*n-1,a[x],-inf);
        while(1){
            int y=query(1,0,2*n-1,0,a[i]-1);
            if(y<a[i]) break;
            Union(a[y],a[i]);
            modify(1,0,2*n-1,a[y],-inf);
        }
        modify(1,0,2*n-1,a[x],x);
        modify(1,0,2*n-1,a[i],i);
    }
    set<int> st;
    rep(2*n) if(a[i]>i) st.insert(Find(i));
    int res=1;
    rep(sz(st)) res=res*2%MOD;
    cout << res << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    #ifdef i_am_noob
    freopen("input1.txt","r",stdin);
    freopen("output1.txt","w",stdout);
    freopen("output2.txt","w",stderr);
    #endif
    cout << fixed << setprecision(15);
    orzck();
    return 0;
}

Compilation message

port_facility.cpp: In function 'void modify(int, int, int, int, int)':
port_facility.cpp:62:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   62 |     int mid=l+r>>1;
      |             ~^~
port_facility.cpp: In function 'int query(int, int, int, int, int)':
port_facility.cpp:71:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   71 |     int mid=l+r>>1;
      |             ~^~
port_facility.cpp: In function 'void Union(int, int)':
port_facility.cpp:30:18: warning: statement has no effect [-Wunused-value]
   30 | #define bug(...) 826
      |                  ^~~
port_facility.cpp:81:5: note: in expansion of macro 'bug'
   81 |     bug(x,y);
      |     ^~~
port_facility.cpp:30:18: warning: statement has no effect [-Wunused-value]
   30 | #define bug(...) 826
      |                  ^~~
port_facility.cpp:85:9: note: in expansion of macro 'bug'
   85 |         bug(x,y,same[x],same[y]);
      |         ^~~
port_facility.cpp:30:18: warning: statement has no effect [-Wunused-value]
   30 | #define bug(...) 826
      |                  ^~~
port_facility.cpp:96:5: note: in expansion of macro 'bug'
   96 |     bug(a);
      |     ^~~
port_facility.cpp:30:18: warning: statement has no effect [-Wunused-value]
   30 | #define bug(...) 826
      |                  ^~~
port_facility.cpp:97:27: note: in expansion of macro 'bug'
   97 |     for(auto i: child[a]) bug(i,same[i]);
      |                           ^~~
port_facility.cpp:97:14: warning: unused variable 'i' [-Wunused-variable]
   97 |     for(auto i: child[a]) bug(i,same[i]);
      |              ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 150980 KB Output is correct
2 Correct 125 ms 151112 KB Output is correct
3 Correct 122 ms 150876 KB Output is correct
4 Correct 122 ms 150984 KB Output is correct
5 Correct 121 ms 150972 KB Output is correct
6 Correct 125 ms 150960 KB Output is correct
7 Correct 148 ms 150912 KB Output is correct
8 Correct 123 ms 150932 KB Output is correct
9 Correct 123 ms 150984 KB Output is correct
10 Correct 123 ms 150876 KB Output is correct
11 Correct 130 ms 150924 KB Output is correct
12 Correct 123 ms 150960 KB Output is correct
13 Correct 124 ms 150984 KB Output is correct
14 Correct 123 ms 150880 KB Output is correct
15 Correct 123 ms 150964 KB Output is correct
16 Correct 130 ms 151024 KB Output is correct
17 Correct 125 ms 150956 KB Output is correct
18 Correct 125 ms 150996 KB Output is correct
19 Correct 123 ms 150880 KB Output is correct
20 Correct 128 ms 151000 KB Output is correct
21 Correct 123 ms 150984 KB Output is correct
22 Correct 122 ms 150868 KB Output is correct
23 Correct 123 ms 150872 KB Output is correct
24 Correct 123 ms 150920 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 150980 KB Output is correct
2 Correct 125 ms 151112 KB Output is correct
3 Correct 122 ms 150876 KB Output is correct
4 Correct 122 ms 150984 KB Output is correct
5 Correct 121 ms 150972 KB Output is correct
6 Correct 125 ms 150960 KB Output is correct
7 Correct 148 ms 150912 KB Output is correct
8 Correct 123 ms 150932 KB Output is correct
9 Correct 123 ms 150984 KB Output is correct
10 Correct 123 ms 150876 KB Output is correct
11 Correct 130 ms 150924 KB Output is correct
12 Correct 123 ms 150960 KB Output is correct
13 Correct 124 ms 150984 KB Output is correct
14 Correct 123 ms 150880 KB Output is correct
15 Correct 123 ms 150964 KB Output is correct
16 Correct 130 ms 151024 KB Output is correct
17 Correct 125 ms 150956 KB Output is correct
18 Correct 125 ms 150996 KB Output is correct
19 Correct 123 ms 150880 KB Output is correct
20 Correct 128 ms 151000 KB Output is correct
21 Correct 123 ms 150984 KB Output is correct
22 Correct 122 ms 150868 KB Output is correct
23 Correct 123 ms 150872 KB Output is correct
24 Correct 123 ms 150920 KB Output is correct
25 Correct 132 ms 151052 KB Output is correct
26 Correct 124 ms 151056 KB Output is correct
27 Correct 128 ms 150980 KB Output is correct
28 Correct 148 ms 150976 KB Output is correct
29 Correct 129 ms 151128 KB Output is correct
30 Correct 126 ms 151008 KB Output is correct
31 Correct 125 ms 151056 KB Output is correct
32 Correct 123 ms 151012 KB Output is correct
33 Correct 124 ms 151016 KB Output is correct
34 Correct 131 ms 151096 KB Output is correct
35 Correct 127 ms 151112 KB Output is correct
36 Correct 124 ms 151112 KB Output is correct
37 Correct 122 ms 150984 KB Output is correct
38 Correct 121 ms 151020 KB Output is correct
39 Correct 124 ms 151048 KB Output is correct
40 Correct 122 ms 151120 KB Output is correct
41 Correct 124 ms 150984 KB Output is correct
42 Correct 139 ms 150984 KB Output is correct
43 Correct 141 ms 151072 KB Output is correct
44 Correct 123 ms 151000 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 150980 KB Output is correct
2 Correct 125 ms 151112 KB Output is correct
3 Correct 122 ms 150876 KB Output is correct
4 Correct 122 ms 150984 KB Output is correct
5 Correct 121 ms 150972 KB Output is correct
6 Correct 125 ms 150960 KB Output is correct
7 Correct 148 ms 150912 KB Output is correct
8 Correct 123 ms 150932 KB Output is correct
9 Correct 123 ms 150984 KB Output is correct
10 Correct 123 ms 150876 KB Output is correct
11 Correct 130 ms 150924 KB Output is correct
12 Correct 123 ms 150960 KB Output is correct
13 Correct 124 ms 150984 KB Output is correct
14 Correct 123 ms 150880 KB Output is correct
15 Correct 123 ms 150964 KB Output is correct
16 Correct 130 ms 151024 KB Output is correct
17 Correct 125 ms 150956 KB Output is correct
18 Correct 125 ms 150996 KB Output is correct
19 Correct 123 ms 150880 KB Output is correct
20 Correct 128 ms 151000 KB Output is correct
21 Correct 123 ms 150984 KB Output is correct
22 Correct 122 ms 150868 KB Output is correct
23 Correct 123 ms 150872 KB Output is correct
24 Correct 123 ms 150920 KB Output is correct
25 Correct 132 ms 151052 KB Output is correct
26 Correct 124 ms 151056 KB Output is correct
27 Correct 128 ms 150980 KB Output is correct
28 Correct 148 ms 150976 KB Output is correct
29 Correct 129 ms 151128 KB Output is correct
30 Correct 126 ms 151008 KB Output is correct
31 Correct 125 ms 151056 KB Output is correct
32 Correct 123 ms 151012 KB Output is correct
33 Correct 124 ms 151016 KB Output is correct
34 Correct 131 ms 151096 KB Output is correct
35 Correct 127 ms 151112 KB Output is correct
36 Correct 124 ms 151112 KB Output is correct
37 Correct 122 ms 150984 KB Output is correct
38 Correct 121 ms 151020 KB Output is correct
39 Correct 124 ms 151048 KB Output is correct
40 Correct 122 ms 151120 KB Output is correct
41 Correct 124 ms 150984 KB Output is correct
42 Correct 139 ms 150984 KB Output is correct
43 Correct 141 ms 151072 KB Output is correct
44 Correct 123 ms 151000 KB Output is correct
45 Correct 221 ms 154464 KB Output is correct
46 Correct 220 ms 154500 KB Output is correct
47 Correct 245 ms 154652 KB Output is correct
48 Correct 216 ms 154512 KB Output is correct
49 Correct 220 ms 154572 KB Output is correct
50 Correct 179 ms 153436 KB Output is correct
51 Correct 175 ms 153012 KB Output is correct
52 Correct 179 ms 157728 KB Output is correct
53 Correct 178 ms 157716 KB Output is correct
54 Correct 140 ms 152924 KB Output is correct
55 Correct 138 ms 152908 KB Output is correct
56 Correct 138 ms 152952 KB Output is correct
57 Correct 188 ms 155296 KB Output is correct
58 Correct 178 ms 157720 KB Output is correct
59 Correct 180 ms 157256 KB Output is correct
60 Correct 191 ms 155860 KB Output is correct
61 Correct 204 ms 155068 KB Output is correct
62 Correct 148 ms 152916 KB Output is correct
63 Correct 166 ms 153208 KB Output is correct
64 Correct 179 ms 153408 KB Output is correct
65 Correct 143 ms 153144 KB Output is correct
66 Correct 139 ms 153040 KB Output is correct
67 Correct 189 ms 153568 KB Output is correct
68 Correct 188 ms 153684 KB Output is correct
69 Correct 193 ms 153788 KB Output is correct
70 Correct 189 ms 153796 KB Output is correct
71 Correct 186 ms 153632 KB Output is correct
72 Correct 190 ms 153744 KB Output is correct
73 Correct 184 ms 153672 KB Output is correct
74 Correct 185 ms 153700 KB Output is correct
75 Correct 202 ms 153688 KB Output is correct
76 Correct 204 ms 153744 KB Output is correct
77 Correct 190 ms 153572 KB Output is correct
78 Correct 204 ms 154460 KB Output is correct
79 Correct 221 ms 154500 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 150980 KB Output is correct
2 Correct 125 ms 151112 KB Output is correct
3 Correct 122 ms 150876 KB Output is correct
4 Correct 122 ms 150984 KB Output is correct
5 Correct 121 ms 150972 KB Output is correct
6 Correct 125 ms 150960 KB Output is correct
7 Correct 148 ms 150912 KB Output is correct
8 Correct 123 ms 150932 KB Output is correct
9 Correct 123 ms 150984 KB Output is correct
10 Correct 123 ms 150876 KB Output is correct
11 Correct 130 ms 150924 KB Output is correct
12 Correct 123 ms 150960 KB Output is correct
13 Correct 124 ms 150984 KB Output is correct
14 Correct 123 ms 150880 KB Output is correct
15 Correct 123 ms 150964 KB Output is correct
16 Correct 130 ms 151024 KB Output is correct
17 Correct 125 ms 150956 KB Output is correct
18 Correct 125 ms 150996 KB Output is correct
19 Correct 123 ms 150880 KB Output is correct
20 Correct 128 ms 151000 KB Output is correct
21 Correct 123 ms 150984 KB Output is correct
22 Correct 122 ms 150868 KB Output is correct
23 Correct 123 ms 150872 KB Output is correct
24 Correct 123 ms 150920 KB Output is correct
25 Correct 132 ms 151052 KB Output is correct
26 Correct 124 ms 151056 KB Output is correct
27 Correct 128 ms 150980 KB Output is correct
28 Correct 148 ms 150976 KB Output is correct
29 Correct 129 ms 151128 KB Output is correct
30 Correct 126 ms 151008 KB Output is correct
31 Correct 125 ms 151056 KB Output is correct
32 Correct 123 ms 151012 KB Output is correct
33 Correct 124 ms 151016 KB Output is correct
34 Correct 131 ms 151096 KB Output is correct
35 Correct 127 ms 151112 KB Output is correct
36 Correct 124 ms 151112 KB Output is correct
37 Correct 122 ms 150984 KB Output is correct
38 Correct 121 ms 151020 KB Output is correct
39 Correct 124 ms 151048 KB Output is correct
40 Correct 122 ms 151120 KB Output is correct
41 Correct 124 ms 150984 KB Output is correct
42 Correct 139 ms 150984 KB Output is correct
43 Correct 141 ms 151072 KB Output is correct
44 Correct 123 ms 151000 KB Output is correct
45 Correct 221 ms 154464 KB Output is correct
46 Correct 220 ms 154500 KB Output is correct
47 Correct 245 ms 154652 KB Output is correct
48 Correct 216 ms 154512 KB Output is correct
49 Correct 220 ms 154572 KB Output is correct
50 Correct 179 ms 153436 KB Output is correct
51 Correct 175 ms 153012 KB Output is correct
52 Correct 179 ms 157728 KB Output is correct
53 Correct 178 ms 157716 KB Output is correct
54 Correct 140 ms 152924 KB Output is correct
55 Correct 138 ms 152908 KB Output is correct
56 Correct 138 ms 152952 KB Output is correct
57 Correct 188 ms 155296 KB Output is correct
58 Correct 178 ms 157720 KB Output is correct
59 Correct 180 ms 157256 KB Output is correct
60 Correct 191 ms 155860 KB Output is correct
61 Correct 204 ms 155068 KB Output is correct
62 Correct 148 ms 152916 KB Output is correct
63 Correct 166 ms 153208 KB Output is correct
64 Correct 179 ms 153408 KB Output is correct
65 Correct 143 ms 153144 KB Output is correct
66 Correct 139 ms 153040 KB Output is correct
67 Correct 189 ms 153568 KB Output is correct
68 Correct 188 ms 153684 KB Output is correct
69 Correct 193 ms 153788 KB Output is correct
70 Correct 189 ms 153796 KB Output is correct
71 Correct 186 ms 153632 KB Output is correct
72 Correct 190 ms 153744 KB Output is correct
73 Correct 184 ms 153672 KB Output is correct
74 Correct 185 ms 153700 KB Output is correct
75 Correct 202 ms 153688 KB Output is correct
76 Correct 204 ms 153744 KB Output is correct
77 Correct 190 ms 153572 KB Output is correct
78 Correct 204 ms 154460 KB Output is correct
79 Correct 221 ms 154500 KB Output is correct
80 Correct 1080 ms 188476 KB Output is correct
81 Correct 1062 ms 188828 KB Output is correct
82 Correct 1053 ms 189116 KB Output is correct
83 Correct 1063 ms 188756 KB Output is correct
84 Correct 1086 ms 188516 KB Output is correct
85 Correct 613 ms 175528 KB Output is correct
86 Correct 454 ms 173752 KB Output is correct
87 Correct 875 ms 220232 KB Output is correct
88 Correct 874 ms 220232 KB Output is correct
89 Correct 339 ms 173332 KB Output is correct
90 Correct 328 ms 173352 KB Output is correct
91 Correct 330 ms 173412 KB Output is correct
92 Correct 980 ms 196836 KB Output is correct
93 Correct 902 ms 220232 KB Output is correct
94 Correct 873 ms 209864 KB Output is correct
95 Correct 1010 ms 194372 KB Output is correct
96 Correct 1028 ms 190460 KB Output is correct
97 Correct 505 ms 173336 KB Output is correct
98 Correct 504 ms 174244 KB Output is correct
99 Correct 583 ms 175324 KB Output is correct
100 Correct 357 ms 173408 KB Output is correct
101 Correct 335 ms 173268 KB Output is correct
102 Correct 903 ms 177692 KB Output is correct
103 Correct 900 ms 177568 KB Output is correct
104 Correct 907 ms 177812 KB Output is correct
105 Correct 916 ms 177616 KB Output is correct
106 Correct 861 ms 177584 KB Output is correct
107 Correct 864 ms 177680 KB Output is correct
108 Correct 887 ms 177588 KB Output is correct
109 Correct 896 ms 177624 KB Output is correct
110 Correct 939 ms 177684 KB Output is correct
111 Correct 929 ms 177700 KB Output is correct
112 Correct 930 ms 177588 KB Output is correct
113 Correct 1065 ms 189168 KB Output is correct
114 Correct 1070 ms 188992 KB Output is correct