oj.uz

답안 #436870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
436870 2021-06-25T07:07:19 Z PiejanVDC 사탕 분배 (IOI21_candies) C++17
11 / 100
 5000 ms 8924 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) {
            if(z>0) {
                current_height+=z;
                current_height=min(current_height,cap[n-1].first);
                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;
                }
            } else {
                current_height+=z;
                current_height = 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 304 KB Output is correct
5 Correct 5 ms 332 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 8924 KB Output is correct
2 Correct 172 ms 8820 KB Output is correct
3 Correct 134 ms 8792 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 211 ms 4948 KB Output is correct
3 Correct 210 ms 4156 KB Output is correct
4 Execution timed out 5038 ms 8800 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 538 ms 5036 KB Output is correct
4 Correct 529 ms 4252 KB Output is correct
5 Execution timed out 5031 ms 8796 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 304 KB Output is correct
5 Correct 5 ms 332 KB Output is correct
6 Correct 139 ms 8924 KB Output is correct
7 Correct 172 ms 8820 KB Output is correct
8 Correct 134 ms 8792 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 211 ms 4948 KB Output is correct
11 Correct 210 ms 4156 KB Output is correct
12 Execution timed out 5038 ms 8800 KB Time limit exceeded
13 Halted 0 ms 0 KB -