| Task: | Alitaulukot |
| Sender: | Kertor |
| Submission time: | 2020-10-05 14:50:53 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #2 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #3 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #4 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #5 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 0.01 s | 2, 3 | details |
| #7 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #8 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #9 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #10 | ACCEPTED | 0.01 s | 2, 3 | details |
| #11 | WRONG ANSWER | 0.02 s | 3 | details |
| #12 | WRONG ANSWER | 0.02 s | 3 | details |
| #13 | WRONG ANSWER | 0.03 s | 3 | details |
| #14 | WRONG ANSWER | 0.05 s | 3 | details |
| #15 | WRONG ANSWER | 0.05 s | 3 | details |
| #16 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #17 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'int subarrayCount(int*, int, int)':
input/code.cpp:27:9: warning: variable 'Breaker_Index' set but not used [-Wunused-but-set-variable]
int Breaker_Index = 0;
^~~~~~~~~~~~~Code
#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <algorithm>
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int Length(int x)
{
return x * ( x + 1 ) / 2;
}
int subarrayCount(int arr[], int n, int k)
{
int result = 0;
int max = arr[0];
int min = arr[0];
int max_index = 0;
int min_index = 0;
int Breaker_Index = 0;
int len = 0;
int i = 0;
while(i < n)
{
bool MaxChange = arr[i] > max;
bool MinChange = arr[i] < min;
if(MaxChange) {
max = arr[i];
max_index = i;
}
else if(MinChange) {
min = arr[i];
min_index = i;
}
if(max - min <= k) {
len++;
i++;
}
else
{
result += Length(len);
if(MaxChange) {
Breaker_Index = min_index;
i = min_index + 1;
min_index++;
min = arr[min_index+1];
}
else {
Breaker_Index = max_index;
i = max_index + 1;
max_index++;
max = arr[max_index+1];
}
len = 1;
}
}
result += Length(len);
return result;
}
int main()
{
int n;
int k;
cin >> n;
cin >> k;
int arr[n+1];
for(int i = 0; i < n; i++)
{
cin >> arr[i];
}
cout << subarrayCount(arr, n, k);
return 0;
}
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 5050 |
| user output |
|---|
| 5050 |
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 2 5 5 2 4 3 5 3 4 3 2 3 4 5 4 4 ... |
| correct output |
|---|
| 317 |
| user output |
|---|
| 528 |
Test 3
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 10 71 60 61 96 25 10 10 9 84 85 1... |
| correct output |
|---|
| 119 |
| user output |
|---|
| 241 |
Test 4
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 990000000 111122929 961821360 578238211 ... |
| correct output |
|---|
| 4006 |
| user output |
|---|
| 5917 |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100 1000000000 553190572 453407680 667300705 ... |
| correct output |
|---|
| 5050 |
| user output |
|---|
| 5050 |
Test 6
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 2000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 2001000 |
| user output |
|---|
| 2001000 |
Test 7
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 2000 2 4 4 1 4 2 3 1 2 1 3 5 2 2 4 4 ... |
| correct output |
|---|
| 6340 |
| user output |
|---|
| 9945 |
Test 8
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 2000 10 65 88 33 88 41 10 17 38 22 3 8... |
| correct output |
|---|
| 2413 |
| user output |
|---|
| 4489 |
Test 9
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 2000 999000000 746120950 772769620 721488968 ... |
| correct output |
|---|
| 1287776 |
| user output |
|---|
| 1462141 |
Test 10
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 2000 1000000000 621947980 510355354 756705418 ... |
| correct output |
|---|
| 2001000 |
| user output |
|---|
| 2001000 |
Test 11
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 5000050000 |
| user output |
|---|
| 705082704 |
Test 12
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 2 3 3 1 3 3 1 1 5 1 2 5 4 1 3 1 ... |
| correct output |
|---|
| 317066 |
| user output |
|---|
| 507922 |
Test 13
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 10 10 3 6 3 43 60 5 48 15 27 86 4... |
| correct output |
|---|
| 123292 |
| user output |
|---|
| 229391 |
Test 14
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 999990000 460235639 963048588 47270983 3... |
| correct output |
|---|
| 4946886742 |
| user output |
|---|
| 711789200 |
Test 15
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 1000000000 885457070 18257718 927615960 3... |
| correct output |
|---|
| 5000050000 |
| user output |
|---|
| 705082704 |
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 50000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 3750075000 |
| user output |
|---|
| (empty) |
Test 17
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 50000 100000 99999 99998 99997 99996... |
| correct output |
|---|
| 3750075000 |
| user output |
|---|
| (empty) |
