oj.uz

답안 #996376

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996376 2024-06-10T14:11:01 Z cpdreamer 사탕 분배 (IOI21_candies) C++17
3 / 100
 5000 ms 13160 KB 
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
#define V vector
typedef long long ll;

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

Subtask #1
3.0 / 3.0

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

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5089 ms 7248 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 124 ms 8168 KB Output is correct
3 Correct 124 ms 5952 KB Output is correct
4 Execution timed out 5067 ms 13160 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 296 ms 7760 KB Output is correct
4 Correct 300 ms 3924 KB Output is correct
5 Execution timed out 5044 ms 10836 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Execution timed out 5089 ms 7248 KB Time limit exceeded
7 Halted 0 ms 0 KB -