#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
const LL llinf=98765431298754321;
LL gcd(LL a, LL b){return b?gcd(b, a%b):a;}
struct Q{
int buho;
LL p, q;
bool operator<(const Q &b){
if(buho!=b.buho)return buho<b.buho;
if(buho>0)return p*b.q<b.p*q;
return p*b.q>b.p*q;
}
bool operator==(const Q &b){
return buho==b.buho&&p==b.p&&q==b.q;
}
};
int n;
pair<pll, int> point[2010];
vector<pair<Q, pii> > vc;
LL arr[2010];
int now[2010];
bool comp(pii a, pii b){
if(a.F==b.F)return now[a.S]<now[b.S];
return now[a.F]<now[b.F];
}
bool cmp(pair<Q, pii> a, pair<Q, pii> b){
if(a.F==b.F)return a.S>b.S;
return !(a.F<b.F);
}
bool cmp2(pair<pll, int> a, pair<pll, int> b){
if(a.F.F==b.F.F)return a.F.S>b.F.S;
return a.F.F<b.F.F;
}
struct SEGMENT_TREE {
struct NODE {
LL lmax, rmax, tmax, sum;
} tree[8000];
int base;
void init(int n){
for(base=1; base<=n; base*=2);
}
void updaterange(int point, LL p) {
point+=base;
tree[point].lmax=tree[point].rmax=tree[point].sum=tree[point].tmax=p;
while(point/=2){
tree[point].lmax=max(tree[point*2].lmax, tree[point*2].sum+tree[point*2+1].lmax);
tree[point].rmax=max(tree[point*2+1].rmax, tree[point*2+1].sum+tree[point*2].rmax);
tree[point].sum=tree[point*2].sum+tree[point*2+1].sum;
tree[point].tmax=max(max(tree[point*2].tmax, tree[point*2+1].tmax), max(tree[point*2].rmax+tree[point*2+1].lmax, max(tree[point].lmax, tree[point].rmax)));
}
}
}seg;
int main()
{
scanf("%d", &n);
for(register int i=1; i<=n; i++){
scanf("%lld %lld %lld", &point[i].F.F, &point[i].F.S, &arr[i]);
point[i].S=i;
}
for(register int i=1; i<=n; i++){
for(register int j=1; j<i; j++){
LL tx=point[i].F.F-point[j].F.F;
LL ty=point[i].F.S-point[j].F.S;
if(tx==0)continue;
Q temp;
if(tx*ty>0)temp.buho=1;
else if(tx*ty==0)temp.buho=0;
else temp.buho=-1;
LL gcdd=gcd(llabs(tx), llabs(ty));
tx=llabs(tx)/gcdd;
ty=llabs(ty)/gcdd;
temp.p=ty;
temp.q=tx;
vc.pb(mp(temp, mp(j, i)));
}
}
sort(point+1, point+n+1, cmp2);
sort(vc.begin(), vc.end(), cmp);
for(register int i=1; i<=n; i++){
seg.updaterange(i, arr[point[i].S]);
now[point[i].S]=i;
}
LL ans=max(0ll, seg.tree[1].tmax);
register int pv=0;
while(pv<vc.size()){
vector<pii> tem;
for(; pv<vc.size(); pv++){
if(now[vc[pv].S.F]<now[vc[pv].S.S]){
tem.pb(mp(vc[pv].S.F, vc[pv].S.S));
}
else{
tem.pb(mp(vc[pv].S.S, vc[pv].S.F));
}
if(pv==vc.size()-1){
pv++;
break;
}
if(!(vc[pv].F==vc[pv+1].F)){
pv++;
break;
}
}
sort(tem.begin(), tem.end(), comp);
for(register int j=0; j<tem.size(); j++){
seg.updaterange(now[tem[j].F], arr[tem[j].S]);
seg.updaterange(now[tem[j].S], arr[tem[j].F]);
swap(now[tem[j].F], now[tem[j].S]);
}
LL temp=seg.tree[1].tmax;
ans=max(ans, temp);
}
printf("%lld", ans);
}
Compilation message
bulldozer.cpp: In function 'int main()':
bulldozer.cpp:95:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(pv<vc.size()){
~~^~~~~~~~~~
bulldozer.cpp:97:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(; pv<vc.size(); pv++){
~~^~~~~~~~~~
bulldozer.cpp:104:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(pv==vc.size()-1){
~~^~~~~~~~~~~~~
bulldozer.cpp:114:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(register int j=0; j<tem.size(); j++){
~^~~~~~~~~~~
bulldozer.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
~~~~~^~~~~~~~~~
bulldozer.cpp:67:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld %lld", &point[i].F.F, &point[i].F.S, &arr[i]);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
760 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
760 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
760 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
760 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
760 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
