oj.uz

Submission #399863

# Submission time Handle Problem Language Result Execution time Memory
399863 2021-05-06T18:29:40 Z MarcoMeijer Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 33712 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int N = (1<<20);
const int SQ = 8;

int n, l, q;
int a[N];
int nxt1[N], nxt2[N];
int tot[N], ans[N];
string s;
int query0[N], query1[N];
int f[N], m;
int lst[N];

int stringToInt(string s) {
    int res = 0;
    RE(i,20-SQ) {
        res *= 3;
        if(s[i] == '0') res += 0;
        if(s[i] == '1') res += 1;
        if(s[i] == '?') res += 2;
    }
    return res;
}
string intToString(int x) {
    string res;
    RE(_,20-SQ) {
        if((x%3) == 0) res += '0';
        if((x%3) == 1) res += '1';
        if((x%3) == 2) res += '?';
        x /= 3;
    }
    reverse(all(res));
    return res;
}

void program() {
    // pre calculations
    int ways3 = 1;
    m = (1<<(20-SQ));
    RE(_,20-SQ) ways3 *= 3;
    int x=0, y=m;
    RE(i,ways3) {
        string t = intToString(i);
        int a = 0;
        bool hasQ = false;
        RE(j,20-SQ) if(t[j] == '?') hasQ = true;
        if(hasQ) a = y++;
        else     a = x++;
        f[i] = a;
        
        nxt1[a] = -1, nxt2[a] = -1;
        RE(j,20-SQ) if(t[j] == '?') {
            t[j] = '0';
            nxt1[a] = f[stringToInt(t)];
            t[j] = '1';
            nxt2[a] = f[stringToInt(t)];
            break;
        }
        if(!hasQ) {
            nxt1[a] = 0;
            RE(j,20-SQ) if(t[19-SQ-j] == '1') nxt1[a] |= (1<<j);
        }
    }

    // input
    IN(l,q,s); n=(1<<l);
    RE(i,n) a[i] = s[i]-'0';
    string u; u.assign(20-l,'0');
    RE(i,q) {
        string t; IN(t);
        t = u + t;
        RE(j,SQ) if(t[SQ-1-j] == '0') query0[i] |= (1<<j);
        RE(j,SQ) if(t[SQ-1-j] == '1') query1[i] |= (1<<j);
        lst[i] = f[stringToInt(t.substr(SQ,20-SQ))];
    }

    RE(i,(1<<SQ)) {
        int bm = (i<<(20-SQ));
        RE(j,m) tot[j] = a[bm|nxt1[j]];
        REP(j,m,ways3) tot[j] = tot[nxt1[j]] + tot[nxt2[j]];
        int ri = ~i;
        RE(j,q) ans[j] += int(((query0[j]&i) == 0 && (query1[j]&ri) == 0)) * tot[lst[j]];
    }

    RE(i,q) OUTL(ans[i]);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 8608 KB Output is correct
2 Correct 256 ms 8644 KB Output is correct
3 Correct 259 ms 8768 KB Output is correct
4 Correct 253 ms 8676 KB Output is correct
5 Correct 260 ms 8704 KB Output is correct
6 Correct 254 ms 8644 KB Output is correct
7 Correct 252 ms 8644 KB Output is correct
8 Correct 262 ms 8728 KB Output is correct
9 Correct 258 ms 8688 KB Output is correct
10 Correct 254 ms 8704 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 8608 KB Output is correct
2 Correct 256 ms 8644 KB Output is correct
3 Correct 259 ms 8768 KB Output is correct
4 Correct 253 ms 8676 KB Output is correct
5 Correct 260 ms 8704 KB Output is correct
6 Correct 254 ms 8644 KB Output is correct
7 Correct 252 ms 8644 KB Output is correct
8 Correct 262 ms 8728 KB Output is correct
9 Correct 258 ms 8688 KB Output is correct
10 Correct 254 ms 8704 KB Output is correct
11 Correct 1016 ms 24396 KB Output is correct
12 Correct 1033 ms 24008 KB Output is correct
13 Correct 1078 ms 23256 KB Output is correct
14 Correct 1086 ms 23452 KB Output is correct
15 Correct 1062 ms 24440 KB Output is correct
16 Correct 1113 ms 23612 KB Output is correct
17 Correct 1104 ms 23624 KB Output is correct
18 Correct 967 ms 25632 KB Output is correct
19 Correct 982 ms 22452 KB Output is correct
20 Correct 1059 ms 24132 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 8608 KB Output is correct
2 Correct 256 ms 8644 KB Output is correct
3 Correct 259 ms 8768 KB Output is correct
4 Correct 253 ms 8676 KB Output is correct
5 Correct 260 ms 8704 KB Output is correct
6 Correct 254 ms 8644 KB Output is correct
7 Correct 252 ms 8644 KB Output is correct
8 Correct 262 ms 8728 KB Output is correct
9 Correct 258 ms 8688 KB Output is correct
10 Correct 254 ms 8704 KB Output is correct
11 Correct 1016 ms 24396 KB Output is correct
12 Correct 1033 ms 24008 KB Output is correct
13 Correct 1078 ms 23256 KB Output is correct
14 Correct 1086 ms 23452 KB Output is correct
15 Correct 1062 ms 24440 KB Output is correct
16 Correct 1113 ms 23612 KB Output is correct
17 Correct 1104 ms 23624 KB Output is correct
18 Correct 967 ms 25632 KB Output is correct
19 Correct 982 ms 22452 KB Output is correct
20 Correct 1059 ms 24132 KB Output is correct
21 Correct 1102 ms 28512 KB Output is correct
22 Correct 1136 ms 24564 KB Output is correct
23 Correct 1430 ms 27692 KB Output is correct
24 Correct 1415 ms 27364 KB Output is correct
25 Correct 1314 ms 29372 KB Output is correct
26 Correct 1479 ms 27848 KB Output is correct
27 Correct 1458 ms 27852 KB Output is correct
28 Correct 986 ms 26504 KB Output is correct
29 Correct 1055 ms 26368 KB Output is correct
30 Correct 1127 ms 28448 KB Output is correct
31 Correct 1429 ms 28364 KB Output is correct
32 Correct 1421 ms 28352 KB Output is correct
33 Correct 1326 ms 27204 KB Output is correct
34 Correct 1455 ms 27500 KB Output is correct
35 Correct 1473 ms 27804 KB Output is correct
36 Correct 976 ms 26352 KB Output is correct
37 Correct 1097 ms 24428 KB Output is correct
38 Correct 1070 ms 26420 KB Output is correct
39 Correct 1442 ms 27572 KB Output is correct
40 Correct 1413 ms 27328 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 8608 KB Output is correct
2 Correct 256 ms 8644 KB Output is correct
3 Correct 259 ms 8768 KB Output is correct
4 Correct 253 ms 8676 KB Output is correct
5 Correct 260 ms 8704 KB Output is correct
6 Correct 254 ms 8644 KB Output is correct
7 Correct 252 ms 8644 KB Output is correct
8 Correct 262 ms 8728 KB Output is correct
9 Correct 258 ms 8688 KB Output is correct
10 Correct 254 ms 8704 KB Output is correct
11 Correct 312 ms 14760 KB Output is correct
12 Correct 313 ms 14784 KB Output is correct
13 Correct 334 ms 14880 KB Output is correct
14 Correct 331 ms 14824 KB Output is correct
15 Correct 350 ms 14992 KB Output is correct
16 Correct 338 ms 14944 KB Output is correct
17 Correct 339 ms 14952 KB Output is correct
18 Correct 300 ms 14692 KB Output is correct
19 Correct 309 ms 14744 KB Output is correct
20 Correct 314 ms 14952 KB Output is correct
21 Correct 343 ms 14928 KB Output is correct
22 Correct 344 ms 14820 KB Output is correct
23 Correct 350 ms 14772 KB Output is correct
24 Correct 340 ms 14868 KB Output is correct
25 Correct 335 ms 14820 KB Output is correct
26 Correct 291 ms 14564 KB Output is correct
27 Correct 314 ms 14804 KB Output is correct
28 Correct 311 ms 14820 KB Output is correct
29 Correct 355 ms 14932 KB Output is correct
30 Correct 334 ms 14820 KB Output is correct
31 Correct 321 ms 14952 KB Output is correct
32 Correct 333 ms 14880 KB Output is correct
33 Correct 340 ms 14860 KB Output is correct
34 Correct 292 ms 14536 KB Output is correct
35 Correct 345 ms 14896 KB Output is correct
36 Correct 354 ms 14920 KB Output is correct
37 Correct 350 ms 14836 KB Output is correct
38 Correct 354 ms 14940 KB Output is correct
39 Correct 345 ms 14864 KB Output is correct
40 Correct 359 ms 14872 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 8608 KB Output is correct
2 Correct 256 ms 8644 KB Output is correct
3 Correct 259 ms 8768 KB Output is correct
4 Correct 253 ms 8676 KB Output is correct
5 Correct 260 ms 8704 KB Output is correct
6 Correct 254 ms 8644 KB Output is correct
7 Correct 252 ms 8644 KB Output is correct
8 Correct 262 ms 8728 KB Output is correct
9 Correct 258 ms 8688 KB Output is correct
10 Correct 254 ms 8704 KB Output is correct
11 Correct 1016 ms 24396 KB Output is correct
12 Correct 1033 ms 24008 KB Output is correct
13 Correct 1078 ms 23256 KB Output is correct
14 Correct 1086 ms 23452 KB Output is correct
15 Correct 1062 ms 24440 KB Output is correct
16 Correct 1113 ms 23612 KB Output is correct
17 Correct 1104 ms 23624 KB Output is correct
18 Correct 967 ms 25632 KB Output is correct
19 Correct 982 ms 22452 KB Output is correct
20 Correct 1059 ms 24132 KB Output is correct
21 Correct 1102 ms 28512 KB Output is correct
22 Correct 1136 ms 24564 KB Output is correct
23 Correct 1430 ms 27692 KB Output is correct
24 Correct 1415 ms 27364 KB Output is correct
25 Correct 1314 ms 29372 KB Output is correct
26 Correct 1479 ms 27848 KB Output is correct
27 Correct 1458 ms 27852 KB Output is correct
28 Correct 986 ms 26504 KB Output is correct
29 Correct 1055 ms 26368 KB Output is correct
30 Correct 1127 ms 28448 KB Output is correct
31 Correct 1429 ms 28364 KB Output is correct
32 Correct 1421 ms 28352 KB Output is correct
33 Correct 1326 ms 27204 KB Output is correct
34 Correct 1455 ms 27500 KB Output is correct
35 Correct 1473 ms 27804 KB Output is correct
36 Correct 976 ms 26352 KB Output is correct
37 Correct 1097 ms 24428 KB Output is correct
38 Correct 1070 ms 26420 KB Output is correct
39 Correct 1442 ms 27572 KB Output is correct
40 Correct 1413 ms 27328 KB Output is correct
41 Correct 312 ms 14760 KB Output is correct
42 Correct 313 ms 14784 KB Output is correct
43 Correct 334 ms 14880 KB Output is correct
44 Correct 331 ms 14824 KB Output is correct
45 Correct 350 ms 14992 KB Output is correct
46 Correct 338 ms 14944 KB Output is correct
47 Correct 339 ms 14952 KB Output is correct
48 Correct 300 ms 14692 KB Output is correct
49 Correct 309 ms 14744 KB Output is correct
50 Correct 314 ms 14952 KB Output is correct
51 Correct 343 ms 14928 KB Output is correct
52 Correct 344 ms 14820 KB Output is correct
53 Correct 350 ms 14772 KB Output is correct
54 Correct 340 ms 14868 KB Output is correct
55 Correct 335 ms 14820 KB Output is correct
56 Correct 291 ms 14564 KB Output is correct
57 Correct 314 ms 14804 KB Output is correct
58 Correct 311 ms 14820 KB Output is correct
59 Correct 355 ms 14932 KB Output is correct
60 Correct 334 ms 14820 KB Output is correct
61 Correct 321 ms 14952 KB Output is correct
62 Correct 333 ms 14880 KB Output is correct
63 Correct 340 ms 14860 KB Output is correct
64 Correct 292 ms 14536 KB Output is correct
65 Correct 345 ms 14896 KB Output is correct
66 Correct 354 ms 14920 KB Output is correct
67 Correct 350 ms 14836 KB Output is correct
68 Correct 354 ms 14940 KB Output is correct
69 Correct 345 ms 14864 KB Output is correct
70 Correct 359 ms 14872 KB Output is correct
71 Correct 1249 ms 30664 KB Output is correct
72 Correct 1378 ms 30904 KB Output is correct
73 Correct 1803 ms 33204 KB Output is correct
74 Correct 1855 ms 33712 KB Output is correct
75 Execution timed out 2076 ms 30776 KB Time limit exceeded
76 Halted 0 ms 0 KB -