CSES - Aalto Competitive Programming 2024 - wk4 - Mon

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
test	verdict	time
#1	ACCEPTED	0.00 s	details
#2	ACCEPTED	0.00 s	details
#3	ACCEPTED	0.00 s	details
#4	ACCEPTED	0.00 s	details
#5	ACCEPTED	0.00 s	details
#6	ACCEPTED	0.00 s	details
#7	ACCEPTED	0.00 s	details
#8	ACCEPTED	0.00 s	details
#9	ACCEPTED	0.00 s	details
#10	ACCEPTED	0.00 s	details
#11	ACCEPTED	0.00 s	details
#12	ACCEPTED	0.00 s	details
#13	ACCEPTED	0.00 s	details
#14	ACCEPTED	0.00 s	details
#15	ACCEPTED	0.00 s	details
#16	ACCEPTED	0.00 s	details
#17	ACCEPTED	0.00 s	details
#18	ACCEPTED	0.00 s	details
#19	ACCEPTED	0.00 s	details
#20	ACCEPTED	0.00 s	details
#21	ACCEPTED	0.00 s	details
#22	ACCEPTED	0.00 s	details
#23	ACCEPTED	0.00 s	details
#24	ACCEPTED	0.00 s	details
#25	ACCEPTED	0.00 s	details
#26	ACCEPTED	0.00 s	details
#27	ACCEPTED	0.00 s	details
#28	ACCEPTED	0.00 s	details
#29	ACCEPTED	0.00 s	details
#30	ACCEPTED	0.00 s	details
#31	ACCEPTED	0.00 s	details
#32	ACCEPTED	0.00 s	details
#33	ACCEPTED	0.00 s	details
#34	ACCEPTED	0.00 s	details
#35	ACCEPTED	0.00 s	details
#36	ACCEPTED	0.00 s	details
#37	ACCEPTED	0.00 s	details
#38	ACCEPTED	0.00 s	details
#39	ACCEPTED	0.00 s	details
#40	ACCEPTED	0.00 s	details
#41	ACCEPTED	0.00 s	details
#42	ACCEPTED	0.00 s	details
#43	ACCEPTED	0.00 s	details
#44	ACCEPTED	0.00 s	details
#45	ACCEPTED	0.00 s	details
#46	ACCEPTED	0.00 s	details
#47	ACCEPTED	0.00 s	details
#48	ACCEPTED	0.00 s	details
#49	ACCEPTED	0.00 s	details
#50	ACCEPTED	0.01 s	details
#51	ACCEPTED	0.01 s	details
#52	ACCEPTED	0.01 s	details
#53	ACCEPTED	0.04 s	details
#54	ACCEPTED	0.05 s	details
#55	ACCEPTED	0.04 s	details
#56	ACCEPTED	0.56 s	details
#57	ACCEPTED	0.56 s	details
#58	ACCEPTED	0.56 s	details
#59	ACCEPTED	0.56 s	details
#60	ACCEPTED	0.56 s	details
#61	ACCEPTED	0.56 s	details
#62	ACCEPTED	0.57 s	details
#63	ACCEPTED	0.56 s	details
#64	ACCEPTED	0.57 s	details

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

correct output
`1 1` view save

user output
`1 1` view save

Test 2

Verdict: ACCEPTED

input
`2 10 0 2` view save

correct output
`1 2` view save

user output
`1 2` view save

Test 3

Verdict: ACCEPTED

input
`2 4 7 7` view save

correct output
`1 2` view save

user output
`1 2` view save

Test 4

Verdict: ACCEPTED

input
`3 8 5 10 5` view save

correct output
`1 3` view save

user output
`1 3` view save

Test 5

Verdict: ACCEPTED

input
`3 10 3 6 7` view save

correct output
`1 3` view save

user output
`1 3` view save

Test 6

Verdict: ACCEPTED

input
`3 0 6 9 5` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 7

Verdict: ACCEPTED

input
`4 3 8 5 1 10` view save

correct output
`1 2` view save

user output
`1 2` view save

Test 8

Verdict: ACCEPTED

input
`4 9 6 3 8 7` view save

correct output
`1 4` view save

user output
`1 4` view save

Test 9

Verdict: ACCEPTED

input
`4 10 1 9 6 8` view save

correct output
`1 4` view save

user output
`1 4` view save

Test 10

Verdict: ACCEPTED

input
`5 6 6 7 9 6 9` view save

correct output
`1 5` view save

user output
`1 5` view save

Test 11

Verdict: ACCEPTED

input
`5 4 10 7 10 0 1` view save

correct output
`1 3` view save

user output
`1 3` view save

Test 12

