oj.uz

Submission #337439

# Submission time Handle Problem Language Result Execution time Memory
337439 2020-12-20T19:02:03 Z YJU Bulldozer (JOI17_bulldozer) C++14
75 / 100
 1921 ms 99460 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e3+5;
const ld pi=acos(-1);
const ll INF=(1LL<<30);
const ld zero=1e-18;
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll n,x[N],y[N],c[N],pos[N],ans,ma[4*N],lma[4*N],rma[4*N],sum[4*N];
vector<ll> lis;
vector<pair<ld,pll> > event;

void mod(ll nda,ll ndb){
	ld cel=asin((y[nda]-y[ndb])/sqrt(SQ(y[nda]-y[ndb])+SQ(x[nda]-x[ndb])));
	cel=(cel+pi/2>2*pi?cel+pi/2-2*pi:cel+pi/2);
	//cout<<nda<<" "<<ndb<<" "<<cel/pi<<"\n";
	event.pb(mp(cel,mp(nda,ndb)));
	cel=(cel+pi>2*pi?cel-pi:cel+pi);
	event.pb(mp(cel,mp(nda,ndb)));
}

void upd(ll id,ll l,ll r,ll to){
	if(l==r-1){ma[id]=lma[id]=rma[id]=max(0LL,c[lis[l]]);sum[id]=c[lis[l]];return ;}
	ll mid=(l+r)>>1;
	if(to<mid)upd(id*2,l,mid,to);
	else upd(id*2+1,mid,r,to);
	sum[id]=sum[id*2]+sum[id*2+1];
	lma[id]=max(lma[id*2],lma[id*2+1]+sum[id*2]);
	rma[id]=max(rma[id*2]+sum[id*2+1],rma[id*2+1]);
	ma[id]=max(max(ma[id*2],ma[id*2+1]),lma[id*2+1]+rma[id*2]);
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n;
	REP(i,n){
		cin>>x[i]>>y[i]>>c[i];
		lis.pb(i);
	}
	sort(lis.begin(),lis.end(),[](ll A,ll B){
		if(x[A]!=x[B])return (x[A]<x[B]);
		return (y[A]>y[B]);
	});
	REP(i,n)pos[lis[i]]=i;
	REP(i,n)upd(1,0,n,i);
	ans=ma[1];
	
	REP(i,n){
		for(int j=i+1;j<n;j++){
			mod(lis[i],lis[j]);
		}
	}
	
	sort(event.begin(),event.end());
	
	//for(auto i:event)cout<<i.Y.X<<" "<<i.Y.Y<<"\n";
	
	REP(i,SZ(event)){
		if(i&&abs(event[i].X-event[i-1].X)>zero)ans=max(ans,ma[1]);
		//cout<<fixed<<setprecision(12)<<event[i].X<<" "<<event[i].Y.X<<" "<<event[i].Y.Y<<"\n";
		//REP(j,n)cout<<lis[j]<<(j==n-1?"\n":" ");
		//cout<<ma[1]<<"\n";
		ll nx=event[i].Y.X,ny=event[i].Y.Y;
		swap(lis[pos[nx]],lis[pos[ny]]);
		upd(1,0,n,pos[nx]);
		upd(1,0,n,pos[ny]);
		swap(pos[nx],pos[ny]);
	}
	cout<<ans<<"\n";
	return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 940 KB Output is correct
2 Correct 3 ms 940 KB Output is correct
3 Correct 3 ms 940 KB Output is correct
4 Correct 3 ms 940 KB Output is correct
5 Incorrect 3 ms 940 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1088 KB Output is correct
2 Correct 4 ms 940 KB Output is correct
3 Correct 4 ms 940 KB Output is correct
4 Correct 4 ms 940 KB Output is correct
5 Correct 4 ms 940 KB Output is correct
6 Correct 4 ms 940 KB Output is correct
7 Correct 4 ms 940 KB Output is correct
8 Correct 4 ms 940 KB Output is correct
9 Correct 4 ms 940 KB Output is correct
10 Correct 4 ms 940 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 0 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 4 ms 940 KB Output is correct
22 Correct 3 ms 940 KB Output is correct
23 Correct 4 ms 940 KB Output is correct
24 Correct 4 ms 940 KB Output is correct
25 Correct 4 ms 940 KB Output is correct
26 Correct 4 ms 940 KB Output is correct
27 Correct 4 ms 940 KB Output is correct
28 Correct 4 ms 940 KB Output is correct
29 Correct 3 ms 940 KB Output is correct
30 Correct 4 ms 940 KB Output is correct
31 Correct 3 ms 940 KB Output is correct
32 Correct 4 ms 940 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1088 KB Output is correct
2 Correct 4 ms 940 KB Output is correct
3 Correct 4 ms 940 KB Output is correct
4 Correct 4 ms 940 KB Output is correct
5 Correct 4 ms 940 KB Output is correct
6 Correct 4 ms 940 KB Output is correct
7 Correct 4 ms 940 KB Output is correct
8 Correct 4 ms 940 KB Output is correct
9 Correct 4 ms 940 KB Output is correct
10 Correct 4 ms 940 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 0 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 4 ms 940 KB Output is correct
22 Correct 3 ms 940 KB Output is correct
23 Correct 4 ms 940 KB Output is correct
24 Correct 4 ms 940 KB Output is correct
25 Correct 4 ms 940 KB Output is correct
26 Correct 4 ms 940 KB Output is correct
27 Correct 4 ms 940 KB Output is correct
28 Correct 4 ms 940 KB Output is correct
29 Correct 3 ms 940 KB Output is correct
30 Correct 4 ms 940 KB Output is correct
31 Correct 3 ms 940 KB Output is correct
32 Correct 4 ms 940 KB Output is correct
33 Correct 1882 ms 99196 KB Output is correct
34 Correct 1921 ms 99324 KB Output is correct
35 Correct 1890 ms 99260 KB Output is correct
36 Correct 1895 ms 99324 KB Output is correct
37 Correct 1872 ms 99324 KB Output is correct
38 Correct 1882 ms 99260 KB Output is correct
39 Correct 1886 ms 99324 KB Output is correct
40 Correct 1893 ms 99324 KB Output is correct
41 Correct 1899 ms 99228 KB Output is correct
42 Correct 1884 ms 99324 KB Output is correct
43 Correct 1860 ms 99324 KB Output is correct
44 Correct 1879 ms 99324 KB Output is correct
45 Correct 1860 ms 99324 KB Output is correct
46 Correct 1867 ms 99224 KB Output is correct
47 Correct 1858 ms 99324 KB Output is correct
48 Correct 1849 ms 99276 KB Output is correct
49 Correct 1877 ms 99320 KB Output is correct
50 Correct 1855 ms 99324 KB Output is correct
51 Correct 1861 ms 99324 KB Output is correct
52 Correct 1857 ms 99324 KB Output is correct
53 Correct 1874 ms 99324 KB Output is correct
54 Correct 1873 ms 99228 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1088 KB Output is correct
2 Correct 4 ms 940 KB Output is correct
3 Correct 4 ms 940 KB Output is correct
4 Correct 4 ms 940 KB Output is correct
5 Correct 4 ms 940 KB Output is correct
6 Correct 4 ms 940 KB Output is correct
7 Correct 4 ms 940 KB Output is correct
8 Correct 4 ms 940 KB Output is correct
9 Correct 4 ms 940 KB Output is correct
10 Correct 4 ms 940 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 0 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 4 ms 940 KB Output is correct
22 Correct 3 ms 940 KB Output is correct
23 Correct 4 ms 940 KB Output is correct
24 Correct 4 ms 940 KB Output is correct
25 Correct 4 ms 940 KB Output is correct
26 Correct 4 ms 940 KB Output is correct
27 Correct 4 ms 940 KB Output is correct
28 Correct 4 ms 940 KB Output is correct
29 Correct 3 ms 940 KB Output is correct
30 Correct 4 ms 940 KB Output is correct
31 Correct 3 ms 940 KB Output is correct
32 Correct 4 ms 940 KB Output is correct
33 Correct 1882 ms 99196 KB Output is correct
34 Correct 1921 ms 99324 KB Output is correct
35 Correct 1890 ms 99260 KB Output is correct
36 Correct 1895 ms 99324 KB Output is correct
37 Correct 1872 ms 99324 KB Output is correct
38 Correct 1882 ms 99260 KB Output is correct
39 Correct 1886 ms 99324 KB Output is correct
40 Correct 1893 ms 99324 KB Output is correct
41 Correct 1899 ms 99228 KB Output is correct
42 Correct 1884 ms 99324 KB Output is correct
43 Correct 1860 ms 99324 KB Output is correct
44 Correct 1879 ms 99324 KB Output is correct
45 Correct 1860 ms 99324 KB Output is correct
46 Correct 1867 ms 99224 KB Output is correct
47 Correct 1858 ms 99324 KB Output is correct
48 Correct 1849 ms 99276 KB Output is correct
49 Correct 1877 ms 99320 KB Output is correct
50 Correct 1855 ms 99324 KB Output is correct
51 Correct 1861 ms 99324 KB Output is correct
52 Correct 1857 ms 99324 KB Output is correct
53 Correct 1874 ms 99324 KB Output is correct
54 Correct 1873 ms 99228 KB Output is correct
55 Correct 1886 ms 99324 KB Output is correct
56 Correct 1873 ms 99324 KB Output is correct
57 Correct 1883 ms 99324 KB Output is correct
58 Correct 1886 ms 99452 KB Output is correct
59 Correct 1872 ms 99460 KB Output is correct
60 Correct 1881 ms 99324 KB Output is correct
61 Correct 1883 ms 99324 KB Output is correct
62 Correct 1869 ms 99324 KB Output is correct
63 Correct 1898 ms 99324 KB Output is correct
64 Correct 1881 ms 99324 KB Output is correct
65 Correct 1899 ms 99324 KB Output is correct
66 Correct 1893 ms 99324 KB Output is correct
67 Correct 1883 ms 99324 KB Output is correct
68 Correct 1877 ms 99324 KB Output is correct
69 Correct 1894 ms 99324 KB Output is correct
70 Correct 1888 ms 99324 KB Output is correct
71 Correct 1889 ms 99324 KB Output is correct
72 Correct 1888 ms 99324 KB Output is correct
73 Correct 1886 ms 99324 KB Output is correct
74 Correct 1883 ms 99356 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 940 KB Output is correct
2 Correct 3 ms 940 KB Output is correct
3 Correct 3 ms 940 KB Output is correct
4 Correct 3 ms 940 KB Output is correct
5 Incorrect 3 ms 940 KB Output isn't correct
6 Halted 0 ms 0 KB -