oj.uz

Submission #948720

# Submission time Handle Problem Language Result Execution time Memory
948720 2024-03-18T12:32:54 Z shenfe1 Bulldozer (JOI17_bulldozer) C++17
60 / 100
 2000 ms 68556 KB 
#include <bits/stdc++.h>

#pragma optimize("Ofast")
#pragma target("avx2")

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
// #define int ll

const int MAX=2000+15;
const int B=500;
const int maxB=1000;
const int N=104;
const int block=450;
const ll inf=1e9;  
const int mod=1e9+7;
const int mod1=1e9+9;
const ld eps=1e-9;

int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};

int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1)%mod;
  int k=binpow(a,n/2);
  return k*k%mod;
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n;
int x[MAX],y[MAX],a[MAX];
vector<pair<ld,pii>> slope;
vector<pair<pii,int>> vec;
int pos[MAX],rev[MAX];
int f[MAX];
int p[MAX],mn[MAX],mx[MAX];

struct segtree{
  struct node{
    ll pref,suf,sum,ans;
    node(){
      pref=suf=sum=ans=0;
    }
  }t[4*MAX];

  node mrg(node a,node b){
    node res;
    res.sum=a.sum+b.sum;
    res.ans=max({a.ans,b.ans,a.suf+b.pref});
    res.suf=max(b.suf,b.sum+a.suf);
    res.pref=max(a.pref,a.sum+b.pref);
    return res;
  } 

  void update(int v,int tl,int tr,int pos,ll x){
    if(tl==tr){
      t[v].pref=max(0ll,x);
      t[v].suf=max(0ll,x);
      t[v].ans=max(0ll,x);
      t[v].sum=x;
      return;
    }
    int tm=(tl+tr)/2;
    if(pos<=tm)update(2*v,tl,tm,pos,x);
    else update(2*v+1,tm+1,tr,pos,x);
    t[v]=mrg(t[2*v],t[2*v+1]);
  }
}t;

vector<int> vv[MAX];
vector<int> can;

void solve(){
  cin>>n;
  for(int i=1;i<=n;i++){
    cin>>x[i]>>y[i]>>a[i];
    vec.pb({{x[i],-y[i]},i});
  }
  sort(all(vec));
  for(int i=1;i<=n;i++){
    for(int j=i+1;j<=n;j++){
      if(x[vec[i-1].S]!=x[vec[j-1].S]){
        ld k=(0.0+y[vec[i-1].S]-y[vec[j-1].S])/(x[vec[i-1].S]-x[vec[j-1].S]);
        slope.pb({k,{vec[i-1].S,vec[j-1].S}});
        // cout<<i<<" "<<j<<" "<<k<<"\n";
      }
    }
  }
  for(int i=0;i<n;i++){
    f[i+1]=a[vec[i].S];
    t.update(1,1,n,i+1,f[i+1]);
    pos[vec[i].S]=i+1;
    rev[i+1]=vec[i].S;
  }
  sort(all(slope));
  // reverse(all(slope));
  ll ans=t.t[1].ans;
  for(int k=0;k<sz(slope);k++){
    int i=slope[k].S.F,j=slope[k].S.S;
    i=pos[i];
    j=pos[j];
    if(i>j)swap(i,j);
    // cout<<"!! "<<slope[k].F<<" "<<i<<" "<<j<<"\n";
    vv[i].pb(j);
    can.pb(i);
    if(k==sz(slope)-1||slope[k].F!=slope[k+1].F){
      int r=-1;
      int lef=0;
      sort(all(can));
      for(int l:can){
        if(l<=r){
          while(!vv[l].empty()){
            // cout<<l<<" "<<vv[l].back()<<"\n";
            r=max(r,vv[l].back());
            vv[l].ppb();
          }
        }
        else{
          if(lef<=r){
            reverse(f+lef,f+r+1);
            reverse(rev+lef,rev+r+1);
            // cout<<lef<<" "<<r<<"\n";
            for(int d=lef;d<=r;d++){
              pos[rev[d]]=d;
              t.update(1,1,n,d,f[d]);
            }
          }
          lef=l;
          r=-1;
          while(!vv[l].empty()){
            r=max(r,vv[l].back());
            vv[l].ppb();
          }
        }
      }
      if(lef<=r){
        reverse(f+lef,f+r+1);
        reverse(rev+lef,rev+r+1);
        // cout<<lef<<" "<<r<<"\n";
        for(int d=lef;d<=r;d++){
          pos[rev[d]]=d;
          t.update(1,1,n,d,f[d]);
        }
      }
      can.clear();
      ans=max(ans,t.t[1].ans);
      // for(int i=1;i<=n;i++)cout<<f[i]<<" ";
      // cout<<"\n";
    }
    // cout<<t.t[1].ans<<"\n";
    // for(int i=1;i<=n;i++){
    //   cout<<f[i]<<" ";
    // }
    // cout<<"\n";
  }
  cout<<ans<<"\n";
}

