oj.uz

Submission #467020

# Submission time Handle Problem Language Result Execution time Memory
467020 2021-08-21T10:47:26 Z NhatMinh0208 Snake Escaping (JOI18_snake_escaping) C++17
100 / 100
 996 ms 48652 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a,b;
int mask_cnt[3];
string sc,rgx;
int sump[2][1200001];
int sum[2][1200001];
int main()
{
	fio;
    cin>>n;
    cin>>m;
    cin>>sc;
    // cout<<sc<<endl;
    for (i=0;i<(1<<n);i++)
    {
        u=sc[i];
        u-=48;
        sump[0][i]=sump[1][i]=u;
    }
    for (t=0;t<n;t++)
    {
        u=(1<<t);
        for (j=0;j<(1<<n);j++)
        {
            if (j&u)
            {
                sum[0][j]=sump[0][j]+sump[0][j^u];
                sum[1][j]=sump[1][j];
            }
            else
            {
                sum[1][j]=sump[1][j]+sump[1][j^u];
                sum[0][j]=sump[0][j];
            }
        }
        memcpy(sump[0],sum[0],sizeof(sump[0]));
        memcpy(sump[1],sum[1],sizeof(sump[1]));
    }

    for (t=0;t<m;t++)
    {
        cin>>rgx;
        mask_cnt[0]=mask_cnt[1]=mask_cnt[2]=0;
        for (i=0;i<n;i++)
        {
            for (j=0;j<3;j++)
            {
                mask_cnt[j]*=2;
            }
            if (rgx[i]=='0') mask_cnt[0]++;
            if (rgx[i]=='1') mask_cnt[1]++;
            if (rgx[i]=='?') mask_cnt[2]++;
        }
        u=__builtin_popcount(mask_cnt[0]);
        v=__builtin_popcount(mask_cnt[1]);
        a=__builtin_popcount(mask_cnt[2]);
        if (a<=u && a<=v) {
            b=0;
            u=mask_cnt[1];
            for (i=mask_cnt[2];i>=0;i--)
            {
                i&=mask_cnt[2];
                b+=sc[i^u]-48;
            }
        }
        else if (u<=v && u<=a) {
            u=mask_cnt[1];
            b=0;
            for (i=mask_cnt[0];i>=0;i--)
            {
                i&=mask_cnt[0];
                if (__builtin_popcount(i)%2)
                {
                    b-=sum[1][u^i];
                }
                else {
                    b+=sum[1][u^i];
                }
            }
        }
        else {
            u=mask_cnt[2];
            b=0;
            for (i=mask_cnt[1];i>=0;i--)
            {
                i&=mask_cnt[1];
                if (__builtin_popcount(i)%2)
                {
                    b-=sum[0][u^(i^mask_cnt[1])];
                }
                else {
                    b+=sum[0][u^(i^mask_cnt[1])];
                }
            }
        }
        cout<<b<<endl;
    }
}
// Normie28;

Compilation message

