# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49104 | aome | Bowling (BOI15_bow) | C++17 | 113 ms | 956 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n;
int score[10];
string s;
long long f[10][305][4];
void solve() {
cin >> n >> s;
for (int i = 0; i < n; ++i) cin >> score[i];
memset(f, 0, sizeof f);
// 0 -> i - 1 ko duoc 10
// 1 -> i - 1 duoc 10
// 2 -> i - 1 duoc strike
// 3 -> i - 1 duoc strike va i - 2 duoc strike
f[0][0][0] = 1;
for (int i = 0; i < (n - 1); ++i) {
for (int j = 0; j <= 300; ++j) {
for (int k = 0; k < 4; ++k) {
if (!f[i][j][k]) continue;
// cout << i << ' ' << j << ' ' << k << '\n';
char c1 = s[i * 2], c2 = s[i * 2 + 1];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |