제출 #672325

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
672325		Trisanu_Das	말 (IOI15_horses)	C++17	17 / 100	31 ms	24148 KiB

horses

#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
 
int n;
ll x[500001], y[500001];
 
int solve(){
  ll pref = 1, hrspr = 1, last = 0, ans = 0;
  for(int i = 0; i < n; i++){
    hrspr *= x[i];
    pref = pref * x[i] % MOD;
    if((long double)y[i] * hrspr > last){
      ans = pref * y[i] % MOD; hrspr = 1; last = 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 solve();
}
 
int updateX(int pos, int val){
  x[pos] = val; solve();
}
int updateY(int pos, int val){
  y[pos] = val; solve();
}

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

horses.cpp: In function 'int solve()':
horses.cpp:18:10: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   18 |   return ans;
      |          ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:29:1: warning: no return statement in function returning non-void [-Wreturn-type]
   29 | }
      | ^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:32:1: warning: no return statement in function returning non-void [-Wreturn-type]
   32 | }
      | ^

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