Submission #856721
Source Code Expand
Copy
#include<iostream> #define loop(i,a,b) for(int i=a;i<b;i++) #define rep(i,a) loop(i,0,a) #define INF 1e10 using namespace std; int main(){ int n,q,a,b,alt; long long l; cin>>n; long long x[n]; rep(i,n)cin>>x[i]; cin>>l>>q; rep(i,q){ cin>>a>>b; a--;b--; if(a>b){alt=a;a=b;b=alt;} long long dp[n]; rep(i,n)dp[i]=INF; loop(i,a,b){ if(i==a)dp[i]=0; loop(j,i,b+1){ if(x[j]-x[i]<=l)dp[j]=min(dp[j],dp[i]+1); else break; } } cout<<dp[b]<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Tak and Hotels |
User | tuki_remon |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 522 Byte |
Status | TLE |
Exec Time | 3157 ms |
Memory | 1920 KB |
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 | 25 ms | 256 KB |
subtask1_04.txt | AC | 18 ms | 256 KB |
subtask1_05.txt | AC | 82 ms | 256 KB |
subtask1_06.txt | AC | 10 ms | 256 KB |
subtask1_07.txt | AC | 27 ms | 256 KB |
subtask1_08.txt | AC | 247 ms | 256 KB |
subtask1_09.txt | AC | 24 ms | 256 KB |
subtask1_10.txt | AC | 18 ms | 256 KB |
subtask1_11.txt | AC | 19 ms | 256 KB |
subtask1_12.txt | AC | 18 ms | 256 KB |
subtask1_13.txt | AC | 17 ms | 256 KB |
subtask2_01.txt | TLE | 3157 ms | 1792 KB |
subtask2_02.txt | TLE | 3157 ms | 1792 KB |
subtask2_03.txt | TLE | 3157 ms | 1792 KB |
subtask2_04.txt | TLE | 3157 ms | 1280 KB |
subtask2_05.txt | TLE | 3157 ms | 1280 KB |
subtask2_06.txt | TLE | 3157 ms | 1792 KB |
subtask2_07.txt | TLE | 3157 ms | 1792 KB |
subtask2_08.txt | TLE | 3157 ms | 1920 KB |
subtask2_09.txt | TLE | 3157 ms | 1792 KB |
subtask2_10.txt | TLE | 3153 ms | 1792 KB |
subtask2_11.txt | TLE | 3157 ms | 1664 KB |
subtask2_12.txt | TLE | 3157 ms | 1792 KB |
subtask2_13.txt | TLE | 3157 ms | 1792 KB |