#include <bits/stdc++.h>
using namespace std;
#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a) cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,s,n) cout<<#a<<"=["; printarray(a,s,n); cout<<"]\n"
#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) { bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 l, T2 r){ for (T2 i = l; i<=r; i++) cout << a[i] << (i<r?" ":""); }
void cio(){
ios::sync_with_stdio(false);
cin.tie(NULL);
//cout << setprecision(15);
}
#define tt() printf("%.4f sec\n", (double) clock() / CLOCKS_PER_SEC )
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)
#define endl '\n'
typedef tuple<int,int,int> t3;
typedef tuple<int,int,int,int> t4;
void die(){printf("-1\n"); exit(0);}
int xx[8] = {1,-1,0,0,1,1,-1,-1}, yy[8] = {0,0,1,-1,1,-1,1,-1};
const ll mod = 1e9+7;
struct segTree{
int n; vector<int> d;
void init(int x){
n = 1; while( n < x ) n *= 2;
d.resize(n*2+10);
}
void update(int p, int x){
p += n-1; d[p] = x;
for(p>>=1;p;p>>=1) d[p] = max(d[p*2], d[p*2+1]);
}
int query(int l, int r){
int res = 0;
for(l+=n-1,r+=n-1;l<=r;l>>=1,r>>=1){
if( l&1 ) res = max(res, d[l++]);
if( !(r&1)) res = max(res, d[r--]);
}
return res;
}
};
int N,M, SZ;
int S[100100], V[100100], C[100100];
vector<int> idx, idx2;
vector<int> E[100100];
int cnt[100100];
segTree tree;
int main(){
scanf("%d%d",&N,&M);
repp(i,N) scanf("%d%d",&S[i], &V[i]);
repp(i,M) scanf("%d",&C[i]);
repp(i,M) idx.push_back(C[i]);
sort(all(idx)); idx.erase(unique(all(idx)), idx.end());
repp(i,M) C[i] = lower_bound(all(idx), C[i]) - idx.begin() + 1;
repp(i,N) S[i] = lower_bound(all(idx), S[i]) - idx.begin() + 1;
repp(i,M) SZ = max(SZ, C[i]);
repp(i,M) cnt[C[i]]++;
for(int i=SZ;i>=1;i--) cnt[i] += cnt[i+1];
repp(i,N) idx2.push_back(V[i]);
sort(all(idx2)); idx2.erase(unique(all(idx2)), idx2.end());
repp(i,N) V[i] = lower_bound(all(idx2), V[i]) - idx2.begin() + 1;
repp(i,N) E[S[i]].push_back(V[i]);
tree.init( sz(idx2)+2 );
int ans = 0;
for(int i=SZ;i>=1;i--){
int mx = cnt[i];
sort(all(E[i])); reverse(all(E[i]));
//Debug(E[i], cnt[i]);
for(auto e : E[i]){
int dd = tree.query(e, sz(idx2)+1 );
ans = max(ans, min(dd+1, mx));
dd = min(dd+1, mx);
tree.update(e, dd);
}
}
printf("%d\n",ans);
}
Compilation message
joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:100:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&N,&M);
~~~~~^~~~~~~~~~~~~~
joi2019_ho_t2.cpp:101:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
repp(i,N) scanf("%d%d",&S[i], &V[i]);
~~~~~^~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:102:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
repp(i,M) scanf("%d",&C[i]);
~~~~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
2688 KB |
Output is correct |
| 2 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 3 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 4 |
Correct |
6 ms |
2688 KB |
Output is correct |
| 5 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
2688 KB |
Output is correct |
| 2 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 3 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 4 |
Correct |
6 ms |
2688 KB |
Output is correct |
| 5 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
2688 KB |
Output is correct |
| 2 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 3 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 4 |
Correct |
6 ms |
2688 KB |
Output is correct |
| 5 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
