oj.uz

Submission #77909

# Submission time Handle Problem Language Result Execution time Memory
77909 2018-10-01T07:13:01 Z Saboon Global Warming (CEOI18_glo) C++14
48 / 100
 2000 ms 123284 KB 
#include <iostream>
#include <queue>
#include <bitset>
#include <stack>
#include <vector>
#include <cstring>
#include <cmath>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <iomanip>
#define F first
#define S second
#define PB push_back
#define PF push_front
#define MP make_pair

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef unsigned long long ull;

const int inf = 1e9 + 100;
const int maxn = 2e5 + 100;

unordered_map <int, int> seg[2];

int dp[maxn][2], a[maxn];

void change (int idx, int val, bool wh) {
    for (; idx <= inf; idx += idx & -idx)
        seg[wh][idx] = max (seg[wh][idx], val);
}

int get (int idx, bool wh) {
    if (idx == 0)
        return 0;
    idx = min (idx, inf - 1);
    int ret = 0;
    for (; idx > 0; idx -= idx & -idx)
        ret = max (ret, seg[wh][idx]);
    return ret;
}

int main() {
    ios_base::sync_with_stdio(false);
    int n, x;
    cin >> n >> x;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    dp[0][0] = 1;
    dp[0][1] = 1;
    int ans = 1;
    change (a[0], dp[0][0], 0);
    change (a[0], dp[0][1], 1);
    for (int i = 1; i < n; i++) {
        dp[i][0] = get (a[i] - 1, 0) + 1;
        dp[i][1] = get (a[i] + x - 1, 0) + 1;
        dp[i][1] = max (dp[i][1], get (a[i] - 1, 1) + 1);
        change (a[i], dp[i][0], 0);
        change (a[i], dp[i][1], 1);
        ans = max (ans, dp[i][1]);
    }
    cout << ans << endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 420 KB Output is correct
2 Correct 3 ms 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 608 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 2 ms 624 KB Output is correct
10 Correct 2 ms 756 KB Output is correct
11 Correct 2 ms 756 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 420 KB Output is correct
2 Correct 3 ms 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 608 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 2 ms 624 KB Output is correct
10 Correct 2 ms 756 KB Output is correct
11 Correct 2 ms 756 KB Output is correct
12 Correct 3 ms 756 KB Output is correct
13 Correct 2 ms 756 KB Output is correct
14 Correct 2 ms 800 KB Output is correct
15 Correct 3 ms 800 KB Output is correct
16 Correct 2 ms 800 KB Output is correct
17 Correct 2 ms 800 KB Output is correct
18 Correct 2 ms 800 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 420 KB Output is correct
2 Correct 3 ms 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 608 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 2 ms 624 KB Output is correct
10 Correct 2 ms 756 KB Output is correct
11 Correct 2 ms 756 KB Output is correct
12 Correct 3 ms 756 KB Output is correct
13 Correct 2 ms 756 KB Output is correct
14 Correct 2 ms 800 KB Output is correct
15 Correct 3 ms 800 KB Output is correct
16 Correct 2 ms 800 KB Output is correct
17 Correct 2 ms 800 KB Output is correct
18 Correct 2 ms 800 KB Output is correct
19 Correct 16 ms 2888 KB Output is correct
20 Correct 14 ms 3036 KB Output is correct
21 Correct 15 ms 3036 KB Output is correct
22 Correct 12 ms 3036 KB Output is correct
23 Correct 9 ms 3036 KB Output is correct
24 Correct 11 ms 3036 KB Output is correct
25 Correct 5 ms 3036 KB Output is correct
26 Correct 7 ms 3036 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1038 ms 123284 KB Output is correct
2 Correct 1047 ms 123284 KB Output is correct
3 Correct 1010 ms 123284 KB Output is correct
4 Correct 516 ms 123284 KB Output is correct
5 Correct 2 ms 123284 KB Output is correct
6 Correct 131 ms 123284 KB Output is correct
7 Correct 735 ms 123284 KB Output is correct

Subtask #6
0 / 17.0

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

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 420 KB Output is correct
2 Correct 3 ms 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 608 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 2 ms 624 KB Output is correct
10 Correct 2 ms 756 KB Output is correct
11 Correct 2 ms 756 KB Output is correct
12 Correct 3 ms 756 KB Output is correct
13 Correct 2 ms 756 KB Output is correct
14 Correct 2 ms 800 KB Output is correct
15 Correct 3 ms 800 KB Output is correct
16 Correct 2 ms 800 KB Output is correct
17 Correct 2 ms 800 KB Output is correct
18 Correct 2 ms 800 KB Output is correct
19 Correct 16 ms 2888 KB Output is correct
20 Correct 14 ms 3036 KB Output is correct
21 Correct 15 ms 3036 KB Output is correct
22 Correct 12 ms 3036 KB Output is correct
23 Correct 9 ms 3036 KB Output is correct
24 Correct 11 ms 3036 KB Output is correct
25 Correct 5 ms 3036 KB Output is correct
26 Correct 7 ms 3036 KB Output is correct
27 Execution timed out 2063 ms 123284 KB Time limit exceeded
28 Halted 0 ms 0 KB -