Verdict: ACCEPTED

input
`5 4 2 0 10 6 10` view save

correct output
`3 3` view save

user output
`3 3` view save

Test 13

Verdict: ACCEPTED

input
`5 6 0 7 9 3 1` view save

correct output
`2 3` view save

user output
`2 3` view save

Test 14

Verdict: ACCEPTED

input
`5 10 9 6 1 10 9` view save

correct output
`1 5` view save

user output
`1 5` view save

Test 15

Verdict: ACCEPTED

input
`5 2 0 9 9 2 4` view save

correct output
`2 2` view save

user output
`2 2` view save

Test 16

Verdict: ACCEPTED

input
`5 9 10 3 2 9 0` view save

correct output
`1 4` view save

user output
`1 4` view save

Test 17

Verdict: ACCEPTED

input
`5 0 2 8 3 4 10` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 18

Verdict: ACCEPTED

input
`5 9 0 10 2 9 4` view save

correct output
`2 4` view save

user output
`2 4` view save

Test 19

Verdict: ACCEPTED

input
`5 0 4 5 5 5 0` view save

correct output
`2 3` view save

user output
`2 3` view save

Test 20

Verdict: ACCEPTED

input
`10 6 6 7 9 6 9 5 9 4 6 7` view save

correct output
`1 10` view save

user output
`1 10` view save

Test 21

Verdict: ACCEPTED

input
`10 4 10 7 10 0 1 3 10 1 2 1` view save

correct output
`1 3` view save

user output
`1 3` view save

Test 22

Verdict: ACCEPTED

input
`10 4 2 0 10 6 10 4 5 4 3 3` view save

correct output
`6 5` view save

user output
`6 5` view save

Test 23

Verdict: ACCEPTED

input
`10 6 0 7 9 3 1 5 6 9 4 9` view save

correct output
`6 5` view save

user output
`6 5` view save

Test 24

Verdict: ACCEPTED

input
`10 10 9 6 1 10 9 7 6 7 6 2` view save

correct output
`1 10` view save

user output
`1 10` view save

Test 25

Verdict: ACCEPTED

input
`10 2 0 9 9 2 4 10 10 5 0 6` view save

correct output
`2 2` view save

user output
`2 2` view save

Test 26

Verdict: ACCEPTED

input
`10 9 10 3 2 9 0 0 4 1 10 6` view save

correct output
`2 7` view save

user output
`2 7` view save

Test 27

Verdict: ACCEPTED

input
`10 0 2 8 3 4 10 7 5 10 3 5` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 28

Verdict: ACCEPTED

input
`10 9 0 10 2 9 4 5 8 2 4 0` view save

correct output
`2 8` view save

user output
`2 8` view save

Test 29

Verdict: ACCEPTED

input
`10 0 4 5 5 5 0 1 3 1 0 2` view save

correct output
`2 3` view save

user output
`2 3` view save

Test 30

Verdict: ACCEPTED

input
`100 589284011 636562059 767928733 906523440 ...` view save

correct output
`1 12` view save

user output
`1 12` view save

Test 31

Verdict: ACCEPTED

input
`100 447773961 773442531 122815 137572578 324...` view save

correct output
`2 10` view save

user output
`2 10` view save

Test 32

Verdict: ACCEPTED

input
`100 468145962 198730371 27838075 590195589 4...` view save

correct output
`60 11` view save

user output
`60 11` view save

Test 33

Verdict: ACCEPTED

input
`100 591414746 75940262 760367934 901888416 3...` view save

correct output
`34 14` view save

user output
`34 14` view save

Test 34

Verdict: ACCEPTED

input
`100 967034923 587586157 185430193 918715994 ...` view save

correct output
`37 64` view save

user output
`37 64` view save

Test 35

Verdict: ACCEPTED

input
`100 238363352 59249203 934941691 892631471 2...` view save

correct output
`34 5` view save

user output
`34 5` view save

Test 36

Verdict: ACCEPTED

input
`100 958701282 356460600 224848373 881788058 ...` view save

correct output
`1 100` view save

user output
`1 100` view save

Test 37

Verdict: ACCEPTED

input
`100 81935403 244103473 837431430 342493821 ...` view save

correct output
`21 3` view save

user output
`21 3` view save

Test 38

Verdict: ACCEPTED

input
`100 937837680 11934037 257096282 933290529 4...` view save

correct output
`29 54` view save

user output
`29 54` view save

Test 39

Verdict: ACCEPTED

input
`100 11139167 391337047 538883743 535937149 ...` view save

correct output
`2 3` view save

user output
`2 3` view save

Test 40

Verdict: ACCEPTED

