Submission #1209372

#	Time	Username	Problem	Language	Result	Execution time	Memory
1209372		PlayVoltz	Snowball (JOI21_ho_t2)	C++20	100 / 100	56 ms	12944 KiB

Main

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <chrono>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, q, p=0;
	cin>>n>>q;
	vector<int> vect(n), pmax(q+1, 0), pmin(q+1, 0), l(n), r(n);
	vector<pii> ord(n-1);
	for (int i=0; i<n; ++i)cin>>vect[i];
	for (int i=0; i<n-1; ++i)ord[i]=mp(vect[i+1]-vect[i], i);
	sort(ord.begin(), ord.end());
	for (int i=1, sum=0, a; i<=q; ++i)cin>>a, sum+=a, pmax[i]=max(pmax[i-1], sum), pmin[i]=min(pmin[i-1], sum);
	for (int i=1; i<=q; ++i)for(;p<n-1&&pmax[i]-pmin[i]>=ord[p].fi; ++p){
		if (pmax[i]!=pmax[i-1])r[ord[p].se]=ord[p].fi+pmin[i], l[ord[p].se+1]=pmin[i];
		else r[ord[p].se]=pmax[i], l[ord[p].se+1]=pmax[i]-ord[p].fi;
	}
	for (;p<n-1;++p)r[ord[p].se]=pmax[q], l[ord[p].se+1]=pmin[q];
	l[0]=pmin[q];
	r[n-1]=pmax[q];
	for (int i=0; i<n; ++i)cout<<r[i]-l[i]<<"\n";
}

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