oj.uz

답안 #890771

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890771 2023-12-22T02:47:36 Z vjudge1 Bitaro's travel (JOI23_travel) C++17
15 / 100
 3000 ms 9904 KB 
#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define mpa make_pair
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define bc back()
#define ar array
#define vll vector<ll> 
using namespace std;/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;*/
template <class _T>
bool chmin(_T &x, const _T &y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template <class _T>
bool chmax(_T &x, const _T &y){
    bool flag=false;
    if (x<y){
        x=y;flag|=true;
    }
    return flag;
}
//#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=2e18+7;
const ll mod=1e9+7;
const ll N=1e5+7;
const ld eps=1e-9;
void solve(){
	ll i,j,q;
	ll n,b;
	cin>>n;
	set<ll> st;
	for(i=1;i<=n;i++){
		cin>>b;
		st.ins(b);
	}
	cin>>q;
	ll sum=0;
	for(i=0;i<q;i++){
		cin>>b;
		sum=0;
		ll x=inf,y=inf;
		for(j=0;j<n;j++){
			x=inf,y=inf;
			auto up=st.ub(b);
			if(up!=st.end())x=abs(*up-b);
			if(up!=st.begin())y=abs(b-*(--up));
			if(x<y){
				sum+=x;
				ll x=*st.ub(b);
				st.erase(st.ub(b));
				b=x;
			}else{
				sum+=y;
				b=*up;
				st.erase(up);
			}
		}
		cout<<sum<<endl;
	}
}
signed main(){
	//start();
    ll t=1;
	//cin>>t;
    while(t--) solve();
    return 0;
}
/*
1
6
5 4 3 2 1 0





*/

Compilation message

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 468 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 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 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 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 348 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 468 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 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 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 104 ms 9644 KB Output is correct
18 Correct 107 ms 9688 KB Output is correct
19 Correct 101 ms 9556 KB Output is correct
20 Correct 128 ms 9808 KB Output is correct
21 Correct 104 ms 9556 KB Output is correct
22 Correct 113 ms 9628 KB Output is correct
23 Correct 103 ms 9756 KB Output is correct
24 Correct 103 ms 9556 KB Output is correct
25 Correct 108 ms 9800 KB Output is correct
26 Correct 108 ms 9556 KB Output is correct
27 Correct 106 ms 9608 KB Output is correct
28 Correct 117 ms 9904 KB Output is correct
29 Correct 107 ms 9596 KB Output is correct
30 Correct 104 ms 9668 KB Output is correct
31 Correct 106 ms 9556 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 3077 ms 348 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 468 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 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 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 104 ms 9644 KB Output is correct
18 Correct 107 ms 9688 KB Output is correct
19 Correct 101 ms 9556 KB Output is correct
20 Correct 128 ms 9808 KB Output is correct
21 Correct 104 ms 9556 KB Output is correct
22 Correct 113 ms 9628 KB Output is correct
23 Correct 103 ms 9756 KB Output is correct
24 Correct 103 ms 9556 KB Output is correct
25 Correct 108 ms 9800 KB Output is correct
26 Correct 108 ms 9556 KB Output is correct
27 Correct 106 ms 9608 KB Output is correct
28 Correct 117 ms 9904 KB Output is correct
29 Correct 107 ms 9596 KB Output is correct
30 Correct 104 ms 9668 KB Output is correct
31 Correct 106 ms 9556 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Execution timed out 3077 ms 348 KB Time limit exceeded
34 Halted 0 ms 0 KB -