# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
109694 | ffresh | Matryoshka (JOI16_matryoshka) | C++17 | 3 ms | 384 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 N = 105;
int R[N],H[N];
void solve() {
int n,q;
scanf("%d%d",&n,&q);
for(int i=0;i<n;++i) {
scanf("%d%d",&R[i],&H[i]);
}
for(int i=0;i<q;++i) {
vector<pair<int,int> > in;
int a,b;
scanf("%d%d",&a,&b);
for(int j = 0;j<n;++j) {
if(R[j]>=a && H[j]<=b) {
in.push_back(make_pair(R[j],H[j]));
}
}
sort(in.begin(),in.end());
multiset<pair<int,int> >s;
int ret = 0;
for(int j = 0;j<in.size();++j) {
s.insert(make_pair(in[j].second,in[j].first));
}
for(int j = in.size()-1;j>=0;) {
int k;
for(k = j;k>=0;--k) {
if(in[j].first!= in[k].first) {
break;
}
//cout<<in[k].first<<endl;
if(s.count(make_pair(in[k].second,in[k].first))){
++ret;
multiset<pair<int,int> > ::iterator it = s.find(make_pair(in[k].second,in[k].first));
s.erase(it);
}
}
for(k = j;k>=0;--k) {
if(in[j].first != in[k].first) {
break;
}
int g = in[k].second;
multiset<pair<int,int> >::iterator it = s.lower_bound(make_pair(g,0));
if(it != s.begin()) {
it = prev(it);
s.erase(it);
}
}
j = k;
}
printf("%d\n", ret);
}
}
int main()
{
//freopen("input.txt","r",stdin);
solve();
}
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... |