Submission #320000

#	Time	Username	Problem	Language	Result	Execution time	Memory
320000		kym	Arcade (NOI20_arcade)	C++14	51 / 100	6 ms	1008 KiB

Arcade

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define reach cerr << "LINE: " << __LINE__ << "\n";
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
string cts(char x) {string t(1,x); return t;}
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, T b) { a = max(a, b); }
template <typename T> void chmin(T& a, T b) { a = min(a, b); }
const int MAXN = 500005;
#ifndef LOCAL
#define cerr if(0)cout
#endif
int n,m;
int A[MAXN];
int32_t main() 
{
	IAMSPEED
	cin >> n >> m;
	vector<pi> v;
	FOR(i,1,m) {
		cin>>A[i];
	}
	FOR(i,1,m) {
		int x; cin >> x;
		v.pb(pi(A[i]+x,A[i]-x));//x,y
	}
	sort(all(v), [](pi a, pi b) {
		if(a.f!=b.f)return a.f < b.f;
		else return a.s>b.s;
	});
	vector<int>lis;
	reverse(all(v));
	dbvp(v);
	for(auto i:v){
		int q=i.s;
		
		if(lis.empty()||lis.back()<q)lis.pb(q);
		else lis[lower_bound(all(lis),q)-lis.begin()]=q;
	}
	cout<<lis.size();
	
}

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 21 / 21
• Subtask 5: 0 / 14
• Subtask 6: 0 / 20
• Subtask 7: 0 / 15