oj.uz

답안 #1053214

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053214 2024-08-11T09:47:48 Z noyancanturk 사탕 분배 (IOI21_candies) C++17
3 / 100
 62 ms 7404 KB 
#include "candies.h"

#include <bits/stdc++.h>
using namespace std;

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    int n = c.size(),m=r.size();
    if(n<=4000&&m<=4000){
        std::vector<int> s(n);
        for(int i=0;i<m;i++){
            for(int j=l[i];j<=r[i];j++){
                s[j]+=v[i];
                s[j]=min(c[j],max(0,s[j]));
            }
        }
        return s;
    }
    vector<int>s(n+1);
    for(int i=0;i<m;i++){
        s[l[i]]+=v[i];
        s[r[i]+1]-=v[i];
    }
    s.pop_back();
    for(int i=1;i<n;i++){
        s[i]+=s[i-1];
    }
    for(int i=0;i<n;i++){
        s[i]=min(s[i],c[i]);
    }
    return s;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

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

Subtask #5
0 / 33.0

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