Submission #1265860

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265860		thelegendary08	Ski 2 (JOI24_ski2)	C++17	0 / 100	0 ms	328 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<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#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,D);
	vin(v,n); 
	vi ps(n+1);
	FOR(i, 1, n+1)ps[i] = ps[i-1] + v[i-1]; 
	vi dif(n-1); 
	f0r(i, n-1){
		dif[i] = v[i] - v[i+1]; 
		dif[i] %= D; 
		if(dif[i] < 0)dif[i] += D; 
		dif[i] = D - dif[i]; 
		if(dif[i] == D)dif[i] = 0; 
	}
	vi ap(n);
	FOR(i, 1, n)ap[i] = ap[i-1] + i * dif[i-1]; 
	vi ds(n);
	FOR(i, 1, n)ds[i] = ds[i-1] + dif[i-1]; 
	in(q);
	f0r(i,q){
		in2(l,r); l--; r--; 
		// dout(ps[r+1] - ps[l]); 
		int ans = ps[r+1] - ps[l] - v[r] * (r - l + 1);
		//ap sum from l to r - 1
		// dout(ans); 
		ans += ap[r] - ap[l] - l * (ds[r] - ds[l]); 
		ans /= D; 
		if(ds[r] - ds[l] > v[r])out(-1);
		else out(ans); 
	}
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 12
• Subtask 3: 0 / 9
• Subtask 4: 0 / 33
• Subtask 5: 0 / 27
• Subtask 6: 0 / 14