CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Alitaulukot
Sender:	Oxygenol
Submission time:	2020-09-30 12:55:04 +0300
Language:	C++17
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.01 s	1, 2, 3	details
#2	ACCEPTED	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.01 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	WRONG ANSWER	0.01 s	1, 2, 3	details
#6	TIME LIMIT EXCEEDED	--	2, 3	details
#7	ACCEPTED	0.02 s	2, 3	details
#8	ACCEPTED	0.02 s	2, 3	details
#9	TIME LIMIT EXCEEDED	--	2, 3	details
#10	TIME LIMIT EXCEEDED	--	2, 3	details
#11	TIME LIMIT EXCEEDED	--	3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	TIME LIMIT EXCEEDED	--	3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details

Code

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    int size;
    std::cin >> size;
    int k;
    std::cin >> k;
    std::vector<int> numbers = std::vector<int>();

    for (int i = 0; i < size; i++) {
        int n;
        std::cin >> n;
        numbers.push_back(n);
    }

    int count = 0;
    /*for (int i = 0; i < size; i++) {
        int min = -1;
        int max = -1;
        for (int j = i; j < (int) numbers.size(); j++) {
            int num = numbers[j];
            std::cout << num << std::endl;
            if (num > max) {
                max = num;
            }
            if (num < min || min == -1) {
                min = num;
            }
            if ((max - min) > k) {
                count += (j - i) * (j - i + 1) / 2;
                i = j - 1;
                break;
            } else if (j + 1 == size) {
                count += (j - i + 1) * (j - i + 2) / 2;
                i = size;
                break;
            }
        }
        std::cout << "Count is " << count << std::endl;
    }
    std::cout << count << std::endl;
    */

    for (int bar = 1; bar < size; bar++) {
        for (int i = 0; i < size - bar + 1; i++) {
            bool valid = true;
            int max = -1;
            int min = -1;
            for (int j = i; j < i + bar; j++) {
                int num = numbers[j];
                if (num > max) {
                    max = num;
                }
                if (num < min || min == -1) {
                    min = num;
                }
                if ((max - min) > k) {
                    valid = false;
                    break;
                }
            }
            if (valid) {
                count++;
            }
        }
    }

    std::cout << count << std::endl;

    return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`100 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5050` view save

user output
`5049` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`100 2 5 5 2 4 3 5 3 4 3 2 3 4 5 4 4 ...` view save

correct output
`317` view save

user output
`317` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
`119` view save

user output
`119` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`100 990000000 111122929 961821360 578238211 ...` view save

correct output
`4006` view save

user output
`4006` view save

Test 5

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`100 1000000000 553190572 453407680 667300705 ...` view save

correct output
`5050` view save

user output
`5049` view save

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`2000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`2001000` view save

user output
(empty)

Test 7

Group: 2, 3

Verdict: ACCEPTED

input
`2000 2 4 4 1 4 2 3 1 2 1 3 5 2 2 4 4 ...` view save

correct output
`6340` view save

user output
`6340` view save

Test 8

Group: 2, 3

Verdict: ACCEPTED

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

correct output
`2413` view save

user output
`2413` view save

Test 9

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`2000 999000000 746120950 772769620 721488968 ...` view save

correct output
`1287776` view save

user output
(empty)

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`2000 1000000000 621947980 510355354 756705418 ...` view save

correct output
`2001000` view save

user output
(empty)

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5000050000` view save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 2 3 3 1 3 3 1 1 5 1 2 5 4 1 3 1 ...` view save

correct output
`317066` view save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`123292` view save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 999990000 460235639 963048588 47270983 3...` view save

correct output
`4946886742` view save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 1000000000 885457070 18257718 927615960 3...` view save

correct output
`5000050000` view save

user output
(empty)

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 50000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`3750075000` view save

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 50000 100000 99999 99998 99997 99996...` view save

correct output
`3750075000` view save

user output
(empty)

Datatähti 2021 alku

Alitaulukot

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Tasks

Submissions (Oxygenol)