Submission #1350049

#TimeUsernameProblemLanguageResultExecution timeMemory
1350049ahmetlbktd4Mosaic (IOI24_mosaic)C++20
7 / 100
54 ms12800 KiB
#include "bits/stdc++.h"
#define ll long long
using namespace std;

vector <ll> 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();
    vector <ll> pr(n);
    pr[0] = x[0];
    for (int i = 1;i < n;i++){
        pr[i] = pr[i-1] + x[i];
    }
    vector <ll> p(q);
    for (int k = 0;k < q;k++){
        if (l[k])
        p[k] = pr[r[k]]-pr[l[k]-1];
        else p[k] = pr[r[k]];
    }
    return p;
}

// int main(){
//     int n;
//     cin >> n;
//     vector <int> x(n),y(n);
//     for (int i = 0;i < n;i++){
//         cin >> x[i];
//     }
//     for (int i = 0;i < n;i++){
//         cin >> y[i];
//     }
//     int q;
//     cin >> q;
//     vector <int> t(q),b(q),l(q),r(q);
//     for (int i = 0;i < q;i++){
//         cin >> t[i] >> b[i] >> l[i] >> r[i];
//     }
//     vector <ll> p = mosaic(x,y,t,b,l,r);
//     for (int i = 0;i < q;i++){
//         cout << p[i] << "\n";
//     }
// }
#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...