제출 #707688

#제출 시각아이디문제언어결과실행 시간메모리
707688MODDI말 (IOI15_horses)C++14
34 / 100
1579 ms12524 KiB
#include "horses.h" #include <bits/stdc++.h> #define ll long long #define pb push_back #define vi vector<int> #define vl vector<ll> using namespace std; const int mod = 1e9 + 7; vi X, Y; ll mul(ll a, ll b){ return (a * b) % mod; } int N; int init(int n, int x[], int y[]){ N = n; for(int i = 0; i < n; i++) X.pb(x[i]); for(int i = 0; i < n; i++) Y.pb(y[i]); ll ans = 0, mult = 1, pref=1, last = 0; for(int i = 0; i < N; i++){ pref *= X[i]; mult = mul(mult, X[i]); mult %= mod; ll cur_sell = mul(mult, Y[i]); cur_sell %= mod; if(cur_sell < 0) assert(false); if(pref * Y[i] > last){ ans = mult * Y[i] % mod; pref = 1; last = Y[i]; } } if(ans <= 0) assert(false); return ans; } int updateX(int pos, int val){ X[pos] = val*1ll; ll ans = 0, mult = 1, pref=1, last = 0; for(int i = 0; i < N; i++){ pref *= X[i]; mult = mul(mult, X[i]); mult %= mod; ll cur_sell = mul(mult, Y[i]); cur_sell %= mod; if(cur_sell < 0) assert(false); if(pref * Y[i] > last){ ans = mult * Y[i] % mod; pref = 1; last = Y[i]; } } if(ans <= 0) assert(false); return ans; } int updateY(int pos, int val){ Y[pos] = val*1LL; ll ans = 0, mult = 1, pref=1, last = 0; for(int i = 0; i < N; i++){ pref *= X[i]; mult = mul(mult, X[i]); mult %= mod; ll cur_sell = mul(mult, Y[i]); cur_sell %= mod; if(cur_sell < 0) assert(false); if(pref * Y[i] > last){ ans = mult * Y[i] % mod; pref = 1; last = Y[i]; } } if(ans <= 0) assert(false); return ans; }

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

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:36:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   36 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:55:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   55 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:74:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   74 |  return ans;
      |         ^~~
#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...