oj.uz

Submission #399871

# Submission time Handle Problem Language Result Execution time Memory
399871 2021-05-06T18:46:33 Z MarcoMeijer Snake Escaping (JOI18_snake_escaping) C++14
100 / 100
 1482 ms 56016 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 f[N], m;
int lst[N];

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

vi appliedBM[6561];
vi appliedI[1024];
vi atI[6561];

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,20-SQ);
        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);
        }
    }

    // pre calc query
    int ways33 = 1;
    RE(_,SQ) ways33 *= 3;
    RE(i,ways33) {
        string t = intToString(i,SQ);
        int bm0=0, bm1=0;
        RE(j,SQ) if(t[SQ-1-j] == '0') bm0 |= (1<<j);
        RE(j,SQ) if(t[SQ-1-j] == '1') bm1 |= (1<<j);
        RE(bm,(1<<SQ)) if((bm0&bm) == 0 && (bm1&(~bm)) == 0) appliedBM[i].pb(bm), appliedI[bm].pb(i);
    }

    // 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;
        int x = stringToInt(t.substr(0,SQ));
        atI[x].pb(i);
        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;
        FOR(x,appliedI[i]) FOR(j,atI[x]) ans[j] += tot[lst[j]];
    }

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

Compilation message

snake_escaping.cpp: In function 'void program()':
snake_escaping.cpp:155:13: warning: unused variable 'ri' [-Wunused-variable]
  155 |         int ri = ~i;
      |             ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 9760 KB Output is correct
