oj.uz

답안 #937426

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937426 2024-03-04T03:42:54 Z aaron_dcoder Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 98 ms 13136 KB 
#define NDEBUG

#ifdef NDEBUG
#define dbg(TXTMSG) if constexpr (false) cerr << "lol"
#define dbgv(VARN) ((void)0)
#define dbgfor(COND) if constexpr (false) for (COND)

#else
#define _GLIBCXX_DEBUG 1
#define _GLIBCXX_DEBUG_PEDANTIC 1
#pragma GCC optimize("trapv")
#define dbg(TXTMSG) cerr << "\n" << TXTMSG
#define dbgv(VARN) cerr << "\n" << #VARN << " = "<< VARN  << ", line: " << __LINE__ << "\n"
#define dbgfor(COND) for (COND)

#endif

#include <bits/stdc++.h>
using namespace std;
using ll = long long; 
using pll = pair<ll,ll>;
#define e0 first
#define e1 second
constexpr ll INFTY = 2e18;

int main() 
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	ll N,Q,S,T;
	cin >> N >> Q >> S >> T;
	S *= -1;
	T *= -1;

	vector<ll> A(N+1);
	for (ll i = 0; i < N+1; ++i)
	{
		cin >> A[i];
	}

	vector<ll> pdiff(N);
	ll currans=0;
	for (ll i = 0; i < N; ++i)
	{
		pdiff[i]=A[i+1]-A[i];
		if (pdiff[i]>0)
		{
			currans += S*pdiff[i];
		}
		else {
			currans += T*pdiff[i];
		}
	}
dbg("h");
	for (ll qno = 0; qno < Q; qno++)
	{
		ll L, R , X;
		cin >> L >> R >> X;
		dbg(L << " " << R << " " << X);

		if (pdiff[L-1]>0)
		{
			currans -= S*pdiff[L-1];
		}
		else {
			currans -= T*pdiff[L-1];
		}
		if (R<N){
		if (pdiff[R]>0)
		{
			currans -= S*pdiff[R];
		}
		else {
			currans -= T*pdiff[R];
		}}

		pdiff[L-1] += X;
		if (R<N) pdiff[R] -= X;

		if (pdiff[L-1]>0)
		{
			currans += S*pdiff[L-1];
		}
		else {
			currans += T*pdiff[L-1];
		}

		if (R<N){
		if (pdiff[R]>0)
		{
			currans += S*pdiff[R];
		}
		else {
			currans += T*pdiff[R];
		}}

		cout << currans << "\n";


	}
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 504 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 6264 KB Output is correct
2 Correct 82 ms 10876 KB Output is correct
3 Correct 76 ms 11604 KB Output is correct
4 Correct 71 ms 10836 KB Output is correct
5 Correct 76 ms 11960 KB Output is correct
6 Correct 65 ms 11056 KB Output is correct
7 Correct 83 ms 11088 KB Output is correct
8 Correct 98 ms 11860 KB Output is correct
9 Correct 78 ms 12252 KB Output is correct
10 Correct 74 ms 10928 KB Output is correct
11 Correct 60 ms 10832 KB Output is correct
12 Correct 66 ms 11600 KB Output is correct
13 Correct 66 ms 12016 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 504 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 77 ms 6264 KB Output is correct
23 Correct 82 ms 10876 KB Output is correct
24 Correct 76 ms 11604 KB Output is correct
25 Correct 71 ms 10836 KB Output is correct
26 Correct 76 ms 11960 KB Output is correct
27 Correct 65 ms 11056 KB Output is correct
28 Correct 83 ms 11088 KB Output is correct
29 Correct 98 ms 11860 KB Output is correct
30 Correct 78 ms 12252 KB Output is correct
31 Correct 74 ms 10928 KB Output is correct
32 Correct 60 ms 10832 KB Output is correct
33 Correct 66 ms 11600 KB Output is correct
34 Correct 66 ms 12016 KB Output is correct
35 Correct 79 ms 10600 KB Output is correct
36 Correct 92 ms 11864 KB Output is correct
37 Correct 79 ms 12628 KB Output is correct
38 Correct 80 ms 12368 KB Output is correct
39 Correct 77 ms 12368 KB Output is correct
40 Correct 80 ms 12484 KB Output is correct
41 Correct 78 ms 12252 KB Output is correct
42 Correct 77 ms 12364 KB Output is correct
43 Correct 74 ms 11604 KB Output is correct
44 Correct 76 ms 12120 KB Output is correct
45 Correct 72 ms 12060 KB Output is correct
46 Correct 75 ms 13136 KB Output is correct
47 Correct 82 ms 11704 KB Output is correct
48 Correct 66 ms 11824 KB Output is correct
49 Correct 91 ms 10844 KB Output is correct
50 Correct 63 ms 11600 KB Output is correct
51 Correct 68 ms 11848 KB Output is correct
52 Correct 67 ms 11736 KB Output is correct