제출 #718538

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
718538		mseebacher	말 (IOI15_horses)	C++17	0 / 100	1563 ms	8148 KiB

horses

#include "horses.h"
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <functional>
#include <iostream>
#include <fstream>
#include <string>

using namespace std;

vector<int> x;
vector<int> y;
int n;


const int MOD = 1e9+7;

int calc(){
	double horses = log2(1);
	int horses_mod = 1;
	double p_log = 0;
	int p_mod = 0;
	for(int i = 0;i<n;i++){
		horses += log2(x[i]);
		horses_mod = (horses_mod * x[i])%MOD;
		if(horses + log2(y[i]) > p_log){
			p_log = horses+log2(y[i]);
			p_mod = (horses_mod*y[i])%MOD;
		}
	}
	return p_mod;
}

int init(int N, int X[], int Y[]) {
	n = N;
	x.assign(N,0);
	y.assign(N,0);
	for(int i = 0;i<n;i++){
		x[i] = X[i];
		y[i] = Y[i];
	}
	return calc();
}

int updateX(int pos, int val) {	
	x[pos] = val;
	return calc();
}

int updateY(int pos, int val) {
	y[pos] = val;
	return calc();
}

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