CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Alitaulukot
Sender:	EeliH
Submission time:	2020-10-08 09:57:06 +0300
Language:	C++ (C++11)
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	WRONG ANSWER	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.01 s	1, 2, 3	details
#4	WRONG ANSWER	0.01 s	1, 2, 3	details
#5	WRONG ANSWER	0.01 s	1, 2, 3	details
#6	WRONG ANSWER	0.01 s	2, 3	details
#7	ACCEPTED	0.01 s	2, 3	details
#8	ACCEPTED	0.01 s	2, 3	details
#9	WRONG ANSWER	0.04 s	2, 3	details
#10	WRONG ANSWER	0.01 s	2, 3	details
#11	WRONG ANSWER	0.07 s	3	details
#12	WRONG ANSWER	0.07 s	3	details
#13	WRONG ANSWER	0.02 s	3	details
#14	WRONG ANSWER	0.12 s	3	details
#15	WRONG ANSWER	0.12 s	3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:31:9: warning: unused variable 'ero' [-Wunused-variable]
     int ero = 0;
         ^~~
input/code.cpp:15: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:19:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &tmp);
         ~~~~~^~~~~~~~~~~~

Code

#include <iostream>
#include <set>
 
#pragma GCC optimize("Ofast")
 
using namespace std;
 
int luvut[100000];
int erot[99999] = {0}; 

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;
    }

    for(int i = 1; i < koko; i++) {
        erot[i - 1] = luvut[i] - luvut[i - 1];
    }

    int tiedetty = 0;
    int etiedetty = -1;
    int ero = 0;
    int pienin = luvut[0];
    int suurin = luvut[0];
    multiset<int> luvuts;
    for(int i = 0; i < koko; i++) {
        int maara = 1;
        int aloitus = i + 1;
	tiedetty = luvuts.size();
        if(tiedetty > aloitus) {
            maara = tiedetty - i + 1;
            aloitus = tiedetty + 1;
            luvuts.erase(luvuts.find(luvut[i - 1]));
            luvuts.insert(luvut[i]);
            pienin = *(luvuts.begin());
            suurin = *(prev(luvuts.end()));
            /*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];
                }
            }*/
            //ero -= erot[i - 1];
        } else {
            //ero = 0;
            luvuts.clear();
            luvuts.insert(luvut[i]);
            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;
                    }
                    luvuts.insert(luvut[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;
                    }
                    luvuts.insert(luvut[j]);
                } else {
                    tiedetty = j - 1;
                    break;
                }
            } else {
                maara++;
                if(j == koko - 1) {
                    tiedetty = j;
                }
                luvuts.insert(luvut[j]);
            }
        /*    if(ero + erot[j] <= erotus && ero + erot[j] >= -erotus) {
                ero += erot[j];
                maara++;
                if(j == koko - 1) {
                    tiedetty = j;
                }
            } else {
                tiedetty = j - 1;
                break;
            }
        }*/
        }
        int n = 0;
        if(etiedetty - i >= 0)
            n = max(etiedetty - i + 1, 0);
        //cout << i << " " << maara << " " << n << " " << etiedetty << " " << ero << 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: 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
`5148` view save

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 ...` view save

correct output
`317` view save

user output
`314` 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: WRONG ANSWER

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

correct output
`4006` view save

user output
`5021` 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
`5148` view save

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

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
`2002998` view save

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: WRONG ANSWER

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

correct output
`1287776` view save

user output
`806885` view save

Test 10

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`2001000` view save

user output
`2002998` view save

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 ...` view save

correct output
`5000050000` view save

user output
`705182702` view save

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 ...` view save

correct output
`317066` view save

user output
`704382771` view save

Test 13

Group: 3

Verdict: WRONG ANSWER

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

correct output
`123292` view save

user output
`123294` view save

Test 14

Group: 3

Verdict: WRONG ANSWER

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

correct output
`4946886742` view save

user output
`705082103` view save

Test 15

Group: 3

Verdict: WRONG ANSWER

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

correct output
`5000050000` view save

user output
`705182702` view save

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

Compiler report

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 (EeliH)