oj.uz

답안 #1074960

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1074960 2024-08-25T17:06:41 Z mnbvcxz123 Passport (JOI23_passport) C++17
100 / 100
 538 ms 89068 KB 
#include <bits/stdc++.h>
#define se              second
#define fs              first
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)
 
using namespace std;
 
mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }
 
const int N = 1e6 + 7;
const ll Mod = 1e9 + 7;
const int szBL = 916;
const ll INF = 1e9;
const int BASE = 137;
 
int n, Q;
pair<int,int> a[N];
vector<pair<int,int>> ke[N];
int dist1[N], distn[N], distc[N];
int indx[N];
 
void build (int id, int l, int r) {
    if (l == r) {
        indx[l] = id;
        return;
    }
    int mid = l + r>> 1;
    build (id << 1, l, mid);
    build (id << 1 | 1, mid + 1, r);
    ke[id << 1].push_back({id, 0});
    ke[id << 1 | 1].push_back({id, 0});
}
 
void update (int id, int l, int r, int u, int v, int idx) {
    if (l > v || r < u) return;
    if (l >= u && r <= v) {
        ke[id].push_back({idx, 1});
        return;
    }
    int mid = l + r >> 1;
    update (id << 1, l, mid, u, v, idx);
    update (id << 1 | 1, mid + 1, r, u, v, idx);
}
 
void Dijkstra (int dist[]) {
    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
    rep (i, 1, n << 2) {
        if (dist[i] < INF) pq.push({dist[i], i});
    }
    while (!pq.empty()) {
        int u = pq.top().se;
        pq.pop();
        iter (&id, ke[u]) {
            if (dist[id.fs] > dist[u] + id.se) {
                dist[id.fs] = dist[u] + id.se;
                pq.push({dist[id.fs], id.fs});
            }
        }
    }
}
 
void solution () {
    cin >> n;
    build (1, 1, n);
    rep (i, 1, n) {
        cin >> a[i].fs >> a[i].se;
        update (1, 1, n, a[i].fs, a[i].se, indx[i]);
    }
    memset(dist1, 0x3f, sizeof dist1);
    memset(distn, 0x3f, sizeof distn);
    memset(distc, 0x3f, sizeof distc);
    rep (i, 1, n) {
        if (a[i].fs == 1) {
            dist1[indx[i]] = 0;
        }
        if (a[i].se == n) {
            distn[indx[i]] = 0;
        }
    }
    Dijkstra(dist1);
    Dijkstra(distn);
    rep (i, 1, n) {
        distc[indx[i]] = dist1[indx[i]] + distn[indx[i]];
//        cout << i<<" "<<distc[indx[i]] <<"\n";
    }
    Dijkstra(distc);
    cin >> Q;
    rep (i, 1, Q) {
        int X;
        cin >> X;
        if (distc[indx[X]] < INF)
            cout << distc[indx[X]] + 1 <<"\n";
        else cout << -1 <<"\n";
    }
 
}
 
 
int main () {
//    file("c");
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll num_Test = 1;
//    cin >> num_Test;
    while(num_Test--)
        solution();
}

Compilation message

passport.cpp: In function 'void build(int, int, int)':
passport.cpp:37:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   37 |     int mid = l + r>> 1;
      |               ~~^~~
passport.cpp: In function 'void update(int, int, int, int, int, int)':
passport.cpp:50:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   50 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 35676 KB Output is correct
2 Correct 13 ms 35676 KB Output is correct
3 Correct 13 ms 35676 KB Output is correct
4 Correct 481 ms 82800 KB Output is correct
5 Correct 264 ms 60928 KB Output is correct
6 Correct 160 ms 55588 KB Output is correct
7 Correct 155 ms 55300 KB Output is correct
8 Correct 109 ms 60680 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 35672 KB Output is correct
2 Correct 14 ms 35676 KB Output is correct
3 Correct 13 ms 35588 KB Output is correct
4 Correct 13 ms 35676 KB Output is correct
5 Correct 15 ms 35616 KB Output is correct
6 Correct 13 ms 35676 KB Output is correct
7 Correct 14 ms 35472 KB Output is correct
8 Correct 13 ms 35632 KB Output is correct
9 Correct 15 ms 35672 KB Output is correct
10 Correct 17 ms 35676 KB Output is correct
11 Correct 14 ms 35676 KB Output is correct
12 Correct 15 ms 35676 KB Output is correct
13 Correct 15 ms 35676 KB Output is correct
14 Correct 16 ms 35676 KB Output is correct
15 Correct 14 ms 35632 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 35672 KB Output is correct
2 Correct 14 ms 35676 KB Output is correct
3 Correct 13 ms 35588 KB Output is correct
4 Correct 13 ms 35676 KB Output is correct
5 Correct 15 ms 35616 KB Output is correct
6 Correct 13 ms 35676 KB Output is correct
7 Correct 14 ms 35472 KB Output is correct
8 Correct 13 ms 35632 KB Output is correct
9 Correct 15 ms 35672 KB Output is correct
10 Correct 17 ms 35676 KB Output is correct
11 Correct 14 ms 35676 KB Output is correct
12 Correct 15 ms 35676 KB Output is correct
13 Correct 15 ms 35676 KB Output is correct
14 Correct 16 ms 35676 KB Output is correct
15 Correct 14 ms 35632 KB Output is correct
16 Correct 18 ms 35928 KB Output is correct
17 Correct 15 ms 35928 KB Output is correct
18 Correct 18 ms 36184 KB Output is correct
19 Correct 16 ms 36188 KB Output is correct
20 Correct 16 ms 35928 KB Output is correct
21 Correct 16 ms 35932 KB Output is correct
22 Correct 16 ms 35932 KB Output is correct
23 Correct 17 ms 35928 KB Output is correct
24 Correct 14 ms 35928 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 35672 KB Output is correct
2 Correct 14 ms 35676 KB Output is correct
3 Correct 13 ms 35588 KB Output is correct
4 Correct 13 ms 35676 KB Output is correct
5 Correct 15 ms 35616 KB Output is correct
6 Correct 13 ms 35676 KB Output is correct
7 Correct 14 ms 35472 KB Output is correct
8 Correct 13 ms 35632 KB Output is correct
9 Correct 15 ms 35672 KB Output is correct
10 Correct 17 ms 35676 KB Output is correct
11 Correct 14 ms 35676 KB Output is correct
12 Correct 15 ms 35676 KB Output is correct
13 Correct 15 ms 35676 KB Output is correct
14 Correct 16 ms 35676 KB Output is correct
15 Correct 14 ms 35632 KB Output is correct
16 Correct 18 ms 35928 KB Output is correct
17 Correct 15 ms 35928 KB Output is correct
18 Correct 18 ms 36184 KB Output is correct
19 Correct 16 ms 36188 KB Output is correct
20 Correct 16 ms 35928 KB Output is correct
21 Correct 16 ms 35932 KB Output is correct
22 Correct 16 ms 35932 KB Output is correct
23 Correct 17 ms 35928 KB Output is correct
24 Correct 14 ms 35928 KB Output is correct
25 Correct 18 ms 35676 KB Output is correct
26 Correct 15 ms 35632 KB Output is correct
27 Correct 15 ms 35916 KB Output is correct
28 Correct 18 ms 35932 KB Output is correct
29 Correct 15 ms 35928 KB Output is correct
30 Correct 18 ms 35932 KB Output is correct
31 Correct 15 ms 35932 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 35676 KB Output is correct
2 Correct 13 ms 35676 KB Output is correct
3 Correct 13 ms 35676 KB Output is correct
4 Correct 481 ms 82800 KB Output is correct
5 Correct 264 ms 60928 KB Output is correct
6 Correct 160 ms 55588 KB Output is correct
7 Correct 155 ms 55300 KB Output is correct
8 Correct 109 ms 60680 KB Output is correct
9 Correct 13 ms 35672 KB Output is correct
10 Correct 14 ms 35676 KB Output is correct
11 Correct 13 ms 35588 KB Output is correct
12 Correct 13 ms 35676 KB Output is correct
13 Correct 15 ms 35616 KB Output is correct
14 Correct 13 ms 35676 KB Output is correct
15 Correct 14 ms 35472 KB Output is correct
16 Correct 13 ms 35632 KB Output is correct
17 Correct 15 ms 35672 KB Output is correct
18 Correct 17 ms 35676 KB Output is correct
19 Correct 14 ms 35676 KB Output is correct
20 Correct 15 ms 35676 KB Output is correct
21 Correct 15 ms 35676 KB Output is correct
22 Correct 16 ms 35676 KB Output is correct
23 Correct 14 ms 35632 KB Output is correct
24 Correct 18 ms 35928 KB Output is correct
25 Correct 15 ms 35928 KB Output is correct
26 Correct 18 ms 36184 KB Output is correct
27 Correct 16 ms 36188 KB Output is correct
28 Correct 16 ms 35928 KB Output is correct
29 Correct 16 ms 35932 KB Output is correct
30 Correct 16 ms 35932 KB Output is correct
31 Correct 17 ms 35928 KB Output is correct
32 Correct 14 ms 35928 KB Output is correct
33 Correct 18 ms 35676 KB Output is correct
34 Correct 15 ms 35632 KB Output is correct
35 Correct 15 ms 35916 KB Output is correct
36 Correct 18 ms 35932 KB Output is correct
37 Correct 15 ms 35928 KB Output is correct
38 Correct 18 ms 35932 KB Output is correct
39 Correct 15 ms 35932 KB Output is correct
40 Correct 538 ms 85112 KB Output is correct
41 Correct 277 ms 61124 KB Output is correct
42 Correct 372 ms 88308 KB Output is correct
43 Correct 397 ms 89068 KB Output is correct
44 Correct 164 ms 55828 KB Output is correct
45 Correct 212 ms 62464 KB Output is correct
46 Correct 105 ms 45544 KB Output is correct
47 Correct 328 ms 64828 KB Output is correct
48 Correct 241 ms 71356 KB Output is correct