oj.uz

답안 #828010

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
828010 2023-08-17T01:20:20 Z minhcool 비스킷 담기 (IOI20_biscuits) C++17
42 / 100
 63 ms 19576 KB 
//#define local
#ifndef local
#include "biscuits.h"
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
 
#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 3e5 + 5;
 
const int oo = 1e18 + 7, mod = 1e9 + 7;
 
mt19937 rng(1);
 
int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}
 
int dp[125][20005], expected[121];
 
long long count_tastiness(long long x, std::vector<long long> a) {
	//int n, a[N];
	int sum = 0;
	for(int i = 0; i < a.size(); i++) sum += a[i] * (1LL << i);
	if(sum <= 1e5){
		int answer = 1;
		for(int i = 1; i <= sum/x; i++){
			int rem = 0;
			for(int j = 0; j < a.size(); j++){
				rem += a[j];
				if((i & (1LL << j))) rem -= x;
				if(rem < 0) break;
				rem /= 2;
			}
			//if(rem >= 0) cout << answer << "\n";
			answer += (rem >= 0);
		}
		return answer;
	}
	else if(x <= 1e4){
		//cout << "OK\n";
		for(int i = 0; i <= 20000; i++){
			for(int j = 0; j <= 122; j++) dp[j][i] = 0;
		}
		expected[0] = a[0];
		for(int i = 1; i < a.size() + 62; i++) expected[i] = (expected[i - 1] / 2) + (i < a.size() ? a[i] : 0);
		dp[0][0] = 1;
		if(a[0] >= x) dp[0][x] = 1;
		for(int i = 0; (i + 1) < a.size() + 62; i++){
			for(int j = 0; j <= 20000; j++){
				//if(dp[i][j]) cout << i << " " << j << " " << dp[i][j] << "\n";
				int nxt = ((expected[i] - j) / 2) + ((i + 1) < a.size() ? a[i + 1] : 0), actual = expected[i + 1] - nxt;
				dp[i + 1][actual] += dp[i][j];
				if(nxt >= x){
					nxt -= x, actual += x;
					dp[i + 1][actual] += dp[i][j];
				}
			}
		}
		int answer = 0;
		for(int j = 0; j <= 20000; j++) answer += dp[a.size() + 61][j];
		return answer;
	}
	return 0;
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:36:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for(int i = 0; i < a.size(); i++) sum += a[i] * (1LL << i);
      |                 ~~^~~~~~~~~~
biscuits.cpp:41:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |    for(int j = 0; j < a.size(); j++){
      |                   ~~^~~~~~~~~~
biscuits.cpp:58:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for(int i = 1; i < a.size() + 62; i++) expected[i] = (expected[i - 1] / 2) + (i < a.size() ? a[i] : 0);
      |                  ~~^~~~~~~~~~~~~~~
biscuits.cpp:58:83: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for(int i = 1; i < a.size() + 62; i++) expected[i] = (expected[i - 1] / 2) + (i < a.size() ? a[i] : 0);
      |                                                                                 ~~^~~~~~~~~~
biscuits.cpp:61:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |   for(int i = 0; (i + 1) < a.size() + 62; i++){
      |                  ~~~~~~~~^~~~~~~~~~~~~~~
biscuits.cpp:64:50: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     int nxt = ((expected[i] - j) / 2) + ((i + 1) < a.size() ? a[i + 1] : 0), actual = expected[i + 1] - nxt;
      |                                          ~~~~~~~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 5 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 9 ms 316 KB Output is correct
13 Correct 4 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 25 ms 19576 KB Output is correct
3 Correct 41 ms 19540 KB Output is correct
4 Correct 42 ms 19540 KB Output is correct
5 Correct 45 ms 19540 KB Output is correct
6 Correct 56 ms 19540 KB Output is correct
7 Correct 40 ms 19540 KB Output is correct
8 Correct 52 ms 19488 KB Output is correct
9 Correct 63 ms 19568 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 19556 KB Output is correct
2 Correct 37 ms 19540 KB Output is correct
3 Correct 42 ms 19540 KB Output is correct
4 Correct 45 ms 19568 KB Output is correct
5 Correct 48 ms 19540 KB Output is correct
6 Correct 55 ms 19540 KB Output is correct
7 Correct 41 ms 19568 KB Output is correct
8 Correct 54 ms 19460 KB Output is correct
9 Correct 40 ms 19508 KB Output is correct
10 Correct 51 ms 19560 KB Output is correct
11 Correct 52 ms 19560 KB Output is correct
12 Correct 54 ms 19548 KB Output is correct
13 Correct 55 ms 19540 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 5 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 9 ms 316 KB Output is correct
13 Correct 4 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 25 ms 19576 KB Output is correct
17 Correct 41 ms 19540 KB Output is correct
18 Correct 42 ms 19540 KB Output is correct
19 Correct 45 ms 19540 KB Output is correct
20 Correct 56 ms 19540 KB Output is correct
21 Correct 40 ms 19540 KB Output is correct
22 Correct 52 ms 19488 KB Output is correct
23 Correct 63 ms 19568 KB Output is correct
24 Correct 40 ms 19556 KB Output is correct
25 Correct 37 ms 19540 KB Output is correct
26 Correct 42 ms 19540 KB Output is correct
27 Correct 45 ms 19568 KB Output is correct
28 Correct 48 ms 19540 KB Output is correct
29 Correct 55 ms 19540 KB Output is correct
30 Correct 41 ms 19568 KB Output is correct
31 Correct 54 ms 19460 KB Output is correct
32 Correct 40 ms 19508 KB Output is correct
33 Correct 51 ms 19560 KB Output is correct
34 Correct 52 ms 19560 KB Output is correct
35 Correct 54 ms 19548 KB Output is correct
36 Correct 55 ms 19540 KB Output is correct
37 Incorrect 1 ms 340 KB Output isn't correct
38 Halted 0 ms 0 KB -