# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1158224 | achi | Foehn Phenomena (JOI17_foehn_phenomena) | C++20 | 1095 ms | 2632 KiB |
#include <bits/stdc++.h>
using namespace std;
int main () {
// ios::sync_with_stdio(0);
// cin.tie(0);
// cout.tie(0);
int N, Q, S, T;
int L, R, X;
int i, j;
long long int deg = 0;
scanf("%d %d %d %d", &N, &Q, &S, &T);
vector<long long int> altitiudes(N+1);
vector<int> answers(Q);
for (i = 0; i < N+1; i++) {
scanf("%lld", &altitiudes[i]);
if (i == 0) continue;
if (altitiudes[i-1] < altitiudes[i]) {
deg += (altitiudes[i-1] - altitiudes[i])*S;
}
else {
deg += (altitiudes[i-1] - altitiudes[i])*T;
}
}
for (i = 0; i < Q; i++) {
scanf("%d %d %d", &L, &R, &X);
if (L-1 >= 0) {
if (altitiudes[L-1] < altitiudes[L]) {
deg -= (altitiudes[L-1] - altitiudes[L])*S;
}
else {
deg -= (altitiudes[L-1] - altitiudes[L])*T;
}
if (altitiudes[L-1] < (altitiudes[L] + X)) {
deg += (altitiudes[L-1] - (altitiudes[L] + X))*S;
}
else {
deg += (altitiudes[L-1] - (altitiudes[L] + X))*T;
}
}
if (R+1 <= N) {
if (altitiudes[R] < altitiudes[R+1]) {
deg -= (altitiudes[R] - altitiudes[R+1])*S;
}
else {
deg -= (altitiudes[R] - altitiudes[R+1])*T;
}
if ((altitiudes[R] + X) < altitiudes[R+1]) {
deg += ((altitiudes[R] + X) - altitiudes[R+1])*S;
}
else {
deg += ((altitiudes[R] + X) - altitiudes[R+1])*T;
}
}
for (j = L; j <= R; j++) {
altitiudes[j] += X;
}
// cout << deg << endl;
answers[i] = deg;
}
for (i = 0; i < Q-1; i++) {
cout << answers[i] << endl;
}
cout << answers[Q-1];
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |