Submission #73775618

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long

int n,k,q,a[210000],s[210000];
int f[210000],ss[210000];

signed main()
{
	cin >> n >> k >> q;
	for(int i = 1;i <= n;i++)
	{
		cin >> a[i];
		s[i] = s[i - 1] + a[i];
	}
	for(int i = 1;i <= n;i++)
	{
		int l = i,r = n + 1;
		while(l <= r)
		{
			int mid = (l + r) / 2;
			if(s[mid] - s[i - 1] <= k)
			{
				l = mid + 1;
			}
			else
			{
				r = mid - 1;
			}
		}
		f[i] = min(n,l);
		ss[i] = ss[i - 1] + f[i];
	}
	cout << "\n";
	while(q--)
	{
		int l,r;
		cin >> l >> r;
		cout << ss[r] - ss[l - 1] << "\n";
	}
}

Submission Info

Submission Time
Task D - The Path of Carrying Luggage
User sanjiaozhou
Language C++23 (GCC 15.2.0)
Score 366
Code Size 622 Byte
Status AC
Exec Time 228 ms
Memory 8408 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 366 / 366
Status
AC × 5
AC × 80
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt
All sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, in73.txt, in74.txt, in75.txt
Case Name Status Exec Time Memory
in01.txt AC 1 ms 3608 KiB
in02.txt AC 1 ms 3624 KiB
in03.txt AC 1 ms 3608 KiB
in04.txt AC 1 ms 3632 KiB
in05.txt AC 1 ms 3608 KiB
in06.txt AC 1 ms 3576 KiB
in07.txt AC 1 ms 3500 KiB
in08.txt AC 1 ms 3600 KiB
in09.txt AC 1 ms 3608 KiB
in10.txt AC 1 ms 3544 KiB
in11.txt AC 225 ms 8148 KiB
in12.txt AC 225 ms 8408 KiB
in13.txt AC 58 ms 8408 KiB
in14.txt AC 24 ms 8408 KiB
in15.txt AC 62 ms 8384 KiB
in16.txt AC 164 ms 8336 KiB
in17.txt AC 227 ms 8384 KiB
in18.txt AC 116 ms 3600 KiB
in19.txt AC 208 ms 8368 KiB
in20.txt AC 193 ms 8360 KiB
in21.txt AC 199 ms 8312 KiB
in22.txt AC 170 ms 8332 KiB
in23.txt AC 189 ms 8224 KiB
in24.txt AC 183 ms 8344 KiB
in25.txt AC 184 ms 8240 KiB
in26.txt AC 185 ms 8236 KiB
in27.txt AC 165 ms 8148 KiB
in28.txt AC 226 ms 8384 KiB
in29.txt AC 223 ms 8388 KiB
in30.txt AC 1 ms 3600 KiB
in31.txt AC 24 ms 8172 KiB
in32.txt AC 1 ms 3504 KiB
in33.txt AC 1 ms 3672 KiB
in34.txt AC 187 ms 8236 KiB
in35.txt AC 1 ms 3504 KiB
in36.txt AC 178 ms 8384 KiB
in37.txt AC 200 ms 8336 KiB
in38.txt AC 1 ms 3488 KiB
in39.txt AC 1 ms 3412 KiB
in40.txt AC 59 ms 8408 KiB
in41.txt AC 21 ms 5976 KiB
in42.txt AC 174 ms 8368 KiB
in43.txt AC 183 ms 8384 KiB
in44.txt AC 205 ms 8368 KiB
in45.txt AC 210 ms 8336 KiB
in46.txt AC 191 ms 8368 KiB
in47.txt AC 32 ms 8336 KiB
in48.txt AC 222 ms 8360 KiB
in49.txt AC 225 ms 8148 KiB
in50.txt AC 193 ms 8172 KiB
in51.txt AC 203 ms 8408 KiB
in52.txt AC 191 ms 8312 KiB
in53.txt AC 189 ms 8408 KiB
in54.txt AC 218 ms 8224 KiB
in55.txt AC 219 ms 8368 KiB
in56.txt AC 228 ms 8360 KiB
in57.txt AC 1 ms 3504 KiB
in58.txt AC 1 ms 3608 KiB
in59.txt AC 24 ms 8332 KiB
in60.txt AC 23 ms 8280 KiB
in61.txt AC 1 ms 3436 KiB
in62.txt AC 1 ms 3576 KiB
in63.txt AC 1 ms 3524 KiB
in64.txt AC 1 ms 3472 KiB
in65.txt AC 1 ms 3544 KiB
in66.txt AC 1 ms 3632 KiB
in67.txt AC 1 ms 3696 KiB
in68.txt AC 1 ms 3500 KiB
in69.txt AC 1 ms 3412 KiB
in70.txt AC 1 ms 3412 KiB
in71.txt AC 1 ms 3612 KiB
in72.txt AC 1 ms 3500 KiB
in73.txt AC 1 ms 3600 KiB
in74.txt AC 1 ms 3600 KiB
in75.txt AC 213 ms 8368 KiB
sample01.txt AC 1 ms 3672 KiB
sample02.txt AC 1 ms 3608 KiB
sample03.txt AC 1 ms 3488 KiB
sample04.txt AC 1 ms 3412 KiB
sample05.txt AC 1 ms 3540 KiB