Submission #1281472

#	Time	Username	Problem	Language	Result	Execution time	Memory
1281472		nathlol2	Horses (IOI15_horses)	C++20	0 / 100	1593 ms	19812 KiB

horses

#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 5e5 + 5;
const ll MOD = 1e9 + 7;
vector<ll> x(N), y(N);
vector<long double> pf(N);
int n;
int init(int NN, int X[], int Y[]) {
	n = NN;
	for(int i = 0;i<n;i++) x[i] = X[i], y[i] = Y[i];
	pf[0] = log(x[0]);
	for(int i = 1;i<n;i++){
		pf[i] = pf[i - 1] + log(x[i]);
	}
	int id = -1, mx = -1;
	for(int i = 0;i<n;i++){
		if(pf[i] + log(y[i]) > mx){
			mx = pf[i] + log(y[i]);
			id = i;
		}
	}
	int ans = 1;
	for(int i = 0;i<=id;i++){
		ans *= x[i];
		ans %= MOD;
	}
	ans *= y[id];
	return ans % MOD;
}

int updateX(int pos, int val) {
	x[pos] = val;
	pf[0] = log(x[0]);
	for(int i = 1;i<n;i++){
		pf[i] = pf[i - 1] + log(x[i]);
	}
	int id = -1, mx = -1;
	for(int i = 0;i<n;i++){
		if(pf[i] + log(y[i]) > mx){
			mx = pf[i] + log(y[i]);
			id = i;
		}
	}
	int ans = 1;
	for(int i = 0;i<=id;i++){
		ans *= x[i];
		ans %= MOD;
	}
	ans *= y[id];
	return ans % MOD;
}

int updateY(int pos, int val) {
	y[pos] = val;
	pf[0] = log(x[0]);
	for(int i = 1;i<n;i++){
		pf[i] = pf[i - 1] + log(x[i]);
	}
	int id = -1, mx = -1;
	for(int i = 0;i<n;i++){
		if(pf[i] + log(y[i]) > mx){
			mx = pf[i] + log(y[i]);
			id = i;
		}
	}
	int ans = 1;
	for(int i = 0;i<=id;i++){
		ans *= x[i];
		ans %= MOD;
	}
	ans *= y[id];
	return ans % MOD;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23