oj.uz

Submission #720286

# Submission time Handle Problem Language Result Execution time Memory
720286 2023-04-07T20:04:10 Z bLIC Toll (BOI17_toll) C++17
100 / 100
 428 ms 117808 KB 
/**
 *  Author: Anil Byar
**/

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>

// using namespace __gnu_pbds;
using namespace std;

// template<class T>
// using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define uniq(v) v.erase(unique(all(v)), v.end())
#define ft first
#define sd second
#define pb push_back

// Source: https://codeforces.com/blog/entry/68809
// { start
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// } end


typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vl> vvl;

#define dbg if(0)

const ll MOD = 1e9+7;
const ll MOD9 = 998244353;
const ll INFLL = 1e18+5;
const int INF = 1e9;

void printbit(int x, int len) {string s="\n";while(len--){s=((x%2)?'1':'0')+s;x/=2;} cout<<s;}
ll power(ll x, ll y, ll mod){if (y==0) return 1;ll ret = power(x, y/2, mod);ret *= ret;ret%=mod;if (y&1) ret *= x;return ret%mod;}
ll modinv(ll x, ll mod = MOD) {return power(x, mod-2, mod);}

template<class T>
istream& operator>>(istream&in, vector<T>&v){
    for (T& x:v) in>>x;
    return in;
}
template<class T>
ostream& operator<<(ostream&out, vector<T>&v){
    for (T& x:v) out<<x<<' ';
    cout<<'\n';
    return out;
}
// use ?: with brackets (?:)
// check for overflow
// think about dp
// Read the statement carefully

const int maxN = 1e5+5;;
const int maxK = 8001;

template<class T>
class Div_Con{
    vector<vector<T>> table;
    vector<T> a;
    T id;
    int n;
    public:
    void init(vector<T> _a, T _id){
        n = 1;while((1<<n)<(int)_a.size()) n++;
        id = _id;a = _a;a.resize(1<<n, id);
        table.resize(1<<n, vector<T>(n, id));
        build(0, (1<<n), n-1);
    }
    void build(int l, int r, int lvl){
        if (lvl<0) return;
        int mid = (l+r)/2;
        
        table[mid-1][lvl] = a[mid-1];
        table[mid][lvl] = a[mid];
        for (int i = mid-2;i>=l;i--) table[i][lvl] = comb(a[i], table[i+1][lvl]);
        for (int i = mid+1;i<r;i++) table[i][lvl] = comb(table[i-1][lvl], a[i]);

        build(l, mid, lvl-1);
        build(mid, r, lvl-1);
    }
    T comb(T x, T y) {return x+y;} // replace with any associative operation
    T query(int l, int r){
        if (l==r) return a[l];
        int lvl = 31 - __builtin_clz(l^r);
        assert(r>l);
        // debug(table[l][lvl]);
        return comb(table[l][lvl], table[r][lvl]);
    }
};

struct Node{
    vvl cost;
    int K;
    Node(){}
    Node(int k){
        cost.assign(k, vl(k, INFLL));
        K = k;
        for (int i = 0;i<K;i++){
            for (int j = 0;j<K;j++) cost[i][j] = INFLL;
        }
    }
    friend Node operator+(Node& a, Node& b){
        Node tmp(a.K);
        for (int i = 0;i<a.K;i++){
            for (int j = 0;j<a.K;j++){
                for (int l = 0;l<a.K;l++) tmp.cost[i][j] = min(tmp.cost[i][j], a.cost[i][l]+b.cost[l][j]);
            }
        }
        return tmp;
    }
};

void solve(){
    int k, n, m, o;
    cin>>k>>n>>m>>o;
    Div_Con<Node> divc;
    vector<Node> nodes(n/k+2, Node(k));
    for (int i = 0;i<m;i++){
        int a, b, t;cin>>a>>b>>t;
        assert(a/k<=n/k+1);
        assert(k);
        nodes[a/k].cost[a%k][b%k] = t;
    }
    divc.init(nodes, Node(k));
    // for (int i = 0;)
    while(o--){
        int l, r;
        cin>>l>>r;
        if (l/k>=r/k){
            cout<<-1<<'\n';
            continue;
        }
        ll ans = divc.query(l/k, r/k-1).cost[l%k][r%k];
        if (ans==INFLL) ans = -1;
        cout<<ans<<'\n';
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

// #ifndef ONLINE_JUDGE
//     freopen("input.in", "r", stdin);
//     freopen("output.out", "w", stdout);
//     freopen("debug.dbg", "w", stderr);
//     int tt = clock();
// #endif

    int t=1, i = 1;
    // cin>>t;
    while(t--){
        // cout<<"Case #"<<i++<<": ";
        solve();
        cout<<'\n';
    }
// #ifndef ONLINE_JUDGE
//     cerr << "TIME = " << (float)(clock() - tt)/CLOCKS_PER_SEC << endl;
//     tt = clock();
// #endif
}

Compilation message

toll.cpp: In function 'int main()':
toll.cpp:192:14: warning: unused variable 'i' [-Wunused-variable]
  192 |     int t=1, i = 1;
      |              ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 428 ms 117056 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 4 ms 1492 KB Output is correct
6 Correct 4 ms 1492 KB Output is correct
7 Correct 3 ms 1620 KB Output is correct
8 Correct 411 ms 116868 KB Output is correct
9 Correct 426 ms 116828 KB Output is correct
10 Correct 405 ms 116844 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 380 ms 91436 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 320 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 10 ms 1700 KB Output is correct
8 Correct 7 ms 1364 KB Output is correct
9 Correct 398 ms 117808 KB Output is correct
10 Correct 422 ms 117452 KB Output is correct
11 Correct 358 ms 93196 KB Output is correct
12 Correct 384 ms 116456 KB Output is correct
13 Correct 177 ms 52496 KB Output is correct
14 Correct 202 ms 56428 KB Output is correct
15 Correct 168 ms 51444 KB Output is correct
16 Correct 165 ms 51368 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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 4 ms 1620 KB Output is correct
7 Correct 3 ms 1236 KB Output is correct
8 Correct 4 ms 1364 KB Output is correct
9 Correct 3 ms 1236 KB Output is correct
10 Correct 402 ms 117736 KB Output is correct
11 Correct 366 ms 92944 KB Output is correct
12 Correct 406 ms 117344 KB Output is correct
13 Correct 414 ms 117504 KB Output is correct
14 Correct 393 ms 116908 KB Output is correct
15 Correct 159 ms 51364 KB Output is correct
16 Correct 157 ms 51324 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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 4 ms 1620 KB Output is correct
7 Correct 3 ms 1236 KB Output is correct
8 Correct 4 ms 1364 KB Output is correct
9 Correct 3 ms 1236 KB Output is correct
10 Correct 402 ms 117736 KB Output is correct
11 Correct 366 ms 92944 KB Output is correct
12 Correct 406 ms 117344 KB Output is correct
13 Correct 414 ms 117504 KB Output is correct
14 Correct 393 ms 116908 KB Output is correct
15 Correct 159 ms 51364 KB Output is correct
16 Correct 157 ms 51324 KB Output is correct
17 Correct 372 ms 93024 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 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 1620 KB Output is correct
24 Correct 5 ms 1344 KB Output is correct
25 Correct 6 ms 1484 KB Output is correct
26 Correct 6 ms 1236 KB Output is correct
27 Correct 408 ms 117780 KB Output is correct
28 Correct 403 ms 117380 KB Output is correct
29 Correct 401 ms 117536 KB Output is correct
30 Correct 402 ms 117056 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 428 ms 117056 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 4 ms 1492 KB Output is correct
6 Correct 4 ms 1492 KB Output is correct
7 Correct 3 ms 1620 KB Output is correct
8 Correct 411 ms 116868 KB Output is correct
9 Correct 426 ms 116828 KB Output is correct
10 Correct 405 ms 116844 KB Output is correct
11 Correct 380 ms 91436 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 10 ms 1700 KB Output is correct
18 Correct 7 ms 1364 KB Output is correct
19 Correct 398 ms 117808 KB Output is correct
20 Correct 422 ms 117452 KB Output is correct
21 Correct 358 ms 93196 KB Output is correct
22 Correct 384 ms 116456 KB Output is correct
23 Correct 177 ms 52496 KB Output is correct
24 Correct 202 ms 56428 KB Output is correct
25 Correct 168 ms 51444 KB Output is correct
26 Correct 165 ms 51368 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 4 ms 1620 KB Output is correct
33 Correct 3 ms 1236 KB Output is correct
34 Correct 4 ms 1364 KB Output is correct
35 Correct 3 ms 1236 KB Output is correct
36 Correct 402 ms 117736 KB Output is correct
37 Correct 366 ms 92944 KB Output is correct
38 Correct 406 ms 117344 KB Output is correct
39 Correct 414 ms 117504 KB Output is correct
40 Correct 393 ms 116908 KB Output is correct
41 Correct 159 ms 51364 KB Output is correct
42 Correct 157 ms 51324 KB Output is correct
43 Correct 372 ms 93024 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 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 1620 KB Output is correct
50 Correct 5 ms 1344 KB Output is correct
51 Correct 6 ms 1484 KB Output is correct
52 Correct 6 ms 1236 KB Output is correct
53 Correct 408 ms 117780 KB Output is correct
54 Correct 403 ms 117380 KB Output is correct
55 Correct 401 ms 117536 KB Output is correct
56 Correct 402 ms 117056 KB Output is correct
57 Correct 368 ms 93284 KB Output is correct
58 Correct 418 ms 117808 KB Output is correct
59 Correct 364 ms 93164 KB Output is correct