제출 #1218996

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1218996		LIA	말 (IOI15_horses)	C++17	0 / 100	20 ms	24136 KiB

horses

#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple <ll,ll,ll> plll;
typedef vector <plll> vplll;
typedef pair <ll,ll> pll;
typedef vector <ll> vll;
typedef vector <pll> vpll;
typedef vector <vector <pll>> vvpll;
typedef vector <vector <ll>> vvll;
typedef vector <bool> vb;
typedef vector <vector <bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e9 + 7;


vll seg;

vector<double> xlog, ylog;
vll X, Y;
ll n;

ll sz= 1;

void build() {
    for (; sz<n ;sz*=2);
    seg.resize(sz);
    loop(i,sz,sz+n) seg[i] = X[i-sz];
    loopr(i,sz,0) {
        seg[i] = (seg[i*2]*seg[i*2+1])%inf;
    }
}

void update(ll pos, ll val) {
    pos+=sz;
    seg[pos] = val;
    for (pos/=2 ; pos>0 ; pos/=2) seg[pos] = (seg[pos*2] *seg[pos*2+1])%inf;
}
ll query(ll r) {
    ll l = sz;
    r+=sz;
    ll ans = 1;
    while (l<=r) {
        if (l%2==1) ans = (ans*seg[l++])%inf;
        if (r%2==0)  ans = (ans*seg[r--])%inf;
        l/=2;
        r/=2;
    }
    return ans;
}
int init(int N, int X1[], int Y1[]) {
    n = N;
    xlog.resize(n);
    ylog.resize(n);
    X.resize(n);
    Y.resize(n);
    loop(i,0,n) {
        xlog[i] = log2((double)X1[i]);
        ylog[i] = log2((double)Y1[i]);
        X[i] = X1[i];
        Y[i] = Y1[i];
    }
    build();
    ll idx = 0;
    double best = -1e300, cur = 0;
    loop(i,0,n) {
        cur += xlog[i];
        if (cur + ylog[i] > best) {
            best = cur + ylog[i];
            idx = i;
        }
    }
    ll ansi = query(idx);
    ansi = (ansi * Y[idx]) % inf;
    return ansi;
}

int updateX(int pos, int val) {
    xlog[pos] = log2((double)val);
    X[pos] = val;
    update(pos, val);
    ll idx = 0;
    double best = -1e300, cur = 0;
    loop(i,0,n) {
        cur += xlog[i];
        if (cur + ylog[i] > best) {
            best = cur + ylog[i];
            idx = i;
        }
    }
    ll ansi = query(idx);
    ansi = (ansi * Y[idx]) % inf;
    return ansi;
}

int updateY(int pos, int val) {
    ylog[pos] = log2((double)val);
    Y[pos] = val;
    ll idx = 0;
    double best = -1e300, cur = 0;
    loop(i,0,n) {
        cur += xlog[i];
        if (cur + ylog[i] > best) {
            best = cur + ylog[i];
            idx = i;
        }
    }
    ll ansi = query(idx);
    ansi = (ansi * Y[idx]) % inf;
    return ansi;
}

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