oj.uz

답안 #953945

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953945 2024-03-27T00:34:16 Z AlphaMale06 Global Warming (CEOI18_glo) C++14
62 / 100
 41 ms 9228 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define int long long
#define F first
#define S second

const int N = 2e5+3;
int dp[N], ndp[N];
pair<int, int> mdp[N];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, d;
    cin >> n >> d;
    int a[n];
    for(int i=0; i< n; i++)cin >> a[i];
    dp[0] = 2e9+1;
    int mx=0;
    for(int i = n-1; i>=0; i--){
        if(a[i]<dp[mx]){
            mx++;
            dp[mx]=a[i];
        }
        else{
            int l = 1, r = mx;
            while(l<=r){
                int s = l+r>>1;
                if(dp[s]>=a[i])l=s+1;
                else r=s-1;
            }
            if(dp[l-1]!=a[i])dp[l]=max(dp[l], a[i]);
        }
        mdp[i] = {mx, dp[mx]};
    }
    int ans=mx;
    if(d==0){
        cout << ans;
        return 0;
    }
    for(int i = 1; i<=n; i++)ndp[i]=1e9+i;
    ndp[0]=-1e9;
    int mxx=0;
    for(int i=0; i < n; i++){
        int l = 0, r = n;
        if(a[i]-d>ndp[mxx]){
            mxx++;
            ndp[mxx]=a[i]-d;
        }
        else{
            while(l<=r){
                int s = l+r>>1;
                if(ndp[s]>=a[i]-d)r=s-1;
                else l=s+1;
            }
            ndp[l]=min(ndp[l], a[i]-d);
        }
        l = 0, r = n;
        while(l<=r){
            int s = l+r>>1;
            if(ndp[s]<mdp[i+1].S)l=s+1;
            else r=s-1;
        }
        ans=max(ans, mdp[i+1].F+r);
    }
    cout << ans;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:32:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   32 |                 int s = l+r>>1;
      |                         ~^~
glo.cpp:56:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   56 |                 int s = l+r>>1;
      |                         ~^~
glo.cpp:64:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |             int s = l+r>>1;
      |                     ~^~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 2512 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 2512 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 2512 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Incorrect 1 ms 2396 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 6236 KB Output is correct
2 Correct 26 ms 8028 KB Output is correct
3 Correct 26 ms 8152 KB Output is correct
4 Correct 27 ms 8020 KB Output is correct
5 Correct 14 ms 8024 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 4956 KB Output is correct
2 Correct 10 ms 5568 KB Output is correct
3 Correct 10 ms 5468 KB Output is correct
4 Correct 6 ms 5468 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 8 ms 5468 KB Output is correct
7 Correct 9 ms 5468 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 5348 KB Output is correct
2 Correct 22 ms 6744 KB Output is correct
3 Correct 41 ms 8404 KB Output is correct
4 Correct 26 ms 8540 KB Output is correct
5 Correct 15 ms 6492 KB Output is correct
6 Correct 20 ms 8504 KB Output is correct
7 Correct 27 ms 9228 KB Output is correct
8 Correct 17 ms 6512 KB Output is correct

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 2512 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Incorrect 1 ms 2396 KB Output isn't correct
20 Halted 0 ms 0 KB -