| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 533603 | alvingogo | Exhibition (JOI19_ho_t2) | C++14 | 1 ms | 204 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>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define cd complex<double>
#define p_q priority_queue
using namespace std;
int main(){
AquA;
int n,m;
cin >> n >> m;
vector<pair<int,int> > v(n);
vector<int> p(m);
for(int i=0;i<n;i++){
cin >> v[i].sc >> v[i].fs;
}
sort(v.begin(),v.end());
for(int i=0;i<m;i++){
cin >> p[i];
}
sort(p.begin(),p.end());
int nw=0;
vector<pair<int,int> > z;
for(int i=0;i<n;i++){
nw=lower_bound(p.begin(),p.end(),v[i].sc)-p.begin();
if(nw==m){
continue;
}
auto h=lower_bound(z.begin(),z.end(),pair<int,int>(v[i].sc,0))-z.begin();
int a=h==0?nw:max(z[h-1].sc+1,nw);
if(a>=m){
continue;
}
if(h==z.size()){
z.push_back({v[i].sc,a});
}
else{
z[h].fs=v[i].sc;
z[h].sc=a;
}
}
cout << z.size() << "\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... | ||||
