oj.uz

Submission #309973

# Submission time Handle Problem Language Result Execution time Memory
309973 2020-10-05T06:44:22 Z tjdgus4384 Packing Biscuits (IOI20_biscuits) C++14
9 / 100
 1000 ms 384 KB 
#include<bits/stdc++.h>
using namespace std;
long long dp[61];

long long count_tastiness(long long x, vector<long long> a){
    long long ans = 1, sum = 0;
    for(int i = 0;i < a.size();i++) sum += (1<<i)*a[i];
    for(int i = 1;i <= sum;i++){
        long long cnt = 0;
        for(int j = 0;(1<<j) <= sum;j++){
            if(j < a.size()) cnt += a[j];
            if((1<<j)&i){
                if(cnt < x) goto next;
                cnt -= x;
            }
            cnt /= 2;
        }
        ans++;
        next:;
    }
    return ans;
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:7:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |     for(int i = 0;i < a.size();i++) sum += (1<<i)*a[i];
      |                   ~~^~~~~~~~~~
biscuits.cpp:11:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |             if(j < a.size()) cnt += a[j];
      |                ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 13 ms 256 KB Output is correct
4 Correct 26 ms 256 KB Output is correct
5 Correct 6 ms 256 KB Output is correct
6 Correct 70 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 73 ms 256 KB Output is correct
9 Correct 8 ms 256 KB Output is correct
10 Correct 6 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 51 ms 256 KB Output is correct
13 Correct 51 ms 256 KB Output is correct
14 Correct 32 ms 256 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 256 KB Output is correct
2 Execution timed out 1095 ms 256 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 1088 ms 256 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 1094 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 13 ms 256 KB Output is correct
4 Correct 26 ms 256 KB Output is correct
5 Correct 6 ms 256 KB Output is correct
6 Correct 70 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 73 ms 256 KB Output is correct
9 Correct 8 ms 256 KB Output is correct
10 Correct 6 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 51 ms 256 KB Output is correct
13 Correct 51 ms 256 KB Output is correct
14 Correct 32 ms 256 KB Output is correct
15 Correct 10 ms 256 KB Output is correct
16 Execution timed out 1095 ms 256 KB Time limit exceeded
17 Halted 0 ms 0 KB -