oj.uz

Submission #284256

# Submission time Handle Problem Language Result Execution time Memory
284256 2020-08-27T05:51:09 Z 임성재(#5754) Arcade (NOI20_arcade) C++17
0 / 100
 0 ms 384 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int inf = 1e9;
const ll INF = 1e18;

ll n, m;
vector<pll> v;
set<ll> s;
ll a[500010];
ll t[500010];

int main() {
	fast;

	cin >> n >> m;

	for(int i=1; i<=m; i++) {
		cin >> a[i];
	}

	for(int i=1; i<=m; i++) {
		cin >> t[i];

		v.eb(t[i] + a[i], t[i] - a[i]);
	}

	sort(all(v), [&](pll i, pll j){
		if(i.fi == j.fi) return i.se > j.se;
		return i.fi > j.fi;
	});

	for(auto i : v) {
		//if(s.lower_bound(i.se) != s.end()) s.erase(s.lower_bound(i.se));
		//s.insert(i.se);

		for(auto j : v) {
			if(i.fi < j.fi && i.se > j.se) {
				cout << 2;
				return 0;
			}
		}
	}

	//cout << s.size();

	cout << 1;
}

Subtask #1
0 / 7.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 15.0

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