# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698654 | vjudge1 | New Home (APIO18_new_home) | C++17 | 5094 ms | 16376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int ll
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
using namespace std;
const int N = 1e8 + 10, mod = 1e9 + 7;
struct st{
int x, t, a, b;
};
int n, k, q;
vector<st> v;
signed main()
{
FAST;
cin >> n >> k >> q;
v.resize(n);
for(int i = 0; i < n; i++) cin >> v[i].x >> v[i].t >> v[i].a >> v[i].b;
while(q--) {
int l, y;
cin >> l >> y;
bool vis[k+1];
vector<int> ans;
int cnt = 0;
for(int i = 1; i <= k; i++) vis[i] = 0;
for(int i = 0; i < n; i++) {
if(v[i].a <= y && v[i].b >= y) {
if(!vis[v[i].t]) {
cnt++;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |