제출 #238049

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
238049		Kubin	말 (IOI15_horses)	C++11	0 / 100	60 ms	9208 KiB

horses

#include <bits/stdc++.h>

using namespace std;

size_t n;
uint X[1 << 19], Y[1 << 19];
uint64_t product = 1;

const uint MOD = 1e9 + 7;
uint power(uint a, uint b)
{
    uint r = 1;
    while(b)
    {
        if(b) r = (uint64_t) r * a % MOD;
        a = (uint64_t) a * a % MOD;
        b /= 2;
    }
    return r;
}
uint inverse(uint x) { return power(x, MOD - 2); }

uint compute()
{
    uint64_t j = n-1, li = 1, lj = 1;
    for(size_t i = n; i --> 0 and li < UINT_MAX; )
    {
        if(Y[j] * li < Y[i] * lj)
            j = i, lj = li;
        li *= X[i];
    }
    return product * inverse(lj) % MOD * Y[j] % MOD;
}

int init(int _n, int x[], int y[])
{
    n = _n;
    copy(x, x + n, X);
    copy(y, y + n, Y);
    for(size_t i = 0; i < n; i++)
        product = (product * X[i]) % MOD;
    return compute();
}

int updateX(int pos, int val)
{
    product = product * inverse(X[pos]) % MOD * val % MOD;
    X[pos] = val;
    return compute();
}

int updateY(int pos, int val)
{
    Y[pos] = val;
    return compute();
}

컴파일 시 표준 에러 (stderr) 메시지

horses.cpp: In function 'uint power(uint, uint)':
horses.cpp:15:36: warning: conversion to 'uint {aka unsigned int}' from 'uint64_t {aka long unsigned int}' may alter its value [-Wconversion]
         if(b) r = (uint64_t) r * a % MOD;
                   ~~~~~~~~~~~~~~~~~^~~~~
horses.cpp:16:30: warning: conversion to 'uint {aka unsigned int}' from 'uint64_t {aka long unsigned int}' may alter its value [-Wconversion]
         a = (uint64_t) a * a % MOD;
             ~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'uint compute()':
horses.cpp:32:32: warning: conversion to 'uint {aka unsigned int}' from 'uint64_t {aka long unsigned int}' may alter its value [-Wconversion]
     return product * inverse(lj) % MOD * Y[j] % MOD;
                                ^
horses.cpp:32:47: warning: conversion to 'uint {aka unsigned int}' from 'uint64_t {aka long unsigned int}' may alter its value [-Wconversion]
     return product * inverse(lj) % MOD * Y[j] % MOD;
            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~

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