oj.uz

Submission #975030

# Submission time Handle Problem Language Result Execution time Memory
975030 2024-05-04T10:22:18 Z LucaIlie Packing Biscuits (IOI20_biscuits) C++17
9 / 100
 1000 ms 500 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const int k = 60;
long long x;
long long biscuits[k];
long long sum[k][k], mask[k][k];
vector<int> ind[k];
long long solutions;
vector<int> sol;
 
void countSolutions( int b, long long s ) {
    solutions++;
 
    //for ( int i: sol )
       // printf( "%d ", i );
    //printf( "\n" );
 
    for ( int i: ind[b] ) {
        long long cs = ((s / 2 + mask[b][i]) >> (i - b)) + sum[b][i];
      //  printf( "%d %d %d\n", b, i, cs );
        if ( cs >= x ) {
            sol.push_back( i );
            countSolutions( i + 1, cs - x );
            sol.pop_back();
        }
    }
}
 
int p;
bool cmp( int p1, int p2 ) {
    long long r1 = (((mask[p][p1] >> (p1 - p)) + sum[p][p1] - x) >> p2), r2 = (((mask[p][p2] >> (p2 - p)) + sum[p][p2] - x) >> p1);
    return r1 > r2;
}
 
long long count_tastiness( long long X, vector <long long> a ) {
    long long s;
 
    x = X;
    a.resize( k );
 
    s = 0;
    for ( int b = 0; b < k; b++ ) {
        a[b] += s;
        if ( a[b] > x ) {
            s = a[b] - x;
            a[b] = x + s % 2;
            s /= 2;
        } else
            s = 0;
        biscuits[b] = a[b];
    }
 
    for ( int i = 0; i < k; i++ ) {
        sum[i][i] = biscuits[i];
        for ( int j = i + 1; j < k; j++ ) {
            mask[i][j] = mask[i][j - 1] + (((long long)sum[i][j - 1] % 2) << (j - i - 1));
            sum[i][j] = sum[i][j - 1] / 2 + biscuits[j];
            //printf( "%d %d: %d %d\n", i, j, sum[i][j], mask[i][j] );
        }
    }
    for ( int b = 0; b < k; b++ ) {
        ind[b].clear();
        for ( int i = b; i < k; i++ )
            ind[b].push_back( i );
        p = b;
        sort( ind[b].begin(), ind[b].end(), cmp );
    }
 
    solutions = 0;
    countSolutions( 0, 0 );
 
    return solutions;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 11 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 28 ms 500 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 31 ms 344 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 10 ms 348 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Execution timed out 1079 ms 348 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1048 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1062 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 11 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 28 ms 500 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 31 ms 344 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 10 ms 348 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 7 ms 348 KB Output is correct
16 Execution timed out 1079 ms 348 KB Time limit exceeded
17 Halted 0 ms 0 KB -