oj.uz

Submission #149493

# Submission time Handle Problem Language Result Execution time Memory
149493 2019-09-01T06:36:01 Z Seishun Buta Yarou wa Yumemiru Shoujo no Yume wo Minai(#3781, zscoder, tmwilliamlin168) Organizing the Best Squad (FXCUP4_squad) C++17
19 / 100
 3000 ms 206220 KB 
#include "squad.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

struct cht {
	vector<ar<int, 2>> v;
	int a[1<<18], b[1<<18], qt;
	void al(int a, int b) {
		v.push_back({a, b});
	}
	void init() {
		sort(v.begin(), v.end());
		for(ar<int, 2> vi : v) {
			while(qt&&vi[0]==a[qt-1]||qt>1&&(ll)(b[qt-1]-b[qt-2])*(a[qt-1]-vi[0])>=(ll)(vi[1]-b[qt-1])*(a[qt-2]-a[qt-1]))
				--qt;
			a[qt]=vi[0];
			b[qt]=vi[1];
			++qt;
		}
	}
	ll qry(ll x, ll y) {
		int lb=0, rb=qt-1;
		while(lb<rb) {
			int mb=(lb+rb)/2;
			if(a[mb]*x+b[mb]*y>a[mb+1]*x+b[mb+1]*y)
				rb=mb;
			else
				lb=mb+1;
		}
		return a[lb]*x+b[lb]*y;
	}
} ca[19][2], cd[19][2];

int n, k;

void Init(vector<int> a, vector<int> d, vector<int> p) {
	n=a.size();
	while(1<<k<n)
		++k;
	for(int i=0; i<n; ++i) {
		for(int j=0; j<k; ++j) {
			ca[j][i>>j&1].al(a[i], p[i]);
			cd[j][i>>j&1].al(d[i], p[i]);
		}
	}
	for(int j=0; j<k; ++j) {
		for(int l : {0, 1}) {
			ca[j][l].init();
			cd[j][l].init();
		}
	}
}

ll BestSquad(int x, int y) {
	ll ans=0;
	for(int i=0; i<k; ++i) {
		ans=max(ans, ca[i][0].qry(x, y)+cd[i][1].qry(x, y));
		ans=max(ans, cd[i][0].qry(x, y)+ca[i][1].qry(x, y));
	}
	return ans;
}

Compilation message

squad.cpp: In member function 'void cht::init()':
squad.cpp:17:12: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
    while(qt&&vi[0]==a[qt-1]||qt>1&&(ll)(b[qt-1]-b[qt-2])*(a[qt-1]-vi[0])>=(ll)(vi[1]-b[qt-1])*(a[qt-2]-a[qt-1]))
          ~~^~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1024 KB Output is correct
2 Correct 8 ms 1280 KB Output is correct
3 Correct 1958 ms 117080 KB Output is correct
4 Correct 1956 ms 117116 KB Output is correct
5 Correct 86 ms 12536 KB Output is correct
6 Correct 1841 ms 206220 KB Output is correct
7 Correct 1912 ms 206196 KB Output is correct
8 Correct 1840 ms 206196 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1024 KB Output is correct
2 Correct 19 ms 1920 KB Output is correct
3 Correct 2987 ms 119500 KB Output is correct
4 Correct 2893 ms 119500 KB Output is correct
5 Correct 139 ms 6268 KB Output is correct
6 Execution timed out 3111 ms 161420 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1024 KB Output is correct
2 Correct 8 ms 1280 KB Output is correct
3 Correct 1958 ms 117080 KB Output is correct
4 Correct 1956 ms 117116 KB Output is correct
5 Correct 86 ms 12536 KB Output is correct
6 Correct 1841 ms 206220 KB Output is correct
7 Correct 1912 ms 206196 KB Output is correct
8 Correct 1840 ms 206196 KB Output is correct
9 Correct 6 ms 1024 KB Output is correct
10 Correct 19 ms 1920 KB Output is correct
11 Correct 2987 ms 119500 KB Output is correct
12 Correct 2893 ms 119500 KB Output is correct
13 Correct 139 ms 6268 KB Output is correct
14 Execution timed out 3111 ms 161420 KB Time limit exceeded
15 Halted 0 ms 0 KB -