oj.uz

Submission #88462

# Submission time Handle Problem Language Result Execution time Memory
88462 2018-12-06T03:08:21 Z tieunhi Global Warming (CEOI18_glo) C++14
48 / 100
 79 ms 9244 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define mp make_pair
#define F first
#define S second
#define PB push_back
#define FOR(i, u, v) for (int i = u; i <= v; i++)
#define FORD(i, v, u) for (int i = v; i >= u; i--)
#define N 100005
#define maxc 1ll*100000000000000007
#define ll long long

using namespace std;

int n, d, a[N], b[N], rr[N*2], cur, rig[N];
struct BIT
{
    int t[N];
    void reset()
    {
        memset(t, 0, sizeof t);
    }
    void upd(int x, int val)
    {
        for (; x < N; x += (x & -x)) t[x] = max(t[x], val);
    }
    int get(int x)
    {
        int ans = 0;
        for (; x; x -= (x & -x)) ans = max(ans, t[x]);
        return ans;
    }
}t;
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("INP.TXT", "r", stdin);
    cin >> n >> d;
    FOR(i, 1, n)
    {
        cin >> a[i];
        rr[++cur] = a[i];
        rr[++cur] = a[i] + d;
    }
    sort(rr+1, rr+cur+1);
    cur = unique(rr+1, rr+cur+1) - rr - 1;
    FOR(i, 1, n)
    {
        b[i] = lower_bound(rr+1, rr+cur+1, a[i]+d) - rr;
        a[i] = lower_bound(rr+1, rr+cur+1, a[i]) - rr;
    }
    FORD(i, n, 1)
    {
        rig[i] = t.get(cur - b[i]) + 1;
        t.upd(cur - b[i] + 1, rig[i]);
    }
    int res = rig[1];
    t.reset();
    FOR(i, 1, n)
    {
        res = max(res, t.get(b[i]-1) + rig[i]);
        int valLIS = t.get(a[i]-1) + 1;
        t.upd(a[i], valLIS);
    }
    cout <<res;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 2 ms 1000 KB Output is correct
4 Correct 2 ms 1068 KB Output is correct
5 Correct 2 ms 1136 KB Output is correct
6 Correct 2 ms 1136 KB Output is correct
7 Correct 3 ms 1136 KB Output is correct
8 Correct 2 ms 1136 KB Output is correct
9 Correct 2 ms 1136 KB Output is correct
10 Correct 2 ms 1136 KB Output is correct
11 Correct 2 ms 1136 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 2 ms 1000 KB Output is correct
4 Correct 2 ms 1068 KB Output is correct
5 Correct 2 ms 1136 KB Output is correct
6 Correct 2 ms 1136 KB Output is correct
7 Correct 3 ms 1136 KB Output is correct
8 Correct 2 ms 1136 KB Output is correct
9 Correct 2 ms 1136 KB Output is correct
10 Correct 2 ms 1136 KB Output is correct
11 Correct 2 ms 1136 KB Output is correct
12 Correct 2 ms 1136 KB Output is correct
13 Correct 2 ms 1136 KB Output is correct
14 Correct 2 ms 1136 KB Output is correct
15 Correct 2 ms 1136 KB Output is correct
16 Correct 2 ms 1136 KB Output is correct
17 Correct 2 ms 1136 KB Output is correct
18 Correct 2 ms 1136 KB Output is correct
19 Correct 3 ms 1136 KB Output is correct
20 Correct 3 ms 1140 KB Output is correct
21 Correct 3 ms 1172 KB Output is correct
22 Correct 3 ms 1200 KB Output is correct
23 Correct 3 ms 1340 KB Output is correct
24 Correct 3 ms 1392 KB Output is correct
25 Correct 3 ms 1392 KB Output is correct
26 Correct 3 ms 1392 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 19 ms 4496 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 5268 KB Output is correct
2 Correct 37 ms 5748 KB Output is correct
3 Correct 38 ms 6152 KB Output is correct
4 Correct 21 ms 6508 KB Output is correct
5 Correct 2 ms 6508 KB Output is correct
6 Correct 19 ms 6804 KB Output is correct
7 Correct 31 ms 7216 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 79 ms 9244 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 2 ms 1000 KB Output is correct
4 Correct 2 ms 1068 KB Output is correct
5 Correct 2 ms 1136 KB Output is correct
6 Correct 2 ms 1136 KB Output is correct
7 Correct 3 ms 1136 KB Output is correct
8 Correct 2 ms 1136 KB Output is correct
9 Correct 2 ms 1136 KB Output is correct
10 Correct 2 ms 1136 KB Output is correct
11 Correct 2 ms 1136 KB Output is correct
12 Correct 2 ms 1136 KB Output is correct
13 Correct 2 ms 1136 KB Output is correct
14 Correct 2 ms 1136 KB Output is correct
15 Correct 2 ms 1136 KB Output is correct
16 Correct 2 ms 1136 KB Output is correct
17 Correct 2 ms 1136 KB Output is correct
18 Correct 2 ms 1136 KB Output is correct
19 Correct 3 ms 1136 KB Output is correct
20 Correct 3 ms 1140 KB Output is correct
21 Correct 3 ms 1172 KB Output is correct
22 Correct 3 ms 1200 KB Output is correct
23 Correct 3 ms 1340 KB Output is correct
24 Correct 3 ms 1392 KB Output is correct
25 Correct 3 ms 1392 KB Output is correct
26 Correct 3 ms 1392 KB Output is correct
27 Runtime error 19 ms 4496 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Halted 0 ms 0 KB -