제출 #434996

#제출 시각아이디문제언어결과실행 시간메모리
434996MilosMilutinovic사탕 분배 (IOI21_candies)C++17
0 / 100
5048 ms10444 KiB
#include <bits/stdc++.h> #define ll long long #define mp make_pair #define fi first #define se second #define pb push_back #define vi vector<int> #define pi pair<int, int> #define mod 998244353 template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;} template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;} ll ksm(ll a, ll b) {if (b == 0) return 1; ll ns = ksm(a, b >> 1); ns = ns * ns % mod; if (b & 1) ns = ns * a % mod; return ns;} using namespace std; const int maxn = 200005; int n, q; vi a(maxn); vi brute_force(vi c, vi l, vi r, vi v) { for (int i = 0; i < q; i++) { for (int j = l[i] - 1; j < r[i]; j++) { if (v[i] > 0) a[i] = min(c[i], a[i] + v[i]); else a[i] = max(0, a[i] + v[i]); } } return a; } vi distribute_candies(vi c, vi l, vi r, vi v) { n = (int) c.size(); q = (int) l.size(); a.resize(n); if (n <= 1000 && q <= 1000) { return brute_force(c, l, r, v); } }

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

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:36:1: warning: control reaches end of non-void function [-Wreturn-type]
   36 | }
      | ^
#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...