Submission #367860

#	Time	Username	Problem	Language	Result	Execution time	Memory
367860		ACmachine	Toll (BOI17_toll)	C++17	100 / 100	298 ms	15144 KiB

toll

#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 (stderr)

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 / 7
• Subtask 2: 10 / 10
• Subtask 3: 8 / 8
• Subtask 4: 31 / 31
• Subtask 5: 44 / 44