oj.uz

Submission #657424

# Submission time Handle Problem Language Result Execution time Memory
657424 2022-11-09T20:08:29 Z inksamurai Martian DNA (BOI18_dna) C++17
100 / 100
 133 ms 139100 KB 
#include <bits/stdc++.h>

// cut here
#ifdef _MSC_VER
#include <intrin.h>
#endif
 
namespace atcoder {
 
namespace internal {
 
int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}
 
int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}
 
}  // namespace internal
 
}  // namespace atcoder
 
 
namespace atcoder {
 
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }
 
    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }
 
    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }
 
    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;
 
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }
 
    S all_prod() { return d[1]; }
 
    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }
 
    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
 
  private:
    int _n, size, log;
    std::vector<S> d;
 
    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
 
}  // namespace atcoder
// cut here 

using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3NRqilq ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

const int inf=1e9;

int op(int l,int r){
	return min(l,r);
}
int e(){
	return inf;
}

signed main(){
_3NRqilq;
	int n,k,q;
	cin>>n>>k>>q;
	vi a(n);
	rep(i,n){
		cin>>a[i];
	}
	vi nd(k);
	rep(_,q){
		int x,d;
		cin>>x>>d;
		nd[x]=d;
	}
	atcoder::segtree<int,op,e> seg(k);
	rep(i,k){
		if(nd[i]){
			seg.set(i,-inf);
		}else{
			seg.set(i,inf);
		}
	}
	vec(deque<int>) rbts(k);
	int ans=inf;
	rep(i,n){
		int v=a[i];
		rbts[v].pb(i);
		while(sz(rbts[v])>nd[v]){
			rbts[v].pop_front();
		}
		if(sz(rbts[v])==nd[v] and nd[v]){
			seg.set(v,rbts[v].front());
		}
		int l=seg.all_prod();
		ans=min(ans,i-l+1);
	}
	if(ans==inf){
		cout<<"impossible\n";
	}else{
		cout<<ans<<"\n";
	}
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 320 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 3 ms 2004 KB Output is correct
4 Correct 3 ms 3028 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 316 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1872 KB Output is correct
2 Correct 13 ms 1612 KB Output is correct
3 Correct 14 ms 1548 KB Output is correct
4 Correct 14 ms 1740 KB Output is correct
5 Correct 67 ms 56836 KB Output is correct
6 Correct 13 ms 2248 KB Output is correct
7 Correct 14 ms 1620 KB Output is correct
8 Correct 109 ms 139048 KB Output is correct
9 Correct 20 ms 6988 KB Output is correct
10 Correct 12 ms 1736 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 2020 KB Output is correct
14 Correct 3 ms 3028 KB Output is correct
15 Correct 2 ms 1364 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 320 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 56816 KB Output is correct
2 Correct 84 ms 42728 KB Output is correct
3 Correct 63 ms 42636 KB Output is correct
4 Correct 12 ms 1492 KB Output is correct
5 Correct 79 ms 70244 KB Output is correct
6 Correct 133 ms 125440 KB Output is correct
7 Correct 26 ms 7112 KB Output is correct
8 Correct 37 ms 15312 KB Output is correct
9 Correct 12 ms 1876 KB Output is correct
10 Correct 12 ms 1608 KB Output is correct
11 Correct 20 ms 1504 KB Output is correct
12 Correct 13 ms 1740 KB Output is correct
13 Correct 66 ms 56700 KB Output is correct
14 Correct 11 ms 2280 KB Output is correct
15 Correct 15 ms 1628 KB Output is correct
16 Correct 108 ms 139100 KB Output is correct
17 Correct 21 ms 6984 KB Output is correct
18 Correct 19 ms 1744 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 2008 KB Output is correct
22 Correct 2 ms 3028 KB Output is correct
23 Correct 1 ms 1364 KB Output is correct
24 Correct 2 ms 304 KB Output is correct
25 Correct 0 ms 320 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 212 KB Output is correct