oj.uz

답안 #206110

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
206110 2020-03-02T09:24:47 Z TAISA_ Bulldozer (JOI17_bulldozer) C++14
55 / 100
 1390 ms 128148 KB 
#include <bits/stdc++.h>
#define all(v) v.begin(),v.end()
#define eb emplace_back
using namespace std;
using ll=long long;
using P=pair<int,int>;
using C=complex<double>;
void chmax(ll &a,ll b){a=max(a,b);}
void chmin(ll &a,ll b){a=min(a,b);}
struct segtree{
	struct T{
		ll l,r,sum,val;
	};
	T merge(T &a,T &b){
		T res;
		res.l=max(a.l,a.sum+b.l);
		res.r=max(b.r,a.r+b.sum);
		res.sum=a.sum+b.sum;
		res.val=max({a.val,b.val,a.r+b.l});
		return res;
	}
	int n;
	vector<T> dat;
	segtree(int n_){
		n=1;
		while(n<n_)n<<=1;
		dat.resize(2*n,T{0,0,0,0});
	}
	void upd(int k,ll x){
		T to=T{max(x,0LL),max(x,0LL),x,max(x,0LL)};
		k+=n;
		dat[k]=to;
		k>>=1;
		while(k>0){
			dat[k]=merge(dat[k<<1],dat[k<<1|1]);
			k>>=1;
		}
	}
	inline ll get(){
		return dat[1].val;
	}
};
const long double eps=1e-15;
bool equal(long double a,long double b){return a==b;}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;cin>>n;
	vector<double> x(n),y(n);
	vector<ll> w(n);
	vector<pair<long double,P>> v;
	vector<pair<P,int>> ps(n);
	for(int i=0;i<n;i++){
		cin>>x[i]>>y[i]>>w[i];
		ps[i]=make_pair(P(y[i],x[i]),i);
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(i==j)continue;
			long double t=atan2l(y[j]-y[i],x[j]-x[i]);
			if(t>=0){
				v.eb(t,P(i,j));
			}
		}
	}
	sort(all(v));
	sort(all(ps));
	reverse(all(ps));
	segtree seg(n);
	vector<int> pos(n),a(n);
	for(int i=0;i<n;i++){
		seg.upd(i,w[ps[i].second]);
		pos[ps[i].second]=i;
		a[i]=ps[i].second;
	}
	ll res=seg.get();
	set<int> st;
	for(int i=0;i<v.size();i++){
		int l=v[i].second.first,r=v[i].second.second;
		swap(pos[l],pos[r]);
		swap(a[pos[l]],a[pos[r]]);
		seg.upd(pos[l],w[l]);
		seg.upd(pos[r],w[r]);
		st.insert(l);
		st.insert(r);
		if(i+1<v.size()&&equal(v[i].first,v[i+1].first))continue;
		/*cout<<l<<" "<<r<<" "<<seg.get()<<endl;
		for(int j=0;j<n;j++)cout<<a[j]<<" ";
		cout<<endl;*/
		assert(st.size()==2);
		st.clear();
		chmax(res,seg.get());
	}
	cout<<res<<'\n';
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:78:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<v.size();i++){
              ~^~~~~~~~~
bulldozer.cpp:86:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i+1<v.size()&&equal(v[i].first,v[i+1].first))continue;
      ~~~^~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 9 ms 1396 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 760 KB Output is correct
2 Correct 8 ms 760 KB Output is correct
3 Correct 7 ms 760 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 7 ms 760 KB Output is correct
6 Correct 8 ms 760 KB Output is correct
7 Correct 8 ms 760 KB Output is correct
8 Correct 7 ms 760 KB Output is correct
9 Correct 7 ms 764 KB Output is correct
10 Correct 8 ms 760 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 380 KB Output is correct
18 Correct 4 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 7 ms 764 KB Output is correct
22 Correct 8 ms 760 KB Output is correct
23 Correct 8 ms 760 KB Output is correct
24 Correct 8 ms 764 KB Output is correct
25 Correct 8 ms 760 KB Output is correct
26 Correct 8 ms 760 KB Output is correct
27 Correct 7 ms 760 KB Output is correct
28 Correct 8 ms 764 KB Output is correct
29 Correct 8 ms 760 KB Output is correct
30 Correct 8 ms 760 KB Output is correct
31 Correct 7 ms 760 KB Output is correct
32 Correct 7 ms 760 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 760 KB Output is correct
2 Correct 8 ms 760 KB Output is correct
3 Correct 7 ms 760 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 7 ms 760 KB Output is correct
6 Correct 8 ms 760 KB Output is correct
7 Correct 8 ms 760 KB Output is correct
8 Correct 7 ms 760 KB Output is correct
9 Correct 7 ms 764 KB Output is correct
10 Correct 8 ms 760 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 380 KB Output is correct
18 Correct 4 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 7 ms 764 KB Output is correct
22 Correct 8 ms 760 KB Output is correct
23 Correct 8 ms 760 KB Output is correct
24 Correct 8 ms 764 KB Output is correct
25 Correct 8 ms 760 KB Output is correct
26 Correct 8 ms 760 KB Output is correct
27 Correct 7 ms 760 KB Output is correct
28 Correct 8 ms 764 KB Output is correct
29 Correct 8 ms 760 KB Output is correct
30 Correct 8 ms 760 KB Output is correct
31 Correct 7 ms 760 KB Output is correct
32 Correct 7 ms 760 KB Output is correct
33 Correct 1342 ms 66328 KB Output is correct
34 Correct 1334 ms 66328 KB Output is correct
35 Correct 1354 ms 66328 KB Output is correct
36 Correct 1371 ms 66328 KB Output is correct
37 Correct 1354 ms 66328 KB Output is correct
38 Correct 1374 ms 66328 KB Output is correct
39 Correct 1390 ms 66204 KB Output is correct
40 Correct 1379 ms 66328 KB Output is correct
41 Correct 1360 ms 66284 KB Output is correct
42 Correct 1368 ms 66452 KB Output is correct
43 Correct 1343 ms 66328 KB Output is correct
44 Correct 1341 ms 66328 KB Output is correct
45 Correct 1361 ms 66328 KB Output is correct
46 Correct 1369 ms 66400 KB Output is correct
47 Correct 1351 ms 66332 KB Output is correct
48 Correct 1347 ms 66328 KB Output is correct
49 Correct 1333 ms 66328 KB Output is correct
50 Correct 1348 ms 66416 KB Output is correct
51 Correct 1330 ms 66328 KB Output is correct
52 Correct 1336 ms 66504 KB Output is correct
53 Correct 1340 ms 66328 KB Output is correct
54 Correct 1329 ms 66204 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 760 KB Output is correct
2 Correct 8 ms 760 KB Output is correct
3 Correct 7 ms 760 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 7 ms 760 KB Output is correct
6 Correct 8 ms 760 KB Output is correct
7 Correct 8 ms 760 KB Output is correct
8 Correct 7 ms 760 KB Output is correct
9 Correct 7 ms 764 KB Output is correct
10 Correct 8 ms 760 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 380 KB Output is correct
18 Correct 4 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 7 ms 764 KB Output is correct
22 Correct 8 ms 760 KB Output is correct
23 Correct 8 ms 760 KB Output is correct
24 Correct 8 ms 764 KB Output is correct
25 Correct 8 ms 760 KB Output is correct
26 Correct 8 ms 760 KB Output is correct
27 Correct 7 ms 760 KB Output is correct
28 Correct 8 ms 764 KB Output is correct
29 Correct 8 ms 760 KB Output is correct
30 Correct 8 ms 760 KB Output is correct
31 Correct 7 ms 760 KB Output is correct
32 Correct 7 ms 760 KB Output is correct
33 Correct 1342 ms 66328 KB Output is correct
34 Correct 1334 ms 66328 KB Output is correct
35 Correct 1354 ms 66328 KB Output is correct
36 Correct 1371 ms 66328 KB Output is correct
37 Correct 1354 ms 66328 KB Output is correct
38 Correct 1374 ms 66328 KB Output is correct
39 Correct 1390 ms 66204 KB Output is correct
40 Correct 1379 ms 66328 KB Output is correct
41 Correct 1360 ms 66284 KB Output is correct
42 Correct 1368 ms 66452 KB Output is correct
43 Correct 1343 ms 66328 KB Output is correct
44 Correct 1341 ms 66328 KB Output is correct
45 Correct 1361 ms 66328 KB Output is correct
46 Correct 1369 ms 66400 KB Output is correct
47 Correct 1351 ms 66332 KB Output is correct
48 Correct 1347 ms 66328 KB Output is correct
49 Correct 1333 ms 66328 KB Output is correct
50 Correct 1348 ms 66416 KB Output is correct
51 Correct 1330 ms 66328 KB Output is correct
52 Correct 1336 ms 66504 KB Output is correct
53 Correct 1340 ms 66328 KB Output is correct
54 Correct 1329 ms 66204 KB Output is correct
55 Correct 1342 ms 66232 KB Output is correct
56 Correct 1361 ms 66328 KB Output is correct
57 Correct 1356 ms 66332 KB Output is correct
58 Correct 1362 ms 66328 KB Output is correct
59 Correct 1361 ms 66204 KB Output is correct
60 Correct 1350 ms 66268 KB Output is correct
61 Correct 1351 ms 66328 KB Output is correct
62 Correct 1359 ms 66328 KB Output is correct
63 Correct 1352 ms 66340 KB Output is correct
64 Correct 1354 ms 66328 KB Output is correct
65 Runtime error 948 ms 128148 KB Execution killed with signal 11 (could be triggered by violating memory limits)
66 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 9 ms 1396 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -