제출 #1005000

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1005000		Mr_Husanboy	말 (IOI15_horses)	C++17	17 / 100	54 ms	16984 KiB

horses

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

using namespace std;
#define ll long long

template<typename T>
int len(T &a){return a.size();}
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()

int mod = 1e9 + 7;
vector<ll> x, y;
const int inf = 1e9;
int n;

vector<ll> pref;

int init(int N, int X[], int Y[]) {
	n = N;
	x.resize(n), y.resize(n);
	pref.resize(n);
	for(int i = 0; i < n; i ++) x[i] = X[i], y[i] = Y[i];
	pref[0] = x[0];
	for(int i = 1; i < n; i ++) pref[i] = pref[i - 1] * x[i] % mod;
	ll mult = 1;
	ll mx = 0;
	int lim = -1;
	for(int i = n - 1; i >= 0; i --){
		mult *= x[i];
		if(mult >= inf){
			lim = i;
			break;
		}
	}
	mult = 1;
	if(lim >= 0) mx = y[lim];
	for(int i = lim + 1; i < n; i ++){
		mult *= x[i];
		mx = max(mx, mult * y[i]);
	}
	//cout << mx << endl;
	mx %= mod;

	if(lim >= 0) mx = mx * pref[lim] % mod;
	//cout << mx << endl;
	return mx;
}

int updateX(int pos, int val) {
	x[pos] = val;
	ll mult = 1;
	ll mx = 0;
	int lim = -1;
	for(int i = n - 1; i >= 0; i --){
		mult *= x[i];
		if(mult >= inf){
			lim = i;
			break;
		}
	}
	mult = 1;

	if(lim >= 0) mx = y[lim];
	for(int i = lim + 1; i < n; i ++){
		mult *= x[i];
		mx = max(mx, mult * y[i]);
	}

	mx %= mod;
	if(lim >= 0) mx = mx * pref[lim] % mod;
	//cout << mx << endl;
	return mx;
}

int updateY(int pos, int val) {
	y[pos] = val;
	ll mult = 1;
	ll mx = 0;
	int lim = -1;
	for(int i = n - 1; i >= 0; i --){
		mult *= x[i];
		if(mult >= inf){
			lim = i;
			break;
		}
	}
	mult = 1;

	if(lim >= 0) mx = y[lim];
	for(int i = lim + 1; i < n; i ++){
		mult *= x[i];
		mx = max(mx, mult * y[i]);
	}

	mx %= mod;
	if(lim >= 0) mx = pref[lim] * mx % mod;
	//cout << mx << endl;
	return mx;
}

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

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:48:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   48 |  return mx;
      |         ^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:74:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   74 |  return mx;
      |         ^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:100:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  100 |  return mx;
      |         ^~

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