oj.uz

답안 #1043654

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1043654 2024-08-04T13:01:13 Z 42kangaroo 사탕 분배 (IOI21_candies) C++17
8 / 100
 65 ms 9044 KB 
#include "candies.h"
#include "bits/stdc++.h"

using namespace std;


std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
	int n = c.size();
	std::vector<long long> s(n, 0);
	for (int i = 0; i < l.size(); ++i) {
		s[l[i]] += v[i];
		if (r[i] + 1 < n) s[r[i] + 1] -= v[i];
	}
	for (int i = 1; i < n; ++i) {
		s[i] += s[i - 1];
	}
	for (int i = 0; i < n; ++i) {
		s[i] = min(s[i], (long long)c[i]);
	}
	return vector<int>(s.begin(), s.end());
}

Compilation message

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:11:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |  for (int i = 0; i < l.size(); ++i) {
      |                  ~~^~~~~~~~~~

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 8952 KB Output is correct
2 Correct 51 ms 9040 KB Output is correct
3 Correct 51 ms 9044 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -