oj.uz

답안 #605365

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
605365 2022-07-25T16:24:49 Z SamAnd 비스킷 담기 (IOI20_biscuits) C++17
42 / 100
 1000 ms 15688 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define m_p make_pair
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
typedef long long ll;

long long count_tastiness(long long x, std::vector<long long> a)
{
    for (int i = 0; i < 66; ++i)
        a.push_back(0);
    map<ll, ll> dp;
    dp[0] = 1;
    for (int i = 0; i < sz(a); ++i)
    {
        map<ll, ll> ndp;
        for (auto it = dp.begin(); it != dp.end(); ++it)
        {
            ll j = it->fi;
            ndp[(j + a[i]) / 2] += dp[j];
            if (j + a[i] - x >= 0)
                ndp[(j + a[i] - x) / 2] += dp[j];
        }
        dp = ndp;
    }

    ll ans = 0;
    for (auto it = dp.begin(); it != dp.end(); ++it)
        ans += it->se;
	return ans;
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:31:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   31 |     for (auto it = dp.begin(); it != dp.end(); ++it)
      |     ^~~
biscuits.cpp:33:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   33 |  return ans;
      |  ^~~~~~

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 1 ms 276 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 1532 KB Output is correct
2 Correct 214 ms 1376 KB Output is correct
3 Correct 372 ms 1468 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 869 ms 1528 KB Output is correct
9 Correct 669 ms 1536 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 14 ms 212 KB Output is correct
12 Correct 127 ms 468 KB Output is correct
13 Correct 901 ms 1524 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1049 ms 15688 KB Time limit exceeded
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 1 ms 276 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 114 ms 1532 KB Output is correct
25 Correct 214 ms 1376 KB Output is correct
26 Correct 372 ms 1468 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 869 ms 1528 KB Output is correct
32 Correct 669 ms 1536 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 14 ms 212 KB Output is correct
35 Correct 127 ms 468 KB Output is correct
36 Correct 901 ms 1524 KB Output is correct
37 Execution timed out 1049 ms 15688 KB Time limit exceeded
38 Halted 0 ms 0 KB -