oj.uz

Submission #304429

# Submission time Handle Problem Language Result Execution time Memory
304429 2020-09-21T10:53:44 Z Masalmah Packing Biscuits (IOI20_biscuits) C++14
9 / 100
 1000 ms 480 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

const int N= 100001;

long long count_tastiness(long long x, vector<long long> a) {
        long long ans= 1;
        for (int y= 1; y<= N; y++) {

                vector<long long> proc;
                for (int i= 0; i< (int)a.size(); i++) proc.push_back(a[i]);
                while (proc.size()< 60) proc.push_back(0);

                bool nt= 1;
                for (int B= 59; B>= 0; B--) {
                        long long cnt= 0;
                        if (y&((long long)1<< B)) {
                                cnt= x;
                                if (proc[B]>= cnt) {
                                        proc[B]-= cnt;
                                        cnt= 0;
                                } else {
                                        for (int BB= B; BB>= 0; BB--) {
                                                int ct= min(cnt, proc[BB]);
                                                cnt-= ct;
                                                proc[BB]-= ct;
                                                if (cnt== 0) {
                                                        break;
                                                } else cnt*= 2;
                                        }
                                }
                        }

                        if (cnt) {
                                nt= 0;
                                break;
                        }
                }
                if (nt) ans++;
        }
        return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 620 ms 376 KB Output is correct
2 Correct 610 ms 376 KB Output is correct
3 Correct 590 ms 376 KB Output is correct
4 Correct 610 ms 376 KB Output is correct
5 Correct 599 ms 376 KB Output is correct
6 Correct 646 ms 376 KB Output is correct
7 Correct 590 ms 256 KB Output is correct
8 Correct 642 ms 376 KB Output is correct
9 Correct 597 ms 376 KB Output is correct
10 Correct 604 ms 380 KB Output is correct
11 Correct 594 ms 256 KB Output is correct
12 Correct 622 ms 376 KB Output is correct
13 Correct 617 ms 368 KB Output is correct
14 Correct 642 ms 376 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 618 ms 480 KB Output is correct
2 Incorrect 412 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 584 ms 376 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 1046 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 620 ms 376 KB Output is correct
2 Correct 610 ms 376 KB Output is correct
3 Correct 590 ms 376 KB Output is correct
4 Correct 610 ms 376 KB Output is correct
5 Correct 599 ms 376 KB Output is correct
6 Correct 646 ms 376 KB Output is correct
7 Correct 590 ms 256 KB Output is correct
8 Correct 642 ms 376 KB Output is correct
9 Correct 597 ms 376 KB Output is correct
10 Correct 604 ms 380 KB Output is correct
11 Correct 594 ms 256 KB Output is correct
12 Correct 622 ms 376 KB Output is correct
13 Correct 617 ms 368 KB Output is correct
14 Correct 642 ms 376 KB Output is correct
15 Correct 618 ms 480 KB Output is correct
16 Incorrect 412 ms 376 KB Output isn't correct
17 Halted 0 ms 0 KB -