Submission #98131

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
98131	2019-02-21T00:43:08 Z	qkxwsm	Fortune Telling 2 (JOI14_fortune_telling2)	C++14	35 / 100	282 ms	71896 KB

fortune_telling2

#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 400013

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, M;
pii arr[MAXN];
int quer[MAXN];
int loc[MAXN];
vi compress;
priority_queue<pii> ok[MAXN];
//segment tree must store: max, location of max!
pii stor[MAXN];
int res[MAXN];
vpi quers[MAXN];
ll ans;

pii comb(pii a, pii b)
{
	pii res;
	res = max(a, b);
	return res;
}
void update(int w, int L, int R, int a, int v)
{
	if (a < L || R < a)
	{
		return;
	}
	if (L == R)
	{
		stor[w] = {v, a};
		return;
	}
	int mid = (L + R) >> 1;
	update(w << 1, L, mid, a, v);
	update(w<<1|1, mid + 1, R, a, v);
	stor[w] = comb(stor[w << 1], stor[w << 1 | 1]);
}
pii query(int w, int L, int R, int a, int b)
{
	if (b < L || R < a)
	{
		return {-1, -1};
	}
	if (a <= L && R <= b)
	{
		return stor[w];
	}
	int mid = (L + R) >> 1;
	return comb(query(w << 1, L, mid, a, b), query(w << 1 | 1, mid + 1, R, a, b));
}

int fen[MAXN];
void upd(int idx, int v)
{
	for (int e = idx + 1; e <= M; e += e & (-e))
	{
		fen[e] += v;
	}
	return;
}
int qry(int idx)
{
	int res = 0;
	for (int e = idx + 1; e > 0; 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].fi >> arr[i].se;
		compress.PB(arr[i].fi);
		compress.PB(arr[i].se);
	}
	compress.PB(-1);
	sort(ALL(compress));
	compress.erase(unique(ALL(compress)), compress.end());
	FOR(i, 0, Q)
	{
		cin >> quer[i];
		quer[i] = UB(ALL(compress), quer[i]) - compress.begin() - 1;
		// cerr << quer[i] << endl;
	}
	FOR(i, 0, N)
	{
		arr[i].fi = UB(ALL(compress), arr[i].fi) - compress.begin() - 1;
		arr[i].se = UB(ALL(compress), arr[i].se) - compress.begin() - 1;
		// cerr << arr[i].fi << ',' << arr[i].se << endl;
	}
	M = SZ(compress);
	FOR(i, 0, M)
	{
		ok[i].push({-1, -1});
	}
	FOR(i, 0, N)
	{
		int lo = min(arr[i].fi, arr[i].se), hi = max(arr[i].fi, arr[i].se);
		ok[lo].push({hi, i});
	}
	FOR(i, 0, M)
	{
		update(1, 0, M - 1, i, ok[i].top().fi);
	}
	FORD(i, Q, 0)
	{
		int x = quer[i];
		while(true)
		{
			pii p = query(1, 0, M - 1, 0, x);
			// cerr << "move " << p.fi << ' ' << p.se << endl;
			if (p.fi <= x)
			{
				break;
			}
			loc[ok[p.se].top().se] = i + 1;
			ok[p.se].pop();
			update(1, 0, M - 1, p.se, ok[p.se].top().fi);
		}
	}
	// FOR(i, 0, N)
	// {
	// 	cerr << loc[i] << ' ';
	// }
	// cerr << endl;
	FOR(i, 0, N)
	{
		if (loc[i] == 0 && arr[i].fi < arr[i].se)
		{
			res[i]++;
		}
		quers[loc[i]].PB({max(arr[i].fi, arr[i].se), i});
	}
	FORD(i, Q, 0)
	{
		upd(quer[i], 1);
		for (pii p : quers[i])
		{
			res[p.se] += (qry(M - 1) - qry(p.fi - 1));
			res[p.se] %= 2;
		}
	}
	FOR(i, 0, N)
	{
		if (res[i])
		{
			res[i] = compress[min(arr[i].fi, arr[i].se)];
		}
		else
		{
			res[i] = compress[max(arr[i].fi, arr[i].se)];
		}
		// DBG(res[i]);
		ans += res[i];
	}
	cout << ans << '\n';
	//i see what's going on
	//for each guy, find the last guy such that, OK, no matter what it's gonna be on one side
	//find the last guy that's between any of them?
	// 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

