oj.uz

답안 #949318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949318 2024-03-19T06:01:54 Z mansur Bulldozer (JOI17_bulldozer) C++17
25 / 100
 2000 ms 604 KB 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#include<bits/stdc++.h>	

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()                 
#define sz(a) (int)a.size()
#define s second
#define f first
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
     
vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
 
const int N = 2e6 + 1, mod = 998244353;

const ll inf = 2e9;
 
double eps = 1e-15;
                                                
bool flg = 0;

void slv() {
	int n;
	cin >> n;
	double x[n + 1], y[n + 1];
	int w[n + 1];
	for (int i = 1; i <= n; i++) {
		cin >> x[i] >> y[i] >> w[i];
	}
	ll ans = 0;
	{
		vector<pii> s;
		for (int i = 1; i <= n; i++) {
			s.push_back({x[i], w[i]});
		}
		s.push_back({-inf, -inf});
		sort(all(s));
		ll p[n + 1], mn = 0;
		p[0] = 0;
		for (int i = 1; i <= n; i++) {
			p[i] = p[i - 1] + s[i].s;            
			ans = max(ans, p[i] - mn);
			mn = min(mn, p[i]);
		}
	}
	for (int i = 1; i <= n; i++) {
		ans = max(ans, w[i] * 1ll);
		for (int j = i + 1; j <= n; j++) {
			double k = (y[j] - y[i]) / (x[j] - x[i]);
			double b = y[j] - x[j] * k;
			vector<pair<double, int>> s, h;
			for (int p = 1; p <= n; p++) {
				double d = y[p] - (x[p] * k + b);
				s.push_back({d, w[p]});
			}
			s.push_back({-inf, -inf});
			sort(all(s));
			ll sum = -inf;
			for (int i = 1; i <= n; i++) {
			 	if (fabs(s[i].f - s[i - 1].f) > eps) {
			 		h.push_back({s[i - 1].f, sum});
			 		sum = s[i].s;	
			 	}else sum += s[i].s;
			}
			h.push_back({s[n].f, sum});
			s = h;
			ll p[sz(s)], mn = 0;
			p[0] = 0;
			for (int i = 1; i < sz(s); i++) {
				p[i] = p[i - 1] + s[i].s;            
				ans = max(ans, p[i] - mn);
				mn = min(mn, p[i]);
			}
		}
	}
	cout << ans;
}                                                                           
 
main() {
	//freopen("rsq.in", "r", stdin);                                                                                     
	//freopen("rsq.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(0);	                                                                                       
	cin.tie(0);
	int tp = 1;
	if (flg) cin >> tp;
	while (tp--) {  	
		slv();
	}
}
//wenomechainsama

Compilation message

