Submission #1206696

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206696		tkm_algorithms	Distributing Candies (IOI21_candies)	C++20	0 / 100	62 ms	9028 KiB

candies

/**
*    In the name of Allah
*    We are nothing and you're everything
**/
#include <bits/stdc++.h>
#include "candies.h" 
using namespace std;
using ll = long long;
using ull = uint64_t;
 
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
//#define int long long
 
const char nl = '\n';
const int N = 2e5+1;
const ll inf = 0x3f3f3f3f3f3f3f3fll;
const int mod = 1e9+7;

std::vector<int> distribute_candies(vector<int> c, vector<int> l,
                                    vector<int> r, vector<int> v) {
    int n = sz(c), q = sz(r);
    vector<int> s(n);
    vector<ll> p(n);
    for (int i = 0; i < q; ++i) {
		if (r[i] != n-1)p[r[i]+1] -= (ll)v[i];
		p[l[i]] += (ll)v[i];
	}
	
	//int sum = 0;
	for (int i = 0; i < n; ++i) {
		if (i > 0)p[i] += p[i-1];
		p[i] = min(max(p[i], 0ll), (ll)c[i]);
		s[i] = p[i];
		//s[i] = (int)min(max(p[i], 0ll), (ll)c[i]);
		
	}
    return s;
}

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