oj.uz

Submission #658310

# Submission time Handle Problem Language Result Execution time Memory
658310 2022-11-12T19:24:20 Z inksamurai Toll (BOI17_toll) C++17
100 / 100
 155 ms 49244 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 
#define int ll
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 _3TBjhXk 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=1e10;

struct dat{
	int frl,bkl; // front level, back level
	int res[5][5];
	dat(){
		rep(i,5){
			rep(j,5){
				res[i][j]=inf;
			}
		}
	}
};

int k,n,m,q;
int es[50011][5][5];

dat op(const dat l,const dat r){
	if(l.bkl==-1) return r;
	if(r.frl==-1) return l;
	dat res;
	res.frl=l.frl;
	res.bkl=r.bkl;
	int frm=l.bkl;
	int to=r.frl;
	rep(j0,k){
		rep(j1,k){
			rep(j2,k){
				rep(j3,k){
					// j0 is l.frl
					// j1 and j2 should merge
					// j3 is r.bkr
					res.res[j0][j3]=min(res.res[j0][j3],l.res[j0][j1]+r.res[j2][j3]+es[l.bkl][j1][j2]);
				}
			}
		}
	}
	return res;
}
dat _e;
dat e(){
	return _e;
}

signed main(){
_3TBjhXk;
	cin>>k>>n>>m>>q;
	rep(i,n){
		rep(j0,k){
			rep(j1,k){
				es[i][j0][j1]=inf;
			}
		}
	}
	rep(j0,k){
		rep(j1,k){
			_e.bkl=-1;
			_e.frl=-1;
			_e.res[j0][j1]=inf;
		}
	}
	rep(i,m){
		int u,v,w;
		cin>>u>>v>>w;
		// print(u/k,u%k,v%k,w);
		es[(u/k)][u%k][v%k]=w;
	}
	atcoder::segtree<dat,op,e> seg(n/k+1);
	for(int i=0;i<n;i+=k){
		dat now;
		now.frl=i/k;
		now.bkl=i/k;
		for(int j=i;j<min(n,i+k);j++){
			now.res[j%k][j%k]=0;
		}
		seg.set(i/k,now);
	}
	rep(_,q){
		int u,v;
		cin>>u>>v;
		int ans=inf;
		if(u/k!=v/k){
			dat now=seg.prod(u/k,v/k+1);
			ans=now.res[u%k][v%k];
		}		
		print(ans==inf?-1:ans);
	}
}

Compilation message

toll.cpp: In function 'dat op(dat, dat)':
toll.cpp:182:6: warning: unused variable 'frm' [-Wunused-variable]
  182 |  int frm=l.bkl;
      |      ^~~
toll.cpp:183:6: warning: unused variable 'to' [-Wunused-variable]
  183 |  int to=r.frl;
      |      ^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 48260 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 1108 KB Output is correct
6 Correct 3 ms 1112 KB Output is correct
7 Correct 2 ms 1104 KB Output is correct
8 Correct 97 ms 49228 KB Output is correct
9 Correct 101 ms 49244 KB Output is correct
10 Correct 96 ms 48424 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 29172 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 8 ms 1152 KB Output is correct
8 Correct 7 ms 852 KB Output is correct
9 Correct 91 ms 48332 KB Output is correct
10 Correct 96 ms 27380 KB Output is correct
11 Correct 78 ms 29168 KB Output is correct
12 Correct 74 ms 27468 KB Output is correct
13 Correct 78 ms 10912 KB Output is correct
14 Correct 45 ms 15188 KB Output is correct
15 Correct 64 ms 10924 KB Output is correct
16 Correct 64 ms 10828 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 83 ms 48372 KB Output is correct
11 Correct 63 ms 29156 KB Output is correct
12 Correct 69 ms 27368 KB Output is correct
13 Correct 99 ms 27364 KB Output is correct
14 Correct 65 ms 27356 KB Output is correct
15 Correct 60 ms 10796 KB Output is correct
16 Correct 50 ms 10936 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 83 ms 48372 KB Output is correct
11 Correct 63 ms 29156 KB Output is correct
12 Correct 69 ms 27368 KB Output is correct
13 Correct 99 ms 27364 KB Output is correct
14 Correct 65 ms 27356 KB Output is correct
15 Correct 60 ms 10796 KB Output is correct
16 Correct 50 ms 10936 KB Output is correct
17 Correct 64 ms 29168 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 5 ms 1108 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 18 ms 704 KB Output is correct
26 Correct 8 ms 684 KB Output is correct
27 Correct 88 ms 48268 KB Output is correct
28 Correct 80 ms 27380 KB Output is correct
29 Correct 86 ms 27468 KB Output is correct
30 Correct 74 ms 27480 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 48260 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 1108 KB Output is correct
6 Correct 3 ms 1112 KB Output is correct
7 Correct 2 ms 1104 KB Output is correct
8 Correct 97 ms 49228 KB Output is correct
9 Correct 101 ms 49244 KB Output is correct
10 Correct 96 ms 48424 KB Output is correct
11 Correct 81 ms 29172 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 8 ms 1152 KB Output is correct
18 Correct 7 ms 852 KB Output is correct
19 Correct 91 ms 48332 KB Output is correct
20 Correct 96 ms 27380 KB Output is correct
21 Correct 78 ms 29168 KB Output is correct
22 Correct 74 ms 27468 KB Output is correct
23 Correct 78 ms 10912 KB Output is correct
24 Correct 45 ms 15188 KB Output is correct
25 Correct 64 ms 10924 KB Output is correct
26 Correct 64 ms 10828 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 1108 KB Output is correct
33 Correct 2 ms 852 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 83 ms 48372 KB Output is correct
37 Correct 63 ms 29156 KB Output is correct
38 Correct 69 ms 27368 KB Output is correct
39 Correct 99 ms 27364 KB Output is correct
40 Correct 65 ms 27356 KB Output is correct
41 Correct 60 ms 10796 KB Output is correct
42 Correct 50 ms 10936 KB Output is correct
43 Correct 64 ms 29168 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 5 ms 1108 KB Output is correct
50 Correct 4 ms 852 KB Output is correct
51 Correct 18 ms 704 KB Output is correct
52 Correct 8 ms 684 KB Output is correct
53 Correct 88 ms 48268 KB Output is correct
54 Correct 80 ms 27380 KB Output is correct
55 Correct 86 ms 27468 KB Output is correct
56 Correct 74 ms 27480 KB Output is correct
57 Correct 155 ms 22888 KB Output is correct
58 Correct 99 ms 49224 KB Output is correct
59 Correct 81 ms 30936 KB Output is correct