oj.uz

Submission #399853

# Submission time Handle Problem Language Result Execution time Memory
399853 2021-05-06T18:13:10 Z MarcoMeijer Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 45612 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<<21);
const int SQ = 7;

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 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;
}


int bm;
int getTot(int x) {
    if(tot[x] != -1) return tot[x];
    if(nxt2[x] == -1) {
        return tot[x] = a[bm|nxt1[x]];
    } else {
        return tot[x] = getTot(nxt1[x]) + getTot(nxt2[x]);
    }
}

void program() {
    // pre calculations
    int ways3 = 1;
    RE(_,20-SQ) ways3 *= 3;
    RE(i,ways3) {
        string t = intToString(i);
        nxt1[i] = -1, nxt2[i] = -1;
        RE(j,20-SQ) if(t[j] == '?') {
            t[j] = '0';
            nxt1[i] = stringToInt(t);
            t[j] = '1';
            nxt2[i] = stringToInt(t);
            break;
        }
        if(nxt1[i] == -1) {
            nxt1[i] = 0;
            RE(j,20-SQ) if(t[19-SQ-j] == '1') nxt1[i] |= (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] = stringToInt(t.substr(SQ,20-SQ));
    }

    RE(i,(1<<SQ)) {
        bm = (i<<(20-SQ));
        memset(tot,-1,sizeof(tot));
        int ri = ~i;
        RE(j,q)
            if((query0[j]&i) == 0 && (query1[j]&ri) == 0)
                ans[j] += getTot(lst[j]);
    }

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 21024 KB Output is correct
2 Correct 375 ms 21016 KB Output is correct
3 Correct 373 ms 21060 KB Output is correct
4 Correct 375 ms 21060 KB Output is correct
5 Correct 382 ms 21040 KB Output is correct
6 Correct 378 ms 20960 KB Output is correct
7 Correct 387 ms 21060 KB Output is correct
8 Correct 374 ms 21024 KB Output is correct
9 Correct 384 ms 20964 KB Output is correct
10 Correct 380 ms 20964 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 21024 KB Output is correct
2 Correct 375 ms 21016 KB Output is correct
3 Correct 373 ms 21060 KB Output is correct
4 Correct 375 ms 21060 KB Output is correct
5 Correct 382 ms 21040 KB Output is correct
6 Correct 378 ms 20960 KB Output is correct
7 Correct 387 ms 21060 KB Output is correct
8 Correct 374 ms 21024 KB Output is correct
9 Correct 384 ms 20964 KB Output is correct
10 Correct 380 ms 20964 KB Output is correct
11 Correct 871 ms 37352 KB Output is correct
12 Correct 827 ms 37060 KB Output is correct
13 Correct 845 ms 36304 KB Output is correct
14 Correct 848 ms 36424 KB Output is correct
15 Correct 851 ms 37332 KB Output is correct
16 Correct 868 ms 36552 KB Output is correct
17 Correct 863 ms 36456 KB Output is correct
18 Correct 825 ms 38340 KB Output is correct
19 Correct 856 ms 35280 KB Output is correct
20 Correct 877 ms 37064 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 21024 KB Output is correct
2 Correct 375 ms 21016 KB Output is correct
3 Correct 373 ms 21060 KB Output is correct
4 Correct 375 ms 21060 KB Output is correct
5 Correct 382 ms 21040 KB Output is correct
6 Correct 378 ms 20960 KB Output is correct
7 Correct 387 ms 21060 KB Output is correct
8 Correct 374 ms 21024 KB Output is correct
9 Correct 384 ms 20964 KB Output is correct
10 Correct 380 ms 20964 KB Output is correct
11 Correct 871 ms 37352 KB Output is correct
12 Correct 827 ms 37060 KB Output is correct
13 Correct 845 ms 36304 KB Output is correct
14 Correct 848 ms 36424 KB Output is correct
15 Correct 851 ms 37332 KB Output is correct
16 Correct 868 ms 36552 KB Output is correct
17 Correct 863 ms 36456 KB Output is correct
18 Correct 825 ms 38340 KB Output is correct
19 Correct 856 ms 35280 KB Output is correct
20 Correct 877 ms 37064 KB Output is correct
21 Correct 885 ms 37516 KB Output is correct
22 Correct 847 ms 37744 KB Output is correct
23 Correct 897 ms 36760 KB Output is correct
24 Correct 891 ms 36396 KB Output is correct
25 Correct 877 ms 38408 KB Output is correct
26 Correct 958 ms 36824 KB Output is correct
27 Correct 1048 ms 36832 KB Output is correct
28 Correct 851 ms 39436 KB Output is correct
29 Correct 914 ms 35352 KB Output is correct
30 Correct 932 ms 37592 KB Output is correct
31 Correct 960 ms 37412 KB Output is correct
32 Correct 909 ms 37444 KB Output is correct
33 Correct 892 ms 36204 KB Output is correct
34 Correct 949 ms 36356 KB Output is correct
35 Correct 1000 ms 36932 KB Output is correct
36 Correct 834 ms 35460 KB Output is correct
37 Correct 838 ms 37312 KB Output is correct
38 Correct 883 ms 35472 KB Output is correct
39 Correct 925 ms 36504 KB Output is correct
40 Correct 901 ms 36504 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 21024 KB Output is correct
2 Correct 375 ms 21016 KB Output is correct
3 Correct 373 ms 21060 KB Output is correct
4 Correct 375 ms 21060 KB Output is correct
5 Correct 382 ms 21040 KB Output is correct
6 Correct 378 ms 20960 KB Output is correct
7 Correct 387 ms 21060 KB Output is correct
8 Correct 374 ms 21024 KB Output is correct
9 Correct 384 ms 20964 KB Output is correct
10 Correct 380 ms 20964 KB Output is correct
11 Correct 565 ms 27284 KB Output is correct
12 Correct 681 ms 27376 KB Output is correct
13 Correct 550 ms 27520 KB Output is correct
14 Correct 685 ms 27620 KB Output is correct
15 Correct 1771 ms 27592 KB Output is correct
16 Correct 812 ms 27448 KB Output is correct
17 Correct 832 ms 27456 KB Output is correct
18 Correct 483 ms 27076 KB Output is correct
19 Correct 441 ms 27112 KB Output is correct
20 Correct 689 ms 27128 KB Output is correct
21 Correct 1166 ms 27228 KB Output is correct
22 Correct 708 ms 27360 KB Output is correct
23 Correct 484 ms 27340 KB Output is correct
24 Correct 615 ms 27236 KB Output is correct
25 Correct 814 ms 27368 KB Output is correct
26 Correct 414 ms 26948 KB Output is correct
27 Correct 556 ms 27148 KB Output is correct
28 Correct 429 ms 27148 KB Output is correct
29 Correct 580 ms 27288 KB Output is correct
30 Correct 617 ms 27292 KB Output is correct
31 Correct 447 ms 27236 KB Output is correct
32 Correct 816 ms 27224 KB Output is correct
33 Correct 814 ms 27356 KB Output is correct
34 Correct 423 ms 26916 KB Output is correct
35 Correct 893 ms 27240 KB Output is correct
36 Correct 898 ms 27236 KB Output is correct
37 Correct 886 ms 27236 KB Output is correct
38 Correct 888 ms 27236 KB Output is correct
39 Correct 885 ms 27296 KB Output is correct
40 Correct 888 ms 27332 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 21024 KB Output is correct
2 Correct 375 ms 21016 KB Output is correct
3 Correct 373 ms 21060 KB Output is correct
4 Correct 375 ms 21060 KB Output is correct
5 Correct 382 ms 21040 KB Output is correct
6 Correct 378 ms 20960 KB Output is correct
7 Correct 387 ms 21060 KB Output is correct
8 Correct 374 ms 21024 KB Output is correct
9 Correct 384 ms 20964 KB Output is correct
10 Correct 380 ms 20964 KB Output is correct
11 Correct 871 ms 37352 KB Output is correct
12 Correct 827 ms 37060 KB Output is correct
13 Correct 845 ms 36304 KB Output is correct
14 Correct 848 ms 36424 KB Output is correct
15 Correct 851 ms 37332 KB Output is correct
16 Correct 868 ms 36552 KB Output is correct
17 Correct 863 ms 36456 KB Output is correct
18 Correct 825 ms 38340 KB Output is correct
19 Correct 856 ms 35280 KB Output is correct
20 Correct 877 ms 37064 KB Output is correct
21 Correct 885 ms 37516 KB Output is correct
22 Correct 847 ms 37744 KB Output is correct
23 Correct 897 ms 36760 KB Output is correct
24 Correct 891 ms 36396 KB Output is correct
25 Correct 877 ms 38408 KB Output is correct
26 Correct 958 ms 36824 KB Output is correct
27 Correct 1048 ms 36832 KB Output is correct
28 Correct 851 ms 39436 KB Output is correct
29 Correct 914 ms 35352 KB Output is correct
30 Correct 932 ms 37592 KB Output is correct
31 Correct 960 ms 37412 KB Output is correct
32 Correct 909 ms 37444 KB Output is correct
33 Correct 892 ms 36204 KB Output is correct
34 Correct 949 ms 36356 KB Output is correct
35 Correct 1000 ms 36932 KB Output is correct
36 Correct 834 ms 35460 KB Output is correct
37 Correct 838 ms 37312 KB Output is correct
38 Correct 883 ms 35472 KB Output is correct
39 Correct 925 ms 36504 KB Output is correct
40 Correct 901 ms 36504 KB Output is correct
41 Correct 565 ms 27284 KB Output is correct
42 Correct 681 ms 27376 KB Output is correct
43 Correct 550 ms 27520 KB Output is correct
44 Correct 685 ms 27620 KB Output is correct
45 Correct 1771 ms 27592 KB Output is correct
46 Correct 812 ms 27448 KB Output is correct
47 Correct 832 ms 27456 KB Output is correct
48 Correct 483 ms 27076 KB Output is correct
49 Correct 441 ms 27112 KB Output is correct
50 Correct 689 ms 27128 KB Output is correct
51 Correct 1166 ms 27228 KB Output is correct
52 Correct 708 ms 27360 KB Output is correct
53 Correct 484 ms 27340 KB Output is correct
54 Correct 615 ms 27236 KB Output is correct
55 Correct 814 ms 27368 KB Output is correct
56 Correct 414 ms 26948 KB Output is correct
57 Correct 556 ms 27148 KB Output is correct
58 Correct 429 ms 27148 KB Output is correct
59 Correct 580 ms 27288 KB Output is correct
60 Correct 617 ms 27292 KB Output is correct
61 Correct 447 ms 27236 KB Output is correct
62 Correct 816 ms 27224 KB Output is correct
63 Correct 814 ms 27356 KB Output is correct
64 Correct 423 ms 26916 KB Output is correct
65 Correct 893 ms 27240 KB Output is correct
66 Correct 898 ms 27236 KB Output is correct
67 Correct 886 ms 27236 KB Output is correct
68 Correct 888 ms 27236 KB Output is correct
69 Correct 885 ms 27296 KB Output is correct
70 Correct 888 ms 27332 KB Output is correct
71 Correct 1370 ms 43084 KB Output is correct
72 Correct 1513 ms 43212 KB Output is correct
73 Execution timed out 2075 ms 45612 KB Time limit exceeded
74 Halted 0 ms 0 KB -