제출 #468955

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
468955		ymm	사탕 분배 (IOI21_candies)	C++17	38 / 100	5043 ms	17948 KiB

candies

///
///   Let the voice of love take you higher!
///

#define _USE_MATH_DEFINES
#define FAST ios::sync_with_stdio(false),cin.tie(0);
#include <bits/stdc++.h>
#define Loop(x, l, r) for(int x = (l); x < (r); ++x)
#define LoopR(x, l, r) for(int x = (r)-1; x >= (l); --x)
#define all(x) x.begin(), x.end()
#define Kill(x) exit((cout << (x) << '\n', 0))
#define YN(flag) ((flag)? "YES": "NO")
#define F first
#define S second
typedef          long long   ll;
typedef unsigned long long  ull;
typedef std::pair<int,int>  pii;
typedef std::pair<ll ,ll >  pll;
using namespace std;

#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx")
typedef vector<int> vec;

const int N = 200'010;
int a[N], c[N], l[N], r[N], v[N];
int n, q;

vec distribute_candies(vec cc, vec ll, vec rr, vec vv)
{
    n = cc.size();
    q = ll.size();
    Loop(i,0,n) c[i] = cc[i];
    Loop(i,0,q) l[i] = ll[i], r[i] = rr[i], v[i] = vv[i];
    Loop(i,0,q)
    {
        int v = ::v[i], l = ::l[i], r = ::r[i]+1;
        if(i&1)
        {
            if(v <= 0)
                Loop(j,l,r)
                    a[j] = a[j]+v<0?0:a[j]+v;
            else
                Loop(j,l,r)
                    a[j] = a[j]+v>c[j]?c[j]:a[j]+v;
        }
        else
        {
            if(v <= 0)
                LoopR(j,l,r)
                    a[j] = a[j]+v<0?0:a[j]+v;
            else
                LoopR(j,l,r)
                    a[j] = a[j]+v>c[j]?c[j]:a[j]+v;
        }
    }
    vec ans(n);
    Loop(i,0,n) ans[i] = a[i];
    return ans;
}

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