oj.uz

Submission #796963

# Submission time Handle Problem Language Result Execution time Memory
796963 2023-07-29T01:27:24 Z vjudge1 Packing Biscuits (IOI20_biscuits) C++17
9 / 100
 1000 ms 340 KB 
#include "biscuits.h"
#include<algorithm>
long long count_tastiness(long long x, std::vector<long long> a){
	int ans = 0, sum = 0;
    for(int i = 0; i < a.size(); i++) {
        sum+=a[i]<<i;
    }
    if(x>sum) return 1;
    for(int y = 0; y <= sum/x; y++) {
        std::vector<long long> a2 = a;
        for(int i = 0; i < x; i++) {
            long long rem=y;
            for(int j = a.size(); j--;) {
                int need = std::min(a2[j], rem>>j);
                rem-=need<<j;
                a2[j]-=need;
            }
            if(rem)
                break;
            if(i==x-1)
                ans++;
        }
    }
    return ans;
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:5:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 |     for(int i = 0; i < a.size(); i++) {
      |                    ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 29 ms 288 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 25 ms 292 KB Output is correct
9 Correct 2 ms 288 KB Output is correct
10 Correct 24 ms 288 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 89 ms 268 KB Output is correct
13 Correct 81 ms 212 KB Output is correct
14 Correct 82 ms 268 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 29 ms 288 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 25 ms 292 KB Output is correct
9 Correct 2 ms 288 KB Output is correct
10 Correct 24 ms 288 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 89 ms 268 KB Output is correct
13 Correct 81 ms 212 KB Output is correct
14 Correct 82 ms 268 KB Output is correct
15 Correct 5 ms 212 KB Output is correct
16 Execution timed out 1066 ms 212 KB Time limit exceeded
17 Halted 0 ms 0 KB -