oj.uz

답안 #890772

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890772 2023-12-22T02:48:01 Z vjudge1 Bitaro's travel (JOI23_travel) C++17
5 / 100
 3000 ms 14416 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
#define pii pair<int,int>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define f first
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const int mod= 1e9 +7;
const int N=1e5*4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}


void solve(){
	
	int n,m,k;
	cin>>n;
	vector<int>v(n);
	
	for(auto &to:v)cin>>to;
	
	cin>>m>>k;
	map<int,int>vis;
	int cnt = 0;
	int ans = 0;
	while(cnt<n){
		int mn = mod,ind = -1;
		for(auto &to:v)
			if(vis[to]==0&&umin(mn,abs(to-k)))ind = to;
		ans += mn;
		k = ind;
		vis[ind] = 1;
		cnt ++;
		//~ cout<<ind<<endl;e
	}
	cout<<ans<<endl;
	
	
	





}

 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();

}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 156 ms 348 KB Output is correct
3 Correct 160 ms 596 KB Output is correct
4 Correct 156 ms 568 KB Output is correct
5 Correct 162 ms 568 KB Output is correct
6 Correct 158 ms 348 KB Output is correct
7 Correct 157 ms 572 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 169 ms 572 KB Output is correct
15 Correct 164 ms 568 KB Output is correct
16 Correct 159 ms 344 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 156 ms 348 KB Output is correct
3 Correct 160 ms 596 KB Output is correct
4 Correct 156 ms 568 KB Output is correct
5 Correct 162 ms 568 KB Output is correct
6 Correct 158 ms 348 KB Output is correct
7 Correct 157 ms 572 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 169 ms 572 KB Output is correct
15 Correct 164 ms 568 KB Output is correct
16 Correct 159 ms 344 KB Output is correct
17 Execution timed out 3020 ms 14416 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 156 ms 348 KB Output is correct
3 Correct 160 ms 596 KB Output is correct
4 Correct 156 ms 568 KB Output is correct
5 Correct 162 ms 568 KB Output is correct
6 Correct 158 ms 348 KB Output is correct
7 Correct 157 ms 572 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 169 ms 572 KB Output is correct
15 Correct 164 ms 568 KB Output is correct
16 Correct 159 ms 344 KB Output is correct
17 Execution timed out 3020 ms 14416 KB Time limit exceeded
18 Halted 0 ms 0 KB -