oj.uz

답안 #303624

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
303624 2020-09-20T13:33:33 Z AmineWeslati 비스킷 담기 (IOI20_biscuits) C++14
9 / 100
 1000 ms 384 KB 
//Never stop trying
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}

ll K,x; 
ll a[65];

ll S=0;

ll count_tastiness(ll xx, V<ll>aa){
	K=sz(aa); FOR(i,0,K) a[i]=aa[i]; 
	FOR(i,0,K) S+=(int)(pow(2,i)+0.5)*a[i];
	x=xx;  
	
	aa.resize(60); FOR(i,K,60) a[i]=0; 
	if(S<=1e5+15){
		int ans=0;
		for(ll y=0; y<=S; y++){
			FOR(i,0,60) aa[i]=a[i];
			bool p=true;
			bitset <60> bs(y);
			FOR(i,0,60){
				if(bs[i]){
					if(aa[i]>=x) aa[i]-=x;
					else{p=false;}
				}
				if(!p) break;
				if(i<59) aa[i+1]+=aa[i]/2;
			}
			if(p) ans++;
		}
		return ans;
	}

}




/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input

   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/

Compilation message

biscuits.cpp: In function 'void IO()':
biscuits.cpp:47:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   47 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
biscuits.cpp:48:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   48 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
biscuits.cpp: In function 'll count_tastiness(ll, V<long long int>)':
biscuits.cpp:82:1: warning: control reaches end of non-void function [-Wreturn-type]
   82 | }
      | ^

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 376 KB Output is correct
2 Correct 288 ms 376 KB Output is correct
3 Correct 174 ms 256 KB Output is correct
4 Correct 325 ms 356 KB Output is correct
5 Correct 59 ms 356 KB Output is correct
6 Correct 969 ms 356 KB Output is correct
7 Correct 39 ms 384 KB Output is correct
8 Correct 989 ms 256 KB Output is correct
9 Correct 82 ms 256 KB Output is correct
10 Correct 337 ms 384 KB Output is correct
11 Correct 57 ms 256 KB Output is correct
12 Correct 686 ms 384 KB Output is correct
13 Correct 679 ms 256 KB Output is correct
14 Correct 518 ms 384 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 376 KB Output is correct
2 Correct 288 ms 376 KB Output is correct
3 Correct 174 ms 256 KB Output is correct
4 Correct 325 ms 356 KB Output is correct
5 Correct 59 ms 356 KB Output is correct
6 Correct 969 ms 356 KB Output is correct
7 Correct 39 ms 384 KB Output is correct
8 Correct 989 ms 256 KB Output is correct
9 Correct 82 ms 256 KB Output is correct
10 Correct 337 ms 384 KB Output is correct
11 Correct 57 ms 256 KB Output is correct
12 Correct 686 ms 384 KB Output is correct
13 Correct 679 ms 256 KB Output is correct
14 Correct 518 ms 384 KB Output is correct
15 Correct 95 ms 256 KB Output is correct
16 Execution timed out 1081 ms 360 KB Time limit exceeded
17 Halted 0 ms 0 KB -