제출 #1051475

#제출 시각아이디문제언어결과실행 시간메모리
1051475MarwenElarbiDistributing Candies (IOI21_candies)C++17
8 / 100
61 ms12884 KiB
#include <bits/stdc++.h> using namespace std; #include "candies.h" std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) { int n = c.size(); vector<long long> pre(n+1,0); vector<int> ans(n); for (int i = 0; i < l.size(); ++i) { pre[l[i]]+=v[i]; pre[r[i]+1]-=v[i]; } for (int i = 0; i < n; ++i) { if(i) pre[i]+=pre[i-1]; ans[i]=min(1ll*c[i],pre[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:10:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     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...