Submission #1195601

#TimeUsernameProblemLanguageResultExecution timeMemory
1195601AmrDistributing Candies (IOI21_candies)C++20
3 / 100
5092 ms7240 KiB
#include "candies.h" #include <vector> #include<bits/stdc++.h> using namespace std; typedef long long ll; #define F first #define S second #define sz size() const int N = 200005; vector<int> a; std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) { ll n = c.size(); ll q = l.size(); a.resize(n); for(int i = 0; i < n; i++) { for(int j = 0; j < q ;j++) { if(l[j]<=i&&r[j]>=i) { if(v[j]>0) a[i] = min(a[i]+v[j],c[i]); else a[i] = max(0,a[i]+v[j]); } } } return a; }
#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...