Submission details
Task:Moon landing
Sender:aalto26dm_033
Submission time:2026-09-21 17:13:01 +0300
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#30.00 sdetails
#40.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#100.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
#190.00 sdetails
#200.00 sdetails
#21ACCEPTED0.00 sdetails
#220.00 sdetails
#230.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#260.00 sdetails
#27ACCEPTED0.00 sdetails
#280.00 sdetails
#290.00 sdetails
#300.00 sdetails
#310.00 sdetails
#320.00 sdetails
#330.00 sdetails
#340.00 sdetails
#350.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#380.00 sdetails
#39ACCEPTED0.00 sdetails
#400.00 sdetails
#410.00 sdetails
#420.00 sdetails
#43ACCEPTED0.00 sdetails
#440.00 sdetails
#450.00 sdetails
#46ACCEPTED0.00 sdetails
#47ACCEPTED0.00 sdetails
#480.00 sdetails
#49ACCEPTED0.00 sdetails
#500.01 sdetails
#510.01 sdetails
#520.01 sdetails
#530.01 sdetails
#540.01 sdetails
#550.01 sdetails
#560.06 sdetails
#570.06 sdetails
#580.06 sdetails
#59ACCEPTED0.06 sdetails
#600.06 sdetails
#610.06 sdetails
#620.06 sdetails
#63ACCEPTED0.06 sdetails
#640.03 sdetails

Code

#include <iostream>
#include <vector>
#include <algorithm>
#include <stdlib.h>

using namespace std;

int main() {
    int n, x;
    cin >> n >> x;

    vector<long long> surface(n + 1, 0);
    cin >> surface[1];
    long long max_pos = 1;
    long long max_length = 1;
    long long highest = surface[1];
    long long lowest = surface[1];
    long long count = 1;
    for (int i = 2; i <= n; i++) {
        cin >> surface[i];
        if(abs(highest - surface[i]) <= x && abs(lowest - surface[i])){
            count++;
            if(count >= max_length){
                max_length = count;
                max_pos = i + 1 - count;
            }
            if(highest < surface[i]) highest = surface[i];
            else if(lowest > surface[i]) lowest = surface[i];
        }
        else{
            count = 1;
            lowest = surface[i];
            highest = surface[i];
        }
    }

    cout << max_pos << " " << max_length << endl;
}       

Test details

Test 1

Verdict: ACCEPTED

input
1 1
6 

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:

input
2 4
7 7 

correct output
1 2

user output
1 1

Test 4

Verdict:

input
3 8
5 10 5 

correct output
1 3

user output
1 2

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:

input
5 6
6 7 9 6 9 

correct output
1 5

user output
1 3

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
4 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:

input
5 0
4 5 5 5 0 

correct output
2 3

user output
1 1

Test 20

Verdict:

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

correct output
1 10

user output
4 7

Test 21

Verdict: ACCEPTED

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

correct output
1 3

user output
4 3

Test 22

Verdict:

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

correct output
6 5

user output
3 3

Test 23

Verdict:

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

correct output
6 5

user output
5 6

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
4 2

Test 26

Verdict:

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

correct output
2 7

user output
6 5

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:

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

correct output
2 8

user output
2 6

Test 29

Verdict:

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

correct output
2 3

user output
1 1

Test 30

Verdict:

input
100 589284011
636562059 767928733 906523440 ...

correct output
1 12

user output
64 16

Test 31

Verdict:

input
100 447773961
773442531 122815 137572578 324...

correct output
2 10

user output
2 14

Test 32

Verdict:

input
100 468145962
198730371 27838075 590195589 4...

correct output
60 11

user output
53 18

Test 33

Verdict:

input
100 591414746
75940262 760367934 901888416 3...

correct output
34 14

user output
74 17

Test 34

Verdict:

input
100 967034923
587586157 185430193 918715994 ...

correct output
37 64

user output
1 100

Test 35

Verdict:

input
100 238363352
59249203 934941691 892631471 2...

correct output
34 5

user output
95 6

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
96 3

Test 38

Verdict:

input
100 937837680
11934037 257096282 933290529 4...

correct output
29 54

user output
28 73

Test 39

Verdict: ACCEPTED

input
100 11139167
391337047 538883743 535937149 ...

correct output
2 3

user output
2 3

Test 40

Verdict:

input
200 589284011
636562059 767928733 906523440 ...

correct output
99 15

user output
95 24

Test 41

Verdict:

input
200 447773961
773442531 122815 137572578 324...

correct output
2 10

user output
2 14

Test 42

Verdict:

input
200 468145962
198730371 27838075 590195589 4...

correct output
60 11

user output
53 18

Test 43

Verdict: ACCEPTED

input
200 591414746
75940262 760367934 901888416 3...

correct output
104 24

user output
104 24

Test 44

Verdict:

input
200 967034923
587586157 185430193 918715994 ...

correct output
37 111

user output
1 147

Test 45

Verdict:

input
200 238363352
59249203 934941691 892631471 2...

correct output
34 5

user output
95 6

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
198 3

Test 48

Verdict:

input
200 937837680
11934037 257096282 933290529 4...

correct output
84 66

user output
28 91

Test 49

Verdict: ACCEPTED

input
200 11139167
391337047 538883743 535937149 ...

correct output
2 3

user output
2 3

Test 50

Verdict:

input
1000 589284011
636562059 767928733 906523440 ...

correct output
99 15

user output
95 24

Test 51

Verdict:

input
1000 447773961
773442531 122815 137572578 324...

correct output
2 10

user output
799 14

Test 52

Verdict:

input
1000 468145962
198730371 27838075 590195589 4...

correct output
60 11

user output
53 18

Test 53

Verdict:

input
10000 591414746
75940262 760367934 901888416 3...

correct output
104 24

user output
2926 27

Test 54

Verdict:

input
10000 967034923
587586157 185430193 918715994 ...

correct output
3660 279

user output
3659 280

Test 55

Verdict:

input
10000 238363352
59249203 934941691 892631471 2...

correct output
325 9

user output
324 12

Test 56

Verdict:

input
100000 958701282
356460600 224848373 881788058 ...

correct output
66493 302

user output
66454 341

Test 57

Verdict:

input
100000 81935403
244103473 837431430 342493821 ...

correct output
28066 7

user output
89122 7

Test 58

Verdict:

input
100000 937837680
11934037 257096282 933290529 4...

correct output
91851 177

user output
16101 202

Test 59

Verdict: ACCEPTED

input
100000 11139167
391337047 538883743 535937149 ...

correct output
84138 4

user output
84138 4

Test 60

Verdict:

input
100000 239756970
350744379 561742366 59793553 5...

correct output
94284 12

user output
32767 13

Test 61

Verdict:

input
100000 316394139
195182396 569713187 906489185 ...

correct output
12844 13

user output
12840 17

Test 62

Verdict:

input
100000 698334026
81615940 542726430 464528081 9...

correct output
28811 40

user output
21959 52

Test 63

Verdict: ACCEPTED

input
100000 104725911
462211739 817385661 443179352 ...

correct output
46788 9

user output
46788 9

Test 64

Verdict:

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

correct output
1 100000

user output
12784 73