답안 #98132

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98132 2019-02-21T00:43:49 Z qkxwsm 운세 보기 2 (JOI14_fortune_telling2) C++14
100 / 100
965 ms 124360 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 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 1600013

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
*/
# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 88184 KB Output is correct
2 Correct 84 ms 88184 KB Output is correct
3 Correct 89 ms 88320 KB Output is correct
4 Correct 78 ms 88388 KB Output is correct
5 Correct 86 ms 88204 KB Output is correct
6 Correct 81 ms 88284 KB Output is correct
7 Correct 80 ms 88440 KB Output is correct
8 Correct 92 ms 88232 KB Output is correct
9 Correct 78 ms 88184 KB Output is correct
10 Correct 77 ms 88156 KB Output is correct
11 Correct 78 ms 88184 KB Output is correct
12 Correct 80 ms 88184 KB Output is correct
13 Correct 82 ms 88184 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 88184 KB Output is correct
2 Correct 84 ms 88184 KB Output is correct
3 Correct 89 ms 88320 KB Output is correct
4 Correct 78 ms 88388 KB Output is correct
5 Correct 86 ms 88204 KB Output is correct
6 Correct 81 ms 88284 KB Output is correct
7 Correct 80 ms 88440 KB Output is correct
8 Correct 92 ms 88232 KB Output is correct
9 Correct 78 ms 88184 KB Output is correct
10 Correct 77 ms 88156 KB Output is correct
11 Correct 78 ms 88184 KB Output is correct
12 Correct 80 ms 88184 KB Output is correct
13 Correct 82 ms 88184 KB Output is correct
14 Correct 110 ms 89836 KB Output is correct
15 Correct 143 ms 91424 KB Output is correct
16 Correct 171 ms 92536 KB Output is correct
17 Correct 206 ms 94760 KB Output is correct
18 Correct 234 ms 94744 KB Output is correct
19 Correct 199 ms 94708 KB Output is correct
20 Correct 193 ms 94692 KB Output is correct
21 Correct 180 ms 94960 KB Output is correct
22 Correct 154 ms 94580 KB Output is correct
23 Correct 153 ms 92984 KB Output is correct
24 Correct 148 ms 92396 KB Output is correct
25 Correct 146 ms 94660 KB Output is correct
26 Correct 141 ms 92036 KB Output is correct
27 Correct 148 ms 92788 KB Output is correct
28 Correct 143 ms 92660 KB Output is correct
29 Correct 159 ms 93556 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 88184 KB Output is correct
2 Correct 84 ms 88184 KB Output is correct
3 Correct 89 ms 88320 KB Output is correct
4 Correct 78 ms 88388 KB Output is correct
5 Correct 86 ms 88204 KB Output is correct
6 Correct 81 ms 88284 KB Output is correct
7 Correct 80 ms 88440 KB Output is correct
8 Correct 92 ms 88232 KB Output is correct
9 Correct 78 ms 88184 KB Output is correct
10 Correct 77 ms 88156 KB Output is correct
11 Correct 78 ms 88184 KB Output is correct
12 Correct 80 ms 88184 KB Output is correct
13 Correct 82 ms 88184 KB Output is correct
14 Correct 110 ms 89836 KB Output is correct
15 Correct 143 ms 91424 KB Output is correct
16 Correct 171 ms 92536 KB Output is correct
17 Correct 206 ms 94760 KB Output is correct
18 Correct 234 ms 94744 KB Output is correct
19 Correct 199 ms 94708 KB Output is correct
20 Correct 193 ms 94692 KB Output is correct
21 Correct 180 ms 94960 KB Output is correct
22 Correct 154 ms 94580 KB Output is correct
23 Correct 153 ms 92984 KB Output is correct
24 Correct 148 ms 92396 KB Output is correct
25 Correct 146 ms 94660 KB Output is correct
26 Correct 141 ms 92036 KB Output is correct
27 Correct 148 ms 92788 KB Output is correct
28 Correct 143 ms 92660 KB Output is correct
29 Correct 159 ms 93556 KB Output is correct
30 Correct 193 ms 90620 KB Output is correct
31 Correct 325 ms 96468 KB Output is correct
32 Correct 537 ms 103808 KB Output is correct
33 Correct 895 ms 124360 KB Output is correct
34 Correct 132 ms 90872 KB Output is correct
35 Correct 965 ms 124240 KB Output is correct
36 Correct 915 ms 124188 KB Output is correct
37 Correct 831 ms 124032 KB Output is correct
38 Correct 898 ms 124096 KB Output is correct
39 Correct 848 ms 123932 KB Output is correct
40 Correct 829 ms 123284 KB Output is correct
41 Correct 777 ms 123996 KB Output is correct
42 Correct 887 ms 123708 KB Output is correct
43 Correct 384 ms 121832 KB Output is correct
44 Correct 457 ms 122072 KB Output is correct
45 Correct 392 ms 122444 KB Output is correct
46 Correct 485 ms 118868 KB Output is correct
47 Correct 469 ms 110764 KB Output is correct
48 Correct 478 ms 114924 KB Output is correct
49 Correct 479 ms 114996 KB Output is correct