Submission #1189540

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189540		thelegendary08	Snowball (JOI21_ho_t2)	C++17	100 / 100	99 ms	13168 KiB

Main

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in2(n,q);
	vin(v,n);
	vin(w,q);
	
	vi dif(n-1);
	f0r(i,n-1)dif[i] = v[i+1] - v[i];
	
	vi rel;
	rel.pb(w[0]);
	int cur = w[0];
	int mn = 0;
	int mx = 0;
	mn = min(mn, w[0]);
	mx = max(mx, w[0]);
	FOR(i, 1, q){
		cur += w[i];
		if(mn > cur){
			mn = cur;
			rel.pb(cur);
		}
		if(mx < cur){
			mx = cur;
			rel.pb(cur);
		}
	}
	
	vpii g;
	f0r(i,n-1){
		g.pb(mp(dif[i], i));
	}
	sort(all(g));
	// vout(rel);
	vi ans(n);
	mn = 0; mx = 0;
	int ptr = 0;
	f0r(i, rel.size()){
		if(rel[i] < 0)mn = rel[i];
		else mx = rel[i];
		while(ptr < n-1 && g[ptr].first <= mx - mn){
			if(rel[i] < 0){
				int pt = g[ptr].second;
				ans[pt + 1] += (g[ptr].first - mx);
				ans[pt] += mx;
				// out("ONE");
				// dout2(pt, -mn);
				// dout2(pt+1, mx);
				ptr++;
			}
			else{
				int pt = g[ptr].second;
				ans[pt + 1] -= mn;
				ans[pt] += (g[ptr].first + mn);
				// dout2(pt, -mn);
				// dout2(pt+1, mx);
				ptr++;
			}
			// vout(ans);
			
		}
	}
	while(ptr < n-1){
		int pt = g[ptr].second;
		ans[pt + 1] -= mn;
		ans[pt] += mx;
		// out("ONE");
		// dout2(pt, -mn);
		// dout2(pt+1, mx);
		ptr++;
	}
	ans[0] -= mn;
	ans[n-1] += mx;
	f0r(i,n){
		cout<<ans[i]<<'\n';
	}
}

• Subtask 1: 33 / 33
• Subtask 2: 67 / 67