Submission #1141309

#TimeUsernameProblemLanguageResultExecution timeMemory
1141309ray1457Arcade (NOI20_arcade)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define ff first
#define ss second

void solve() {
	int n,m;
	cin >> n >> m;
	vi a(m), b(m);
	for (auto &i : a) cin >> i;
	for (auto &i : b) cin >> i;
	vector<pii> v(m);
	for (int i = 0; i<m; i++) {
		v[i] = {a[i], b[i]};
	}

	sort(v.begin(), v.end());
	for (int i = 1; i<n; i++) {
		if (v[i].ff - v[i-1].ff < v[i].ss - v[i-1].ss) {
			cout << 2 << endl;
			return;
		}
	}
	cout << 1 << endl;

}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int t = 1;
	// cin >> t;
	while (t--) solve();
}
#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...