제출 #435785

#제출 시각아이디문제언어결과실행 시간메모리
435785paisie사탕 분배 (IOI21_candies)C++17
3 / 100
5085 ms7348 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define pb push_back #define mp make_pair #define forr(X) for(int i = 0; i<X; i++) #pragma GCC optimize("Ofast") vector<int> distribute_candies(vector <int> c, vector<int> l, vector <int>r, vector<int> v){ int n = c.size(); int q = l.size(); vector <int> k(n, 0); forr(q){ for(int j = l[i]; j<=r[i]; j++){ if(v[i]>0)k[j] = min(c[j], k[j]+v[i]); else k[j] = max(0, k[j]+v[i]); } } return k; }
#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...