oj.uz

답안 #831369

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

#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 9999999999999999

long long count_tastiness(long long x, vector<long long> a) 
{
    ll ans=1;

    for(int i=1;i<=100000;i++)
    {
        vector<ll>curr(60,0);
        for(int j=0;j<a.size();j++)
            curr[j]=a[j];

        bool tf=1;

        for(int j=0;(1<<j)<=i;j++)
        {
            if((1<<j)&i && curr[j]<x)
             {
                tf=0;
                break;
             }
            
            if((1<<j)&i)
                curr[j]-=x;
            
            curr[j+1]+=curr[j]/2;
        }
        if(tf)
        ans++;

    }
    return ans;
}

Compilation message

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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 212 KB Output is correct
2 Correct 46 ms 212 KB Output is correct
3 Correct 75 ms 276 KB Output is correct
4 Correct 97 ms 276 KB Output is correct
5 Correct 89 ms 212 KB Output is correct
6 Correct 112 ms 276 KB Output is correct
7 Correct 98 ms 212 KB Output is correct
8 Correct 103 ms 272 KB Output is correct
9 Correct 95 ms 212 KB Output is correct
10 Correct 45 ms 276 KB Output is correct
11 Correct 43 ms 272 KB Output is correct
12 Correct 83 ms 284 KB Output is correct
13 Correct 92 ms 212 KB Output is correct
14 Correct 72 ms 280 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 280 KB Output is correct
2 Incorrect 66 ms 272 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 64 ms 280 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 212 KB Output is correct
2 Correct 46 ms 212 KB Output is correct
3 Correct 75 ms 276 KB Output is correct
4 Correct 97 ms 276 KB Output is correct
5 Correct 89 ms 212 KB Output is correct
6 Correct 112 ms 276 KB Output is correct
7 Correct 98 ms 212 KB Output is correct
8 Correct 103 ms 272 KB Output is correct
9 Correct 95 ms 212 KB Output is correct
10 Correct 45 ms 276 KB Output is correct
11 Correct 43 ms 272 KB Output is correct
12 Correct 83 ms 284 KB Output is correct
13 Correct 92 ms 212 KB Output is correct
14 Correct 72 ms 280 KB Output is correct
15 Correct 59 ms 280 KB Output is correct
16 Incorrect 66 ms 272 KB Output isn't correct
17 Halted 0 ms 0 KB -