oj.uz

Submission #394949

# Submission time Handle Problem Language Result Execution time Memory
394949 2021-04-27T14:17:04 Z Qw3rTy Rabbit Carrot (LMIO19_triusis) C++11
100 / 100
 230 ms 110812 KB 
#include <bits/stdc++.h>
#define int long long
#define INF 2e9
using namespace std;

const int maxN = 2e5+5;

int f[maxN]; //f[i] = length of longest non-increasing subsequence that ends at b[i]
int a[maxN];
int b[maxN]; //b[i] = a[i] - M * i
int N,M;

struct node{
    int val,lc,rc;
    node(){};
}tree[maxN*100];

int cnt;

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

int build(){
    tree[++cnt].val = 0;
    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(p == 0)return 0;
    if(a > r || b < l)return 0;
    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)
    //find LIS on b[i], where b[i] = a[i] - M*i
    for(int i = 1; i <= N; ++i)b[i] = a[i] - M*i;
    init();
    for(int i = 1; i <= N; ++i){
        if(b[i] > 0)continue;
        f[i] = query(1,-INF,0,b[i],INF) + 1;
        update(1,-INF,0,b[i],b[i],f[i]);
    }
    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:63:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   63 |     freopen("../test.in","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory 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 332 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 332 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 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 332 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory 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 332 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 332 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 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 336 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 332 KB Output is correct
20 Correct 5 ms 720 KB Output is correct
21 Correct 8 ms 1444 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 8 ms 3148 KB Output is correct
24 Correct 9 ms 3532 KB Output is correct
25 Correct 7 ms 1484 KB Output is correct
26 Correct 8 ms 2508 KB Output is correct
27 Correct 3 ms 460 KB Output is correct
28 Correct 4 ms 460 KB Output is correct
29 Correct 7 ms 1360 KB Output is correct
30 Correct 5 ms 1484 KB Output is correct
31 Correct 5 ms 460 KB Output is correct
32 Correct 7 ms 2892 KB Output is correct
33 Correct 6 ms 2764 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory 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 5 ms 720 KB Output is correct
5 Correct 8 ms 1444 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 8 ms 3148 KB Output is correct
8 Correct 9 ms 3532 KB Output is correct
9 Correct 7 ms 1484 KB Output is correct
10 Correct 8 ms 2508 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
13 Correct 7 ms 1360 KB Output is correct
14 Correct 5 ms 1484 KB Output is correct
15 Correct 5 ms 460 KB Output is correct
16 Correct 7 ms 2892 KB Output is correct
17 Correct 6 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 332 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 332 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 332 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 6 ms 2552 KB Output is correct
38 Correct 3 ms 460 KB Output is correct
39 Correct 4 ms 460 KB Output is correct
40 Correct 4 ms 576 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 6 ms 3276 KB Output is correct
43 Correct 6 ms 3148 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 6 ms 2552 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 4 ms 576 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 6 ms 3276 KB Output is correct
10 Correct 6 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 332 KB Output is correct
14 Correct 5 ms 720 KB Output is correct
15 Correct 8 ms 1444 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 8 ms 3148 KB Output is correct
18 Correct 9 ms 3532 KB Output is correct
19 Correct 7 ms 1484 KB Output is correct
20 Correct 8 ms 2508 KB Output is correct
21 Correct 3 ms 460 KB Output is correct
22 Correct 4 ms 460 KB Output is correct
23 Correct 7 ms 1360 KB Output is correct
24 Correct 5 ms 1484 KB Output is correct
25 Correct 5 ms 460 KB Output is correct
26 Correct 7 ms 2892 KB Output is correct
27 Correct 6 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 332 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 332 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 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 210 ms 45060 KB Output is correct
45 Correct 25 ms 3404 KB Output is correct
46 Correct 173 ms 66756 KB Output is correct
47 Correct 172 ms 66776 KB Output is correct
48 Correct 203 ms 48100 KB Output is correct
49 Correct 226 ms 90196 KB Output is correct
50 Correct 112 ms 4932 KB Output is correct
51 Correct 140 ms 6896 KB Output is correct
52 Correct 164 ms 10700 KB Output is correct
53 Correct 20 ms 4604 KB Output is correct
54 Correct 230 ms 110812 KB Output is correct
55 Correct 226 ms 110424 KB Output is correct