oj.uz

Submission #1103952

# Submission time Handle Problem Language Result Execution time Memory
1103952 2024-10-22T12:34:54 Z vjudge1 Global Warming (CEOI18_glo) C++17
38 / 100
 2000 ms 3132 KB 
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

vector<int> dp;

int lis(int t[],int n,int a,int b,int x){
    dp.clear();
    int cur;
    for(int i=1;i<=n;++i){
        cur=t[i]+x*(i<=b);
        int idx=lower_bound(dp.begin(),dp.end(),cur)-dp.begin();
        if(idx==dp.size()) dp.push_back(cur);
        else dp[idx]=cur;
    }
    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){
        maxi=max(lis(t,n,1,e,-x),maxi);
    }
    cout << maxi;
}

Compilation message

glo.cpp: In function 'int lis(int*, int, int, int, int)':
glo.cpp:14:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |         if(idx==dp.size()) dp.push_back(cur);
      |            ~~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 3012 KB Output is correct
2 Correct 23 ms 1104 KB Output is correct
3 Correct 31 ms 3132 KB Output is correct
4 Correct 27 ms 3124 KB Output is correct
5 Correct 16 ms 3028 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2063 ms 1104 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2064 ms 1616 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 504 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 508 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 9 ms 336 KB Output is correct
20 Correct 8 ms 472 KB Output is correct
21 Correct 8 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 9 ms 336 KB Output is correct
24 Correct 9 ms 336 KB Output is correct
25 Correct 7 ms 336 KB Output is correct
26 Correct 7 ms 336 KB Output is correct
27 Correct 30 ms 3012 KB Output is correct
28 Correct 23 ms 1104 KB Output is correct
29 Correct 31 ms 3132 KB Output is correct
30 Correct 27 ms 3124 KB Output is correct
31 Correct 16 ms 3028 KB Output is correct
32 Execution timed out 2063 ms 1104 KB Time limit exceeded
33 Halted 0 ms 0 KB -