제출 #137318

#제출 시각아이디문제언어결과실행 시간메모리
137318eohomegrownapps말 (IOI15_horses)C++14
17 / 100
1563 ms12024 KiB
#include "horses.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll md = 1000000007; vector<ll> x; vector<ll> y; ll n; int query(){ ll mx = 1; ll current = 1; for (ll i = 0; i<n; i++){ current*=x[i]; current%=md; mx=max(mx,(current*y[i])%md); } return mx; } int init(int N, int X[], int Y[]) { n=N; x.resize(n); y.resize(n); for (ll i = 0; i<n; i++){ x[i]=X[i]; y[i]=Y[i]; } return query(); } int updateX(int pos, int val) { x[pos]=val%md; return query(); } int updateY(int pos, int val) { y[pos]=val%md; return query(); }

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

horses.cpp: In function 'int query()':
horses.cpp:18:9: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  return mx;
         ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...