oj.uz

답안 #432545

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
432545 2021-06-18T10:59:05 Z Blistering_Barnacles 비스킷 담기 (IOI20_biscuits) C++14
21 / 100
 1000 ms 51376 KB 
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
//ap < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
vll ar ;
map < pll , ll > mp ;
ll mem(ll i , ll sum){
    if(i == 64){
        R 1 ;
    }
    pll op = {i , sum} ;
    if(mp.count(op))R mp[op] ;
    ll o1 = 0 , o2 = 0 ;
    o1 = mem(i + 1 , (sum + ar[i]) / 2) ;
    if(sum + ar[i] >= n)o2 = mem(i + 1 , (sum + ar[i] - n) / 2) ;
    R mp[op] = o1 + o2 ;
}
long long count_tastiness(long long x, vector<long long> a) {
	mp.clear() ;
	n = x ;
	k = sz(a) ;
    while(sz(a) < 64)a.pb(0) ;
	ar = a ;
	mem(0 , 0) ;
	R mp[{0 , 0}] ;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 13260 KB Output is correct
2 Correct 10 ms 13260 KB Output is correct
3 Correct 11 ms 13388 KB Output is correct
4 Correct 9 ms 13260 KB Output is correct
5 Correct 9 ms 13308 KB Output is correct
6 Correct 9 ms 13260 KB Output is correct
7 Correct 9 ms 13260 KB Output is correct
8 Correct 9 ms 13260 KB Output is correct
9 Correct 9 ms 13260 KB Output is correct
10 Correct 9 ms 13260 KB Output is correct
11 Correct 10 ms 13300 KB Output is correct
12 Correct 11 ms 13360 KB Output is correct
13 Correct 10 ms 13272 KB Output is correct
14 Correct 12 ms 13352 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 13260 KB Output is correct
2 Correct 9 ms 13260 KB Output is correct
3 Correct 9 ms 13260 KB Output is correct
4 Correct 8 ms 13260 KB Output is correct
5 Correct 9 ms 13260 KB Output is correct
6 Correct 9 ms 13268 KB Output is correct
7 Correct 9 ms 13260 KB Output is correct
8 Correct 9 ms 13260 KB Output is correct
9 Correct 10 ms 13260 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 298 ms 35008 KB Output is correct
2 Correct 731 ms 24244 KB Output is correct
3 Execution timed out 1100 ms 30912 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 13260 KB Output is correct
2 Correct 10 ms 13260 KB Output is correct
3 Correct 11 ms 13388 KB Output is correct
4 Correct 9 ms 13260 KB Output is correct
5 Correct 9 ms 13308 KB Output is correct
6 Correct 9 ms 13260 KB Output is correct
7 Correct 9 ms 13260 KB Output is correct
8 Correct 9 ms 13260 KB Output is correct
9 Correct 9 ms 13260 KB Output is correct
10 Correct 9 ms 13260 KB Output is correct
11 Correct 10 ms 13300 KB Output is correct
12 Correct 11 ms 13360 KB Output is correct
13 Correct 10 ms 13272 KB Output is correct
14 Correct 12 ms 13352 KB Output is correct
15 Correct 9 ms 13260 KB Output is correct
16 Correct 9 ms 13260 KB Output is correct
17 Correct 9 ms 13260 KB Output is correct
18 Correct 8 ms 13260 KB Output is correct
19 Correct 9 ms 13260 KB Output is correct
20 Correct 9 ms 13268 KB Output is correct
21 Correct 9 ms 13260 KB Output is correct
22 Correct 9 ms 13260 KB Output is correct
23 Correct 10 ms 13260 KB Output is correct
24 Correct 298 ms 35008 KB Output is correct
25 Correct 731 ms 24244 KB Output is correct
26 Execution timed out 1100 ms 30912 KB Time limit exceeded
27 Halted 0 ms 0 KB -