oj.uz

답안 #1074958

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1074958 2024-08-25T17:05:43 Z mnbvcxz123 Passport (JOI23_passport) C++17
100 / 100
 543 ms 91944 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 14 ms 35676 KB Output is correct
2 Correct 14 ms 35672 KB Output is correct
3 Correct 15 ms 35676 KB Output is correct
4 Correct 543 ms 85416 KB Output is correct
5 Correct 269 ms 63296 KB Output is correct
6 Correct 147 ms 58136 KB Output is correct
7 Correct 158 ms 56916 KB Output is correct
8 Correct 104 ms 62028 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
24.0 / 24.0

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

Subtask #4
8.0 / 8.0

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

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 35676 KB Output is correct
2 Correct 14 ms 35672 KB Output is correct
3 Correct 15 ms 35676 KB Output is correct
4 Correct 543 ms 85416 KB Output is correct
5 Correct 269 ms 63296 KB Output is correct
6 Correct 147 ms 58136 KB Output is correct
7 Correct 158 ms 56916 KB Output is correct
8 Correct 104 ms 62028 KB Output is correct
9 Correct 15 ms 35672 KB Output is correct
10 Correct 15 ms 35676 KB Output is correct
11 Correct 13 ms 35544 KB Output is correct
12 Correct 14 ms 35676 KB Output is correct
13 Correct 19 ms 35672 KB Output is correct
14 Correct 14 ms 35676 KB Output is correct
15 Correct 13 ms 35492 KB Output is correct
16 Correct 13 ms 35676 KB Output is correct
17 Correct 14 ms 35676 KB Output is correct
18 Correct 13 ms 35676 KB Output is correct
19 Correct 15 ms 35672 KB Output is correct
20 Correct 16 ms 35676 KB Output is correct
21 Correct 14 ms 35676 KB Output is correct
22 Correct 14 ms 35680 KB Output is correct
23 Correct 13 ms 35676 KB Output is correct
24 Correct 18 ms 35928 KB Output is correct
25 Correct 17 ms 35932 KB Output is correct
26 Correct 15 ms 36188 KB Output is correct
27 Correct 17 ms 36188 KB Output is correct
28 Correct 17 ms 35928 KB Output is correct
29 Correct 16 ms 35928 KB Output is correct
30 Correct 14 ms 35932 KB Output is correct
31 Correct 15 ms 36084 KB Output is correct
32 Correct 14 ms 35928 KB Output is correct
33 Correct 14 ms 35672 KB Output is correct
34 Correct 14 ms 35676 KB Output is correct
35 Correct 17 ms 36188 KB Output is correct
36 Correct 20 ms 35932 KB Output is correct
37 Correct 16 ms 35932 KB Output is correct
38 Correct 16 ms 35928 KB Output is correct
39 Correct 18 ms 35928 KB Output is correct
40 Correct 520 ms 87832 KB Output is correct
41 Correct 285 ms 64044 KB Output is correct
42 Correct 379 ms 91012 KB Output is correct
43 Correct 347 ms 91944 KB Output is correct
44 Correct 153 ms 58796 KB Output is correct
45 Correct 193 ms 66032 KB Output is correct
46 Correct 101 ms 46492 KB Output is correct
47 Correct 304 ms 67508 KB Output is correct
48 Correct 214 ms 74004 KB Output is correct