oj.uz

답안 #375093

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
375093 2021-03-09T02:41:35 Z Kevin_Zhang_TW Examination (JOI19_examination) C++17
100 / 100
 340 ms 13384 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l) == r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif 

struct lisan : vector<int> {
	void done() { sort(AI()), erase(unique(AI()), end()); }
	int operator()(int i) { return lower_bound(AI(), i) - begin(); }
};

const int MAX_N = 100010, MAX_M = MAX_N << 1, MAX_C = MAX_M;
int n, q;
int res[MAX_N];

const int QT = 0, MT = 1, LT = 1, RT = 0;

// big one comes first
struct info {
	int a, b, c, tp, id, sd;
	tuple<int,int,int,int,int> gtp() {
		return make_tuple(a, b, c, sd, tp);
	}
	info (int a, int b, int c, int tp, int id = -1, int sd = -1) :
		a(a), b(b), c(c), tp(tp), id(id), sd(sd) {}
	info () :
		a(0), b(0), c(0), tp(0), id(0), sd(0) {}
} arr[MAX_M] ;
bool operator < (info a, info b) {
	return a.gtp() > b.gtp();
}

struct rbit {
	int n;
	vector<int> val;
	rbit(int _n) : n(_n + 10) {
		val.resize(n);
	}
	void add(int i, int d) {
		for (;i;i ^= i&-i) 
			val[i] += d;
	}
	int qry(int i) {
		int res = 0;
		for (;i < n;i += i&-i)
			res += val[i];
		return res;
	}
};

rbit tree(0);

void solve(int l, int r) {

//	for (int i = l;i < r;++i)
//		for (int j = l;j < i;++j) 
//			if (arr[j].b >= arr[i].b  &&
//				arr[j].c >= arr[i].c) {
//				if (arr[j].tp == MT && arr[i].tp == QT) {
//					++res[ arr[i].id ];
//				}
//			}
//
//	return;
					
	if (r-l <= 1) return;
	int mid = l + r >> 1;
	solve(l, mid), solve(mid, r);

	for (int i = l;i < mid;++i) {
		auto &[a, b, c, tp, id, sd] = arr[i];
		sd = LT;
	}
	for (int i = mid;i < r;++i) {
		auto &[a, b, c, tp, id, sd] = arr[i];
		sd = RT;
	}

	DE(l, mid, r);

	auto cmp = [&](info x, info y) {
		auto [a, b, c, tp, id, sd] = x;
		auto [aa, bb, cc, tpp, idd, sdd] = y;
		return make_tuple(b, c, tp, sd) > 
			make_tuple(bb, cc, tpp, sdd);
	};
	inplace_merge(arr+l, arr+mid, arr+r, cmp);

	for (int i = l;i < r;++i) {
		auto &[a, b, c, tp, id, sd] = arr[i];
		DE(a, b, c, tp, id, sd);

		if (sd == LT && tp == MT)
			tree.add(c, 1);
		
		if (sd == RT && tp == QT) {
			DE(a, b, c, tp, id, sd);
			//DE(tree.qry(c));
			res[id] += tree.qry(c);
		}

	}
	for (int i = l;i < r;++i) {
		auto &[a, b, c, tp, id, sd] = arr[i];

		if (sd == LT && tp == MT)
			tree.add(c, -1);

	}

}
int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> q;
	for (int i = 0;i < n;++i) {
		int a, b;
		cin >> a >> b;
		arr[i] = {a, b, a + b, MT};
	}
	for (int i = 0;i < q;++i) {
		int a, b, c;
		cin >> a >> b >> c;
		arr[i + n] = {a, b, c, QT, i};
	}

	sort(arr, arr + n + q);

	{
		lisan L; L.reserve(n + q);
		for (int i = 0;i < n + q;++i) {
			auto [a, b, c, tp, id, sd] = arr[i];
			L.pb(c);
		}
		L.done();
		for (int i = 0;i < n + q;++i) {
			auto &[a, b, c, tp, id, sd] = arr[i];
			c = L(c) + 1;
		}
	}

	tree = rbit(n + q + 10);

	solve(0, n + q);

	for (int i = 0;i < q;++i)
		cout << res[i] << '\n';
}

Compilation message

examination.cpp: In function 'void solve(int, int)':
examination.cpp:78:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   78 |  int mid = l + r >> 1;
      |            ~~^~~
examination.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
examination.cpp:90:2: note: in expansion of macro 'DE'
   90 |  DE(l, mid, r);
      |  ^~
examination.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
examination.cpp:102:3: note: in expansion of macro 'DE'
  102 |   DE(a, b, c, tp, id, sd);
      |   ^~
examination.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
examination.cpp:108:4: note: in expansion of macro 'DE'
  108 |    DE(a, b, c, tp, id, sd);
      |    ^~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4972 KB Output is correct
2 Correct 3 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 4 ms 4972 KB Output is correct
5 Correct 4 ms 4972 KB Output is correct
6 Correct 4 ms 4972 KB Output is correct
7 Correct 12 ms 5228 KB Output is correct
8 Correct 11 ms 5228 KB Output is correct
9 Correct 11 ms 5228 KB Output is correct
10 Correct 10 ms 5228 KB Output is correct
11 Correct 10 ms 5356 KB Output is correct
12 Correct 8 ms 5228 KB Output is correct
13 Correct 10 ms 5228 KB Output is correct
14 Correct 10 ms 5228 KB Output is correct
15 Correct 11 ms 5228 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 10 ms 5228 KB Output is correct
18 Correct 7 ms 5228 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 302 ms 13212 KB Output is correct
2 Correct 299 ms 13224 KB Output is correct
3 Correct 305 ms 13208 KB Output is correct
4 Correct 242 ms 13212 KB Output is correct
5 Correct 245 ms 13212 KB Output is correct
6 Correct 162 ms 13372 KB Output is correct
7 Correct 274 ms 13224 KB Output is correct
8 Correct 277 ms 13344 KB Output is correct
9 Correct 281 ms 13212 KB Output is correct
10 Correct 222 ms 13212 KB Output is correct
11 Correct 222 ms 13340 KB Output is correct
12 Correct 142 ms 13216 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 302 ms 13212 KB Output is correct
2 Correct 299 ms 13224 KB Output is correct
3 Correct 305 ms 13208 KB Output is correct
4 Correct 242 ms 13212 KB Output is correct
5 Correct 245 ms 13212 KB Output is correct
6 Correct 162 ms 13372 KB Output is correct
7 Correct 274 ms 13224 KB Output is correct
8 Correct 277 ms 13344 KB Output is correct
9 Correct 281 ms 13212 KB Output is correct
10 Correct 222 ms 13212 KB Output is correct
11 Correct 222 ms 13340 KB Output is correct
12 Correct 142 ms 13216 KB Output is correct
13 Correct 323 ms 13212 KB Output is correct
14 Correct 319 ms 13212 KB Output is correct
15 Correct 300 ms 13212 KB Output is correct
16 Correct 282 ms 13212 KB Output is correct
17 Correct 271 ms 13212 KB Output is correct
18 Correct 173 ms 13212 KB Output is correct
19 Correct 325 ms 13212 KB Output is correct
20 Correct 320 ms 13372 KB Output is correct
21 Correct 310 ms 13212 KB Output is correct
22 Correct 219 ms 13212 KB Output is correct
23 Correct 220 ms 13212 KB Output is correct
24 Correct 145 ms 13212 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4972 KB Output is correct
2 Correct 3 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 4 ms 4972 KB Output is correct
5 Correct 4 ms 4972 KB Output is correct
6 Correct 4 ms 4972 KB Output is correct
7 Correct 12 ms 5228 KB Output is correct
8 Correct 11 ms 5228 KB Output is correct
9 Correct 11 ms 5228 KB Output is correct
10 Correct 10 ms 5228 KB Output is correct
11 Correct 10 ms 5356 KB Output is correct
12 Correct 8 ms 5228 KB Output is correct
13 Correct 10 ms 5228 KB Output is correct
14 Correct 10 ms 5228 KB Output is correct
15 Correct 11 ms 5228 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 10 ms 5228 KB Output is correct
18 Correct 7 ms 5228 KB Output is correct
19 Correct 302 ms 13212 KB Output is correct
20 Correct 299 ms 13224 KB Output is correct
21 Correct 305 ms 13208 KB Output is correct
22 Correct 242 ms 13212 KB Output is correct
23 Correct 245 ms 13212 KB Output is correct
24 Correct 162 ms 13372 KB Output is correct
25 Correct 274 ms 13224 KB Output is correct
26 Correct 277 ms 13344 KB Output is correct
27 Correct 281 ms 13212 KB Output is correct
28 Correct 222 ms 13212 KB Output is correct
29 Correct 222 ms 13340 KB Output is correct
30 Correct 142 ms 13216 KB Output is correct
31 Correct 323 ms 13212 KB Output is correct
32 Correct 319 ms 13212 KB Output is correct
33 Correct 300 ms 13212 KB Output is correct
34 Correct 282 ms 13212 KB Output is correct
35 Correct 271 ms 13212 KB Output is correct
36 Correct 173 ms 13212 KB Output is correct
37 Correct 325 ms 13212 KB Output is correct
38 Correct 320 ms 13372 KB Output is correct
39 Correct 310 ms 13212 KB Output is correct
40 Correct 219 ms 13212 KB Output is correct
41 Correct 220 ms 13212 KB Output is correct
42 Correct 145 ms 13212 KB Output is correct
43 Correct 331 ms 13212 KB Output is correct
44 Correct 340 ms 13384 KB Output is correct
45 Correct 332 ms 13340 KB Output is correct
46 Correct 285 ms 13212 KB Output is correct
47 Correct 277 ms 13212 KB Output is correct
48 Correct 169 ms 13212 KB Output is correct
49 Correct 317 ms 13212 KB Output is correct
50 Correct 324 ms 13212 KB Output is correct
51 Correct 302 ms 13212 KB Output is correct
52 Correct 253 ms 13212 KB Output is correct
53 Correct 224 ms 13212 KB Output is correct