oj.uz

Submission #208478

# Submission time Handle Problem Language Result Execution time Memory
208478 2020-03-11T09:43:14 Z YJU Exhibition (JOI19_ho_t2) C++14
0 / 100
 5 ms 376 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll MOD=1e9+7;
const ll N=5e3+5;
const ld pi=3.14159265359;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(a) (ll)a.size()

ll n,m,p[N];
pll u[N];
vector<ll> v;

int main(){
	//ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>m;
	REP(i,n){
		cin>>u[i].X>>u[i].Y;
	}
	sort(u,u+n,[](pll a,pll b){
		return (a.Y!=b.Y?a.Y<b.Y:a.X<b.X);	
	});
	REP(i,m)cin>>p[i];
	sort(p,p+m);
	for(ll i=n-1;i>=0;i--){
		if(SZ(v)==m)break;
		if(SZ(v)==0&&u[i].X<=p[m-1]){v.pb(u[i].X);continue;}
		if(SZ(v)==0)continue;
		if(u[i].X<=v.back()&&u[i].X<=p[m-SZ(v)-1]){
			v.pb(u[i].X);
		}
	}
	cout<<SZ(v)<<"\n";
	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -