oj.uz

답안 #953948

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953948 2024-03-27T00:40:17 Z AlphaMale06 Global Warming (CEOI18_glo) C++17
47 / 100
 50 ms 7260 KB 
#include <bits/stdc++.h>

using namespace std;

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

const int inf = 1e14;
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] = inf;
    int mx=0;
    for(int i = n-1; i>=0; i--){
        if(a[i]<dp[mx]){
            mx++;
            dp[mx]=a[i];
            mdp[i] = {mx, dp[mx]};
        }
        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] = {l, dp[l]};
        }
    }
    int ans=mx;
    for(int i = 1; i<=n; i++)ndp[i]=inf+i;
    ndp[0]=-inf;
    int mxx=0;
    for(int i=0; i < n; i++){
        if(a[i]-d>ndp[mxx]){
            mxx++;
            ndp[mxx]=a[i]-d;
        }
        else{
            int l = 1, r = n;
            while(l<=r){
                int s = l+r>>1;
                if(ndp[s]>=a[i]-d)r=s-1;
                else l=s+1;
            }
            if(dp[l-1]!=a[i]-d)ndp[l]=min(ndp[l], a[i]-d);
        }
        int 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:34:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |                 int s = l+r>>1;
      |                         ~^~
glo.cpp:54:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   54 |                 int s = l+r>>1;
      |                         ~^~
glo.cpp:62:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   62 |             int s = l+r>>1;
      |                     ~^~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 6488 KB Output is correct
2 Correct 48 ms 6488 KB Output is correct
3 Correct 47 ms 6628 KB Output is correct
4 Correct 50 ms 6484 KB Output is correct
5 Correct 25 ms 7256 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 4956 KB Output is correct
2 Correct 11 ms 5016 KB Output is correct
3 Correct 11 ms 4956 KB Output is correct
4 Correct 6 ms 5208 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 8 ms 5216 KB Output is correct
7 Correct 9 ms 4952 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 5468 KB Output is correct
2 Correct 20 ms 5544 KB Output is correct
3 Correct 40 ms 6728 KB Output is correct
4 Correct 26 ms 7260 KB Output is correct
5 Correct 17 ms 5724 KB Output is correct
6 Correct 20 ms 7260 KB Output is correct
7 Correct 23 ms 7260 KB Output is correct
8 Correct 16 ms 5540 KB Output is correct

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -