oj.uz

Submission #949311

# Submission time Handle Problem Language Result Execution time Memory
949311 2024-03-19T05:48:29 Z mansur Bulldozer (JOI17_bulldozer) C++17
0 / 100
 29 ms 460 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];
	}
	if (n == 1) {
		cout << max(w[1], 0);
		return;
	}
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		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 = 0;
			for (int i = 1; i <= n; i++) {
			 	if (abs(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:76:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   76 | main() {
      | ^~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 348 KB Output is correct
2 Correct 25 ms 344 KB Output is correct
3 Correct 25 ms 344 KB Output is correct
4 Correct 29 ms 460 KB Output is correct
5 Correct 28 ms 348 KB Output is correct
6 Correct 27 ms 348 KB Output is correct
7 Correct 25 ms 348 KB Output is correct
8 Correct 25 ms 444 KB Output is correct
9 Correct 25 ms 348 KB Output is correct
10 Correct 25 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 348 KB Output is correct
2 Correct 25 ms 344 KB Output is correct
3 Correct 25 ms 344 KB Output is correct
4 Correct 29 ms 460 KB Output is correct
5 Correct 28 ms 348 KB Output is correct
6 Correct 27 ms 348 KB Output is correct
7 Correct 25 ms 348 KB Output is correct
8 Correct 25 ms 444 KB Output is correct
9 Correct 25 ms 348 KB Output is correct
10 Correct 25 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 348 KB Output is correct
2 Correct 25 ms 344 KB Output is correct
3 Correct 25 ms 344 KB Output is correct
4 Correct 29 ms 460 KB Output is correct
5 Correct 28 ms 348 KB Output is correct
6 Correct 27 ms 348 KB Output is correct
7 Correct 25 ms 348 KB Output is correct
8 Correct 25 ms 444 KB Output is correct
9 Correct 25 ms 348 KB Output is correct
10 Correct 25 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -