oj.uz

답안 #596751

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596751 2022-07-15T03:04:25 Z serize 사탕 분배 (IOI21_candies) C++17
3 / 100
 109 ms 12980 KB 
#include "candies.h"
#include <bits/stdc++.h>
#include <cassert>
#include <cstdio>
#include <vector>

using namespace std;
const int MAX = 2e5+2;

vector<int> abi(MAX);

void add(int k, int v){
    while(k < MAX){
        abi[k] += v;
        k += k&(-k);
    }
}

int read(int k){
    int s = 0;
    while(k > 0){
        s += abi[k];
        k -= k&(-k);
    }
    return s;
}

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();
    int q = l.size();
    std::vector<int> s(n);
    if(q <= 2000){
        for(int i = 0; i < q; i++){
            for(int j = l[i]; j <= r[i]; j++){
                if(v[i] < 0) s[j] = max(0,s[j]+v[i]);
                else s[j] = min(c[j],s[j]+v[i]);
            }
        }
    }
    else{
        for(int i = 0; i < q; i++){
            add(l[i]+1,v[i]);
            add(r[i]+2,-v[i]);
        }
        for(int i = 0; i < n; i++){
            s[i] = read(i+1);
        }
    }
    return s;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1092 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 4 ms 1104 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 109 ms 12980 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Incorrect 61 ms 8776 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1096 KB Output is correct
3 Incorrect 58 ms 8424 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1092 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 4 ms 1104 KB Output is correct
6 Incorrect 109 ms 12980 KB Output isn't correct
7 Halted 0 ms 0 KB -