Submission #1236478

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236478		AlperenT_	Distributing Candies (IOI21_candies)	C++20	8 / 100	61 ms	9408 KiB

candies

#include <bits/stdc++.h> 
#include "candies.h"
#pragma GCC optimize("O3,unroll-loops") 
#pragma GCC target("avx2") 
#define pb push_back
#define F first
#define pii pair<int,int> 
#define all(a) a.begin(),a.end()
#define S second 
#define sz(a) (int)a.size()
#define rep(i , a , b) for(int i = (a) ; i <= (b) ; i++)
#define per(i , a , b) for(int i = (a) ; i >= (b) ; i--)
#define ld double
#define ll long long 
using namespace std ;
const int maxn = 2e6 + 10 , inf = 1e9+ 10 , mod = 998244353;
ll a[maxn] ,p[maxn];
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,std::vector<int> r, std::vector<int> v){
    rep(i , 0 ,sz(l)-1){
        p[l[i]] += v[i] ;
        p[r[i]+1]-=v[i] ;
    }    
    rep(i , 1 ,sz(c)-1){
        p[i] += p[i-1]; 
    }
    vector <int> ans ;
    rep(i ,0 ,sz(c)-1)ans.pb(min(1ll*c[i] , p[i]))  ;
    return ans;
}

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