CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:EeliH
Submission time:2020-10-02 23:20:46 +0300
Language:C++11
Status:READY
Result:37
Feedback
groupverdictscore
#1ACCEPTED11
#2ACCEPTED26
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s2, 3details
#7ACCEPTED0.01 s2, 3details
#8ACCEPTED0.01 s2, 3details
#9ACCEPTED0.01 s2, 3details
#10ACCEPTED0.01 s2, 3details
#11--3details
#12ACCEPTED0.02 s3details
#13ACCEPTED0.02 s3details
#140.02 s3details
#150.02 s3details
#16--3details
#17--3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &koko, &erotus);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &tmp);
         ~~~~~^~~~~~~~~~~~

Code

#include <iostream>
 
#pragma GCC optimize("Ofast")
 
using namespace std;
 
int luvut[100000];
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int koko, erotus;
    scanf("%d %d", &koko, &erotus);
    int tulos = 0;
    for(int i = 0; i < koko; i++) {
        int tmp;
        scanf("%d", &tmp);
        //cout << tmp << endl;
        //cin >> tmp;
        luvut[i] = tmp;
    }

    int tiedetty = 0;
    int etiedetty = -1;
    int pienin = luvut[0];
    int suurin = luvut[0];
    for(int i = 0; i < koko; i++) {
        int maara = 1;
        int aloitus = i + 1;
        if(tiedetty > aloitus) {
            maara = tiedetty - i + 1;
            aloitus = tiedetty + 1;
            if(pienin == luvut[i - 1] || suurin == luvut[i - 1]) {
                pienin = luvut[i];
                suurin = luvut[i];
                for(int j = i + 1; j < aloitus; j++) {
                    if(luvut[j] < pienin)
                        pienin = luvut[j];
                    else if(luvut[j] > suurin)
                        suurin = luvut[j];
                }
            }
        } else {
            pienin = luvut[i];
            suurin = luvut[i];
        }

        for(int j = aloitus; j < koko; j++) {
            if(luvut[j] > suurin) {
                if(luvut[j] - pienin <= erotus) {
                    maara++;
                    suurin = luvut[j];
                    if(j == koko - 1) {
                        tiedetty = j;
                    }
                } else {
                    tiedetty = j - 1;
                    break;
                }
            } else if(luvut[j] < pienin) {
                if(suurin - luvut[j] <= erotus) {
                    maara++;
                    pienin = luvut[j];
                    if(j == koko - 1) {
                        tiedetty = j;
                    }
                } else {
                    tiedetty = j - 1;
                    break;
                }
            } else {
                maara++;
                if(j == koko - 1) {
                    tiedetty = j;
                }
            }
        }
        int n = 0;
        if(etiedetty - i >= 0)
            n = max(etiedetty - i + 1, 0);
        //cout << i << " " << maara << " " << n << " " << etiedetty << endl;
        tulos += ((maara) * (maara + 1)) / 2;
        tulos -= (n * (n + 1)) / 2;
        etiedetty = tiedetty;
    }
    cout << tulos << endl;
}

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: ACCEPTED

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

correct output
317

user output
317

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
119

user output
119

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 990000000
111122929 961821360 578238211 ...

correct output
4006

user output
4006

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: ACCEPTED

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

correct output
6340

user output
6340

Test 8

Group: 2, 3

Verdict: ACCEPTED

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

correct output
2413

user output
2413

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
1287776

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: ACCEPTED

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

correct output
317066

user output
317066

Test 13

Group: 3

Verdict: ACCEPTED

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

correct output
123292

user output
123292

Test 14

Group: 3

Verdict:

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
651919446

Test 15

Group: 3

Verdict:

input
100000 1000000000
885457070 18257718 927615960 3...

correct output
5000050000

user output
705082704

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)