Submission #391861

#	Time	Username	Problem	Language	Result	Execution time	Memory
391861		Kevin_Zhang_TW	케이크 (CEOI14_cake)	C++17	15 / 100	2096 ms	1680 KiB

cake

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 300010, inf = 1e9;
int n, sep;

int val[MAX_N];

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> sep;
	for (int i = 1;i <= n;++i)
		cin >> val[i];

	int q;
	cin >> q;
	while (q--) {
		char op;
		cin >> op;
		if (op == 'E') {
			int ind, e;
			cin >> ind >> e;
			int nv = n - e + 1;
			for (int i = 1;i <= n;++i)
				if (val[i] > val[ind] && val[i] <= nv)
					--val[i];
			val[ind] = nv;
			debug(val+1, val+1+n);
		}
		else {
			int b;
			cin >> b;
			//DE(b);
			int res = 0;
			if (b < sep) {
				for (int l = sep - 1, r = sep + 1;l >= b;--l) {
					while (r <= n && val[r] < val[l]) ++r, ++res;
					++res;
				}
			}
			if (b > sep) {
				for (int l = sep - 1, r = sep + 1;r <= b;++r) {
					while (l >= 1 && val[l] < val[r]) --l, ++res;
					++res;
				}
			}
			cout << res << '\n';
		}
	}
}

Compilation message (stderr)

cake.cpp: In function 'int32_t main()':
cake.cpp:16:20: warning: statement has no effect [-Wunused-value]
   16 | #define debug(...) 0
      |                    ^
cake.cpp:43:4: note: in expansion of macro 'debug'
   43 |    debug(val+1, val+1+n);
      |    ^~~~~

• Subtask 1: 15 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50