제출 #819910

#제출 시각아이디문제언어결과실행 시간메모리
819910Marco_EscandonDistributing Candies (IOI21_candies)C++17
8 / 100
80 ms12128 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++) { t[l[i]]+=v[i]; t[r[i]+1]-=v[i]; } cad[0]=min(t[0],(ll)cad[0]); for(int i=1; i<n; i++) { t[i]+=t[i-1]; 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:9:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     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...