답안 #60230 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
60230	2018-07-23T22:04:17 Z	Benq	Bowling (BOI15_bow)	C++11	82 / 100	1000 ms	9560 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], ret;
ll m[2][3][301][301], M[2][3][301][301];
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 a, int b, int c, int d, int x, vi y) {
    ll val = m[a][b][c][d];
    int cur = d;
    for (int i: y) if (i != -1) {
        cur += i;
        if (a) c += i, d += i, cur += i, a --;
        if (b) d += i, cur += i, b --;
    }
    
    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 && a == 0 && num[x-2] != -1 && c != num[x-2]) return;
    if (x >= 1 && b == 0 && num[x-1] != -1 && d != num[x-1]) return;
    if (posi == 0 && num[x] != -1 && cur != num[x]) return;
    M[b][posi][d][cur] += val;
}

char get(int j) {
    if (j == 10) return 'x';
    return char('0'+j);
}
bool ok(int x, int y) {
    if (x < 0) return 1;
    if (num[x] == -1) return 1;
    return num[x] == y;
}

ll TMP[2][301][11];

void TRI(int a, int b, int c, int d, int x, int i) {
    ll val = m[a][b][c][d];
    if (tmp[x][0] != '?' && tmp[x][0] != get(i)) return;
    
    int cur = d+i;
    if (a) a --, c += i, d += i, cur += i;
    if (b) b --, d += i, cur += i; 
    
    if (a == 0 && !ok(x-2,c)) return;
    if (b == 0 && !ok(x-1,d)) return;
    TMP[b][d][i] += val;
    // cout << "HA" 
}

void TRI2(int b, int c, int i, int x, int j) {
    if (i+j > 10) return;
    ll val = TMP[b][c][i];
    int cur = c+i;
    if (i+j == 10) {
        if (i == 10) {
            if (tmp[x][1] == '?' || tmp[x][1] == '-') {
                M[b][2][c][cur] += val;
            }
        } else {
            cur += j;
            if (tmp[x][1] == '?' || tmp[x][1] == '/') {
                if (b) b --, c += j, cur += j;
                if (!ok(x-1,c)) return;
                M[b][1][c][cur] += val;
            }
        }
    } else {
        cur += j;
        if (b) b --, c += j, cur += j;
        if (!ok(x-1,c)) return;
        if (!ok(x,cur)) return;
        if (tmp[x][1] == '?' || tmp[x][1] == get(j)) {
            M[0][0][c][cur] += val;
        }
    }
}

void process(int x) {
    vector<vi> posi;
    
    if (x != n-1) {
        memset(TMP,0,sizeof TMP);
        F0R(a,2) F0R(b,3) F0R(c,301) FOR(d,c,301) if (m[a][b][c][d])
            F0R(i,11) TRI(a,b,c,d,x,i);
        F0R(b,2) F0R(c,301) F0R(i,11) if (TMP[b][c][i])
            F0R(j,11) TRI2(b,c,i,x,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});
        
    
        vector<array<int,4>> POSI;
        F0R(a,2) F0R(b,3) F0R(c,301) FOR(d,c,301) 
            if (m[a][b][c][d]) POSI.pb({a,b,c,d});
        
        ret += sz(posi)*sz(POSI);
        for (auto v: posi) for (auto V: POSI)
            tri(V[0],V[1],V[2],V[3],x,v);
    }
            
    F0R(a,2) F0R(b,3) F0R(c,301) FOR(d,c,301) {
        m[a][b][c][d] = M[a][b][c][d];
        M[a][b][c][d] = 0;
    }
}

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];
    
    memset(m,0,sizeof m);
    m[0][0][0][0] = 1;
    F0R(i,n) process(i);
    ll ans = 0;
    F0R(i,301) FOR(j,i,301) ans += m[0][0][i][j];
    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	184 ms	8952 KB	Output is correct
2	Correct	213 ms	9116 KB	Output is correct
3	Correct	239 ms	9116 KB	Output is correct
4	Correct	230 ms	9116 KB	Output is correct
5	Correct	222 ms	9124 KB	Output is correct
6	Correct	225 ms	9124 KB	Output is correct
7	Correct	264 ms	9124 KB	Output is correct
8	Correct	246 ms	9124 KB	Output is correct
9	Correct	206 ms	9124 KB	Output is correct
10	Correct	287 ms	9124 KB	Output is correct
11	Correct	297 ms	9244 KB	Output is correct
12	Correct	99 ms	9244 KB	Output is correct
13	Correct	27 ms	9244 KB	Output is correct
14	Correct	115 ms	9244 KB	Output is correct
15	Correct	30 ms	9244 KB	Output is correct

Subtask #2
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	188 ms	9244 KB	Output is correct
2	Correct	243 ms	9244 KB	Output is correct
3	Correct	241 ms	9244 KB	Output is correct
4	Correct	202 ms	9248 KB	Output is correct
5	Correct	212 ms	9248 KB	Output is correct
6	Correct	269 ms	9248 KB	Output is correct
7	Correct	351 ms	9252 KB	Output is correct
8	Correct	298 ms	9252 KB	Output is correct
9	Correct	386 ms	9252 KB	Output is correct
10	Correct	437 ms	9252 KB	Output is correct
11	Correct	410 ms	9252 KB	Output is correct
12	Correct	393 ms	9252 KB	Output is correct
13	Correct	471 ms	9252 KB	Output is correct
14	Correct	314 ms	9252 KB	Output is correct
15	Correct	301 ms	9252 KB	Output is correct
16	Correct	294 ms	9252 KB	Output is correct
17	Correct	342 ms	9252 KB	Output is correct
18	Correct	421 ms	9312 KB	Output is correct
19	Correct	409 ms	9312 KB	Output is correct
20	Correct	470 ms	9312 KB	Output is correct
21	Correct	441 ms	9312 KB	Output is correct

Subtask #3
26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	138 ms	9312 KB	Output is correct
2	Correct	224 ms	9312 KB	Output is correct
3	Correct	188 ms	9312 KB	Output is correct
4	Correct	212 ms	9312 KB	Output is correct
5	Correct	173 ms	9312 KB	Output is correct
6	Correct	309 ms	9312 KB	Output is correct
7	Correct	262 ms	9312 KB	Output is correct
8	Correct	266 ms	9324 KB	Output is correct
9	Correct	352 ms	9324 KB	Output is correct
10	Correct	412 ms	9324 KB	Output is correct
11	Correct	357 ms	9324 KB	Output is correct
12	Correct	324 ms	9324 KB	Output is correct
13	Correct	363 ms	9324 KB	Output is correct
14	Correct	293 ms	9324 KB	Output is correct
15	Correct	295 ms	9324 KB	Output is correct
16	Correct	298 ms	9324 KB	Output is correct
17	Correct	281 ms	9324 KB	Output is correct
18	Correct	302 ms	9324 KB	Output is correct
19	Correct	298 ms	9324 KB	Output is correct
20	Correct	390 ms	9340 KB	Output is correct
21	Correct	281 ms	9340 KB	Output is correct

Subtask #4
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	225 ms	9340 KB	Output is correct
2	Correct	209 ms	9340 KB	Output is correct
3	Correct	261 ms	9340 KB	Output is correct
4	Correct	193 ms	9468 KB	Output is correct
5	Correct	200 ms	9468 KB	Output is correct
6	Correct	203 ms	9468 KB	Output is correct
7	Correct	170 ms	9468 KB	Output is correct
8	Correct	211 ms	9468 KB	Output is correct
9	Correct	223 ms	9468 KB	Output is correct
10	Correct	254 ms	9468 KB	Output is correct
11	Correct	280 ms	9468 KB	Output is correct
12	Correct	254 ms	9468 KB	Output is correct
13	Correct	250 ms	9468 KB	Output is correct
14	Correct	419 ms	9468 KB	Output is correct
15	Correct	401 ms	9468 KB	Output is correct
16	Correct	340 ms	9468 KB	Output is correct
17	Correct	423 ms	9468 KB	Output is correct
18	Correct	351 ms	9468 KB	Output is correct
19	Correct	371 ms	9468 KB	Output is correct
20	Correct	422 ms	9468 KB	Output is correct
21	Correct	303 ms	9468 KB	Output is correct

Subtask #5
0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	184 ms	8952 KB	Output is correct
2	Correct	213 ms	9116 KB	Output is correct
3	Correct	239 ms	9116 KB	Output is correct
4	Correct	230 ms	9116 KB	Output is correct
5	Correct	222 ms	9124 KB	Output is correct
6	Correct	225 ms	9124 KB	Output is correct
7	Correct	264 ms	9124 KB	Output is correct
8	Correct	246 ms	9124 KB	Output is correct
9	Correct	206 ms	9124 KB	Output is correct
10	Correct	287 ms	9124 KB	Output is correct
11	Correct	297 ms	9244 KB	Output is correct
12	Correct	99 ms	9244 KB	Output is correct
13	Correct	27 ms	9244 KB	Output is correct
14	Correct	115 ms	9244 KB	Output is correct
15	Correct	30 ms	9244 KB	Output is correct
16	Correct	188 ms	9244 KB	Output is correct
17	Correct	243 ms	9244 KB	Output is correct
18	Correct	241 ms	9244 KB	Output is correct
19	Correct	202 ms	9248 KB	Output is correct
20	Correct	212 ms	9248 KB	Output is correct
21	Correct	269 ms	9248 KB	Output is correct
22	Correct	351 ms	9252 KB	Output is correct
23	Correct	298 ms	9252 KB	Output is correct
24	Correct	386 ms	9252 KB	Output is correct
25	Correct	437 ms	9252 KB	Output is correct
26	Correct	410 ms	9252 KB	Output is correct
27	Correct	393 ms	9252 KB	Output is correct
28	Correct	471 ms	9252 KB	Output is correct
29	Correct	314 ms	9252 KB	Output is correct
30	Correct	301 ms	9252 KB	Output is correct
31	Correct	294 ms	9252 KB	Output is correct
32	Correct	342 ms	9252 KB	Output is correct
33	Correct	421 ms	9312 KB	Output is correct
34	Correct	409 ms	9312 KB	Output is correct
35	Correct	470 ms	9312 KB	Output is correct
36	Correct	441 ms	9312 KB	Output is correct
37	Correct	138 ms	9312 KB	Output is correct
38	Correct	224 ms	9312 KB	Output is correct
39	Correct	188 ms	9312 KB	Output is correct
40	Correct	212 ms	9312 KB	Output is correct
41	Correct	173 ms	9312 KB	Output is correct
42	Correct	309 ms	9312 KB	Output is correct
43	Correct	262 ms	9312 KB	Output is correct
44	Correct	266 ms	9324 KB	Output is correct
45	Correct	352 ms	9324 KB	Output is correct
46	Correct	412 ms	9324 KB	Output is correct
47	Correct	357 ms	9324 KB	Output is correct
48	Correct	324 ms	9324 KB	Output is correct
49	Correct	363 ms	9324 KB	Output is correct
50	Correct	293 ms	9324 KB	Output is correct
51	Correct	295 ms	9324 KB	Output is correct
52	Correct	298 ms	9324 KB	Output is correct
53	Correct	281 ms	9324 KB	Output is correct
54	Correct	302 ms	9324 KB	Output is correct
55	Correct	298 ms	9324 KB	Output is correct
56	Correct	390 ms	9340 KB	Output is correct
57	Correct	281 ms	9340 KB	Output is correct
58	Correct	225 ms	9340 KB	Output is correct
59	Correct	209 ms	9340 KB	Output is correct
60	Correct	261 ms	9340 KB	Output is correct
61	Correct	193 ms	9468 KB	Output is correct
62	Correct	200 ms	9468 KB	Output is correct
63	Correct	203 ms	9468 KB	Output is correct
64	Correct	170 ms	9468 KB	Output is correct
65	Correct	211 ms	9468 KB	Output is correct
66	Correct	223 ms	9468 KB	Output is correct
67	Correct	254 ms	9468 KB	Output is correct
68	Correct	280 ms	9468 KB	Output is correct
69	Correct	254 ms	9468 KB	Output is correct
70	Correct	250 ms	9468 KB	Output is correct
71	Correct	419 ms	9468 KB	Output is correct
72	Correct	401 ms	9468 KB	Output is correct
73	Correct	340 ms	9468 KB	Output is correct
74	Correct	423 ms	9468 KB	Output is correct
75	Correct	351 ms	9468 KB	Output is correct
76	Correct	371 ms	9468 KB	Output is correct
77	Correct	422 ms	9468 KB	Output is correct
78	Correct	303 ms	9468 KB	Output is correct
79	Correct	243 ms	9468 KB	Output is correct
80	Correct	225 ms	9468 KB	Output is correct
81	Correct	234 ms	9468 KB	Output is correct
82	Correct	250 ms	9468 KB	Output is correct
83	Correct	280 ms	9468 KB	Output is correct
84	Correct	392 ms	9468 KB	Output is correct
85	Correct	352 ms	9468 KB	Output is correct
86	Correct	291 ms	9468 KB	Output is correct
87	Correct	307 ms	9468 KB	Output is correct
88	Correct	316 ms	9468 KB	Output is correct
89	Correct	329 ms	9468 KB	Output is correct
90	Correct	318 ms	9468 KB	Output is correct
91	Correct	436 ms	9468 KB	Output is correct
92	Correct	331 ms	9468 KB	Output is correct
93	Execution timed out	1080 ms	9560 KB	Time limit exceeded
94	Halted	0 ms	0 KB	-

답안 #60230

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