답안 #609527

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
609527 2022-07-27T16:52:24 Z Ozy 사탕 분배 (IOI21_candies) C++17
3 / 100
5000 ms 13212 KB
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define lli long long int
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "

#define MAX 2000

lli n,q;
vector<int> arr;

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) {

    n = c.size();
    q = r.size();
    arr.resize(n,0);

    rep(i,0,q-1) {
        rep(pos,l[i],r[i]) {
            arr[pos] += v[i];
            if (arr[pos] < 0) arr[pos] = 0;
            if (arr[pos] > c[pos]) arr[pos] = c[pos];
        }
    }

    return arr;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 6 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5056 ms 12120 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 522 ms 8032 KB Output is correct
3 Correct 487 ms 6916 KB Output is correct
4 Execution timed out 5040 ms 13212 KB Time limit exceeded
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1485 ms 7652 KB Output is correct
4 Correct 1396 ms 4796 KB Output is correct
5 Execution timed out 5034 ms 10856 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 6 ms 340 KB Output is correct
6 Execution timed out 5056 ms 12120 KB Time limit exceeded
7 Halted 0 ms 0 KB -