oj.uz

Submission #849202

# Submission time Handle Problem Language Result Execution time Memory
849202 2023-09-14T09:09:20 Z quanlt206 Global Warming (CEOI18_glo) C++14
100 / 100
 51 ms 7088 KB 
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 2e5 + 7;

int n, d, a[N], b[N], f[N], f2[N], g[N], m, ed[N];

int chat(int x, int a[]) {
    int d = 1, c = m, res, g;
    while (d <= c) {
        g = (d + c) >> 1;
        if (a[ed[g]] < x) res = ed[g], d = g + 1; else c = g - 1;
    }
    return res;
}

void buildLISarray(int a[], int f[], int f2[], bool changeF2) {
    m = 1;
    ed[1] = 0;
    f[0] = 1;
    a[0] = -2e9;
    FOR(i, 1, n) {
        int j = chat(a[i], a), k = f[j] + 1;
        if (changeF2) f2[i] = f[chat(a[i] + d, a)] + 1;
        if (m < k) {
            m = k;
            ed[m] = i;
        }
        else
        if (a[ed[k]] > a[i]) ed[k] = i;
        f[i] = k;
    }
    FOR(i, 1, n) f[i]--;
    if (changeF2) {
        FOR(i, 1, n) f2[i]--;
    }
}

int chat2(int x, int a[]) {
    int d = 1, c = m, res, g;
    while (d <= c) {
        g = (d + c) >> 1;
        if (a[ed[g]] > x) res = ed[g], d = g + 1; else c = g - 1;
    }
    return res;
}

void buildLISarray2(int a[], int f[]) {
    m = 1;
    ed[1] = n + 1;
    f[n + 1] = 1;
    a[n + 1] = 2e9 + 7;
    FORD(i, n, 1) {
        int j = chat2(a[i], a), k = f[j] + 1;
        if (m < k) {
            m = k;
            ed[m] = i;
        }
        else
        if (a[ed[k]] < a[i]) ed[k] = i;
        f[i] = k;
    }
    FOR(i, 1, n) f[i]--;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>d;
    FOR(i, 1, n) cin>>a[i];
    buildLISarray(a, f, f2, true);
    FOR(i, 1, n) b[i] = a[i] + d;
    buildLISarray2(b, g);
    int res = 1;
    FOR(i, 1, n) maximize(res, f2[i] + g[i] - 1);
    cout<<res;
    return 0;

}

Compilation message

glo.cpp: In function 'int chat(int, int*)':
glo.cpp:52:12: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   52 |     return res;
      |            ^~~
glo.cpp: In function 'void buildLISarray(int*, int*, int*, bool)':
glo.cpp:61:38: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   61 |         int j = chat(a[i], a), k = f[j] + 1;
      |                                      ^
glo.cpp:62:37: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   62 |         if (changeF2) f2[i] = f[chat(a[i] + d, a)] + 1;
      |                                 ~~~~^~~~~~~~~~~~~
glo.cpp: In function 'int chat2(int, int*)':
glo.cpp:83:12: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   83 |     return res;
      |            ^~~
glo.cpp: In function 'void buildLISarray2(int*, int*)':
glo.cpp:92:39: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   92 |         int j = chat2(a[i], a), k = f[j] + 1;
      |                                       ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 4952 KB Output is correct
2 Correct 49 ms 6736 KB Output is correct
3 Correct 51 ms 6884 KB Output is correct
4 Correct 50 ms 6744 KB Output is correct
5 Correct 24 ms 6232 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 4440 KB Output is correct
2 Correct 12 ms 4952 KB Output is correct
3 Correct 14 ms 4952 KB Output is correct
4 Correct 8 ms 5208 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 6 ms 4696 KB Output is correct
7 Correct 12 ms 4952 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 4444 KB Output is correct
2 Correct 22 ms 5448 KB Output is correct
3 Correct 41 ms 6748 KB Output is correct
4 Correct 27 ms 6232 KB Output is correct
5 Correct 12 ms 5208 KB Output is correct
6 Correct 30 ms 6224 KB Output is correct
7 Correct 24 ms 6848 KB Output is correct
8 Correct 16 ms 5464 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 48 ms 4952 KB Output is correct
28 Correct 49 ms 6736 KB Output is correct
29 Correct 51 ms 6884 KB Output is correct
30 Correct 50 ms 6744 KB Output is correct
31 Correct 24 ms 6232 KB Output is correct
32 Correct 12 ms 4440 KB Output is correct
33 Correct 12 ms 4952 KB Output is correct
34 Correct 14 ms 4952 KB Output is correct
35 Correct 8 ms 5208 KB Output is correct
36 Correct 1 ms 4440 KB Output is correct
37 Correct 6 ms 4696 KB Output is correct
38 Correct 12 ms 4952 KB Output is correct
39 Correct 21 ms 4444 KB Output is correct
40 Correct 22 ms 5448 KB Output is correct
41 Correct 41 ms 6748 KB Output is correct
42 Correct 27 ms 6232 KB Output is correct
43 Correct 12 ms 5208 KB Output is correct
44 Correct 30 ms 6224 KB Output is correct
45 Correct 24 ms 6848 KB Output is correct
46 Correct 16 ms 5464 KB Output is correct
47 Correct 24 ms 5312 KB Output is correct
48 Correct 24 ms 5464 KB Output is correct
49 Correct 50 ms 6736 KB Output is correct
50 Correct 24 ms 6232 KB Output is correct
51 Correct 21 ms 5704 KB Output is correct
52 Correct 23 ms 6232 KB Output is correct
53 Correct 23 ms 6232 KB Output is correct
54 Correct 24 ms 7088 KB Output is correct
55 Correct 38 ms 6744 KB Output is correct