snake_escaping.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 9684 KB Output is correct
2 Correct 15 ms 9676 KB Output is correct
3 Correct 15 ms 9676 KB Output is correct
4 Correct 17 ms 9760 KB Output is correct
5 Correct 16 ms 9676 KB Output is correct
6 Correct 15 ms 9756 KB Output is correct
7 Correct 16 ms 9760 KB Output is correct
8 Correct 19 ms 9676 KB Output is correct
9 Correct 19 ms 9676 KB Output is correct
10 Correct 15 ms 9676 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 9684 KB Output is correct
2 Correct 15 ms 9676 KB Output is correct
3 Correct 15 ms 9676 KB Output is correct
4 Correct 17 ms 9760 KB Output is correct
5 Correct 16 ms 9676 KB Output is correct
6 Correct 15 ms 9756 KB Output is correct
7 Correct 16 ms 9760 KB Output is correct
8 Correct 19 ms 9676 KB Output is correct
9 Correct 19 ms 9676 KB Output is correct
10 Correct 15 ms 9676 KB Output is correct
11 Correct 289 ms 24556 KB Output is correct
12 Correct 290 ms 24176 KB Output is correct
13 Correct 317 ms 23360 KB Output is correct
14 Correct 310 ms 23440 KB Output is correct
15 Correct 278 ms 24420 KB Output is correct
16 Correct 318 ms 23636 KB Output is correct
17 Correct 323 ms 23620 KB Output is correct
18 Correct 270 ms 25536 KB Output is correct
19 Correct 303 ms 22448 KB Output is correct
20 Correct 284 ms 24112 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 9684 KB Output is correct
2 Correct 15 ms 9676 KB Output is correct
3 Correct 15 ms 9676 KB Output is correct
4 Correct 17 ms 9760 KB Output is correct
5 Correct 16 ms 9676 KB Output is correct
6 Correct 15 ms 9756 KB Output is correct
7 Correct 16 ms 9760 KB Output is correct
8 Correct 19 ms 9676 KB Output is correct
9 Correct 19 ms 9676 KB Output is correct
10 Correct 15 ms 9676 KB Output is correct
11 Correct 289 ms 24556 KB Output is correct
12 Correct 290 ms 24176 KB Output is correct
13 Correct 317 ms 23360 KB Output is correct
14 Correct 310 ms 23440 KB Output is correct
15 Correct 278 ms 24420 KB Output is correct
16 Correct 318 ms 23636 KB Output is correct
17 Correct 323 ms 23620 KB Output is correct
18 Correct 270 ms 25536 KB Output is correct
19 Correct 303 ms 22448 KB Output is correct
20 Correct 284 ms 24112 KB Output is correct
21 Correct 316 ms 27468 KB Output is correct
22 Correct 337 ms 27588 KB Output is correct
23 Correct 356 ms 26716 KB Output is correct
24 Correct 364 ms 26528 KB Output is correct
25 Correct 325 ms 28484 KB Output is correct
26 Correct 365 ms 26944 KB Output is correct
27 Correct 366 ms 26940 KB Output is correct
28 Correct 281 ms 29504 KB Output is correct
29 Correct 335 ms 25412 KB Output is correct
30 Correct 336 ms 27588 KB Output is correct
31 Correct 409 ms 27616 KB Output is correct
32 Correct 365 ms 27460 KB Output is correct
33 Correct 337 ms 26416 KB Output is correct
34 Correct 412 ms 26516 KB Output is correct
35 Correct 393 ms 26920 KB Output is correct
36 Correct 324 ms 25408 KB Output is correct
37 Correct 341 ms 27500 KB Output is correct
38 Correct 343 ms 25460 KB Output is correct
39 Correct 347 ms 26640 KB Output is correct
40 Correct 370 ms 26436 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 9684 KB Output is correct
2 Correct 15 ms 9676 KB Output is correct
3 Correct 15 ms 9676 KB Output is correct
4 Correct 17 ms 9760 KB Output is correct
5 Correct 16 ms 9676 KB Output is correct
6 Correct 15 ms 9756 KB Output is correct
7 Correct 16 ms 9760 KB Output is correct
8 Correct 19 ms 9676 KB Output is correct
9 Correct 19 ms 9676 KB Output is correct
10 Correct 15 ms 9676 KB Output is correct
11 Correct 104 ms 21364 KB Output is correct
12 Correct 95 ms 21288 KB Output is correct
13 Correct 102 ms 21240 KB Output is correct
14 Correct 128 ms 21220 KB Output is correct
15 Correct 90 ms 21376 KB Output is correct
16 Correct 130 ms 21252 KB Output is correct
17 Correct 106 ms 21236 KB Output is correct
18 Correct 85 ms 21400 KB Output is correct
19 Correct 92 ms 21120 KB Output is correct
20 Correct 91 ms 21352 KB Output is correct
21 Correct 95 ms 21364 KB Output is correct
22 Correct 116 ms 21368 KB Output is correct
23 Correct 94 ms 21220 KB Output is correct
24 Correct 103 ms 21228 KB Output is correct
25 Correct 111 ms 21236 KB Output is correct
26 Correct 91 ms 21220 KB Output is correct
27 Correct 95 ms 21376 KB Output is correct
28 Correct 96 ms 21112 KB Output is correct
29 Correct 101 ms 21224 KB Output is correct
30 Correct 103 ms 21320 KB Output is correct
31 Correct 112 ms 21240 KB Output is correct
32 Correct 119 ms 21348 KB Output is correct
33 Correct 108 ms 21252 KB Output is correct
34 Correct 91 ms 21112 KB Output is correct
35 Correct 109 ms 21348 KB Output is correct
36 Correct 104 ms 21376 KB Output is correct
37 Correct 108 ms 21232 KB Output is correct
38 Correct 103 ms 21212 KB Output is correct
39 Correct 105 ms 21244 KB Output is correct
40 Correct 108 ms 21252 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 9684 KB Output is correct
2 Correct 15 ms 9676 KB Output is correct
3 Correct 15 ms 9676 KB Output is correct
4 Correct 17 ms 9760 KB Output is correct
5 Correct 16 ms 9676 KB Output is correct
6 Correct 15 ms 9756 KB Output is correct
7 Correct 16 ms 9760 KB Output is correct
8 Correct 19 ms 9676 KB Output is correct
9 Correct 19 ms 9676 KB Output is correct
10 Correct 15 ms 9676 KB Output is correct
11 Correct 289 ms 24556 KB Output is correct
12 Correct 290 ms 24176 KB Output is correct
13 Correct 317 ms 23360 KB Output is correct
14 Correct 310 ms 23440 KB Output is correct
15 Correct 278 ms 24420 KB Output is correct
16 Correct 318 ms 23636 KB Output is correct
17 Correct 323 ms 23620 KB Output is correct
18 Correct 270 ms 25536 KB Output is correct
19 Correct 303 ms 22448 KB Output is correct
20 Correct 284 ms 24112 KB Output is correct
21 Correct 316 ms 27468 KB Output is correct
22 Correct 337 ms 27588 KB Output is correct
23 Correct 356 ms 26716 KB Output is correct
24 Correct 364 ms 26528 KB Output is correct
25 Correct 325 ms 28484 KB Output is correct
26 Correct 365 ms 26944 KB Output is correct
27 Correct 366 ms 26940 KB Output is correct
28 Correct 281 ms 29504 KB Output is correct
29 Correct 335 ms 25412 KB Output is correct
30 Correct 336 ms 27588 KB Output is correct
31 Correct 409 ms 27616 KB Output is correct
32 Correct 365 ms 27460 KB Output is correct
33 Correct 337 ms 26416 KB Output is correct
34 Correct 412 ms 26516 KB Output is correct
35 Correct 393 ms 26920 KB Output is correct
36 Correct 324 ms 25408 KB Output is correct
37 Correct 341 ms 27500 KB Output is correct
38 Correct 343 ms 25460 KB Output is correct
39 Correct 347 ms 26640 KB Output is correct
40 Correct 370 ms 26436 KB Output is correct
41 Correct 104 ms 21364 KB Output is correct
42 Correct 95 ms 21288 KB Output is correct
43 Correct 102 ms 21240 KB Output is correct
44 Correct 128 ms 21220 KB Output is correct
45 Correct 90 ms 21376 KB Output is correct
46 Correct 130 ms 21252 KB Output is correct
47 Correct 106 ms 21236 KB Output is correct
48 Correct 85 ms 21400 KB Output is correct
49 Correct 92 ms 21120 KB Output is correct
50 Correct 91 ms 21352 KB Output is correct
51 Correct 95 ms 21364 KB Output is correct
52 Correct 116 ms 21368 KB Output is correct
53 Correct 94 ms 21220 KB Output is correct
54 Correct 103 ms 21228 KB Output is correct
55 Correct 111 ms 21236 KB Output is correct
56 Correct 91 ms 21220 KB Output is correct
57 Correct 95 ms 21376 KB Output is correct
58 Correct 96 ms 21112 KB Output is correct
59 Correct 101 ms 21224 KB Output is correct
60 Correct 103 ms 21320 KB Output is correct
61 Correct 112 ms 21240 KB Output is correct
62 Correct 119 ms 21348 KB Output is correct
63 Correct 108 ms 21252 KB Output is correct
64 Correct 91 ms 21112 KB Output is correct
65 Correct 109 ms 21348 KB Output is correct
66 Correct 104 ms 21376 KB Output is correct
67 Correct 108 ms 21232 KB Output is correct
68 Correct 103 ms 21212 KB Output is correct
69 Correct 105 ms 21244 KB Output is correct
70 Correct 108 ms 21252 KB Output is correct
71 Correct 515 ms 45732 KB Output is correct
72 Correct 538 ms 45808 KB Output is correct
73 Correct 596 ms 44336 KB Output is correct
74 Correct 778 ms 44576 KB Output is correct
75 Correct 485 ms 46616 KB Output is correct
76 Correct 840 ms 44968 KB Output is correct
77 Correct 774 ms 44756 KB Output is correct
78 Correct 354 ms 48652 KB Output is correct
79 Correct 500 ms 42580 KB Output is correct
80 Correct 499 ms 45808 KB Output is correct
81 Correct 623 ms 45636 KB Output is correct
82 Correct 849 ms 44648 KB Output is correct
83 Correct 519 ms 43900 KB Output is correct
84 Correct 738 ms 44640 KB Output is correct
85 Correct 812 ms 44908 KB Output is correct
86 Correct 458 ms 42748 KB Output is correct
87 Correct 500 ms 45624 KB Output is correct
88 Correct 505 ms 42696 KB Output is correct
89 Correct 617 ms 44276 KB Output is correct
90 Correct 724 ms 44772 KB Output is correct
91 Correct 550 ms 43840 KB Output is correct
92 Correct 996 ms 45028 KB Output is correct
93 Correct 854 ms 45016 KB Output is correct
94 Correct 469 ms 42580 KB Output is correct
95 Correct 686 ms 44808 KB Output is correct
96 Correct 702 ms 44780 KB Output is correct
97 Correct 677 ms 44808 KB Output is correct
98 Correct 667 ms 44720 KB Output is correct
99 Correct 741 ms 44720 KB Output is correct
100 Correct 725 ms 44732 KB Output is correct