제출 #1038057

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1038057		ArthuroWich	말 (IOI15_horses)	C++17	17 / 100	1528 ms	12180 KiB

horses

#include "horses.h"
#include<bits/stdc++.h>
using namespace std;
long long n, x[500005], y[500005], mod = 1e9+7;
long long query() {
	long long int ans = 0, co = 1;
	for (int i = 0; i < n; i++) {
		co *= x[i];
		ans = max(ans, co*y[i]);
	}
	return ans;
}
int init(int N, int X[], int Y[]) {
	n = N;
	for (int i = 0; i < n; i++) {
		x[i] = X[i];
		y[i] = Y[i];
	}
	return query() % mod;
}
int updateX(int pos, int val) {	
	x[pos] = val;
	return query() % mod;
}
int updateY(int pos, int val) {
	y[pos] = val;
	return query() % mod;
}

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

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:19:17: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   19 |  return query() % mod;
      |         ~~~~~~~~^~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:23:17: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   23 |  return query() % mod;
      |         ~~~~~~~~^~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:27:17: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   27 |  return query() % mod;
      |         ~~~~~~~~^~~~~

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