Submission #618091

#	Time	Username	Problem	Language	Result	Execution time	Memory
618091		BalintR	Distributing Candies (IOI21_candies)	C++17	38 / 100	5068 ms	8932 KiB

candies

#include <vector>
#include <immintrin.h>
using namespace std;
#pragma GCC target "avx2"
#pragma GCC optimize "Ofast"

typedef __m256i m256;
typedef vector<int> vi;
#define SZ(v) ((int) (v).size())

const int MN = 2e5;
int n, q;
int arr[MN], cap[MN];

vi distribute_candies(vi cIn, vi lIn, vi rIn, vi vIn){
    n = SZ(cIn);
    q = SZ(lIn);
    for(int i = 0; i < n; i++) cap[i] = cIn[i];

    for(int i = 0; i < q; i++){
        int l = lIn[i], r = rIn[i]+1, v = vIn[i];
        int lb = (l+7)/8, rb = r/8;
        m256 vVec = _mm256_set1_epi32(v);
        m256 zeroVec = _mm256_setzero_si256();

        if(r-l < 16){
            for(int j = l; j < r; j++) arr[j] = max(0, min(cap[j], arr[j] + v));
            continue;
        }
        for(int j = l; j < lb*8; j++) arr[j] = max(0, min(cap[j], arr[j] + v));
        for(int j = rb*8; j < r; j++) arr[j] = max(0, min(cap[j], arr[j] + v));

        if(v < 0){
            for(int j = lb; j < rb; j++){
                m256 aVec = _mm256_load_si256((m256*) arr + j);
                m256 res = _mm256_max_epi32(zeroVec, _mm256_add_epi32(aVec, vVec));
                _mm256_store_si256((m256*) arr + j, res);
            }
        }
        else {
            for(int j = lb; j < rb; j++){
                m256 aVec = _mm256_load_si256((m256*) arr + j);
                m256 cVec = _mm256_load_si256((m256*) cap + j);
                m256 res = _mm256_min_epi32(cVec, _mm256_add_epi32(aVec, vVec));
                _mm256_store_si256((m256*) arr + j, res);
            }
        }
    }

    vi res(n);
    for(int i = 0; i < n; i++) res[i] = arr[i];
    return res;
}

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