제출 #1004803

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1004803		magikarp23	말 (IOI15_horses)	C++17	17 / 100	1560 ms	8028 KiB

horses

#include <bits/stdc++.h>
#include "horses.h"
using namespace std;

const int MAX_N = 500000 + 1;
const long long MOD = 1000000007;  // 10^9 + 7

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

long long modMul(long long a, long long b) {
    long long result = 0;
    a %= MOD;
    while (b > 0) {
        if (b % 2 == 1) {
            result = (result + a) % MOD;
        }
        a = (a * 2) % MOD;
        b /= 2;
    }
    return result;
}

long long calc_max_profit() {
    long long max_profit = 0;
    long long cumulative_growth = 1;
    
    for (int i = 0; i < N_store; i++) {
        cumulative_growth = modMul(cumulative_growth, X_store[i]);
        long long current_profit = modMul(cumulative_growth, Y_store[i]);
        if (current_profit > max_profit) {
            max_profit = current_profit;
        }
    }
    
    return max_profit;
}

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();
}

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

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:46:27: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   46 |     return calc_max_profit();
      |            ~~~~~~~~~~~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:51:27: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   51 |     return calc_max_profit();
      |            ~~~~~~~~~~~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:56:27: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   56 |     return calc_max_profit();
      |            ~~~~~~~~~~~~~~~^~

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