CSES - Aalto Competitive Programming 2024 - wk4 - Mon - Results
Submission details
Task:Moon landing
Sender:bubu2006
Submission time:2024-09-23 16:30:36 +0300
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#30ACCEPTED0.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#33ACCEPTED0.00 sdetails
#34ACCEPTED0.00 sdetails
#35ACCEPTED0.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#38ACCEPTED0.00 sdetails
#39ACCEPTED0.00 sdetails
#40ACCEPTED0.00 sdetails
#41ACCEPTED0.00 sdetails
#42ACCEPTED0.00 sdetails
#43ACCEPTED0.00 sdetails
#44ACCEPTED0.00 sdetails
#45ACCEPTED0.00 sdetails
#46ACCEPTED0.00 sdetails
#47ACCEPTED0.00 sdetails
#48ACCEPTED0.00 sdetails
#49ACCEPTED0.00 sdetails
#50ACCEPTED0.01 sdetails
#51ACCEPTED0.01 sdetails
#52ACCEPTED0.01 sdetails
#53ACCEPTED0.04 sdetails
#54ACCEPTED0.05 sdetails
#55ACCEPTED0.04 sdetails
#56ACCEPTED0.56 sdetails
#57ACCEPTED0.56 sdetails
#58ACCEPTED0.56 sdetails
#59ACCEPTED0.56 sdetails
#60ACCEPTED0.56 sdetails
#61ACCEPTED0.56 sdetails
#62ACCEPTED0.57 sdetails
#63ACCEPTED0.56 sdetails
#64ACCEPTED0.57 sdetails

Compiler report

input/code.cpp: In member function 'void SegmentTreeMax::upd(long long int, long long int, long long int, long long int, long long int)':
input/code.cpp:72:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   72 |         int m = lx + rx >> 1;
      |                 ~~~^~~~
input/code.cpp: In member function 'long long int SegmentTreeMax::get(long long int, long long int, long long int, long long int, long long int)':
input/code.cpp:85:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   85 |         int m = lx + rx >> 1;
      |                 ~~~^~~~
input/code.cpp: In member function 'void SegmentTreeMin::upd(long long int, long long int, long long int, long long int, long long int)':
input/code.cpp:109:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  109 |         int m = lx + rx >> 1;
      |                 ~~~^~~~
input/code.cpp: In member function 'long long int SegmentTreeMin::get(long long int, long long i...

Code

#include <bits/stdc++.h>
using namespace std;
#define int long long
string to_string(string s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() {
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
const int N = 1e5 + 5;
int n, x, a[N];
struct SegmentTreeMax {
int n, val;
vector<int> nd;
SegmentTreeMax() = default;
SegmentTreeMax(int _n, int _val) {
n = _n, val = _val;
nd.resize(4 * n + 5, val);
}
void upd(int i, int v, int x, int lx, int rx) {
if (lx == rx) {
nd[x] = v;
return;
}
int m = lx + rx >> 1;
if (i <= m) upd(i, v, x << 1, lx, m);
else upd(i, v, x << 1 | 1, m + 1, rx);
nd[x] = max(nd[x << 1], nd[x << 1 | 1]);
}
void upd(int i, int v) {
upd(i, v, 1, 1, n);
}
int get(int l, int r, int x, int lx, int rx) {
if (lx > r || rx < l) return val;
if (l <= lx && rx <= r) return nd[x];
int m = lx + rx >> 1;
return max(get(l, r, x << 1, lx, m), get(l, r, x << 1 | 1, m + 1, rx));
}
int get(int l, int r) {
return get(l, r, 1, 1, n);
}
};
struct SegmentTreeMin {
int n, val;
vector<int> nd;
SegmentTreeMin() = default;
SegmentTreeMin(int _n, int _val) {
n = _n, val = _val;
nd.resize(4 * n + 5, val);
}
void upd(int i, int v, int x, int lx, int rx) {
if (lx == rx) {
nd[x] = v;
return;
}
int m = lx + rx >> 1;
if (i <= m) upd(i, v, x << 1, lx, m);
else upd(i, v, x << 1 | 1, m + 1, rx);
nd[x] = min(nd[x << 1], nd[x << 1 | 1]);
}
void upd(int i, int v) {
upd(i, v, 1, 1, n);
}
int get(int l, int r, int x, int lx, int rx) {
if (lx > r || rx < l) return val;
if (l <= lx && rx <= r) return nd[x];
int m = lx + rx >> 1;
return min(get(l, r, x << 1, lx, m), get(l, r, x << 1 | 1, m + 1, rx));
}
int get(int l, int r) {
return get(l, r, 1, 1, n);
}
};
signed main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
SegmentTreeMax mx(n, 0);
SegmentTreeMin mn(n, 1e9);
for (int i = 1; i <= n; i++) {
mx.upd(i, a[i]);
mn.upd(i, a[i]);
}
int pos = -1, len = -1;
for (int i = 1; i <= n; i++) {
int lo = i, hi = n, ans = -1;
while (lo <= hi) {
int mid = lo + hi >> 1;
if (mx.get(i, mid) - mn.get(i, mid) <= x) {
ans = mid;
lo = mid + 1;
} else {
hi = mid - 1;
}
}
if (ans - i + 1 > len) {
len = ans - i + 1;
pos = i;
}
}
cout << pos << ' ' << len << '\n';
}

Test details

Test 1

Verdict: ACCEPTED

input
1 1

correct output
1 1

user output
1 1

Test 2

Verdict: ACCEPTED

input
2 10
0 2 

correct output
1 2

user output
1 2

Test 3

Verdict: ACCEPTED

input
2 4
7 7 

correct output
1 2

user output
1 2

Test 4

Verdict: ACCEPTED

input
3 8
5 10 5 

correct output
1 3

user output
1 3

Test 5

Verdict: ACCEPTED

input
3 10
3 6 7 

correct output
1 3

user output
1 3

Test 6

Verdict: ACCEPTED

input
3 0
6 9 5 

correct output
1 1

user output
1 1

Test 7

Verdict: ACCEPTED

input
4 3
8 5 1 10 

correct output
1 2

user output
1 2

Test 8

Verdict: ACCEPTED

input
4 9
6 3 8 7 

correct output
1 4

user output
1 4

Test 9

Verdict: ACCEPTED

input
4 10
1 9 6 8 

correct output
1 4

user output
1 4

Test 10

Verdict: ACCEPTED

input
5 6
6 7 9 6 9 

correct output
1 5

user output
1 5

Test 11

Verdict: ACCEPTED

input
5 4
10 7 10 0 1 

correct output
1 3

user output
1 3

Test 12

Verdict: ACCEPTED

input
5 4
2 0 10 6 10 

correct output
3 3

user output
3 3

Test 13

Verdict: ACCEPTED

input
5 6
0 7 9 3 1 

correct output
2 3

user output
2 3

Test 14

Verdict: ACCEPTED

input
5 10
9 6 1 10 9 

correct output
1 5

user output
1 5

Test 15

Verdict: ACCEPTED

input
5 2
0 9 9 2 4 

correct output
2 2

user output
2 2

Test 16

Verdict: ACCEPTED

input
5 9
10 3 2 9 0 

correct output
1 4

user output
1 4

Test 17

Verdict: ACCEPTED

input
5 0
2 8 3 4 10 

correct output
1 1

user output
1 1

Test 18

Verdict: ACCEPTED

input
5 9
0 10 2 9 4 

correct output
2 4

user output
2 4

Test 19

Verdict: ACCEPTED

input
5 0
4 5 5 5 0 

correct output
2 3

user output
2 3

Test 20

Verdict: ACCEPTED

input
10 6
6 7 9 6 9 5 9 4 6 7 

correct output
1 10

user output
1 10

Test 21

Verdict: ACCEPTED

input
10 4
10 7 10 0 1 3 10 1 2 1 

correct output
1 3

user output
1 3

Test 22

Verdict: ACCEPTED

input
10 4
2 0 10 6 10 4 5 4 3 3 

correct output
6 5

user output
6 5

Test 23

Verdict: ACCEPTED

input
10 6
0 7 9 3 1 5 6 9 4 9 

correct output
6 5

user output
6 5

Test 24

Verdict: ACCEPTED

input
10 10
9 6 1 10 9 7 6 7 6 2 

correct output
1 10

user output
1 10

Test 25

Verdict: ACCEPTED

input
10 2
0 9 9 2 4 10 10 5 0 6 

correct output
2 2

user output
2 2

Test 26

Verdict: ACCEPTED

input
10 9
10 3 2 9 0 0 4 1 10 6 

correct output
2 7

user output
2 7

Test 27

Verdict: ACCEPTED

input
10 0
2 8 3 4 10 7 5 10 3 5 

correct output
1 1

user output
1 1

Test 28

Verdict: ACCEPTED

input
10 9
0 10 2 9 4 5 8 2 4 0 

correct output
2 8

user output
2 8

Test 29

Verdict: ACCEPTED

input
10 0
4 5 5 5 0 1 3 1 0 2 

correct output
2 3

user output
2 3

Test 30

Verdict: ACCEPTED

input
100 589284011
636562059 767928733 906523440 ...

correct output
1 12

user output
1 12

Test 31

Verdict: ACCEPTED

input
100 447773961
773442531 122815 137572578 324...

correct output
2 10

user output
2 10

Test 32

Verdict: ACCEPTED

input
100 468145962
198730371 27838075 590195589 4...

correct output
60 11

user output
60 11

Test 33

Verdict: ACCEPTED

input
100 591414746
75940262 760367934 901888416 3...

correct output
34 14

user output
34 14

Test 34

Verdict: ACCEPTED

input
100 967034923
587586157 185430193 918715994 ...

correct output
37 64

user output
37 64

Test 35

Verdict: ACCEPTED

input
100 238363352
59249203 934941691 892631471 2...

correct output
34 5

user output
34 5

Test 36

Verdict: ACCEPTED

input
100 958701282
356460600 224848373 881788058 ...

correct output
1 100

user output
1 100

Test 37

Verdict: ACCEPTED

input
100 81935403
244103473 837431430 342493821 ...

correct output
21 3

user output
21 3

Test 38

Verdict: ACCEPTED

input
100 937837680
11934037 257096282 933290529 4...

correct output
29 54

user output
29 54

Test 39

Verdict: ACCEPTED

input
100 11139167
391337047 538883743 535937149 ...

correct output
2 3

user output
2 3

Test 40

Verdict: ACCEPTED

input
200 589284011
636562059 767928733 906523440 ...

correct output
99 15

user output
99 15

Test 41

Verdict: ACCEPTED

input
200 447773961
773442531 122815 137572578 324...

correct output
2 10

user output
2 10

Test 42

Verdict: ACCEPTED

input
200 468145962
198730371 27838075 590195589 4...

correct output
60 11

user output
60 11

Test 43

Verdict: ACCEPTED

input
200 591414746
75940262 760367934 901888416 3...

correct output
104 24

user output
104 24

Test 44

Verdict: ACCEPTED

input
200 967034923
587586157 185430193 918715994 ...

correct output
37 111

user output
37 111

Test 45

Verdict: ACCEPTED

input
200 238363352
59249203 934941691 892631471 2...

correct output
34 5

user output
34 5

Test 46

Verdict: ACCEPTED

input
200 958701282
356460600 224848373 881788058 ...

correct output
1 138

user output
1 138

Test 47

Verdict: ACCEPTED

input
200 81935403
244103473 837431430 342493821 ...

correct output
21 3

user output
21 3

Test 48

Verdict: ACCEPTED

input
200 937837680
11934037 257096282 933290529 4...

correct output
84 66

user output
84 66

Test 49

Verdict: ACCEPTED

input
200 11139167
391337047 538883743 535937149 ...

correct output
2 3

user output
2 3

Test 50

Verdict: ACCEPTED

input
1000 589284011
636562059 767928733 906523440 ...

correct output
99 15

user output
99 15

Test 51

Verdict: ACCEPTED

input
1000 447773961
773442531 122815 137572578 324...

correct output
2 10

user output
2 10

Test 52

Verdict: ACCEPTED

input
1000 468145962
198730371 27838075 590195589 4...

correct output
60 11

user output
60 11

Test 53

Verdict: ACCEPTED

input
10000 591414746
75940262 760367934 901888416 3...

correct output
104 24

user output
104 24

Test 54

Verdict: ACCEPTED

input
10000 967034923
587586157 185430193 918715994 ...

correct output
3660 279

user output
3660 279

Test 55

Verdict: ACCEPTED

input
10000 238363352
59249203 934941691 892631471 2...

correct output
325 9

user output
325 9

Test 56

Verdict: ACCEPTED

input
100000 958701282
356460600 224848373 881788058 ...

correct output
66493 302

user output
66493 302

Test 57

Verdict: ACCEPTED

input
100000 81935403
244103473 837431430 342493821 ...

correct output
28066 7

user output
28066 7

Test 58

Verdict: ACCEPTED

input
100000 937837680
11934037 257096282 933290529 4...

correct output
91851 177

user output
91851 177

Test 59

Verdict: ACCEPTED

input
100000 11139167
391337047 538883743 535937149 ...

correct output
84138 4

user output
84138 4

Test 60

Verdict: ACCEPTED

input
100000 239756970
350744379 561742366 59793553 5...

correct output
94284 12

user output
94284 12

Test 61

Verdict: ACCEPTED

input
100000 316394139
195182396 569713187 906489185 ...

correct output
12844 13

user output
12844 13

Test 62

Verdict: ACCEPTED

input
100000 698334026
81615940 542726430 464528081 9...

correct output
28811 40

user output
28811 40

Test 63

Verdict: ACCEPTED

input
100000 104725911
462211739 817385661 443179352 ...

correct output
46788 9

user output
46788 9

Test 64

Verdict: ACCEPTED

input
100000 20
13 15 11 10 13 16 17 18 15 18 ...

correct output
1 100000

user output
1 100000