제출 #1197653

#제출 시각아이디문제언어결과실행 시간메모리
1197653joker말 (IOI15_horses)C++20
17 / 100
1596 ms8252 KiB
#include "horses.h" #include<bits/stdc++.h> using namespace std; int MD = 1e9+7; #define ll long long int X[500005]; int Y[500005]; int N; int updateX(int pos,int val) { X[pos] = val; return init(N,X,Y); } int updateY(int pos,int val) { Y[pos] = val; return init(N,X,Y); } int init(int n,int x[],int y[]) { N = n; ll cnt = 1; ll ans = 0; for(int i=0;i<n;i++) { X[i] = x[i]; Y[i] = y[i]; cnt = (cnt*x[i])%MD; ans = max(cnt*y[i],ans) % MD; } return ans % MD; }
#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...