Submission #397668

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
397668	2021-05-02T19:15:40 Z	Victor	Global Warming (CEOI18_glo)	C++17	38 / 100	2000 ms	3792 KB

glo

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1000000007;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int n, x, ans = 0, temps[200001];
    cin >> n >> x;
    vi subseq;

    rep(i, 0, n) cin >> temps[i];

    if (!x) {
        subseq.assign(n, 0);
        int longest = 0;
        rep(i, 0, n) {
            int temp = temps[i];

            int idx = lower_bound(subseq.begin(), subseq.begin() + longest, temp) - subseq.begin();
            subseq[idx] = temp;
            if (idx == longest) ++longest;
        }
        ans = longest;
    }

    else
        rep(i, 0, n+1) {
            subseq.assign(n, 0);
            int longest = 0;
            
            rep(j, 0, n) {
                int temp = temps[j];
                if (j < i) temp -= x;

                int idx = lower_bound(subseq.begin(), subseq.begin() + longest, temp) - subseq.begin();
                subseq[idx] = temp;
                if (idx == longest) ++longest;
            }
            ans = max(ans, longest);
            
            subseq.assign(n, 0);
            longest = 0;
            rep(j, 0, n) {
                int temp = temps[i];
                if (j >= i) temp += x;

                int idx = lower_bound(subseq.begin(), subseq.begin() + longest, temp) - subseq.begin();
                subseq[idx] = temp;
                if (idx == longest) ++longest;
            }
            ans = max(ans, longest);
        }

    cout << ans << endl;
    return 0;
}

Subtask #1

5.0 / 5.0

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

Subtask #2

10.0 / 10.0

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

Subtask #3

13.0 / 13.0

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

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	38 ms	3768 KB	Output is correct
2	Correct	37 ms	3780 KB	Output is correct
3	Correct	43 ms	3792 KB	Output is correct
4	Correct	39 ms	3684 KB	Output is correct
5	Correct	24 ms	3012 KB	Output is correct

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2044 ms	1100 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2067 ms	1996 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	328 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	316 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	316 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	29 ms	332 KB	Output is correct
20	Correct	28 ms	332 KB	Output is correct
21	Correct	29 ms	336 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	21 ms	332 KB	Output is correct
24	Correct	21 ms	332 KB	Output is correct
25	Correct	18 ms	328 KB	Output is correct
26	Correct	19 ms	332 KB	Output is correct
27	Correct	38 ms	3768 KB	Output is correct
28	Correct	37 ms	3780 KB	Output is correct
29	Correct	43 ms	3792 KB	Output is correct
30	Correct	39 ms	3684 KB	Output is correct
31	Correct	24 ms	3012 KB	Output is correct
32	Execution timed out	2044 ms	1100 KB	Time limit exceeded
33	Halted	0 ms	0 KB	-