oj.uz

Submission #796252

# Submission time Handle Problem Language Result Execution time Memory
796252 2023-07-28T08:22:44 Z vjudge1 Bitaro's travel (JOI23_travel) C++17
15 / 100
 3000 ms 1896 KB 

// Author : حسن

#include <bits/stdc++.h>



using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 1e6 + 9 , mod = 1e9 + 7;
ll c[N] = {} , d[N] = {} , a[N] = {}, b[N] = {} , dp[N][3];

void solve(){
    ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
    cin>>n;
    for(i = 1; i <= n; i++){
        cin>>a[i];
    }
    sort(a + 1, a + n + 1);
    a[0] = -1e11;
    a[n + 1] = 1e11;
    cin>>q;
    while(q--){
        cin>>k;
        l = 0 , r = n + 1;
        while(l + 1 < r){
            m = (l + r) / 2;
            if(a[m] <= k)
                l = m;
            else
                r = m;
        }
        x = r;
        if(k - a[l] <= a[r]-  k) x = l;
        s = abs(a[x] - k) + a[n] - a[1];
        ll l1 = x - 1, r1 = x + 1;
        while(l1 && r1 <= n){
            if(a[x] - a[l1] <= a[r1] - a[x]){
                l = 0 , r = l1;
                while(l + 1 < r){
                    m = (l + r) / 2;
                    if(a[x] - a[m] <= a[r] - a[x])
                        r = m;
                    else
                        l = m;
                }
                s += a[x] - a[r];
                x = r;
                l1 = r - 1;
            }else {
                l = r1 , r = n + 1;
                while(l + 1 < r){
                    m = (l + r) / 2;
                    if(a[x] - a[l] > a[m] - a[x])
                        l = m;
                    else
                        r = m;
                }
                s += a[l] - a[x];
                x = l;
                r1 = l + 1;
            }
        }
        cout<<s<<"\n";
    }

}

int main(){

     TL;
     /*
     #ifndef ONLINE_JUDGE
     freopen("input.txt", "r", stdin);
     freopen("output.txt", "w", stdout);
     #endif
     */
int t = 1;
//cin>>t;

while(t--)
     {
     solve();
     }

}
// Author : حسن

Compilation message

travel.cpp: In function 'void solve()':
travel.cpp:31:16: warning: unused variable 'j' [-Wunused-variable]
   31 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                ^
travel.cpp:31:28: warning: unused variable 'z' [-Wunused-variable]
   31 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                            ^
travel.cpp:31:40: warning: unused variable 'f' [-Wunused-variable]
   31 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                        ^
travel.cpp:31:59: warning: unused variable 'y' [-Wunused-variable]
   31 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                           ^
travel.cpp:31:63: warning: unused variable 'mn' [-Wunused-variable]
   31 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                               ^~
travel.cpp:31:76: warning: unused variable 'mx' [-Wunused-variable]
   31 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                                            ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 280 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 280 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 23 ms 1856 KB Output is correct
18 Correct 21 ms 1876 KB Output is correct
19 Correct 33 ms 1876 KB Output is correct
20 Correct 23 ms 1896 KB Output is correct
21 Correct 19 ms 1872 KB Output is correct
22 Correct 22 ms 1896 KB Output is correct
23 Correct 30 ms 1892 KB Output is correct
24 Correct 20 ms 1816 KB Output is correct
25 Correct 20 ms 1852 KB Output is correct
26 Correct 23 ms 1896 KB Output is correct
27 Correct 20 ms 1852 KB Output is correct
28 Correct 24 ms 1896 KB Output is correct
29 Correct 20 ms 1876 KB Output is correct
30 Correct 20 ms 1836 KB Output is correct
31 Correct 20 ms 1800 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Execution timed out 3077 ms 1896 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 280 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 23 ms 1856 KB Output is correct
18 Correct 21 ms 1876 KB Output is correct
19 Correct 33 ms 1876 KB Output is correct
20 Correct 23 ms 1896 KB Output is correct
21 Correct 19 ms 1872 KB Output is correct
22 Correct 22 ms 1896 KB Output is correct
23 Correct 30 ms 1892 KB Output is correct
24 Correct 20 ms 1816 KB Output is correct
25 Correct 20 ms 1852 KB Output is correct
26 Correct 23 ms 1896 KB Output is correct
27 Correct 20 ms 1852 KB Output is correct
28 Correct 24 ms 1896 KB Output is correct
29 Correct 20 ms 1876 KB Output is correct
30 Correct 20 ms 1836 KB Output is correct
31 Correct 20 ms 1800 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Execution timed out 3077 ms 1896 KB Time limit exceeded
39 Halted 0 ms 0 KB -