Submission #855676


Source Code Expand

Copy
#include <cmath>
#include <vector>
#include <iostream>
#include <limits>
#include <iostream>
#include <vector>
#include <cassert>
#include <complex>
#include <cstring>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <queue>

using namespace std;
typedef long long Long;



int main(){

	int N;
	cin >> N;
	vector<int> V(N);
	for(int &v : V)cin >> v;
	int Q,L;
	cin >> L >> Q;
	for(int i = 0; i < Q; ++i){
		int a,b;
		cin >> a >> b;
		a--;b--;
		if(a > b)swap(a,b);
		int c = 0, s = 0;
		for(int j = a+1; j <= b; ++j){
			int t = V[j] - V[j-1];
			if(s + t > L){
				c++;
				s = 0;
			}
			s += t;
		}
		if(s){
			c++;
		}
		cout << c << endl;
	}
}


/*

Ax + B = S



 */

Submission Info

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

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 11 ms 256 KB
subtask1_04.txt AC 11 ms 256 KB
subtask1_05.txt AC 13 ms 256 KB
subtask1_06.txt AC 8 ms 256 KB
subtask1_07.txt AC 8 ms 256 KB
subtask1_08.txt AC 13 ms 256 KB
subtask1_09.txt AC 14 ms 256 KB
subtask1_10.txt AC 15 ms 256 KB
subtask1_11.txt AC 15 ms 256 KB
subtask1_12.txt AC 13 ms 256 KB
subtask1_13.txt AC 12 ms 256 KB
subtask2_01.txt TLE 3157 ms 768 KB
subtask2_02.txt TLE 3157 ms 896 KB
subtask2_03.txt TLE 3153 ms 768 KB
subtask2_04.txt AC 2251 ms 640 KB
subtask2_05.txt TLE 3157 ms 640 KB
subtask2_06.txt TLE 3157 ms 768 KB
subtask2_07.txt TLE 3153 ms 768 KB
subtask2_08.txt TLE 3153 ms 768 KB
subtask2_09.txt TLE 3153 ms 768 KB
subtask2_10.txt TLE 3157 ms 768 KB
subtask2_11.txt TLE 3157 ms 768 KB
subtask2_12.txt TLE 3157 ms 768 KB
subtask2_13.txt TLE 3153 ms 768 KB