# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154223 | 2019-09-19T11:35:46 Z | mhy908 | Calvinball championship (CEOI15_teams) | C++14 | 4 ms | 504 KB |
#include <bits/stdc++.h> #define mod 1000007 using namespace std; typedef long long LL; int n; int arr[10010], maxx; int newp[10010]; LL dp[10010]; LL temp=1, t2; LL power(LL a, LL b) { if(b==0)return 1; LL ret=power(a, b/2); if(b%2)return ret*ret%mod*a%mod; return ret*ret%mod; } int main() { scanf("%d", &n); for(int i=1; i<=n; i++){ scanf("%d", &arr[i]); maxx=max(maxx, arr[i]); newp[i]=maxx; } dp[n+1]=1; t2=n+1; for(int i=n; i>=1; i--){ if(newp[i-1]==newp[i]){ temp+=(arr[i]-1)*power(newp[i], t2-i-1); } else{ temp+=(arr[i]-1)*power(newp[i], t2-i-1); dp[i]=temp*dp[t2]%mod; t2=i; temp=1; } } printf("%lld", dp[1]); } // 16603
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 380 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Incorrect | 2 ms | 376 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 504 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 504 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |