답안 #1020454

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1020454 2024-07-12T04:58:53 Z NeroZein 사탕 분배 (IOI21_candies) C++17
3 / 100
5000 ms 13392 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 = (int) c.size(), q = (int) l.size();
    vector<int> s(n);
    for (int i = 0; i < q; ++i) {
      for (int j = l[i]; j <= r[i]; ++j) {
        s[j] = s[j] + v[i];
        s[j] = max(s[j], 0);
        s[j] = min(s[j], c[j]); 
      }
    }
    return s;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5039 ms 12116 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 132 ms 8032 KB Output is correct
3 Correct 129 ms 6020 KB Output is correct
4 Execution timed out 5028 ms 13392 KB Time limit exceeded
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 315 ms 7772 KB Output is correct
4 Correct 330 ms 3928 KB Output is correct
5 Execution timed out 5059 ms 10968 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Execution timed out 5039 ms 12116 KB Time limit exceeded
7 Halted 0 ms 0 KB -