oj.uz

Submission #150000

# Submission time Handle Problem Language Result Execution time Memory
150000 2019-09-01T07:31:39 Z 강력한 한방 필살기(#3595, gs14004, kriii, OnionPringles) Organizing the Best Squad (FXCUP4_squad) C++17
47 / 100
 3000 ms 168276 KB 
#include "squad.h"
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
using namespace std;
using lint = long long;
const int MAXN = 300005;

struct pi{
	int first, second, idx, cnt;
	bool operator<(const pi &q)const{
		return make_pair(first, second) < make_pair(q.first, q.second);
	}
};

lint ccw(pi a, pi b, pi c){
	int dx1 = b.first - a.first;
	int dy1 = b.second - a.second;
	int dx2 = c.first - a.first;
	int dy2 = c.second - a.second;
	return 1ll * dx1 * dy2 - 1ll * dy1 * dx2;
}

struct query{
	pi V[MAXN];
	int par[20][MAXN], N;
	int revloc[MAXN];
	pi FUCK[MAXN];
	void init(vector<pi> v){
		memset(revloc, -1, sizeof(revloc));
		N = sz(v);
		vector<int> stk;
		for(int i=0; i<sz(v); i++){
			V[i + 1] = v[i];
		}
		for(int i=1; i<=N; i++){
			while(sz(stk) >= 2 && ccw(V[stk[sz(stk) - 2]], V[stk.back()], V[i]) > 0){
				stk.pop_back();
			}
			if(sz(stk)) par[0][i] = stk.back();
			stk.push_back(i);
		}
		for(int i=1; i<=N; i++) revloc[V[i].idx] = i;
		for(int i=1; i<20; i++){
			for(int j=1; j<=N; j++){
				par[i][j] = par[i-1][par[i-1][j]];
			}
		}
		for(int i=2; i<=N; i++){
			FUCK[i].first = V[i].first - V[par[0][i]].first;
			FUCK[i].second = V[i].second - V[par[0][i]].second;
		}
	}
	pair<lint, int> get(int x, int y, int n){
		lint cur = -5e18;
		int cnt = 0;
		int pos = -1;
		for(int i=19; i>=0; i--){
			if(par[i][n] > 1){
				int R = par[i][n];
				lint qr2 = 1ll * x * FUCK[R].first + 1ll * y * FUCK[R].second;
				if(0 > qr2) n = par[i][n];
			}
		}
		int it = 0;
		for(int i=n; i&& it<3; i=par[0][i]){
			it++;
			lint qr = 1ll * x * V[i].first + 1ll * y * V[i].second;
			if(qr > cur){
				cur = qr;
				cnt = 0;
				pos = V[i].idx;
			}
			if(qr == cur) cnt += V[i].cnt;
		}
		if(cnt >= 2) pos = -1;
		return make_pair(cur, pos);
	}
}XP, YP, XS, YS;

int N;
vector<pi> v, w;

vector<pi> norm(vector<pi> v){
	sort(v.begin(), v.end());
	vector<pi> w;
	for(int i=0; i<sz(v); ){
		int e = i;
		while(e < sz(v) && make_pair(v[i].first, v[i].second) == make_pair(v[e].first, v[e].second)) e++;
		w.push_back({v[i].first, v[i].second, v[i].idx, e - i});
		i = e;
	}
	return w;
}

void Init(std::vector<int> A, std::vector<int> D, std::vector<int> P){
	N = sz(A);
	for(int i=0; i<N; i++){
		v.push_back({A[i], P[i], i, 1});
		w.push_back({D[i], P[i], i, 1});
	}
	v = norm(v);
	w = norm(w);
	XP.init(v);
	YP.init(w);
	for(auto &i : v) i.first *= -1;
	sort(v.begin(), v.end());
	for(auto &i : w) i.first *= -1;
	sort(w.begin(), w.end());
	XS.init(v);
	YS.init(w);
}

long long BestSquad(int X, int Y){
	auto qr1 = XP.get(X, Y, XP.N);
	auto qr2 = YP.get(X, Y, YP.N);
	if(qr1.second < 0 || qr2.second < 0 || qr1.second != qr2.second) return qr1.first + qr2.first;
	lint ret = -5e18;
	ret = max(ret, qr1.first + YP.get(X, Y, YP.revloc[qr1.second] - 1).first);
	ret = max(ret, qr1.first + YS.get(-X, Y, YS.revloc[qr1.second] - 1).first);
	ret = max(ret, qr2.first + XP.get(X, Y, XP.revloc[qr1.second] - 1).first);
	ret = max(ret, qr2.first + XS.get(-X, Y, XS.revloc[qr1.second] - 1).first);
	return ret;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5632 KB Output is correct
2 Correct 9 ms 6144 KB Output is correct
3 Correct 396 ms 165892 KB Output is correct
4 Correct 412 ms 165892 KB Output is correct
5 Correct 36 ms 15988 KB Output is correct
6 Correct 388 ms 165912 KB Output is correct
7 Correct 371 ms 165928 KB Output is correct
8 Correct 373 ms 165912 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5632 KB Output is correct
2 Correct 14 ms 6784 KB Output is correct
3 Correct 662 ms 168260 KB Output is correct
4 Correct 685 ms 168148 KB Output is correct
5 Correct 41 ms 12404 KB Output is correct
6 Correct 1453 ms 167892 KB Output is correct
7 Correct 1408 ms 167892 KB Output is correct
8 Correct 1253 ms 168012 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5632 KB Output is correct
2 Correct 9 ms 6144 KB Output is correct
3 Correct 396 ms 165892 KB Output is correct
4 Correct 412 ms 165892 KB Output is correct
5 Correct 36 ms 15988 KB Output is correct
6 Correct 388 ms 165912 KB Output is correct
7 Correct 371 ms 165928 KB Output is correct
8 Correct 373 ms 165912 KB Output is correct
9 Correct 8 ms 5632 KB Output is correct
10 Correct 14 ms 6784 KB Output is correct
11 Correct 662 ms 168260 KB Output is correct
12 Correct 685 ms 168148 KB Output is correct
13 Correct 41 ms 12404 KB Output is correct
14 Correct 1453 ms 167892 KB Output is correct
15 Correct 1408 ms 167892 KB Output is correct
16 Correct 1253 ms 168012 KB Output is correct
17 Correct 118 ms 8184 KB Output is correct
18 Correct 14 ms 7168 KB Output is correct
19 Correct 620 ms 168264 KB Output is correct
20 Correct 628 ms 168276 KB Output is correct
21 Correct 170 ms 12888 KB Output is correct
22 Execution timed out 3108 ms 165916 KB Time limit exceeded
23 Halted 0 ms 0 KB -