이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define ft first
#define sd second
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
using namespace std;
typedef long long ll;
typedef long double ld;
int n, m, xl[N], yl[N], xr[N], yr[N], x[N], y[N], k[N];
set <int> s[N];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> xl[i] >> yl[i] >> xr[i] >> yr[i];
for (int i = 0; i < m; i++)
cin >> x[i] >> y[i] >> k[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
if ((x[j] >= xl[i]) && (x[j] <= xr[i]) && (y[j] >= yl[i]) && (y[j] <= yr[i]))
s[i].insert(k[j]);
for (int i = 0; i < n; i++)
cout << sz(s[i]) << el;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |