oj.uz

답안 #587253

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
587253 2022-07-01T14:22:58 Z jakubd 사탕 분배 (IOI21_candies) C++17
3 / 100
 89 ms 16228 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(), q = (int)l.size();
  vector<int> s;
 
  if (n <= 2000 && q <= 2000) {
    s.resize(n);
 
    for (int i = 0; i < q; i++) {
      for (int j = l[i]; j <= r[i]; j++) {
        s[j] += v[i];
 
        if (s[j] < 0) s[j] = 0;
        if (s[j] > c[j]) s[j] = c[j];
      }
    }
  } else {
    vector<long long> pref(n + 1);
 
    for (int i = 0; i < q; i++) {
      pref[l[i]] += v[i];
      pref[r[i] + 1] -= v[i];
    }
 
    for (int i = 0; i < n; i++) pref[i + 1] += pref[i];
 
    for (int i = 0; i < n; i++) {
      s[i] = min(pref[i + 1], (long long) c[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 5 ms 340 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 89 ms 16228 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 60 ms 9944 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Runtime error 53 ms 9948 KB Execution killed with signal 11
4 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 5 ms 340 KB Output is correct
6 Runtime error 89 ms 16228 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -