CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:Anniiiz
Submission time:2020-09-30 18:33:57 +0300
Language:C++11
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#20.01 s1, 2, 3details
#3ACCEPTED0.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.03 s3details
#130.03 s3details
#14--3details
#15--3details
#16--3details
#17--3details

Compiler report

input/code.cpp: In function 'int valitsePienin(std::vector<int>)':
input/code.cpp:9:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < lista.size(); i++) {
                   ~~^~~~~~~~~~~~~~
input/code.cpp: In function 'int valitseSuurin(std::vector<int>)':
input/code.cpp:16:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < lista.size(); i++) {
                   ~~^~~~~~~~~~~~~~
input/code.cpp: In function 'int valitsePienin(std::vector<int>)':
input/code.cpp:13:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
input/code.cpp: In function 'int valitseSuurin(std::vector<int>)':
input/code.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Code

using namespace std;
#include<iostream>
#include<vector>
#include <stdlib.h>


int valitsePienin(vector<int> lista) {
  int pienin = lista[0];
  for (int i = 0; i < lista.size(); i++) {
    pienin = min(pienin, lista[i]);
  return pienin;
  }
}
int valitseSuurin(vector<int> lista) {
  int suurin = lista[0];
  for (int i = 0; i < lista.size(); i++) {
    suurin = max(suurin, lista[i]);
  return suurin;
  }
}

int main() {
  int n, k;
  cin >> n >> k;
  vector<int> vektori;
  int x;
  while (cin >> x) {
    vektori.push_back (x);
  }
  int s = 0;
  int a = 0;
  int maara = 0;
  int pienin = vektori[0];
  int suurin = vektori[0];
  vector<int> joku = {vektori[0]};
  while (s < n - 1) {
    if (a != n - 1) {
      if (abs(suurin - vektori[a + 1]) <= k && abs(pienin - vektori[a + 1]) <= k) {
        a ++;
        joku.push_back(vektori[a]);
        suurin = max(suurin, vektori[a]);
        pienin = min(pienin, vektori[a]);
      }
      else {
        maara += joku.size();
        if (joku.size() > 1) {
          if (joku[0] == pienin) {
            joku.erase(joku.begin());
            pienin = valitsePienin(joku);
          }
          else if (joku[0] == suurin) {
            joku.erase(joku.begin());
            suurin = valitseSuurin(joku);
          }
          else {
            joku.erase(joku.begin());
          }
        }
        else {
          joku.erase(joku.begin());
        }
        s ++;
        if (s > a) {
          joku.push_back(vektori[s]);
          pienin = vektori[s];
          suurin = vektori[s];
          a = s;
        }
      }
    }
    else {
      maara += joku.size();
      if (joku.size() > 1) {
        if (joku[0] == pienin) {
          joku.erase(joku.begin());
          pienin = valitsePienin(joku);
        }
        else if (joku[0] == suurin) {
          joku.erase(joku.begin());
          suurin = valitseSuurin(joku);
        }
        else {
          joku.erase(joku.begin());
        }
      }
      else {
        joku.erase(joku.begin());
      }
      s ++;
    }
  }
  maara++;
  cout << maara;
  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
375

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:

input
100 990000000
111122929 961821360 578238211 ...

correct output
4006

user output
2980

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
6807

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
2415

Test 9

Group: 2, 3

Verdict:

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
1238573

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
347102

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
123392

Test 14

Group: 3

Verdict:

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
(empty)

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)