oj.uz

답안 #890936

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890936 2023-12-22T05:22:51 Z vjudge1 Bitaro's travel (JOI23_travel) C++17
15 / 100
 70 ms 9828 KB 
#include <bits/stdc++.h>
 
#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
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;

void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
 
const int inf = 1e18;

void solve(){

}
 
main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
	int n;
	cin >> n;
	multiset <int> st;
	for(int i = 0; i < n; i++){
		int x;
		cin >> x;
		st.insert(x);
	}
	st.insert(-inf);
	st.insert(inf);
	int q;
	cin >> q;
	while(q--){
		int x;
		cin >> x;
		int res = 0;
		while(st.size() > 2){
			auto it = st.upper_bound(x);
			auto it2 = st.upper_bound(x);
			it2--;
			res += min(abs(x - *it), abs(x - *it2));
			if(abs(x - *it) < abs(x - *it2)){
				st.erase(it);
				x = *it;
			}else{
				st.erase(it2);
				x = *it2;
			}
		}
		cout << res << endl;
	}
	
}	
/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

travel.cpp:25:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   25 | main(){
      | ^~~~
travel.cpp: In function 'void fp(std::string)':
travel.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
travel.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 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 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 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 344 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 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 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 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 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 344 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 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 62 ms 9820 KB Output is correct
18 Correct 69 ms 9828 KB Output is correct
19 Correct 59 ms 9748 KB Output is correct
20 Correct 62 ms 9696 KB Output is correct
21 Correct 64 ms 9820 KB Output is correct
22 Correct 67 ms 9816 KB Output is correct
23 Correct 66 ms 9812 KB Output is correct
24 Correct 64 ms 9636 KB Output is correct
25 Correct 70 ms 9804 KB Output is correct
26 Correct 66 ms 9808 KB Output is correct
27 Correct 67 ms 9780 KB Output is correct
28 Correct 66 ms 9812 KB Output is correct
29 Correct 64 ms 9808 KB Output is correct
30 Correct 62 ms 9808 KB Output is correct
31 Correct 64 ms 9704 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
2 Correct 1 ms 348 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 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 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 344 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 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 62 ms 9820 KB Output is correct
18 Correct 69 ms 9828 KB Output is correct
19 Correct 59 ms 9748 KB Output is correct
20 Correct 62 ms 9696 KB Output is correct
21 Correct 64 ms 9820 KB Output is correct
22 Correct 67 ms 9816 KB Output is correct
23 Correct 66 ms 9812 KB Output is correct
24 Correct 64 ms 9636 KB Output is correct
25 Correct 70 ms 9804 KB Output is correct
26 Correct 66 ms 9808 KB Output is correct
27 Correct 67 ms 9780 KB Output is correct
28 Correct 66 ms 9812 KB Output is correct
29 Correct 64 ms 9808 KB Output is correct
30 Correct 62 ms 9808 KB Output is correct
31 Correct 64 ms 9704 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Incorrect 0 ms 348 KB Output isn't correct
34 Halted 0 ms 0 KB -