제출 #1308582

#제출 시각아이디문제언어결과실행 시간메모리
1308582SmuggingSpun사탕 분배 (IOI21_candies)C++20
3 / 100
5091 ms7408 KiB
#include "candies.h"
#include<bits/stdc++.h>
using namespace std;
vector<int>distribute_candies(vector<int>c, vector<int>l, vector<int>r, vector<int>v){
	int n = c.size(), q = l.size();
	if(max(n, q) <= 2000){
		vector<int>ans(n, 0);
		for(int i = 0; i < q; i++){
			for(int j = l[i]; j <= r[i]; j++){
				if(v[i] > 0){
					ans[j] = min(c[j], ans[j] + v[i]);
				}
				else{
					ans[j] = max(0, ans[j] + v[i]);
				}
			}
		}
		return ans;
	}
}

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

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^
#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...