Submission #261262

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
261262	2020-08-11 15:36:49	Berted	Arcade (NOI20_arcade)	C++14	100 / 100	420 ms	17876 KiB

Arcade

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <algorithm>
#include <set>
#include <tuple>
#define pii pair<int, int>
#define fst first
#define snd second
/*
  Observe that we can go from a pair to another pair iff:
  |Aj - Ai| <= Tj - Ti
  Therefore, 
  Ti - Ai <= Tj - Aj ---> if Ai <= Aj
  Ti + Ai <= Tj + Aj ---> if Ai > Aj
  Observe that if Ti - Ai <= Tj - Aj for Ai <= Aj
  Ti + Ai <= Tj + Aj will also be satisfied.
  Therefore, we could sort the array based on Ti - Ai
  And change each element in the array into just Ti + Ai
  And the problem is now reduced to :
  The minimum number of groups required such that each group
  is an non-decreasing subsequence of the array.
*/
using namespace std;
set<int> s;
int m, n;
pii ar[500001];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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