oj.uz

Submission #482585

# Submission time Handle Problem Language Result Execution time Memory
482585 2021-10-25T17:06:53 Z Hazem Global Warming (CEOI18_glo) C++14
10 / 100
 76 ms 6912 KB 
#include <bits/stdc++.h>

#define LL long long
 
 
using namespace std;
 
const int N = 2e5+1;
const LL MOD = 1e9+7;

int a[N],dp[N];
int n,k;

int calc(){

    set<int>st;
    for(int i=1;i<=n;i++){
        if(st.find(a[i])!=st.end())continue;
        st.insert(a[i]);
        auto it = st.find(a[i]);
        it++;
        if(it==st.end())continue;
        st.erase(*it);
    }
    return st.size();
}

void op(int l,int r,int x){

    for(int i=l;i<=r;i++)
        a[i] += x;
}

int main(){
    
    scanf("%d%d",&n,&k);

    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);

    int ans = calc();
    // for(int i=1;i<=n;i++){
    //     for(int j=-k;j<=k;j++){
    //         op(1,i,j);
    //         ans = max(ans,calc());
    //         op(1,i,-j);
            
    //         op(i,n,j);
    //         ans = max(ans,calc());
    //         op(i,n,-j);
    //     }
    // }

    printf("%d\n",ans);
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
glo.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         scanf("%d",&a[i]);
      |         ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 1104 KB Output is correct
2 Correct 71 ms 3008 KB Output is correct
3 Correct 73 ms 2984 KB Output is correct
4 Correct 76 ms 3140 KB Output is correct
5 Correct 66 ms 6912 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 460 KB Output is correct
2 Correct 16 ms 972 KB Output is correct
3 Correct 18 ms 928 KB Output is correct
4 Incorrect 14 ms 1868 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

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

Subtask #7
0 / 25.0

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