oj.uz

답안 #888634

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888634 2023-12-18T04:47:10 Z irmuun 사탕 분배 (IOI21_candies) C++17
8 / 100
 83 ms 14512 KB 
#include<bits/stdc++.h>
#include "candies.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

vector<int>distribute_candies(vector<int>c,vector<int>l,vector<int>r,vector<int>v){
    int n=c.size(),q=l.size();
    vector<int>ans(n,0);
    vector<ll>add(n,0),sub(n,0);
    for(int i=0;i<q;i++){
        add[l[i]]+=v[i];
        sub[r[i]]+=v[i];
    }
    ll cur=0;
    for(int i=0;i<n;i++){
        cur+=add[i];
        if(cur>c[i]){
            ans[i]=c[i];
        }
        else{
            ans[i]=(int)cur;
        }
        cur-=sub[i];
    }
    return ans;
}

Subtask #1
0 / 3.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 10576 KB Output is correct
2 Correct 83 ms 14512 KB Output is correct
3 Correct 80 ms 14300 KB Output is correct

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

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

Subtask #5
0 / 33.0

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