oj.uz

Submission #854200

# Submission time Handle Problem Language Result Execution time Memory
854200 2023-09-26T10:31:32 Z nnhzzz Global Warming (CEOI18_glo) C++14
100 / 100
 67 ms 6344 KB 
// cre: Nguyen Ngoc Hung - Train VOI 2024

#include<bits/stdc++.h>

using namespace std;

#define        __nnhzzz__  signed main()
#define          BIT(i,j)  ((i>>j)&1LL)
#define           MASK(i)  (1LL<<i)
#define            ALL(x)  (x).begin(),(x).end()
#define             SZ(x)  (int)(x).size()
#define                fi  first
#define                se  second
#define                ll  long long
#define               ull  unsigned long long
#define                ld  long double
#define                vi  vector<int>
#define               vvi  vector<vi>
#define              vvvi  vector<vvi>
#define               pii  pair<int,int>
#define              vpii  vector<pii>
#define        REP(i,a,b)  for(int i = (a); i<=(b); ++i)
#define       REPD(i,a,b)  for(int i = (a); i>=(b); --i)
#define   REPDIS(i,a,b,c)  for(int i = (a); i<=(b); i+=c)
#define               int  ll
//-------------------------------------------------------------//
const int oo = 1e9,LOG = 20,MAXN = 2e5+7,N = 1e2+3;
const int MOD = 1e9+7,MOD1 = 1e9+207,MOD2 = 1e9+407,MOD3 = 998244353;
//-------------------------------------------------------------//
template<typename T1, typename T2> bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b){if(a<b){a=b;return true;}return false;}

/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Nguyen Ngoc Hung - nnhzzz
    Training for VOI24 gold medal
----------------------------------------------------------------
*/

int dp[MAXN][3],a[MAXN];
int n,k;

struct fenwick_tree{
    vi f;
    int _n;

    void update(int id, int val){
        for(; id<=_n; id += id&-id){
            maxi(f[id],val);
        }
    }

    int get(int id){
        int res = 0;
        for(; id>0; id-=id&-id){
            maxi(res,f[id]);
        }
        return res;
    }

    fenwick_tree(int _n1):_n(_n1){
        f.assign(_n,0);
    }
};

void sub4(){
    vi cur;
    REP(i,1,n) cur.push_back(a[i]);
    cur.push_back(0);
    sort(ALL(cur)); cur.resize(unique(ALL(cur))-cur.begin());
    fenwick_tree fen(n+3);
    REP(i,1,n){
        a[i] = lower_bound(ALL(cur),a[i])-cur.begin()+1;
        int val = fen.get(a[i]-1);
        fen.update(a[i],val+1);
    }
    cout << fen.get(n);
}

void sub3(){
    int res = 0;
    REP(i,1,n){
        REP(j,1,i-1){
            if(a[i]>a[j]) maxi(dp[i][0],dp[j][0]);
            if(a[i]>a[j] || abs(a[i]-a[j])<k){
                maxi(dp[i][1],dp[j][0]);
            }
            if(a[i]>a[j]) maxi(dp[i][2],max(dp[j][0],max(dp[j][1],dp[j][2])));
        }
        ++dp[i][0];
        ++dp[i][1];
        ++dp[i][2];
        maxi(res,max(dp[i][0],max(dp[i][1],dp[i][2])));
    }
    cout << res;
}

void sub7(){
    vi cur;
    REP(i,1,n){
        cur.push_back(a[i]);
        cur.push_back(a[i]+k);
    }
    cur.push_back(-1);
    sort(ALL(cur)); cur.resize(unique(ALL(cur))-cur.begin());
    fenwick_tree fen1(n*3+3),fen2(n*3+3),fen3(n*3+3);
    REP(i,1,n){
        int tmp = lower_bound(ALL(cur),a[i]+k)-cur.begin()+1;
        int ai = lower_bound(ALL(cur),a[i])-cur.begin()+1;
        dp[i][0] = fen1.get(ai-1);
        dp[i][1] = fen1.get(tmp-1);
        dp[i][2] = max(dp[i][0],max(fen2.get(ai-1),fen3.get(a[i]-1)));
        fen1.update(ai,dp[i][0]+1);
        fen2.update(ai,dp[i][1]+1);
        fen3.update(ai,dp[i][2]+1);
    }
    int m = n*3;
    cout << max(fen1.get(m),max(fen2.get(m),fen3.get(m)));
}

void sube(){
    vi dp1,dp2;
    dp1.push_back(-1e18);
    dp2.push_back(-1e18);
    REP(i,1,n){
        int lg = lower_bound(dp1.begin(),dp1.end(),a[i])-dp1.begin();
        if(lg==SZ(dp1)) dp1.push_back(a[i]); else dp1[lg] = a[i];

        int tmp = lg;

        lg = lower_bound(dp2.begin(),dp2.end(),a[i])-dp2.begin();
        if(lg==SZ(dp2)) dp2.push_back(a[i]); else dp2[lg] = a[i];

        if(SZ(dp2)<=tmp) dp2.push_back(1e18);
        mini(dp2[tmp],a[i]-k);
    }
    cout << SZ(dp2)-1;
}

void solve(){
    cin >> n >> k;
    REP(i,1,n){
        cin >> a[i];
    }
    if(k==0){
        sub4(); return ;
    }
    // sub3();
    sube();
}

__nnhzzz__{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #define name "test"
    if(fopen(name".inp","r")){
        freopen(name".inp","r",stdin);
        freopen(name".out","w",stdout);
    }
    #define name1 "nnhzzz"
    if(fopen(name1".inp","r")){
        freopen(name1".inp","r",stdin);
        freopen(name1".out","w",stdout);
    }
    int test = 1;
    while(test--){
        solve();
    }
    cerr << "\nTime elapsed: " << 1000*clock()/CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:159:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  159 |         freopen(name".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
glo.cpp:160:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  160 |         freopen(name".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:164:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  164 |         freopen(name1".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:165:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  165 |         freopen(name1".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 5928 KB Output is correct
2 Correct 67 ms 5836 KB Output is correct
3 Correct 65 ms 5840 KB Output is correct
4 Correct 66 ms 5844 KB Output is correct
5 Correct 32 ms 5876 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2652 KB Output is correct
2 Correct 8 ms 2652 KB Output is correct
3 Correct 8 ms 2704 KB Output is correct
4 Correct 5 ms 3200 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 3288 KB Output is correct
7 Correct 7 ms 2652 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2648 KB Output is correct
2 Correct 17 ms 3876 KB Output is correct
3 Correct 36 ms 4620 KB Output is correct
4 Correct 19 ms 5576 KB Output is correct
5 Correct 9 ms 4056 KB Output is correct
6 Correct 19 ms 5584 KB Output is correct
7 Correct 19 ms 6220 KB Output is correct
8 Correct 14 ms 3676 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 66 ms 5928 KB Output is correct
28 Correct 67 ms 5836 KB Output is correct
29 Correct 65 ms 5840 KB Output is correct
30 Correct 66 ms 5844 KB Output is correct
31 Correct 32 ms 5876 KB Output is correct
32 Correct 9 ms 2652 KB Output is correct
33 Correct 8 ms 2652 KB Output is correct
34 Correct 8 ms 2704 KB Output is correct
35 Correct 5 ms 3200 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 5 ms 3288 KB Output is correct
38 Correct 7 ms 2652 KB Output is correct
39 Correct 17 ms 2648 KB Output is correct
40 Correct 17 ms 3876 KB Output is correct
41 Correct 36 ms 4620 KB Output is correct
42 Correct 19 ms 5576 KB Output is correct
43 Correct 9 ms 4056 KB Output is correct
44 Correct 19 ms 5584 KB Output is correct
45 Correct 19 ms 6220 KB Output is correct
46 Correct 14 ms 3676 KB Output is correct
47 Correct 20 ms 3676 KB Output is correct
48 Correct 17 ms 3420 KB Output is correct
49 Correct 36 ms 4696 KB Output is correct
50 Correct 19 ms 5436 KB Output is correct
51 Correct 17 ms 6344 KB Output is correct
52 Correct 21 ms 5840 KB Output is correct
53 Correct 19 ms 5584 KB Output is correct
54 Correct 25 ms 6232 KB Output is correct
55 Correct 29 ms 4444 KB Output is correct