oj.uz

Submission #948724

# Submission time Handle Problem Language Result Execution time Memory
948724 2024-03-18T12:38:41 Z shenfe1 Bulldozer (JOI17_bulldozer) C++17
80 / 100
 2000 ms 41752 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<double,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]){
        double 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}});
      }
      else{
        slope.pb({-inf,{vec[i-1].S,vec[j-1].S}});
      }
    }
  }
  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 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 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 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 2 ms 856 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 1112 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 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 860 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 1020 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 2 ms 1012 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 856 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 856 KB Output is correct
32 Correct 2 ms 1112 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 2 ms 856 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 1112 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 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 860 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 1020 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 2 ms 1012 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 856 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 856 KB Output is correct
32 Correct 2 ms 1112 KB Output is correct
33 Correct 713 ms 34260 KB Output is correct
34 Correct 702 ms 33748 KB Output is correct
35 Correct 700 ms 33748 KB Output is correct
36 Correct 702 ms 34004 KB Output is correct
37 Correct 714 ms 35028 KB Output is correct
38 Correct 701 ms 34000 KB Output is correct
39 Correct 700 ms 33804 KB Output is correct
40 Correct 699 ms 35284 KB Output is correct
41 Correct 705 ms 34256 KB Output is correct
42 Correct 760 ms 35008 KB Output is correct
43 Correct 737 ms 35540 KB Output is correct
44 Correct 730 ms 34768 KB Output is correct
45 Correct 701 ms 34260 KB Output is correct
46 Correct 731 ms 35024 KB Output is correct
47 Correct 698 ms 35024 KB Output is correct
48 Correct 691 ms 35280 KB Output is correct
49 Correct 705 ms 34004 KB Output is correct
50 Correct 700 ms 35540 KB Output is correct
51 Correct 696 ms 34000 KB Output is correct
52 Correct 716 ms 35024 KB Output is correct
53 Correct 706 ms 34332 KB Output is correct
54 Correct 693 ms 35796 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 2 ms 856 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 1112 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 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 860 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 1020 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 2 ms 1012 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 856 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 856 KB Output is correct
32 Correct 2 ms 1112 KB Output is correct
33 Correct 713 ms 34260 KB Output is correct
34 Correct 702 ms 33748 KB Output is correct
35 Correct 700 ms 33748 KB Output is correct
36 Correct 702 ms 34004 KB Output is correct
37 Correct 714 ms 35028 KB Output is correct
38 Correct 701 ms 34000 KB Output is correct
39 Correct 700 ms 33804 KB Output is correct
40 Correct 699 ms 35284 KB Output is correct
41 Correct 705 ms 34256 KB Output is correct
42 Correct 760 ms 35008 KB Output is correct
43 Correct 737 ms 35540 KB Output is correct
44 Correct 730 ms 34768 KB Output is correct
45 Correct 701 ms 34260 KB Output is correct
46 Correct 731 ms 35024 KB Output is correct
47 Correct 698 ms 35024 KB Output is correct
48 Correct 691 ms 35280 KB Output is correct
49 Correct 705 ms 34004 KB Output is correct
50 Correct 700 ms 35540 KB Output is correct
51 Correct 696 ms 34000 KB Output is correct
52 Correct 716 ms 35024 KB Output is correct
53 Correct 706 ms 34332 KB Output is correct
54 Correct 693 ms 35796 KB Output is correct
55 Correct 708 ms 34264 KB Output is correct
56 Correct 709 ms 35796 KB Output is correct
57 Correct 711 ms 34516 KB Output is correct
58 Correct 713 ms 34256 KB Output is correct
59 Correct 711 ms 34280 KB Output is correct
60 Correct 717 ms 34516 KB Output is correct
61 Correct 698 ms 33744 KB Output is correct
62 Correct 703 ms 35284 KB Output is correct
63 Correct 704 ms 35632 KB Output is correct
64 Correct 695 ms 34004 KB Output is correct
65 Correct 703 ms 35796 KB Output is correct
66 Correct 706 ms 33992 KB Output is correct
67 Correct 706 ms 34760 KB Output is correct
68 Correct 699 ms 35024 KB Output is correct
69 Correct 708 ms 35280 KB Output is correct
70 Correct 732 ms 35052 KB Output is correct
71 Correct 722 ms 34772 KB Output is correct
72 Correct 714 ms 35540 KB Output is correct
73 Correct 719 ms 34512 KB Output is correct
74 Correct 766 ms 34772 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 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 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 2 ms 860 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 856 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 2 ms 1112 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 0 ms 604 KB Output is correct
31 Correct 0 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 860 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 2 ms 1020 KB Output is correct
39 Correct 2 ms 860 KB Output is correct
40 Correct 2 ms 1012 KB Output is correct
41 Correct 2 ms 860 KB Output is correct
42 Correct 2 ms 856 KB Output is correct
43 Correct 2 ms 860 KB Output is correct
44 Correct 2 ms 860 KB Output is correct
45 Correct 2 ms 860 KB Output is correct
46 Correct 2 ms 856 KB Output is correct
47 Correct 2 ms 1112 KB Output is correct
48 Correct 713 ms 34260 KB Output is correct
49 Correct 702 ms 33748 KB Output is correct
50 Correct 700 ms 33748 KB Output is correct
51 Correct 702 ms 34004 KB Output is correct
52 Correct 714 ms 35028 KB Output is correct
53 Correct 701 ms 34000 KB Output is correct
54 Correct 700 ms 33804 KB Output is correct
55 Correct 699 ms 35284 KB Output is correct
56 Correct 705 ms 34256 KB Output is correct
57 Correct 760 ms 35008 KB Output is correct
58 Correct 737 ms 35540 KB Output is correct
59 Correct 730 ms 34768 KB Output is correct
60 Correct 701 ms 34260 KB Output is correct
61 Correct 731 ms 35024 KB Output is correct
62 Correct 698 ms 35024 KB Output is correct
63 Correct 691 ms 35280 KB Output is correct
64 Correct 705 ms 34004 KB Output is correct
65 Correct 700 ms 35540 KB Output is correct
66 Correct 696 ms 34000 KB Output is correct
67 Correct 716 ms 35024 KB Output is correct
68 Correct 706 ms 34332 KB Output is correct
69 Correct 693 ms 35796 KB Output is correct
70 Correct 708 ms 34264 KB Output is correct
71 Correct 709 ms 35796 KB Output is correct
72 Correct 711 ms 34516 KB Output is correct
73 Correct 713 ms 34256 KB Output is correct
74 Correct 711 ms 34280 KB Output is correct
75 Correct 717 ms 34516 KB Output is correct
76 Correct 698 ms 33744 KB Output is correct
77 Correct 703 ms 35284 KB Output is correct
78 Correct 704 ms 35632 KB Output is correct
79 Correct 695 ms 34004 KB Output is correct
80 Correct 703 ms 35796 KB Output is correct
81 Correct 706 ms 33992 KB Output is correct
82 Correct 706 ms 34760 KB Output is correct
83 Correct 699 ms 35024 KB Output is correct
84 Correct 708 ms 35280 KB Output is correct
85 Correct 732 ms 35052 KB Output is correct
86 Correct 722 ms 34772 KB Output is correct
87 Correct 714 ms 35540 KB Output is correct
88 Correct 719 ms 34512 KB Output is correct
89 Correct 766 ms 34772 KB Output is correct
90 Correct 701 ms 34512 KB Output is correct
91 Correct 698 ms 35540 KB Output is correct
92 Correct 717 ms 34504 KB Output is correct
93 Correct 701 ms 35284 KB Output is correct
94 Correct 709 ms 35324 KB Output is correct
95 Correct 701 ms 34000 KB Output is correct
96 Correct 730 ms 34444 KB Output is correct
97 Correct 701 ms 34512 KB Output is correct
98 Correct 717 ms 35028 KB Output is correct
99 Correct 699 ms 35024 KB Output is correct
100 Execution timed out 2045 ms 41752 KB Time limit exceeded
101 Halted 0 ms 0 KB -