signed main(){
  // freopen("triangles.in","r",stdin);
  // freopen("triangles.out","w",stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // prec();
  int t=1;
  // cin>>t;
  while(t--){
    solve();
  }
}

Compilation message

bulldozer.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("Ofast")
      | 
bulldozer.cpp:4: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    4 | #pragma target("avx2")
      |

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 2 ms 1116 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 2 ms 1268 KB Output is correct
4 Correct 2 ms 1116 KB Output is correct
5 Correct 2 ms 1116 KB Output is correct
6 Correct 2 ms 1116 KB Output is correct
7 Correct 2 ms 1116 KB Output is correct
8 Correct 2 ms 1116 KB Output is correct
9 Correct 2 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 2 ms 1368 KB Output is correct
22 Correct 2 ms 1112 KB Output is correct
23 Correct 2 ms 1116 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 2 ms 1112 KB Output is correct
27 Correct 2 ms 1112 KB Output is correct
28 Correct 3 ms 1116 KB Output is correct
29 Correct 2 ms 1116 KB Output is correct
30 Correct 3 ms 1116 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 2 ms 1116 KB Output is correct
33 Correct 877 ms 67204 KB Output is correct
34 Correct 827 ms 67764 KB Output is correct
35 Correct 887 ms 68556 KB Output is correct
36 Correct 832 ms 67488 KB Output is correct
37 Correct 847 ms 67268 KB Output is correct
38 Correct 832 ms 67280 KB Output is correct
39 Correct 866 ms 66768 KB Output is correct
40 Correct 850 ms 67772 KB Output is correct
41 Correct 839 ms 68220 KB Output is correct
42 Correct 833 ms 67264 KB Output is correct
43 Correct 826 ms 68032 KB Output is correct
44 Correct 822 ms 67252 KB Output is correct
45 Correct 825 ms 68292 KB Output is correct
46 Correct 837 ms 67776 KB Output is correct
47 Correct 816 ms 67404 KB Output is correct
48 Correct 829 ms 67028 KB Output is correct
49 Correct 836 ms 67560 KB Output is correct
50 Correct 837 ms 67532 KB Output is correct
51 Correct 828 ms 68412 KB Output is correct
52 Correct 827 ms 68028 KB Output is correct
53 Correct 821 ms 67024 KB Output is correct
54 Correct 830 ms 67008 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 2 ms 1268 KB Output is correct
4 Correct 2 ms 1116 KB Output is correct
5 Correct 2 ms 1116 KB Output is correct
6 Correct 2 ms 1116 KB Output is correct
7 Correct 2 ms 1116 KB Output is correct
8 Correct 2 ms 1116 KB Output is correct
9 Correct 2 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 2 ms 1368 KB Output is correct
22 Correct 2 ms 1112 KB Output is correct
23 Correct 2 ms 1116 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 2 ms 1112 KB Output is correct
27 Correct 2 ms 1112 KB Output is correct
28 Correct 3 ms 1116 KB Output is correct
29 Correct 2 ms 1116 KB Output is correct
30 Correct 3 ms 1116 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 2 ms 1116 KB Output is correct
33 Correct 877 ms 67204 KB Output is correct
34 Correct 827 ms 67764 KB Output is correct
35 Correct 887 ms 68556 KB Output is correct
36 Correct 832 ms 67488 KB Output is correct
37 Correct 847 ms 67268 KB Output is correct
38 Correct 832 ms 67280 KB Output is correct
39 Correct 866 ms 66768 KB Output is correct
40 Correct 850 ms 67772 KB Output is correct
41 Correct 839 ms 68220 KB Output is correct
42 Correct 833 ms 67264 KB Output is correct
43 Correct 826 ms 68032 KB Output is correct
44 Correct 822 ms 67252 KB Output is correct
45 Correct 825 ms 68292 KB Output is correct
46 Correct 837 ms 67776 KB Output is correct
47 Correct 816 ms 67404 KB Output is correct
48 Correct 829 ms 67028 KB Output is correct
49 Correct 836 ms 67560 KB Output is correct
50 Correct 837 ms 67532 KB Output is correct
51 Correct 828 ms 68412 KB Output is correct
52 Correct 827 ms 68028 KB Output is correct
53 Correct 821 ms 67024 KB Output is correct
54 Correct 830 ms 67008 KB Output is correct
55 Correct 828 ms 67524 KB Output is correct
56 Correct 850 ms 66752 KB Output is correct
57 Correct 832 ms 67256 KB Output is correct
58 Correct 824 ms 67016 KB Output is correct
59 Correct 853 ms 67724 KB Output is correct
60 Correct 833 ms 66752 KB Output is correct
61 Correct 859 ms 68548 KB Output is correct
62 Correct 855 ms 67148 KB Output is correct
63 Correct 842 ms 68548 KB Output is correct
64 Correct 850 ms 68032 KB Output is correct
65 Execution timed out 2050 ms 67276 KB Time limit exceeded
66 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 2 ms 1116 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 2 ms 1116 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 2 ms 1268 KB Output is correct
19 Correct 2 ms 1116 KB Output is correct
20 Correct 2 ms 1116 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 2 ms 1116 KB Output is correct
23 Correct 2 ms 1116 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 0 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 2 ms 1368 KB Output is correct
37 Correct 2 ms 1112 KB Output is correct
38 Correct 2 ms 1116 KB Output is correct
39 Correct 2 ms 1116 KB Output is correct
40 Correct 2 ms 1116 KB Output is correct
41 Correct 2 ms 1112 KB Output is correct
42 Correct 2 ms 1112 KB Output is correct
43 Correct 3 ms 1116 KB Output is correct
44 Correct 2 ms 1116 KB Output is correct
45 Correct 3 ms 1116 KB Output is correct
46 Correct 2 ms 1116 KB Output is correct
47 Correct 2 ms 1116 KB Output is correct
48 Correct 877 ms 67204 KB Output is correct
49 Correct 827 ms 67764 KB Output is correct
50 Correct 887 ms 68556 KB Output is correct
51 Correct 832 ms 67488 KB Output is correct
52 Correct 847 ms 67268 KB Output is correct
53 Correct 832 ms 67280 KB Output is correct
54 Correct 866 ms 66768 KB Output is correct
55 Correct 850 ms 67772 KB Output is correct
56 Correct 839 ms 68220 KB Output is correct
57 Correct 833 ms 67264 KB Output is correct
58 Correct 826 ms 68032 KB Output is correct
59 Correct 822 ms 67252 KB Output is correct
60 Correct 825 ms 68292 KB Output is correct
61 Correct 837 ms 67776 KB Output is correct
62 Correct 816 ms 67404 KB Output is correct
63 Correct 829 ms 67028 KB Output is correct
64 Correct 836 ms 67560 KB Output is correct
65 Correct 837 ms 67532 KB Output is correct
66 Correct 828 ms 68412 KB Output is correct
67 Correct 827 ms 68028 KB Output is correct
68 Correct 821 ms 67024 KB Output is correct
69 Correct 830 ms 67008 KB Output is correct
70 Correct 828 ms 67524 KB Output is correct
71 Correct 850 ms 66752 KB Output is correct
72 Correct 832 ms 67256 KB Output is correct
73 Correct 824 ms 67016 KB Output is correct
74 Correct 853 ms 67724 KB Output is correct
75 Correct 833 ms 66752 KB Output is correct
76 Correct 859 ms 68548 KB Output is correct
77 Correct 855 ms 67148 KB Output is correct
78 Correct 842 ms 68548 KB Output is correct
79 Correct 850 ms 68032 KB Output is correct
80 Execution timed out 2050 ms 67276 KB Time limit exceeded
81 Halted 0 ms 0 KB -