# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
890768 | vjudge1 | Bitaro's travel (JOI23_travel) | C++17 | 19 ms | 4696 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
bool YES(bool f){ if(f) cout << "Yes\n" ; else cout << "No\n" ; return f ; }
void YES(){cout << "Yes\n" ;}
void NO(){cout << "No\n" ;}
void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define all(x) x.begin() , x.end()
#define ld long double
#define pii pair <int , int>
#define ff first
#define ss second
#define endl '\n'
const int N = 2e6 + 5 ;
const int inf = 1e18 ;
const int mod = 1e9 + 7 ;
const double eps = 1e-8 ;
int binpow( int a , int b ){
if ( b == 0 ) return 1 ;
int x = binpow ( a , b/2 ) ;
if ( !(b%2) ) return (x*x) ;
return (x*x*a) ;
}
template <class T>
bool chmax( T& x , const T& y ){
bool f = 0 ;
if ( x < y ) x = y , f = 1 ;
return f ;
}
template <class T>
bool chmin( T &x , const T &y ){
bool f = 0 ;
if ( x > y ) x = y , f = 1 ;
return f ;
}
//code
int n , m , ans , q ;
int a[N] , b[N] , s[N] ;
void solve(){
cin >> n ;
for ( int i = 0 ; i < n ; i ++ ) cin >> a[i] ;
cin >> q ;
for ( int i = 0 ; i < q ; i ++ ) cin >> b[i] ;
int l = 0 , r = 0 , cur = b[0] ;
a[n] = inf ;
while ( r < n && a[r] < b[0] ) r ++ ;
l = r-1 ;
while ( l != -1 || r != n ){
//cout << cur << ' ' << l << " " << r << endl ;
if ( l == -1 ){
ans += a[r]-cur ;
cur = a[r] ;
r ++ ;
continue ;
}
if ( r == n ){
ans += cur-a[l] ;
cur = a[l] ;
l -- ;
continue ;
}
if ( a[r]-cur < cur-a[l] ){
ans += a[r]-cur ;
cur = a[r] ;
r ++ ;
continue ;
}
else{
ans += cur-a[l] ;
cur = a[l] ;
l -- ;
continue ;
}
}
cout << ans ;
}
signed main(){
ios ;
int t = 1 ;
//cin >> t ;
while ( t -- ) solve() ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |