Submission #1211469

#	Time	Username	Problem	Language	Result	Execution time	Memory
1211469		sula2	Mosaic (IOI24_mosaic)	C++20	7 / 100	77 ms	11336 KiB

mosaic

#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define popcount(x) __builtin_popcountll(x)
using namespace std;
using namespace chrono;

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();
    int q = T.size();
    for (int i = 1; i < n; i++) X[i] += X[i-1];
    vector<long long> ans(q);
    for (int i = 0; i < q; i++) {
        ans[i] = X[R[i]];
        if (L[i] > 0)
            ans[i] -= X[L[i] - 1];
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 7 / 7
• Subtask 4: 0 / 10
• Subtask 5: 0 / 8
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19
• Subtask 8: 0 / 22