oj.uz

Submission #482896

# Submission time Handle Problem Language Result Execution time Memory
482896 2021-10-26T16:55:50 Z MilosMilutinovic Distributing Candies (IOI21_candies) C++17
11 / 100
 160 ms 21668 KB 
#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 qs2[N];
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;
	}
	bool sb2=true;
	rep(i,0,q) if (v[i]<0) sb2=false;
	if (sb2) {
		rep(i,0,q) {
			qs2[l[i]].pb(v[i]);
			qs2[r[i]+1].pb(-v[i]);
		}
		ll tot=0;
		rep(i,0,n) {
			for (auto x:qs2[i]) tot+=x;
			a[i]=min((ll)c[i],tot);
		}
		return a;
	}
}

Compilation message

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

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4940 KB Output is correct
2 Correct 2 ms 4940 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 5 ms 5068 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 17576 KB Output is correct
2 Correct 155 ms 21668 KB Output is correct
3 Correct 160 ms 21576 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Incorrect 58 ms 11984 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Incorrect 58 ms 11372 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4940 KB Output is correct
2 Correct 2 ms 4940 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 5 ms 5068 KB Output is correct
6 Correct 151 ms 17576 KB Output is correct
7 Correct 155 ms 21668 KB Output is correct
8 Correct 160 ms 21576 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Incorrect 58 ms 11984 KB Output isn't correct
11 Halted 0 ms 0 KB -