# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
834335 | unnick | Arcade (NOI20_arcade) | C++14 | 1056 ms | 18148 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
int n,m;
cin >> n >> m;
std::vector<int> times;
std::vector<int> positions;
for (int i = 0; i < m; i++) {
int tmp;
cin >> tmp;
times.push_back(tmp);
}
for (int i = 0; i < m; i++) {
int tmp;
cin >> tmp;
positions.push_back(tmp);
}
std::vector<int> idxes;
for (int i = 0; i < m; i++) {
idxes.push_back(i);
}
std::sort(idxes.begin(), idxes.end(), [times, positions](int ia, int ib){
int sa = times[ia] + positions[ia];
int sb = times[ib] + positions[ib];
return sa == sb ? times[ia] < times[ib] : sa < sb;
});
std::vector<int> asdf;
for (int i = 0; i < m; i++) {
asdf.push_back(positions[i]-times[i]);
}
std::vector<int> frontier;
int num_arms = 0;
for (int idx : idxes) {
int sel = num_arms;
for (int st = 1<<20; st >>= 1; st > 0) {
int idx2 = sel-st;
if (idx2 < 0) continue;
if (asdf[idx] > frontier[idx2]) continue;
sel -= st;
}
// for (int i = 0; i < num_arms; i++) {
// int idx2 = frontier[i];
// // check if we can reach the button
// if (positions[idx]-times[idx] > positions[idx2]-times[idx2]) continue;
// // use the "least useful" hand
// if (selected_score < positions[idx2]-times[idx2]) continue;
// // cout << idx2 << " is better\n";
// selected_score = positions[idx2]-times[idx2];
// selected_idx = i;
// }
if (sel == num_arms) {
// cout << "pushed" << "\n";
frontier.push_back(asdf[idx]);
num_arms++;
} else {
// cout << "replaced " << sel << "\n";
frontier[sel] = asdf[idx];
}
// cout << "frontier: ";
// for (int i : frontier) {
// cout << i << " ";
// }
// cout << "\n";
}
cout << num_arms << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |