oj.uz

Submission #414930

# Submission time Handle Problem Language Result Execution time Memory
414930 2021-05-31T10:44:19 Z Pro_ktmr Port Facility (JOI17_port_facility) C++17
100 / 100
 3216 ms 243412 KB 
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
constexpr ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
template<class T> bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b){ if(b<a){ a=b; return 1; } return 0; }
constexpr int dy[4]={-1,0,1,0};
constexpr int dx[4]={0,-1,0,1};

struct UnionFind{
private:
    vector<int> par;
    vector<set<int>> fac;
public:
    void init(int N, vector<int> v){
        par.resize(N);
        fac.resize(N);
        for(int i=0; i<N; i++) par[i] = i;
        for(int i=0; i<N; i++) fac[i].insert(v[i]);
    }
    void unite(int a, int b){
        int rootA = root(a);
        int rootB = root(b);
        if(rootA == rootB) return;
        if(fac[rootA].size() < fac[rootB].size()) swap(rootA, rootB);
        par[rootB] = rootA;
        fac[rootA].merge(fac[rootB]);
    }
    int root(int a){
        if(par[a] == a) return a;
        return par[a] = root(par[a]);
    }
    bool same(int a, int b){
        return root(a) == root(b);
    }
    int size(int a){
        return fac[root(a)].size();
    }
    set<int>& fact(int a){
        return fac[root(a)];
    }
};

template<typename T>
struct WeightedUnionFind{
private:
    vector<int> par;
    vector<int> siz;
    vector<T> dif;
public:
    void init(int N){
        par.resize(N);
        siz.resize(N);
        dif.resize(N);
        for(int i=0; i<N; i++){
            par[i] = i;
            siz[i] = 1;
            dif[i] = 0;
        }
    }
    void unite(int a, int b, T d){
        int rootA = root(a);
        int rootB = root(b);
        if(rootA == rootB) return;
        d += weight(a);
        d -= weight(b);
        if(siz[rootA] < siz[rootB]){
            swap(rootA, rootB);
            d *= -1;
        }
        par[rootB] = rootA;
        dif[rootB] = d;
        siz[rootA] += siz[rootB];
    }
    int root(int a){
        if(par[a] == a) return a;
        int r = root(par[a]);
        dif[a] += dif[par[a]];
        return par[a] = r;
    }
    bool same(int a, int b){
        return root(a) == root(b);
    }
    int size(int a){
        return siz[root(a)];
    }
    T weight(int a){
        root(a);
        return dif[a];
    }
    T diff(int a, int b){
        return weight(b) - weight(a);
    }
};

template<typename T>
struct SegmentTree{
private:
    int n, N;
    vector<T> node;
    function<T(T, T)> F;
    T E;
public:
    void init(int _n, function<T(T, T)> f, T e){
        F = f;
        E = e;
        n = _n;
        N = 1;
        while(N < n) N = (N<<1);
        node.assign(2*N-1, e);
    }
    void init(vector<T> v, function<T(T, T)> f, T e){
        F = f;
        E = e;
        n = v.size();
        N = 1;
        while(N < n) N = (N<<1);
        node.assign(2*N-1, e);
        for(int i=0; i<n; i++) node[N-1+i] = v[i];
        for(int i=N-2; i>=0; i--) node[i] = F(node[(i<<1)+1], node[(i<<1)+2]);
    }
    T& operator [](int a){
        return node[N-1+a];
    }
    void update(int a, T x){
        a += N-1;
        node[a] = x;
        while(a > 0){
            a = (a-1)>>1;
            node[a] = F(node[(a<<1)+1], node[(a<<1)+2]);
        }
    }
    T query(int a, int b, int k=0, int l=0, int r=-1){
        if(r == -1) r = N;
        if(b <= l || r <= a) return E;
        if(a <= l && r <= b) return node[k];
        return F(query(a, b, (k<<1)+1, l, (l+r)>>1), query(a, b, (k<<1)+2, (l+r)>>1, r));
    }
    int find_right(function<bool(T)> g, int a){
        if(!g(E)) return -1;
        T t = E;
        return min(find_right(g, a, 0, 0, N, t), n);
    }
    int find_right(function<bool(T)> g, int a, int k, int l, int r, T &t){
        if(r-l == 1){
            t = F(t, node[k]);
            return g(t) ? r : a;
        }
        int m = (l + r) >> 1;
        if(m <= a) return find_right(g, a, (k<<1)+2, m, r, t);
        if(a <= l && g(F(t, node[k]))){
            t = F(t, node[k]);
            return r;
        }
        int L = find_right(g, a, (k<<1)+1, l, m, t);
        if(L < m) return L;
        int R = find_right(g, a, (k<<1)+2, m, r, t);
        return max(L, R);
    }
    int find_left(function<bool(T)> g, int b){
        if(!g(E)) return n + 1;
        T t = E;
        return find_left(g, b, 0, 0, N, t);
    }
    int find_left(function<bool(T)> g, int b, int k, int l, int r, T t){
        if(r-l == 1){
            t = F(node[k], t);
            return g(t) ? l : b;
        }
        int m = (l + r) >> 1;
        if(b <= m) return find_left(g, b, (k<<1)+1, l, m, t);
        if(r <= b && g(F(node[k], t))){
            t = F(node[k], t);
            return l;
        }
        int R = find_left(g, b, (k<<1)+2, m, r, t);
        if(m < R) return R;
        int L = find_left(g, b, (k<<1)+1, l, m, t);
        return min(L, R);
    }
};

struct Monoid{
    int a, b;
    friend Monoid operator*(const Monoid& a, const Monoid& b){
        return {a.a+b.a,a.b+b.b};
    }
};

int N;
vector<int> A, B;
int P[2000000];

SegmentTree<Monoid> segtree;

UnionFind uf;
WeightedUnionFind<int> wuf;

set<int> ls[1000000];

signed main(){
	scanf("%d", &N);
    A.resize(N); B.resize(N);
	rep(i, N){
		scanf("%d%d", &A[i], &B[i]);
		A[i]--; B[i]--;
		P[A[i]] = i-1e9;
		P[B[i]] = i;
	}

    uf.init(N, B);
    wuf.init(N);
	set<int> st;
	rep(i, 2*N){
		if(P[i] < 0){
			if(st.size() && *st.begin() < B[P[i]+1e9]){
				int tmp = *st.begin();
				while(st.size() && *st.begin() < B[P[i]+1e9]){
                    uf.unite(P[*st.begin()], P[i]+1e9);
                    wuf.unite(P[*st.begin()], P[i]+1e9, 1);
					st.erase(st.begin());
				}
                st.insert(tmp);
			}
			else{
				st.insert(B[P[i]+1e9]);
			}
		}
		else{
			st.erase(i);
            auto itr = uf.fact(P[i]).upper_bound(i);
            if(itr != uf.fact(P[i]).end()){
                st.insert(*itr);
            }
		}
	}

    segtree.init(2*N, [](Monoid a, Monoid b){ return a*b; }, {0,0});
    rep(k, N){
        if(uf.root(k) == k){
            vector<int> v;
            for(auto itr=uf.fact(k).begin(); itr!=uf.fact(k).end(); itr++){
                v.pb(*itr);
                v.pb(A[P[*itr]]);
            }
            sort(all(v));
            for(int i: v){
                if(P[i] < 0){
                    Monoid m = segtree.query(i, B[P[i]+1e9]);
                    if((wuf.diff(k, P[i]+1e9)+2*N)%2 == 0){
                        if(m.a > 0){
                            printf("0\n");
                            exit(0);
                        }
                        segtree.update(B[P[i]+1e9], {1,0});
                    }
                    else{
                        if(m.b > 0){
                            printf("0\n");
                            exit(0);
                        }
                        segtree.update(B[P[i]+1e9], {0,1});
                    }
                }
                else{
                    segtree.update(i, {0,0});
                }
            }
        }
    }

    ll ans = 1;
    rep(i, N) (ans *= (uf.root(i) == i ? 2 : 1)) %= MOD;
    printf("%lld\n", ans);
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:15:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
      |                           ^
port_facility.cpp:215:2: note: in expansion of macro 'rep'
  215 |  rep(i, N){
      |  ^~~
port_facility.cpp:15:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
      |                           ^
port_facility.cpp:225:2: note: in expansion of macro 'rep'
  225 |  rep(i, 2*N){
      |  ^~~
port_facility.cpp:15:27: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   15 | #define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
      |                           ^
port_facility.cpp:250:5: note: in expansion of macro 'rep'
  250 |     rep(k, N){
      |     ^~~
port_facility.cpp:15:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
      |                           ^
port_facility.cpp:284:5: note: in expansion of macro 'rep'
  284 |     rep(i, N) (ans *= (uf.root(i) == i ? 2 : 1)) %= MOD;
      |     ^~~
port_facility.cpp:213:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  213 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
port_facility.cpp:216:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  216 |   scanf("%d%d", &A[i], &B[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47172 KB Output is correct
2 Correct 30 ms 47264 KB Output is correct
3 Correct 33 ms 47220 KB Output is correct
4 Correct 29 ms 47136 KB Output is correct
5 Correct 32 ms 47140 KB Output is correct
6 Correct 33 ms 47276 KB Output is correct
7 Correct 33 ms 47160 KB Output is correct
8 Correct 30 ms 47248 KB Output is correct
9 Correct 30 ms 47248 KB Output is correct
10 Correct 31 ms 47340 KB Output is correct
11 Correct 29 ms 47276 KB Output is correct
12 Correct 29 ms 47244 KB Output is correct
13 Correct 28 ms 47280 KB Output is correct
14 Correct 31 ms 47252 KB Output is correct
15 Correct 28 ms 47168 KB Output is correct
16 Correct 31 ms 47176 KB Output is correct
17 Correct 29 ms 47180 KB Output is correct
18 Correct 29 ms 47192 KB Output is correct
19 Correct 32 ms 47252 KB Output is correct
20 Correct 30 ms 47216 KB Output is correct
21 Correct 30 ms 47240 KB Output is correct
22 Correct 29 ms 47168 KB Output is correct
23 Correct 29 ms 47140 KB Output is correct
24 Correct 31 ms 47268 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47172 KB Output is correct
2 Correct 30 ms 47264 KB Output is correct
3 Correct 33 ms 47220 KB Output is correct
4 Correct 29 ms 47136 KB Output is correct
5 Correct 32 ms 47140 KB Output is correct
6 Correct 33 ms 47276 KB Output is correct
7 Correct 33 ms 47160 KB Output is correct
8 Correct 30 ms 47248 KB Output is correct
9 Correct 30 ms 47248 KB Output is correct
10 Correct 31 ms 47340 KB Output is correct
11 Correct 29 ms 47276 KB Output is correct
12 Correct 29 ms 47244 KB Output is correct
13 Correct 28 ms 47280 KB Output is correct
14 Correct 31 ms 47252 KB Output is correct
15 Correct 28 ms 47168 KB Output is correct
16 Correct 31 ms 47176 KB Output is correct
17 Correct 29 ms 47180 KB Output is correct
18 Correct 29 ms 47192 KB Output is correct
19 Correct 32 ms 47252 KB Output is correct
20 Correct 30 ms 47216 KB Output is correct
21 Correct 30 ms 47240 KB Output is correct
22 Correct 29 ms 47168 KB Output is correct
23 Correct 29 ms 47140 KB Output is correct
24 Correct 31 ms 47268 KB Output is correct
25 Correct 33 ms 47528 KB Output is correct
26 Correct 31 ms 47556 KB Output is correct
27 Correct 31 ms 47608 KB Output is correct
28 Correct 32 ms 47632 KB Output is correct
29 Correct 32 ms 47564 KB Output is correct
30 Correct 32 ms 47564 KB Output is correct
31 Correct 31 ms 47564 KB Output is correct
32 Correct 31 ms 47552 KB Output is correct
33 Correct 32 ms 47508 KB Output is correct
34 Correct 34 ms 47648 KB Output is correct
35 Correct 33 ms 47564 KB Output is correct
36 Correct 30 ms 47536 KB Output is correct
37 Correct 30 ms 47556 KB Output is correct
38 Correct 32 ms 47640 KB Output is correct
39 Correct 31 ms 47464 KB Output is correct
40 Correct 31 ms 47532 KB Output is correct
41 Correct 31 ms 47556 KB Output is correct
42 Correct 32 ms 47604 KB Output is correct
43 Correct 31 ms 47540 KB Output is correct
44 Correct 31 ms 47656 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47172 KB Output is correct
2 Correct 30 ms 47264 KB Output is correct
3 Correct 33 ms 47220 KB Output is correct
4 Correct 29 ms 47136 KB Output is correct
5 Correct 32 ms 47140 KB Output is correct
6 Correct 33 ms 47276 KB Output is correct
7 Correct 33 ms 47160 KB Output is correct
8 Correct 30 ms 47248 KB Output is correct
9 Correct 30 ms 47248 KB Output is correct
10 Correct 31 ms 47340 KB Output is correct
11 Correct 29 ms 47276 KB Output is correct
12 Correct 29 ms 47244 KB Output is correct
13 Correct 28 ms 47280 KB Output is correct
14 Correct 31 ms 47252 KB Output is correct
15 Correct 28 ms 47168 KB Output is correct
16 Correct 31 ms 47176 KB Output is correct
17 Correct 29 ms 47180 KB Output is correct
18 Correct 29 ms 47192 KB Output is correct
19 Correct 32 ms 47252 KB Output is correct
20 Correct 30 ms 47216 KB Output is correct
21 Correct 30 ms 47240 KB Output is correct
22 Correct 29 ms 47168 KB Output is correct
23 Correct 29 ms 47140 KB Output is correct
24 Correct 31 ms 47268 KB Output is correct
25 Correct 33 ms 47528 KB Output is correct
26 Correct 31 ms 47556 KB Output is correct
27 Correct 31 ms 47608 KB Output is correct
28 Correct 32 ms 47632 KB Output is correct
29 Correct 32 ms 47564 KB Output is correct
30 Correct 32 ms 47564 KB Output is correct
31 Correct 31 ms 47564 KB Output is correct
32 Correct 31 ms 47552 KB Output is correct
33 Correct 32 ms 47508 KB Output is correct
34 Correct 34 ms 47648 KB Output is correct
35 Correct 33 ms 47564 KB Output is correct
36 Correct 30 ms 47536 KB Output is correct
37 Correct 30 ms 47556 KB Output is correct
38 Correct 32 ms 47640 KB Output is correct
39 Correct 31 ms 47464 KB Output is correct
40 Correct 31 ms 47532 KB Output is correct
41 Correct 31 ms 47556 KB Output is correct
42 Correct 32 ms 47604 KB Output is correct
43 Correct 31 ms 47540 KB Output is correct
44 Correct 31 ms 47656 KB Output is correct
45 Correct 269 ms 65436 KB Output is correct
46 Correct 227 ms 65916 KB Output is correct
47 Correct 264 ms 65292 KB Output is correct
48 Correct 242 ms 66024 KB Output is correct
49 Correct 256 ms 65388 KB Output is correct
50 Correct 226 ms 65980 KB Output is correct
51 Correct 152 ms 65864 KB Output is correct
52 Correct 164 ms 65160 KB Output is correct
53 Correct 231 ms 65696 KB Output is correct
54 Correct 134 ms 66600 KB Output is correct
55 Correct 140 ms 66064 KB Output is correct
56 Correct 136 ms 65980 KB Output is correct
57 Correct 181 ms 65060 KB Output is correct
58 Correct 170 ms 65156 KB Output is correct
59 Correct 240 ms 66648 KB Output is correct
60 Correct 232 ms 66108 KB Output is correct
61 Correct 229 ms 65388 KB Output is correct
62 Correct 163 ms 65824 KB Output is correct
63 Correct 141 ms 65608 KB Output is correct
64 Correct 155 ms 65468 KB Output is correct
65 Correct 198 ms 66684 KB Output is correct
66 Correct 202 ms 66684 KB Output is correct
67 Correct 247 ms 67508 KB Output is correct
68 Correct 237 ms 67508 KB Output is correct
69 Correct 234 ms 67508 KB Output is correct
70 Correct 273 ms 67508 KB Output is correct
71 Correct 224 ms 67516 KB Output is correct
72 Correct 233 ms 67620 KB Output is correct
73 Correct 211 ms 67388 KB Output is correct
74 Correct 218 ms 67500 KB Output is correct
75 Correct 218 ms 66656 KB Output is correct
76 Correct 190 ms 66688 KB Output is correct
77 Correct 194 ms 66616 KB Output is correct
78 Correct 254 ms 66052 KB Output is correct
79 Correct 227 ms 65596 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47172 KB Output is correct
2 Correct 30 ms 47264 KB Output is correct
3 Correct 33 ms 47220 KB Output is correct
4 Correct 29 ms 47136 KB Output is correct
5 Correct 32 ms 47140 KB Output is correct
6 Correct 33 ms 47276 KB Output is correct
7 Correct 33 ms 47160 KB Output is correct
8 Correct 30 ms 47248 KB Output is correct
9 Correct 30 ms 47248 KB Output is correct
10 Correct 31 ms 47340 KB Output is correct
11 Correct 29 ms 47276 KB Output is correct
12 Correct 29 ms 47244 KB Output is correct
13 Correct 28 ms 47280 KB Output is correct
14 Correct 31 ms 47252 KB Output is correct
15 Correct 28 ms 47168 KB Output is correct
16 Correct 31 ms 47176 KB Output is correct
17 Correct 29 ms 47180 KB Output is correct
18 Correct 29 ms 47192 KB Output is correct
19 Correct 32 ms 47252 KB Output is correct
20 Correct 30 ms 47216 KB Output is correct
21 Correct 30 ms 47240 KB Output is correct
22 Correct 29 ms 47168 KB Output is correct
23 Correct 29 ms 47140 KB Output is correct
24 Correct 31 ms 47268 KB Output is correct
25 Correct 33 ms 47528 KB Output is correct
26 Correct 31 ms 47556 KB Output is correct
27 Correct 31 ms 47608 KB Output is correct
28 Correct 32 ms 47632 KB Output is correct
29 Correct 32 ms 47564 KB Output is correct
30 Correct 32 ms 47564 KB Output is correct
31 Correct 31 ms 47564 KB Output is correct
32 Correct 31 ms 47552 KB Output is correct
33 Correct 32 ms 47508 KB Output is correct
34 Correct 34 ms 47648 KB Output is correct
35 Correct 33 ms 47564 KB Output is correct
36 Correct 30 ms 47536 KB Output is correct
37 Correct 30 ms 47556 KB Output is correct
38 Correct 32 ms 47640 KB Output is correct
39 Correct 31 ms 47464 KB Output is correct
40 Correct 31 ms 47532 KB Output is correct
41 Correct 31 ms 47556 KB Output is correct
42 Correct 32 ms 47604 KB Output is correct
43 Correct 31 ms 47540 KB Output is correct
44 Correct 31 ms 47656 KB Output is correct
45 Correct 269 ms 65436 KB Output is correct
46 Correct 227 ms 65916 KB Output is correct
47 Correct 264 ms 65292 KB Output is correct
48 Correct 242 ms 66024 KB Output is correct
49 Correct 256 ms 65388 KB Output is correct
50 Correct 226 ms 65980 KB Output is correct
51 Correct 152 ms 65864 KB Output is correct
52 Correct 164 ms 65160 KB Output is correct
53 Correct 231 ms 65696 KB Output is correct
54 Correct 134 ms 66600 KB Output is correct
55 Correct 140 ms 66064 KB Output is correct
56 Correct 136 ms 65980 KB Output is correct
57 Correct 181 ms 65060 KB Output is correct
58 Correct 170 ms 65156 KB Output is correct
59 Correct 240 ms 66648 KB Output is correct
60 Correct 232 ms 66108 KB Output is correct
61 Correct 229 ms 65388 KB Output is correct
62 Correct 163 ms 65824 KB Output is correct
63 Correct 141 ms 65608 KB Output is correct
64 Correct 155 ms 65468 KB Output is correct
65 Correct 198 ms 66684 KB Output is correct
66 Correct 202 ms 66684 KB Output is correct
67 Correct 247 ms 67508 KB Output is correct
68 Correct 237 ms 67508 KB Output is correct
69 Correct 234 ms 67508 KB Output is correct
70 Correct 273 ms 67508 KB Output is correct
71 Correct 224 ms 67516 KB Output is correct
72 Correct 233 ms 67620 KB Output is correct
73 Correct 211 ms 67388 KB Output is correct
74 Correct 218 ms 67500 KB Output is correct
75 Correct 218 ms 66656 KB Output is correct
76 Correct 190 ms 66688 KB Output is correct
77 Correct 194 ms 66616 KB Output is correct
78 Correct 254 ms 66052 KB Output is correct
79 Correct 227 ms 65596 KB Output is correct
80 Correct 2944 ms 221948 KB Output is correct
81 Correct 3016 ms 221556 KB Output is correct
82 Correct 3122 ms 221544 KB Output is correct
83 Correct 3108 ms 221512 KB Output is correct
84 Correct 3031 ms 221556 KB Output is correct
85 Correct 1819 ms 223192 KB Output is correct
86 Correct 1991 ms 226220 KB Output is correct
87 Correct 2303 ms 219916 KB Output is correct
88 Correct 3150 ms 234032 KB Output is correct
89 Correct 1984 ms 232128 KB Output is correct
90 Correct 1817 ms 227932 KB Output is correct
91 Correct 1750 ms 227900 KB Output is correct
92 Correct 2443 ms 219832 KB Output is correct
93 Correct 2212 ms 219912 KB Output is correct
94 Correct 2888 ms 233164 KB Output is correct
95 Correct 3050 ms 224776 KB Output is correct
96 Correct 2970 ms 220688 KB Output is correct
97 Correct 2322 ms 226568 KB Output is correct
98 Correct 2250 ms 223452 KB Output is correct
99 Correct 1983 ms 227904 KB Output is correct
100 Correct 2974 ms 232128 KB Output is correct
101 Correct 3049 ms 232128 KB Output is correct
102 Correct 3126 ms 243396 KB Output is correct
103 Correct 3161 ms 243392 KB Output is correct
104 Correct 3094 ms 243404 KB Output is correct
105 Correct 3197 ms 243412 KB Output is correct
106 Correct 3073 ms 243392 KB Output is correct
107 Correct 3216 ms 243388 KB Output is correct
108 Correct 3216 ms 243396 KB Output is correct
109 Correct 3024 ms 243288 KB Output is correct
110 Correct 2565 ms 232124 KB Output is correct
111 Correct 2675 ms 232152 KB Output is correct
112 Correct 2587 ms 232136 KB Output is correct
113 Correct 3159 ms 220732 KB Output is correct
114 Correct 3032 ms 221484 KB Output is correct