Submission #482889

#	Time	Username	Problem	Language	Result	Execution time	Memory
482889		MilosMilutinovic	사탕 분배 (IOI21_candies)	C++17	3 / 100	100 ms	7356 KiB

candies

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=201000;
int n,q;
VI distribute_candies(VI c,VI l,VI r,VI v) {
	n=SZ(c),q=SZ(v);
	VI a(n);
	if (n<=2000&&q<=2000) {
		rep(i,0,q) rep(j,l[i],r[i]+1) a[j]+=v[i],a[j]=max(a[j],0),a[j]=min(a[j],c[j]);
		return a;
	}
	if (*min_element(all(v))>=0) {
		ll tot=0;
		rep(i,0,q) tot+=v[i];
		rep(i,0,n) a[i]=min((ll)c[i],tot);
		return a;
	}
}

Compilation message (stderr)

candies.cpp: In function 'VI distribute_candies(VI, VI, VI, VI)':
candies.cpp:37:1: warning: control reaches end of non-void function [-Wreturn-type]
   37 | }
      | ^

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