답안 #60215 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
60215	2018-07-23T20:58:32 Z	Benq	Bowling (BOI15_bow)	C++11	82 / 100	1000 ms	1356 KB

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;


struct hsh {
    size_t operator()(const pi& k) const {
        return (ll)MOD*k.f+k.s; // bad, but you get the point
    }
};

int q, n, num[10];
unordered_map<pi,ll,hsh> m[2][3], M[2][3];
string tmp[10];

string gen(vi nex) {
    int lst = -1;
    string res;
    for (int i: nex) {
        if (i == -1) res += '-';
        else if (lst != -1 && i+lst == 10) {
            res += '/';
            lst = -1;
        } else if (i == 10) res += 'x';
        else {
            if (lst == -1) lst = 0;
            res += char('0'+i);
            lst += i;
        }
    }
    return res;
}

bool match(string bad, vi nex) {
    string t = gen(nex);
    F0R(i,sz(bad)) if (bad[i] != '?' && bad[i] != t[i]) return 0;
    return 1;
}


void tri(int X, int Y, pair<pi, ll> A, int x, vi y) {
    // if (!match(tmp[x],y)) return;
    pi a = A.f;
    
    int cur = a.s;
    for (int i: y) if (i != -1) {
        cur += i;
        if (X) a.f += i, a.s += i, cur += i, X --;
        if (Y) a.s += i, cur += i, Y --;
    }
    int posi = 0;
    if (x != n-1) {
        if (y[0] == 10) posi = 2;
        else if (y[0]+y[1] == 10) posi = 1;
    }
    if (x >= 2 && X == 0 && num[x-2] != -1 && a.f != num[x-2]) return;
    if (x >= 1 && Y == 0 && num[x-1] != -1 && a.s != num[x-1]) return;
    if (posi == 0 && num[x] != -1 && cur != num[x]) return;
    M[Y][posi][{a.s,cur}] += A.s;
}

void process(int x) {
    vector<vi> posi;
    if (x != n-1) {
        if (match(tmp[x],{10,-1})) posi.pb({10,-1});
        F0R(i,10) F0R(j,11-i) if (match(tmp[x],{i,j})) posi.pb({i,j});
    } else {
        F0R(i,11) if (match(tmp[x],{10,10,i})) posi.pb({10,10,i});
        F0R(i,10) F0R(j,11-i) if (match(tmp[x],{10,i,j})) posi.pb({10,i,j});
        F0R(i,10) F0R(j,11) if (match(tmp[x],{i,10-i,j})) posi.pb({i,10-i,j});
        F0R(i,10) F0R(j,10-i) if (match(tmp[x],{i,j,-1})) posi.pb({i,j,-1});
    }
    
    for (auto v: posi) F0R(X,2) F0R(Y,3) for (auto a: m[X][Y]) tri(X,Y,a,x,v);
    F0R(i,2) F0R(j,3) {
        swap(m[i][j],M[i][j]);
        M[i][j].clear();
    }
}

void solve() {
    cin >> n;
    string s; cin >> s;
    F0R(i,n-1) tmp[i] = s.substr(2*i,2);
    tmp[n-1] = s.substr(2*(n-1),3);
    F0R(i,n) cin >> num[i];
    
    F0R(i,2) F0R(j,3) m[i][j].clear();
    m[0][0][{0,0}] = 1;
    F0R(i,n) process(i);
    ll ans = 0;
    for (auto a: m[0][0]) ans += a.s;
    cout << ans << "\n";
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> q;
    F0R(i,q) solve();
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	376 KB	Output is correct
2	Correct	6 ms	540 KB	Output is correct
3	Correct	5 ms	540 KB	Output is correct
4	Correct	5 ms	540 KB	Output is correct
5	Correct	7 ms	552 KB	Output is correct
6	Correct	5 ms	552 KB	Output is correct
7	Correct	12 ms	552 KB	Output is correct
8	Correct	9 ms	552 KB	Output is correct
9	Correct	9 ms	672 KB	Output is correct
10	Correct	9 ms	672 KB	Output is correct
11	Correct	8 ms	672 KB	Output is correct
12	Correct	12 ms	672 KB	Output is correct
13	Correct	4 ms	672 KB	Output is correct
14	Correct	10 ms	672 KB	Output is correct
15	Correct	5 ms	672 KB	Output is correct

Subtask #2
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	68 ms	672 KB	Output is correct
2	Correct	54 ms	724 KB	Output is correct
3	Correct	55 ms	728 KB	Output is correct
4	Correct	18 ms	728 KB	Output is correct
5	Correct	26 ms	728 KB	Output is correct
6	Correct	23 ms	728 KB	Output is correct
7	Correct	62 ms	728 KB	Output is correct
8	Correct	63 ms	728 KB	Output is correct
9	Correct	15 ms	728 KB	Output is correct
10	Correct	209 ms	852 KB	Output is correct
11	Correct	229 ms	852 KB	Output is correct
12	Correct	112 ms	852 KB	Output is correct
13	Correct	232 ms	868 KB	Output is correct
14	Correct	34 ms	868 KB	Output is correct
15	Correct	44 ms	868 KB	Output is correct
16	Correct	42 ms	868 KB	Output is correct
17	Correct	50 ms	868 KB	Output is correct
18	Correct	262 ms	888 KB	Output is correct
19	Correct	252 ms	888 KB	Output is correct
20	Correct	448 ms	888 KB	Output is correct
21	Correct	333 ms	1016 KB	Output is correct

Subtask #3
26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	223 ms	1016 KB	Output is correct
2	Correct	7 ms	1016 KB	Output is correct
3	Correct	7 ms	1016 KB	Output is correct
4	Correct	6 ms	1016 KB	Output is correct
5	Correct	6 ms	1016 KB	Output is correct
6	Correct	8 ms	1016 KB	Output is correct
7	Correct	8 ms	1016 KB	Output is correct
8	Correct	8 ms	1016 KB	Output is correct
9	Correct	9 ms	1016 KB	Output is correct
10	Correct	17 ms	1016 KB	Output is correct
11	Correct	14 ms	1016 KB	Output is correct
12	Correct	13 ms	1016 KB	Output is correct
13	Correct	22 ms	1016 KB	Output is correct
14	Correct	28 ms	1016 KB	Output is correct
15	Correct	18 ms	1016 KB	Output is correct
16	Correct	20 ms	1016 KB	Output is correct
17	Correct	21 ms	1016 KB	Output is correct
18	Correct	7 ms	1016 KB	Output is correct
19	Correct	7 ms	1016 KB	Output is correct
20	Correct	10 ms	1016 KB	Output is correct
21	Correct	9 ms	1016 KB	Output is correct

Subtask #4
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	133 ms	1016 KB	Output is correct
2	Correct	27 ms	1016 KB	Output is correct
3	Correct	47 ms	1016 KB	Output is correct
4	Correct	29 ms	1016 KB	Output is correct
5	Correct	27 ms	1016 KB	Output is correct
6	Correct	11 ms	1016 KB	Output is correct
7	Correct	15 ms	1016 KB	Output is correct
8	Correct	12 ms	1016 KB	Output is correct
9	Correct	12 ms	1016 KB	Output is correct
10	Correct	351 ms	1016 KB	Output is correct
11	Correct	274 ms	1016 KB	Output is correct
12	Correct	278 ms	1016 KB	Output is correct
13	Correct	254 ms	1016 KB	Output is correct
14	Correct	44 ms	1016 KB	Output is correct
15	Correct	51 ms	1016 KB	Output is correct
16	Correct	46 ms	1016 KB	Output is correct
17	Correct	33 ms	1016 KB	Output is correct
18	Correct	8 ms	1016 KB	Output is correct
19	Correct	6 ms	1016 KB	Output is correct
20	Correct	7 ms	1016 KB	Output is correct
21	Correct	7 ms	1016 KB	Output is correct

Subtask #5
0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	376 KB	Output is correct
2	Correct	6 ms	540 KB	Output is correct
3	Correct	5 ms	540 KB	Output is correct
4	Correct	5 ms	540 KB	Output is correct
5	Correct	7 ms	552 KB	Output is correct
6	Correct	5 ms	552 KB	Output is correct
7	Correct	12 ms	552 KB	Output is correct
8	Correct	9 ms	552 KB	Output is correct
9	Correct	9 ms	672 KB	Output is correct
10	Correct	9 ms	672 KB	Output is correct
11	Correct	8 ms	672 KB	Output is correct
12	Correct	12 ms	672 KB	Output is correct
13	Correct	4 ms	672 KB	Output is correct
14	Correct	10 ms	672 KB	Output is correct
15	Correct	5 ms	672 KB	Output is correct
16	Correct	68 ms	672 KB	Output is correct
17	Correct	54 ms	724 KB	Output is correct
18	Correct	55 ms	728 KB	Output is correct
19	Correct	18 ms	728 KB	Output is correct
20	Correct	26 ms	728 KB	Output is correct
21	Correct	23 ms	728 KB	Output is correct
22	Correct	62 ms	728 KB	Output is correct
23	Correct	63 ms	728 KB	Output is correct
24	Correct	15 ms	728 KB	Output is correct
25	Correct	209 ms	852 KB	Output is correct
26	Correct	229 ms	852 KB	Output is correct
27	Correct	112 ms	852 KB	Output is correct
28	Correct	232 ms	868 KB	Output is correct
29	Correct	34 ms	868 KB	Output is correct
30	Correct	44 ms	868 KB	Output is correct
31	Correct	42 ms	868 KB	Output is correct
32	Correct	50 ms	868 KB	Output is correct
33	Correct	262 ms	888 KB	Output is correct
34	Correct	252 ms	888 KB	Output is correct
35	Correct	448 ms	888 KB	Output is correct
36	Correct	333 ms	1016 KB	Output is correct
37	Correct	223 ms	1016 KB	Output is correct
38	Correct	7 ms	1016 KB	Output is correct
39	Correct	7 ms	1016 KB	Output is correct
40	Correct	6 ms	1016 KB	Output is correct
41	Correct	6 ms	1016 KB	Output is correct
42	Correct	8 ms	1016 KB	Output is correct
43	Correct	8 ms	1016 KB	Output is correct
44	Correct	8 ms	1016 KB	Output is correct
45	Correct	9 ms	1016 KB	Output is correct
46	Correct	17 ms	1016 KB	Output is correct
47	Correct	14 ms	1016 KB	Output is correct
48	Correct	13 ms	1016 KB	Output is correct
49	Correct	22 ms	1016 KB	Output is correct
50	Correct	28 ms	1016 KB	Output is correct
51	Correct	18 ms	1016 KB	Output is correct
52	Correct	20 ms	1016 KB	Output is correct
53	Correct	21 ms	1016 KB	Output is correct
54	Correct	7 ms	1016 KB	Output is correct
55	Correct	7 ms	1016 KB	Output is correct
56	Correct	10 ms	1016 KB	Output is correct
57	Correct	9 ms	1016 KB	Output is correct
58	Correct	133 ms	1016 KB	Output is correct
59	Correct	27 ms	1016 KB	Output is correct
60	Correct	47 ms	1016 KB	Output is correct
61	Correct	29 ms	1016 KB	Output is correct
62	Correct	27 ms	1016 KB	Output is correct
63	Correct	11 ms	1016 KB	Output is correct
64	Correct	15 ms	1016 KB	Output is correct
65	Correct	12 ms	1016 KB	Output is correct
66	Correct	12 ms	1016 KB	Output is correct
67	Correct	351 ms	1016 KB	Output is correct
68	Correct	274 ms	1016 KB	Output is correct
69	Correct	278 ms	1016 KB	Output is correct
70	Correct	254 ms	1016 KB	Output is correct
71	Correct	44 ms	1016 KB	Output is correct
72	Correct	51 ms	1016 KB	Output is correct
73	Correct	46 ms	1016 KB	Output is correct
74	Correct	33 ms	1016 KB	Output is correct
75	Correct	8 ms	1016 KB	Output is correct
76	Correct	6 ms	1016 KB	Output is correct
77	Correct	7 ms	1016 KB	Output is correct
78	Correct	7 ms	1016 KB	Output is correct
79	Correct	332 ms	1356 KB	Output is correct
80	Correct	98 ms	1356 KB	Output is correct
81	Correct	111 ms	1356 KB	Output is correct
82	Correct	22 ms	1356 KB	Output is correct
83	Correct	28 ms	1356 KB	Output is correct
84	Correct	15 ms	1356 KB	Output is correct
85	Correct	14 ms	1356 KB	Output is correct
86	Correct	18 ms	1356 KB	Output is correct
87	Correct	17 ms	1356 KB	Output is correct
88	Correct	62 ms	1356 KB	Output is correct
89	Correct	250 ms	1356 KB	Output is correct
90	Correct	150 ms	1356 KB	Output is correct
91	Correct	194 ms	1356 KB	Output is correct
92	Correct	10 ms	1356 KB	Output is correct
93	Execution timed out	1089 ms	1356 KB	Time limit exceeded
94	Halted	0 ms	0 KB	-

답안 #60215

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 17.0 / 17.0

Subtask #3 26.0 / 26.0

Subtask #4 23.0 / 23.0

Subtask #5 0 / 18.0

Subtask #1
16.0 / 16.0

Subtask #2
17.0 / 17.0

Subtask #3
26.0 / 26.0

Subtask #4
23.0 / 23.0

Subtask #5
0 / 18.0