oj.uz

Submission #734461

# Submission time Handle Problem Language Result Execution time Memory
734461 2023-05-02T12:59:51 Z Joshua_Andersson Toll (BOI17_toll) C++14
100 / 100
 165 ms 38140 KB 
#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;

#define enablell 1

typedef long long ll;
typedef unsigned long long ull;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;

#define PBDS 0
#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
uint32_t clz(uint32_t x) { return _lzcnt_u32(x); }
uint32_t ctz(uint32_t x) { return _tzcnt_u32(x); }
#define bswap64(x) _byteswap_uint64(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin_popcount(x)
uint32_t clz(uint32_t x) { return __builtin_clz(x); }
uint32_t ctz(uint32_t x) { return __builtin_ctzll(x); }
#define bswap64(x) __builtin_bswap64(x)
#define gc() getchar_unlocked()
#if PBDS
using namespace __gnu_pbds;
// lower_bound is now upper_bound and vice versa (multiset). generally a bit broken
template<typename T> using indexed_multiset = tree<int, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct chash { // large odd number for C
    const uint64_t C = ll(4e18 * acos(0)) | 71;
    ll operator()(ll x) const { return __builtin_bswap64(x * C); }
};

template<typename T, typename U> using fast_map = __gnu_pbds::gp_hash_table<T, U, chash>;
template<typename T> using fast_set = __gnu_pbds::gp_hash_table<T, null_type, chash>;
template<typename T, typename H> using fast_set_h = __gnu_pbds::gp_hash_table<T, null_type, H>;
#endif

#endif

#define FAST_INPUT 0
#define FILE_TC 0
#if FILE_TC && _LOCAL
ifstream filein("E:\\desktop\\code\\repos\\Comp prog\\x64\\Debug\\in.txt");
//ifstream filein("E:\\downloads\\test_data\\test_data\\005-case05.in");
//ifstream filein("E:\\desktop\\po-repos\\swedish-olympiad-2023\\online\\tomtplanering\\data\\secret\\group10\\010-case10.in");

#define cin filein
//ifstream cin("C:\\Users\\Matis\\desktop\\po-two\\swedish-olympiad-2014\\");
void fast() {}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif

#if FAST_INPUT && !FILE_TC
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
inline void read(int& u, int& v, int& k) { read(u); read(v); read(k); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
template <typename T> inline void write(T a) { cout << (a) << "\n"; }
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if (!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debassert(expr) ;
#define debif(expr) ;
#endif

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)

#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))

#define ceildiv(x,y) ((x + y - 1) / y)

template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }
vector<string> split(string s, string d) { size_t k = 0, n, e = d.length(); string t; vector<string> r; while ((n = s.find(d, k)) != string::npos) { t = s.substr(k, n - k); k = n + e; r.push_back(t); } r.push_back(s.substr(k)); return r; }
ll binpow(ll a, ll b) { ll res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } // For a < 2^31

#if 1
auto Start = chrono::high_resolution_clock::now();
void resettimer() { Start = chrono::high_resolution_clock::now(); }
int elapsedmillis() { return chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count(); }
random_device rd;
mt19937 rng(rd());
template<typename T> inline T randint(T lo, T hi) { return uniform_int_distribution<T>(lo, hi)(rng); } // [lo,hi]
template<typename T> inline T randel(vector<T>& v) { return v[uniform_int_distribution<int>((int)0, v.size() - 1)(rng)]; } // [lo,hi]
#endif
const ll mod = 1e9 + 7;
vp2 dirs = { {0,1},{0,-1},{1,0},{-1,0} };

int dp[50001][17][5];

int32_t main()
{
    fast();

    dread4(int, k, n, m, q);

    rep(i, 50001) rep(j, 17) rep(k, 5) dp[i][j][k] = inf;

    vvp2 edges(n);
    rep(i, m)
    {
        dread3(int, a, b, t);
        dp[a][0][b % k] = t;
        //edges[a].emplace_back(b, t);
    }

    repp(d, 1, 17)
    {
        rep(i, n)
        {
            vi c(k, inf);
            rep(a, k) c[a] = dp[i][d - 1][a];
            rep(a, k)
            {
                rep(b, k)
                {
                    int mid = (i / k) * k + (1 << (d - 1)) * k + a;
                    if (mid >= 50001) continue;
                    dp[i][d][b] = min(dp[i][d][b], c[a] + dp[mid][d - 1][b]);
                }
            }
        }
    }

    while (q--)
    {
        dread2(int, a, b);
        vi c(k, inf);
        c[a % k] = 0;

        int dist = (b / k) - (a / k);
        int curr = a / k;
        if (dist <= 0)
        {
            cout << "-1\n";
            continue;
        }

        per(d, 17)
        {
            if (dist & (1 << d))
            {
                vi newc(k, inf);
                rep(a, k)
                {
                    int u = curr * k + a;
                    rep(b, k)
                    {
                        newc[b] = min(newc[b], dp[u][d][b] + c[a]);
                    }
                }
                c = newc;
                curr += (1 << d);
            }
        }
        if (c[b % k] >= inf) cout << "-1\n";
        else cout << c[b % k] << "\n";
    }

    quit;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 35784 KB Output is correct
2 Correct 14 ms 33588 KB Output is correct
3 Correct 17 ms 33564 KB Output is correct
4 Correct 16 ms 33492 KB Output is correct
5 Correct 20 ms 33636 KB Output is correct
6 Correct 17 ms 33620 KB Output is correct
7 Correct 17 ms 33632 KB Output is correct
8 Correct 65 ms 35664 KB Output is correct
9 Correct 66 ms 35656 KB Output is correct
10 Correct 49 ms 34816 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 36380 KB Output is correct
2 Correct 18 ms 33504 KB Output is correct
3 Correct 14 ms 33524 KB Output is correct
4 Correct 14 ms 33492 KB Output is correct
5 Correct 17 ms 33672 KB Output is correct
6 Correct 16 ms 33548 KB Output is correct
7 Correct 20 ms 33620 KB Output is correct
8 Correct 22 ms 33712 KB Output is correct
9 Correct 64 ms 35620 KB Output is correct
10 Correct 129 ms 37072 KB Output is correct
11 Correct 103 ms 36588 KB Output is correct
12 Correct 97 ms 36040 KB Output is correct
13 Correct 121 ms 36720 KB Output is correct
14 Correct 71 ms 35692 KB Output is correct
15 Correct 88 ms 35568 KB Output is correct
16 Correct 90 ms 35532 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 33512 KB Output is correct
2 Correct 17 ms 33492 KB Output is correct
3 Correct 15 ms 33492 KB Output is correct
4 Correct 16 ms 33492 KB Output is correct
5 Correct 15 ms 33492 KB Output is correct
6 Correct 17 ms 33560 KB Output is correct
7 Correct 19 ms 33520 KB Output is correct
8 Correct 22 ms 33668 KB Output is correct
9 Correct 20 ms 33672 KB Output is correct
10 Correct 54 ms 35468 KB Output is correct
11 Correct 104 ms 36304 KB Output is correct
12 Correct 126 ms 36936 KB Output is correct
13 Correct 145 ms 37188 KB Output is correct
14 Correct 113 ms 36552 KB Output is correct
15 Correct 87 ms 35484 KB Output is correct
16 Correct 88 ms 35440 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 33512 KB Output is correct
2 Correct 17 ms 33492 KB Output is correct
3 Correct 15 ms 33492 KB Output is correct
4 Correct 16 ms 33492 KB Output is correct
5 Correct 15 ms 33492 KB Output is correct
6 Correct 17 ms 33560 KB Output is correct
7 Correct 19 ms 33520 KB Output is correct
8 Correct 22 ms 33668 KB Output is correct
9 Correct 20 ms 33672 KB Output is correct
10 Correct 54 ms 35468 KB Output is correct
11 Correct 104 ms 36304 KB Output is correct
12 Correct 126 ms 36936 KB Output is correct
13 Correct 145 ms 37188 KB Output is correct
14 Correct 113 ms 36552 KB Output is correct
15 Correct 87 ms 35484 KB Output is correct
16 Correct 88 ms 35440 KB Output is correct
17 Correct 126 ms 36304 KB Output is correct
18 Correct 15 ms 33588 KB Output is correct
19 Correct 14 ms 33480 KB Output is correct
20 Correct 15 ms 33492 KB Output is correct
21 Correct 15 ms 33492 KB Output is correct
22 Correct 16 ms 33492 KB Output is correct
23 Correct 23 ms 33620 KB Output is correct
24 Correct 18 ms 33612 KB Output is correct
25 Correct 19 ms 33696 KB Output is correct
26 Correct 22 ms 33652 KB Output is correct
27 Correct 63 ms 35556 KB Output is correct
28 Correct 129 ms 36984 KB Output is correct
29 Correct 153 ms 37188 KB Output is correct
30 Correct 116 ms 36628 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 35784 KB Output is correct
2 Correct 14 ms 33588 KB Output is correct
3 Correct 17 ms 33564 KB Output is correct
4 Correct 16 ms 33492 KB Output is correct
5 Correct 20 ms 33636 KB Output is correct
6 Correct 17 ms 33620 KB Output is correct
7 Correct 17 ms 33632 KB Output is correct
8 Correct 65 ms 35664 KB Output is correct
9 Correct 66 ms 35656 KB Output is correct
10 Correct 49 ms 34816 KB Output is correct
11 Correct 101 ms 36380 KB Output is correct
12 Correct 18 ms 33504 KB Output is correct
13 Correct 14 ms 33524 KB Output is correct
14 Correct 14 ms 33492 KB Output is correct
15 Correct 17 ms 33672 KB Output is correct
16 Correct 16 ms 33548 KB Output is correct
17 Correct 20 ms 33620 KB Output is correct
18 Correct 22 ms 33712 KB Output is correct
19 Correct 64 ms 35620 KB Output is correct
20 Correct 129 ms 37072 KB Output is correct
21 Correct 103 ms 36588 KB Output is correct
22 Correct 97 ms 36040 KB Output is correct
23 Correct 121 ms 36720 KB Output is correct
24 Correct 71 ms 35692 KB Output is correct
25 Correct 88 ms 35568 KB Output is correct
26 Correct 90 ms 35532 KB Output is correct
27 Correct 16 ms 33512 KB Output is correct
28 Correct 17 ms 33492 KB Output is correct
29 Correct 15 ms 33492 KB Output is correct
30 Correct 16 ms 33492 KB Output is correct
31 Correct 15 ms 33492 KB Output is correct
32 Correct 17 ms 33560 KB Output is correct
33 Correct 19 ms 33520 KB Output is correct
34 Correct 22 ms 33668 KB Output is correct
35 Correct 20 ms 33672 KB Output is correct
36 Correct 54 ms 35468 KB Output is correct
37 Correct 104 ms 36304 KB Output is correct
38 Correct 126 ms 36936 KB Output is correct
39 Correct 145 ms 37188 KB Output is correct
40 Correct 113 ms 36552 KB Output is correct
41 Correct 87 ms 35484 KB Output is correct
42 Correct 88 ms 35440 KB Output is correct
43 Correct 126 ms 36304 KB Output is correct
44 Correct 15 ms 33588 KB Output is correct
45 Correct 14 ms 33480 KB Output is correct
46 Correct 15 ms 33492 KB Output is correct
47 Correct 15 ms 33492 KB Output is correct
48 Correct 16 ms 33492 KB Output is correct
49 Correct 23 ms 33620 KB Output is correct
50 Correct 18 ms 33612 KB Output is correct
51 Correct 19 ms 33696 KB Output is correct
52 Correct 22 ms 33652 KB Output is correct
53 Correct 63 ms 35556 KB Output is correct
54 Correct 129 ms 36984 KB Output is correct
55 Correct 153 ms 37188 KB Output is correct
56 Correct 116 ms 36628 KB Output is correct
57 Correct 165 ms 38140 KB Output is correct
58 Correct 66 ms 35688 KB Output is correct
59 Correct 116 ms 36544 KB Output is correct