CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Alitaulukot
Sender:	lady-stardust
Submission time:	2020-09-30 20:26:18 +0300
Language:	C++ (C++17)
Status:	READY
Result:	37

Feedback
group	verdict	score
#1	ACCEPTED	11
#2	ACCEPTED	26
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	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	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	2, 3	details
#7	ACCEPTED	0.01 s	2, 3	details
#8	ACCEPTED	0.01 s	2, 3	details
#9	ACCEPTED	0.01 s	2, 3	details
#10	ACCEPTED	0.01 s	2, 3	details
#11	ACCEPTED	0.02 s	3	details
#12	ACCEPTED	0.02 s	3	details
#13	ACCEPTED	0.02 s	3	details
#14	ACCEPTED	0.02 s	3	details
#15	ACCEPTED	0.02 s	3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details

Code

#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  
  int n, k; cin >> n >> k;

  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];

  vector<int> next_min(n);
  vector<int> next_max(n);
  stack<pair<int,int>> q_min;
  stack<pair<int,int>> q_max;

  for (int i = n-1; i>=0; --i) {
    while (q_min.size() != 0 && q_min.top().first >= v[i]) q_min.pop();
    while (q_max.size() != 0 && q_max.top().first <= v[i]) q_max.pop();
    if (q_min.size() != 0) next_min[i] = q_min.top().second; else next_min[i] = n;
    if (q_max.size() != 0) next_max[i] = q_max.top().second; else next_max[i] = n;
    if (v[i] < 1e9 - k + 1) q_min.push({v[i], i});
    if (v[i] > k) q_max.push({v[i], i});
  }

  // for (int i = 0; i < n; i++) {
  //   cout << "next_min: " << next_min[i] << "\n";
  //   cout << "next_max: " << next_max[i] << "\n";
  // }
  
  ll t = 0;

  for (int s = 0; s < n; s++) {
    int i = s;
    int mini = i;
    int maxi = i;

    while (i < n) {
      if (v[maxi]-v[mini] > k) break;

      if (next_min[mini] < next_max[maxi]) {
        t += next_min[mini] - i;
        i = next_min[mini];
        mini = next_min[mini];
      } else {
        t += next_max[maxi]- i;
        i = next_max[maxi];
        maxi = next_max[maxi];
      }
    }
  }

  cout << t;
}

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

correct output
`5050` view save

user output
`5050` 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: ACCEPTED

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

correct output
`5050` view save

user output
`5050` view save

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

correct output
`2001000` view save

user output
`2001000` 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: ACCEPTED

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

correct output
`1287776` view save

user output
`1287776` view save

Test 10

Group: 2, 3

Verdict: ACCEPTED

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

correct output
`2001000` view save

user output
`2001000` view save

Test 11

Group: 3

Verdict: ACCEPTED

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

Test 12

Group: 3

Verdict: ACCEPTED

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

Test 13

Group: 3

Verdict: ACCEPTED

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

correct output
`123292` view save

user output
`123292` view save

Test 14

Group: 3

Verdict: ACCEPTED

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

correct output
`4946886742` view save

user output
`4946886742` view save

Test 15

Group: 3

Verdict: ACCEPTED

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

correct output
`5000050000` view save

user output
`5000050000` 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

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 (lady-stardust)