Submission #855903


Source Code Expand

Copy
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;

int main() {
	int n;
	cin>>n;
	vector<int> v(n);
	for(int i=0; i<n; ++i)
		scanf("%d",&v[i]);
	int l,q;
	cin>>l>>q;
	for(int a,b,i=0; i<q; ++i){
		scanf("%d%d",&a,&b);
		if(b<a) swap(a,b);
		--a;--b;
		long long s=0,c=0;
		for(int j=a+1; j<=b; ++j){
			s+=v[j]-v[j-1];
			if(s>l){
				++c;
				s=v[j]-v[j-1];
			}
		}
		printf("%d\n",c+1);
	}
}

Submission Info

Submission Time
Task E - Tak and Hotels
User Rezira
Language C++14 (GCC 5.4.1)
Score 200
Code Size 452 Byte
Status TLE
Exec Time 3157 ms
Memory 896 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:26:20: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
   printf("%d\n",c+1);
                    ^
./Main.cpp:11:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&v[i]);
                    ^
./Main.cpp:15:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&a,&b);
                      ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 500
Status
AC × 1
AC × 14
AC × 15
TLE × 12
Set Name Test Cases
Sample example_01.txt
Subtask1 example_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt
All example_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt
Case Name Status Exec Time Memory
example_01.txt AC 4 ms 256 KB
subtask1_01.txt AC 4 ms 256 KB
subtask1_02.txt AC 4 ms 256 KB
subtask1_03.txt AC 5 ms 256 KB
subtask1_04.txt AC 6 ms 256 KB
subtask1_05.txt AC 5 ms 256 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 5 ms 256 KB
subtask1_09.txt AC 6 ms 256 KB
subtask1_10.txt AC 6 ms 256 KB
subtask1_11.txt AC 8 ms 256 KB
subtask1_12.txt AC 6 ms 256 KB
subtask1_13.txt AC 5 ms 256 KB
subtask2_01.txt TLE 3153 ms 768 KB
subtask2_02.txt TLE 3153 ms 896 KB
subtask2_03.txt TLE 3157 ms 896 KB
subtask2_04.txt AC 2032 ms 640 KB
subtask2_05.txt TLE 3153 ms 640 KB
subtask2_06.txt TLE 3157 ms 768 KB
subtask2_07.txt TLE 3157 ms 768 KB
subtask2_08.txt TLE 3157 ms 768 KB
subtask2_09.txt TLE 3157 ms 768 KB
subtask2_10.txt TLE 3157 ms 768 KB
subtask2_11.txt TLE 3153 ms 640 KB
subtask2_12.txt TLE 3153 ms 768 KB
subtask2_13.txt TLE 3156 ms 768 KB