Submission #548624

#	Time	Username	Problem	Language	Result	Execution time	Memory
548624		cig32	Distributing Candies (IOI21_candies)	C++17	0 / 100	5047 ms	14504 KiB

candies

#include "candies.h"
#include "bits/stdc++.h"
using namespace std;

#include <cassert>
#include <cstdio>
#include <vector>


std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
  int n = c.size();
  std::vector<int> s(n);
  int q = l.size();
  int p[n], invp[n];
  pair<int, int> d[n];
  for(int i=0; i<n; i++) d[i] = {c[i], i};
  sort(d, d + n);
  for(int i=0; i<n; i++) p[i] = 0, invp[i] = d[i].first;
  for(int i=0; i<q; i++) {
    for(int j=0; j<n; j++) {
      p[j] += v[i];
      invp[j] -= v[i];
      if(p[j] < 0) {
        p[j] = 0, invp[j] = d[j].first;
      }
      if(invp[j] < 0) {
        invp[j] = 0, p[j] = d[j].first;
      }
    }
  }
  for(int i=0; i<n; i++) s[d[i].second] = p[i];
  return s;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 8
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 33