# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99014 | kriii | Exhibition (JOI19_ho_t2) | C++17 | 119 ms | 1912 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 <stdio.h>
#include <algorithm>
using namespace std;
int N,M,C;
pair<int, int> pic[100100];
int sz[100100],bit[100100];
int out(int x)
{
int r = 0;
while (x){
r = max(r,bit[x]);
x -= x & (-x);
}
return r;
}
void in(int x, int p)
{
while (x <= C){
bit[x] = max(bit[x],p);
x += x & (-x);
}
}
int main()
{
scanf ("%d %d",&N,&M);
for (int i=0;i<N;i++){
scanf ("%d %d",&pic[i].second,&pic[i].first);
pic[i].first = -pic[i].first;
pic[i].second = -pic[i].second;
}
sort(pic,pic+N);
for (int i=0;i<N;i++){
int x = C + 1;
if (pic[i].first != pic[i+1].first) C++;
pic[i].first = x;
pic[i].second = -pic[i].second;
}
for (int i=0;i<M;i++) scanf ("%d",&sz[i]);
sort(sz,sz+M);
for (int i=0;i<N;i++){
int u = out(pic[i].first) + 1;
int v = M - (lower_bound(sz,sz+M,pic[i].second) - sz);
in(pic[i].first,min(u,v));
}
printf ("%d\n",out(C));
return 0;
}
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... |