oj.uz

답안 #813906

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
813906 2023-08-08T04:30:29 Z alvingogo 사탕 분배 (IOI21_candies) C++17
3 / 100
 5000 ms 7284 KB 
#include "candies.h"
#include <bits/stdc++.h>
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

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

Subtask #1
3.0 / 3.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 144 ms 5024 KB Output is correct
3 Correct 138 ms 3828 KB Output is correct
4 Execution timed out 5032 ms 7268 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 382 ms 5024 KB Output is correct
4 Correct 383 ms 2804 KB Output is correct
5 Execution timed out 5034 ms 7284 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

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