Submission #237222

#	Time	Username	Problem	Language	Result	Execution time	Memory
237222		DIvanCode	Plahte (COCI17_plahte)	C++14	0 / 160	2091 ms	2168 KiB

plahte

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<queue>
#include<ctime>
#include<cassert>
#include<complex>
#include<string>
#include<cstring>
#include<chrono>
#include<random>
#include<bitset>
#include<iomanip>

#define x first
#define y second
#define mp make_pair
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define sz(v) (int) v.size()

using namespace std;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;

const int MAX_N = 8e4 + 5;

int n, m;
pii a[MAX_N], b[MAX_N];
int cnt[MAX_N];

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i].x >> a[i].y >> b[i].x >> b[i].y;
	}
	for (int i = 1; i <= m; ++i) {
		pii p;
		cin >> p.x >> p.y;
		for (int j = 1; j <= n; ++j) {
			if (a[j].x <= p.x && p.x <= b[j].x && a[j].y <= p.y && p.y <= b[j].y) {
				cnt[j]++;
			}
		}
	}
	for (int i = 1; i <= n; ++i) {
		cout << cnt[i] << "\n";
	}
	return 0;
}

• Subtask 1: 0 / 32
• Subtask 2: 0 / 32
• Subtask 3: 0 / 32
• Subtask 4: 0 / 32
• Subtask 5: 0 / 32