oj.uz

Submission #964980

# Submission time Handle Problem Language Result Execution time Memory
964980 2024-04-17T23:01:30 Z MarwenElarbi Bitaro's travel (JOI23_travel) C++17
15 / 100
 502 ms 34936 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define onbit __builtin_popcount
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e18
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll MOD = 1e9+7;
const int nax = 2e5+5;
const int MAX_VAL = 1e6+1;
double PI=3.14159265359;
int arx[8]={1,0,0,-1,-1,-1, 1, 1};
int ary[8]={0,1,-1, 0, 1,-1,-1, 1};
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
vector<int> tab(nax);
vector<int> nl(nax);
vector<int> nr(nax);
int lg[nax];
int spr[nax][19];
int spl[nax][19];
int ask_left(int l,int r){
    int cur=lg[r-l];
    return min(spl[l][cur],spl[r-(1<<cur)+1][cur]);
}
int ask_right(int l,int r){
    int cur=lg[r-l];
    //cout <<"ask"<<" "<<l<<" "<<r<<" "<<max(spr[l][cur],spr[r-(1<<cur)+1][cur])<<endl;
    //cout <<l<<" "<<r<<" "<<spr[1][cur]<<" "<<cur<<endl;
    return max(spr[l][cur],spr[r-(1<<cur)+1][cur]);
}
int main(){
    optimise;
    //setIO("dec");
    lg[1]=0;
    for (int i = 2; i < nax; ++i)
    {
        lg[i]=lg[i/2]+1;
    }
    int n;
    cin>>n;
    tab.resize(n);
    for (int i = 0; i < n; ++i)
    {
        cin>>tab[i];
    }
    nr[0]=tab[n-1];
    nl[n-1]=tab[0];
    spr[0][0]=nr[0];
    spl[n-1][0]=nl[0];
    for (int i = 0; i < n-1; ++i)
    {
        int cur=tab[i+1]-tab[i];
        int l=-1;
        int r=i;
        while(r-l>1){
            int mid=(r+l)/2;
            if(tab[i]-tab[mid]>=cur) l=mid;
            else r=mid; 
        }
        nl[i]=tab[r];
        spl[i][0]=nl[i];
        //cout <<nl[i]<<" ";
    }//cout <<endl;
    for (int i = n-1; i > 0; --i)
    {
        int cur=tab[i]-tab[i-1];
        int l=i;
        int r=n;
        while(r-l>1){
            int mid=(r+l)/2;
            if(tab[mid]-tab[i]<cur) l=mid;
            else r=mid; 
        }
        nr[i]=tab[l];
        spr[i][0]=nr[i];
        //if(i==132) cout <<nr[i]<<endl;
        //cout <<nr[i]<<" ";
    }//cout <<endl;
    for (int i = 1; i < 19; ++i)
    {
        //cout <<"3asba"<<endl;
        for (int j = 0; j+(1<<i) < n; ++j)
        {
            spl[j][i]=min(spl[j][i-1],spl[j+(1<<(i-1))][i-1]);
        }
        for (int j = 0; j+(1<<i)< n; j++)
        {
            spr[j][i]=max(spr[j][i-1],spr[j+(1<<(i-1))][i-1]);
        }
    }
    //cout <<spl[1000][0]<<" "<<nl[1000]<<endl;
    //cout <<ask_left(1000,1000)<<endl;
    int q;
    cin>>q;
    while(q--){
        //out <<"nea"<<endl;
        int x;
        cin>>x;
        long long ans=0;
        if(x>=tab[n-1]){
            cout <<x-tab[0]<<endl;
            continue;
        }else if(x<=tab[0]){
            cout <<tab[n-1]-x<<endl;
            continue;
        }
        int idx=upper_bound(tab.begin(),tab.end(),x)-tab.begin();
        bool test=false;
        if(tab[idx-1]==x) test=true;
        int cur;
        if(tab[idx]-x<x-tab[idx-1-test]){
            cur=1;
        }else{
            idx--;
            cur=0;
        }
        //cout <<idx<<endl;
        int lefty=x;
        int righty=x;
        while(lefty>tab[0]&&righty<tab[n-1]){
            //cout <<"new "<<lefty<<" "<<righty<<" "<<cur<<endl;
            if(cur==1){
                int l=idx-1;
                int r=n-1;
                while(r-l>1){
                    int mid=(r+l)/2;
                    if(ask_left(idx,mid)>=lefty) l=mid;
                    else r=mid;
                }
                //cout <<idx<<" "<<nl[r]<<" "<<lefty<<" "<<ask_left(idx,r)<<endl;
                ans+=tab[r]-lefty;
                righty=tab[r];
                idx=r;
                cur=0;
            }else{
                int l=0;
                int r=idx+1;
                while(r-l>1){
                    int mid=(r+l)/2;
                    if(ask_right(mid,idx)<=righty) r=mid;
                    else l=mid;
                    //cout <<ask_right(649,idx)<<" "<<l<<" "<<r<<endl;
                }
                //cout <<spr[idx][0]<<" "<<idx<<" "<<ask_right(l,idx)<<" "<<righty<<endl;
                ans+=righty-tab[l];
                lefty=tab[l];
                idx=l;
                cur=1;
            }
            //cout <<lefty<<" "<<ri if(!t--) break;
        }
        //cout <<ans<<" "<<lefty<<" "<<righty<<endl;
        if(righty<tab[n-1]) ans+=tab[n-1]-lefty;
        if(lefty>tab[0]) ans+=righty-tab[0];
        cout << ans<<endl;
    }
}

