oj.uz

답안 #150206

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150206 2019-09-01T07:53:56 Z (παρα)γεμιστά(#3619, cfalas, ctziapo, Charis02) 최적의 팀 구성 (FXCUP4_squad) C++17
0 / 100
 3000 ms 20452 KB 
#include "squad.h"
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ll long long
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<ll> vi;
#define FOR(i,a,b) for(int i=a;i<b;i++)

vii ps;
vi p;
vi a;
int n;
void Init(std::vector<int> A, std::vector<int> D, std::vector<int> P){
	int N = A.size();
	n = N;
	FOR(i,0,N) a.push_back(A[i]);
	FOR(i,0,N) p.push_back(P[i]);
	FOR(i,0,N) ps.push_back(ii(P[i], i));
	sort(ps.begin(), ps.end());
}

long long BestSquad(int X, int Y){
	long long best=0;
	for(int i=0;i<n;i++){
		long long cu = a[i]*X + p[i]*Y;
		int ind = ps.size()-1;
		while(ps[ind].S==i) ind--;
		cu+=ps[ind].F*Y;
		//cout<<i<<" "<<ps[ind].S<<" "<<cu<<endl;
		best =max(best, cu);
	}
	//cout<<"---------\n";
	
	return best+X;
}

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 20 ms 640 KB Output is correct
3 Execution timed out 3100 ms 20452 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -