oj.uz

Submission #889830

# Submission time Handle Problem Language Result Execution time Memory
889830 2023-12-20T07:44:59 Z thunopro Bitaro's travel (JOI23_travel) C++14
15 / 100
 76 ms 12740 KB 
#include<bits/stdc++.h>
using namespace std ;
#define maxn 200009 
#define ll long long
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 

const int mod = 1e9+7 ; 
const int INF = 1e9 ; 
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef vector<ll> vl ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 
typedef pair<ll,ll> pll ;  

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a < 0 ) a += mod ; 
	if ( a >= mod ) a -= mod ; 
}

template < typename T > void chkmin (T &a , T b) { if (a>b) a=b ;} 
template < typename T > void chkmax (T &a , T b) { if (a<b) a=b ;}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ; 
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow(a,n/2) ;
	if ( n % 2 ) return (1ll*res*res%mod*a%mod) ; 
	else return 1ll*res*res%mod ; 
}

int n , nq  ; 
int a [maxn] ; 
int query [maxn] ; 

void sub1 () 
{
	set <int> S ; 
	for ( int i = 1 ; i <= n ; i ++ ) S.insert(a[i]) ; 
	ll res = 0 ; 
	int pos = query [1] ; 
	while ( true ) 
	{
		int des = 2*INF ; 
		auto it = S.lower_bound(pos) ; 
		if ( it!=S.end() && *it - pos < des - pos ) des = *it ; 
		if ( it!=S.begin() && pos - *(--it) <= des - pos ) des = *it ; 	
		res += abs (des-pos) ; 
		pos = des ; 
		S.erase(pos) ; 
		if ( S.empty() ) break ; 
	}
	cout << res ; 
}
int main () 
{
	ios_base::sync_with_stdio(0) ; 
	cin.tie(0) ; cout.tie(0) ; 
//	rf () ; 
	cin >> n ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i] ; 
	
	cin >> nq ;
	for ( int i = 1 ; i <= nq ; i ++ ) cin >> query [i] ; 
	
	if ( nq == 1 ) sub1 () ; 
}

Compilation message

travel.cpp: In function 'void rf()':
travel.cpp:34:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 356 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 476 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 356 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 476 KB Output is correct
17 Correct 60 ms 12516 KB Output is correct
18 Correct 70 ms 12368 KB Output is correct
19 Correct 58 ms 12368 KB Output is correct
20 Correct 60 ms 12368 KB Output is correct
21 Correct 70 ms 12740 KB Output is correct
22 Correct 76 ms 12368 KB Output is correct
23 Correct 59 ms 12428 KB Output is correct
24 Correct 66 ms 12372 KB Output is correct
25 Correct 67 ms 12372 KB Output is correct
26 Correct 71 ms 12324 KB Output is correct
27 Correct 70 ms 12368 KB Output is correct
28 Correct 68 ms 12372 KB Output is correct
29 Correct 64 ms 12500 KB Output is correct
30 Correct 64 ms 12368 KB Output is correct
31 Correct 64 ms 12456 KB Output is correct

Subtask #3
0 / 30.0

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

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 356 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 476 KB Output is correct
17 Correct 60 ms 12516 KB Output is correct
18 Correct 70 ms 12368 KB Output is correct
19 Correct 58 ms 12368 KB Output is correct
20 Correct 60 ms 12368 KB Output is correct
21 Correct 70 ms 12740 KB Output is correct
22 Correct 76 ms 12368 KB Output is correct
23 Correct 59 ms 12428 KB Output is correct
24 Correct 66 ms 12372 KB Output is correct
25 Correct 67 ms 12372 KB Output is correct
26 Correct 71 ms 12324 KB Output is correct
27 Correct 70 ms 12368 KB Output is correct
28 Correct 68 ms 12372 KB Output is correct
29 Correct 64 ms 12500 KB Output is correct
30 Correct 64 ms 12368 KB Output is correct
31 Correct 64 ms 12456 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Incorrect 0 ms 344 KB Output isn't correct
34 Halted 0 ms 0 KB -