oj.uz

답안 #1004816

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004816 2024-06-21T16:55:53 Z magikarp23 말 (IOI15_horses) C++17
0 / 100
 1500 ms 12168 KB 
#include <bits/stdc++.h>
#include "horses.h"
using namespace std;

const int MAX_N = 500000 + 1;
const int MOD = 1000000007;

int X_store[MAX_N];
int Y_store[MAX_N];
int N_store;

long long pow_mod(long long base, long long exp) {
    long long result = 1;
    while (exp > 0) {
        if (exp & 1)
            result = (result * base) % MOD;
        base = (base * base) % MOD;
        exp >>= 1;
    }
    return result;
}

int calc_max_profit() {
    vector<long long> log_horses(N_store + 1, 0);
    long long max_log_profit = 0;
    
    for (int i = 0; i < N_store; i++) {
        if (i > 0) log_horses[i] = log_horses[i-1];
        log_horses[i] += log2l(static_cast<long double>(X_store[i]));
        long long log_profit = log_horses[i] + log2l(static_cast<long double>(Y_store[i]));
        max_log_profit = max(max_log_profit, log_profit);
    }
    
    long long base = 2;
    long long exp = max_log_profit;
    return static_cast<int>(pow_mod(base, exp));
}

int init(int N, int X[], int Y[]) {
    N_store = N;
    for (int i = 0; i < N; i++) {
        X_store[i] = X[i];
        Y_store[i] = Y[i];
    }
    return calc_max_profit();
}

int updateX(int pos, int val) {
    X_store[pos] = val;
    return calc_max_profit();
}

int updateY(int pos, int val) {
    Y_store[pos] = val;
    return calc_max_profit();
}

Compilation message

horses.cpp: In function 'int calc_max_profit()':
horses.cpp:29:68: warning: conversion from 'long double' to '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} may change value [-Wfloat-conversion]
   29 |         log_horses[i] += log2l(static_cast<long double>(X_store[i]));
      |                                                                    ^
horses.cpp:30:46: warning: conversion from 'long double' to 'long long int' may change value [-Wfloat-conversion]
   30 |         long long log_profit = log_horses[i] + log2l(static_cast<long double>(Y_store[i]));

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1523 ms 12168 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -