oj.uz

Submission #493114

# Submission time Handle Problem Language Result Execution time Memory
493114 2021-12-10T05:51:53 Z Koying Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 104 ms 7176 KB 
#pragma region
#pragma optimize("O3")
#include <bits/stdc++.h>
#define Weakoying ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define int long long
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pqueue priority_queue
#define pb push_back
#define F first
#define S second
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
#define cmax(a, b) a = (a > b ? a : b)
#define cmin(a, b) a = (a < b ? a : b)
#define put(x) cout << x << endl;
#define putarr(x) for(int i = 0; i < sizeof(x); i++) cout << x[i] << (" \n")[i == sizeof(x) - 1]; 
#define stop system("pause");
#define MEM(x, n) memset(x, n, sizeof(x));
#define lowbit(x) x &(-x)
#if !LOCAL
#define endl "\n"
#endif
const int INF = 0x3f3f3f3f;
const int P = 1e9+7;

using namespace std;
#pragma endregion
/******************************************************************************/
#define MAXN 200005
#define MAXM 1000005 
int n, q, s, t;

int x[MAXN], pre[MAXN];

int f(int i)
{
	int rtn = 0;
	if(i > 0)
		rtn -= i * s;
	else rtn -= i * t;
	return rtn;
}

void sol()
{
	cin >> n >> q >> s >> t;
	for(int i = 0; i <= n; i++)
	{
		cin >> x[i];
		if(i)
			pre[i] = x[i] - x[i - 1];
	}
	int ans = 0;
	for(int i = 1; i <= n; i++)
	{
		ans += f(pre[i]);
	}
	// cout << ans << endl;
	int l, r, v;
	while(q--)
	{
		cin >> l >> r >> v;
		
		int tmp = (v > 0 ? 1 : -1);
		if(pre[l] > 0)
		{
			int after = pre[l] + v;
			if(after < 0)
			{
				ans -= f(pre[l]);
				ans += f(after);
			}
			else
			{
				ans -= f(pre[l]);		
				ans += f(after);
			}
			
			pre[l] = after;
		}
		else // < 0
		{
			int after = pre[l] + v;
			if(after > 0)
			{
				ans -= f(pre[l]);
				ans += tmp * f(after);
			}
			else
			{
				ans -= f(pre[l]);
				ans += f(after);
			}
			pre[l] = after;
		}
		// cout << ans << " ";
		if(r != n) 
		{
			if(pre[r + 1] > 0)
			{
				int after = pre[r + 1] - v;
				if(after < 0)
				{
					ans -= f(pre[r + 1]);
					ans += f(after);
				}
				else
				{
					
					ans -= f(pre[r + 1]);
					ans += f(after);
				}
				pre[r + 1] = after;
			}
			else
			{

				int after = pre[r + 1] - v;
				if(after > 0)
				{
					
					ans -= f(pre[r + 1]);
					ans += f(after);
				}
				else
				{
					
					ans -= f(pre[r + 1]);
					ans += f(after);
				}
				pre[r + 1] = after;
			}
		}
		tmp = -tmp;
		
		cout << ans << endl;
		// for(int i = 1; i <= n; i++)
			// cout << pre[i] << " ";
		// cout << endl;
	}
	
}

signed main()
{
    Weakoying;
    int t = 1;
    //while (cin >> t)
    {
    	while (t--)
        {
            sol();
        }
    }
        
    return 0;
}

Compilation message

foehn_phenomena.cpp:1: warning: ignoring '#pragma region ' [-Wunknown-pragmas]
    1 | #pragma region
      | 
foehn_phenomena.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize("O3")
      | 
foehn_phenomena.cpp:29: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
   29 | #pragma endregion
      |

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 4824 KB Output is correct
2 Correct 86 ms 5416 KB Output is correct
3 Correct 98 ms 5984 KB Output is correct
4 Correct 98 ms 5188 KB Output is correct
5 Correct 93 ms 5904 KB Output is correct
6 Correct 85 ms 6316 KB Output is correct
7 Correct 79 ms 6316 KB Output is correct
8 Correct 90 ms 6256 KB Output is correct
9 Correct 91 ms 6680 KB Output is correct
10 Correct 86 ms 5288 KB Output is correct
11 Correct 77 ms 6380 KB Output is correct
12 Correct 78 ms 6800 KB Output is correct
13 Correct 74 ms 7136 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 86 ms 4824 KB Output is correct
23 Correct 86 ms 5416 KB Output is correct
24 Correct 98 ms 5984 KB Output is correct
25 Correct 98 ms 5188 KB Output is correct
26 Correct 93 ms 5904 KB Output is correct
27 Correct 85 ms 6316 KB Output is correct
28 Correct 79 ms 6316 KB Output is correct
29 Correct 90 ms 6256 KB Output is correct
30 Correct 91 ms 6680 KB Output is correct
31 Correct 86 ms 5288 KB Output is correct
32 Correct 77 ms 6380 KB Output is correct
33 Correct 78 ms 6800 KB Output is correct
34 Correct 74 ms 7136 KB Output is correct
35 Correct 98 ms 4936 KB Output is correct
36 Correct 91 ms 6368 KB Output is correct
37 Correct 99 ms 7176 KB Output is correct
38 Correct 94 ms 7024 KB Output is correct
39 Correct 100 ms 6944 KB Output is correct
40 Correct 101 ms 6980 KB Output is correct
41 Correct 96 ms 6860 KB Output is correct
42 Correct 90 ms 6972 KB Output is correct
43 Correct 91 ms 6184 KB Output is correct
44 Correct 95 ms 6724 KB Output is correct
45 Correct 96 ms 6340 KB Output is correct
46 Correct 89 ms 7088 KB Output is correct
47 Correct 81 ms 6972 KB Output is correct
48 Correct 77 ms 7128 KB Output is correct
49 Correct 89 ms 6208 KB Output is correct
50 Correct 104 ms 7016 KB Output is correct
51 Correct 75 ms 6976 KB Output is correct
52 Correct 85 ms 6976 KB Output is correct