제출 #1043653

#제출 시각아이디문제언어결과실행 시간메모리
104365342kangaroo사탕 분배 (IOI21_candies)C++17
0 / 100
60 ms7416 KiB
#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<int> 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], c[i]);
	}
    return s;
}

컴파일 시 표준 에러 (stderr) 메시지

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