# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
780123 | vjudge1 | Go (COCI18_go) | C++17 | 1 ms | 468 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;
#define int long long
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);
#define OYY 1000000005
#define mod 998244353
vector <pair<int,pair<int,int>>> v,v1;
int32_t main(){
faster
int n,k,m;cin>>n>>k>>m;
int sol=0,sag=0;
for(int i=0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;
if(c>abs(k-a)){
if(k-a>=0){
v.push_back({a,{b,c}});
sol+=b;
}
else {
v1.push_back({a,{b,c}});
sag+=b;
}
}
}
sort(v.begin(),v.end());
sort(v.begin(),v.end());
//for(int i=0;i<v.size();i++)cout<<v[i].first<<" "<<v[i].second.first<< " "<<v[i].second.second<<endl;
int t=abs((v[0].first)-k)*2;
//cout<<t<<endl;
for(int i=0;i<v1.size();i++){
int a=v1[i].first;
a=abs(k-a);
int b=v1[i].second.first;
int c=v1[i].second.second;
if(t+a>=c)continue;
sol+=b;
}
int gec=v1.size();
t=abs((v1[gec-1].first)-k)*2;
//cout<<t<<endl;
for(int i=0;i<v.size();i++){
int a=v[i].first;
a=abs(k-a);
int b=v[i].second.first;
int c=v[i].second.second;
if(t+a>=c)continue;
sag+=b;
}
//cout<<sol<<" "<<sag<<endl;
cout<<max(sol,sag)<<'\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |