Submission #969071

# Submission time Handle Problem Language Result Execution time Memory
969071 2024-04-24T13:04:40 Z vjudge1 Global Warming (CEOI18_glo) C++14
38 / 100
2000 ms 3944 KB
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

vector<int> dp;

int lis(int tt[],int n,int a,int b,int x){
    int t[n+1];
    for(int i=1;i<=n;++i) t[i]=tt[i];
    for(int i=a;i<=b;++i){
        t[i]+=x;
    }
    dp.clear();
    for(int i=1;i<=n;++i){
        int idx=lower_bound(dp.begin(),dp.end(),t[i])-dp.begin();
        if(idx==dp.size()) dp.push_back(t[i]);
        else dp[idx]=t[i];
    }
    return dp.size();
}
int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    int n,x; cin >> n >> x;
    int t[n+1];
    for(int i=1;i<=n;++i) cin >> t[i];
    int maxi=0;
    if(x==0){
        cout << lis(t,n,0,0,0);
        return 0;
    }
    for(int e=1;e<=n;++e){
        //cout << s << " " << e << " " << p << " " << lis(t,n,s,e,p) << endl;
        maxi=max(lis(t,n,1,e,-abs(x)),maxi);
    }
    cout << maxi;
}

Compilation message

glo.cpp: In function 'int lis(int*, int, int, int, int)':
glo.cpp:17:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |         if(idx==dp.size()) dp.push_back(t[i]);
      |            ~~~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 356 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 356 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 356 KB Output is correct
14 Correct 1 ms 392 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 352 KB Output is correct
18 Correct 1 ms 356 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 356 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 356 KB Output is correct
14 Correct 1 ms 392 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 352 KB Output is correct
18 Correct 1 ms 356 KB Output is correct
19 Correct 13 ms 472 KB Output is correct
20 Correct 10 ms 476 KB Output is correct
21 Correct 10 ms 356 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 9 ms 348 KB Output is correct
24 Correct 13 ms 356 KB Output is correct
25 Correct 8 ms 352 KB Output is correct
26 Correct 8 ms 468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 26 ms 3940 KB Output is correct
2 Correct 26 ms 3944 KB Output is correct
3 Correct 26 ms 3944 KB Output is correct
4 Correct 34 ms 3936 KB Output is correct
5 Correct 16 ms 3812 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 2067 ms 1136 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2029 ms 2104 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 356 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 356 KB Output is correct
14 Correct 1 ms 392 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 352 KB Output is correct
18 Correct 1 ms 356 KB Output is correct
19 Correct 13 ms 472 KB Output is correct
20 Correct 10 ms 476 KB Output is correct
21 Correct 10 ms 356 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 9 ms 348 KB Output is correct
24 Correct 13 ms 356 KB Output is correct
25 Correct 8 ms 352 KB Output is correct
26 Correct 8 ms 468 KB Output is correct
27 Correct 26 ms 3940 KB Output is correct
28 Correct 26 ms 3944 KB Output is correct
29 Correct 26 ms 3944 KB Output is correct
30 Correct 34 ms 3936 KB Output is correct
31 Correct 16 ms 3812 KB Output is correct
32 Execution timed out 2067 ms 1136 KB Time limit exceeded
33 Halted 0 ms 0 KB -