oj.uz

답안 #1044198

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1044198 2024-08-05T07:57:11 Z Unforgettablepl 사탕 분배 (IOI21_candies) C++17
3 / 100
 5000 ms 13364 KB 
#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();
    int q = v.size();
    vector<int> s(n);
    for(int i=0;i<q;i++){
        for(int x=l[i];x<=r[i];x++){
            s[x]+=v[i];
            s[x]=max(min(s[x],c[x]),0);
        }
    }
    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 1 ms 348 KB Output is correct
4 Correct 1 ms 424 KB Output is correct
5 Correct 2 ms 348 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5038 ms 12116 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 191 ms 8020 KB Output is correct
3 Correct 183 ms 5956 KB Output is correct
4 Execution timed out 5050 ms 13364 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 271 ms 7784 KB Output is correct
4 Correct 309 ms 3928 KB Output is correct
5 Execution timed out 5035 ms 10832 KB Time limit exceeded
6 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 1 ms 348 KB Output is correct
4 Correct 1 ms 424 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Execution timed out 5038 ms 12116 KB Time limit exceeded
7 Halted 0 ms 0 KB -