oj.uz

답안 #436880

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
436880 2021-06-25T07:25:11 Z PiejanVDC 사탕 분배 (IOI21_candies) C++17
0 / 100
 202 ms 10456 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());
        int64_t current_height=0,position=-1;
        for(auto z : v) {
                current_height+=z;
                current_height=(z>0?min(current_height,(int64_t)cap[n-1].first):max(current_height,(int64_t)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;
                }
        }
        if(position < 0 && position >= n) exit(0);
        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] = current_height;
        }
    //} 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

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();
      |                       ^

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 202 ms 10456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 216 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -