Submission #1058652

#TimeUsernameProblemLanguageResultExecution timeMemory
1058652qwushaDistributing Candies (IOI21_candies)C++17
11 / 100
61 ms9040 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define fi first #define se second typedef long double ld; const ld eps = 1e-8; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); const ll inf = 1e18; const ll mod = 1e9 + 7; #include "candies.h" vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { ll n = c.size(); int q = l.size(); vector<int> res(n); if (n <= 2000 && q <= 2000) { for (int qw = 0; qw < l.size(); qw++) { for (int i = l[qw]; i <= r[qw]; i++) { if (v[qw] > 0) { res[i] = min(res[i] + v[qw], c[i]); } else { res[i] = max(res[i] + v[qw], 0); } } } return res; } vector<ll> pref(n + 1); for (int qw = 0; qw < q; qw++) { pref[l[qw]] += v[qw]; pref[r[qw] + 1] -= v[qw]; } for (int i = 1; i < n; i++) { pref[i] += pref[i - 1]; } for (int i = 0; i < n; i++) { res[i] = min((ll)c[i], pref[i]); } return res; }

Compilation message (stderr)

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:20:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |         for (int qw = 0; qw < l.size(); qw++) {
      |                          ~~~^~~~~~~~~~
#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...