제출 #1245836

#제출 시각아이디문제언어결과실행 시간메모리
1245836vtnoo말 (IOI15_horses)C++20
0 / 100
1595 ms8256 KiB
#pragma once #include <bits/stdc++.h> using namespace std; const int mod=1e9+7, MAXN=500005; int X[MAXN], Y[MAXN], N; int calc(){ int j=0; long long prod=0; for(int i=1;i<N;i++){ prod*=X[i]; if(Y[j]<Y[i]*prod){ j=i; prod=0; } } long long ans=1; for(int i=0;i<=j;i++){ ans=(ans*X[i])%mod; } ans=(ans*Y[j])%mod; return ans; } int init(int n, int x[], int y[]){ N=n; for(int i=0;i<n;i++){ X[i]=x[i]; Y[i]=y[i]; } return calc(); } int updateX(int pos, int val){ X[pos]=val; return calc(); } int updateY(int pos, int val){ Y[pos]=val; return calc(); }

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

horses.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#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...