Submission #855819
Source Code Expand
Copy
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string>
#define MOD 1000000007
#define oo 987654321
#define INT long long
using namespace std;
int n, l, q, h[100010], a, b;
int main()
{
scanf("%d", &n);
for(int i = 1 ; i <= n ; i++ )
scanf("%d", h+i);
scanf("%d%d", &l, &q);
while( q-- )
{
scanf("%d%d", &a, &b);
if( a > b ) swap(a, b);
int cnt = 0, now = a;
while( now < b )
{
now = (int)(upper_bound(h+1, h+n+1, h[now]+l) - h) - 1;
cnt++;
}
printf("%d\n", cnt);
}
return 0;
}
Submission Info
Submission Time
2016-08-28 21:35:02+0900
Task
E - Tak and Hotels
User
JKJeong
Language
C++14 (GCC 5.4.1)
Score
200
Code Size
648 Byte
Status
TLE
Exec Time
3157 ms
Memory
768 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:14:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:16:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", h+i);
^
./Main.cpp:17:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &l, &q);
^
./Main.cpp:20:30: 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
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
5 ms
256 KB
subtask1_02.txt
AC
4 ms
256 KB
subtask1_03.txt
AC
7 ms
256 KB
subtask1_04.txt
AC
27 ms
256 KB
subtask1_05.txt
AC
5 ms
256 KB
subtask1_06.txt
AC
8 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
16 ms
256 KB
subtask1_11.txt
AC
17 ms
256 KB
subtask1_12.txt
AC
16 ms
256 KB
subtask1_13.txt
AC
14 ms
256 KB
subtask2_01.txt
TLE
3153 ms
640 KB
subtask2_02.txt
TLE
3157 ms
640 KB
subtask2_03.txt
TLE
3157 ms
768 KB
subtask2_04.txt
AC
52 ms
640 KB
subtask2_05.txt
TLE
3153 ms
512 KB
subtask2_06.txt
AC
77 ms
768 KB
subtask2_07.txt
TLE
3157 ms
640 KB
subtask2_08.txt
TLE
3153 ms
640 KB
subtask2_09.txt
TLE
3157 ms
640 KB
subtask2_10.txt
TLE
3157 ms
640 KB
subtask2_11.txt
TLE
3153 ms
640 KB
subtask2_12.txt
TLE
3157 ms
640 KB
subtask2_13.txt
AC
80 ms
768 KB