oj.uz

답안 #98059

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98059 2019-02-20T05:14:59 Z qkxwsm Segments (IZhO18_segments) C++14
7 / 100
 584 ms 41984 KB 
#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 641
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 200013

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, T;
int ans;
pii ranges[MAXN];
multiset<pii> upds[2], na[2], nd[2];
ordered_set<pii> sqr[2][MAGIC + 10], stor[2][MAXN];
vi compress[2];

void rebuild(int flag)
{
	FOR(i, 0, SZ(compress[flag])) stor[flag][i].clear();
	FOR(i, 0, SZ(compress[flag]) / MAGIC + 2) sqr[flag][i].clear();
	compress[flag].clear();
	compress[flag].PB(-INF);
	for (pii p : upds[flag])
	{
		compress[flag].PB(p.fi);
	}
	sort(ALL(compress[flag]));
	compress[flag].erase(unique(ALL(compress[flag])), compress[flag].end());
	int lol = 0;
	for (pii p : upds[flag])
	{
		lol++;
		int x = LB(ALL(compress[flag]), p.fi) - compress[flag].begin();
		stor[flag][x].insert({p.se, lol});
	}
	FOR(i, 0, SZ(compress[flag]))
	{
		for (auto p : stor[flag][i])
		{
			sqr[flag][i / MAGIC].insert(p);
		}
	}
}

