oj.uz

Submission #736989

# Submission time Handle Problem Language Result Execution time Memory
736989 2023-05-06T12:15:29 Z Cookie Passport (JOI23_passport) C++14
54 / 100
 572 ms 81500 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<ll>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<ll>&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;
    int q; cin >> q;
    if(n < 199851 || q == 1){
    d3.resize(4 * n + 1, inf);
    for(int i = 1; i <= n; i++){
        d3[i] = d1[i] + d2[i]; 
    }
    find(d3);
    
    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<long long 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 12 ms 23808 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 14 ms 23736 KB Output is correct
4 Correct 572 ms 80792 KB Output is correct
5 Correct 214 ms 60940 KB Output is correct
6 Correct 136 ms 55852 KB Output is correct
7 Correct 82 ms 53564 KB Output is correct
8 Correct 97 ms 58064 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 11 ms 23764 KB Output is correct
5 Correct 12 ms 23776 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 12 ms 23800 KB Output is correct
8 Correct 11 ms 23808 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 11 ms 23764 KB Output is correct
11 Correct 12 ms 23880 KB Output is correct
12 Correct 11 ms 23892 KB Output is correct
13 Correct 12 ms 23800 KB Output is correct
14 Correct 12 ms 23792 KB Output is correct
15 Correct 12 ms 23892 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 11 ms 23764 KB Output is correct
5 Correct 12 ms 23776 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 12 ms 23800 KB Output is correct
8 Correct 11 ms 23808 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 11 ms 23764 KB Output is correct
11 Correct 12 ms 23880 KB Output is correct
12 Correct 11 ms 23892 KB Output is correct
13 Correct 12 ms 23800 KB Output is correct
14 Correct 12 ms 23792 KB Output is correct
15 Correct 12 ms 23892 KB Output is correct
16 Correct 16 ms 24276 KB Output is correct
17 Correct 14 ms 24268 KB Output is correct
18 Correct 15 ms 24568 KB Output is correct
19 Correct 15 ms 24536 KB Output is correct
20 Correct 13 ms 24148 KB Output is correct
21 Correct 37 ms 24276 KB Output is correct
22 Correct 12 ms 24148 KB Output is correct
23 Correct 13 ms 24276 KB Output is correct
24 Correct 13 ms 24404 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 11 ms 23764 KB Output is correct
5 Correct 12 ms 23776 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 12 ms 23800 KB Output is correct
8 Correct 11 ms 23808 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 11 ms 23764 KB Output is correct
11 Correct 12 ms 23880 KB Output is correct
12 Correct 11 ms 23892 KB Output is correct
13 Correct 12 ms 23800 KB Output is correct
14 Correct 12 ms 23792 KB Output is correct
15 Correct 12 ms 23892 KB Output is correct
16 Correct 16 ms 24276 KB Output is correct
17 Correct 14 ms 24268 KB Output is correct
18 Correct 15 ms 24568 KB Output is correct
19 Correct 15 ms 24536 KB Output is correct
20 Correct 13 ms 24148 KB Output is correct
21 Correct 37 ms 24276 KB Output is correct
22 Correct 12 ms 24148 KB Output is correct
23 Correct 13 ms 24276 KB Output is correct
24 Correct 13 ms 24404 KB Output is correct
25 Correct 12 ms 23764 KB Output is correct
26 Correct 12 ms 23764 KB Output is correct
27 Correct 15 ms 24404 KB Output is correct
28 Correct 14 ms 24288 KB Output is correct
29 Correct 14 ms 24256 KB Output is correct
30 Correct 33 ms 24256 KB Output is correct
31 Correct 14 ms 24296 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 14 ms 23736 KB Output is correct
4 Correct 572 ms 80792 KB Output is correct
5 Correct 214 ms 60940 KB Output is correct
6 Correct 136 ms 55852 KB Output is correct
7 Correct 82 ms 53564 KB Output is correct
8 Correct 97 ms 58064 KB Output is correct
9 Correct 12 ms 23892 KB Output is correct
10 Correct 12 ms 23892 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 11 ms 23764 KB Output is correct
13 Correct 12 ms 23776 KB Output is correct
14 Correct 12 ms 23764 KB Output is correct
15 Correct 12 ms 23800 KB Output is correct
16 Correct 11 ms 23808 KB Output is correct
17 Correct 11 ms 23764 KB Output is correct
18 Correct 11 ms 23764 KB Output is correct
19 Correct 12 ms 23880 KB Output is correct
20 Correct 11 ms 23892 KB Output is correct
21 Correct 12 ms 23800 KB Output is correct
22 Correct 12 ms 23792 KB Output is correct
23 Correct 12 ms 23892 KB Output is correct
24 Correct 16 ms 24276 KB Output is correct
25 Correct 14 ms 24268 KB Output is correct
26 Correct 15 ms 24568 KB Output is correct
27 Correct 15 ms 24536 KB Output is correct
28 Correct 13 ms 24148 KB Output is correct
29 Correct 37 ms 24276 KB Output is correct
30 Correct 12 ms 24148 KB Output is correct
31 Correct 13 ms 24276 KB Output is correct
32 Correct 13 ms 24404 KB Output is correct
33 Correct 12 ms 23764 KB Output is correct
34 Correct 12 ms 23764 KB Output is correct
35 Correct 15 ms 24404 KB Output is correct
36 Correct 14 ms 24288 KB Output is correct
37 Correct 14 ms 24256 KB Output is correct
38 Correct 33 ms 24256 KB Output is correct
39 Correct 14 ms 24296 KB Output is correct
40 Correct 549 ms 81500 KB Output is correct
41 Correct 231 ms 62412 KB Output is correct
42 Incorrect 267 ms 81392 KB Output isn't correct
43 Halted 0 ms 0 KB -