4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	22520 KB	Output is correct
2	Correct	24 ms	22400 KB	Output is correct
3	Correct	26 ms	22656 KB	Output is correct
4	Correct	24 ms	22520 KB	Output is correct
5	Correct	25 ms	22520 KB	Output is correct
6	Correct	25 ms	22528 KB	Output is correct
7	Correct	21 ms	22528 KB	Output is correct
8	Correct	26 ms	22528 KB	Output is correct
9	Correct	22 ms	22528 KB	Output is correct
10	Correct	22 ms	22400 KB	Output is correct
11	Correct	23 ms	22520 KB	Output is correct
12	Correct	23 ms	22392 KB	Output is correct
13	Correct	27 ms	22392 KB	Output is correct

Subtask #2

31.0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	22520 KB	Output is correct
2	Correct	24 ms	22400 KB	Output is correct
3	Correct	26 ms	22656 KB	Output is correct
4	Correct	24 ms	22520 KB	Output is correct
5	Correct	25 ms	22520 KB	Output is correct
6	Correct	25 ms	22528 KB	Output is correct
7	Correct	21 ms	22528 KB	Output is correct
8	Correct	26 ms	22528 KB	Output is correct
9	Correct	22 ms	22528 KB	Output is correct
10	Correct	22 ms	22400 KB	Output is correct
11	Correct	23 ms	22520 KB	Output is correct
12	Correct	23 ms	22392 KB	Output is correct
13	Correct	27 ms	22392 KB	Output is correct
14	Correct	45 ms	24440 KB	Output is correct
15	Correct	70 ms	26104 KB	Output is correct
16	Correct	106 ms	27512 KB	Output is correct
17	Correct	139 ms	29940 KB	Output is correct
18	Correct	138 ms	29940 KB	Output is correct
19	Correct	121 ms	29908 KB	Output is correct
20	Correct	140 ms	30040 KB	Output is correct
21	Correct	124 ms	30252 KB	Output is correct
22	Correct	115 ms	29556 KB	Output is correct
23	Correct	83 ms	27764 KB	Output is correct
24	Correct	83 ms	27120 KB	Output is correct
25	Correct	90 ms	29428 KB	Output is correct
26	Correct	76 ms	27120 KB	Output is correct
27	Correct	96 ms	27892 KB	Output is correct
28	Correct	83 ms	28016 KB	Output is correct
29	Correct	102 ms	28788 KB	Output is correct

Subtask #3

0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	22520 KB	Output is correct
2	Correct	24 ms	22400 KB	Output is correct
3	Correct	26 ms	22656 KB	Output is correct
4	Correct	24 ms	22520 KB	Output is correct
5	Correct	25 ms	22520 KB	Output is correct
6	Correct	25 ms	22528 KB	Output is correct
7	Correct	21 ms	22528 KB	Output is correct
8	Correct	26 ms	22528 KB	Output is correct
9	Correct	22 ms	22528 KB	Output is correct
10	Correct	22 ms	22400 KB	Output is correct
11	Correct	23 ms	22520 KB	Output is correct
12	Correct	23 ms	22392 KB	Output is correct
13	Correct	27 ms	22392 KB	Output is correct
14	Correct	45 ms	24440 KB	Output is correct
15	Correct	70 ms	26104 KB	Output is correct
16	Correct	106 ms	27512 KB	Output is correct
17	Correct	139 ms	29940 KB	Output is correct
18	Correct	138 ms	29940 KB	Output is correct
19	Correct	121 ms	29908 KB	Output is correct
20	Correct	140 ms	30040 KB	Output is correct
21	Correct	124 ms	30252 KB	Output is correct
22	Correct	115 ms	29556 KB	Output is correct
23	Correct	83 ms	27764 KB	Output is correct
24	Correct	83 ms	27120 KB	Output is correct
25	Correct	90 ms	29428 KB	Output is correct
26	Correct	76 ms	27120 KB	Output is correct
27	Correct	96 ms	27892 KB	Output is correct
28	Correct	83 ms	28016 KB	Output is correct
29	Correct	102 ms	28788 KB	Output is correct
30	Correct	116 ms	26872 KB	Output is correct
31	Correct	282 ms	33412 KB	Output is correct
32	Runtime error	281 ms	71896 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
33	Halted	0 ms	0 KB	-