oj.uz

Submission #328205

# Submission time Handle Problem Language Result Execution time Memory
328205 2020-11-15T18:13:18 Z jc713 Toll (BOI17_toll) C++17
100 / 100
 364 ms 67872 KB 
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>,
    rb_tree_tag, tree_order_statistics_node_update>;
 
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using db = double; 
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>; 
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>; 
using vpd = vector<pd>;

#define tcT template<class T
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 

// pairs
#define mp make_pair
#define f first
#define s second

// vectors
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const int IINF = 1e9;
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

// helper funcs
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down

tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; }

#define tcTU tcT, class U
tcTU> T fstTrue(T lo, T hi, U f) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        T mid = lo+(hi-lo)/2;
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
    lo --; assert(lo <= hi); // assuming f is decreasing
    while (lo < hi) { // find first index such that f is true 
        T mid = lo+(hi-lo+1)/2;
        f(mid) ? lo = mid : hi = mid-1;
    } 
    return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
    sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
    auto it = t.find(u); assert(it != end(t));
    t.erase(u); } // element that doesn't exist from (multi)set

// INPUT
#define tcTUU tcT, class ...U
tcT> void re(complex<T>& c);
tcTU> void re(pair<T,U>& p);
tcT> void re(vector<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);

tcT> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }

tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> void re(vector<T>& x) { trav(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
    #ifdef LOCAL
        return b ? "true" : "false"; 
    #else 
        return ts((int)b);
    #endif
}
tcT> str ts(complex<T> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
tcTU> str ts(pair<T,U> p);
tcT> str ts(T v) { // containers with begin(), end()
    #ifdef LOCAL
        bool fst = 1; str res = "{";
        for (const auto& x: v) {
            if (!fst) res += ", ";
            fst = 0; res += ts(x);
        }
        res += "}"; return res;
    #else
        bool fst = 1; str res = "";
        for (const auto& x: v) {
            if (!fst) res += " ";
            fst = 0; res += ts(x);
        }
        return res;

    #endif
}
tcTU> str ts(pair<T,U> p) {
    #ifdef LOCAL
        return "("+ts(p.f)+", "+ts(p.s)+")"; 
    #else
        return ts(p.f)+" "+ts(p.s);
    #endif
}

// OUTPUT
tcT> void pr(T x) { cout << ts(x); }
tcTUU> void pr(const T& t, const U&... u) { 
    pr(t); pr(u...); }
void ps() { pr("\n"); } // print w/ spaces
tcTUU> void ps(const T& t, const U&... u) { 
    pr(t); if (sizeof...(u)) pr(" "); ps(u...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
    cerr << ts(t); if (sizeof...(u)) cerr << ", ";
    DBG(u...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
    #define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
    #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
         << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
    #define dbg(...) 0
    #define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

typedef vector<vi> mat;
vpi adj[50010];
int K, N, M, O;

template<class T> struct RangeQuery {
	int n;
	vector<vector<T>> stor;
	T comb (T a, T b) { 
		mat c(K, vi(K, IINF / 2));
		F0R(i, K)
			F0R(j, K)
				F0R(k, K)
					ckmin(c[i][j], a[i][k] + b[k][j]);
		return c; } // associative operation
	void init() {
		n = sz(stor[0]);
		for(int A = 1; (1 << A) <= n; A++){
			stor.pb(vector<T>());
			for(int a = 0; a <= n - (1 << A); a++)
				stor.back().pb(comb(stor[A - 1][a], stor[A - 1][a + (1 << (A - 1))]));
		}
	}
	T query(int l, int r) {
		T ret = mat(K, vi(K, IINF / 2));
		F0R(a, K)
			ret[a][a] = 0;
		R0F(a, sz(stor))
			while(l + (1 << a) <= r + 1){
				ret = comb(ret, stor[a][l]);
				l += (1 << a);
			}
		return ret;
	}
};

int main(){
    setIO();
	cin >> K >> N >> M >> O;
	while(M--){
		int a, b, t;
		cin >> a >> b >> t;
		adj[min(a, b)].eb(max(a, b), t);
	}
	RangeQuery<mat> d;
	d.stor.pb(vector<mat>());
	F0R(a, (N - 1) / K){
		mat A(K, vi(K, IINF / 2));
		FOR(b, a * K, a * K + K)
			trav(c, adj[b])
				A[b % K][c.f % K] = c.s;
		d.stor[0].pb(A);
	}
	d.init();
	while(O--){
		int a, b;
		cin >> a >> b;
		if(a / K == b / K){
			if(a != b)
				cout << -1 << endl;
			else cout << 0 << endl;
		}
		else
			cout << ((d.query(a / K, b / K - 1)[a % K][b % K] == IINF / 2) ? -1 : d.query(a / K, b / K - 1)[a % K][b % K]) << endl;
	}
    // you should actually read the stuff at the bottom
}
 
/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
    * DON'T GET STUCK ON ONE APPROACH
*/

Compilation message

toll.cpp: In function 'void setIn(str)':
toll.cpp:190:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  190 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
toll.cpp: In function 'void setOut(str)':
toll.cpp:191:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  191 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 66720 KB Output is correct
2 Correct 1 ms 1516 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 1 ms 1516 KB Output is correct
5 Correct 8 ms 2412 KB Output is correct
6 Correct 8 ms 2284 KB Output is correct
7 Correct 7 ms 2412 KB Output is correct
8 Correct 281 ms 67872 KB Output is correct
9 Correct 299 ms 67616 KB Output is correct
10 Correct 254 ms 65332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 54320 KB Output is correct
2 Correct 1 ms 1516 KB Output is correct
3 Correct 1 ms 1516 KB Output is correct
4 Correct 1 ms 1516 KB Output is correct
5 Correct 1 ms 1516 KB Output is correct
6 Correct 1 ms 1516 KB Output is correct
7 Correct 39 ms 2412 KB Output is correct
8 Correct 56 ms 2284 KB Output is correct
9 Correct 271 ms 67744 KB Output is correct
10 Correct 295 ms 48804 KB Output is correct
11 Correct 270 ms 55972 KB Output is correct
12 Correct 233 ms 47012 KB Output is correct
13 Correct 194 ms 27756 KB Output is correct
14 Correct 148 ms 28828 KB Output is correct
15 Correct 158 ms 25324 KB Output is correct
16 Correct 159 ms 25324 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1516 KB Output is correct
2 Correct 1 ms 1516 KB Output is correct
3 Correct 2 ms 1516 KB Output is correct
4 Correct 1 ms 1516 KB Output is correct
5 Correct 1 ms 1516 KB Output is correct
6 Correct 4 ms 2412 KB Output is correct
7 Correct 4 ms 2156 KB Output is correct
8 Correct 6 ms 2028 KB Output is correct
9 Correct 7 ms 2028 KB Output is correct
10 Correct 225 ms 67488 KB Output is correct
11 Correct 188 ms 55716 KB Output is correct
12 Correct 194 ms 48676 KB Output is correct
13 Correct 201 ms 49060 KB Output is correct
14 Correct 187 ms 47908 KB Output is correct
15 Correct 116 ms 25196 KB Output is correct
16 Correct 116 ms 25196 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1516 KB Output is correct
2 Correct 1 ms 1516 KB Output is correct
3 Correct 2 ms 1516 KB Output is correct
4 Correct 1 ms 1516 KB Output is correct
5 Correct 1 ms 1516 KB Output is correct
6 Correct 4 ms 2412 KB Output is correct
7 Correct 4 ms 2156 KB Output is correct
8 Correct 6 ms 2028 KB Output is correct
9 Correct 7 ms 2028 KB Output is correct
10 Correct 225 ms 67488 KB Output is correct
11 Correct 188 ms 55716 KB Output is correct
12 Correct 194 ms 48676 KB Output is correct
13 Correct 201 ms 49060 KB Output is correct
14 Correct 187 ms 47908 KB Output is correct
15 Correct 116 ms 25196 KB Output is correct
16 Correct 116 ms 25196 KB Output is correct
17 Correct 214 ms 55844 KB Output is correct
18 Correct 1 ms 1644 KB Output is correct
19 Correct 2 ms 1664 KB Output is correct
20 Correct 1 ms 1516 KB Output is correct
21 Correct 1 ms 1516 KB Output is correct
22 Correct 1 ms 1516 KB Output is correct
23 Correct 15 ms 2412 KB Output is correct
24 Correct 19 ms 2284 KB Output is correct
25 Correct 32 ms 2156 KB Output is correct
26 Correct 28 ms 2156 KB Output is correct
27 Correct 239 ms 67488 KB Output is correct
28 Correct 235 ms 48804 KB Output is correct
29 Correct 233 ms 49188 KB Output is correct
30 Correct 216 ms 48036 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 66720 KB Output is correct
2 Correct 1 ms 1516 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 1 ms 1516 KB Output is correct
5 Correct 8 ms 2412 KB Output is correct
6 Correct 8 ms 2284 KB Output is correct
7 Correct 7 ms 2412 KB Output is correct
8 Correct 281 ms 67872 KB Output is correct
9 Correct 299 ms 67616 KB Output is correct
10 Correct 254 ms 65332 KB Output is correct
11 Correct 253 ms 54320 KB Output is correct
12 Correct 1 ms 1516 KB Output is correct
13 Correct 1 ms 1516 KB Output is correct
14 Correct 1 ms 1516 KB Output is correct
15 Correct 1 ms 1516 KB Output is correct
16 Correct 1 ms 1516 KB Output is correct
17 Correct 39 ms 2412 KB Output is correct
18 Correct 56 ms 2284 KB Output is correct
19 Correct 271 ms 67744 KB Output is correct
20 Correct 295 ms 48804 KB Output is correct
21 Correct 270 ms 55972 KB Output is correct
22 Correct 233 ms 47012 KB Output is correct
23 Correct 194 ms 27756 KB Output is correct
24 Correct 148 ms 28828 KB Output is correct
25 Correct 158 ms 25324 KB Output is correct
26 Correct 159 ms 25324 KB Output is correct
27 Correct 1 ms 1516 KB Output is correct
28 Correct 1 ms 1516 KB Output is correct
29 Correct 2 ms 1516 KB Output is correct
30 Correct 1 ms 1516 KB Output is correct
31 Correct 1 ms 1516 KB Output is correct
32 Correct 4 ms 2412 KB Output is correct
33 Correct 4 ms 2156 KB Output is correct
34 Correct 6 ms 2028 KB Output is correct
35 Correct 7 ms 2028 KB Output is correct
36 Correct 225 ms 67488 KB Output is correct
37 Correct 188 ms 55716 KB Output is correct
38 Correct 194 ms 48676 KB Output is correct
39 Correct 201 ms 49060 KB Output is correct
40 Correct 187 ms 47908 KB Output is correct
41 Correct 116 ms 25196 KB Output is correct
42 Correct 116 ms 25196 KB Output is correct
43 Correct 214 ms 55844 KB Output is correct
44 Correct 1 ms 1644 KB Output is correct
45 Correct 2 ms 1664 KB Output is correct
46 Correct 1 ms 1516 KB Output is correct
47 Correct 1 ms 1516 KB Output is correct
48 Correct 1 ms 1516 KB Output is correct
49 Correct 15 ms 2412 KB Output is correct
50 Correct 19 ms 2284 KB Output is correct
51 Correct 32 ms 2156 KB Output is correct
52 Correct 28 ms 2156 KB Output is correct
53 Correct 239 ms 67488 KB Output is correct
54 Correct 235 ms 48804 KB Output is correct
55 Correct 233 ms 49188 KB Output is correct
56 Correct 216 ms 48036 KB Output is correct
57 Correct 364 ms 48552 KB Output is correct
58 Correct 301 ms 67616 KB Output is correct
59 Correct 274 ms 55972 KB Output is correct