Submission #858668


Source Code Expand

Copy
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include<set>
#include<cmath>
#include<queue>
#define MAX 1000050
#define ll long long int
using namespace std;

int n,l;
int q;
vector<int>x;
int t;
int a ,b;
int main(){
  scanf("%d",&n);
  for(int i=0;i<n;i++){
    scanf("%d",&t);
    x.push_back(t);
  }
  scanf("%d", &l);
  scanf("%d",&q);
  for(int i=0;i<q;i++){
    scanf("%d %d",&a,&b);
    int cur = 0;
    int cnt = 0;
    if(a > b) swap(a,b);
    int start = a-1;
    for(int j=a;j<=b-1;j++){
      if(abs(x[start]-x[j]) <= l){
        cur = max(cur,abs(x[start]-x[j]));
      }
      if(((j+1)<=b-1) && (cur+abs(x[j]-x[j+1]))>l){
        cur = 0;
        cnt++;
        start = j;
      }
      if(j==b-1 && cur>0) {
        cnt++;
      }
    }
    printf("%d\n",cnt);
  }
  return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User ramin
Language C++14 (GCC 5.4.1)
Score 0
Code Size 924 Byte
Status WA
Exec Time 5 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
                 ^
./Main.cpp:23:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&t);
                   ^
./Main.cpp:26:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &l);
                  ^
./Main.cpp:27:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&q);
                 ^
./Main.cpp:29:25: 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 0 / 200 0 / 100
Status
WA × 4
WA × 12
WA × 24
Set Name Test Cases
Sample example_01.txt, example_02.txt, example_03.txt, example_04.txt
Subtask1 example_01.txt, example_02.txt, example_03.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
All example_01.txt, example_02.txt, example_03.txt, example_04.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, 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
Case Name Status Exec Time Memory
example_01.txt WA 4 ms 256 KB
example_02.txt WA 4 ms 256 KB
example_03.txt WA 4 ms 256 KB
example_04.txt WA 4 ms 256 KB
subtask1_01.txt WA 4 ms 256 KB
subtask1_02.txt WA 4 ms 256 KB
subtask1_03.txt WA 4 ms 256 KB
subtask1_04.txt WA 4 ms 256 KB
subtask1_05.txt WA 4 ms 256 KB
subtask1_06.txt WA 4 ms 256 KB
subtask1_07.txt WA 4 ms 256 KB
subtask1_08.txt WA 4 ms 256 KB
subtask1_09.txt WA 5 ms 256 KB
subtask2_01.txt WA 4 ms 256 KB
subtask2_02.txt WA 4 ms 256 KB
subtask2_03.txt WA 4 ms 256 KB
subtask2_04.txt WA 4 ms 256 KB
subtask2_05.txt WA 4 ms 256 KB
subtask2_06.txt WA 4 ms 256 KB
subtask2_07.txt WA 4 ms 256 KB
subtask2_08.txt WA 4 ms 256 KB
subtask2_09.txt WA 4 ms 256 KB
subtask2_10.txt WA 4 ms 256 KB
subtask2_11.txt WA 4 ms 256 KB