oj.uz

답안 #394935

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
394935 2021-04-27T14:01:11 Z Qw3rTy Rabbit Carrot (LMIO19_triusis) C++11
63 / 100
 247 ms 45636 KB 
#include <bits/stdc++.h>
#define INF 2e9
using namespace std;

const int maxN = 2e5+5;

int f[maxN];
int a[maxN];
int b[maxN];
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 = -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;
}

int find_lis(vector<int> a) {
    vector<int> dp;
    for (int i : a) {
        if(b[i] > 0)continue;
        int pos = lower_bound(dp.begin(), dp.end(), i) - dp.begin();
        if (pos == dp.size())  // we can have a new, longer increasing subsequence!
            dp.push_back(i);
        else  // oh ok, at least we can make the ending element smaller
            dp[pos] = i;
    }
    return dp.size();
}

int LIS(){
    vector<int> dp;
    for(int i = 1; i <= N; ++i){
        if(b[i] > 0)continue;
        int pos = lower_bound(dp.begin(),dp.end(),a[i]) - dp.begin();
        if(pos == 0)dp.push_back(a[i]);
        else dp[pos] = a[i];
    }
    return dp.size();
}

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] = max(f[i], query(1,-INF,INF,b[i],INF) +1);
        update(1,-INF,INF,b[i],b[i],f[i]);
    }
    //int res = LIS();
    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 'int find_lis(std::vector<int>)':
triusis.cpp:70:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         if (pos == dp.size())  // we can have a new, longer increasing subsequence!
      |             ~~~~^~~~~~~~~~~~
triusis.cpp: In function 'void testIO()':
triusis.cpp:61:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   61 |     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 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 332 KB Output is correct
16 Correct 1 ms 336 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 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 332 KB Output is correct
16 Correct 1 ms 336 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 316 KB Output is correct
20 Correct 5 ms 460 KB Output is correct
21 Correct 6 ms 844 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 7 ms 1740 KB Output is correct
24 Correct 7 ms 1868 KB Output is correct
25 Correct 6 ms 844 KB Output is correct
26 Correct 7 ms 1396 KB Output is correct
27 Correct 3 ms 332 KB Output is correct
28 Correct 4 ms 332 KB Output is correct
29 Correct 6 ms 852 KB Output is correct
30 Correct 6 ms 840 KB Output is correct
31 Correct 4 ms 460 KB Output is correct
32 Correct 7 ms 1612 KB Output is correct
33 Correct 7 ms 1564 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 316 KB Output is correct
4 Correct 5 ms 460 KB Output is correct
5 Correct 6 ms 844 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 7 ms 1740 KB Output is correct
8 Correct 7 ms 1868 KB Output is correct
9 Correct 6 ms 844 KB Output is correct
10 Correct 7 ms 1396 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 6 ms 840 KB Output is correct
15 Correct 4 ms 460 KB Output is correct
16 Correct 7 ms 1612 KB Output is correct
17 Correct 7 ms 1564 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 332 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 2 ms 460 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 6 ms 1484 KB Output is correct
38 Correct 4 ms 336 KB Output is correct
39 Correct 4 ms 392 KB Output is correct
40 Correct 4 ms 460 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 7 ms 1740 KB Output is correct
43 Correct 7 ms 1740 KB Output is correct

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 6 ms 1484 KB Output is correct
5 Correct 4 ms 336 KB Output is correct
6 Correct 4 ms 392 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 7 ms 1740 KB Output is correct
10 Correct 7 ms 1740 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 316 KB Output is correct
14 Correct 5 ms 460 KB Output is correct
15 Correct 6 ms 844 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 7 ms 1740 KB Output is correct
18 Correct 7 ms 1868 KB Output is correct
19 Correct 6 ms 844 KB Output is correct
20 Correct 7 ms 1396 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 6 ms 840 KB Output is correct
25 Correct 4 ms 460 KB Output is correct
26 Correct 7 ms 1612 KB Output is correct
27 Correct 7 ms 1564 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 332 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 206 ms 23020 KB Output is correct
45 Correct 25 ms 2204 KB Output is correct
46 Correct 171 ms 33916 KB Output is correct
47 Correct 176 ms 33940 KB Output is correct
48 Correct 215 ms 24692 KB Output is correct
49 Correct 247 ms 45636 KB Output is correct
50 Incorrect 111 ms 3060 KB Output isn't correct
51 Halted 0 ms 0 KB -