제출 #927824

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
927824		VMaksimoski008	말 (IOI15_horses)	C++14	17 / 100	1559 ms	13908 KiB

horses

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

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;

int n;
vector<ll> X(5*maxn), Y(maxn);
vector<double> logX(5*maxn), logY(maxn);

int calc() {
    ll curr = 1, id = -1, p1 = 0;
    double ls = 0, ans = -1;

    for(int i=0; i<n; i++) {
        curr = (curr * X[i]) % mod;
        ls += logX[i];
        if(ls + logY[i] > ans) {
            ans = ls + logY[i];
            id = i;
            p1 = curr;
        }
    }

    ll res = (p1 * Y[id]) % mod;

    return (int)res;
}

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

int updateX(int p, int v) {
    X[p] = v;
    logX[p] = log10(v);
    return calc();
}

int updateY(int p, int v) {
    logY[p] = log10(v);
    return calc();
}

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