Submission #436186

#TimeUsernameProblemLanguageResultExecution timeMemory
436186Bom164Distributing Candies (IOI21_candies)C++17
0 / 100
5061 ms7336 KiB
#include<bits/stdc++.h> #include<iostream> using namespace std; #define ll long long #define pb push_back #define mp make_pair #define pii pair<int,int> #define vi vector<int> #define mii map<int,int> #define pqb priority_queue<int> #define pqs priority_queue<int,vi,greater<int> > #define mod 1000000007 #define inf 1e18 #define w(x) int x; cin>>x; while(x--) 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> s(n); for(int i=0;i<q;i++){ int left=l[i]; int right=r[i]; for(int j=left;j<=right;j++){ if(v[i]>0){ c[j]=min(c[j],0+v[i]); }else{ c[j]=max(0,c[j]+v[i]); } } } s=c; return s; }
#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...