oj.uz

Submission #516182

# Submission time Handle Problem Language Result Execution time Memory
516182 2022-01-20T14:52:37 Z inksamurai Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 262 ms 18576 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _34raRxL ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
void print(){cout<<"\n";}
template<class te,class ...ti>
void print(const te&v,const ti&...nv){cout<<v;if(sizeof...(nv)){cout<<" ";print(nv...);}}
//e
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;

int main(){
_34raRxL;
	int n;
	cin>>n;
	vec(pii) a;
	rep(i,n+1){
		int x;
		cin>>x;
		a.pb({x,i});
	}
	vi b(n);
	rep(i,n){
		cin>>b[i];
	}
	sort(all(b));
	sort(all(a));
	multiset<int> mst;
	rep(i,n){
		int x=a[i].fi,y=b[i];
		mst.insert(max(0,x-y));
	}
	vi pans(n+1,-1);
	drep(i,n){
		int id=a[i+1].se;
		pans[id]=*prev(mst.end());
		mst.erase(mst.find(max(0,a[i].fi-b[i])));
		mst.insert(max(0,a[i+1].fi-b[i]));
	}
	pans[a[0].se]=*prev(mst.end());
	rep(i,n+1){
		print(pans[i],"");
	}
	print();
//	
	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 288 KB Output is correct
12 Correct 1 ms 308 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 288 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 2 ms 456 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 2 ms 452 KB Output is correct
20 Correct 1 ms 452 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 1 ms 452 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 452 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 456 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 372 KB Output is correct
30 Correct 1 ms 452 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 288 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 2 ms 456 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 2 ms 452 KB Output is correct
20 Correct 1 ms 452 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 1 ms 452 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 452 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 456 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 372 KB Output is correct
30 Correct 1 ms 452 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 181 ms 17380 KB Output is correct
34 Correct 201 ms 18108 KB Output is correct
35 Correct 190 ms 17520 KB Output is correct
36 Correct 193 ms 18104 KB Output is correct
37 Correct 187 ms 18576 KB Output is correct
38 Correct 187 ms 18352 KB Output is correct
39 Correct 220 ms 17324 KB Output is correct
40 Correct 223 ms 17200 KB Output is correct
41 Correct 262 ms 17544 KB Output is correct
42 Correct 221 ms 17416 KB Output is correct
43 Correct 232 ms 17372 KB Output is correct
44 Correct 201 ms 16788 KB Output is correct
45 Correct 184 ms 16944 KB Output is correct
46 Correct 188 ms 16692 KB Output is correct
47 Correct 176 ms 17360 KB Output is correct
48 Correct 172 ms 17200 KB Output is correct
49 Correct 237 ms 17936 KB Output is correct
50 Correct 251 ms 17824 KB Output is correct
51 Correct 249 ms 17852 KB Output is correct
52 Correct 238 ms 17844 KB Output is correct
53 Correct 233 ms 17876 KB Output is correct