oj.uz

답안 #963540

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
963540 2024-04-15T09:38:58 Z ksu2009en Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 1154 ms 65536 KB 
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2")

#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>


using namespace std;
typedef long long ll;

ll const half = 7;

#define endl '\n'

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    ll l, q;
    cin >> l >> q;
    
    string a;
    cin >> a;
    
    vector<ll> pw(max(half, l - half) + 2);
    pw[0] = 1;
    
    for(int i = 1; i < pw.size(); i++)
        pw[i] = pw[i - 1] * 3;
        
    vector<ll> dp, bit(pw[max(0ll, l - half)] + 1, -1), bin_to3((1ll << max(0ll, l - half)) + 1), from3_to_bin(pw[max(0ll, l - half)] + 1);
    
    for(int i = 0; i < (1 << max(0ll, l - half)); i++){
        ll cnt = 0;
        
        for(int j = max(0ll, l - half) - 1; j >= 0; j--){
            if((i >> j) & 1){
                cnt = (cnt + 1) * 3;
            }
            else
                cnt *= 3;
        }
        cnt /= 3;
        bin_to3[i] = cnt;
        from3_to_bin[cnt] = i;
        
    }
    
    for(int i = 0; i < pw[(max(0ll, l - half))]; i++){
        ll val = i;
        
        for(int j = 0; j < max(0ll, l - half); j++){
            if(val % 3 == 2){
                bit[i] = j;
                break;
            }
            
            val /= 3;
        }
    }
    
    vector<vector<bool>> sub(pw[half], vector<bool> ((1ll << half) + 1, true));
    
    for(int i = 0; i < pw[half]; i++){
        vector<ll> u;
        
        ll cur = pw[half];
        
        ll val = i;
        for(int i = half - 1; i >= 0; i--){
            cur /= 3;
            u.push_back(val / cur);
            val %= cur;
        }
        
        for(int j = 0; j < (1ll << half); j++){
            for(int k = 0; k < half; k++){
                if(u[u.size() - k - 1] == 2)
                    continue;
                
                if(u[u.size() - k - 1] != (j >> k) % 2){
                    sub[i][j] = false;
                    break;
                }
            }
        }
    }
    
    vector<pair<ll, ll>> quer;
    
    while(q--){
        string b;
        cin >> b;
        
        while(b.size() < l)
            b += "0";
        
        ll cnt = 0, pos = 0, c1 = 0;
        
        for(auto i: b){
            if(i == '0'){
                cnt *= 3;
            }
            else if(i == '1'){
                cnt = (cnt + 1) * 3;
            }
            else{
                cnt = (cnt + 2) * 3;
            }
            pos++;
            
            if(pos == half || (half > b.size() && pos == b.size()) ){
                c1 = cnt / 3;
            }
        }
        
        cnt /= 3;
        if(l > half){
            cnt %= pw[l - half];
        }
                
        quer.push_back({c1, cnt});
    }
        
    vector<ll> ans(quer.size());
    
    
    dp.resize(pw[max(0ll, l - half)] + 1);
    for(int i = 0; i < (1ll << min(half, l)); i++){
        if(l <= half){
            for(int j = 0; j < quer.size(); j++){
                if(sub[quer[j].first][i])
                    ans[j] += (a[i] - '0');
            }
            continue;
        }
        
        ll add = i * (1 << (l - half));
        for(int j = 0; j < pw[l - half]; j++){
            if(bit[j] == -1){
//                cout << j << ' ' << from3_to_bin[j] << ' ' << add << endl;
                dp[j] = (a[add + from3_to_bin[j]] - '0');
                continue;
            }
            
            dp[j] = 0;
            ll c1 = j - 2 * pw[bit[j]];
            dp[j] += dp[c1];
            
            c1 = j - pw[bit[j]];
            dp[j] += dp[c1];
        }
//
//        cout << i << endl;
//        for(int j = 0; j < pw[l - half]; j++)
//            cout << dp[j] << ' ';
//        cout << endl;
//
        for(int j = 0; j < quer.size(); j++){
            if(sub[quer[j].first][i]){
                
                ans[j] += dp[quer[j].second];
            }
        }
    }
    
    for(auto i: ans)
        cout << i << endl;
    
    return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:44:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int i = 1; i < pw.size(); i++)
      |                    ~~^~~~~~~~~~~
snake_escaping.cpp:111:24: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  111 |         while(b.size() < l)
      |               ~~~~~~~~~^~~
snake_escaping.cpp:128:55: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |             if(pos == half || (half > b.size() && pos == b.size()) ){
      |                                                   ~~~~^~~~~~~~~~~
snake_escaping.cpp:147:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |             for(int j = 0; j < quer.size(); j++){
      |                            ~~^~~~~~~~~~~~~
snake_escaping.cpp:175:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  175 |         for(int j = 0; j < quer.size(); j++){
      |                        ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 523 ms 27932 KB Output is correct
12 Correct 584 ms 27820 KB Output is correct
13 Correct 577 ms 27512 KB Output is correct
14 Correct 602 ms 27012 KB Output is correct
15 Correct 634 ms 28160 KB Output is correct
16 Correct 597 ms 27576 KB Output is correct
17 Correct 621 ms 27908 KB Output is correct
18 Correct 360 ms 29240 KB Output is correct
19 Correct 439 ms 25888 KB Output is correct
20 Correct 582 ms 27816 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 523 ms 27932 KB Output is correct
12 Correct 584 ms 27820 KB Output is correct
13 Correct 577 ms 27512 KB Output is correct
14 Correct 602 ms 27012 KB Output is correct
15 Correct 634 ms 28160 KB Output is correct
16 Correct 597 ms 27576 KB Output is correct
17 Correct 621 ms 27908 KB Output is correct
18 Correct 360 ms 29240 KB Output is correct
19 Correct 439 ms 25888 KB Output is correct
20 Correct 582 ms 27816 KB Output is correct
21 Correct 598 ms 28420 KB Output is correct
22 Correct 601 ms 28092 KB Output is correct
23 Correct 617 ms 27392 KB Output is correct
24 Correct 650 ms 27340 KB Output is correct
25 Correct 686 ms 28992 KB Output is correct
26 Correct 681 ms 28152 KB Output is correct
27 Correct 649 ms 28044 KB Output is correct
28 Correct 352 ms 30052 KB Output is correct
29 Correct 439 ms 26652 KB Output is correct
30 Correct 604 ms 28408 KB Output is correct
31 Correct 638 ms 27960 KB Output is correct
32 Correct 623 ms 27960 KB Output is correct
33 Correct 538 ms 27376 KB Output is correct
34 Correct 680 ms 26936 KB Output is correct
35 Correct 647 ms 27560 KB Output is correct
36 Correct 293 ms 26244 KB Output is correct
37 Correct 541 ms 28424 KB Output is correct
38 Correct 449 ms 26112 KB Output is correct
39 Correct 604 ms 27292 KB Output is correct
40 Correct 634 ms 27048 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 511 ms 40956 KB Output is correct
12 Correct 521 ms 43264 KB Output is correct
13 Correct 530 ms 43012 KB Output is correct
14 Correct 518 ms 44796 KB Output is correct
15 Correct 537 ms 43260 KB Output is correct
16 Correct 538 ms 43028 KB Output is correct
17 Correct 518 ms 43004 KB Output is correct
18 Correct 505 ms 43268 KB Output is correct
19 Correct 526 ms 43248 KB Output is correct
20 Correct 503 ms 43260 KB Output is correct
21 Correct 529 ms 43248 KB Output is correct
22 Correct 526 ms 43012 KB Output is correct
23 Correct 504 ms 43000 KB Output is correct
24 Correct 512 ms 43000 KB Output is correct
25 Correct 526 ms 43252 KB Output is correct
26 Correct 487 ms 43004 KB Output is correct
27 Correct 516 ms 43172 KB Output is correct
28 Correct 505 ms 43148 KB Output is correct
29 Correct 507 ms 43012 KB Output is correct
30 Correct 516 ms 43012 KB Output is correct
31 Correct 513 ms 43092 KB Output is correct
32 Correct 518 ms 43024 KB Output is correct
33 Correct 514 ms 42988 KB Output is correct
34 Correct 497 ms 43008 KB Output is correct
35 Correct 520 ms 43016 KB Output is correct
36 Correct 513 ms 42996 KB Output is correct
37 Correct 526 ms 43016 KB Output is correct
38 Correct 525 ms 43000 KB Output is correct
39 Correct 528 ms 43012 KB Output is correct
40 Correct 559 ms 43012 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 523 ms 27932 KB Output is correct
12 Correct 584 ms 27820 KB Output is correct
13 Correct 577 ms 27512 KB Output is correct
14 Correct 602 ms 27012 KB Output is correct
15 Correct 634 ms 28160 KB Output is correct
16 Correct 597 ms 27576 KB Output is correct
17 Correct 621 ms 27908 KB Output is correct
18 Correct 360 ms 29240 KB Output is correct
19 Correct 439 ms 25888 KB Output is correct
20 Correct 582 ms 27816 KB Output is correct
21 Correct 598 ms 28420 KB Output is correct
22 Correct 601 ms 28092 KB Output is correct
23 Correct 617 ms 27392 KB Output is correct
24 Correct 650 ms 27340 KB Output is correct
25 Correct 686 ms 28992 KB Output is correct
26 Correct 681 ms 28152 KB Output is correct
27 Correct 649 ms 28044 KB Output is correct
28 Correct 352 ms 30052 KB Output is correct
29 Correct 439 ms 26652 KB Output is correct
30 Correct 604 ms 28408 KB Output is correct
31 Correct 638 ms 27960 KB Output is correct
32 Correct 623 ms 27960 KB Output is correct
33 Correct 538 ms 27376 KB Output is correct
34 Correct 680 ms 26936 KB Output is correct
35 Correct 647 ms 27560 KB Output is correct
36 Correct 293 ms 26244 KB Output is correct
37 Correct 541 ms 28424 KB Output is correct
38 Correct 449 ms 26112 KB Output is correct
39 Correct 604 ms 27292 KB Output is correct
40 Correct 634 ms 27048 KB Output is correct
41 Correct 511 ms 40956 KB Output is correct
42 Correct 521 ms 43264 KB Output is correct
43 Correct 530 ms 43012 KB Output is correct
44 Correct 518 ms 44796 KB Output is correct
45 Correct 537 ms 43260 KB Output is correct
46 Correct 538 ms 43028 KB Output is correct
47 Correct 518 ms 43004 KB Output is correct
48 Correct 505 ms 43268 KB Output is correct
49 Correct 526 ms 43248 KB Output is correct
50 Correct 503 ms 43260 KB Output is correct
51 Correct 529 ms 43248 KB Output is correct
52 Correct 526 ms 43012 KB Output is correct
53 Correct 504 ms 43000 KB Output is correct
54 Correct 512 ms 43000 KB Output is correct
55 Correct 526 ms 43252 KB Output is correct
56 Correct 487 ms 43004 KB Output is correct
57 Correct 516 ms 43172 KB Output is correct
58 Correct 505 ms 43148 KB Output is correct
59 Correct 507 ms 43012 KB Output is correct
60 Correct 516 ms 43012 KB Output is correct
61 Correct 513 ms 43092 KB Output is correct
62 Correct 518 ms 43024 KB Output is correct
63 Correct 514 ms 42988 KB Output is correct
64 Correct 497 ms 43008 KB Output is correct
65 Correct 520 ms 43016 KB Output is correct
66 Correct 513 ms 42996 KB Output is correct
67 Correct 526 ms 43016 KB Output is correct
68 Correct 525 ms 43000 KB Output is correct
69 Correct 528 ms 43012 KB Output is correct
70 Correct 559 ms 43012 KB Output is correct
71 Runtime error 1154 ms 65536 KB Execution killed with signal 9
72 Halted 0 ms 0 KB -