# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
571515 | Cross_Ratio | New Home (APIO18_new_home) | C++14 | 5057 ms | 122712 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 int long long
using namespace std;
typedef pair<int,int> P;
int X[300005];
int type[300005];
int A[300005];
int B[300005];
int L[300005];
int Y[300005];
int ans[300005];
signed main() {
//cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N, K, Q;
cin >> N >> K >> Q;
int i, j;
for(i=0;i<N;i++) cin >> X[i] >> type[i] >> A[i] >> B[i];
vector<set<int>> S;
S.resize(K);
for(i=0;i<Q;i++) cin >> L[i] >> Y[i];
map<int,vector<P>> In;
map<int,vector<P>> Out;
for(i=0;i<N;i++) {
type[i]--;
In[A[i]].push_back(P(type[i],X[i]));
Out[B[i]].push_back(P(type[i],X[i]));
}
map<int,vector<P>> Query;
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... |