# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701452 | Abrar_Al_Samit | New Home (APIO18_new_home) | C++17 | 5063 ms | 37204 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>
using namespace std;
const int nax = 6e4 + 10;
int l[nax];
int x[nax], t[nax];
int pos[nax];
multiset<int>live[nax];
int ans[nax];
void PlayGround() {
int n, q, k;
cin>>n>>k>>q;
vector<int>imp;
map<int, vector<int>>query, shopin, shopout;
for(int i=0; i<n; ++i) {
cin>>x[i]>>t[i];
int a, b;
cin>>a>>b;
shopin[a].push_back(i);
shopout[b].push_back(i);
imp.push_back(a), imp.push_back(b);
}
for(int i=0; i<q; ++i) {
int x, y;
# | 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... |