oj.uz

답안 #736941

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
736941 2023-05-06T11:32:32 Z Cookie Passport (JOI23_passport) C++14
54 / 100
 2000 ms 66920 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
const int x[4] = {1, -1, 0, 0};
const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 7;
const int mxn = 2e5, mxm = 1e5, sq = 400;
const int base = (1 << 18);
const ll inf = 1e9;
const ld pre = 1e-6;
//cool problem!
int n;
int l[mxn + 1], r[mxn + 1], id, lson[2 * mxn + 5], rson[2 * mxn + 5];
vt<pii>adj[2 * mxn + 5];
vt<int>d1, d2, d3;
int build(int nd, int l, int r){
    if(l == r)return(l);
    int mid = (l + r) >> 1;
    int ls = build(nd << 1, l, mid), rs = build(nd << 1 | 1, mid + 1, r);
    ++id;
    lson[id] = ls; rson[id] = rs;
    
    adj[lson[id]].pb(make_pair(id, 0)); adj[rson[id]].pb(make_pair(id, 0));
    return(id);
}
void upd(int nd, int l, int r, int ql, int qr, int u){
    if(ql > r || qr < l)return;
    if(ql <= l && qr >= r){
        
        adj[nd].pb(make_pair(u, 1));
        return;
    }
    int mid = (l + r) >> 1;
    upd(lson[nd], l, mid, ql, qr, u); upd(rson[nd], mid + 1, r, ql, qr, u);
}
void find(vt<int>&d){
    deque<int>dq;
    for(int i = 1; i <= n; i++){
        if(d[i] != inf)dq.pb(i);
    }
   
    while(!dq.empty()){
        int u = dq.front(); dq.pop_front();
        for(auto [v, w]: adj[u]){
            if(d[v] > d[u] + w){
                d[v] = d[u] + w;
                if(w){
                    dq.pb(v);
                }else{
                    dq.push_front(v);
                }
            }
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    id = n;
    int root = build(1, 1, n);
    
    forr(i, 1, n + 1){
        cin >> l[i] >> r[i];
        upd(root, 1, n, l[i], r[i], i);
    }
    d1.resize(2 * n + 5, inf); d1[1] = 0;
    find(d1); 
    d1[1] = 1;
    d2.resize(2 * n + 5, inf); d2[n] = 0;
    
    find(d2);
    d2[n] = 1;
    
    d3.resize(2 * n + 5, inf);
    for(int i = 1; i <= n; i++){
        d3[i] = d1[i] + d2[i]; 
    }
    find(d3);
    int q; cin >> q;
    forr(i, 0, q){
        int x; cin >> x;
        if(d3[x] >= 1e9)cout << -1 << "\n";
        else cout << d3[x] - 1 << "\n";
    }
    return(0);
}

Compilation message

passport.cpp: In function 'void find(std::vector<int>&)':
passport.cpp:60:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   60 |         for(auto [v, w]: adj[u]){
      |                  ^

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 512 ms 59240 KB Output is correct
5 Correct 227 ms 39068 KB Output is correct
6 Correct 141 ms 34036 KB Output is correct
7 Correct 104 ms 31872 KB Output is correct
8 Correct 93 ms 37832 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9812 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 7 ms 9688 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 7 ms 9684 KB Output is correct
7 Correct 6 ms 9736 KB Output is correct
8 Correct 7 ms 9640 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 6 ms 9684 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9812 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 7 ms 9688 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 7 ms 9684 KB Output is correct
7 Correct 6 ms 9736 KB Output is correct
8 Correct 7 ms 9640 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 6 ms 9684 KB Output is correct
16 Correct 7 ms 10072 KB Output is correct
17 Correct 9 ms 10080 KB Output is correct
18 Correct 12 ms 10324 KB Output is correct
19 Correct 11 ms 10364 KB Output is correct
20 Correct 10 ms 9944 KB Output is correct
21 Correct 32 ms 10068 KB Output is correct
22 Correct 9 ms 9940 KB Output is correct
23 Correct 10 ms 10068 KB Output is correct
24 Correct 8 ms 10196 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9812 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 7 ms 9688 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 7 ms 9684 KB Output is correct
7 Correct 6 ms 9736 KB Output is correct
8 Correct 7 ms 9640 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 6 ms 9684 KB Output is correct
16 Correct 7 ms 10072 KB Output is correct
17 Correct 9 ms 10080 KB Output is correct
18 Correct 12 ms 10324 KB Output is correct
19 Correct 11 ms 10364 KB Output is correct
20 Correct 10 ms 9944 KB Output is correct
21 Correct 32 ms 10068 KB Output is correct
22 Correct 9 ms 9940 KB Output is correct
23 Correct 10 ms 10068 KB Output is correct
24 Correct 8 ms 10196 KB Output is correct
25 Correct 5 ms 9684 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 8 ms 10196 KB Output is correct
28 Correct 9 ms 10068 KB Output is correct
29 Correct 8 ms 10004 KB Output is correct
30 Correct 34 ms 10080 KB Output is correct
31 Correct 8 ms 10068 KB Output is correct

Subtask #5
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 512 ms 59240 KB Output is correct
5 Correct 227 ms 39068 KB Output is correct
6 Correct 141 ms 34036 KB Output is correct
7 Correct 104 ms 31872 KB Output is correct
8 Correct 93 ms 37832 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9812 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 7 ms 9688 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 6 ms 9736 KB Output is correct
16 Correct 7 ms 9640 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 7 ms 9684 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 7 ms 10072 KB Output is correct
25 Correct 9 ms 10080 KB Output is correct
26 Correct 12 ms 10324 KB Output is correct
27 Correct 11 ms 10364 KB Output is correct
28 Correct 10 ms 9944 KB Output is correct
29 Correct 32 ms 10068 KB Output is correct
30 Correct 9 ms 9940 KB Output is correct
31 Correct 10 ms 10068 KB Output is correct
32 Correct 8 ms 10196 KB Output is correct
33 Correct 5 ms 9684 KB Output is correct
34 Correct 5 ms 9684 KB Output is correct
35 Correct 8 ms 10196 KB Output is correct
36 Correct 9 ms 10068 KB Output is correct
37 Correct 8 ms 10004 KB Output is correct
38 Correct 34 ms 10080 KB Output is correct
39 Correct 8 ms 10068 KB Output is correct
40 Correct 513 ms 59804 KB Output is correct
41 Correct 235 ms 40516 KB Output is correct
42 Execution timed out 2084 ms 66920 KB Time limit exceeded
43 Halted 0 ms 0 KB -