oj.uz

Submission #436871

# Submission time Handle Problem Language Result Execution time Memory
436871 2021-06-25T07:09:38 Z PiejanVDC Distributing Candies (IOI21_candies) C++17
11 / 100
 5000 ms 8900 KB 
#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;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 8792 KB Output is correct
2 Correct 125 ms 8900 KB Output is correct
3 Correct 127 ms 8900 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 222 ms 4944 KB Output is correct
3 Correct 208 ms 4248 KB Output is correct
4 Execution timed out 5076 ms 8796 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 474 ms 5040 KB Output is correct
4 Correct 492 ms 4252 KB Output is correct
5 Execution timed out 5072 ms 8900 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 131 ms 8792 KB Output is correct
7 Correct 125 ms 8900 KB Output is correct
8 Correct 127 ms 8900 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 222 ms 4944 KB Output is correct
11 Correct 208 ms 4248 KB Output is correct
12 Execution timed out 5076 ms 8796 KB Time limit exceeded
13 Halted 0 ms 0 KB -