input
`200 589284011 636562059 767928733 906523440 ...` view save

correct output
`99 15` view save

user output
`99 15` view save

Test 41

Verdict: ACCEPTED

input
`200 447773961 773442531 122815 137572578 324...` view save

correct output
`2 10` view save

user output
`2 10` view save

Test 42

Verdict: ACCEPTED

input
`200 468145962 198730371 27838075 590195589 4...` view save

correct output
`60 11` view save

user output
`60 11` view save

Test 43

Verdict: ACCEPTED

input
`200 591414746 75940262 760367934 901888416 3...` view save

correct output
`104 24` view save

user output
`104 24` view save

Test 44

Verdict: ACCEPTED

input
`200 967034923 587586157 185430193 918715994 ...` view save

correct output
`37 111` view save

user output
`37 111` view save

Test 45

Verdict: ACCEPTED

input
`200 238363352 59249203 934941691 892631471 2...` view save

correct output
`34 5` view save

user output
`34 5` view save

Test 46

Verdict: ACCEPTED

input
`200 958701282 356460600 224848373 881788058 ...` view save

correct output
`1 138` view save

user output
`1 138` view save

Test 47

Verdict: ACCEPTED

input
`200 81935403 244103473 837431430 342493821 ...` view save

correct output
`21 3` view save

user output
`21 3` view save

Test 48

Verdict: ACCEPTED

input
`200 937837680 11934037 257096282 933290529 4...` view save

correct output
`84 66` view save

user output
`84 66` view save

Test 49

Verdict: ACCEPTED

input
`200 11139167 391337047 538883743 535937149 ...` view save

correct output
`2 3` view save

user output
`2 3` view save

Test 50

Verdict: ACCEPTED

input
`1000 589284011 636562059 767928733 906523440 ...` view save

correct output
`99 15` view save

user output
`99 15` view save

Test 51

Verdict: ACCEPTED

input
`1000 447773961 773442531 122815 137572578 324...` view save

correct output
`2 10` view save

user output
`2 10` view save

Test 52

Verdict: ACCEPTED

input
`1000 468145962 198730371 27838075 590195589 4...` view save

correct output
`60 11` view save

user output
`60 11` view save

Test 53

Verdict: ACCEPTED

input
`10000 591414746 75940262 760367934 901888416 3...` view save

correct output
`104 24` view save

user output
`104 24` view save

Test 54

Verdict: ACCEPTED

input
`10000 967034923 587586157 185430193 918715994 ...` view save

correct output
`3660 279` view save

user output
`3660 279` view save

Test 55

Verdict: ACCEPTED

input
`10000 238363352 59249203 934941691 892631471 2...` view save

correct output
`325 9` view save

user output
`325 9` view save

Test 56

Verdict: ACCEPTED

input
`100000 958701282 356460600 224848373 881788058 ...` view save

correct output
`66493 302` view save

user output
`66493 302` view save

Test 57

Verdict: ACCEPTED

input
`100000 81935403 244103473 837431430 342493821 ...` view save

correct output
`28066 7` view save

user output
`28066 7` view save

Test 58

Verdict: ACCEPTED

input
`100000 937837680 11934037 257096282 933290529 4...` view save

correct output
`91851 177` view save

user output
`91851 177` view save

Test 59

Verdict: ACCEPTED

input
`100000 11139167 391337047 538883743 535937149 ...` view save

correct output
`84138 4` view save

user output
`84138 4` view save

Test 60

Verdict: ACCEPTED

input
`100000 239756970 350744379 561742366 59793553 5...` view save

correct output
`94284 12` view save

user output
`94284 12` view save

Test 61

Verdict: ACCEPTED

input
`100000 316394139 195182396 569713187 906489185 ...` view save

correct output
`12844 13` view save

user output
`12844 13` view save

Test 62

Verdict: ACCEPTED

input
`100000 698334026 81615940 542726430 464528081 9...` view save

correct output
`28811 40` view save

user output
`28811 40` view save

Test 63

Verdict: ACCEPTED

input
`100000 104725911 462211739 817385661 443179352 ...` view save

correct output
`46788 9` view save

user output
`46788 9` view save

Test 64

Verdict: ACCEPTED

input
`100000 20 13 15 11 10 13 16 17 18 15 18 ...` view save

correct output
`1 100000` view save

user output
`1 100000` view save

Aalto Competitive Programming 2024 - wk4 - Mon

Moon landing

Compiler report

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

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Test 52

Test 53

Test 54

Test 55

Test 56

Test 57

Test 58

Test 59

Test 60

Test 61

Test 62

Test 63

Test 64

Tasks

Submissions (bubu2006)