oj.uz

답안 #890970

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890970 2023-12-22T05:43:53 Z vjudge1 Bitaro's travel (JOI23_travel) C++17
5 / 100
 3000 ms 592068 KB 
#include <bits/stdc++.h>
using namespace std;/*
<<<<It's never too late for a new beginning in your life>>>>
Today is hard
  tomorrow will worse
  but the day after tomorrow will be the sunshine..
 
HARD WORK BEATS TALENT WHEN TALENT DOESN'T WORK HARD............
Never give up  */
//The most CHALISHKANCHIK
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vii;
const long long N = 1e5+50, inf = 1e18, mod = 1e9+7;
map<pair<set<int>, int>, int> mp; 
void solve(){
	int n;
	cin >> n;
	set<int> ps, st;
	for(int i = 0; i < n; i++){
		int x;
		cin >> x;
		ps.insert(x);
	}
	st = ps;
	int q, x, ans = 0;
	cin >> q;
	while(q--){
		cin >> x;
		while(!ps.empty()){
			if(mp[{ps, x}]){
				ans+=mp[{ps, x}];
				break;
			}
			mp[{ps,x}] = ans;
			auto l = ps.lower_bound(x);
			auto r = ps.upper_bound(x);
			if(l == ps.end() || *l > *--ps.end())l--;
			if(r == ps.end() || *r > *--ps.end())r--;
			if(l == r){
				if(l != ps.begin())l--;
				else if(r != --ps.end())r++;
			}
			//~ cout << *l << ' ' << *r << ' ' << x << '\n';
			//~ cout << abs(x-*l) << ' ' << abs(*r-x) << '\n';
			if(abs(x-*l) <= abs(*r-x)){
				ans += abs(x-*l);
				x = *l;
				ps.erase(*l);
			}else{
				ans += abs(*r-x);
				x = *r;
				ps.erase(*r);
			}
			//~ for(auto i:ps)cout << i << ' ';
			//~ cout << '\n';
		}
		cout << ans << '\n';
		ans = 0;
		ps = st;
	}
}
main(){
	//~ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int t = 1;
	//~ cin >> t;
	while(t--){
		solve();
	}
}

Compilation message

travel.cpp:69:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   69 | main(){
      | ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 184 ms 94720 KB Output is correct
3 Correct 276 ms 94744 KB Output is correct
4 Correct 184 ms 94804 KB Output is correct
5 Correct 621 ms 94852 KB Output is correct
6 Correct 194 ms 94800 KB Output is correct
7 Correct 200 ms 94804 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 544 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 373 ms 94612 KB Output is correct
15 Correct 248 ms 94800 KB Output is correct
16 Correct 198 ms 94680 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 184 ms 94720 KB Output is correct
3 Correct 276 ms 94744 KB Output is correct
4 Correct 184 ms 94804 KB Output is correct
5 Correct 621 ms 94852 KB Output is correct
6 Correct 194 ms 94800 KB Output is correct
7 Correct 200 ms 94804 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 544 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 373 ms 94612 KB Output is correct
15 Correct 248 ms 94800 KB Output is correct
16 Correct 198 ms 94680 KB Output is correct
17 Execution timed out 3055 ms 592068 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

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

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 184 ms 94720 KB Output is correct
3 Correct 276 ms 94744 KB Output is correct
4 Correct 184 ms 94804 KB Output is correct
5 Correct 621 ms 94852 KB Output is correct
6 Correct 194 ms 94800 KB Output is correct
7 Correct 200 ms 94804 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 544 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 373 ms 94612 KB Output is correct
15 Correct 248 ms 94800 KB Output is correct
16 Correct 198 ms 94680 KB Output is correct
17 Execution timed out 3055 ms 592068 KB Time limit exceeded
18 Halted 0 ms 0 KB -