Submission #437815

#	Time	Username	Problem	Language	Result	Execution time	Memory
437815		ymm	Distributing Candies (IOI21_candies)	C++17	38 / 100	5050 ms	17156 KiB

candies

///
///    "Excuse me... What did you say about my hair?!"
///
///                                    -Josuke Higashikata

#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;

#define Do(v) {a[j]=a[j]+v;a[j]=a[j]<0?0:a[j];a[j]=a[j]>c[j]?c[j]:a[j];}

vec distribute_candies(vec cc, vec ll, vec rr, vec vv)
{
    n = cc.size();
    q = ll.size();
    while(q%2)
    {
        ++q;
        ll.push_back(0);
        rr.push_back(1);
        vv.push_back(0);
    }
    Loop(i,0,n) c[i] = cc[i];
    Loop(i,0,q) l[i] = ll[i], r[i] = rr[i], v[i] = vv[i];
    for(int i=0;i<q;i+=2)
    {
        int v0=v[i+0], l0=l[i+0], r0=r[i+0]+1;
        int v1=v[i+1], l1=l[i+1], r1=r[i+1]+1;
        if(false){}
        else if(l0<=r0&&r0<=l1&&l1<=r1&&1){
                for(int j=l0;j<r0;++j){
                        Do(v0); }
                for(int j=r0;j<l1;++j){
                                }
                for(int j=l1;j<r1;++j){
                        Do(v1); }
        }
        else if(l0<=l1&&l1<=r0&&r0<=r1&&1){
                for(int j=l0;j<l1;++j){
                        Do(v0); }
                for(int j=l1;j<r0;++j){
                        Do(v0);Do(v1);  }
                for(int j=r0;j<r1;++j){
                        Do(v1); }
        }
        else if(l0<=l1&&l1<=r1&&r1<=r0&&1){
                for(int j=l0;j<l1;++j){
                        Do(v0); }
                for(int j=l1;j<r1;++j){
                        Do(v0);Do(v1);  }
                for(int j=r1;j<r0;++j){
                        Do(v0); }
        }
        else if(l1<=l0&&l0<=r0&&r0<=r1&&1){
                for(int j=l1;j<l0;++j){
                        Do(v1); }
                for(int j=l0;j<r0;++j){
                        Do(v0);Do(v1);  }
                for(int j=r0;j<r1;++j){
                        Do(v1); }
        }
        else if(l1<=l0&&l0<=r1&&r1<=r0&&1){
                for(int j=l1;j<l0;++j){
                        Do(v1); }
                for(int j=l0;j<r1;++j){
                        Do(v0);Do(v1);  }
                for(int j=r1;j<r0;++j){
                        Do(v0); }
        }
        else if(l1<=r1&&r1<=l0&&l0<=r0&&1){
                for(int j=l1;j<r1;++j){
                        Do(v1); }
                for(int j=r1;j<l0;++j){
                                }
                for(int j=l0;j<r0;++j){
                        Do(v0); }
        }
    }
    vec ans(n);
    Loop(i,0,n) ans[i] = a[i];
    return ans;
}

/*int main()
{
    //auto ans = distribute_candies({10, 15, 13}, {0, 0}, {2, 1}, {20, -11});
    //for(int x : ans) cout << x << ' ';
    /*vec c(200000, 1e9);
    vec l(200000, 0);
    vec r(200000, 199999);
    vec v(200000, 12);
    distribute_candies(c,l,r,v);*/
    /*printf("int v0=v[i+0], l0=l[i+0], r0=r[i+0]+1;\n");
    printf("int v1=v[i+1], l1=l[i+1], r1=r[i+1]+1;\n");
    //printf("int v2=v[i+2], l2=l[i+2], r2=r[i+2]+1;\n");
    printf("if(false){}\n");
    int p[4] = {0, 0, 1, 1};
    do
    {
        int a = 0;
        printf("else if(");
        Loop(i,0,4-1)
        {
            printf("%c%d",a&(1<<p[i])?'r':'l',p[i]);
            a ^= (1<<p[i]);
            printf("<=%c%d&&",a&(1<<p[i+1])?'r':'l',p[i+1]);
        }
        printf("1){\n");
        a = 0;
        Loop(i,0,4-1)
        {
            printf("\tfor(int j=%c%d;",a&(1<<p[i])?'r':'l',p[i]);
            a ^= (1<<p[i]);
            printf("j<%c%d;++j){\n\t\t",a&(1<<p[i+1])?'r':'l',p[i+1]);
            Loop(j,0,2)
                if(a&(1<<j))
                    printf("Do(v%d);", j);
            printf("\t}\n");
        }
        printf("}\n");
    }while(next_permutation(p, p+4));
}*/

Compilation message (stderr)

candies.cpp:108:5: warning: "/*" within comment [-Wcomment]
  108 |     /*vec c(200000, 1e9);
      |

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