제출 #310592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
310592		juggernaut	말 (IOI15_horses)	C++14	0 / 100	15 ms	8448 KiB

horses

#include"horses.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x[1005],y[1005],n,mod=1e9+7;
ll solve(){
    ll res=0,i,cnt=1;
    double lg=0,ans=0;
    for(i=0;i<n;i++){
        cnt=(cnt*x[i])%mod;
        lg+=log(x[i]);
        if(lg+log(y[i])>ans){
            ans=lg+log(y[i]);
            res=(cnt*y[i])%mod;
        }
    }
    return res;
}
int init(int N,int X[],int Y[]){
	n=N;
	copy(X,X+n,x);
	copy(Y,Y+n,y);
	return solve();
}
int updateX(int pos,int val){
	x[pos]=val;
	return solve();
}
int updateY(int pos,int val){
    y[pos]=val;
	return solve();
}

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

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:23:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   23 |  return solve();
      |         ~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:27:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   27 |  return solve();
      |         ~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:31:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   31 |  return solve();
      |         ~~~~~^~

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