oj.uz

Submission #792537

# Submission time Handle Problem Language Result Execution time Memory
792537 2023-07-25T06:36:28 Z vjudge1 Bitaro's travel (JOI23_travel) C++17
15 / 100
 3000 ms 52344 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 = 2e5 + 9 , mod = 1e9 + 7;
ll c[N] = {} , d[N] = {} , a[N] = {}, b[N] = {} ;

void solve(){
    ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
    set<pair<ll,ll>>st , st1 , st2 , st3;
    cin>>n;
    for(i = 1;i <= n; i++){
        cin>>a[i];
        st.insert({a[i] , -i});
        st1.insert({a[i] , i});
    }
    cin>>q;
    st2 = st , st3 = st1;
    while(q--){
        cin>>k;
        st = st2 , st1 = st3;
        s =0;
        while(st.size()){
            x = y = -1;
            auto it = st.lower_bound({k , -1e9});
            auto it1 = st1.lower_bound({k , -1e9});
            if(it1 != st1.end())
                x = it1->se;
            if(it != st.begin()){
                it--;
                y = -it->se;
            }
            if(x != -1 && y != -1){
                if((abs(a[y] - k) < abs(a[x] - k)) || (abs(a[y] - k) == abs(a[x] - k) && y < x))
                    swap(y , x);
                s += abs(a[x] - k) , k = a[x] , st.erase({a[x] , -x}) , st1.erase({a[x] , x});
            }else {
            if(x == -1)
                swap(x , y);
            s += abs(a[x] - k) , k = a[x] , st.erase({a[x] , -x}) , st1.erase({a[x] , x});
            }
        }
        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:20: warning: unused variable 'm' [-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:43: warning: unused variable 'l' [-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:47: warning: unused variable 'r' [-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 2 ms 828 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 2 ms 828 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 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 2 ms 836 KB Output is correct
15 Correct 2 ms 832 KB Output is correct
16 Correct 2 ms 724 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 2 ms 828 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 2 ms 828 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 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 2 ms 836 KB Output is correct
15 Correct 2 ms 832 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 202 ms 52336 KB Output is correct
18 Correct 209 ms 52340 KB Output is correct
19 Correct 204 ms 52276 KB Output is correct
20 Correct 200 ms 52304 KB Output is correct
21 Correct 204 ms 52340 KB Output is correct
22 Correct 212 ms 52332 KB Output is correct
23 Correct 199 ms 52344 KB Output is correct
24 Correct 199 ms 52336 KB Output is correct
25 Correct 201 ms 52276 KB Output is correct
26 Correct 203 ms 52316 KB Output is correct
27 Correct 202 ms 52296 KB Output is correct
28 Correct 206 ms 52220 KB Output is correct
29 Correct 200 ms 52332 KB Output is correct
30 Correct 200 ms 52300 KB Output is correct
31 Correct 209 ms 52320 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 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 Execution timed out 3072 ms 52224 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 828 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 2 ms 828 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 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 2 ms 836 KB Output is correct
15 Correct 2 ms 832 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 202 ms 52336 KB Output is correct
18 Correct 209 ms 52340 KB Output is correct
19 Correct 204 ms 52276 KB Output is correct
20 Correct 200 ms 52304 KB Output is correct
21 Correct 204 ms 52340 KB Output is correct
22 Correct 212 ms 52332 KB Output is correct
23 Correct 199 ms 52344 KB Output is correct
24 Correct 199 ms 52336 KB Output is correct
25 Correct 201 ms 52276 KB Output is correct
26 Correct 203 ms 52316 KB Output is correct
27 Correct 202 ms 52296 KB Output is correct
28 Correct 206 ms 52220 KB Output is correct
29 Correct 200 ms 52332 KB Output is correct
30 Correct 200 ms 52300 KB Output is correct
31 Correct 209 ms 52320 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 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 Execution timed out 3072 ms 52224 KB Time limit exceeded
39 Halted 0 ms 0 KB -