제출 #1179392

#제출 시각아이디문제언어결과실행 시간메모리
1179392hyakup사탕 분배 (IOI21_candies)C++20
0 / 100
58 ms7236 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(), m = l.size();
    vector<int> resp(n);
    for( int i = 0; i < m; i++ ){
      resp[l[i]] += v[i];
      if( r[i] < n - 1 ) resp[r[i] + 1] -= v[i];
    }

    for( int i = 1; i < n; i++ ) resp[i] += resp[i - 1];
    for( int i = 0; i < n; i++ ) resp[i] = min( resp[i], c[i] ); 
    return resp;
}
#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...