Submission #373289

#	Time	Username	Problem	Language	Result	Execution time	Memory
373289		morato	Examination (JOI19_examination)	C++17	0 / 100	438 ms	265620 KiB

examination

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;
const int S = 320;

struct BIT 
{
	int bit[S][N], n;

	void update(int x, int y) {
		for (int i = x; i > 0; i -= i & -i) {
			for (int j = y; j > 0; j -= j & -j) {
				bit[i][j]++;
			}
		}
	}

	int query(int x, int y) {
		int ret = 0;
		for (int i = x; i <= n; i += i & -i) {
			for (int j = y; j <= n; j += j & -j) {
				ret += bit[i][j];
			}
		}
		return ret;
	}
} bit;

struct Query
{
	int x, y, z, id;
	Query() {}
	Query(int _x, int _y, int _z, int _id): x(_x), y(_y), z(_z), id(_id) {}
	bool operator<(Query other) {
		return z > other.z;
	}
} q[N];

struct Aluno 
{
	int a, b, soma;
	Aluno() {}
	Aluno(int _a, int _b): a(_a), b(_b), soma(_a + _b) {}
	bool operator<(Aluno other) {
		return soma > other.soma;
	}
} a[N];

vector<pair<int, int>> cmp[2];
vector<Aluno> bloco[N];

int main() {
	int n, m;
	scanf("%d %d", &n, &m);
	for (int i = 0; i < n; i++) {
		int s, t;
		scanf("%d %d", &s, &t);
		a[i] = Aluno(s, t);
		cmp[0].emplace_back(s, i);
		cmp[1].emplace_back(t, i);
	}
	// comprime s e t
	for (int i : {0, 1}) {
		sort(cmp[i].begin(), cmp[i].end());
	}
	// conserta os ranges das queries
	for (int i = 0; i < m; i++) {
		int x, y, z;
		cin >> x >> y >> z;
		auto it = lower_bound(cmp[0].begin(), cmp[0].end(), make_pair(x, -1));
		x = (int) (it - cmp[0].begin()) + 1;
		it = lower_bound(cmp[1].begin(), cmp[1].end(), make_pair(y, -1));
		y = (int) (it - cmp[1].begin()) + 1;
		q[i] = Query(x, y, z, i);
	}
	// comprime de verdade
	for (int i = 0; i < (int) cmp[0].size(); i++) {
		a[cmp[0][i].second].a = i + 1;
	}
	for (int i = 0; i < (int) cmp[1].size(); i++) {
		a[cmp[1][i].second].b = i + 1;
	}
	// ordeno os alunos pela soma pra sempre pegar um prefixo do array
	sort(a, a + n);
	sort(q, q + n);
	bit.n = n;
	int ptr = 0;
	vector<int> ans(m + 5);
	for (int i = 0; i < m; i++) {
		for (; ptr < n && a[ptr].soma >= q[i].z; ptr++) {
			bit.update(a[ptr].a / S, a[ptr].b); // bloco do a, valor do b
			bloco[a[ptr].a / S].push_back(a[ptr]);
		}
		// com certeza todos os "eventos" com soma >= q[i].z ja foram processados
		// faz uma query de sufixo nos blocos de A > q[i].x e nos valores de B >= q[i].y
		ans[q[i].id] = bit.query(q[i].x / S + 1, q[i].y);
		for (auto cara : bloco[q[i].x / S]) {
			ans[q[i].id] += (cara.a >= q[i].x && cara.b >= q[i].y);
		}
	}
	for (int i = 0; i < m; i++) {
		printf("%d\n", ans[i]);
	}
}

Compilation message (stderr)

examination.cpp: In function 'int main()':
examination.cpp:55:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   55 |  scanf("%d %d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~~
examination.cpp:58:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   58 |   scanf("%d %d", &s, &t);
      |   ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 2
• Subtask 2: 0 / 20
• Subtask 3: 0 / 21
• Subtask 4: 0 / 57