Submission #127758

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
127758	2019-07-10 05:35:04	tmwilliamlin168	Bowling (BOI15_bow)	C++14	82 / 100	1018 ms	3708 KiB

bow

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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], dp2[mxN+1][301];
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));
  memset(dp2, 0, sizeof(dp2));
  dp2[0][0]=1;
  for(int i=0; i<n; ++i) {
    for(int j=0; j<=300; ++j) {
      for(int k=0; k<=10; ++k)
        for(int l=0; l<=10; ++l)
          dp[i][j][k][l]+=dp2[i][j];
      for(frame f : (i<n-1?vs:vf)) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

bow.cpp: In function 'void solve()':
bow.cpp:32:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int k=0; k<f.s.size()&&ok; ++k)
                  ~^~~~~~~~~~~

• Subtask 1: 16 / 16
• Subtask 2: 17 / 17
• Subtask 3: 26 / 26
• Subtask 4: 23 / 23
• Subtask 5: 0 / 18