제출 #888633

#제출 시각아이디문제언어결과실행 시간메모리
888633irmuun사탕 분배 (IOI21_candies)C++17
3 / 100
5099 ms13368 KiB
#include<bits/stdc++.h> #include "candies.h" using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() vector<int>distribute_candies(vector<int>c,vector<int>l,vector<int>r,vector<int>v){ vector<int>ans(c.size(),0); for(int i=0;i<l.size();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:15:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     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...