2 Correct 263 ms 9684 KB Output is correct
3 Correct 269 ms 9668 KB Output is correct
4 Correct 265 ms 9668 KB Output is correct
5 Correct 266 ms 9668 KB Output is correct
6 Correct 269 ms 9668 KB Output is correct
7 Correct 264 ms 9680 KB Output is correct
8 Correct 264 ms 9672 KB Output is correct
9 Correct 276 ms 9740 KB Output is correct
10 Correct 268 ms 9596 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 9760 KB Output is correct
2 Correct 263 ms 9684 KB Output is correct
3 Correct 269 ms 9668 KB Output is correct
4 Correct 265 ms 9668 KB Output is correct
5 Correct 266 ms 9668 KB Output is correct
6 Correct 269 ms 9668 KB Output is correct
7 Correct 264 ms 9680 KB Output is correct
8 Correct 264 ms 9672 KB Output is correct
9 Correct 276 ms 9740 KB Output is correct
10 Correct 268 ms 9596 KB Output is correct
11 Correct 597 ms 25536 KB Output is correct
12 Correct 610 ms 25288 KB Output is correct
13 Correct 619 ms 24468 KB Output is correct
14 Correct 619 ms 24604 KB Output is correct
15 Correct 596 ms 25476 KB Output is correct
16 Correct 621 ms 24628 KB Output is correct
17 Correct 628 ms 24604 KB Output is correct
18 Correct 567 ms 26540 KB Output is correct
19 Correct 593 ms 23536 KB Output is correct
20 Correct 611 ms 25132 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 9760 KB Output is correct
2 Correct 263 ms 9684 KB Output is correct
3 Correct 269 ms 9668 KB Output is correct
4 Correct 265 ms 9668 KB Output is correct
5 Correct 266 ms 9668 KB Output is correct
6 Correct 269 ms 9668 KB Output is correct
7 Correct 264 ms 9680 KB Output is correct
8 Correct 264 ms 9672 KB Output is correct
9 Correct 276 ms 9740 KB Output is correct
10 Correct 268 ms 9596 KB Output is correct
11 Correct 597 ms 25536 KB Output is correct
12 Correct 610 ms 25288 KB Output is correct
13 Correct 619 ms 24468 KB Output is correct
14 Correct 619 ms 24604 KB Output is correct
15 Correct 596 ms 25476 KB Output is correct
16 Correct 621 ms 24628 KB Output is correct
17 Correct 628 ms 24604 KB Output is correct
18 Correct 567 ms 26540 KB Output is correct
19 Correct 593 ms 23536 KB Output is correct
20 Correct 611 ms 25132 KB Output is correct
21 Correct 629 ms 25756 KB Output is correct
22 Correct 633 ms 25836 KB Output is correct
23 Correct 674 ms 24980 KB Output is correct
24 Correct 667 ms 24868 KB Output is correct
25 Correct 636 ms 27444 KB Output is correct
26 Correct 683 ms 25356 KB Output is correct
27 Correct 678 ms 25200 KB Output is correct
28 Correct 584 ms 27684 KB Output is correct
29 Correct 614 ms 23576 KB Output is correct
30 Correct 638 ms 25944 KB Output is correct
31 Correct 649 ms 25696 KB Output is correct
32 Correct 668 ms 25912 KB Output is correct
33 Correct 643 ms 25568 KB Output is correct
34 Correct 656 ms 24696 KB Output is correct
35 Correct 675 ms 24980 KB Output is correct
36 Correct 558 ms 23476 KB Output is correct
37 Correct 620 ms 25628 KB Output is correct
38 Correct 612 ms 23568 KB Output is correct
39 Correct 654 ms 24796 KB Output is correct
40 Correct 667 ms 24780 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 9760 KB Output is correct
2 Correct 263 ms 9684 KB Output is correct
3 Correct 269 ms 9668 KB Output is correct
4 Correct 265 ms 9668 KB Output is correct
5 Correct 266 ms 9668 KB Output is correct
6 Correct 269 ms 9668 KB Output is correct
7 Correct 264 ms 9680 KB Output is correct
8 Correct 264 ms 9672 KB Output is correct
9 Correct 276 ms 9740 KB Output is correct
10 Correct 268 ms 9596 KB Output is correct
11 Correct 305 ms 15756 KB Output is correct
12 Correct 298 ms 15748 KB Output is correct
13 Correct 301 ms 15716 KB Output is correct
14 Correct 304 ms 15744 KB Output is correct
15 Correct 312 ms 15788 KB Output is correct
16 Correct 306 ms 15808 KB Output is correct
17 Correct 306 ms 15796 KB Output is correct
18 Correct 340 ms 16100 KB Output is correct
19 Correct 291 ms 15512 KB Output is correct
20 Correct 315 ms 15716 KB Output is correct
21 Correct 306 ms 15716 KB Output is correct
22 Correct 312 ms 15844 KB Output is correct
23 Correct 299 ms 15704 KB Output is correct
24 Correct 303 ms 15792 KB Output is correct
25 Correct 312 ms 15764 KB Output is correct
26 Correct 286 ms 15672 KB Output is correct
27 Correct 300 ms 15764 KB Output is correct
28 Correct 290 ms 15588 KB Output is correct
29 Correct 297 ms 15724 KB Output is correct
30 Correct 311 ms 15880 KB Output is correct
31 Correct 295 ms 15700 KB Output is correct
32 Correct 308 ms 15844 KB Output is correct
33 Correct 305 ms 15752 KB Output is correct
34 Correct 288 ms 15692 KB Output is correct
35 Correct 312 ms 15784 KB Output is correct
36 Correct 310 ms 15716 KB Output is correct
37 Correct 316 ms 15744 KB Output is correct
38 Correct 307 ms 15712 KB Output is correct
39 Correct 313 ms 15788 KB Output is correct
40 Correct 308 ms 15792 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 9760 KB Output is correct
2 Correct 263 ms 9684 KB Output is correct
3 Correct 269 ms 9668 KB Output is correct
4 Correct 265 ms 9668 KB Output is correct
5 Correct 266 ms 9668 KB Output is correct
6 Correct 269 ms 9668 KB Output is correct
7 Correct 264 ms 9680 KB Output is correct
8 Correct 264 ms 9672 KB Output is correct
9 Correct 276 ms 9740 KB Output is correct
10 Correct 268 ms 9596 KB Output is correct
11 Correct 597 ms 25536 KB Output is correct
12 Correct 610 ms 25288 KB Output is correct
13 Correct 619 ms 24468 KB Output is correct
14 Correct 619 ms 24604 KB Output is correct
15 Correct 596 ms 25476 KB Output is correct
16 Correct 621 ms 24628 KB Output is correct
17 Correct 628 ms 24604 KB Output is correct
18 Correct 567 ms 26540 KB Output is correct
19 Correct 593 ms 23536 KB Output is correct
20 Correct 611 ms 25132 KB Output is correct
21 Correct 629 ms 25756 KB Output is correct
22 Correct 633 ms 25836 KB Output is correct
23 Correct 674 ms 24980 KB Output is correct
24 Correct 667 ms 24868 KB Output is correct
25 Correct 636 ms 27444 KB Output is correct
26 Correct 683 ms 25356 KB Output is correct
27 Correct 678 ms 25200 KB Output is correct
28 Correct 584 ms 27684 KB Output is correct
29 Correct 614 ms 23576 KB Output is correct
30 Correct 638 ms 25944 KB Output is correct
31 Correct 649 ms 25696 KB Output is correct
32 Correct 668 ms 25912 KB Output is correct
33 Correct 643 ms 25568 KB Output is correct
34 Correct 656 ms 24696 KB Output is correct
35 Correct 675 ms 24980 KB Output is correct
36 Correct 558 ms 23476 KB Output is correct
37 Correct 620 ms 25628 KB Output is correct
38 Correct 612 ms 23568 KB Output is correct
39 Correct 654 ms 24796 KB Output is correct
40 Correct 667 ms 24780 KB Output is correct
41 Correct 305 ms 15756 KB Output is correct
42 Correct 298 ms 15748 KB Output is correct
43 Correct 301 ms 15716 KB Output is correct
44 Correct 304 ms 15744 KB Output is correct
45 Correct 312 ms 15788 KB Output is correct
46 Correct 306 ms 15808 KB Output is correct
47 Correct 306 ms 15796 KB Output is correct
48 Correct 340 ms 16100 KB Output is correct
49 Correct 291 ms 15512 KB Output is correct
50 Correct 315 ms 15716 KB Output is correct
51 Correct 306 ms 15716 KB Output is correct
52 Correct 312 ms 15844 KB Output is correct
53 Correct 299 ms 15704 KB Output is correct
54 Correct 303 ms 15792 KB Output is correct
55 Correct 312 ms 15764 KB Output is correct
56 Correct 286 ms 15672 KB Output is correct
57 Correct 300 ms 15764 KB Output is correct
58 Correct 290 ms 15588 KB Output is correct
59 Correct 297 ms 15724 KB Output is correct
60 Correct 311 ms 15880 KB Output is correct
61 Correct 295 ms 15700 KB Output is correct
62 Correct 308 ms 15844 KB Output is correct
63 Correct 305 ms 15752 KB Output is correct
64 Correct 288 ms 15692 KB Output is correct
65 Correct 312 ms 15784 KB Output is correct
66 Correct 310 ms 15716 KB Output is correct
67 Correct 316 ms 15744 KB Output is correct
68 Correct 307 ms 15712 KB Output is correct
69 Correct 313 ms 15788 KB Output is correct
70 Correct 308 ms 15792 KB Output is correct
71 Correct 929 ms 34316 KB Output is correct
72 Correct 961 ms 32396 KB Output is correct
73 Correct 857 ms 33600 KB Output is correct
74 Correct 919 ms 32712 KB Output is correct
75 Correct 1259 ms 34944 KB Output is correct
76 Correct 962 ms 33572 KB Output is correct
77 Correct 949 ms 34420 KB Output is correct
78 Correct 1482 ms 35740 KB Output is correct
79 Correct 706 ms 31204 KB Output is correct
80 Correct 956 ms 32476 KB Output is correct
81 Correct 1051 ms 35944 KB Output is correct
82 Correct 966 ms 54216 KB Output is correct
83 Correct 776 ms 53664 KB Output is correct
84 Correct 968 ms 54360 KB Output is correct
85 Correct 1012 ms 55592 KB Output is correct
86 Correct 598 ms 51124 KB Output is correct
87 Correct 946 ms 56016 KB Output is correct
88 Correct 717 ms 50708 KB Output is correct
89 Correct 880 ms 55156 KB Output is correct
90 Correct 919 ms 54500 KB Output is correct
91 Correct 812 ms 53424 KB Output is correct
92 Correct 990 ms 54656 KB Output is correct
93 Correct 1050 ms 55812 KB Output is correct
94 Correct 591 ms 51236 KB Output is correct
95 Correct 1103 ms 53980 KB Output is correct
96 Correct 1092 ms 54092 KB Output is correct
97 Correct 1107 ms 54032 KB Output is correct
98 Correct 1081 ms 53900 KB Output is correct
99 Correct 1086 ms 53992 KB Output is correct
100 Correct 1104 ms 54080 KB Output is correct