# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
474215 | nonsensenonsense1 | New Home (APIO18_new_home) | C++17 | 5071 ms | 46552 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 <cstdio>
#include <set>
#include <algorithm>
const int N = 300000;
struct data {
int x, t, tm;
bool open;
bool operator<(data arg) {
return tm < arg.tm;
}
} s[N << 1];
struct query {
int x, tm, ind;
bool operator<(query arg) {
return tm < arg.tm;
}
} q[N];
int n, k, m, size, ans[N];
std::multiset<int> cur[N];
int main()
{
scanf("%d%d%d", &n, &k, &m);
for (int i = 0; i < n; ++i) {
scanf("%d%d%d%d", &s[i << 1].x, &s[i << 1].t, &s[i << 1].tm, &s[i << 1 | 1].tm);
s[i << 1 | 1].x = s[i << 1].x;
Compilation message (stderr)
# | 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... |