oj.uz

Submission #959727

# Submission time Handle Problem Language Result Execution time Memory
959727 2024-04-09T01:17:34 Z VinhLuu Passport (JOI23_passport) C++17
48 / 100
 2000 ms 172480 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O2,O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <bits/stdc++.h>
//#define int long long
//#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()

using namespace std;

typedef pair<int,int> pii;
//typedef tuple<int,int,int> tp;
const int N = 1e6 + 5;
//const int mod = 1e9 + 7;
const int oo = 1e8;

int n, L[N], R[N], h[N << 2], id[N], f[N << 2];
vector<pii> p[N << 2];

void build(int i,int l,int r){
    if(l == r){
        id[l] = i;
        h[i] = 1;

        return;
    }
    int mid = (l + r) / 2;
    build(i << 1, l, mid);
    build(i << 1|1, mid + 1, r);
    p[i << 1].pb({i, 0});
    p[i << 1|1].pb({i, 0});
}

void update(int i,int l,int r,int u,int v,int x){
    if(l > r || l > v || r < u) return;
    if(u <= l && r <= v){
        p[i].pb({id[x], 1});
        return;
    }
    int mid = (l + r) / 2;
    update(i << 1, l, mid, u, v, x);
    update(i << 1|1, mid + 1, r, u, v, x);
}

int d[N << 2][5];

void cal(int u,int j){
    for(int i = 1; i <= 4 * n; i ++) d[i][j] = oo;
    d[id[u]][j] = 0;
    queue<int> q; q.push(id[u]);
    while(!q.empty()){
        int u = q.front();
        q.pop();
        for(auto [v, w] : p[u]) if(d[u][j] + w < d[v][j]){
            d[v][j] = d[u][j] + w;
            q.push(v);
        }
    }
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define task "v"
    if(fopen(task ".inp","r")){
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }

    cin >> n;
    build(1, 1, n);
    for(int i = 1; i <= n; i ++){
        cin >> L[i] >> R[i];
        update(1, 1, n, L[i], R[i], i);
    }
    cal(1, 0);
    cal(n, 1);
    queue<pii> pq;
    for(int i = 1; i <= 4 * n; i ++){
        if(id[1] == i || id[n] == i) f[i] = d[i][1] + d[i][0];
        else f[i] = d[i][1] + d[i][0] - h[i];
        pq.push({f[i], i});
    }
    while(!pq.empty()){
        int w = pq.front().fi;
        int u = pq.front().se;
        pq.pop();
        if(w > f[u]) continue;
        for(auto [v, g] : p[u]) if(w + g < f[v]) pq.push({f[v] = w + g, v});
    }
    int q;
    cin >> q;
    while(q--){
        int x; cin >> x;
        cout << (f[id[x]] >= oo ? -1 : f[id[x]]) << "\n";
    }
}

Compilation message

passport.cpp: In function 'int main()':
passport.cpp:71:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |         freopen(task ".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
passport.cpp:72:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         freopen(task ".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 102996 KB Output is correct
2 Correct 29 ms 103000 KB Output is correct
3 Correct 28 ms 102948 KB Output is correct
4 Correct 800 ms 172480 KB Output is correct
5 Execution timed out 2033 ms 143516 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 103004 KB Output is correct
2 Correct 31 ms 103000 KB Output is correct
3 Correct 27 ms 103004 KB Output is correct
4 Correct 29 ms 102984 KB Output is correct
5 Correct 27 ms 103004 KB Output is correct
6 Correct 28 ms 102956 KB Output is correct
7 Correct 28 ms 103004 KB Output is correct
8 Correct 28 ms 102936 KB Output is correct
9 Correct 28 ms 103040 KB Output is correct
10 Correct 32 ms 102996 KB Output is correct
11 Correct 27 ms 103000 KB Output is correct
12 Correct 27 ms 102968 KB Output is correct
13 Correct 28 ms 103004 KB Output is correct
14 Correct 27 ms 102976 KB Output is correct
15 Correct 29 ms 102940 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 103004 KB Output is correct
2 Correct 31 ms 103000 KB Output is correct
3 Correct 27 ms 103004 KB Output is correct
4 Correct 29 ms 102984 KB Output is correct
5 Correct 27 ms 103004 KB Output is correct
6 Correct 28 ms 102956 KB Output is correct
7 Correct 28 ms 103004 KB Output is correct
8 Correct 28 ms 102936 KB Output is correct
9 Correct 28 ms 103040 KB Output is correct
10 Correct 32 ms 102996 KB Output is correct
11 Correct 27 ms 103000 KB Output is correct
12 Correct 27 ms 102968 KB Output is correct
13 Correct 28 ms 103004 KB Output is correct
14 Correct 27 ms 102976 KB Output is correct
15 Correct 29 ms 102940 KB Output is correct
16 Correct 30 ms 105560 KB Output is correct
17 Correct 32 ms 105552 KB Output is correct
18 Correct 34 ms 105848 KB Output is correct
19 Correct 31 ms 105676 KB Output is correct
20 Correct 29 ms 105564 KB Output is correct
21 Correct 55 ms 105564 KB Output is correct
22 Correct 29 ms 105308 KB Output is correct
23 Correct 30 ms 105632 KB Output is correct
24 Correct 31 ms 105564 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 103004 KB Output is correct
2 Correct 31 ms 103000 KB Output is correct
3 Correct 27 ms 103004 KB Output is correct
4 Correct 29 ms 102984 KB Output is correct
5 Correct 27 ms 103004 KB Output is correct
6 Correct 28 ms 102956 KB Output is correct
7 Correct 28 ms 103004 KB Output is correct
8 Correct 28 ms 102936 KB Output is correct
9 Correct 28 ms 103040 KB Output is correct
10 Correct 32 ms 102996 KB Output is correct
11 Correct 27 ms 103000 KB Output is correct
12 Correct 27 ms 102968 KB Output is correct
13 Correct 28 ms 103004 KB Output is correct
14 Correct 27 ms 102976 KB Output is correct
15 Correct 29 ms 102940 KB Output is correct
16 Correct 30 ms 105560 KB Output is correct
17 Correct 32 ms 105552 KB Output is correct
18 Correct 34 ms 105848 KB Output is correct
19 Correct 31 ms 105676 KB Output is correct
20 Correct 29 ms 105564 KB Output is correct
21 Correct 55 ms 105564 KB Output is correct
22 Correct 29 ms 105308 KB Output is correct
23 Correct 30 ms 105632 KB Output is correct
24 Correct 31 ms 105564 KB Output is correct
25 Correct 27 ms 103004 KB Output is correct
26 Correct 28 ms 103056 KB Output is correct
27 Correct 31 ms 105564 KB Output is correct
28 Correct 31 ms 105616 KB Output is correct
29 Correct 29 ms 105584 KB Output is correct
30 Correct 56 ms 105592 KB Output is correct
31 Correct 30 ms 105604 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 102996 KB Output is correct
2 Correct 29 ms 103000 KB Output is correct
3 Correct 28 ms 102948 KB Output is correct
4 Correct 800 ms 172480 KB Output is correct
5 Execution timed out 2033 ms 143516 KB Time limit exceeded
6 Halted 0 ms 0 KB -