oj.uz

Submission #896346

# Submission time Handle Problem Language Result Execution time Memory
896346 2024-01-01T09:50:10 Z Unforgettablepl Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 47324 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];
char str[1048577];
char queries[1000001][20];
int ansq[1000001];

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

int getidx(const char *s){
    int p = 1;
    int ans = 0;
    for(int a=0;a<13;a++){
        if(s[a]=='0')ans+=p;
        else if(s[a]=='1')ans+=p*2;
        p*=3;
    }
    return ans;
}

inline bool match(string a,const char *b){
    for(int i=0;i<7;i++)if(b[i]!='?' and a[i]!=b[i])return false;
    return true;
}

void solve() {
    int l,q;
    cin >> l >> q;
    for(int i=0;i<(1<<l);i++)cin >> str[i];
    for(int i=0;i<(1<<l);i++)str[i]-='0';
    for(int i=1;i<=q;i++){
        string s;cin>>s;
        for(int x=0;x<20-l;x++)s.insert(s.begin(),'0');
        for(int x=0;x<20;x++)queries[i][x] = s[x];
    }
    for(int modifier=0;modifier<(1<<7);modifier++){
        if((modifier<<13)>=(1<<l))break;
        string m = bitset<7>(modifier).to_string();
        for(int&i:memo)i=-1;
        for(int i=0;i<(1<<13);i++)memo[getidx(bitset<13>(i).to_string().c_str())]=str[(modifier<<13)+i];
        for(int i=1;i<=q;i++){
            if(!match(m,queries[i]))continue;
            ansq[i]+=get(queries[i]+7,getidx(queries[i]+7));
        }
    }
    for(int i=1;i<=q;i++)cout<<ansq[i]<<'\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(char*, ll)':
snake_escaping.cpp:54:1: warning: control reaches end of non-void function [-Wreturn-type]
   54 | }
      | ^

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16472 KB Output is correct
2 Correct 4 ms 16472 KB Output is correct
3 Correct 4 ms 16472 KB Output is correct
4 Correct 4 ms 16476 KB Output is correct
5 Correct 5 ms 16476 KB Output is correct
6 Correct 4 ms 16476 KB Output is correct
7 Correct 4 ms 16472 KB Output is correct
8 Correct 4 ms 16476 KB Output is correct
9 Correct 4 ms 16476 KB Output is correct
10 Correct 4 ms 16476 KB Output is correct
11 Correct 246 ms 45272 KB Output is correct
12 Correct 289 ms 45016 KB Output is correct
13 Correct 281 ms 44244 KB Output is correct
14 Correct 275 ms 44240 KB Output is correct
15 Correct 264 ms 45264 KB Output is correct
16 Correct 275 ms 44416 KB Output is correct
17 Correct 297 ms 44516 KB Output is correct
18 Correct 248 ms 46260 KB Output is correct
19 Correct 281 ms 43236 KB Output is correct
20 Correct 247 ms 45012 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16472 KB Output is correct
2 Correct 4 ms 16472 KB Output is correct
3 Correct 4 ms 16472 KB Output is correct
4 Correct 4 ms 16476 KB Output is correct
5 Correct 5 ms 16476 KB Output is correct
6 Correct 4 ms 16476 KB Output is correct
7 Correct 4 ms 16472 KB Output is correct
8 Correct 4 ms 16476 KB Output is correct
9 Correct 4 ms 16476 KB Output is correct
10 Correct 4 ms 16476 KB Output is correct
11 Correct 246 ms 45272 KB Output is correct
12 Correct 289 ms 45016 KB Output is correct
13 Correct 281 ms 44244 KB Output is correct
14 Correct 275 ms 44240 KB Output is correct
15 Correct 264 ms 45264 KB Output is correct
16 Correct 275 ms 44416 KB Output is correct
17 Correct 297 ms 44516 KB Output is correct
18 Correct 248 ms 46260 KB Output is correct
19 Correct 281 ms 43236 KB Output is correct
20 Correct 247 ms 45012 KB Output is correct
21 Correct 230 ms 45392 KB Output is correct
22 Correct 291 ms 45396 KB Output is correct
23 Correct 304 ms 44368 KB Output is correct
24 Correct 310 ms 44344 KB Output is correct
25 Correct 256 ms 46236 KB Output is correct
26 Correct 301 ms 44780 KB Output is correct
27 Correct 304 ms 44620 KB Output is correct
28 Correct 237 ms 47324 KB Output is correct
29 Correct 275 ms 43348 KB Output is correct
30 Correct 231 ms 45524 KB Output is correct
31 Correct 298 ms 45268 KB Output is correct
32 Correct 284 ms 45264 KB Output is correct
33 Correct 250 ms 44240 KB Output is correct
34 Correct 300 ms 44380 KB Output is correct
35 Correct 319 ms 44624 KB Output is correct
36 Correct 240 ms 43216 KB Output is correct
37 Correct 274 ms 45276 KB Output is correct
38 Correct 289 ms 43236 KB Output is correct
39 Correct 270 ms 44492 KB Output is correct
40 Correct 299 ms 44280 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16472 KB Output is correct
2 Correct 4 ms 16472 KB Output is correct
3 Correct 4 ms 16472 KB Output is correct
4 Correct 4 ms 16476 KB Output is correct
5 Correct 5 ms 16476 KB Output is correct
6 Correct 4 ms 16476 KB Output is correct
7 Correct 4 ms 16472 KB Output is correct
8 Correct 4 ms 16476 KB Output is correct
9 Correct 4 ms 16476 KB Output is correct
10 Correct 4 ms 16476 KB Output is correct
11 Correct 360 ms 20964 KB Output is correct
12 Correct 467 ms 20832 KB Output is correct
13 Correct 380 ms 20828 KB Output is correct
14 Correct 404 ms 20816 KB Output is correct
15 Correct 792 ms 21080 KB Output is correct
16 Correct 476 ms 20828 KB Output is correct
17 Correct 496 ms 20936 KB Output is correct
18 Correct 346 ms 21072 KB Output is correct
19 Correct 271 ms 20828 KB Output is correct
20 Correct 432 ms 21080 KB Output is correct
21 Correct 646 ms 21332 KB Output is correct
22 Correct 488 ms 20816 KB Output is correct
23 Correct 311 ms 20820 KB Output is correct
24 Correct 419 ms 20824 KB Output is correct
25 Correct 509 ms 20832 KB Output is correct
26 Correct 202 ms 20820 KB Output is correct
27 Correct 439 ms 21072 KB Output is correct
28 Correct 328 ms 20832 KB Output is correct
29 Correct 359 ms 20760 KB Output is correct
30 Correct 426 ms 21008 KB Output is correct
31 Correct 323 ms 20820 KB Output is correct
32 Correct 443 ms 20820 KB Output is correct
33 Correct 445 ms 20828 KB Output is correct
34 Correct 187 ms 20824 KB Output is correct
35 Correct 508 ms 20828 KB Output is correct
36 Correct 451 ms 20828 KB Output is correct
37 Correct 457 ms 20828 KB Output is correct
38 Correct 470 ms 20816 KB Output is correct
39 Correct 449 ms 20824 KB Output is correct
40 Correct 478 ms 21076 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16472 KB Output is correct
2 Correct 4 ms 16472 KB Output is correct
3 Correct 4 ms 16472 KB Output is correct
4 Correct 4 ms 16476 KB Output is correct
5 Correct 5 ms 16476 KB Output is correct
6 Correct 4 ms 16476 KB Output is correct
7 Correct 4 ms 16472 KB Output is correct
8 Correct 4 ms 16476 KB Output is correct
9 Correct 4 ms 16476 KB Output is correct
10 Correct 4 ms 16476 KB Output is correct
11 Correct 246 ms 45272 KB Output is correct
12 Correct 289 ms 45016 KB Output is correct
13 Correct 281 ms 44244 KB Output is correct
14 Correct 275 ms 44240 KB Output is correct
15 Correct 264 ms 45264 KB Output is correct
16 Correct 275 ms 44416 KB Output is correct
17 Correct 297 ms 44516 KB Output is correct
18 Correct 248 ms 46260 KB Output is correct
19 Correct 281 ms 43236 KB Output is correct
20 Correct 247 ms 45012 KB Output is correct
21 Correct 230 ms 45392 KB Output is correct
22 Correct 291 ms 45396 KB Output is correct
23 Correct 304 ms 44368 KB Output is correct
24 Correct 310 ms 44344 KB Output is correct
25 Correct 256 ms 46236 KB Output is correct
26 Correct 301 ms 44780 KB Output is correct
27 Correct 304 ms 44620 KB Output is correct
28 Correct 237 ms 47324 KB Output is correct
29 Correct 275 ms 43348 KB Output is correct
30 Correct 231 ms 45524 KB Output is correct
31 Correct 298 ms 45268 KB Output is correct
32 Correct 284 ms 45264 KB Output is correct
33 Correct 250 ms 44240 KB Output is correct
34 Correct 300 ms 44380 KB Output is correct
35 Correct 319 ms 44624 KB Output is correct
36 Correct 240 ms 43216 KB Output is correct
37 Correct 274 ms 45276 KB Output is correct
38 Correct 289 ms 43236 KB Output is correct
39 Correct 270 ms 44492 KB Output is correct
40 Correct 299 ms 44280 KB Output is correct
41 Correct 360 ms 20964 KB Output is correct
42 Correct 467 ms 20832 KB Output is correct
43 Correct 380 ms 20828 KB Output is correct
44 Correct 404 ms 20816 KB Output is correct
45 Correct 792 ms 21080 KB Output is correct
46 Correct 476 ms 20828 KB Output is correct
47 Correct 496 ms 20936 KB Output is correct
48 Correct 346 ms 21072 KB Output is correct
49 Correct 271 ms 20828 KB Output is correct
50 Correct 432 ms 21080 KB Output is correct
51 Correct 646 ms 21332 KB Output is correct
52 Correct 488 ms 20816 KB Output is correct
53 Correct 311 ms 20820 KB Output is correct
54 Correct 419 ms 20824 KB Output is correct
55 Correct 509 ms 20832 KB Output is correct
56 Correct 202 ms 20820 KB Output is correct
57 Correct 439 ms 21072 KB Output is correct
58 Correct 328 ms 20832 KB Output is correct
59 Correct 359 ms 20760 KB Output is correct
60 Correct 426 ms 21008 KB Output is correct
61 Correct 323 ms 20820 KB Output is correct
62 Correct 443 ms 20820 KB Output is correct
63 Correct 445 ms 20828 KB Output is correct
64 Correct 187 ms 20824 KB Output is correct
65 Correct 508 ms 20828 KB Output is correct
66 Correct 451 ms 20828 KB Output is correct
67 Correct 457 ms 20828 KB Output is correct
68 Correct 470 ms 20816 KB Output is correct
69 Correct 449 ms 20824 KB Output is correct
70 Correct 478 ms 21076 KB Output is correct
71 Execution timed out 2033 ms 41300 KB Time limit exceeded
72 Halted 0 ms 0 KB -