# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519663 | ac2hu | Arcade (NOI20_arcade) | C++14 | 0 ms | 204 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 <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
struct mov{
int t,loc;
} a[N];
int n,m;
signed main(){
iostream::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
cin >> n >> m;
for(int i = 0;i<m;i++){
cin >> a[i].t;
}
for(int i =0 ;i<m;i++){
cin >> a[i].loc;
}
sort(a,a + m,[&](mov a,mov b){
return a.t < b.t||(a.t == b.t && a.loc < b.loc);
});
vector<int> arms;
for(int i = 0;i<m;i++){
pair<int,int> idx = {1e9,-1};
for(int j = 0;j<(int)arms.size();j++){
int e = arms[j];
if(abs(a[e].loc - a[i].loc) <= abs(a[e].t - a[i].t)){
int v = abs(a[e].t - a[i].t) - abs(a[e].loc - a[i].loc);
idx = {v,e};
}
}
# | 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... |