int query(int flag, int x, int ly, int ry)
{
	int res = 0;
	for (pii p : na[flag])
	{
		if (p.fi <= x && ly <= p.se && p.se <= ry) res++;
	}
	for (pii p : nd[flag])
	{
		if (p.fi <= x && ly <= p.se && p.se <= ry) res--;
	}
	x = LB(ALL(compress[flag]), x) - compress[flag].begin() - 1;
	// cerr << "HI " << x << endl;
	FOR(i, 0, x / MAGIC)
	{
		res += sqr[flag][i].order_of_key({ry, LLINF}) - sqr[flag][i].order_of_key({ly, 0});
	}
	FOR(i, x / MAGIC * MAGIC, x + 1)
	{
		res += stor[flag][i].order_of_key({ry, LLINF}) - stor[flag][i].order_of_key({ly, 0});
	}
	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);
	// }
	//0 is by indx, 1 is by size
	cin >> Q >> T;
	compress[0].PB(-INF); compress[1].PB(-INF);
	FOR(i, 0, Q)
	{
		if (i % MAGIC == 0)
		{
			na[0].clear(); na[1].clear(); nd[0].clear(); nd[1].clear();
			rebuild(0);
			rebuild(1);
		}
		int qid;
		cin >> qid;
		int lt, rt, k;
		if (qid == 1)
		{
			cin >> lt >> rt;
			if (T)
			{
				lt ^= ans; rt ^= ans;
			}
			if (lt > rt) swap(lt, rt);
			N++;
			ranges[N] = {lt, rt};
			na[0].insert({lt, rt});
			na[1].insert({lt, rt - lt + 1});
			upds[0].insert({lt, rt});
			upds[1].insert({lt, rt - lt + 1});
		}
		if (qid == 2)
		{
			int n;
			cin >> n;
			lt = ranges[n].fi; rt = ranges[n].se;
			nd[0].insert({lt, rt});
			nd[1].insert({lt, rt - lt + 1});
			upds[0].erase(upds[0].find({lt, rt}));
			upds[1].erase(upds[1].find({lt, rt - lt + 1}));
		}
		if (qid == 3)
		{
			cin >> lt >> rt >> k;
			if (T)
			{
				lt ^= ans; rt ^= ans;
			}
			if (lt > rt) swap(lt, rt);
			// cerr << "q " << lt << ' ' << rt << ' ' << k << endl;
			if (rt - lt + 1 < k)
			{
				ans = 0;
			}
			else
			{
				ans = query(0, lt - 1, lt + k - 1, 2 * INF)
				+ query(1, rt - k + 1, k, 2 * INF)
				- query(1, lt - 1, k, 2 * INF);
			}
			// cerr << "huh\n";
			cout << ans << '\n';
		}
		// cerr << "OK " << i << endl;
		// cerr << "YAY\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
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 38008 KB Output is correct
2 Correct 48 ms 37972 KB Output is correct
3 Correct 62 ms 38136 KB Output is correct
4 Correct 59 ms 38136 KB Output is correct
5 Correct 106 ms 39728 KB Output is correct
6 Correct 91 ms 39520 KB Output is correct
7 Correct 99 ms 38376 KB Output is correct
8 Correct 83 ms 39160 KB Output is correct
9 Correct 92 ms 39260 KB Output is correct
10 Correct 81 ms 39800 KB Output is correct
11 Correct 133 ms 39060 KB Output is correct
12 Correct 107 ms 39032 KB Output is correct
13 Correct 81 ms 39832 KB Output is correct
14 Correct 90 ms 39160 KB Output is correct
15 Correct 61 ms 38136 KB Output is correct
16 Correct 78 ms 38264 KB Output is correct
17 Correct 100 ms 38796 KB Output is correct
18 Correct 89 ms 39800 KB Output is correct
19 Correct 90 ms 38776 KB Output is correct
20 Correct 81 ms 38780 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 192 ms 41984 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 450 ms 38756 KB Output is correct
2 Correct 352 ms 38520 KB Output is correct
3 Correct 584 ms 38824 KB Output is correct
4 Correct 355 ms 38552 KB Output is correct
5 Runtime error 173 ms 41984 KB Execution killed with signal 9 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 365 ms 38464 KB Output is correct
2 Correct 400 ms 38676 KB Output is correct
3 Correct 388 ms 38648 KB Output is correct
4 Correct 420 ms 38572 KB Output is correct
5 Runtime error 213 ms 41984 KB Execution killed with signal 9 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 38008 KB Output is correct
2 Correct 48 ms 37972 KB Output is correct
3 Correct 62 ms 38136 KB Output is correct
4 Correct 59 ms 38136 KB Output is correct
5 Correct 106 ms 39728 KB Output is correct
6 Correct 91 ms 39520 KB Output is correct
7 Correct 99 ms 38376 KB Output is correct
8 Correct 83 ms 39160 KB Output is correct
9 Correct 92 ms 39260 KB Output is correct
10 Correct 81 ms 39800 KB Output is correct
11 Correct 133 ms 39060 KB Output is correct
12 Correct 107 ms 39032 KB Output is correct
13 Correct 81 ms 39832 KB Output is correct
14 Correct 90 ms 39160 KB Output is correct
15 Correct 61 ms 38136 KB Output is correct
16 Correct 78 ms 38264 KB Output is correct
17 Correct 100 ms 38796 KB Output is correct
18 Correct 89 ms 39800 KB Output is correct
19 Correct 90 ms 38776 KB Output is correct
20 Correct 81 ms 38780 KB Output is correct
21 Runtime error 192 ms 41984 KB Execution killed with signal 9 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 38008 KB Output is correct
2 Correct 48 ms 37972 KB Output is correct
3 Correct 62 ms 38136 KB Output is correct
4 Correct 59 ms 38136 KB Output is correct
5 Correct 106 ms 39728 KB Output is correct
6 Correct 91 ms 39520 KB Output is correct
7 Correct 99 ms 38376 KB Output is correct
8 Correct 83 ms 39160 KB Output is correct
9 Correct 92 ms 39260 KB Output is correct
10 Correct 81 ms 39800 KB Output is correct
11 Correct 133 ms 39060 KB Output is correct
12 Correct 107 ms 39032 KB Output is correct
13 Correct 81 ms 39832 KB Output is correct
14 Correct 90 ms 39160 KB Output is correct
15 Correct 61 ms 38136 KB Output is correct
16 Correct 78 ms 38264 KB Output is correct
17 Correct 100 ms 38796 KB Output is correct
18 Correct 89 ms 39800 KB Output is correct
19 Correct 90 ms 38776 KB Output is correct
20 Correct 81 ms 38780 KB Output is correct
21 Runtime error 192 ms 41984 KB Execution killed with signal 9 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -