답안 #336149

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
336149	2020-12-14T22:09:27 Z	12tqian	Toll (BOI17_toll)	C++17	100 / 100	200 ms	21504 KB

toll

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, 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> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;

typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

#define mp make_pair
#define f first
#define s second
#define sz(x) (int) (x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sor(x) sort(all(x))
#define rsz resize
#define resz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#define f1r(i, a, b) for(int i = (a); i < (b); ++i)
#define f0r(i, a) f1r(i, 0, a)
#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 trav(a, x) for (auto& a : x)

mt19937 rng((uint32_t) chrono::steady_clock::now().time_since_epoch().count());

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template<class T> using V = vector<T>;

#ifdef LOCAL
#define dbg(...) debug(#__VA_ARGS__, __VA_ARGS__);
#else
#define dbg(...) 17;
#endif

template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) { return os << "(" << p.first << ", " << p.second << ")"; }
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) { bool f = true; os << "{"; for (const auto &x : c) { if (!f) os << ", "; f = false; os << x; } return os << "}"; }
template<typename T> void debug(string s, T x) { cerr << s << " = " << x << "\n"; }
template<typename T, typename... Args> void debug(string s, T x, Args... args) { cerr << s.substr(0, s.find(',')) << " = " << x << " | "; debug(s.substr(s.find(',') + 2), args...); }

constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1, T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, int SZ> void re(array<T, SZ>& a);
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) {
        re(t); re(ts...); }
    template<class T> void re(complex<T>& x) { T a, b; re(a, b); x = cd(a, b); }
    template<class T1, class T2> void re(pair<T1, T2>& p) { re(p.f, p.s); }
    template<class T> void re(vector<T>& a) { F0R(i, sz(a)) re(a[i]); }
    template<class T, int SZ> void re(array<T, SZ>& a) { F0R(i, SZ) re(a[i]); }
}

using namespace input;

namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    template<class T> void pr(const complex<T>& x) { cout << x; }
    template<class T1, class T2> void pr(const pair<T1, T2>& x);
    template<class T> void pr(const T& x);
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) {
        pr(t); pr(ts...); }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{", x.f, ", ", x.s, "}"); }
    template<class T> void pr(const T& x) {
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst ? ", " : "", a), fst = 0;
        pr("}"); }
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) {
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); }
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) {
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(), "r", stdin); }
    void setOut(string s) { freopen(s.c_str(), "w", stdout); }
    void setIO(string s = "") {
        cin.sync_with_stdio(0); cin.tie(0);
        if (sz(s)) { setIn(s + ".in"), setOut(s + ".out"); }
    }
}

using namespace io;

const int MOD = 1e9 + 7; // 998244353;
const ld PI = acos((ld) -1);

typedef std::decay <decltype(MOD)>::type mod_t;
struct mi {
    mod_t val;
    explicit operator mod_t() const { return val; }
    mi() { val = 0; }
    mi(const long long& v) {
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD; }
    friend std::istream& operator >> (std::istream& in, mi& a) {
        long long x; std::cin >> x; a = mi(x); return in; }
    friend std::ostream& operator << (std::ostream& os, const mi& a) { return os << a.val; }
    friend bool operator == (const mi& a, const mi& b) { return a.val == b.val; }
    friend bool operator != (const mi& a, const mi& b) { return !(a == b); }
    friend bool operator < (const mi& a, const mi& b) { return a.val < b.val; }
    friend bool operator > (const mi& a, const mi& b) { return a.val > b.val; }
    friend bool operator <= (const mi& a, const mi& b) { return a.val <= b.val; }
    friend bool operator >= (const mi& a, const mi& b) { return a.val >= b.val; }
    mi operator - () const { return mi(-val); }
    mi& operator += (const mi& m) {
        if ((val += m.val) >= MOD) val -= MOD;
        return *this; }
    mi& operator -= (const mi& m) {
        if ((val -= m.val) < 0) val += MOD;
        return *this; }
    mi& operator *= (const mi& m) { val = (long long) val * m.val % MOD;
        return *this; }
    friend mi pow(mi a, long long p) {
        mi ans = 1; assert(p >= 0);
        for (; p; p /= 2, a *= a) if (p & 1) ans *= a;
        return ans; }
    friend mi inv(const mi& a) { assert(a != 0); return pow(a, MOD - 2); }
    mi& operator /= (const mi& m) { return (*this) *= inv(m); }
    friend mi operator + (mi a, const mi& b) { return a += b; }
    friend mi operator - (mi a, const mi& b) { return a -= b; }
    friend mi operator * (mi a, const mi& b) { return a *= b; }
    friend mi operator / (mi a, const mi& b) { return a /= b; }
};
typedef pair<mi, mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;
const int MX = 5;
const int INF = 1e9;
const int LOG = 16;
const int SZ = (1 << LOG);
int K, N, M, O;
vector<vpi> adj;
struct Node {
    int l, r; // from where to where
    int dist[MX][MX];
    Node() {
        f0r(i, K) f0r(j, K) dist[i][j] = INF;
        f0r(i, K) dist[i][i] = 0;
    }
    Node(int id) {
        f0r(i, K) f0r(j, K) dist[i][j] = INF;
        f0r(i, K) dist[i][i] = 0;
        l = r = id;
    }
} st[2 * SZ];
Node comb(Node a, Node b) {
    if (a.l == -1) return b;
    if (b.l == -1) return a;
    Node res;
    f0r(i, K) f0r(j, K) res.dist[i][j] = INF;
    res.l = a.l;
    res.r = b.r;
    int L = a.r;
    int R = b.l;
    f0r(i, K) {
        int u = i + L * K;
        if (u >= N) continue;
        for (auto& e : adj[u]) {
            int v = e.f;
            int w = e.s;
            f0r(x, K) {
                if (a.dist[x][u % K] == INF) continue;
                f0r(y, K) {
                    if (b.dist[v % K][y] == INF) continue;
                        ckmin(res.dist[x][y], a.dist[x][u % K] + b.dist[v % K][y] + w);
                }
            }
        }
    }
    return res;
}
void pull(int ind) {
    st[ind] = comb(st[2 * ind], st[2 * ind + 1]);
}
Node query(int lo, int hi, int ind = 1, int L = 0, int R = (1 << LOG) - 1) {
    if (lo > R || L > hi) return Node(-1);
    if (lo <= L && R <= hi) return st[ind];
    int M = (L + R) / 2;
    return comb(query(lo, hi, 2 * ind, L, M), query(lo, hi, 2 * ind + 1, M + 1, R));
}
int main() {
    setIO("");
    re(K, N, M, O);
    adj.resize(N);
    f0r(i, M) {
        int u, v, w; re(u, v, w);
        adj[u].eb(v, w);
    }
    f0r(i, SZ) 
        st[i + SZ] = Node(i);
    for (int i = SZ - 1; i >= 1; i--)
        pull(i);
    while (O--) {
        int a, b; re(a, b);
        if (a / K >= b / K) {
            ps(-1);
            continue;
        }
        Node res = query(a / K, b / K);
        int ans = res.dist[a % K][b % K];
        if (ans == INF) 
            ps(-1);
        else 
            ps(ans);
    }
    return 0;
}

Compilation message

toll.cpp: In function 'Node comb(Node, Node)':
toll.cpp:233:9: warning: unused variable 'R' [-Wunused-variable]
  233 |     int R = b.l;
      |         ^
toll.cpp: In function 'void io::setIn(std::string)':
toll.cpp:153:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  153 |     void setIn(string s) { freopen(s.c_str(), "r", stdin); }
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
toll.cpp: In function 'void io::setOut(std::string)':
toll.cpp:154:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  154 |     void setOut(string s) { freopen(s.c_str(), "w", stdout); }
      |                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	70 ms	18028 KB	Output is correct
2	Correct	13 ms	14188 KB	Output is correct
3	Correct	11 ms	14188 KB	Output is correct
4	Correct	11 ms	14208 KB	Output is correct
5	Correct	13 ms	14328 KB	Output is correct
6	Correct	12 ms	14444 KB	Output is correct
7	Correct	12 ms	14316 KB	Output is correct
8	Correct	64 ms	17900 KB	Output is correct
9	Correct	61 ms	17772 KB	Output is correct
10	Correct	33 ms	15468 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	76 ms	18668 KB	Output is correct
2	Correct	13 ms	14188 KB	Output is correct
3	Correct	11 ms	14188 KB	Output is correct
4	Correct	12 ms	14188 KB	Output is correct
5	Correct	12 ms	14188 KB	Output is correct
6	Correct	13 ms	14188 KB	Output is correct
7	Correct	20 ms	14336 KB	Output is correct
8	Correct	23 ms	14444 KB	Output is correct
9	Correct	52 ms	17900 KB	Output is correct
10	Correct	108 ms	20216 KB	Output is correct
11	Correct	77 ms	18668 KB	Output is correct
12	Correct	75 ms	18156 KB	Output is correct
13	Correct	105 ms	20076 KB	Output is correct
14	Correct	60 ms	18028 KB	Output is correct
15	Correct	65 ms	17388 KB	Output is correct
16	Correct	66 ms	17388 KB	Output is correct

Subtask #3

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	14188 KB	Output is correct
2	Correct	11 ms	14188 KB	Output is correct
3	Correct	14 ms	14188 KB	Output is correct
4	Correct	14 ms	14188 KB	Output is correct
5	Correct	12 ms	14188 KB	Output is correct
6	Correct	11 ms	14316 KB	Output is correct
7	Correct	12 ms	14316 KB	Output is correct
8	Correct	15 ms	14316 KB	Output is correct
9	Correct	14 ms	14316 KB	Output is correct
10	Correct	35 ms	17772 KB	Output is correct
11	Correct	54 ms	18412 KB	Output is correct
12	Correct	74 ms	20076 KB	Output is correct
13	Correct	84 ms	20588 KB	Output is correct
14	Correct	66 ms	19308 KB	Output is correct
15	Correct	49 ms	17388 KB	Output is correct
16	Correct	48 ms	17352 KB	Output is correct

Subtask #4

31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	14188 KB	Output is correct
2	Correct	11 ms	14188 KB	Output is correct
3	Correct	14 ms	14188 KB	Output is correct
4	Correct	14 ms	14188 KB	Output is correct
5	Correct	12 ms	14188 KB	Output is correct
6	Correct	11 ms	14316 KB	Output is correct
7	Correct	12 ms	14316 KB	Output is correct
8	Correct	15 ms	14316 KB	Output is correct
9	Correct	14 ms	14316 KB	Output is correct
10	Correct	35 ms	17772 KB	Output is correct
11	Correct	54 ms	18412 KB	Output is correct
12	Correct	74 ms	20076 KB	Output is correct
13	Correct	84 ms	20588 KB	Output is correct
14	Correct	66 ms	19308 KB	Output is correct
15	Correct	49 ms	17388 KB	Output is correct
16	Correct	48 ms	17352 KB	Output is correct
17	Correct	70 ms	18668 KB	Output is correct
18	Correct	11 ms	14188 KB	Output is correct
19	Correct	12 ms	14188 KB	Output is correct
20	Correct	12 ms	14188 KB	Output is correct
21	Correct	12 ms	14188 KB	Output is correct
22	Correct	15 ms	14188 KB	Output is correct
23	Correct	18 ms	14316 KB	Output is correct
24	Correct	17 ms	14316 KB	Output is correct
25	Correct	32 ms	14444 KB	Output is correct
26	Correct	25 ms	14316 KB	Output is correct
27	Correct	52 ms	17792 KB	Output is correct
28	Correct	92 ms	20076 KB	Output is correct
29	Correct	100 ms	20640 KB	Output is correct
30	Correct	79 ms	19308 KB	Output is correct

Subtask #5

44.0 / 44.0

#	결과	실행 시간	메모리	Grader output
1	Correct	70 ms	18028 KB	Output is correct
2	Correct	13 ms	14188 KB	Output is correct
3	Correct	11 ms	14188 KB	Output is correct
4	Correct	11 ms	14208 KB	Output is correct
5	Correct	13 ms	14328 KB	Output is correct
6	Correct	12 ms	14444 KB	Output is correct
7	Correct	12 ms	14316 KB	Output is correct
8	Correct	64 ms	17900 KB	Output is correct
9	Correct	61 ms	17772 KB	Output is correct
10	Correct	33 ms	15468 KB	Output is correct
11	Correct	76 ms	18668 KB	Output is correct
12	Correct	13 ms	14188 KB	Output is correct
13	Correct	11 ms	14188 KB	Output is correct
14	Correct	12 ms	14188 KB	Output is correct
15	Correct	12 ms	14188 KB	Output is correct
16	Correct	13 ms	14188 KB	Output is correct
17	Correct	20 ms	14336 KB	Output is correct
18	Correct	23 ms	14444 KB	Output is correct
19	Correct	52 ms	17900 KB	Output is correct
20	Correct	108 ms	20216 KB	Output is correct
21	Correct	77 ms	18668 KB	Output is correct
22	Correct	75 ms	18156 KB	Output is correct
23	Correct	105 ms	20076 KB	Output is correct
24	Correct	60 ms	18028 KB	Output is correct
25	Correct	65 ms	17388 KB	Output is correct
26	Correct	66 ms	17388 KB	Output is correct
27	Correct	12 ms	14188 KB	Output is correct
28	Correct	11 ms	14188 KB	Output is correct
29	Correct	14 ms	14188 KB	Output is correct
30	Correct	14 ms	14188 KB	Output is correct
31	Correct	12 ms	14188 KB	Output is correct
32	Correct	11 ms	14316 KB	Output is correct
33	Correct	12 ms	14316 KB	Output is correct
34	Correct	15 ms	14316 KB	Output is correct
35	Correct	14 ms	14316 KB	Output is correct
36	Correct	35 ms	17772 KB	Output is correct
37	Correct	54 ms	18412 KB	Output is correct
38	Correct	74 ms	20076 KB	Output is correct
39	Correct	84 ms	20588 KB	Output is correct
40	Correct	66 ms	19308 KB	Output is correct
41	Correct	49 ms	17388 KB	Output is correct
42	Correct	48 ms	17352 KB	Output is correct
43	Correct	70 ms	18668 KB	Output is correct
44	Correct	11 ms	14188 KB	Output is correct
45	Correct	12 ms	14188 KB	Output is correct
46	Correct	12 ms	14188 KB	Output is correct
47	Correct	12 ms	14188 KB	Output is correct
48	Correct	15 ms	14188 KB	Output is correct
49	Correct	18 ms	14316 KB	Output is correct
50	Correct	17 ms	14316 KB	Output is correct
51	Correct	32 ms	14444 KB	Output is correct
52	Correct	25 ms	14316 KB	Output is correct
53	Correct	52 ms	17792 KB	Output is correct
54	Correct	92 ms	20076 KB	Output is correct
55	Correct	100 ms	20640 KB	Output is correct
56	Correct	79 ms	19308 KB	Output is correct
57	Correct	200 ms	21504 KB	Output is correct
58	Correct	82 ms	17900 KB	Output is correct
59	Correct	97 ms	18796 KB	Output is correct