제출 #1238581

#제출 시각아이디문제언어결과실행 시간메모리
1238581matisito모자이크 (IOI24_mosaic)C++20
7 / 100
75 ms13124 KiB
#include "mosaic.h" #include <iostream> #include <iomanip> #include <string> #include <math.h> #include <algorithm> #include <cstring> #include <numeric> #include <vector> #include <bitset> #include <map> #include <set> #include <queue> #include <deque> #include <stack> #include <unordered_map> #include <unordered_set> #include <cassert> using namespace std; #define dbg(x) cerr<<#x<<": "<<x<<"\n"; /* ValeNotta lover */ vector<long long> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R) { int n=(int)X.size(); // vector<vector<long long>>dp(n+1, vector<long long>(n+1)); vector<long long>pref; pref.push_back(0); for(int j=1 ; j<=n ; j++){ pref.push_back(pref.back()+X[j-1]); } n=(int)T.size(); vector<long long>ans(n); for(int i=0 ; i<n ; i++){ T[i]++; B[i]++; L[i]++; R[i]++; ans[i]=pref[R[i]]-pref[L[i]-1]; } 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...