Compilation message

travel.cpp: In function 'void setIO(std::string)':
travel.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
travel.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5464 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5572 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 2 ms 5976 KB Output is correct
6 Correct 2 ms 5724 KB Output is correct
7 Correct 2 ms 5724 KB Output is correct
8 Correct 2 ms 5468 KB Output is correct
9 Correct 2 ms 5468 KB Output is correct
10 Correct 2 ms 5468 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 2 ms 5468 KB Output is correct
13 Correct 2 ms 5468 KB Output is correct
14 Correct 2 ms 5724 KB Output is correct
15 Correct 3 ms 5724 KB Output is correct
16 Correct 2 ms 5724 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5464 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5572 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 2 ms 5976 KB Output is correct
6 Correct 2 ms 5724 KB Output is correct
7 Correct 2 ms 5724 KB Output is correct
8 Correct 2 ms 5468 KB Output is correct
9 Correct 2 ms 5468 KB Output is correct
10 Correct 2 ms 5468 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 2 ms 5468 KB Output is correct
13 Correct 2 ms 5468 KB Output is correct
14 Correct 2 ms 5724 KB Output is correct
15 Correct 3 ms 5724 KB Output is correct
16 Correct 2 ms 5724 KB Output is correct
17 Correct 82 ms 33336 KB Output is correct
18 Correct 78 ms 33252 KB Output is correct
19 Correct 84 ms 33340 KB Output is correct
20 Correct 82 ms 33108 KB Output is correct
21 Correct 92 ms 33340 KB Output is correct
22 Correct 82 ms 33104 KB Output is correct
23 Correct 86 ms 33336 KB Output is correct
24 Correct 78 ms 33308 KB Output is correct
25 Correct 76 ms 33304 KB Output is correct
26 Correct 77 ms 33332 KB Output is correct
27 Correct 77 ms 33332 KB Output is correct
28 Correct 82 ms 33340 KB Output is correct
29 Correct 77 ms 33340 KB Output is correct
30 Correct 80 ms 33468 KB Output is correct
31 Correct 77 ms 33340 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5468 KB Output is correct
2 Correct 2 ms 5464 KB Output is correct
3 Correct 2 ms 5464 KB Output is correct
4 Correct 2 ms 5464 KB Output is correct
5 Correct 3 ms 5468 KB Output is correct
6 Correct 2 ms 5468 KB Output is correct
7 Correct 434 ms 34516 KB Output is correct
8 Correct 431 ms 34736 KB Output is correct
9 Correct 435 ms 34688 KB Output is correct
10 Correct 441 ms 34936 KB Output is correct
11 Correct 429 ms 34672 KB Output is correct
12 Correct 436 ms 34608 KB Output is correct
13 Correct 262 ms 7524 KB Output is correct
14 Correct 241 ms 6008 KB Output is correct
15 Incorrect 502 ms 34896 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5464 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5572 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 2 ms 5976 KB Output is correct
6 Correct 2 ms 5724 KB Output is correct
7 Correct 2 ms 5724 KB Output is correct
8 Correct 2 ms 5468 KB Output is correct
9 Correct 2 ms 5468 KB Output is correct
10 Correct 2 ms 5468 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 2 ms 5468 KB Output is correct
13 Correct 2 ms 5468 KB Output is correct
14 Correct 2 ms 5724 KB Output is correct
15 Correct 3 ms 5724 KB Output is correct
16 Correct 2 ms 5724 KB Output is correct
17 Correct 82 ms 33336 KB Output is correct
18 Correct 78 ms 33252 KB Output is correct
19 Correct 84 ms 33340 KB Output is correct
20 Correct 82 ms 33108 KB Output is correct
21 Correct 92 ms 33340 KB Output is correct
22 Correct 82 ms 33104 KB Output is correct
23 Correct 86 ms 33336 KB Output is correct
24 Correct 78 ms 33308 KB Output is correct
25 Correct 76 ms 33304 KB Output is correct
26 Correct 77 ms 33332 KB Output is correct
27 Correct 77 ms 33332 KB Output is correct
28 Correct 82 ms 33340 KB Output is correct
29 Correct 77 ms 33340 KB Output is correct
30 Correct 80 ms 33468 KB Output is correct
31 Correct 77 ms 33340 KB Output is correct
32 Correct 2 ms 5468 KB Output is correct
33 Correct 2 ms 5464 KB Output is correct
34 Correct 2 ms 5464 KB Output is correct
35 Correct 2 ms 5464 KB Output is correct
36 Correct 3 ms 5468 KB Output is correct
37 Correct 2 ms 5468 KB Output is correct
38 Correct 434 ms 34516 KB Output is correct
39 Correct 431 ms 34736 KB Output is correct
40 Correct 435 ms 34688 KB Output is correct
41 Correct 441 ms 34936 KB Output is correct
42 Correct 429 ms 34672 KB Output is correct
43 Correct 436 ms 34608 KB Output is correct
44 Correct 262 ms 7524 KB Output is correct
45 Correct 241 ms 6008 KB Output is correct
46 Incorrect 502 ms 34896 KB Output isn't correct
47 Halted 0 ms 0 KB -