Submission #436873

#TimeUsernameProblemLanguageResultExecution timeMemory
436873PiejanVDCDistributing Candies (IOI21_candies)C++17
0 / 100
154 ms10436 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int n = c.size(), q = v.size(); vector<int64_t>dif(n+1,0); /*bool pos=true, same = true; for(int i = 0 ; i < q ; i++) { if(v[i]<0) { pos=false; } if(l[i] != r[i]) same=false; }*/ vector<int>ans(n,0); /* if(pos) { for(int i = 0 ; i < q ; i++) { dif[l[i]]+=v[i],dif[r[i]+1]-=v[i]; } int64_t curr=0; for(int i = 0 ; i < n ; i++) { curr+=dif[i]; ans[i]=min((int64_t)c[i],curr); } } else if(same) {*/ vector<pair<int,int>>cap(n); for(int i = 0 ; i < n ; i++) { cap[i].first=c[i],cap[i].second=i; } sort(cap.begin(),cap.end()); int current_height=0,position=-1; for(auto z : v) { current_height+=z; current_height=(z>0?min(current_height,cap[n-1].first):max(current_height,0)); int left=0,right=n-1; while(left <= right) { int mid = (left+right)/2; if(cap[mid].first <= current_height) position=mid,left=mid+1; else right=mid-1; } } for(int i = 0 ; i <= position ; i++) { ans[cap[i].second] = cap[i].first; } for(int i = position+1 ; i < n ; i++) { ans[cap[i].second] = cap[position].first; } //} else { // for(int i = 0 ; i < q ; i++) { // for(int j = l[i] ; j <= r[i] ; j++) ans[j]=(v[i]>0?min(c[j],ans[j]+v[i]):max(0,ans[j]+v[i])); // } // } return ans; }

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:6:23: warning: unused variable 'q' [-Wunused-variable]
    6 |     int n = c.size(), q = v.size();
      |                       ^
#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...