제출 #286648

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
286648		FEDIKUS	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	0 / 100	1089 ms	4728 KiB

foehn_phenomena

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define xx first
#define yy second
#define srt(a) sort(a.begin(),a.end());
#define srtg(a,int) sort(a.begin(),a.end(),greater<int>())
#define lb(a,x) lower_bound(a.begin(),a.end(),x)
#define up(a,x) upper_bound(a.begin(),a.end(),x)
#define fnd(a,x) find(a.begin(),a.end(),x)
#define vstart auto startt=chrono::system_clock::now()
#define vend auto endd=chrono::system_clock::now()
#define vvreme chrono::duration<double> vremee=endd-startt
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef string str;

int n,q,s,t;
vector<int> visine;

void update(int l,int r,int x){
    for(int i=l;i<=r;i++){
        visine[i]+=x;
    }
}

int query(int a){
    return visine[a];
}

int raz(int a){
    int prvi=query(a);
    int drugi=(a+1==visine.size() ? query(a):query(a+1));
    if(prvi>drugi){
        return (prvi-drugi)*t;
    }else return -(drugi-prvi)*s;
}

int main()
{
    ios;
    cin>>n>>q>>s>>t;
    visine.resize(n+1);
    for(int i=0;i<=n;i++) cin>>visine[i];
    vector<int> temp(n+1);
    temp[0]=0;
    for(int i=1;i<=n;i++){
        if(visine[i]>visine[i-1]){
            temp[i]=temp[i-1]-(visine[i]-visine[i-1])*s;
        }else{
            temp[i]=temp[i-1]+(visine[i-1]-visine[i])*t;
        }
    }
    int res=temp[n];
    while(q--){
        int l,r,x;
        cin>>l>>r>>x;
        res-=raz(l-1);
        res-=raz(r);
        update(l,r,x);
        res+=raz(l-1);
        res+=raz(r);
        cout<<res<<"\n";
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

foehn_phenomena.cpp: In function 'int raz(int)':
foehn_phenomena.cpp:41:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     int drugi=(a+1==visine.size() ? query(a):query(a+1));
      |                ~~~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 30
• Subtask 2: 0 / 10
• Subtask 3: 0 / 60