Submission #1195337

#TimeUsernameProblemLanguageResultExecution timeMemory
1195337DeathIsAweDistributing Candies (IOI21_candies)C++20
0 / 100
62 ms10564 KiB
#include "candies.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n = c.size(), q = l.size();
    vector<int> s(n);
    vector<ll> start(n), end(n);
    for (int i=0;i<n;i++) {
        s[i] = 0;
        start[i] = 0;
    }
    

    for (int i=0;i<q;i++) {
        start[l[i]] += v[i];
        end[r[i]] += v[i];
    }
    int temp = 0;
    for (int i=0;i<n;i++) {
        temp += start[i];
        s[i] = temp;
        temp -= end[i];
    }
    return s;
}
#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...