제출 #1264674

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1264674		Noname_1900	Foehn Phenomena (JOI17_foehn_phenomena)	C++20	100 / 100	62 ms	7244 KiB

foehn_phenomena

#include<bits/stdc++.h>
using namespace std;
const int NMAX = 200000+1;
int N, nbJ, changAltPlus, changAltMoins;
#define int long long
//int temp[NMAX];

struct altitude {
    int val;
    int changTemp()
    {
        int dif = val;
        if(dif > 0) return abs(dif)*changAltPlus;
        else return abs(dif) * changAltMoins;
    }
};
altitude ecart[NMAX];
int alt[NMAX];
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> N >> nbJ >> changAltPlus >> changAltMoins;
    changAltPlus = -changAltPlus;
    for(int i = 0; i <= N; i++) cin >> alt[i];
    for(int i = 0; i < N; i++)  ecart[i].val = alt[i+1]-alt[i];
    /*
    for(int i = 0; i <= N; i++)
    {
        cout << i << " : " << alt[i] << " " << ecart[i].val << " : " << ecart[i].changTemp() << endl;;
    }/** */
    
    int sommeTemp = 0;
    for(int i = 0; i < N; i++)
    {
       // cout << ecart[i].val << endl;
       // temp[i] = ecart[i].changTemp();
        sommeTemp += ecart[i].changTemp();
        //cout << sommeTemp << " ";
    }
    //cout << "\n";
   // for(int i = 0; i < N; i++)  cout << ecart[i].val << " ";
  //  cout << endl;
    //cout << sommeTemp << endl;
    for(int iJ = 0; iJ < nbJ; iJ++)
    {
        int deb, fin, chang;
        cin >> deb >> fin >> chang;
        fin++;
        sommeTemp -= ecart[deb-1].changTemp();
        ecart[deb-1].val += chang;
        sommeTemp += ecart[deb-1].changTemp();
        if(fin -1 < N)
        {
            sommeTemp -= ecart[fin-1].changTemp();
            ecart[fin-1].val -= chang;
            sommeTemp += ecart[fin-1].changTemp();
        }
        
        
        
       // for(int i = 0; i < N; i++)  cout << ecart[i].val << " ";
       // cout << "." << "\n";
        cout << sommeTemp << "\n";
    }

}

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