Submission #1121772

#TimeUsernameProblemLanguageResultExecution timeMemory
1121772vjudge1Calvinball championship (CEOI15_teams)C++17
0 / 100
2 ms592 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ld double


const int INF = 1e18;
const int mod = 12345;
const int sz = 5e5 + 5;

signed main()
{
   ios_base::sync_with_stdio(0);cin.tie(0);
   int n;
   cin >> n;
   vector < int > a(n);
   vector < int > dp(n , 0);
   for(int i = 0;i < n;i++)
   {
      cin >> a[i];
   }  
   int f = (n * (n + 1)) / 2;
   dp[1] = 1;
   for(int i = 1;i < n;i++)
   {
      dp[i] = dp[i - 1] + ((i + 1) * a[i]);
   }
   dp[n - 1]++;
   cout << dp[n - 1] - f << endl;
}
#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...
#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...