Submission #342770

#TimeUsernameProblemLanguageResultExecution timeMemory
342770monus1042Horses (IOI15_horses)C++17
17 / 100
1575 ms12496 KiB
#include "horses.h" #include <bits/stdc++.h> using namespace std; typedef unsigned long long ll; typedef pair<int,int> ii; int n; vector<ll> x, y; const ll MOD = 1000000007; int solve(){ ll acc = 1, best = 0; for (int i=0; i<n; i++){ acc = acc * x[i]; best = max(best, acc * y[i]); } int answerint = best%MOD; return answerint; } int init(int N, int X[], int Y[]) { n = N; for (int i=0; i<n; i++) x.push_back(X[i]), y.push_back(Y[i]); return solve(); } int updateX(int pos, int val) { x[pos] = val; return solve(); } int updateY(int pos, int val) { y[pos] = val; return solve(); }

Compilation message (stderr)

horses.cpp: In function 'int solve()':
horses.cpp:18:22: warning: conversion from 'll' {aka 'long long unsigned int'} to 'int' may change value [-Wconversion]
   18 |  int answerint = best%MOD;
      |                  ~~~~^~~~
#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...