Submission #1312125

#TimeUsernameProblemLanguageResultExecution timeMemory
1312125eri16Mosaic (IOI24_mosaic)C++20
7 / 100
74 ms13464 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; vector<ll> mosaic(vector<int> X, vector<int> Y,vector<int> T, vector<int> B,vector<int> L, vector<int> R){ ll n = X.size(); vector <ll> dp(n+1,0); dp[1]=X[0]; for (int i=2; i<=n; i++){ dp[i]=dp[i-1]+X[i-1]; } vector <ll> ans; ll q = T.size(); ll t,b,l,r; for (int i=0; i<q; i++){ t=T[i]; b=B[i]; l=L[i]; r=R[i]; ans.push_back(dp[r+1]-dp[l]); } 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...