CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:jogr
Submission time:2020-09-28 22:29:20 +0300
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#20.01 s1, 2, 3details
#30.01 s1, 2, 3details
#40.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s2, 3details
#70.01 s2, 3details
#80.01 s2, 3details
#90.01 s2, 3details
#10ACCEPTED0.01 s2, 3details
#11--3details
#120.02 s3details
#130.02 s3details
#140.04 s3details
#15--3details
#16--3details
#17--3details

Code

#include <iostream>
#include <string>
#include <vector>
#include <sstream>


int abs(int n) {
    if (n < 0) return -n;
    else return n;
}

int max(int a, int b) {
    return (a > b) ? a : b; // return a, if a is greater than b, otherwise return b
}

int min(int a, int b) {
    return (a < b) ? a : b; // return a, if a is smaller than b, otherwise return b
}


using namespace std;

int main() {
    
    int n, max_diff;
    cin >> n >> max_diff;
        
    vector<int> numbers;
    
    string s;
    while(getline(cin, s)) {
        stringstream ss(s);
        int num;
        while(ss >> num) numbers.push_back(num);
    }

    
    int out = n; // the number of lists
    
    for (int i = 0; i < n; i++) {
        int ip = 1;
        int mx, mn;
        mx = numbers[i];
        mn = numbers[i];
        while (i + ip < n) {
            mx = max(mx, numbers[i + ip]);
            mn = min(mn, numbers[i + ip]);
            if (mx - mn <= max_diff) {
                ++out;
            }
            else {
                i = i + ip;
                break;
            }
            ++ip;
        }
    }
    
    cout << out;
    
    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:

input
100 2
5 5 2 4 3 5 3 4 3 2 3 4 5 4 4 ...

correct output
317

user output
150

Test 3

Group: 1, 2, 3

Verdict:

input
100 10
71 60 61 96 25 10 10 9 84 85 1...

correct output
119

user output
110

Test 4

Group: 1, 2, 3

Verdict:

input
100 990000000
111122929 961821360 578238211 ...

correct output
4006

user output
548

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:

input
2000 2
4 4 1 4 2 3 1 2 1 3 5 2 2 4 4 ...

correct output
6340

user output
3075

Test 8

Group: 2, 3

Verdict:

input
2000 10
65 88 33 88 41 10 17 38 22 3 8...

correct output
2413

user output
2178

Test 9

Group: 2, 3

Verdict:

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
126260

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
2000 1000000000
621947980 510355354 756705418 ...

correct output
2001000

user output
2001000

Test 11

Group: 3

Verdict:

input
100000 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
5000050000

user output
(empty)

Test 12

Group: 3

Verdict:

input
100000 2
3 3 1 3 3 1 1 5 1 2 5 4 1 3 1 ...

correct output
317066

user output
151872

Test 13

Group: 3

Verdict:

input
100000 10
10 3 6 3 43 60 5 48 15 27 86 4...

correct output
123292

user output
110394

Test 14

Group: 3

Verdict:

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
379098

Test 15

Group: 3

Verdict:

input
100000 1000000000
885457070 18257718 927615960 3...

correct output
5000050000

user output
(empty)

Test 16

Group: 3

Verdict:

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:

input
100000 50000
100000 99999 99998 99997 99996...

correct output
3750075000

user output
(empty)