답안 #96696 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
96696	2019-02-11T04:23:47 Z	qkxwsm	Simple game (IZhO17_game)	C++14	100 / 100	96 ms	7032 KB

game

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 1000013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N, Q;
int arr[MAXN];
int fen[MAXN];

void update(int idx, int v)
{
	for (int e = idx + 1; e <= MAXN - 10; e += e & (-e))
	{
		fen[e] += v;
	}
}
int query(int idx)
{
	int res = 0;
	for (int e = idx + 1; e; e -= e & (-e))
	{
		res += fen[e];
	}
	return res;
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N >> Q;
	FOR(i, 0, N)
	{
		cin >> arr[i];
	}
	FOR(i, 1, N)
	{
		int lo = arr[i - 1], hi = arr[i];
		if (lo > hi) swap(lo, hi);
		update(lo, 1);
		update(hi + 1, -1);
	}
	while(Q--)
	{
		int qid;
		cin >> qid;
		if (qid == 1)
		{
			int idx, val;
			cin >> idx >> val;
			idx--;
			if (idx != 0)
			{
				int lo = arr[idx - 1], hi = arr[idx];
				if (lo > hi) swap(lo, hi);
				update(lo, -1);
				update(hi + 1, 1);
			}
			if (idx != N - 1)
			{
				int lo = arr[idx], hi = arr[idx + 1];
				if (lo > hi) swap(lo, hi);
				update(lo, -1);
				update(hi + 1, 1);
			}
			arr[idx] = val;
			if (idx != 0)
			{
				int lo = arr[idx - 1], hi = arr[idx];
				if (lo > hi) swap(lo, hi);
				update(lo, 1);
				update(hi + 1, -1);
			}
			if (idx != N - 1)
			{
				int lo = arr[idx], hi = arr[idx + 1];
				if (lo > hi) swap(lo, hi);
				update(lo, 1);
				update(hi + 1, -1);
			}
		}
		if (qid == 2)
		{
			int val;
			cin >> val;
			cout << query(val) << '\n';
		}
	}
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Subtask #1
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	5 ms	3960 KB	Output is correct
3	Correct	4 ms	3960 KB	Output is correct
4	Correct	5 ms	3960 KB	Output is correct
5	Correct	5 ms	3960 KB	Output is correct
6	Correct	5 ms	3960 KB	Output is correct
7	Correct	3 ms	376 KB	Output is correct

Subtask #2
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	5 ms	3960 KB	Output is correct
3	Correct	4 ms	3960 KB	Output is correct
4	Correct	5 ms	3960 KB	Output is correct
5	Correct	5 ms	3960 KB	Output is correct
6	Correct	5 ms	3960 KB	Output is correct
7	Correct	3 ms	376 KB	Output is correct
8	Correct	39 ms	1784 KB	Output is correct
9	Correct	56 ms	6904 KB	Output is correct
10	Correct	55 ms	6904 KB	Output is correct
11	Correct	40 ms	1656 KB	Output is correct
12	Correct	42 ms	2936 KB	Output is correct
13	Correct	43 ms	2824 KB	Output is correct

Subtask #3
51.0 / 51.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	5 ms	3960 KB	Output is correct
3	Correct	4 ms	3960 KB	Output is correct
4	Correct	5 ms	3960 KB	Output is correct
5	Correct	5 ms	3960 KB	Output is correct
6	Correct	5 ms	3960 KB	Output is correct
7	Correct	3 ms	376 KB	Output is correct
8	Correct	39 ms	1784 KB	Output is correct
9	Correct	56 ms	6904 KB	Output is correct
10	Correct	55 ms	6904 KB	Output is correct
11	Correct	40 ms	1656 KB	Output is correct
12	Correct	42 ms	2936 KB	Output is correct
13	Correct	43 ms	2824 KB	Output is correct
14	Correct	91 ms	6908 KB	Output is correct
15	Correct	96 ms	6904 KB	Output is correct
16	Correct	90 ms	6804 KB	Output is correct
17	Correct	69 ms	6904 KB	Output is correct
18	Correct	71 ms	7032 KB	Output is correct

답안 #96696

Compilation message

Subtask #1 22.0 / 22.0

Subtask #2 27.0 / 27.0

Subtask #3 51.0 / 51.0

Subtask #1
22.0 / 22.0

Subtask #2
27.0 / 27.0

Subtask #3
51.0 / 51.0