제출 #436407

#제출 시각아이디문제언어결과실행 시간메모리
436407PiejanVDCDistributing Candies (IOI21_candies)C++17
0 / 100
129 ms8108 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) {
    vector<int>sum(c.size()+1,0);
    for(int i = 0 ; i < v.size() ; i++) {
        sum[l[i]]+=v[i],sum[r[i]+1]-=v[i];
    }
    vector<int>ans(c.size());
    int current_sum=0;
    for(int i = 0 ; i < c.size() ; i++) {
            current_sum+=sum[i];
            ans[i] = min(c[i],current_sum);
    }
    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:7:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |     for(int i = 0 ; i < v.size() ; i++) {
      |                     ~~^~~~~~~~~~
candies.cpp:12:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for(int i = 0 ; i < c.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...