oj.uz

Submission #785508

# Submission time Handle Problem Language Result Execution time Memory
785508 2023-07-17T09:46:18 Z christinelynn Global Warming (CEOI18_glo) C++17
58 / 100
 1594 ms 4816 KB 
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  int n, x; cin >> n >> x;
  if(x==0) {
    vector<int> a(n); for(int &p : a) cin >> p;
  vector<int> dp; int ans=1;
    for(int p : a) {
      auto it=lower_bound(dp.begin(), dp.end(), p);
      if(it==dp.end()) dp.push_back(p);
      else *it=p;
    }
    ans=dp.size();
    cout << ans << '\n';
  } else if(x<=5 && n<=50000) {
    vector<int> a, b;
      while(n--) {
      int p; cin >> p;
      vector<int> tempaa=a;
      auto it=lower_bound(tempaa.begin(), tempaa.end(), p);
      if(it==tempaa.end()) tempaa.push_back(p);
      else *it=p;
      vector<int> tempba=b;
      it=lower_bound(tempba.begin(), tempba.end(), p);
      if(it==tempba.end()) tempba.push_back(p);
      else *it=p;
      if(tempaa.size()>tempba.size()) a=tempaa;
      else a=tempba; p-=x;
      it=lower_bound(b.begin(), b.end(), p); 
      if(it==b.end()) b.push_back(p);
      else *it=p;
    }
    int ans=max((int)a.size(), (int)b.size());
    cout << ans << '\n';
    } else if(x==(int)1e9) {
      int ans=1;
      vector<int> a(n), b, pre(n);
      for(int &p : a) cin >> p;
      b=a; reverse(b.begin(), b.end());
      vector<int> dp;
      for(int i=0; i<n; i++) {
        int l=0, r=dp.size()-1, idx=-1;
        while(l<=r) {
          int mid=l+r>>1;
          if(b[i]>=dp[mid]) r=mid-1, idx=mid;
          else l=mid+1;
      }
      if(idx==-1) dp.push_back(b[i]);
      else dp[idx]=b[i];
      pre[i]=dp.size();
    }
    dp.clear();
    for(int i=0; i<n; i++) {
      auto it=lower_bound(dp.begin(), dp.end(), a[i]);
      if(it==dp.end()) dp.push_back(a[i]);
      else *it=a[i];
      ans=max(ans, (int)dp.size()+pre[n-i-2]);
    }
    cout << ans << '\n';
    } else {
      vector<int> a(n); for(int &p : a) cin >> p;
      vector<int> dp; int ans=1;
      for(int i=0; i<n; i++) {
          dp.clear();
          vector<int> temp=a;
          for(int k=i; k<n; k++) temp[k]+=x;
          for(int p : temp) {
            auto it=lower_bound(dp.begin(), dp.end(), p);
            if(it==dp.end()) dp.push_back(p);
            else *it=p;    
            }
          ans=max(ans, (int)dp.size());
          
      }
      cout << ans << '\n';
    }
    return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:30:7: warning: this 'else' clause does not guard... [-Wmisleading-indentation]
   30 |       else a=tempba; p-=x;
      |       ^~~~
glo.cpp:30:22: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else'
   30 |       else a=tempba; p-=x;
      |                      ^
glo.cpp:46:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |           int mid=l+r>>1;
      |                   ~^~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1892 KB Output is correct
2 Correct 26 ms 1908 KB Output is correct
3 Correct 26 ms 1904 KB Output is correct
4 Correct 26 ms 1876 KB Output is correct
5 Correct 16 ms 3052 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 452 KB Output is correct
2 Correct 20 ms 444 KB Output is correct
3 Correct 19 ms 444 KB Output is correct
4 Correct 1000 ms 2852 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1594 ms 4816 KB Output is correct
7 Correct 18 ms 436 KB Output is correct

Subtask #6
0 / 17.0

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

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 13 ms 340 KB Output is correct
20 Correct 11 ms 340 KB Output is correct
21 Correct 11 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 13 ms 340 KB Output is correct
24 Correct 11 ms 340 KB Output is correct
25 Correct 8 ms 340 KB Output is correct
26 Correct 8 ms 340 KB Output is correct
27 Correct 26 ms 1892 KB Output is correct
28 Correct 26 ms 1908 KB Output is correct
29 Correct 26 ms 1904 KB Output is correct
30 Correct 26 ms 1876 KB Output is correct
31 Correct 16 ms 3052 KB Output is correct
32 Correct 25 ms 452 KB Output is correct
33 Correct 20 ms 444 KB Output is correct
34 Correct 19 ms 444 KB Output is correct
35 Correct 1000 ms 2852 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1594 ms 4816 KB Output is correct
38 Correct 18 ms 436 KB Output is correct
39 Incorrect 21 ms 2668 KB Output isn't correct
40 Halted 0 ms 0 KB -