oj.uz

Submission #895692

# Submission time Handle Problem Language Result Execution time Memory
895692 2023-12-30T14:28:44 Z Unforgettablepl Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 226 ms 32620 KB 
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
/*
ID: samikgo1
TASK:
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef complex<ll> point;
#define X real()
#define Y imag()
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
//#define f first
//#define s second
//#define x first
//#define y second
const ll INF = 1e17;
const ll sqrtn = 440;
const ll modulo = 1e9+7;
const ll siz = 262144;
const ll hashp = 923981238;
const ll hashm = 932439994;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>

#define int ll

int memo[1594323];

int get(string &s,int i){
    if(memo[i]!=-1)return memo[i];
    int p = 1;
    for(char&x:s) {
        if (x == '?') {
            x = '0';
            int ans = get(s, i + p);
            x = '1';
            ans += get(s, i + 2 * p);
            x = '?';
            return memo[i] = ans;
        }
        p*=3;
    }
}

int getidx(string s){
    int p = 1;
    int ans = 0;
    for(char&a:s){
        if(a=='0')ans+=p;
        else if(a=='1')ans+=p*2;
        p*=3;
    }
    return ans;
}

void solve() {
    for(int&i:memo)i=-1;
    int l,q;
    cin >> l >> q;
    for(int i=0;i<(1<<l);i++){
        char a;cin>>a;
        a-='0';
        memo[getidx(bitset<13>(i).to_string())] = a;
    }
    for(int i=1;i<=q;i++){
        string s;cin>>s;
        for(int x=0;x<13-l;x++)s.insert(s.begin(),'0');
        cout << get(s,getidx(s)) << '\n';
    }
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
//    freopen("cses.fi.txt","r",stdin);
//    freopen(".out","w",stdout);
//    int t;
//    cin >> t;
//    while(t--)
    solve();
}

Compilation message

snake_escaping.cpp: In function 'll get(std::string&, ll)':
snake_escaping.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
   51 | }
      | ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12928 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12888 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12928 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12928 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12888 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12928 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 163 ms 16768 KB Output is correct
12 Correct 197 ms 16656 KB Output is correct
13 Correct 213 ms 15700 KB Output is correct
14 Correct 186 ms 16136 KB Output is correct
15 Correct 173 ms 16720 KB Output is correct
16 Correct 176 ms 15956 KB Output is correct
17 Correct 195 ms 15956 KB Output is correct
18 Correct 156 ms 17748 KB Output is correct
19 Correct 188 ms 14848 KB Output is correct
20 Correct 156 ms 16468 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12928 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12888 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12928 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 163 ms 16768 KB Output is correct
12 Correct 197 ms 16656 KB Output is correct
13 Correct 213 ms 15700 KB Output is correct
14 Correct 186 ms 16136 KB Output is correct
15 Correct 173 ms 16720 KB Output is correct
16 Correct 176 ms 15956 KB Output is correct
17 Correct 195 ms 15956 KB Output is correct
18 Correct 156 ms 17748 KB Output is correct
19 Correct 188 ms 14848 KB Output is correct
20 Correct 156 ms 16468 KB Output is correct
21 Correct 160 ms 17140 KB Output is correct
22 Correct 191 ms 17020 KB Output is correct
23 Correct 192 ms 15956 KB Output is correct
24 Correct 218 ms 15704 KB Output is correct
25 Correct 160 ms 17740 KB Output is correct
26 Correct 207 ms 19672 KB Output is correct
27 Correct 222 ms 30032 KB Output is correct
28 Correct 139 ms 32620 KB Output is correct
29 Correct 174 ms 28408 KB Output is correct
30 Correct 136 ms 30748 KB Output is correct
31 Correct 198 ms 30584 KB Output is correct
32 Correct 199 ms 30496 KB Output is correct
33 Correct 157 ms 29436 KB Output is correct
34 Correct 201 ms 29512 KB Output is correct
35 Correct 226 ms 29876 KB Output is correct
36 Correct 140 ms 28380 KB Output is correct
37 Correct 179 ms 30816 KB Output is correct
38 Correct 190 ms 28536 KB Output is correct
39 Correct 188 ms 29552 KB Output is correct
40 Correct 186 ms 29404 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12928 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12888 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12928 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Runtime error 101 ms 25680 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12928 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12888 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12928 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 163 ms 16768 KB Output is correct
12 Correct 197 ms 16656 KB Output is correct
13 Correct 213 ms 15700 KB Output is correct
14 Correct 186 ms 16136 KB Output is correct
15 Correct 173 ms 16720 KB Output is correct
16 Correct 176 ms 15956 KB Output is correct
17 Correct 195 ms 15956 KB Output is correct
18 Correct 156 ms 17748 KB Output is correct
19 Correct 188 ms 14848 KB Output is correct
20 Correct 156 ms 16468 KB Output is correct
21 Correct 160 ms 17140 KB Output is correct
22 Correct 191 ms 17020 KB Output is correct
23 Correct 192 ms 15956 KB Output is correct
24 Correct 218 ms 15704 KB Output is correct
25 Correct 160 ms 17740 KB Output is correct
26 Correct 207 ms 19672 KB Output is correct
27 Correct 222 ms 30032 KB Output is correct
28 Correct 139 ms 32620 KB Output is correct
29 Correct 174 ms 28408 KB Output is correct
30 Correct 136 ms 30748 KB Output is correct
31 Correct 198 ms 30584 KB Output is correct
32 Correct 199 ms 30496 KB Output is correct
33 Correct 157 ms 29436 KB Output is correct
34 Correct 201 ms 29512 KB Output is correct
35 Correct 226 ms 29876 KB Output is correct
36 Correct 140 ms 28380 KB Output is correct
37 Correct 179 ms 30816 KB Output is correct
38 Correct 190 ms 28536 KB Output is correct
39 Correct 188 ms 29552 KB Output is correct
40 Correct 186 ms 29404 KB Output is correct
41 Runtime error 101 ms 25680 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -