oj.uz

Submission #375916

# Submission time Handle Problem Language Result Execution time Memory
375916 2021-03-10T09:09:58 Z rrrr10000 Bulldozer (JOI17_bulldozer) C++14
75 / 100
 1283 ms 66624 KB 
#include<bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,P> PP;
typedef vector<ll> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<PP> vpp;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(a) a.begin(),a.end()
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define pb emplace_back
#define fi first
#define se second
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
const ll inf=1001001001001001001;
ll gcd(ll a,ll b){
    if(b==0)return a;
    return gcd(b,a%b);
}
class segtree{
    vi seg;ll N=1;
public:
    segtree(vi v){
        while(N<v.size())N*=2;
        seg=vi(N*2-1,-inf);
        rep(i,v.size())seg[i+N-1]=v[i];
        for(ll i=N-2;i>=0;i--)seg[i]=max(seg[i*2+1],seg[i*2+2]);
    }
    void add(ll i,ll x){
        i+=N-1;
        seg[i]+=x;
        while(i>0){
            i=(i-1)/2;
            seg[i]=max(seg[i*2+1],seg[i*2+2]);
        }
    }
    ll get(ll l,ll r){
        ll res=-inf;
        l+=N-1;r+=N-1;
        while(l<r){
            if(!(l&1))chmax(res,seg[l]);
            if(!(r&1))chmax(res,seg[r-1]);
            l=l>>1;
            r=(r-1)>>1;
        }
        return res;
    }
};
bool cmp(PP&a,PP&b){
    if(a.fi!=b.fi)return a.fi.se*b.fi.fi<a.fi.fi*b.fi.se;
    return true;
}
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;cin>>n;
    vvi tmp(n,vi(3));
    rep(i,n)rep(j,3)cin>>tmp[i][j];
    sort(all(tmp));
    vp v(n);vi val(n);rep(i,n)v[i]=P(tmp[i][0],tmp[i][1]);rep(i,n)val[i]=tmp[i][2];
    vpp srt;
    rep(i,n)rep(j,i){
        ll a=v[i].fi-v[j].fi,b=v[i].se-v[j].se;
        if(a!=0){
            srt.pb(P(a,b),P(j,i));
        }
        else srt.pb(P(1,1001001001),P(j,i));
    }
    sort(all(srt),cmp);
    vi ruil=val,ruir=val;
    rep(i,n-1)ruil[i+1]+=ruil[i];
    for(int i=n-1;i>0;i--)ruir[i-1]+=ruir[i];
    segtree segl(ruil),segr(ruir);
    ll ans=0;rep(i,n)chmax(ans,val[i]);rep(i,n)rep(j,i)chmax(ans,val[i]+val[j]);
    ll l=0;
    vi num(n);
    rep(i,n)num[i]=i;
    while(l<srt.size()){
        ll r=l;
        while(r+1<srt.size()&&srt[l].fi.se*srt[r+1].fi.fi==srt[l].fi.fi*srt[r+1].fi.se)r++;
        REP(i,l,r+1){
            ll a=srt[i].se.fi,b=srt[i].se.se;
            ll A=num[a],B=num[b];
            chmax(ans,max(0ll,val[a])+max(0ll,val[b])+segr.get(0,A)-segr.get(A,A+1));
            chmax(ans,max(0ll,val[a])+max(0ll,val[b])+segl.get(B+1,n)-segl.get(B,B+1));
        }
        REP(i,l,r+1){
            ll a=srt[i].se.fi,b=srt[i].se.se;
            ll A=num[a],B=num[b];
            swap(num[a],num[b]);
            segl.add(A,val[b]-val[a]);
            segr.add(B,val[a]-val[b]);
        }
        REP(i,l,r+1){
            ll a=srt[i].se.se,b=srt[i].se.fi;
            ll A=num[a],B=num[b];
            chmax(ans,max(0ll,val[a])+max(0ll,val[b])+segr.get(0,A)-segr.get(A,A+1));
            chmax(ans,max(0ll,val[a])+max(0ll,val[b])+segl.get(B+1,n)-segl.get(B,B+1));
        }
        l=r+1;
    }
    out(ans);
}

Compilation message

bulldozer.cpp: In constructor 'segtree::segtree(vi)':
bulldozer.cpp:37:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         while(N<v.size())N*=2;
      |               ~^~~~~~~~~
bulldozer.cpp: In function 'int main()':
bulldozer.cpp:91:12: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<std::pair<long long int, long long int>, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     while(l<srt.size()){
      |           ~^~~~~~~~~~~
bulldozer.cpp:93:18: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<std::pair<long long int, long long int>, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |         while(r+1<srt.size()&&srt[l].fi.se*srt[r+1].fi.fi==srt[l].fi.fi*srt[r+1].fi.se)r++;
      |               ~~~^~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 780 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 748 KB Output is correct
2 Correct 3 ms 748 KB Output is correct
3 Correct 3 ms 748 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 3 ms 876 KB Output is correct
7 Correct 3 ms 748 KB Output is correct
8 Correct 3 ms 748 KB Output is correct
9 Correct 3 ms 748 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 3 ms 748 KB Output is correct
22 Correct 3 ms 748 KB Output is correct
23 Correct 3 ms 748 KB Output is correct
24 Correct 3 ms 748 KB Output is correct
25 Correct 3 ms 748 KB Output is correct
26 Correct 3 ms 748 KB Output is correct
27 Correct 3 ms 748 KB Output is correct
28 Correct 3 ms 748 KB Output is correct
29 Correct 3 ms 748 KB Output is correct
30 Correct 3 ms 748 KB Output is correct
31 Correct 3 ms 768 KB Output is correct
32 Correct 3 ms 768 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 748 KB Output is correct
2 Correct 3 ms 748 KB Output is correct
3 Correct 3 ms 748 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 3 ms 876 KB Output is correct
7 Correct 3 ms 748 KB Output is correct
8 Correct 3 ms 748 KB Output is correct
9 Correct 3 ms 748 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 3 ms 748 KB Output is correct
22 Correct 3 ms 748 KB Output is correct
23 Correct 3 ms 748 KB Output is correct
24 Correct 3 ms 748 KB Output is correct
25 Correct 3 ms 748 KB Output is correct
26 Correct 3 ms 748 KB Output is correct
27 Correct 3 ms 748 KB Output is correct
28 Correct 3 ms 748 KB Output is correct
29 Correct 3 ms 748 KB Output is correct
30 Correct 3 ms 748 KB Output is correct
31 Correct 3 ms 768 KB Output is correct
32 Correct 3 ms 768 KB Output is correct
33 Correct 1245 ms 66456 KB Output is correct
34 Correct 1216 ms 66328 KB Output is correct
35 Correct 1214 ms 66328 KB Output is correct
36 Correct 1211 ms 66360 KB Output is correct
37 Correct 1229 ms 66328 KB Output is correct
38 Correct 1205 ms 66328 KB Output is correct
39 Correct 1224 ms 66360 KB Output is correct
40 Correct 1229 ms 66328 KB Output is correct
41 Correct 1229 ms 66328 KB Output is correct
42 Correct 1229 ms 66328 KB Output is correct
43 Correct 1258 ms 66328 KB Output is correct
44 Correct 1196 ms 66328 KB Output is correct
45 Correct 1185 ms 66328 KB Output is correct
46 Correct 1261 ms 66328 KB Output is correct
47 Correct 1283 ms 66328 KB Output is correct
48 Correct 1198 ms 66364 KB Output is correct
49 Correct 1208 ms 66328 KB Output is correct
50 Correct 1212 ms 66328 KB Output is correct
51 Correct 1252 ms 66328 KB Output is correct
52 Correct 1224 ms 66400 KB Output is correct
53 Correct 1229 ms 66328 KB Output is correct
54 Correct 1196 ms 66624 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 748 KB Output is correct
2 Correct 3 ms 748 KB Output is correct
3 Correct 3 ms 748 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 3 ms 876 KB Output is correct
7 Correct 3 ms 748 KB Output is correct
8 Correct 3 ms 748 KB Output is correct
9 Correct 3 ms 748 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 3 ms 748 KB Output is correct
22 Correct 3 ms 748 KB Output is correct
23 Correct 3 ms 748 KB Output is correct
24 Correct 3 ms 748 KB Output is correct
25 Correct 3 ms 748 KB Output is correct
26 Correct 3 ms 748 KB Output is correct
27 Correct 3 ms 748 KB Output is correct
28 Correct 3 ms 748 KB Output is correct
29 Correct 3 ms 748 KB Output is correct
30 Correct 3 ms 748 KB Output is correct
31 Correct 3 ms 768 KB Output is correct
32 Correct 3 ms 768 KB Output is correct
33 Correct 1245 ms 66456 KB Output is correct
34 Correct 1216 ms 66328 KB Output is correct
35 Correct 1214 ms 66328 KB Output is correct
36 Correct 1211 ms 66360 KB Output is correct
37 Correct 1229 ms 66328 KB Output is correct
38 Correct 1205 ms 66328 KB Output is correct
39 Correct 1224 ms 66360 KB Output is correct
40 Correct 1229 ms 66328 KB Output is correct
41 Correct 1229 ms 66328 KB Output is correct
42 Correct 1229 ms 66328 KB Output is correct
43 Correct 1258 ms 66328 KB Output is correct
44 Correct 1196 ms 66328 KB Output is correct
45 Correct 1185 ms 66328 KB Output is correct
46 Correct 1261 ms 66328 KB Output is correct
47 Correct 1283 ms 66328 KB Output is correct
48 Correct 1198 ms 66364 KB Output is correct
49 Correct 1208 ms 66328 KB Output is correct
50 Correct 1212 ms 66328 KB Output is correct
51 Correct 1252 ms 66328 KB Output is correct
52 Correct 1224 ms 66400 KB Output is correct
53 Correct 1229 ms 66328 KB Output is correct
54 Correct 1196 ms 66624 KB Output is correct
55 Correct 1216 ms 66408 KB Output is correct
56 Correct 1208 ms 66360 KB Output is correct
57 Correct 1255 ms 66360 KB Output is correct
58 Correct 1228 ms 66360 KB Output is correct
59 Correct 1216 ms 66456 KB Output is correct
60 Correct 1207 ms 66468 KB Output is correct
61 Correct 1195 ms 66328 KB Output is correct
62 Correct 1272 ms 66376 KB Output is correct
63 Correct 1215 ms 66328 KB Output is correct
64 Correct 1227 ms 66456 KB Output is correct
65 Correct 1220 ms 66328 KB Output is correct
66 Correct 1209 ms 66328 KB Output is correct
67 Correct 1241 ms 66360 KB Output is correct
68 Correct 1232 ms 66360 KB Output is correct
69 Correct 1215 ms 66328 KB Output is correct
70 Correct 1219 ms 66360 KB Output is correct
71 Correct 1236 ms 66328 KB Output is correct
72 Correct 1254 ms 66504 KB Output is correct
73 Correct 1242 ms 66328 KB Output is correct
74 Correct 1225 ms 66328 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 780 KB Output isn't correct
2 Halted 0 ms 0 KB -