oj.uz

답안 #1086598

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1086598 2024-09-11T05:30:37 Z binminh01 Passport (JOI23_passport) C++17
100 / 100
 685 ms 125328 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 int N = 3e5 + 5;
vpair g[5*N];
void build(int x, int l, int r) {
    if (l == r) {
        g[l + 4*N].eb(x, 0);
        return;
    }
    int m = (l + r) >> 1;
    build(x << 1, l, m); build(x << 1|1, m + 1, r);
    g[x << 1].eb(x, 0); g[x << 1|1].eb(x, 0);
}
void upd(int x, int lx, int rx, int l, int r, int u) {
    if (lx > r || rx < l) return;
    if (lx >= l && rx <= r) {
        g[x].eb(u + 4*N, 1);
        return;
    }
    int m = (lx + rx) >> 1;
    upd(x << 1, lx, m, l, r, u); upd(x << 1|1, m + 1, rx, l, r, u);
}
int f[5*N], h[5*N], t[5*N];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
    int n; cin >> n;
    build(1, 1, n);
    FOR(i,1,n){
        int l, r; cin >> l >> r;
        upd(1, 1, n, l, r, i);
    }
    deque<int> q{4*N + 1};
    memset(f, 0x3f, sizeof(f));
    f[4*N + 1] = 0;
    while (sz(q)) {
        int u = q[0]; q.pop_front();
        for (auto [v, w]: g[u]) {
            if (f[v] > f[u] + w) {
                f[v] = f[u] + w;
                if (!w) q.push_front(v);
                else q.pb(v);
            }
        }
    }
    q.pb(4*N + n);
    memset(h, 0x3f, sizeof(h));
    h[4*N + n] = 0;
    while (sz(q)) {
        int u = q[0]; q.pop_front();
        for (auto [v, w]: g[u]) {
            if (h[v] > h[u] + w) {
                h[v] = h[u] + w;
                if (!w) q.push_front(v);
                else q.pb(v);
            }
        }
    }
    priority_queue<pii, vpair, greater<pii>> p;
    memset(t, 0x3f, sizeof(t));
    FOR(i,1,4*N+n) t[i] = f[i] + h[i] - (i >= 4*N && i != 4*N + 1 && i != 4*N + n), p.emplace(t[i], i);
    while (sz(p)) {
        auto [x, u] = p.top(); p.pop();
        if (t[u] < x) continue;
        for (auto [v, w]: g[u]) {
            if (t[v] > t[u] + w) t[v] = t[u] + w, p.emplace(t[v], v);
        }
    }
    int _; cin >> _;
    while (_--) {
        int i; cin >> i;
        cout << (t[4*N + i] > n ? -1: t[4*N + i]) << '\n';
    }
    cerr << "\nProcess returned 0 (0x0)   execution time :  " << 0.001*clock() << " s";
    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 69824 KB Output is correct
2 Correct 146 ms 69832 KB Output is correct
3 Correct 134 ms 69828 KB Output is correct
4 Correct 680 ms 118048 KB Output is correct
5 Correct 405 ms 97552 KB Output is correct
6 Correct 301 ms 91572 KB Output is correct
7 Correct 261 ms 91872 KB Output is correct
8 Correct 271 ms 97060 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 69828 KB Output is correct
2 Correct 130 ms 69820 KB Output is correct
3 Correct 129 ms 69856 KB Output is correct
4 Correct 138 ms 69828 KB Output is correct
5 Correct 136 ms 69712 KB Output is correct
6 Correct 134 ms 69820 KB Output is correct
7 Correct 129 ms 69752 KB Output is correct
8 Correct 149 ms 69680 KB Output is correct
9 Correct 134 ms 69828 KB Output is correct
10 Correct 129 ms 69820 KB Output is correct
11 Correct 135 ms 69884 KB Output is correct
12 Correct 139 ms 69812 KB Output is correct
13 Correct 133 ms 69816 KB Output is correct
14 Correct 141 ms 69812 KB Output is correct
15 Correct 135 ms 69820 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 69828 KB Output is correct
2 Correct 130 ms 69820 KB Output is correct
3 Correct 129 ms 69856 KB Output is correct
4 Correct 138 ms 69828 KB Output is correct
5 Correct 136 ms 69712 KB Output is correct
6 Correct 134 ms 69820 KB Output is correct
7 Correct 129 ms 69752 KB Output is correct
8 Correct 149 ms 69680 KB Output is correct
9 Correct 134 ms 69828 KB Output is correct
10 Correct 129 ms 69820 KB Output is correct
11 Correct 135 ms 69884 KB Output is correct
12 Correct 139 ms 69812 KB Output is correct
13 Correct 133 ms 69816 KB Output is correct
14 Correct 141 ms 69812 KB Output is correct
15 Correct 135 ms 69820 KB Output is correct
16 Correct 137 ms 70084 KB Output is correct
17 Correct 136 ms 70072 KB Output is correct
18 Correct 133 ms 70320 KB Output is correct
19 Correct 138 ms 70332 KB Output is correct
20 Correct 136 ms 70080 KB Output is correct
21 Correct 139 ms 70072 KB Output is correct
22 Correct 143 ms 70088 KB Output is correct
23 Correct 138 ms 70080 KB Output is correct
24 Correct 133 ms 70076 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 69828 KB Output is correct
2 Correct 130 ms 69820 KB Output is correct
3 Correct 129 ms 69856 KB Output is correct
4 Correct 138 ms 69828 KB Output is correct
5 Correct 136 ms 69712 KB Output is correct
6 Correct 134 ms 69820 KB Output is correct
7 Correct 129 ms 69752 KB Output is correct
8 Correct 149 ms 69680 KB Output is correct
9 Correct 134 ms 69828 KB Output is correct
10 Correct 129 ms 69820 KB Output is correct
11 Correct 135 ms 69884 KB Output is correct
12 Correct 139 ms 69812 KB Output is correct
13 Correct 133 ms 69816 KB Output is correct
14 Correct 141 ms 69812 KB Output is correct
15 Correct 135 ms 69820 KB Output is correct
16 Correct 137 ms 70084 KB Output is correct
17 Correct 136 ms 70072 KB Output is correct
18 Correct 133 ms 70320 KB Output is correct
19 Correct 138 ms 70332 KB Output is correct
20 Correct 136 ms 70080 KB Output is correct
21 Correct 139 ms 70072 KB Output is correct
22 Correct 143 ms 70088 KB Output is correct
23 Correct 138 ms 70080 KB Output is correct
24 Correct 133 ms 70076 KB Output is correct
25 Correct 129 ms 69612 KB Output is correct
26 Correct 130 ms 69824 KB Output is correct
27 Correct 131 ms 70076 KB Output is correct
28 Correct 135 ms 70076 KB Output is correct
29 Correct 140 ms 69928 KB Output is correct
30 Correct 128 ms 70072 KB Output is correct
31 Correct 137 ms 70072 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 69824 KB Output is correct
2 Correct 146 ms 69832 KB Output is correct
3 Correct 134 ms 69828 KB Output is correct
4 Correct 680 ms 118048 KB Output is correct
5 Correct 405 ms 97552 KB Output is correct
6 Correct 301 ms 91572 KB Output is correct
7 Correct 261 ms 91872 KB Output is correct
8 Correct 271 ms 97060 KB Output is correct
9 Correct 136 ms 69828 KB Output is correct
10 Correct 130 ms 69820 KB Output is correct
11 Correct 129 ms 69856 KB Output is correct
12 Correct 138 ms 69828 KB Output is correct
13 Correct 136 ms 69712 KB Output is correct
14 Correct 134 ms 69820 KB Output is correct
15 Correct 129 ms 69752 KB Output is correct
16 Correct 149 ms 69680 KB Output is correct
17 Correct 134 ms 69828 KB Output is correct
18 Correct 129 ms 69820 KB Output is correct
19 Correct 135 ms 69884 KB Output is correct
20 Correct 139 ms 69812 KB Output is correct
21 Correct 133 ms 69816 KB Output is correct
22 Correct 141 ms 69812 KB Output is correct
23 Correct 135 ms 69820 KB Output is correct
24 Correct 137 ms 70084 KB Output is correct
25 Correct 136 ms 70072 KB Output is correct
26 Correct 133 ms 70320 KB Output is correct
27 Correct 138 ms 70332 KB Output is correct
28 Correct 136 ms 70080 KB Output is correct
29 Correct 139 ms 70072 KB Output is correct
30 Correct 143 ms 70088 KB Output is correct
31 Correct 138 ms 70080 KB Output is correct
32 Correct 133 ms 70076 KB Output is correct
33 Correct 129 ms 69612 KB Output is correct
34 Correct 130 ms 69824 KB Output is correct
35 Correct 131 ms 70076 KB Output is correct
36 Correct 135 ms 70076 KB Output is correct
37 Correct 140 ms 69928 KB Output is correct
38 Correct 128 ms 70072 KB Output is correct
39 Correct 137 ms 70072 KB Output is correct
40 Correct 685 ms 118300 KB Output is correct
41 Correct 422 ms 97976 KB Output is correct
42 Correct 513 ms 124180 KB Output is correct
43 Correct 503 ms 125328 KB Output is correct
44 Correct 308 ms 91584 KB Output is correct
45 Correct 409 ms 99372 KB Output is correct
46 Correct 229 ms 80128 KB Output is correct
47 Correct 405 ms 101052 KB Output is correct
48 Correct 403 ms 108956 KB Output is correct