oj.uz

Submission #262636

# Submission time Handle Problem Language Result Execution time Memory
262636 2020-08-13T06:22:46 Z Cantfindme Arcade (NOI20_arcade) C++17
0 / 100
 0 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
const int maxn = 500010;

int n, buttons;
int T[maxn], A[maxn];
pi plots[maxn];

int32_t main() {
	FAST
	cin >> n >> buttons;
	for (int i =0;i<buttons;i++) cin >> T[i];
	for (int i =0;i<buttons;i++) cin >> A[i];
	
	for (int i =0;i<buttons;i++) plots[i] = pi(T[i] + A[i], T[i] - A[i] - buttons);
	
	sort(plots,plots+buttons);
	//for (int i =0;i<buttons;i++) cout << plots[i].f << " " << plots[i].s << "\n";
	
	vector <int> v;
	for (int i =0;i<buttons;i++) {
		if (v.empty() or v.back() < plots[i].s) v.push_back(-plots[i].s);
		else {
			int pos = lower_bound(v.begin(),v.end(),-plots[i].s) - v.begin();
			v[pos] = -plots[i].s;
		}
	}
	
	cout << v.size() << "\n";
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -