oj.uz

답안 #102440

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102440 2019-03-25T02:41:48 Z qkxwsm Examination (JOI19_examination) C++14
2 / 100
 3000 ms 140004 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 140013

#define int long long

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;
typedef pair<pii, pii> ppp;

int N, Q;
pii arr[MAXN];
ppp quer[MAXN];
int ans[MAXN];
vi compress;
ordered_set<pii> seg[2 * MAXN];

//segment tree of ordered set!

void insert(int w, int L, int R, int a, int v)
{
	if (a < L || R < a) return;
	seg[w].insert({v, randomize(LLINF)});
	if (L == R) return;
	int mid = (L + R) >> 1;
	insert(w << 1, L, mid, a, v);
	insert(w << 1 | 1, mid + 1, R, a, v);
}
int query(int w, int L, int R, int a, int b, int v)
{
	if (b < L || R < a) return 0;
	if (a <= L && R <= b)
	{
		return SZ(seg[w]) - seg[w].order_of_key({v, 0});
	}
	int mid = (L + R) >> 1;
	return query(w << 1, L, mid, a, b, v) + query(w << 1 | 1, mid + 1, R, a, b, v);
}

bool cmp(pii a, pii b)
{
	return (a.fi + a.se) > (b.fi + b.se);
}
vpi lol;
void ins(int x, int y)
{
	// lol.PB({x, y});
	// cerr << "insert " << x << ' ' << y << endl;
	x = LB(ALL(compress), x) - compress.begin();
	insert(1, 0, SZ(compress), x, y);
}
int ask(int x, int y)
{
	// int res = 0;
	// for (pii p : lol)
	// {
	// 	if (p.fi >= x && p.se >= y) res++;
	// }
	// return res;
	// cerr << "ask " << x << ' ' << y << endl;
	x = LB(ALL(compress), x) - compress.begin();
	return query(1, 0, SZ(compress), x, SZ(compress) - 1, y);
}

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(INF);
	sort(ALL(compress));
	compress.erase(unique(ALL(compress)), compress.end());
    sort(arr, arr + N, cmp);
	FOR(i, 0, Q)
	{
		cin >> quer[i].se.fi >> quer[i].se.se >> quer[i].fi.fi;
		quer[i].fi.se = i;
	}
	sort(quer, quer + Q); reverse(quer, quer + Q);
	int iter = 0;
	FOR(i, 0, Q)
	{
		// cerr << "got " << quer[i].fi.fi << endl;
		while(iter < N && arr[iter].fi + arr[iter].se >= quer[i].fi.fi)
		{
			// cerr << "insert " << arr[iter].fi << ' ' << arr[iter].se << endl;
			ins(arr[iter].fi, arr[iter].se);
			iter++;
		}
		ans[quer[i].fi.se] = ask(quer[i].se.fi, quer[i].se.se);
	}
	FOR(i, 0, Q)
	{
		cout << ans[i] << '\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
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 26744 KB Output is correct
2 Correct 46 ms 26752 KB Output is correct
3 Correct 33 ms 26744 KB Output is correct
4 Correct 34 ms 26616 KB Output is correct
5 Correct 34 ms 26616 KB Output is correct
6 Correct 36 ms 26616 KB Output is correct
7 Correct 65 ms 29300 KB Output is correct
8 Correct 61 ms 29304 KB Output is correct
9 Correct 65 ms 29304 KB Output is correct
10 Correct 56 ms 29432 KB Output is correct
11 Correct 45 ms 27768 KB Output is correct
12 Correct 56 ms 27768 KB Output is correct
13 Correct 73 ms 29276 KB Output is correct
14 Correct 59 ms 29304 KB Output is correct
15 Correct 66 ms 29312 KB Output is correct
16 Correct 42 ms 27512 KB Output is correct
17 Correct 65 ms 29356 KB Output is correct
18 Correct 50 ms 27384 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3027 ms 140004 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3027 ms 140004 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 26744 KB Output is correct
2 Correct 46 ms 26752 KB Output is correct
3 Correct 33 ms 26744 KB Output is correct
4 Correct 34 ms 26616 KB Output is correct
5 Correct 34 ms 26616 KB Output is correct
6 Correct 36 ms 26616 KB Output is correct
7 Correct 65 ms 29300 KB Output is correct
8 Correct 61 ms 29304 KB Output is correct
9 Correct 65 ms 29304 KB Output is correct
10 Correct 56 ms 29432 KB Output is correct
11 Correct 45 ms 27768 KB Output is correct
12 Correct 56 ms 27768 KB Output is correct
13 Correct 73 ms 29276 KB Output is correct
14 Correct 59 ms 29304 KB Output is correct
15 Correct 66 ms 29312 KB Output is correct
16 Correct 42 ms 27512 KB Output is correct
17 Correct 65 ms 29356 KB Output is correct
18 Correct 50 ms 27384 KB Output is correct
19 Execution timed out 3027 ms 140004 KB Time limit exceeded
20 Halted 0 ms 0 KB -