oj.uz

Submission #439574

# Submission time Handle Problem Language Result Execution time Memory
439574 2021-06-30T09:25:26 Z QuantumK9 Distributing Candies (IOI21_candies) C++17
3 / 100
 130 ms 11316 KB 
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> st1(vector<int> c, vector<int> l,
                vector<int> r, vector<int> v) {
    int n = c.size();
    vector<int> s(n);
    for( int i = 0; i < n; i++ ){ s[i] = 0; }
    int q = v.size();
    for( int i = 0; i < q; i++ ){
        for( int j = l[i]; j <= r[i]; j++ ){
            if( v[i] > 0 ){ s[j] = min( c[j], s[j]+v[i] ); }
            else if ( v[i] < 0 ){ s[j] = max( 0, s[j]+v[i] ); }
        }
    }
    return s;
}


vector<int> st2(vector<int> c, vector<int> l,
                vector<int> r, vector<int> v) {
    int n = c.size();
    int q = v.size();

    vector<int> pfs(n+3);
    for( int i = 0; i < n+3; i++ ){ pfs[i] = 0; }

    for( int i = 0; i < q; i++ ){
        pfs[ l[i] ] += v[i];
        pfs[ r[i]+1 ] -= v[i];
    }

    vector<int> ans(n);
    int rs = 0;
    for( int i = 0; i < n; i++ ){
        rs += pfs[i];
        ans[i] = min( c[i], rs );
    }
    return ans;
}


vector<int> distribute_candies(vector<int> c, vector<int> l,
                               vector<int> r, vector<int> v) {
    int n = c.size();
    int q = v.size();

    if ( n <= 2000 && q <= 2000 ){ return st1(c,l,r,v); }
    else{ return st2(c,l,r,v); }

    //return st2(c,l,r,v);
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 388 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 130 ms 11316 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 66 ms 7380 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 61 ms 7396 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 388 KB Output is correct
6 Incorrect 130 ms 11316 KB Output isn't correct
7 Halted 0 ms 0 KB -