oj.uz

Submission #337444

# Submission time Handle Problem Language Result Execution time Memory
337444 2020-12-20T19:51:23 Z YJU Bulldozer (JOI17_bulldozer) C++14
60 / 100
 2000 ms 66596 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,ofast")
using namespace std;
typedef long long ll;
typedef __float128 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-24;
#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);
	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());
	
	REP(i,SZ(event)){
		if(i&&(event[i].X-event[i-1].X)/pi>zero)ans=max(ans,ma[1]);
		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;
}

Compilation message

bulldozer.cpp:2:61: warning: bad option '-fofast' to pragma 'optimize' [-Wpragmas]
    2 | #pragma GCC optimize("unroll-loops,no-stack-protector,ofast")
      |                                                             ^
bulldozer.cpp:28:23: warning: bad option '-fofast' to attribute 'optimize' [-Wattributes]
   28 | void mod(ll nda,ll ndb){
      |                       ^
bulldozer.cpp:34:31: warning: bad option '-fofast' to attribute 'optimize' [-Wattributes]
   34 | void upd(ll id,ll l,ll r,ll to){
      |                               ^
bulldozer.cpp:45:10: warning: bad option '-fofast' to attribute 'optimize' [-Wattributes]
   45 | int main(){
      |          ^
bulldozer.cpp: In function 'int main()':
bulldozer.cpp:52:41: warning: bad option '-fofast' to attribute 'optimize' [-Wattributes]
   52 |  sort(lis.begin(),lis.end(),[](ll A,ll B){
      |                                         ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 748 KB Output is correct
2 Correct 4 ms 748 KB Output is correct
3 Correct 4 ms 748 KB Output is correct
4 Correct 4 ms 768 KB Output is correct
5 Correct 4 ms 748 KB Output is correct
6 Correct 4 ms 748 KB Output is correct
7 Correct 4 ms 748 KB Output is correct
8 Correct 4 ms 748 KB Output is correct
9 Correct 4 ms 748 KB Output is correct
10 Correct 4 ms 768 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 492 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 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 768 KB Output is correct
2 Correct 4 ms 748 KB Output is correct
3 Correct 5 ms 876 KB Output is correct
4 Correct 4 ms 748 KB Output is correct
5 Correct 4 ms 748 KB Output is correct
6 Correct 4 ms 748 KB Output is correct
7 Correct 4 ms 748 KB Output is correct
8 Correct 4 ms 748 KB Output is correct
9 Correct 4 ms 748 KB Output is correct
10 Correct 4 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 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 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 236 KB Output is correct
21 Correct 5 ms 768 KB Output is correct
22 Correct 4 ms 748 KB Output is correct
23 Correct 4 ms 748 KB Output is correct
24 Correct 4 ms 748 KB Output is correct
25 Correct 4 ms 748 KB Output is correct
26 Correct 4 ms 748 KB Output is correct
27 Correct 4 ms 748 KB Output is correct
28 Correct 4 ms 748 KB Output is correct
29 Correct 4 ms 748 KB Output is correct
30 Correct 4 ms 748 KB Output is correct
31 Correct 4 ms 748 KB Output is correct
32 Correct 4 ms 748 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 768 KB Output is correct
2 Correct 4 ms 748 KB Output is correct
3 Correct 5 ms 876 KB Output is correct
4 Correct 4 ms 748 KB Output is correct
5 Correct 4 ms 748 KB Output is correct
6 Correct 4 ms 748 KB Output is correct
7 Correct 4 ms 748 KB Output is correct
8 Correct 4 ms 748 KB Output is correct
9 Correct 4 ms 748 KB Output is correct
10 Correct 4 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 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 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 236 KB Output is correct
21 Correct 5 ms 768 KB Output is correct
22 Correct 4 ms 748 KB Output is correct
23 Correct 4 ms 748 KB Output is correct
24 Correct 4 ms 748 KB Output is correct
25 Correct 4 ms 748 KB Output is correct
26 Correct 4 ms 748 KB Output is correct
27 Correct 4 ms 748 KB Output is correct
28 Correct 4 ms 748 KB Output is correct
29 Correct 4 ms 748 KB Output is correct
30 Correct 4 ms 748 KB Output is correct
31 Correct 4 ms 748 KB Output is correct
32 Correct 4 ms 748 KB Output is correct
33 Correct 1981 ms 66412 KB Output is correct
34 Correct 1974 ms 66340 KB Output is correct
35 Correct 1991 ms 66340 KB Output is correct
36 Correct 1962 ms 66340 KB Output is correct
37 Correct 1981 ms 66340 KB Output is correct
38 Correct 1973 ms 66468 KB Output is correct
39 Correct 1977 ms 66340 KB Output is correct
40 Correct 1978 ms 66596 KB Output is correct
41 Correct 1975 ms 66340 KB Output is correct
42 Correct 1971 ms 66340 KB Output is correct
43 Correct 1980 ms 66416 KB Output is correct
44 Correct 1960 ms 66468 KB Output is correct
45 Correct 1970 ms 66340 KB Output is correct
46 Correct 1986 ms 66340 KB Output is correct
47 Correct 1936 ms 66340 KB Output is correct
48 Correct 1950 ms 66360 KB Output is correct
49 Correct 1980 ms 66468 KB Output is correct
50 Correct 1951 ms 66340 KB Output is correct
51 Correct 1991 ms 66340 KB Output is correct
52 Correct 1954 ms 66340 KB Output is correct
53 Correct 1975 ms 66340 KB Output is correct
54 Correct 1952 ms 66444 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 768 KB Output is correct
2 Correct 4 ms 748 KB Output is correct
3 Correct 5 ms 876 KB Output is correct
4 Correct 4 ms 748 KB Output is correct
5 Correct 4 ms 748 KB Output is correct
6 Correct 4 ms 748 KB Output is correct
7 Correct 4 ms 748 KB Output is correct
8 Correct 4 ms 748 KB Output is correct
9 Correct 4 ms 748 KB Output is correct
10 Correct 4 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 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 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 236 KB Output is correct
21 Correct 5 ms 768 KB Output is correct
22 Correct 4 ms 748 KB Output is correct
23 Correct 4 ms 748 KB Output is correct
24 Correct 4 ms 748 KB Output is correct
25 Correct 4 ms 748 KB Output is correct
26 Correct 4 ms 748 KB Output is correct
27 Correct 4 ms 748 KB Output is correct
28 Correct 4 ms 748 KB Output is correct
29 Correct 4 ms 748 KB Output is correct
30 Correct 4 ms 748 KB Output is correct
31 Correct 4 ms 748 KB Output is correct
32 Correct 4 ms 748 KB Output is correct
33 Correct 1981 ms 66412 KB Output is correct
34 Correct 1974 ms 66340 KB Output is correct
35 Correct 1991 ms 66340 KB Output is correct
36 Correct 1962 ms 66340 KB Output is correct
37 Correct 1981 ms 66340 KB Output is correct
38 Correct 1973 ms 66468 KB Output is correct
39 Correct 1977 ms 66340 KB Output is correct
40 Correct 1978 ms 66596 KB Output is correct
41 Correct 1975 ms 66340 KB Output is correct
42 Correct 1971 ms 66340 KB Output is correct
43 Correct 1980 ms 66416 KB Output is correct
44 Correct 1960 ms 66468 KB Output is correct
45 Correct 1970 ms 66340 KB Output is correct
46 Correct 1986 ms 66340 KB Output is correct
47 Correct 1936 ms 66340 KB Output is correct
48 Correct 1950 ms 66360 KB Output is correct
49 Correct 1980 ms 66468 KB Output is correct
50 Correct 1951 ms 66340 KB Output is correct
51 Correct 1991 ms 66340 KB Output is correct
52 Correct 1954 ms 66340 KB Output is correct
53 Correct 1975 ms 66340 KB Output is correct
54 Correct 1952 ms 66444 KB Output is correct
55 Correct 1963 ms 66340 KB Output is correct
56 Correct 1957 ms 66596 KB Output is correct
57 Correct 1981 ms 66340 KB Output is correct
58 Execution timed out 2048 ms 66340 KB Time limit exceeded
59 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 748 KB Output is correct
2 Correct 4 ms 748 KB Output is correct
3 Correct 4 ms 748 KB Output is correct
4 Correct 4 ms 768 KB Output is correct
5 Correct 4 ms 748 KB Output is correct
6 Correct 4 ms 748 KB Output is correct
7 Correct 4 ms 748 KB Output is correct
8 Correct 4 ms 748 KB Output is correct
9 Correct 4 ms 748 KB Output is correct
10 Correct 4 ms 768 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 492 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 384 KB Output is correct
16 Correct 4 ms 768 KB Output is correct
17 Correct 4 ms 748 KB Output is correct
18 Correct 5 ms 876 KB Output is correct
19 Correct 4 ms 748 KB Output is correct
20 Correct 4 ms 748 KB Output is correct
21 Correct 4 ms 748 KB Output is correct
22 Correct 4 ms 748 KB Output is correct
23 Correct 4 ms 748 KB Output is correct
24 Correct 4 ms 748 KB Output is correct
25 Correct 4 ms 748 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 236 KB Output is correct
36 Correct 5 ms 768 KB Output is correct
37 Correct 4 ms 748 KB Output is correct
38 Correct 4 ms 748 KB Output is correct
39 Correct 4 ms 748 KB Output is correct
40 Correct 4 ms 748 KB Output is correct
41 Correct 4 ms 748 KB Output is correct
42 Correct 4 ms 748 KB Output is correct
43 Correct 4 ms 748 KB Output is correct
44 Correct 4 ms 748 KB Output is correct
45 Correct 4 ms 748 KB Output is correct
46 Correct 4 ms 748 KB Output is correct
47 Correct 4 ms 748 KB Output is correct
48 Correct 1981 ms 66412 KB Output is correct
49 Correct 1974 ms 66340 KB Output is correct
50 Correct 1991 ms 66340 KB Output is correct
51 Correct 1962 ms 66340 KB Output is correct
52 Correct 1981 ms 66340 KB Output is correct
53 Correct 1973 ms 66468 KB Output is correct
54 Correct 1977 ms 66340 KB Output is correct
55 Correct 1978 ms 66596 KB Output is correct
56 Correct 1975 ms 66340 KB Output is correct
57 Correct 1971 ms 66340 KB Output is correct
58 Correct 1980 ms 66416 KB Output is correct
59 Correct 1960 ms 66468 KB Output is correct
60 Correct 1970 ms 66340 KB Output is correct
61 Correct 1986 ms 66340 KB Output is correct
62 Correct 1936 ms 66340 KB Output is correct
63 Correct 1950 ms 66360 KB Output is correct
64 Correct 1980 ms 66468 KB Output is correct
65 Correct 1951 ms 66340 KB Output is correct
66 Correct 1991 ms 66340 KB Output is correct
67 Correct 1954 ms 66340 KB Output is correct
68 Correct 1975 ms 66340 KB Output is correct
69 Correct 1952 ms 66444 KB Output is correct
70 Correct 1963 ms 66340 KB Output is correct
71 Correct 1957 ms 66596 KB Output is correct
72 Correct 1981 ms 66340 KB Output is correct
73 Execution timed out 2048 ms 66340 KB Time limit exceeded
74 Halted 0 ms 0 KB -