oj.uz

답안 #1059336

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1059336 2024-08-14T21:26:49 Z Trent 사탕 분배 (IOI21_candies) C++17
3 / 100
 5000 ms 25584 KB 
#include "candies.h"
#include "bits/stdc++.h"
using namespace std;
#define forR(i, x) for(int i = 0; i < (x); ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    int n=c.size(), m=l.size();
    vi ch(m);
    vvi addOp(n), remOp(n);
    forR(i, m) {
        addOp[l[i]].push_back(i);
        if(r[i] + 1 < n) remOp[r[i]+1].push_back(i);
    }

    vi ret(n);
    vi tested(n);
    forR(i, n) {
        for(int j : addOp[i]) ch[j] = v[j];
        for(int j : remOp[i]) ch[j] = 0;
        // [besInd, n) has NO interval <= -c or >= c
        int besInd=m;
        ll uc=0, dc=0;
        for(int j = m-1; j >= 0; --j) {
            uc = max(uc + ch[j], 0ll);
            dc = min(dc + ch[j], 0ll);
            if(uc >= c[i] || dc <= -c[i]) break;
            else besInd = j;
        }
        // cerr << i << ": \n";
        // for(int j : ch) cerr << j << ' ';
        // cerr << '\n';
        // cerr << besInd << ' ' << uc << ' ' << dc << '\n';
        if(uc >= c[i]) {
            assert(dc >= -c[i]);
            int cur = c[i];
            REP(j, besInd, m) {
                cur = min(c[i], cur + ch[j]);
                assert(cur >= 0);
            }
            ret[i] = cur;
        } else {
            assert(besInd == 0 || dc <= -c[i]);
            int cur = 0;
            REP(j, besInd, m) {
                cur = max(0, cur + ch[j]);
                assert(cur <= c[i]);
            }
            ret[i] = cur;
        }
        int cur = 0;
        forR(j, m) cur = max(0, min(c[i], cur + ch[j]));
        assert(cur == ret[i]);
    }
    return ret;
}

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 348 KB Output is correct
5 Correct 7 ms 684 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5046 ms 25584 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 1238 ms 8872 KB Output is correct
3 Correct 1213 ms 13144 KB Output is correct
4 Execution timed out 5078 ms 25428 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 681 ms 7024 KB Output is correct
4 Correct 748 ms 13028 KB Output is correct
5 Execution timed out 5044 ms 19140 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 348 KB Output is correct
5 Correct 7 ms 684 KB Output is correct
6 Execution timed out 5046 ms 25584 KB Time limit exceeded
7 Halted 0 ms 0 KB -