bulldozer.cpp:88:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   88 | main() {
      | ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 348 KB Output is correct
2 Correct 12 ms 348 KB Output is correct
3 Correct 12 ms 464 KB Output is correct
4 Correct 11 ms 344 KB Output is correct
5 Correct 12 ms 468 KB Output is correct
6 Correct 11 ms 348 KB Output is correct
7 Correct 11 ms 344 KB Output is correct
8 Correct 12 ms 348 KB Output is correct
9 Correct 13 ms 604 KB Output is correct
10 Correct 13 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 444 KB Output is correct
2 Correct 27 ms 464 KB Output is correct
3 Correct 26 ms 348 KB Output is correct
4 Correct 27 ms 348 KB Output is correct
5 Correct 30 ms 440 KB Output is correct
6 Correct 28 ms 600 KB Output is correct
7 Correct 29 ms 348 KB Output is correct
8 Correct 28 ms 444 KB Output is correct
9 Correct 26 ms 348 KB Output is correct
10 Correct 26 ms 464 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 356 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 27 ms 472 KB Output is correct
22 Correct 25 ms 460 KB Output is correct
23 Correct 26 ms 456 KB Output is correct
24 Correct 24 ms 348 KB Output is correct
25 Correct 26 ms 456 KB Output is correct
26 Correct 24 ms 348 KB Output is correct
27 Correct 25 ms 348 KB Output is correct
28 Correct 26 ms 472 KB Output is correct
29 Correct 24 ms 452 KB Output is correct
30 Correct 27 ms 604 KB Output is correct
31 Correct 26 ms 348 KB Output is correct
32 Correct 25 ms 468 KB Output is correct

Subtask #3
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 444 KB Output is correct
2 Correct 27 ms 464 KB Output is correct
3 Correct 26 ms 348 KB Output is correct
4 Correct 27 ms 348 KB Output is correct
5 Correct 30 ms 440 KB Output is correct
6 Correct 28 ms 600 KB Output is correct
7 Correct 29 ms 348 KB Output is correct
8 Correct 28 ms 444 KB Output is correct
9 Correct 26 ms 348 KB Output is correct
10 Correct 26 ms 464 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 356 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 27 ms 472 KB Output is correct
22 Correct 25 ms 460 KB Output is correct
23 Correct 26 ms 456 KB Output is correct
24 Correct 24 ms 348 KB Output is correct
25 Correct 26 ms 456 KB Output is correct
26 Correct 24 ms 348 KB Output is correct
27 Correct 25 ms 348 KB Output is correct
28 Correct 26 ms 472 KB Output is correct
29 Correct 24 ms 452 KB Output is correct
30 Correct 27 ms 604 KB Output is correct
31 Correct 26 ms 348 KB Output is correct
32 Correct 25 ms 468 KB Output is correct
33 Execution timed out 2009 ms 604 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 444 KB Output is correct
2 Correct 27 ms 464 KB Output is correct
3 Correct 26 ms 348 KB Output is correct
4 Correct 27 ms 348 KB Output is correct
5 Correct 30 ms 440 KB Output is correct
6 Correct 28 ms 600 KB Output is correct
7 Correct 29 ms 348 KB Output is correct
8 Correct 28 ms 444 KB Output is correct
9 Correct 26 ms 348 KB Output is correct
10 Correct 26 ms 464 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 356 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 27 ms 472 KB Output is correct
22 Correct 25 ms 460 KB Output is correct
23 Correct 26 ms 456 KB Output is correct
24 Correct 24 ms 348 KB Output is correct
25 Correct 26 ms 456 KB Output is correct
26 Correct 24 ms 348 KB Output is correct
27 Correct 25 ms 348 KB Output is correct
28 Correct 26 ms 472 KB Output is correct
29 Correct 24 ms 452 KB Output is correct
30 Correct 27 ms 604 KB Output is correct
31 Correct 26 ms 348 KB Output is correct
32 Correct 25 ms 468 KB Output is correct
33 Execution timed out 2009 ms 604 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 348 KB Output is correct
2 Correct 12 ms 348 KB Output is correct
3 Correct 12 ms 464 KB Output is correct
4 Correct 11 ms 344 KB Output is correct
5 Correct 12 ms 468 KB Output is correct
6 Correct 11 ms 348 KB Output is correct
7 Correct 11 ms 344 KB Output is correct
8 Correct 12 ms 348 KB Output is correct
9 Correct 13 ms 604 KB Output is correct
10 Correct 13 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 30 ms 444 KB Output is correct
17 Correct 27 ms 464 KB Output is correct
18 Correct 26 ms 348 KB Output is correct
19 Correct 27 ms 348 KB Output is correct
20 Correct 30 ms 440 KB Output is correct
21 Correct 28 ms 600 KB Output is correct
22 Correct 29 ms 348 KB Output is correct
23 Correct 28 ms 444 KB Output is correct
24 Correct 26 ms 348 KB Output is correct
25 Correct 26 ms 464 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 356 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 456 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 27 ms 472 KB Output is correct
37 Correct 25 ms 460 KB Output is correct
38 Correct 26 ms 456 KB Output is correct
39 Correct 24 ms 348 KB Output is correct
40 Correct 26 ms 456 KB Output is correct
41 Correct 24 ms 348 KB Output is correct
42 Correct 25 ms 348 KB Output is correct
43 Correct 26 ms 472 KB Output is correct
44 Correct 24 ms 452 KB Output is correct
45 Correct 27 ms 604 KB Output is correct
46 Correct 26 ms 348 KB Output is correct
47 Correct 25 ms 468 KB Output is correct
48 Execution timed out 2009 ms 604 KB Time limit exceeded
49 Halted 0 ms 0 KB -