oj.uz

Submission #547661

# Submission time Handle Problem Language Result Execution time Memory
547661 2022-04-11T08:37:02 Z Soul234 Toll (BOI17_toll) C++14
100 / 100
 141 ms 86896 KB 
#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#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 each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

const int MOD = 1e9 + 7;
tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a = b, 1 : 0;
}
constexpr int p2(int x) { return 1<<x;}
const int MX = 50000, LG = 17;
int K, N, M, O;
int dp[MX][LG][5][5];
int ans[5][5], tmp[5][5];

void comb(int mn[5][5], int a[5][5], int b[5][5]) {
    F0R(x,K) F0R(y,K) F0R(z,K) ckmin(mn[x][y], a[x][z] + b[z][y]);
}

void solve() {
    cin>>K>>N>>M>>O;
    memset(dp, 0x3f, sizeof dp);
    F0R(i,M) {
        int a, b, t;
        cin>>a>>b>>t;
        dp[a/K][0][a%K][b%K] = t;
    }
    FOR(j,1,LG) for(int i = 0; i+p2(j)<(N+K-1)/K; i++) comb(dp[i][j], dp[i][j-1], dp[i+p2(j-1)][j-1]);
    while(O-->0) {
        int a, b;
        cin>>a>>b;
        memset(ans, 0x3f, sizeof ans);
        F0R(i,5) ans[i][i] = 0;
        int cur = a/K, dst = b/K;
        R0F(i,LG) if(cur + p2(i) <= dst) {
            memset(tmp, 0x3f, sizeof tmp);
            comb(tmp, ans, dp[cur][i]);
            memcpy(ans, tmp, sizeof ans);
            cur += p2(i);
        }
        cout << (ans[a%K][b%K] < MOD ? ans[a%K][b%K] : -1) << nl;
    }
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

toll.cpp: In function 'void setIO(std::string)':
toll.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 84428 KB Output is correct
2 Correct 34 ms 83420 KB Output is correct
3 Correct 30 ms 83404 KB Output is correct
4 Correct 33 ms 83460 KB Output is correct
5 Correct 33 ms 83524 KB Output is correct
6 Correct 33 ms 83428 KB Output is correct
7 Correct 32 ms 83404 KB Output is correct
8 Correct 69 ms 84352 KB Output is correct
9 Correct 68 ms 84344 KB Output is correct
10 Correct 49 ms 83532 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 85132 KB Output is correct
2 Correct 34 ms 83412 KB Output is correct
3 Correct 39 ms 83392 KB Output is correct
4 Correct 32 ms 83392 KB Output is correct
5 Correct 32 ms 83396 KB Output is correct
6 Correct 32 ms 83436 KB Output is correct
7 Correct 36 ms 83456 KB Output is correct
8 Correct 44 ms 83616 KB Output is correct
9 Correct 72 ms 84388 KB Output is correct
10 Correct 111 ms 85708 KB Output is correct
11 Correct 87 ms 85132 KB Output is correct
12 Correct 87 ms 84732 KB Output is correct
13 Correct 104 ms 85760 KB Output is correct
14 Correct 78 ms 84916 KB Output is correct
15 Correct 78 ms 84692 KB Output is correct
16 Correct 77 ms 84604 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 83364 KB Output is correct
2 Correct 31 ms 83372 KB Output is correct
3 Correct 31 ms 83412 KB Output is correct
4 Correct 30 ms 83356 KB Output is correct
5 Correct 32 ms 83452 KB Output is correct
6 Correct 33 ms 83464 KB Output is correct
7 Correct 32 ms 83416 KB Output is correct
8 Correct 33 ms 83528 KB Output is correct
9 Correct 32 ms 83536 KB Output is correct
10 Correct 61 ms 84224 KB Output is correct
11 Correct 81 ms 84988 KB Output is correct
12 Correct 99 ms 85640 KB Output is correct
13 Correct 102 ms 85864 KB Output is correct
14 Correct 90 ms 85284 KB Output is correct
15 Correct 76 ms 84604 KB Output is correct
16 Correct 73 ms 84544 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 83364 KB Output is correct
2 Correct 31 ms 83372 KB Output is correct
3 Correct 31 ms 83412 KB Output is correct
4 Correct 30 ms 83356 KB Output is correct
5 Correct 32 ms 83452 KB Output is correct
6 Correct 33 ms 83464 KB Output is correct
7 Correct 32 ms 83416 KB Output is correct
8 Correct 33 ms 83528 KB Output is correct
9 Correct 32 ms 83536 KB Output is correct
10 Correct 61 ms 84224 KB Output is correct
11 Correct 81 ms 84988 KB Output is correct
12 Correct 99 ms 85640 KB Output is correct
13 Correct 102 ms 85864 KB Output is correct
14 Correct 90 ms 85284 KB Output is correct
15 Correct 76 ms 84604 KB Output is correct
16 Correct 73 ms 84544 KB Output is correct
17 Correct 85 ms 85056 KB Output is correct
18 Correct 33 ms 83400 KB Output is correct
19 Correct 31 ms 83384 KB Output is correct
20 Correct 32 ms 83392 KB Output is correct
21 Correct 32 ms 83360 KB Output is correct
22 Correct 33 ms 83356 KB Output is correct
23 Correct 33 ms 83404 KB Output is correct
24 Correct 35 ms 83428 KB Output is correct
25 Correct 39 ms 83552 KB Output is correct
26 Correct 38 ms 83532 KB Output is correct
27 Correct 67 ms 84368 KB Output is correct
28 Correct 100 ms 85628 KB Output is correct
29 Correct 103 ms 85916 KB Output is correct
30 Correct 93 ms 85308 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 84428 KB Output is correct
2 Correct 34 ms 83420 KB Output is correct
3 Correct 30 ms 83404 KB Output is correct
4 Correct 33 ms 83460 KB Output is correct
5 Correct 33 ms 83524 KB Output is correct
6 Correct 33 ms 83428 KB Output is correct
7 Correct 32 ms 83404 KB Output is correct
8 Correct 69 ms 84352 KB Output is correct
9 Correct 68 ms 84344 KB Output is correct
10 Correct 49 ms 83532 KB Output is correct
11 Correct 95 ms 85132 KB Output is correct
12 Correct 34 ms 83412 KB Output is correct
13 Correct 39 ms 83392 KB Output is correct
14 Correct 32 ms 83392 KB Output is correct
15 Correct 32 ms 83396 KB Output is correct
16 Correct 32 ms 83436 KB Output is correct
17 Correct 36 ms 83456 KB Output is correct
18 Correct 44 ms 83616 KB Output is correct
19 Correct 72 ms 84388 KB Output is correct
20 Correct 111 ms 85708 KB Output is correct
21 Correct 87 ms 85132 KB Output is correct
22 Correct 87 ms 84732 KB Output is correct
23 Correct 104 ms 85760 KB Output is correct
24 Correct 78 ms 84916 KB Output is correct
25 Correct 78 ms 84692 KB Output is correct
26 Correct 77 ms 84604 KB Output is correct
27 Correct 31 ms 83364 KB Output is correct
28 Correct 31 ms 83372 KB Output is correct
29 Correct 31 ms 83412 KB Output is correct
30 Correct 30 ms 83356 KB Output is correct
31 Correct 32 ms 83452 KB Output is correct
32 Correct 33 ms 83464 KB Output is correct
33 Correct 32 ms 83416 KB Output is correct
34 Correct 33 ms 83528 KB Output is correct
35 Correct 32 ms 83536 KB Output is correct
36 Correct 61 ms 84224 KB Output is correct
37 Correct 81 ms 84988 KB Output is correct
38 Correct 99 ms 85640 KB Output is correct
39 Correct 102 ms 85864 KB Output is correct
40 Correct 90 ms 85284 KB Output is correct
41 Correct 76 ms 84604 KB Output is correct
42 Correct 73 ms 84544 KB Output is correct
43 Correct 85 ms 85056 KB Output is correct
44 Correct 33 ms 83400 KB Output is correct
45 Correct 31 ms 83384 KB Output is correct
46 Correct 32 ms 83392 KB Output is correct
47 Correct 32 ms 83360 KB Output is correct
48 Correct 33 ms 83356 KB Output is correct
49 Correct 33 ms 83404 KB Output is correct
50 Correct 35 ms 83428 KB Output is correct
51 Correct 39 ms 83552 KB Output is correct
52 Correct 38 ms 83532 KB Output is correct
53 Correct 67 ms 84368 KB Output is correct
54 Correct 100 ms 85628 KB Output is correct
55 Correct 103 ms 85916 KB Output is correct
56 Correct 93 ms 85308 KB Output is correct
57 Correct 141 ms 86896 KB Output is correct
58 Correct 71 ms 84388 KB Output is correct
59 Correct 91 ms 85188 KB Output is correct