Submission #441780

# Submission time Handle Problem Language Result Execution time Memory
441780 2021-07-06T07:12:42 Z baluteshih Distributing Candies (IOI21_candies) C++17
0 / 100
127 ms 7348 KB
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n = c.size();
    vector<int> rt(n + 1, 0);
    for (int i = 0; i < SZ(l); ++i)
        rt[l[i]] += v[i], rt[r[i] + 1] -= v[i];
    rt.pop_back();
    for (int i = 1; i < n; ++i)
        rt[i] += rt[i - 1];
    for (int i = 0; i < n; ++i)
        rt[i] = min(rt[i], c[i]);
    return rt;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 127 ms 7348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -