oj.uz

답안 #941510

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
941510 2024-03-09T03:12:11 Z vjudge1 Foehn Phenomena (JOI17_foehn_phenomena) C++17
10 / 100
 79 ms 5712 KB 
#include <bits/stdc++.h>
using namespace std;

using lint=long long;
const int INF=0x3f3f3f3f;
const lint LINF=0x3f3f3f3f3f3f3f3f;

namespace Type{
    using pair_int=std::pair<int,int>;
    using pair_lint=std::pair<lint,lint>;
    using pair_real=std::pair<double,double>;
    using vector_int=vector<int>;
    using vector_lint=vector<lint>;
    using vector2d_int=vector<vector<int>>;
    using vector2d_lint=vector<vector<lint>>;
}

//#define FILE_IO
#define SINGLE_TEST
//#define MULTI_TEST

void solve(){
    int n,q;
    lint s,t;
    cin>>n>>q>>s>>t;

    lint last=0,ans=0;

    auto calc=[&](lint val)->lint{
        if(val>=0) return -t*val;
        return -val*s;
    };
    Type::vector_lint diff(n+10);
    for(int i=0;i<=n;i++){
        lint temp;
        cin>>temp;
        diff[i]=temp-last;
        last=temp;
        ans+=calc(diff[i]);
    }
    for(int i=1;i<=q;i++){
        lint left,right,k;
        cin>>left>>right>>k;
        ans-=calc(diff[left]);
        diff[left]+=k;
        ans+=calc(diff[left]);
        if(right<n){
            ans-=calc(diff[right+1]);
            diff[right+1]-=k;
            ans+=calc(diff[right+1]);
        }
        cout<<ans<<"\n";
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifdef FILE_IO
    freopen("../text.in","r",stdin);
#endif
    int T;
#ifdef SINGLE_TEST
    T=1;
#endif
#ifdef MULTI_TEST
    cin>>T;
#endif
    while(T--) solve();
    return 0;
}

Subtask #1
0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 3336 KB Output is correct
2 Correct 72 ms 4036 KB Output is correct
3 Correct 72 ms 4436 KB Output is correct
4 Correct 65 ms 3700 KB Output is correct
5 Correct 79 ms 4584 KB Output is correct
6 Correct 64 ms 4948 KB Output is correct
7 Correct 61 ms 4944 KB Output is correct
8 Correct 72 ms 4692 KB Output is correct
9 Correct 78 ms 5164 KB Output is correct
10 Correct 76 ms 3920 KB Output is correct
11 Correct 58 ms 4768 KB Output is correct
12 Correct 60 ms 5204 KB Output is correct
13 Correct 68 ms 5712 KB Output is correct

Subtask #3
0 / 60.0

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