oj.uz

Submission #966124

# Submission time Handle Problem Language Result Execution time Memory
966124 2024-04-19T12:08:00 Z AkibAzmain Distributing Candies (IOI21_candies) C++17
8 / 100
 79 ms 12884 KB 
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

std::vector<int> distribute_candies (std::vector<int> c, std::vector<int> l,
                                     std::vector<int> r, std::vector<int> v)
{
  ll n = c.size(), q = v.size ();
  vector < ll > s (n + 1);
  for (int i = 0; i < q; ++i)
    s[l[i]] += v[i], s[r[i] + 1] -= v[i];
  s.pop_back ();
  for (int i = 1; i < n; ++i) s[i] += s[i - 1];
  vector < int > ans (n);
  for (int i = 0; i < n; ++i) ans[i] = min (s[i], (ll) c[i]);
  return ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 8948 KB Output is correct
2 Correct 77 ms 12884 KB Output is correct
3 Correct 76 ms 12880 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -