CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Alitaulukot
Sender:	AtskaFin
Submission time:	2020-10-11 19:52:57 +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.03 s	2, 3	details
#7	ACCEPTED	0.03 s	2, 3	details
#8	ACCEPTED	0.02 s	2, 3	details
#9	ACCEPTED	0.03 s	2, 3	details
#10	ACCEPTED	0.03 s	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>
#include <set>
#include <map>
 
using namespace std;
 
int N = 2; // Segmenttipuiden koko
vector<int> minTree;
vector<int> maxTree;
 
int n; // Taulukon koko
int maxDiff; // Suurin sallittu erotus
int answer;
vector<pair<int, int>> v; // Syötteenä annettu taulukko
set<pair<int, int>> s;
map<int, int> m;

void updateMin(int k, int x) {
    k += n;
    minTree[k] = x;
    for (k /= 2; k >= 1; k /= 2) {
      minTree[k] = min(minTree[2*k],minTree[2*k+1]);
    }
}
 
void updateMax(int k, int x) {
    k += n;
    maxTree[k] = x;
    for (k /= 2; k >= 1; k /= 2) {
      maxTree[k] = max(maxTree[2*k],maxTree[2*k+1]);
    }
}
 
int getMin(int a, int b) {
    if (a > b) {
      int storage = a;
      a = b;
      b = storage;
    }

    a += n; b += n;
    int x = minTree[a];
    while (a <= b) {
        if (a%2 == 1) x = min(x,minTree[a++]);
        if (b%2 == 0) x = min(x,minTree[b--]);
        a /= 2; b /= 2;
    }
    return x;
}
 
int getMax(int a, int b) {
    if (a > b) {
      int storage = a;
      a = b;
      b = storage;
    }

    a += n; b += n;
    int x = maxTree[a];
    while (a <= b) {
        if (a%2 == 1) x = max(x,maxTree[a++]);
        if (b%2 == 0) x = max(x,maxTree[b--]);
        a /= 2; b /= 2;
    }
    return x;
}
 
int main() {
  cin >> n >> maxDiff;
 
  while (N < n * 2) {
    N *= 2;
  }
 
  minTree.resize(N);
  maxTree.resize(N);
  for (int i = 1; i < N; i++) {
    minTree[i] = 1000000001;
    maxTree[i] = -1;
  }
 
  v.resize(n);
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    v[i] = make_pair(x, 1);
    s.insert(make_pair(x, i));
    updateMin(i, x);
    updateMax(i, x);
  }

  for (int i = 0; i < n; i++) {
    auto it = s.lower_bound({ v[i].first-maxDiff, 1});
    int minIndex = n;

    while (it != s.end()) {

      if ((*it).first > v[i].first+maxDiff) break;
      else {
        if ((*it).second != i
          && v[(*it).second].second == 1
          && (*it).second > i)
            {
          if ((*it).second < minIndex) minIndex = (*it).second;
        }
      }

      v[i].second = 0;
      it++;
    }

    m[i] = minIndex;
    s.erase(make_pair(v[i].first, i));
  }

  for (int i = 0; i < n; i++) {
    int minimum = getMin(i, m[i]);
    int maximum = getMax(i, m[i]);

    for (int j = m[i]; j < n; j++) {
      if (v[j].first < minimum) minimum = v[j].first;
      if (v[j].first > maximum) maximum = v[j].first;
 
      if (abs(minimum - maximum) <= maxDiff) answer++;
    }
  }
 
  cout << answer + n;
}

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: 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 (AtskaFin)