oj.uz

답안 #944057

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
944057 2024-03-12T07:51:45 Z LucaIlie Uplifting Excursion (BOI22_vault) C++17
0 / 100
 62 ms 812 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_M = 300;
int MAX_S;
int MIN_S;
const long long INF = 1e18;
int m;
unordered_map<int, long long> taken, untaken;
unordered_map<int, long long> dpCrt, dpPrv;

void add( int x, int i ) {
    swap( dpCrt, dpPrv );

    for ( int s = MIN_S; s <= MAX_S; s++ )
        dpCrt[s] = dpPrv[s];

    /*for ( int s = MIN_S; s - i * x <= MAX_S; s++ ) {
        if ( MIN_S <= s - i * x && s - i * x <= MAX_S )
            dpCrt[s] = max( dpCrt[s], dpPrv[s - i * x] + x );
    }*/
    if ( x > 0 ) {
        for ( int r = 0; r < x; r++ ) {
            deque<pair<int, int>> d;
            for ( int i = 0, s = MIN_S + r; s <= MAX_S; i++, s += x ) {
                if ( !d.empty() && i - d.front().second > x )
                    d.pop_front();
                while ( !d.empty() && dpPrv[s] - i >= dpPrv[d.back().first] - d.back().second )
                    d.pop_back();
                d.push_back( { s, i } );
                dpCrt[s] = dpPrv[d.front().first] + i - d.front().second;
            }
        }
    } else {
        for ( int r = 0; r < x; r++ ) {
            deque<pair<int, int>> d;
            for ( int i = 0, s = MAX_S - r; s >= MAX_S; i++, s -= x ) {
                if ( !d.empty() && i - d.front().second > x )
                    d.pop_front();
                while ( !d.empty() && dpPrv[s] - i >= dpPrv[d.back().first] - d.back().second )
                    d.pop_back();
                d.push_back( { s, i } );
                dpCrt[s] = dpPrv[d.front().first] + i - d.front().second;
            }
        }
    }

    for ( int s = MIN_S; s <= MAX_S; s++ )
        dpCrt[s] = (dpCrt[s] <= -INF + m ? -INF : dpCrt[s]);
}

void substract( int x, int i ) {
    swap( dpCrt, dpPrv );

    for ( int s = MIN_S; s <= MAX_S; s++ )
        dpCrt[s] = dpPrv[s];


    if ( x < 0 ) {
        for ( int r = 0; r < x; r++ ) {
            deque<pair<int, int>> d;
            for ( int i = 0, s = MIN_S + r; s <= MAX_S; i++, s += x ) {
                if ( !d.empty() && i - d.front().second > x )
                    d.pop_front();
                while ( !d.empty() && dpPrv[s] - i >= dpPrv[d.back().first] - d.back().second )
                    d.pop_back();
                d.push_back( { s, i } );
                dpCrt[s] = dpPrv[d.front().first] + i - d.front().second;
            }
        }
    } else {
        for ( int r = 0; r < x; r++ ) {
            deque<pair<int, int>> d;
            for ( int i = 0, s = MAX_S - r; s >= MAX_S; i++, s -= x ) {
                if ( !d.empty() && i - d.front().second > x )
                    d.pop_front();
                while ( !d.empty() && dpPrv[s] - i >= dpPrv[d.back().first] - d.back().second )
                    d.pop_back();
                d.push_back( { s, i } );
                dpCrt[s] = dpPrv[d.front().first] + i - d.front().second;
            }
        }
    }

    for ( int s = MIN_S; s <= MAX_S; s++ )
        dpCrt[s] = (dpCrt[s] <= -INF + m ? -INF : dpCrt[s]);
}

void afis() {
    for ( int s = MIN_S; s <= MAX_S; s++ )
        cout << dpCrt[s] << " ";
    cout << "\n";
}

int main() {
    long long l, u = 0, t = 0;

    cin >> m >> l;
    MIN_S = -m * m;
    MAX_S = m * m;
    for ( int i = -m; i <= m; i++ ) {
        cin >> untaken[i];
        u += untaken[i];
    }

    if ( l < 0 ) {
        for ( int i = 1; i <= m; i++ )
            swap( untaken[i], untaken[-i] );
        l = -l;
    }

    long long s = 0;
    for ( int i = -m; i <= 0; i++ ) {
        long long x = untaken[i];
        s += i * x;
        taken[i] += x;
        untaken[i] -= x;
        t += x;
        u -= x;
    }
    for ( int i = 1; i <= m; i++ ) {
        long long x = min( untaken[i], (l - s) / i );
        s += i * x;
        taken[i] += x;
        untaken[i] -= x;
        t += x;
        u -= x;
    }

    if ( s + m < l ) {
        for ( int i = -m; i < 0; i++ ) {
            long long x = min( taken[i], (l - s) / (-i) );
            s -= i * x;
            taken[i] -= x;
            untaken[i] += x;
            t -= x;
            u += x;
        }
    }

    /*cout << s << "\n";
    for ( int i = -m; i <= m; i++ )
        cout << i << " " << taken[i] << " " << untaken[i] << "\n";*/

    for ( int s = MIN_S; s <= MAX_S; s++ )
        dpCrt[s] = -INF;
    dpCrt[0] = 0;

    for ( int i = -m; i <= m; i++ ) {
        int k, s;

        k = min( (long long)m, untaken[i] );
        add( k, i );

        s = 0;
        k = min( (long long)m, taken[i] );
        substract( k, i );
    }


    if ( l - s > MAX_S || dpCrt[l - s] == -INF )
        cout << "impossible\n";
    else
        cout << t + dpCrt[l - s] << "\n";

    return 0;
}

Compilation message

vault.cpp: In function 'int main()':
vault.cpp:151:16: warning: variable 's' set but not used [-Wunused-but-set-variable]
  151 |         int k, s;
      |                ^

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 62 ms 812 KB Output is correct
6 Correct 50 ms 604 KB Output is correct
7 Correct 55 ms 604 KB Output is correct
8 Correct 55 ms 812 KB Output is correct
9 Correct 58 ms 600 KB Output is correct
10 Incorrect 49 ms 812 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 62 ms 812 KB Output is correct
6 Correct 50 ms 604 KB Output is correct
7 Correct 55 ms 604 KB Output is correct
8 Correct 55 ms 812 KB Output is correct
9 Correct 58 ms 600 KB Output is correct
10 Incorrect 49 ms 812 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

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

Subtask #3-2
0 / 10.0

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

Subtask #4-1
0 / 10.0

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

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 62 ms 812 KB Output is correct
6 Correct 50 ms 604 KB Output is correct
7 Correct 55 ms 604 KB Output is correct
8 Correct 55 ms 812 KB Output is correct
9 Correct 58 ms 600 KB Output is correct
10 Incorrect 49 ms 812 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

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

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 62 ms 812 KB Output is correct
6 Correct 50 ms 604 KB Output is correct
7 Correct 55 ms 604 KB Output is correct
8 Correct 55 ms 812 KB Output is correct
9 Correct 58 ms 600 KB Output is correct
10 Incorrect 49 ms 812 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

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

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 62 ms 812 KB Output is correct
6 Correct 50 ms 604 KB Output is correct
7 Correct 55 ms 604 KB Output is correct
8 Correct 55 ms 812 KB Output is correct
9 Correct 58 ms 600 KB Output is correct
10 Incorrect 49 ms 812 KB Output isn't correct
11 Halted 0 ms 0 KB -