oj.uz

답안 #1093483

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1093483 2024-09-27T01:06:14 Z vjudge1 Toll (BOI17_toll) C++17
100 / 100
 129 ms 170068 KB 
#include<bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __buitlin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); i++)
#define Fore(i, a, b) for (auto i = (a); i >= (b); i--)
#define FOR(i, a, b) for (auto i = (a); i <= (b); i++)
#define ret(s) return void(cout << s);

const int mod = 1e9 + 7, mod2 = 998244353;
const double PI = acos(-1), eps = 1e-9;
const ull npos = string::npos;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using cd = complex<double>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<cd> vcd;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;

ll add(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a+=b;return a >= m ? a - m: a;}
ll sub(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a-=b;return a < 0 ? a + m: a;}
ll mul(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;return a*b % m;}
ll bin_mul(ll a, ll b, ll m) {if (a >= m) a%=m;if (b >= m) b%=m;ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;}
ll bin_pow(ll a, ll b, ll m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = bin_mul(x, a, m);a = bin_mul(a, a, m);b>>=1;}return x;}
ll power(ll a, ll b, int m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b) {return (a + b - 1)/b;}
ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); i++) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; i++) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; i++) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; i++) {if (n % i == 0) {int k = 0; while (n % i == 0) k++, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
int Log2(int n) {return 31 - __builtin_clz(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}

template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; while (a > 0) {s+=(int)(a % 10) + '0'; a/=10;} Reverse(s); out << s; return out;}

const ll inf = 1e18;
struct mat {
    ll a[5][5];
    mat() {
        For(i,0,5){
            For(j,0,5) a[i][j] = inf;
        }
    }
    auto& operator[](int i) {return a[i];}
    const auto& operator[](int i) const {return a[i];}
    mat operator*(const mat &b) {
        mat c;
        For(i,0,5){
            For(k,0,5){
                For(j,0,5) c[i][j] = min(c[i][j], a[i][k] + b[k][j]);
            }
        }
        return c;
    }
} s[17][50005];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
    int k, n, m, q; cin >> k >> n >> m >> q;
    while (m--) {
        int u, v, w; cin >> u >> v >> w;
        s[0][u/k][u % k][v % k] = w;
    }
    For(i,1,17){
        FOR(j,0,n-(1<<i)) s[i][j] = s[i - 1][j]*s[i - 1][j + (1 << (i - 1))];
    }
    while (q--) {
        int u, v; cin >> u >> v;
        if (u == v) {cout << "0\n"; continue;}
        mat m;
        For(i,0,5) m[i][i] = 0;
        int d = v/k - u/k, t = u/k;
        Fore(i,16,0){
            if ((d >> i) & 1) m = m*s[i][t], t+=1 << i;
        }
        cout << (m[u % k][v % k] == inf ? -1: m[u % k][v % k]) << '\n';
    }
    cerr << "\nProcess returned 0 (0x0)   execution time :  " << 0.001*clock() << " s";
    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 167776 KB Output is correct
2 Correct 57 ms 166752 KB Output is correct
3 Correct 57 ms 166748 KB Output is correct
4 Correct 61 ms 166740 KB Output is correct
5 Correct 57 ms 166736 KB Output is correct
6 Correct 64 ms 166680 KB Output is correct
7 Correct 83 ms 166740 KB Output is correct
8 Correct 110 ms 167712 KB Output is correct
9 Correct 116 ms 167504 KB Output is correct
10 Correct 102 ms 166740 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 168272 KB Output is correct
2 Correct 63 ms 166736 KB Output is correct
3 Correct 62 ms 166896 KB Output is correct
4 Correct 68 ms 166664 KB Output is correct
5 Correct 61 ms 166736 KB Output is correct
6 Correct 61 ms 166736 KB Output is correct
7 Correct 67 ms 166736 KB Output is correct
8 Correct 67 ms 166704 KB Output is correct
9 Correct 100 ms 167604 KB Output is correct
10 Correct 120 ms 169144 KB Output is correct
11 Correct 107 ms 168536 KB Output is correct
12 Correct 99 ms 168016 KB Output is correct
13 Correct 94 ms 169044 KB Output is correct
14 Correct 86 ms 168020 KB Output is correct
15 Correct 83 ms 168016 KB Output is correct
16 Correct 83 ms 167816 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 166736 KB Output is correct
2 Correct 57 ms 166744 KB Output is correct
3 Correct 58 ms 166684 KB Output is correct
4 Correct 58 ms 166736 KB Output is correct
5 Correct 69 ms 166736 KB Output is correct
6 Correct 59 ms 166736 KB Output is correct
7 Correct 63 ms 166736 KB Output is correct
8 Correct 68 ms 166740 KB Output is correct
9 Correct 59 ms 166736 KB Output is correct
10 Correct 102 ms 167504 KB Output is correct
11 Correct 105 ms 168276 KB Output is correct
12 Correct 113 ms 168780 KB Output is correct
13 Correct 112 ms 169044 KB Output is correct
14 Correct 107 ms 168528 KB Output is correct
15 Correct 88 ms 167956 KB Output is correct
16 Correct 92 ms 167928 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 166736 KB Output is correct
2 Correct 57 ms 166744 KB Output is correct
3 Correct 58 ms 166684 KB Output is correct
4 Correct 58 ms 166736 KB Output is correct
5 Correct 69 ms 166736 KB Output is correct
6 Correct 59 ms 166736 KB Output is correct
7 Correct 63 ms 166736 KB Output is correct
8 Correct 68 ms 166740 KB Output is correct
9 Correct 59 ms 166736 KB Output is correct
10 Correct 102 ms 167504 KB Output is correct
11 Correct 105 ms 168276 KB Output is correct
12 Correct 113 ms 168780 KB Output is correct
13 Correct 112 ms 169044 KB Output is correct
14 Correct 107 ms 168528 KB Output is correct
15 Correct 88 ms 167956 KB Output is correct
16 Correct 92 ms 167928 KB Output is correct
17 Correct 110 ms 168272 KB Output is correct
18 Correct 61 ms 166736 KB Output is correct
19 Correct 67 ms 166708 KB Output is correct
20 Correct 63 ms 166736 KB Output is correct
21 Correct 63 ms 166740 KB Output is correct
22 Correct 64 ms 166740 KB Output is correct
23 Correct 63 ms 166832 KB Output is correct
24 Correct 63 ms 166740 KB Output is correct
25 Correct 66 ms 166736 KB Output is correct
26 Correct 67 ms 166740 KB Output is correct
27 Correct 108 ms 167508 KB Output is correct
28 Correct 115 ms 168788 KB Output is correct
29 Correct 124 ms 169184 KB Output is correct
30 Correct 113 ms 168480 KB Output is correct

Subtask #5
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 167776 KB Output is correct
2 Correct 57 ms 166752 KB Output is correct
3 Correct 57 ms 166748 KB Output is correct
4 Correct 61 ms 166740 KB Output is correct
5 Correct 57 ms 166736 KB Output is correct
6 Correct 64 ms 166680 KB Output is correct
7 Correct 83 ms 166740 KB Output is correct
8 Correct 110 ms 167712 KB Output is correct
9 Correct 116 ms 167504 KB Output is correct
10 Correct 102 ms 166740 KB Output is correct
11 Correct 117 ms 168272 KB Output is correct
12 Correct 63 ms 166736 KB Output is correct
13 Correct 62 ms 166896 KB Output is correct
14 Correct 68 ms 166664 KB Output is correct
15 Correct 61 ms 166736 KB Output is correct
16 Correct 61 ms 166736 KB Output is correct
17 Correct 67 ms 166736 KB Output is correct
18 Correct 67 ms 166704 KB Output is correct
19 Correct 100 ms 167604 KB Output is correct
20 Correct 120 ms 169144 KB Output is correct
21 Correct 107 ms 168536 KB Output is correct
22 Correct 99 ms 168016 KB Output is correct
23 Correct 94 ms 169044 KB Output is correct
24 Correct 86 ms 168020 KB Output is correct
25 Correct 83 ms 168016 KB Output is correct
26 Correct 83 ms 167816 KB Output is correct
27 Correct 58 ms 166736 KB Output is correct
28 Correct 57 ms 166744 KB Output is correct
29 Correct 58 ms 166684 KB Output is correct
30 Correct 58 ms 166736 KB Output is correct
31 Correct 69 ms 166736 KB Output is correct
32 Correct 59 ms 166736 KB Output is correct
33 Correct 63 ms 166736 KB Output is correct
34 Correct 68 ms 166740 KB Output is correct
35 Correct 59 ms 166736 KB Output is correct
36 Correct 102 ms 167504 KB Output is correct
37 Correct 105 ms 168276 KB Output is correct
38 Correct 113 ms 168780 KB Output is correct
39 Correct 112 ms 169044 KB Output is correct
40 Correct 107 ms 168528 KB Output is correct
41 Correct 88 ms 167956 KB Output is correct
42 Correct 92 ms 167928 KB Output is correct
43 Correct 110 ms 168272 KB Output is correct
44 Correct 61 ms 166736 KB Output is correct
45 Correct 67 ms 166708 KB Output is correct
46 Correct 63 ms 166736 KB Output is correct
47 Correct 63 ms 166740 KB Output is correct
48 Correct 64 ms 166740 KB Output is correct
49 Correct 63 ms 166832 KB Output is correct
50 Correct 63 ms 166740 KB Output is correct
51 Correct 66 ms 166736 KB Output is correct
52 Correct 67 ms 166740 KB Output is correct
53 Correct 108 ms 167508 KB Output is correct
54 Correct 115 ms 168788 KB Output is correct
55 Correct 124 ms 169184 KB Output is correct
56 Correct 113 ms 168480 KB Output is correct
57 Correct 129 ms 170068 KB Output is correct
58 Correct 119 ms 167740 KB Output is correct
59 Correct 128 ms 168744 KB Output is correct