oj.uz

답안 #411481

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
411481 2021-05-25T11:50:05 Z AKaan37 비스킷 담기 (IOI20_biscuits) C++17
9 / 100
 1000 ms 332 KB 
#include "biscuits.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long lo; 
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
lo cev,cnt[li];
string s;

long long count_tastiness(long long x, std::vector<long long> v) {
	k=(int)v.size();
	cev=0;
	for(int i=0;i<=200000;i++){
		lo tut=i;
		for(int j=k-1;j>=0;j--){
			lo at=tut/(1ll<<j);
			at=min(at,v[j]);
			tut-=at*(1ll<<j);
			cnt[j]=at;
		}
		if(tut)continue;
		tut=0;
		for(int j=k-1;j>=0;j--){
			tut+=cnt[j]*x;
			if(tut>=1000000000)break;
			tut-=v[j];
			tut=max(tut,0ll);
			tut*=2;
		}
		if(tut)continue;
		//~ cout<<i<<endl;
		cev++;
	}
	//~ cout<<endl;
	return cev;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 288 KB Output is correct
2 Correct 410 ms 204 KB Output is correct
3 Correct 17 ms 204 KB Output is correct
4 Correct 77 ms 204 KB Output is correct
5 Correct 28 ms 288 KB Output is correct
6 Correct 145 ms 288 KB Output is correct
7 Correct 27 ms 204 KB Output is correct
8 Correct 146 ms 288 KB Output is correct
9 Correct 36 ms 300 KB Output is correct
10 Correct 221 ms 292 KB Output is correct
11 Correct 37 ms 204 KB Output is correct
12 Correct 518 ms 292 KB Output is correct
13 Correct 496 ms 292 KB Output is correct
14 Correct 526 ms 300 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 288 KB Output is correct
2 Incorrect 173 ms 284 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 288 KB Output is correct
2 Correct 410 ms 204 KB Output is correct
3 Correct 17 ms 204 KB Output is correct
4 Correct 77 ms 204 KB Output is correct
5 Correct 28 ms 288 KB Output is correct
6 Correct 145 ms 288 KB Output is correct
7 Correct 27 ms 204 KB Output is correct
8 Correct 146 ms 288 KB Output is correct
9 Correct 36 ms 300 KB Output is correct
10 Correct 221 ms 292 KB Output is correct
11 Correct 37 ms 204 KB Output is correct
12 Correct 518 ms 292 KB Output is correct
13 Correct 496 ms 292 KB Output is correct
14 Correct 526 ms 300 KB Output is correct
15 Correct 121 ms 288 KB Output is correct
16 Incorrect 173 ms 284 KB Output isn't correct
17 Halted 0 ms 0 KB -