oj.uz

Submission #367860

# Submission time Handle Problem Language Result Execution time Memory
367860 2021-02-18T14:37:57 Z ACmachine Toll (BOI17_toll) C++17
100 / 100
 298 ms 15144 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
    int k, n, m, o;
    cin >> k >> n >> m >> o;
	vector<vector<array<int, 2>>> g(n);
    vector<vector<array<int, 2>>> tg(n);
    REP(i, m){
        int a, b, t;
        cin >> a >> b >> t;
        g[a].pb({b, t});
        tg[b].pb({a, t});
    }
    struct query{
        int a, b, id;
    };
    vector<query> queries(o);
    REP(i, o){
        int a, b;
        cin >> a >> b;
        queries[i] = {a, b, i};
    }
    vector<int> ans(o, INF);
    vector<vector<int>> dist_l(2 * k, vector<int>(n));
    vector<vector<int>> dist_r(2 * k, vector<int>(n));
    function<void(int, int, vector<query>)> divide_and_conquer = [&](int l, int r, vector<query> todo){
        if(l >= r) return;
        int mid = (l + r) >> 1;
        REP(i, 2 * k){
            FOR(j, l, mid, 1) 
                dist_l[i][j] = INF;
            FOR(j, mid, r, 1) 
                dist_r[i][j] = INF;
        }
        REP(i, 2 * k){
            if(mid - 1 - i < l) break;
            dist_l[i][mid - 1 - i] = 0;
            FORD(j, mid - 1 - i, l, 1){
                for(auto x : tg[j]){
                    if(x[0] < l) continue;
                    dist_l[i][x[0]] = min(dist_l[i][x[0]], dist_l[i][j] + x[1]);
                }
            }
        }
        REP(i, 2 * k){
            if(mid + i >= r) break;
            dist_r[i][mid + i] = 0;
            FOR(j, mid + i, r, 1){
                for(auto x : g[j]){
                    if(x[0] >= r) continue;
                    dist_r[i][x[0]] = min(dist_r[i][x[0]], dist_r[i][j] + x[1]);
                }
            }
        }
        vector<query> todo_left;
        vector<query> todo_right;
        REP(i, todo.size()){
            query q = todo[i];
            if(q.a < mid && q.b >= mid){
                REP(j, 2 * k){
                    REP(u, 2 * k){
                        if(mid - 1 - j < q.a || mid + u > q.b) continue;
                        for(auto x : g[mid - 1 - j]){
                            if(x[0] == mid + u){
                                ans[q.id] = min(ans[q.id], dist_l[j][q.a] + dist_r[u][q.b] + x[1]);
                            }
                        } 
                    }
                }
            }
            else{
                if(q.b < mid)
                    todo_left.pb(q);
                else
                    todo_right.pb(q);
            }
        }
        if(l + 1 == r) return;
        divide_and_conquer(l, mid, todo_left);
        divide_and_conquer(mid, r, todo_right);
    };
    divide_and_conquer(0, n, queries);
    REP(i, o){
        if(ans[i] >= INF){
            cout << -1 << "\n";
        }
        else{
            cout << ans[i] << "\n";
        }
    }
    return 0;
}

Compilation message

toll.cpp: In lambda function:
toll.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<main()::query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
toll.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
toll.cpp:141:9: note: in expansion of macro 'REP'
  141 |         REP(i, todo.size()){
      |         ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 8028 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 68 ms 7976 KB Output is correct
9 Correct 60 ms 7848 KB Output is correct
10 Correct 14 ms 4136 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 9768 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 4 ms 1132 KB Output is correct
8 Correct 5 ms 1132 KB Output is correct
9 Correct 71 ms 8096 KB Output is correct
10 Correct 215 ms 12840 KB Output is correct
11 Correct 120 ms 9768 KB Output is correct
12 Correct 125 ms 9768 KB Output is correct
13 Correct 209 ms 12012 KB Output is correct
14 Correct 109 ms 8172 KB Output is correct
15 Correct 142 ms 8172 KB Output is correct
16 Correct 124 ms 8156 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 4 ms 748 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 58 ms 7592 KB Output is correct
11 Correct 116 ms 9128 KB Output is correct
12 Correct 208 ms 12328 KB Output is correct
13 Correct 209 ms 13116 KB Output is correct
14 Correct 163 ms 11304 KB Output is correct
15 Correct 117 ms 8044 KB Output is correct
16 Correct 122 ms 8044 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 4 ms 748 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 58 ms 7592 KB Output is correct
11 Correct 116 ms 9128 KB Output is correct
12 Correct 208 ms 12328 KB Output is correct
13 Correct 209 ms 13116 KB Output is correct
14 Correct 163 ms 11304 KB Output is correct
15 Correct 117 ms 8044 KB Output is correct
16 Correct 122 ms 8044 KB Output is correct
17 Correct 119 ms 9256 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 2 ms 620 KB Output is correct
24 Correct 3 ms 748 KB Output is correct
25 Correct 7 ms 876 KB Output is correct
26 Correct 7 ms 748 KB Output is correct
27 Correct 58 ms 7720 KB Output is correct
28 Correct 192 ms 12480 KB Output is correct
29 Correct 235 ms 13224 KB Output is correct
30 Correct 178 ms 11304 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 8028 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 68 ms 7976 KB Output is correct
9 Correct 60 ms 7848 KB Output is correct
10 Correct 14 ms 4136 KB Output is correct
11 Correct 128 ms 9768 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 4 ms 1132 KB Output is correct
18 Correct 5 ms 1132 KB Output is correct
19 Correct 71 ms 8096 KB Output is correct
20 Correct 215 ms 12840 KB Output is correct
21 Correct 120 ms 9768 KB Output is correct
22 Correct 125 ms 9768 KB Output is correct
23 Correct 209 ms 12012 KB Output is correct
24 Correct 109 ms 8172 KB Output is correct
25 Correct 142 ms 8172 KB Output is correct
26 Correct 124 ms 8156 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 4 ms 748 KB Output is correct
35 Correct 3 ms 620 KB Output is correct
36 Correct 58 ms 7592 KB Output is correct
37 Correct 116 ms 9128 KB Output is correct
38 Correct 208 ms 12328 KB Output is correct
39 Correct 209 ms 13116 KB Output is correct
40 Correct 163 ms 11304 KB Output is correct
41 Correct 117 ms 8044 KB Output is correct
42 Correct 122 ms 8044 KB Output is correct
43 Correct 119 ms 9256 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 2 ms 620 KB Output is correct
50 Correct 3 ms 748 KB Output is correct
51 Correct 7 ms 876 KB Output is correct
52 Correct 7 ms 748 KB Output is correct
53 Correct 58 ms 7720 KB Output is correct
54 Correct 192 ms 12480 KB Output is correct
55 Correct 235 ms 13224 KB Output is correct
56 Correct 178 ms 11304 KB Output is correct
57 Correct 298 ms 15144 KB Output is correct
58 Correct 87 ms 8104 KB Output is correct
59 Correct 142 ms 9640 KB Output is correct