제출 #1017934

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1017934		Muhammet	말 (IOI15_horses)	C++17	17 / 100	28 ms	32576 KiB

horses

#include <bits/stdc++.h>
#include "horses.h"

using namespace std;

#define ll long long

const ll M = 1e9 + 7;

int n;

vector <int> a1, b1;

int f(){
	vector <int> a(1,0), b(1,0), p(n+1,1), mx(n+2,0);
	for(auto i : a1) a.push_back(i);
	for(auto i : b1) b.push_back(i);
	for(int i = 1; i <= n; i++){
		p[i] = p[i-1] * a[i];
	}
	for(int i = n; i >= 1; i--){
		mx[i] = max(mx[i+1], p[i] * b[i]);
	}
	int ind = 1;
	int ans = 0, k = 0;
	for(int i = 1; i <= n; i++){
		if(p[i] * b[i] == mx[ind]){
			k = max(k,ans+((p[i]/p[ind-1])) * (b[i]));
			ans += (((p[i]/p[ind-1])-1) * (b[i]));
			ind = i+1;
			ans %= M;
			k %= M;
		}
	}
	ans = max(ans,k);
	ans %= M;
	return ans;
}

int init(int N, int X[], int Y[]) {
	n = N;
	a1.resize(n);
	b1.resize(n);
	for(int i = 0; i < n; i++){
		a1[i] = X[i];
		b1[i] = Y[i];
	}
	return f();
}

int updateX(int pos, int val) {	
	a1[pos] = val;
	return f();
}

int updateY(int pos, int val) {
	b1[pos] = val;
	return f();
}

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