oj.uz

답안 #697993

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
697993 2023-02-11T17:56:27 Z bLIC Toll (BOI17_toll) C++17
100 / 100
 143 ms 25536 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 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 INFLL = 1e18+5;
const int INF = 1e9;
// const int maxK = 18;

void printbit(int x, int len) {string s="\n";while(len--){s=((x%2)?'1':'0')+s;x/=2;} cout<<s;}

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;
}



void solve(){
    int k, n, m, o;
    cin>>k>>n>>m>>o;
    const int maxN = (n+1)/k + 5;
    const int maxK = log2(maxN) + 1;

    ll dp[maxN][k][k][maxK];
    memset(dp, 63, sizeof(dp));
    for (int i = 0;i<m;i++){
        int u, v, w;
        cin>>u>>v>>w;
        dp[u/k][u%k][v%k][0] = w;
    }
    for (int j = 1;j<=maxK;j++){
        for (int i = 0;i<(n+k-1)/k;i++){
            for (int r1 = 0;r1<k;r1++){
                for (int r2 = 0;r2<k;r2++){
                    for (int m = 0;m<k;m++){
                        if (i+(1<<(j-1))>=maxN) continue;
                        dp[i][r1][r2][j] = min(dp[i][r1][r2][j], dp[i][r1][m][j-1] + dp[i+(1<<(j-1))][m][r2][j-1]);
                    }
                }
            }
        }
    }
    
    while(o--){
        int a, b;cin>>a>>b;
        int from = a/k;
        int fr = a%k;
        int to = b/k;
        int tr = b%k;
        // int ans = INFLL;
        int up = to - from;
        ll ans[k]{};
        memset(ans, 63, sizeof(ans));
        ans[fr] = 0;
        for (int i = 0;i<maxK;i++){
            if (up>>i&1){
                ll tmp[k]{};
                memset(tmp, 63, sizeof(tmp));
                for (int ii = 0;ii<k;ii++){
                    for (int j = 0;j<k;j++){
                        tmp[ii] = min(tmp[ii], ans[j]+dp[from][j][ii][i]);
                    }
                }
                for (int ii = 0;ii<k;ii++) ans[ii] = tmp[ii];
                from += (1<<i);
            }
        }
        if (ans[tr]==4557430888798830399ll) ans[tr] = -1;
        cout<<ans[tr]<<'\n';
    }
}

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

// #define _DEBUG
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.out", "w", stdout);
    int tt = clock();
#endif
    int t=1, i = 1;
    // cin>>t;
    while(t--){
        // cout<<"Case #"<<i++<<": ";
        solve();
        cout<<'\n';
    }
#ifdef _DEBUG
    cerr << "TIME = " << (float)(clock() - tt)/CLOCKS_PER_SEC << endl;
    tt = clock();
#endif
}

Compilation message

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

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 7500 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 268 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 41 ms 7500 KB Output is correct
9 Correct 29 ms 7380 KB Output is correct
10 Correct 16 ms 6728 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 13648 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 4 ms 456 KB Output is correct
8 Correct 5 ms 596 KB Output is correct
9 Correct 29 ms 7444 KB Output is correct
10 Correct 90 ms 20172 KB Output is correct
11 Correct 68 ms 13704 KB Output is correct
12 Correct 80 ms 19276 KB Output is correct
13 Correct 102 ms 17864 KB Output is correct
14 Correct 69 ms 11612 KB Output is correct
15 Correct 75 ms 16720 KB Output is correct
16 Correct 74 ms 16780 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 28 ms 7360 KB Output is correct
11 Correct 61 ms 13640 KB Output is correct
12 Correct 85 ms 20016 KB Output is correct
13 Correct 90 ms 20280 KB Output is correct
14 Correct 74 ms 19696 KB Output is correct
15 Correct 75 ms 16712 KB Output is correct
16 Correct 76 ms 16704 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 28 ms 7360 KB Output is correct
11 Correct 61 ms 13640 KB Output is correct
12 Correct 85 ms 20016 KB Output is correct
13 Correct 90 ms 20280 KB Output is correct
14 Correct 74 ms 19696 KB Output is correct
15 Correct 75 ms 16712 KB Output is correct
16 Correct 76 ms 16704 KB Output is correct
17 Correct 62 ms 13572 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 4 ms 716 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 31 ms 7332 KB Output is correct
28 Correct 90 ms 20120 KB Output is correct
29 Correct 99 ms 20360 KB Output is correct
30 Correct 78 ms 19700 KB Output is correct

Subtask #5
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 7500 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 268 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 41 ms 7500 KB Output is correct
9 Correct 29 ms 7380 KB Output is correct
10 Correct 16 ms 6728 KB Output is correct
11 Correct 63 ms 13648 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 4 ms 456 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 29 ms 7444 KB Output is correct
20 Correct 90 ms 20172 KB Output is correct
21 Correct 68 ms 13704 KB Output is correct
22 Correct 80 ms 19276 KB Output is correct
23 Correct 102 ms 17864 KB Output is correct
24 Correct 69 ms 11612 KB Output is correct
25 Correct 75 ms 16720 KB Output is correct
26 Correct 74 ms 16780 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 320 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 588 KB Output is correct
36 Correct 28 ms 7360 KB Output is correct
37 Correct 61 ms 13640 KB Output is correct
38 Correct 85 ms 20016 KB Output is correct
39 Correct 90 ms 20280 KB Output is correct
40 Correct 74 ms 19696 KB Output is correct
41 Correct 75 ms 16712 KB Output is correct
42 Correct 76 ms 16704 KB Output is correct
43 Correct 62 ms 13572 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 324 KB Output is correct
46 Correct 1 ms 320 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 2 ms 340 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 4 ms 716 KB Output is correct
52 Correct 2 ms 596 KB Output is correct
53 Correct 31 ms 7332 KB Output is correct
54 Correct 90 ms 20120 KB Output is correct
55 Correct 99 ms 20360 KB Output is correct
56 Correct 78 ms 19700 KB Output is correct
57 Correct 143 ms 25536 KB Output is correct
58 Correct 29 ms 7500 KB Output is correct
59 Correct 71 ms 13832 KB Output is correct