# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
735139 | keisuke6 | New Home (APIO18_new_home) | C++14 | 5059 ms | 69848 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 int long long
signed main(){
int N,K,Q;
cin>>N>>K>>Q;
vector<int> X(N),T(N),A(N),B(N);
vector<vector<tuple<int,int,int>>> G(K);
vector<multiset<tuple<int,int,int>>> sta(K);
vector<multiset<int>> Z(K);
vector<int> I(K,0);
for(int i=0;i<N;i++){
cin>>X[i]>>T[i]>>A[i]>>B[i];
T[i]--;
G[T[i]].push_back({A[i],B[i],X[i]});
}
for(int i=0;i<K;i++){
sort(G[i].begin(),G[i].end());
}
vector<pair<int,int>> Que(Q);
for(int i=0;i<Q;i++) cin>>Que[i].second>>Que[i].first;
vector<pair<int,int>> Que_ = Que;
sort(Que.begin(),Que.end());
map<pair<int,int>,int> m_ans;
for(int i=0;i<Q;i++){
int t = Que[i].first, x = Que[i].second;
for(int j=0;j<K;j++){
while(I[j] != G[j].size()){
int aa,bb,cc;
tie(aa,bb,cc) = G[j][I[j]];
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... |