# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
358551 | shahriarkhan | Exhibition (JOI19_ho_t2) | C++14 | 10 ms | 4352 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 ;
int main()
{
int n , m ;
scanf("%d%d",&n,&m) ;
vector<pair<int,int> > paints ;
int frames[m+1] , dp[m+1][n+1] , pref[n+1] = {0} ;
paints.push_back({0,0}) ;
for(int i = 1 ; i <= n ; ++i)
{
int x , y ;
scanf("%d%d",&x,&y) ;
paints.push_back({y,x}) ;
}
sort(paints.begin()+1,paints.end()) ;
for(int i = 1 ; i <= m ; ++i)
{
scanf("%d",&frames[i]) ;
}
sort(frames+1,frames+m+1) ;
for(int i = 0 ; i <= m ; ++i)
{
for(int j = 0 ; j <= n ; ++j)
{
dp[i][j] = 0 ;
}
}
for(int i = 1 ; i <= m ; ++i)
{
for(int j = 1 ; j <= n ; ++j)
{
if(frames[i]<paints[j].second) continue ;
dp[i][j] = pref[j-1] + 1 ;
}
for(int j = 1 ; j <= n ; ++j)
{
pref[j] = max(pref[j-1],dp[i][j]) ;
}
}
printf("%d\n",pref[n]) ;
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... |