Submission #1238634

#TimeUsernameProblemLanguageResultExecution timeMemory
1238634chinesegenius69420Mosaic (IOI24_mosaic)C++20
7 / 100
94 ms13500 KiB
#include <bits/stdc++.h> #include "mosaic.h" using namespace std; vector<long long> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R) { int n = X.size(), q = T.size(); vector<long long> ans, pref(n + 1); for(int i = 0; i < n; i++){ pref[i + 1] = X[i] + pref[i]; } for(int i = 0; i < q; i++){ ans.push_back(pref[R[i] + 1] - pref[L[i]]); } 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...