제출 #251554

#제출 시각아이디문제언어결과실행 시간메모리
251554DavidDamian말 (IOI15_horses)C++11
0 / 100
38 ms8184 KiB
//#include "horses.h" #include<bits/stdc++.h> using namespace std; #define mod 1000000007 typedef long long ll; int init(int N, int Y[], int X[]) { ll maximum=0; ll product=1; for(int i=0;i<N;i++){ product*=(ll)X[i]; maximum=max(maximum,(ll)((ll)Y[i]*product)%mod); maximum%=mod; } return maximum; } int updateX(int pos, int val) { return 0; } int updateY(int pos, int val) { return 0; }

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

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:14:9: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  return maximum;
         ^~~~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:17:17: warning: unused parameter 'pos' [-Wunused-parameter]
 int updateX(int pos, int val) {
                 ^~~
horses.cpp:17:26: warning: unused parameter 'val' [-Wunused-parameter]
 int updateX(int pos, int val) {
                          ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:21:17: warning: unused parameter 'pos' [-Wunused-parameter]
 int updateY(int pos, int val) {
                 ^~~
horses.cpp:21:26: warning: unused parameter 'val' [-Wunused-parameter]
 int updateY(int pos, int val) {
                          ^~~
#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...