# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
945980 | beepbeepsheep | New Home (APIO18_new_home) | C++17 | 1526 ms | 94644 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;
#define ll long long
#define ii pair<ll,ll>
#define iii tuple<ll,ll,ll>
#ifndef DEBUG
#define cerr if (0) cerr
#define endl '\n'
#endif // DEBUG
const ll maxn=2e5+5;
const ll inf=1e15;
const ll mod=1e9+7;
multiset<ll> s[405];
vector<tuple<ll,ll,ll,ll>> v;
vector<iii> q;
ll ans[maxn];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,qu,x,t,a,b,k;
cin>>n>>k>>qu;
for (int i=1;i<=n;i++){
cin>>x>>t>>a>>b;
v.emplace_back(a,x,t,1);
v.emplace_back(b+1,x,t,-1);
}
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... |