oj.uz

답안 #831364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831364 2023-08-20T07:08:44 Z ALeonidou 비스킷 담기 (IOI20_biscuits) C++17
9 / 100
 1000 ms 340 KB 
#include "biscuits.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define F first
#define S second
#define sz(x) (ll)x.size()
#define MID ((l+r)/2)
#define pb push_back
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;
#define dbg4(x,y,z,w) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<" "<<#w<<": "<<w<<endl;

typedef vector <ll> vi;
typedef pair<ll,ll> ii;
typedef vector <ii> vii;

#define M 100001

ll count_tastiness(ll x, vi a) {
    ll n = sz(a);
    vi tmp;
    ll ans = 1;
    for (ll y =1; y<=M; y++){   //y
        tmp = a;
        ll sum;
        ll f = -1;
        //dbg(y);
        do{
            f++;
            sum = 0;
            for (ll i = n-1; i>=0; i--){
                if (tmp[i] == 0) continue;
                ll val = (1<<i);
                ll d = (y - sum) / val;
                ll g = min(d, tmp[i]);
                //dbg4(sum, val,d,g);
                tmp[i] -= g;
                sum += g * val;
                if (sum == y) break;
            }
            //dbg(sum);
        }while (sum == y);
        
        if (f >= x) ans++;

        //dbg2(f,ans);
        //cout<<endl;
    }

	return ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 212 KB Output is correct
2 Correct 202 ms 296 KB Output is correct
3 Correct 20 ms 212 KB Output is correct
4 Correct 69 ms 212 KB Output is correct
5 Correct 17 ms 212 KB Output is correct
6 Correct 243 ms 284 KB Output is correct
7 Correct 13 ms 212 KB Output is correct
8 Correct 241 ms 280 KB Output is correct
9 Correct 22 ms 212 KB Output is correct
10 Correct 261 ms 212 KB Output is correct
11 Correct 26 ms 212 KB Output is correct
12 Correct 199 ms 288 KB Output is correct
13 Correct 227 ms 284 KB Output is correct
14 Correct 278 ms 300 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 212 KB Output is correct
2 Correct 202 ms 296 KB Output is correct
3 Correct 20 ms 212 KB Output is correct
4 Correct 69 ms 212 KB Output is correct
5 Correct 17 ms 212 KB Output is correct
6 Correct 243 ms 284 KB Output is correct
7 Correct 13 ms 212 KB Output is correct
8 Correct 241 ms 280 KB Output is correct
9 Correct 22 ms 212 KB Output is correct
10 Correct 261 ms 212 KB Output is correct
11 Correct 26 ms 212 KB Output is correct
12 Correct 199 ms 288 KB Output is correct
13 Correct 227 ms 284 KB Output is correct
14 Correct 278 ms 300 KB Output is correct
15 Correct 18 ms 212 KB Output is correct
16 Execution timed out 1076 ms 212 KB Time limit exceeded
17 Halted 0 ms 0 KB -