oj.uz

Submission #617422

# Submission time Handle Problem Language Result Execution time Memory
617422 2022-08-01T11:16:55 Z amunduzbaev Distributing Candies (IOI21_candies) C++17
0 / 100
 124 ms 8892 KB 
#include "candies.h"

#include "bits/stdc++.h"
using namespace std;

#ifndef EVAL
#include "grader.cpp"
#endif

typedef long long ll;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
	int n = c.size();
	int q = l.size();
	
	vector<ll> a(n);
	for(int i=0;i<q;i++){
		a[l[i]] += v[i];
		if(r[i] + 1 < n) a[r[i] + 1] -= v[i];
	}
	
	vector<int> b(n);
	for(int i=0;i<n;i++){
		b[i] = min(a[i], 1ll * c[i]);
	}
	
	return b;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 124 ms 8892 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -