# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
727582 | josanneo22 | Radio (Balkan15_RADIO) | C++17 | 0 ms | 212 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;
void solve(){
int n,k; cin>>n>>k;
vector<int> x(n),p(n),s(n);
for(int i=0;i<n;i++){
cin>>x[i]>>p[i]>>s[i];
}
int ans=0;
for(int i=0;i<n;i++){
int mx=0;
for(int j=i+1;j<n;j++){
mx=max(mx,max(0,abs(x[i]-x[j])-p[i]-p[j]));
}
ans+=mx;
}
cout<<ans<<'\n';
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
solve();
}
# | 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... |