제출 #1234360

#제출 시각아이디문제언어결과실행 시간메모리
1234360lioowArcade (NOI20_arcade)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #define pb push_back #define int long long #define repp(i,x,n) for(int i=x;i<=n;i++) #define rep(i,x,n) for(int i=x;i>=n;i--) #define cy cout<<"YES"<<endl #define cn cout<<"NO"<<endl #define r0 return 0 #define fi first #define se second #define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define jelek cout<<"jelek"<<endl #define pii pair<int,int> #define all(v) v.begin(),v.end() #define pi pair<pair<int,int>,pair<int,int>> #define p3 pair<int,pair<int,int>> #define p4 pair<pii,pii> #define p2 #define tp tuple<int,int,int> #define fl fflush(stdout) #define lb long double #define p5 pair<int,pair<pair<int,int>,pair<int,int>>> #pragma GCC optimize ("O2") #pragma GCC optimize ("unroll-loops") using namespace std; int dx[4]={-1,0,1,0}; int dy[4]={0,-1,0,1}; using namespace __gnu_pbds; typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set; typedef tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset; const int mod=1e9+7,maxn=1e5+5,N=5e5+5,INF=1e18; const int MOD=998244353; //const int MOD=1e6+3; mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count()); pii dir[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}}; signed main(){ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); int n,m;cin>>n>>m; int t[m+2],a[m+2]; vector<pii>tile; for(int i=1;i<=m;i++){ cin>>t[i]; } for(int i=1;i<=m;i++){ cin>>a[i]; tile.pb({a[i]+t[i],t[i]-a[i]}); } sort(tile.begin(),tile.end()); vector<int>v; repp(i,0,m-1){ int x=tile[i].se; if(v.empty()||v.back()>x) v.pb(x); else v[lower_bound(all(v),x)-v.begin()]=x; } cout<<v.size()<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...