oj.uz

Submission #736947

# Submission time Handle Problem Language Result Execution time Memory
736947 2023-05-06T11:36:40 Z Cookie Passport (JOI23_passport) C++14
54 / 100
 2000 ms 82680 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;

 
#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 = 5e5, 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]].emplace_back(id, 0); adj[rson[id]].emplace_back(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].emplace_back(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(4 * n + 1, 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:58:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   58 |         for(auto [v, w]: adj[u]){
      |                  ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 15 ms 23764 KB Output is correct
3 Correct 13 ms 23704 KB Output is correct
4 Correct 555 ms 74788 KB Output is correct
5 Correct 215 ms 54708 KB Output is correct
6 Correct 147 ms 49624 KB Output is correct
7 Correct 89 ms 47504 KB Output is correct
8 Correct 111 ms 53212 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 16 ms 23760 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 13 ms 23764 KB Output is correct
8 Correct 14 ms 23764 KB Output is correct
9 Correct 12 ms 23760 KB Output is correct
10 Correct 13 ms 23828 KB Output is correct
11 Correct 13 ms 23892 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 13 ms 23816 KB Output is correct
14 Correct 12 ms 23904 KB Output is correct
15 Correct 12 ms 23788 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 16 ms 23760 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 13 ms 23764 KB Output is correct
8 Correct 14 ms 23764 KB Output is correct
9 Correct 12 ms 23760 KB Output is correct
10 Correct 13 ms 23828 KB Output is correct
11 Correct 13 ms 23892 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 13 ms 23816 KB Output is correct
14 Correct 12 ms 23904 KB Output is correct
15 Correct 12 ms 23788 KB Output is correct
16 Correct 15 ms 24304 KB Output is correct
17 Correct 15 ms 24108 KB Output is correct
18 Correct 15 ms 24404 KB Output is correct
19 Correct 14 ms 24484 KB Output is correct
20 Correct 13 ms 24124 KB Output is correct
21 Correct 32 ms 24148 KB Output is correct
22 Correct 13 ms 24120 KB Output is correct
23 Correct 14 ms 24212 KB Output is correct
24 Correct 14 ms 24332 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 16 ms 23760 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 13 ms 23764 KB Output is correct
8 Correct 14 ms 23764 KB Output is correct
9 Correct 12 ms 23760 KB Output is correct
10 Correct 13 ms 23828 KB Output is correct
11 Correct 13 ms 23892 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 13 ms 23816 KB Output is correct
14 Correct 12 ms 23904 KB Output is correct
15 Correct 12 ms 23788 KB Output is correct
16 Correct 15 ms 24304 KB Output is correct
17 Correct 15 ms 24108 KB Output is correct
18 Correct 15 ms 24404 KB Output is correct
19 Correct 14 ms 24484 KB Output is correct
20 Correct 13 ms 24124 KB Output is correct
21 Correct 32 ms 24148 KB Output is correct
22 Correct 13 ms 24120 KB Output is correct
23 Correct 14 ms 24212 KB Output is correct
24 Correct 14 ms 24332 KB Output is correct
25 Correct 12 ms 23764 KB Output is correct
26 Correct 13 ms 23780 KB Output is correct
27 Correct 14 ms 24324 KB Output is correct
28 Correct 14 ms 24240 KB Output is correct
29 Correct 15 ms 24084 KB Output is correct
30 Correct 33 ms 24148 KB Output is correct
31 Correct 15 ms 24148 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 15 ms 23764 KB Output is correct
3 Correct 13 ms 23704 KB Output is correct
4 Correct 555 ms 74788 KB Output is correct
5 Correct 215 ms 54708 KB Output is correct
6 Correct 147 ms 49624 KB Output is correct
7 Correct 89 ms 47504 KB Output is correct
8 Correct 111 ms 53212 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 12 ms 23764 KB Output is correct
12 Correct 16 ms 23760 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 12 ms 23764 KB Output is correct
15 Correct 13 ms 23764 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Correct 12 ms 23760 KB Output is correct
18 Correct 13 ms 23828 KB Output is correct
19 Correct 13 ms 23892 KB Output is correct
20 Correct 13 ms 23764 KB Output is correct
21 Correct 13 ms 23816 KB Output is correct
22 Correct 12 ms 23904 KB Output is correct
23 Correct 12 ms 23788 KB Output is correct
24 Correct 15 ms 24304 KB Output is correct
25 Correct 15 ms 24108 KB Output is correct
26 Correct 15 ms 24404 KB Output is correct
27 Correct 14 ms 24484 KB Output is correct
28 Correct 13 ms 24124 KB Output is correct
29 Correct 32 ms 24148 KB Output is correct
30 Correct 13 ms 24120 KB Output is correct
31 Correct 14 ms 24212 KB Output is correct
32 Correct 14 ms 24332 KB Output is correct
33 Correct 12 ms 23764 KB Output is correct
34 Correct 13 ms 23780 KB Output is correct
35 Correct 14 ms 24324 KB Output is correct
36 Correct 14 ms 24240 KB Output is correct
37 Correct 15 ms 24084 KB Output is correct
38 Correct 33 ms 24148 KB Output is correct
39 Correct 15 ms 24148 KB Output is correct
40 Correct 610 ms 75364 KB Output is correct
41 Correct 304 ms 56244 KB Output is correct
42 Execution timed out 2068 ms 82680 KB Time limit exceeded
43 Halted 0 ms 0 KB -