제출 #1320944

#제출 시각아이디문제언어결과실행 시간메모리
1320944unknown모자이크 (IOI24_mosaic)C++20
7 / 100
75 ms12720 KiB
#include <bits/stdc++.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(); vector<long long> partials(N); partial_sum(X.begin(), X.end(), partials.begin()); int Q = T.size(); vector<long long> C(Q); for (int i = 0; i < Q; i++) { C[i] = partials[R[i]] - (L[i] == 0 ? 0 : partials[L[i]-1]); } return C; }
#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...