Contest Duration: - (local time) (100 minutes) Back to Home

Submission #856590

Source Code Expand

Copy
```#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>

using namespace std;

#define ll long long
#define SZ(x) ((int)(x).size())
#define ALL(v) (v).begin(), (v).end()
#define foreach(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++ i)
#define reveach(i, v) for (__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++ i)
#define REP(i,a,n) for ( int i=a; i<int(n); i++ )
#define FOR(i,a,n) for ( int i=n-1; i>= int(a);i-- )
#define lson rt<<1, L, m
#define rson rt<<1|1, m, R
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define fi first
#define se second
#define CLR(a, b) memset(a, b, sizeof(a))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
const int N = 1e5 + 7;
int n, l, q;
int a[N];
int c[N];
int main(){
#ifdef ac
freopen("in.txt","r",stdin);
#endif
//freopen("out.txt","w",stdout);
scanf("%d", &n);
REP(i, 0, n) scanf("%d", &a[i]);
c[0] = a[1];
REP(i, 1, n) c[i] = a[i] - a[i - 1];
scanf("%d", &l);
scanf("%d", &q);
REP(i, 0, q){
int left, right;
scanf("%d%d", &left, &right);
if(left > right) swap(left, right);
left --;
int cur = left;
int res = 0;
REP(j, left, right){
if(a[j] - a[cur] > l){
cur = j - 1;
res ++;
}
}
if(cur != right - 1) res ++;
printf("%d\n", res);
}
return 0;
}
```

#### Submission Info

Submission Time 2016-08-28 22:11:58+0900 E - Tak and Hotels Cosss C++14 (GCC 5.4.1) 200 1786 Byte TLE 3157 ms 1280 KB

#### Compile Error

```./Main.cpp: In function ‘int main()’:
./Main.cpp:45:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:46:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i, 0, n) scanf("%d", &a[i]);
^
./Main.cpp:49:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &l);
^
./Main.cpp:50:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &q);
^
./Main.cpp:53:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &left, &right);
...```

#### Judge Result

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
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 5 ms 256 KB
subtask1_05.txt AC 5 ms 256 KB
subtask1_06.txt AC 5 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 6 ms 256 KB
subtask1_12.txt AC 6 ms 256 KB
subtask1_13.txt AC 5 ms 256 KB
subtask2_01.txt TLE 3157 ms 1152 KB
subtask2_02.txt TLE 3157 ms 1280 KB
subtask2_03.txt TLE 3157 ms 1152 KB
subtask2_04.txt AC 1682 ms 896 KB
subtask2_05.txt TLE 3157 ms 896 KB
subtask2_06.txt TLE 3157 ms 1152 KB
subtask2_07.txt TLE 3157 ms 1152 KB
subtask2_08.txt TLE 3157 ms 1152 KB
subtask2_09.txt TLE 3157 ms 1152 KB
subtask2_10.txt TLE 3155 ms 1152 KB
subtask2_11.txt TLE 3157 ms 1024 KB
subtask2_12.txt TLE 3157 ms 1152 KB
subtask2_13.txt TLE 3157 ms 1152 KB