oj.uz

답안 #308366

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
308366 2020-10-01T01:27:01 Z 4fecta 비스킷 담기 (IOI20_biscuits) C++14
9 / 100
 1000 ms 193340 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define readl(_s) getline(cin, (_s));
#define boost() cin.tie(0); cin.sync_with_stdio(0)

const int MN = 100;

int k, dp[MN], psa[MN];

int count_tastiness(int x, vector<int> a) {
    k = a.size();
    memset(dp, 0, sizeof(dp));
    memset(psa, 0, sizeof(psa));
    psa[0] = a[0];
    for (int i = 1; i < k; i++) {
        psa[i] = a[i] * (1ll << i) + psa[i - 1];
        //printf("%d\n", psa[i]);
    }
    for (int i = k; i < 63; i++) psa[i] = psa[i - 1];
    set<int> ans;
    ans.insert(0);
    //if (psa[0] >= x) ans.insert(1);
    for (int i = 0; i < 63; i++) {
        vector<int> tmp;
        for (int val : ans) {
            int y = val + (1ll << i);
            //printf("%lld\n", y);
            if (psa[i] / x >= y) tmp.push_back(y);
        }
        for (int p : tmp) ans.insert(p);
    }
    /*for (int i = 1; i <= 1000000; i++) {
        int b = 0;
        for (int s = 0; s < 30; s++) if (i & (1 << s)) b = s;
        if (psa[b] >= x * i && ans.count(i - (1 << b))) ans.insert(i);
    }*/
    return (ll) ans.size();
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 5236 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 118 ms 2744 KB Output is correct
5 Correct 25 ms 896 KB Output is correct
6 Correct 339 ms 5328 KB Output is correct
7 Correct 16 ms 656 KB Output is correct
8 Correct 335 ms 5504 KB Output is correct
9 Correct 40 ms 1136 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 102 ms 1264 KB Output is correct
13 Correct 43 ms 716 KB Output is correct
14 Correct 4 ms 384 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 5236 KB Output is correct
2 Execution timed out 1091 ms 61104 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1103 ms 193340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1090 ms 10308 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 5236 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 118 ms 2744 KB Output is correct
5 Correct 25 ms 896 KB Output is correct
6 Correct 339 ms 5328 KB Output is correct
7 Correct 16 ms 656 KB Output is correct
8 Correct 335 ms 5504 KB Output is correct
9 Correct 40 ms 1136 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 102 ms 1264 KB Output is correct
13 Correct 43 ms 716 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 76 ms 5236 KB Output is correct
16 Execution timed out 1091 ms 61104 KB Time limit exceeded
17 Halted 0 ms 0 KB -