oj.uz

Submission #896345

# Submission time Handle Problem Language Result Execution time Memory
896345 2024-01-01T09:45:41 Z Unforgettablepl Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 62784 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[1048576];
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 16476 KB Output is correct
2 Correct 4 ms 16476 KB Output is correct
3 Correct 4 ms 16476 KB Output is correct
4 Correct 4 ms 16476 KB Output is correct
5 Correct 4 ms 16476 KB Output is correct
6 Correct 4 ms 16356 KB Output is correct
7 Correct 4 ms 16568 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 16476 KB Output is correct
2 Correct 4 ms 16476 KB Output is correct
3 Correct 4 ms 16476 KB Output is correct
4 Correct 4 ms 16476 KB Output is correct
5 Correct 4 ms 16476 KB Output is correct
6 Correct 4 ms 16356 KB Output is correct
7 Correct 4 ms 16568 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 252 ms 45264 KB Output is correct
12 Correct 295 ms 44916 KB Output is correct
13 Correct 293 ms 44192 KB Output is correct
14 Correct 278 ms 55124 KB Output is correct
15 Correct 316 ms 55948 KB Output is correct
16 Correct 300 ms 55436 KB Output is correct
17 Correct 302 ms 55236 KB Output is correct
18 Correct 263 ms 56988 KB Output is correct
19 Correct 310 ms 54112 KB Output is correct
20 Correct 253 ms 55620 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16476 KB Output is correct
2 Correct 4 ms 16476 KB Output is correct
3 Correct 4 ms 16476 KB Output is correct
4 Correct 4 ms 16476 KB Output is correct
5 Correct 4 ms 16476 KB Output is correct
6 Correct 4 ms 16356 KB Output is correct
7 Correct 4 ms 16568 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 252 ms 45264 KB Output is correct
12 Correct 295 ms 44916 KB Output is correct
13 Correct 293 ms 44192 KB Output is correct
14 Correct 278 ms 55124 KB Output is correct
15 Correct 316 ms 55948 KB Output is correct
16 Correct 300 ms 55436 KB Output is correct
17 Correct 302 ms 55236 KB Output is correct
18 Correct 263 ms 56988 KB Output is correct
19 Correct 310 ms 54112 KB Output is correct
20 Correct 253 ms 55620 KB Output is correct
21 Correct 237 ms 58948 KB Output is correct
22 Correct 292 ms 59152 KB Output is correct
23 Correct 298 ms 58076 KB Output is correct
24 Correct 350 ms 57868 KB Output is correct
25 Correct 304 ms 59964 KB Output is correct
26 Correct 318 ms 58396 KB Output is correct
27 Correct 361 ms 58368 KB Output is correct
28 Correct 234 ms 60940 KB Output is correct
29 Correct 296 ms 57272 KB Output is correct
30 Correct 234 ms 59024 KB Output is correct
31 Correct 312 ms 58892 KB Output is correct
32 Correct 320 ms 59044 KB Output is correct
33 Correct 262 ms 57940 KB Output is correct
34 Correct 323 ms 57868 KB Output is correct
35 Correct 400 ms 58324 KB Output is correct
36 Correct 242 ms 56960 KB Output is correct
37 Correct 279 ms 58952 KB Output is correct
38 Correct 301 ms 56844 KB Output is correct
39 Correct 374 ms 58196 KB Output is correct
40 Correct 296 ms 57868 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16476 KB Output is correct
2 Correct 4 ms 16476 KB Output is correct
3 Correct 4 ms 16476 KB Output is correct
4 Correct 4 ms 16476 KB Output is correct
5 Correct 4 ms 16476 KB Output is correct
6 Correct 4 ms 16356 KB Output is correct
7 Correct 4 ms 16568 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 434 ms 20944 KB Output is correct
12 Correct 489 ms 21076 KB Output is correct
13 Correct 356 ms 20832 KB Output is correct
14 Correct 449 ms 20820 KB Output is correct
15 Correct 871 ms 21080 KB Output is correct
16 Correct 532 ms 20824 KB Output is correct
17 Correct 495 ms 20828 KB Output is correct
18 Correct 343 ms 21076 KB Output is correct
19 Correct 318 ms 20820 KB Output is correct
20 Correct 454 ms 21080 KB Output is correct
21 Correct 771 ms 21076 KB Output is correct
22 Correct 441 ms 21072 KB Output is correct
23 Correct 309 ms 20820 KB Output is correct
24 Correct 403 ms 20828 KB Output is correct
25 Correct 531 ms 20820 KB Output is correct
26 Correct 231 ms 20904 KB Output is correct
27 Correct 470 ms 21076 KB Output is correct
28 Correct 306 ms 20820 KB Output is correct
29 Correct 356 ms 20820 KB Output is correct
30 Correct 423 ms 20820 KB Output is correct
31 Correct 321 ms 20820 KB Output is correct
32 Correct 505 ms 20824 KB Output is correct
33 Correct 543 ms 20828 KB Output is correct
34 Correct 221 ms 20824 KB Output is correct
35 Correct 554 ms 20828 KB Output is correct
36 Correct 558 ms 20828 KB Output is correct
37 Correct 537 ms 20824 KB Output is correct
38 Correct 545 ms 20824 KB Output is correct
39 Correct 524 ms 20832 KB Output is correct
40 Correct 571 ms 20920 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16476 KB Output is correct
2 Correct 4 ms 16476 KB Output is correct
3 Correct 4 ms 16476 KB Output is correct
4 Correct 4 ms 16476 KB Output is correct
5 Correct 4 ms 16476 KB Output is correct
6 Correct 4 ms 16356 KB Output is correct
7 Correct 4 ms 16568 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 252 ms 45264 KB Output is correct
12 Correct 295 ms 44916 KB Output is correct
13 Correct 293 ms 44192 KB Output is correct
14 Correct 278 ms 55124 KB Output is correct
15 Correct 316 ms 55948 KB Output is correct
16 Correct 300 ms 55436 KB Output is correct
17 Correct 302 ms 55236 KB Output is correct
18 Correct 263 ms 56988 KB Output is correct
19 Correct 310 ms 54112 KB Output is correct
20 Correct 253 ms 55620 KB Output is correct
21 Correct 237 ms 58948 KB Output is correct
22 Correct 292 ms 59152 KB Output is correct
23 Correct 298 ms 58076 KB Output is correct
24 Correct 350 ms 57868 KB Output is correct
25 Correct 304 ms 59964 KB Output is correct
26 Correct 318 ms 58396 KB Output is correct
27 Correct 361 ms 58368 KB Output is correct
28 Correct 234 ms 60940 KB Output is correct
29 Correct 296 ms 57272 KB Output is correct
30 Correct 234 ms 59024 KB Output is correct
31 Correct 312 ms 58892 KB Output is correct
32 Correct 320 ms 59044 KB Output is correct
33 Correct 262 ms 57940 KB Output is correct
34 Correct 323 ms 57868 KB Output is correct
35 Correct 400 ms 58324 KB Output is correct
36 Correct 242 ms 56960 KB Output is correct
37 Correct 279 ms 58952 KB Output is correct
38 Correct 301 ms 56844 KB Output is correct
39 Correct 374 ms 58196 KB Output is correct
40 Correct 296 ms 57868 KB Output is correct
41 Correct 434 ms 20944 KB Output is correct
42 Correct 489 ms 21076 KB Output is correct
43 Correct 356 ms 20832 KB Output is correct
44 Correct 449 ms 20820 KB Output is correct
45 Correct 871 ms 21080 KB Output is correct
46 Correct 532 ms 20824 KB Output is correct
47 Correct 495 ms 20828 KB Output is correct
48 Correct 343 ms 21076 KB Output is correct
49 Correct 318 ms 20820 KB Output is correct
50 Correct 454 ms 21080 KB Output is correct
51 Correct 771 ms 21076 KB Output is correct
52 Correct 441 ms 21072 KB Output is correct
53 Correct 309 ms 20820 KB Output is correct
54 Correct 403 ms 20828 KB Output is correct
55 Correct 531 ms 20820 KB Output is correct
56 Correct 231 ms 20904 KB Output is correct
57 Correct 470 ms 21076 KB Output is correct
58 Correct 306 ms 20820 KB Output is correct
59 Correct 356 ms 20820 KB Output is correct
60 Correct 423 ms 20820 KB Output is correct
61 Correct 321 ms 20820 KB Output is correct
62 Correct 505 ms 20824 KB Output is correct
63 Correct 543 ms 20828 KB Output is correct
64 Correct 221 ms 20824 KB Output is correct
65 Correct 554 ms 20828 KB Output is correct
66 Correct 558 ms 20828 KB Output is correct
67 Correct 537 ms 20824 KB Output is correct
68 Correct 545 ms 20824 KB Output is correct
69 Correct 524 ms 20832 KB Output is correct
70 Correct 571 ms 20920 KB Output is correct
71 Execution timed out 2094 ms 62784 KB Time limit exceeded
72 Halted 0 ms 0 KB -