# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127735 | tmwilliamlin168 | Bowling (BOI15_bow) | C++14 | 1066 ms | 3704 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;
#define ll long long
const int mxN=10;
int q, n, a[mxN];
string s;
ll dp[mxN+1][301][11][11];
struct frame {
vector<int> v;
int b1, b2;
string s;
};
vector<frame> vs, vf;
void solve() {
cin >> n >> s;
for(int i=0; i<n; ++i)
cin >> a[i];
memset(dp, 0, sizeof(dp));
for(int i=0; i<=10; ++i)
for(int j=0; j<=10; ++j)
dp[0][0][i][j]=1;
for(int i=0; i<n; ++i) {
for(int j=0; j<=300; ++j) {
for(frame f : (i<n-1?vs:vf)) {
bool ok=1;
for(int k=0; k<f.s.size()&&ok; ++k)
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... |