oj.uz

Submission #890768

# Submission time Handle Problem Language Result Execution time Memory
890768 2023-12-22T02:42:37 Z vjudge1 Bitaro's travel (JOI23_travel) C++17
15 / 100
 19 ms 4696 KB 
#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

travel.cpp: In function 'void fopn(std::string)':
travel.cpp:10:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
travel.cpp:10:72: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 17 ms 4444 KB Output is correct
18 Correct 19 ms 4560 KB Output is correct
19 Correct 15 ms 4444 KB Output is correct
20 Correct 15 ms 4564 KB Output is correct
21 Correct 15 ms 4444 KB Output is correct
22 Correct 15 ms 4444 KB Output is correct
23 Correct 16 ms 4560 KB Output is correct
24 Correct 17 ms 4572 KB Output is correct
25 Correct 19 ms 4444 KB Output is correct
26 Correct 15 ms 4444 KB Output is correct
27 Correct 17 ms 4564 KB Output is correct
28 Correct 15 ms 4560 KB Output is correct
29 Correct 15 ms 4444 KB Output is correct
30 Correct 19 ms 4696 KB Output is correct
31 Correct 14 ms 4440 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Incorrect 1 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 17 ms 4444 KB Output is correct
18 Correct 19 ms 4560 KB Output is correct
19 Correct 15 ms 4444 KB Output is correct
20 Correct 15 ms 4564 KB Output is correct
21 Correct 15 ms 4444 KB Output is correct
22 Correct 15 ms 4444 KB Output is correct
23 Correct 16 ms 4560 KB Output is correct
24 Correct 17 ms 4572 KB Output is correct
25 Correct 19 ms 4444 KB Output is correct
26 Correct 15 ms 4444 KB Output is correct
27 Correct 17 ms 4564 KB Output is correct
28 Correct 15 ms 4560 KB Output is correct
29 Correct 15 ms 4444 KB Output is correct
30 Correct 19 ms 4696 KB Output is correct
31 Correct 14 ms 4440 KB Output is correct
32 Correct 1 ms 4440 KB Output is correct
33 Incorrect 1 ms 4444 KB Output isn't correct
34 Halted 0 ms 0 KB -