제출 #819908

#제출 시각아이디문제언어결과실행 시간메모리
819908Marco_EscandonDistributing Candies (IOI21_candies)C++17
3 / 100
5086 ms14032 KiB
#include<bits/stdc++.h> typedef long long ll; using namespace std; std::vector<int> distribute_candies(std::vector<int> cad, std::vector<int> l, std::vector<int> r, std::vector<int> v) { ll t[cad.size()+5]={}; ll n=cad.size(); for(int i=0; i<l.size(); i++) { for(int j=l[i]; j<=r[i]; j++) { t[j]+=v[i]; t[j]=max(0LL,t[j]); t[j]=min((ll)cad[j],t[j]); } } cad[0]=min(t[0],(ll)cad[0]); for(int i=1; i<n; i++) { cad[i]=min(t[i],(ll)cad[i]); } return cad; }

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

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:8:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     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...