제출 #1292237

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1292237		chaitanyamehta	Solar Storm (NOI20_solarstorm)	C++20	28 / 100	519 ms	39432 KiB

SolarStorm

// 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int ,int>
#define v vector
#define all(a) a.begin() , a.end()

signed main(){
    int n , s , k;
    cin>>n>>s>>k;
    vector<int> d(n + 1 , 0) , di(n + 1, 0);
    for(int i = 1 ; i <= n-1; i++){
        cin>>di[i];
    }
    v<int> v(n +1, 0) , impact(n + 1 , 0) , p(n + 1 , 0);
    for(int i = 1 ;i <= n ; i++)cin>>v[i];
    for(int i = 1; i<=n;i++){
        p[i] = p[i-1]+v[i];
    }
    // cout << d[0] << " ";
    d[1] = 0;
    // cout << d[1] <<" ";
    for(int i = 2 ; i <= n ; i++){
        d[i] = di[i - 1] + d[i - 1];
        // cout << d[i] << " ";
    }
    // cout << "\n";
     for(int i = 1 ;i<=n;i++){
         
        int left = max(0LL , d[i] - k);
        int right = min(d[n] , d[i] + k);
        int left_idx = max(0LL ,( (long long)(lower_bound(all(d) , left) - d.begin()) - 1LL));
        int right_idx = ((long long)(upper_bound(all(d) , right) - d.begin())) - 1LL;
        // cout << left_idx << " "<<right_idx << "\n";
         
        int sum = 0;
        sum += p[i] - p[left_idx];
        sum += p[right_idx] - p[i - 1];
        impact[i] = sum - v[i];
        // cout << impact[i] << " ";
    }
    cout << 1 << "\n";
    int ans = max_element(impact.begin() , impact.end()) - impact.begin();
    cout << ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 7 / 7
• Subtask 3: 11 / 11
• Subtask 4: 0 / 8
• Subtask 5: 0 / 18
• Subtask 6: 0 / 16
• Subtask 7: 0 / 30