oj.uz

Submission #796267

# Submission time Handle Problem Language Result Execution time Memory
796267 2023-07-28T08:37:27 Z vjudge1 Bitaro's travel (JOI23_travel) C++17
100 / 100
 386 ms 4180 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] = -1e18;
    a[n + 1] = 1e18;
    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 > 0 && 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[r1] - 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[l1] > 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 1 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 0 ms 212 KB Output is correct
9 Correct 0 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 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 212 KB Output is correct
9 Correct 0 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 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 18 ms 1868 KB Output is correct
18 Correct 18 ms 1808 KB Output is correct
19 Correct 18 ms 1856 KB Output is correct
20 Correct 18 ms 1876 KB Output is correct
21 Correct 18 ms 1876 KB Output is correct
22 Correct 18 ms 1776 KB Output is correct
23 Correct 18 ms 1876 KB Output is correct
24 Correct 18 ms 1896 KB Output is correct
25 Correct 18 ms 1784 KB Output is correct
26 Correct 18 ms 1876 KB Output is correct
27 Correct 18 ms 1868 KB Output is correct
28 Correct 18 ms 1876 KB Output is correct
29 Correct 24 ms 1996 KB Output is correct
30 Correct 18 ms 1764 KB Output is correct
31 Correct 20 ms 1820 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 322 ms 3180 KB Output is correct
8 Correct 307 ms 3244 KB Output is correct
9 Correct 305 ms 3228 KB Output is correct
10 Correct 308 ms 3200 KB Output is correct
11 Correct 308 ms 3272 KB Output is correct
12 Correct 313 ms 3328 KB Output is correct
13 Correct 31 ms 2272 KB Output is correct
14 Correct 27 ms 852 KB Output is correct
15 Correct 218 ms 3660 KB Output is correct
16 Correct 215 ms 3648 KB Output is correct
17 Correct 211 ms 3568 KB Output is correct
18 Correct 32 ms 2196 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 212 KB Output is correct
9 Correct 0 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 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 18 ms 1868 KB Output is correct
18 Correct 18 ms 1808 KB Output is correct
19 Correct 18 ms 1856 KB Output is correct
20 Correct 18 ms 1876 KB Output is correct
21 Correct 18 ms 1876 KB Output is correct
22 Correct 18 ms 1776 KB Output is correct
23 Correct 18 ms 1876 KB Output is correct
24 Correct 18 ms 1896 KB Output is correct
25 Correct 18 ms 1784 KB Output is correct
26 Correct 18 ms 1876 KB Output is correct
27 Correct 18 ms 1868 KB Output is correct
28 Correct 18 ms 1876 KB Output is correct
29 Correct 24 ms 1996 KB Output is correct
30 Correct 18 ms 1764 KB Output is correct
31 Correct 20 ms 1820 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 322 ms 3180 KB Output is correct
39 Correct 307 ms 3244 KB Output is correct
40 Correct 305 ms 3228 KB Output is correct
41 Correct 308 ms 3200 KB Output is correct
42 Correct 308 ms 3272 KB Output is correct
43 Correct 313 ms 3328 KB Output is correct
44 Correct 31 ms 2272 KB Output is correct
45 Correct 27 ms 852 KB Output is correct
46 Correct 218 ms 3660 KB Output is correct
47 Correct 215 ms 3648 KB Output is correct
48 Correct 211 ms 3568 KB Output is correct
49 Correct 32 ms 2196 KB Output is correct
50 Correct 345 ms 4180 KB Output is correct
51 Correct 279 ms 4028 KB Output is correct
52 Correct 229 ms 3996 KB Output is correct
53 Correct 377 ms 4100 KB Output is correct
54 Correct 384 ms 4080 KB Output is correct
55 Correct 386 ms 4012 KB Output is correct
56 Correct 60 ms 3968 KB Output is correct
57 Correct 63 ms 4016 KB Output is correct
58 Correct 61 ms 3944 KB Output is correct