oj.uz

답안 #394869

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
394869 2021-04-27T11:47:15 Z Qw3rTy Rabbit Carrot (LMIO19_triusis) C++11
63 / 100
 125 ms 23348 KB 
#include <iostream>
#define int long long
#define INF 1e12
using namespace std;

const int maxN = 2e5+5;

int f[maxN];
int a[maxN];
int N,M;

struct node{
    int val,lc,rc;
    node(){};
}tree[maxN<<2];
int cnt;

void init(){
    cnt = 1;
    tree[cnt].lc = tree[cnt].rc = 0;
    tree[cnt].val = -INF;
    return;
}

int build(){
    tree[++cnt].val = -INF;
    tree[cnt].lc = 0;
    tree[cnt].rc = 0;
    return cnt;
}

void pushup(int p){
    tree[p].val = max(tree[tree[p].lc].val,tree[tree[p].rc].val);
    return;
}

void update(int p, int l, int r, int a, int b, int val){
    if(a > r || b < l)return;
    if(a <= l && r <= b){
        tree[p].val = max(tree[p].val,val);
        return;
    }
    int mid = (l+r)>>1;
    if(tree[p].lc == 0)tree[p].lc = build();
    if(tree[p].rc == 0)tree[p].rc = build();
    update(tree[p].lc,l,mid,a,b,val);
    update(tree[p].rc,mid+1,r,a,b,val);
    pushup(p);
    return;
}

int query(int p, int l, int r, int a, int b){
    if(a > r || b < l)return -INF;
    if(a <= l && r <= b)return tree[p].val;
    int mid = (l+r)>>1;
    return max(query(tree[p].lc,l,mid,a,b),query(tree[p].rc,mid+1,r,a,b));
}

void testIO(){
    freopen("../test.in","r",stdin);
    return;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    //testIO();
    cin >> N >> M;
    for(int i = 1; i <= N; ++i)cin >> a[i];
    a[0] = 0;
    f[0] = 0;
    //O(NlogN)
    init();
    for(int i = 1; i <= N; ++i){
        if(a[i] > M*i)continue;
        f[i] = max(f[i],query(1,-INF,INF,a[i]-M*i,INF)+1);
        update(1,-INF,INF,a[i]-M*i,a[i]-M*i,f[i]);
    }
    //O(N^2)
//    for(int i = 1; i <= N; ++i){
//        if(a[i] > M*i)continue;
//        for(int j = 0; j < i; ++j){
//            if(a[i] - M*i <= a[j] - M*j)f[i] = max(f[i],f[j]+1);
//        }
//    }
    int res = 0;
    for(int i = 1; i <= N; ++i)res = max(res,f[i]);
    cout << N - res << '\n';
    return 0;
}

Compilation message

triusis.cpp: In function 'void testIO()':
triusis.cpp:60:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   60 |     freopen("../test.in","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 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 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 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 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 6 ms 716 KB Output is correct
21 Correct 7 ms 1356 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 8 ms 3148 KB Output is correct
24 Correct 9 ms 3444 KB Output is correct
25 Correct 7 ms 1484 KB Output is correct
26 Correct 8 ms 2508 KB Output is correct
27 Correct 4 ms 332 KB Output is correct
28 Correct 5 ms 332 KB Output is correct
29 Correct 7 ms 1356 KB Output is correct
30 Correct 7 ms 1396 KB Output is correct
31 Correct 5 ms 460 KB Output is correct
32 Correct 8 ms 2820 KB Output is correct
33 Correct 8 ms 2764 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 716 KB Output is correct
5 Correct 7 ms 1356 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 8 ms 3148 KB Output is correct
8 Correct 9 ms 3444 KB Output is correct
9 Correct 7 ms 1484 KB Output is correct
10 Correct 8 ms 2508 KB Output is correct
11 Correct 4 ms 332 KB Output is correct
12 Correct 5 ms 332 KB Output is correct
13 Correct 7 ms 1356 KB Output is correct
14 Correct 7 ms 1396 KB Output is correct
15 Correct 5 ms 460 KB Output is correct
16 Correct 8 ms 2820 KB Output is correct
17 Correct 8 ms 2764 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 2 ms 460 KB Output is correct
37 Correct 9 ms 2636 KB Output is correct
38 Correct 4 ms 332 KB Output is correct
39 Correct 5 ms 332 KB Output is correct
40 Correct 6 ms 524 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 9 ms 3140 KB Output is correct
43 Correct 10 ms 3148 KB Output is correct

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 9 ms 2636 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 6 ms 524 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 9 ms 3140 KB Output is correct
10 Correct 10 ms 3148 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 6 ms 716 KB Output is correct
15 Correct 7 ms 1356 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 8 ms 3148 KB Output is correct
18 Correct 9 ms 3444 KB Output is correct
19 Correct 7 ms 1484 KB Output is correct
20 Correct 8 ms 2508 KB Output is correct
21 Correct 4 ms 332 KB Output is correct
22 Correct 5 ms 332 KB Output is correct
23 Correct 7 ms 1356 KB Output is correct
24 Correct 7 ms 1396 KB Output is correct
25 Correct 5 ms 460 KB Output is correct
26 Correct 8 ms 2820 KB Output is correct
27 Correct 8 ms 2764 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 125 ms 21376 KB Output is correct
45 Correct 26 ms 3784 KB Output is correct
46 Incorrect 77 ms 23348 KB Output isn't correct
47 Halted 0 ms 0 KB -