oj.uz

답안 #372319

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
372319 2021-02-27T16:02:47 Z errorgorn Snowball (JOI21_ho_t2) C++17
100 / 100
 180 ms 8428 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define up upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,q;
ll arr[200005];
ll brr[200005];
ii range[200005];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n>>q;
	rep(x,0,n) cin>>arr[x];
	rep(x,1,q+1) cin>>brr[x];
	
	range[0]=ii(0,0);
	
	ll curr=0;
	rep(x,1,q+1){
		curr+=brr[x];
		range[x]=range[x-1];
		range[x].fi=min(range[x].fi,curr);
		range[x].se=max(range[x].se,curr);
	}
	
	rep(x,0,n){
		ll l,r;
		if (x==0) l=arr[x]+range[q].fi;
		else{
			int lo=0,hi=q,mi;
			while (hi-lo>1){
				mi=hi+lo>>1;
				
				if (arr[x-1]+range[mi].se<=arr[x]+range[mi].fi) lo=mi;
				else hi=mi;
			}
			
			if (brr[hi]<=0) l=max(arr[x-1]+range[hi].se,arr[x]+range[hi].fi);
			else l=arr[x]+range[hi].fi;
		}
		
		if (x==n-1) r=arr[x]+range[q].se;
		else{
			int lo=0,hi=q,mi;
			while (hi-lo>1){
				mi=hi+lo>>1;
				
				if (arr[x]+range[mi].se<=arr[x+1]+range[mi].fi) lo=mi;
				else hi=mi;
			}
			
			//cout<<range[hi].se<<endl;
			if (brr[hi]>=0) r=min(arr[x]+range[hi].se,arr[x+1]+range[hi].fi);
			else r=arr[x]+range[hi].se;
		}
		
		//cout<<l<<" "<<r<<endl;
		
		cout<<r-l<<endl;
	}
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:66:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |     mi=hi+lo>>1;
      |        ~~^~~
Main.cpp:80:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   80 |     mi=hi+lo>>1;
      |        ~~^~~

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 492 KB Output is correct

Subtask #2
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 30 ms 5100 KB Output is correct
21 Correct 29 ms 5100 KB Output is correct
22 Correct 28 ms 5100 KB Output is correct
23 Correct 27 ms 5100 KB Output is correct
24 Correct 38 ms 5356 KB Output is correct
25 Correct 168 ms 8172 KB Output is correct
26 Correct 163 ms 8352 KB Output is correct
27 Correct 166 ms 8044 KB Output is correct
28 Correct 156 ms 8044 KB Output is correct
29 Correct 159 ms 7788 KB Output is correct
30 Correct 132 ms 7552 KB Output is correct
31 Correct 118 ms 7020 KB Output is correct
32 Correct 107 ms 7148 KB Output is correct
33 Correct 13 ms 1132 KB Output is correct
34 Correct 168 ms 8300 KB Output is correct
35 Correct 180 ms 8024 KB Output is correct
36 Correct 164 ms 8300 KB Output is correct
37 Correct 162 ms 8044 KB Output is correct
38 Correct 156 ms 8044 KB Output is correct
39 Correct 138 ms 8044 KB Output is correct
40 Correct 117 ms 8044 KB Output is correct
41 Correct 33 ms 5100 KB Output is correct
42 Correct 102 ms 7020 KB Output is correct
43 Correct 119 ms 8172 KB Output is correct
44 Correct 35 ms 5100 KB Output is correct
45 Correct 114 ms 8044 KB Output is correct
46 Correct 123 ms 8300 KB Output is correct
47 Correct 148 ms 8428 KB Output is correct
48 Correct 126 ms 8428 KB Output is correct