Submission #285511

#	Time	Username	Problem	Language	Result	Execution time	Memory
285511		arnold518	Arcade (NOI20_arcade)	C++14	100 / 100	346 ms	24360 KiB

Arcade

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXM = 5e5;
const int INF = 1e9;

int N, M, T[MAXM+10], A[MAXM+10], C[MAXM+10];
pii B[MAXM+10];

int tree[MAXM+10];
void update(int i, int k) { i=M-i+1; for(; i<=M; i+=(i&-i)) tree[i]=max(tree[i], k); }
int query(int i) { i=M-i+1; int ret=0; for(; i>0; i-=(i&-i)) ret=max(ret, tree[i]); return ret; }

int dp[MAXM+10];

int main()
{
	scanf("%d%d", &N, &M);
	for(int i=1; i<=M; i++) scanf("%d", &T[i]);
	for(int i=1; i<=M; i++) scanf("%d", &A[i]);

	for(int i=1; i<=M; i++)
	{
		int x=T[i]-A[i], y=A[i]+T[i];
		B[i]={x, y};
	}
	sort(B+1, B+M+1);

	vector<int> comp;
	for(int i=1; i<=M; i++) comp.push_back(B[i].second);
	sort(comp.begin(), comp.end());
	comp.erase(unique(comp.begin(), comp.end()), comp.end());

	for(int i=1; i<=M; i++) C[i]=lower_bound(comp.begin(), comp.end(), B[i].second)-comp.begin()+1;

	int ans=0;
	for(int i=1; i<=M; i++)
	{
		dp[i]=query(C[i]+1)+1;
		ans=max(ans, dp[i]);
		update(C[i], dp[i]);
	}
	printf("%d\n", ans);
}

Compilation message (stderr)

Arcade.cpp: In function 'int main()':
Arcade.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   22 |  scanf("%d%d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~
Arcade.cpp:23:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |  for(int i=1; i<=M; i++) scanf("%d", &T[i]);
      |                          ~~~~~^~~~~~~~~~~~~
Arcade.cpp:24:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   24 |  for(int i=1; i<=M; i++) scanf("%d", &A[i]);
      |                          ~~~~~^~~~~~~~~~~~~

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