oj.uz

Submission #240316

# Submission time Handle Problem Language Result Execution time Memory
240316 2020-06-19T09:23:51 Z b00n0rp Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 1830 ms 65540 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN NEEDED)
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
// #define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
 
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#define TRACE
 
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
 
// -----------------------</Consts>-----------------------
 
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
const int FACSZ = 1; // Make sure to change this
int fact[FACSZ],ifact[FACSZ];
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // (UNCOMMENT FOR CIN/COUT) \
    FAST_IO
    PRECISION(10)
 
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES) 
    // sfl(t);
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM) \
        printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int ST,LT; 
int n,q;
string s;
string quer[1000005];
int ans[1000005];
int last[1000005];
int lastgg[1000005];
int pow3[21];
int dp[4782974];
int last2 [4782974];
bool done[4782974];

void solvethetestcase(){
    cin >> n >> q;
    cin >> s;
   	if(n <= 6){
   		ST = 0;
   		LT = 6;
   	}
   	else{
   		ST = 5;
   		LT = n-5;
   	}
    pow3[0] = 1;
    FOR(i,1,18){
    	pow3[i] = pow3[i-1]*3;
    }
    REP(i,q){
    	cin >> quer[i];
    	FOR(j,ST,n){
    		if(quer[i][j] == '1') last[i] += pow3[(n-j-1)];
    		if(quer[i][j] == '?') last[i] += pow3[(n-j-1)]*2; 
    	}
    }
    REP(i,(1<<n)){
    	REP(j,LT){
    		if((1<<j)&i) lastgg[i] += pow3[j];
    	}
    }
    REP(i,pow3[LT]){
    	last2[i] = -1;
    	int cur = i,cur2 = 0;
    	while(cur){
    		if(cur%3 == 2) last2[i] = cur2;
    		cur2++;
    		cur /= 3;
    	}
    }
    vi v;
    REP(i,(1<<ST)){
    	v.clear();
    	trace(i);
    	REP(j,q){
    		int flag = 1;
    		REP(k,ST){
    			if(quer[j][k] == '?') continue;
    			bool f1 = (i&(1<<(ST-1-k)));
    			bool f2 = quer[j][k]-'0';
    			if(f1 != f2){
    				flag = 0;
    				break;
    			}
    		}
    		if(flag){
    			v.pb(j);
    			// trace(j,last[j]);
    		}
    	}
    	fill(dp,dp+(pow3[LT]+1),0);
    	FOR(j,i*(1<<LT),(i+1)*(1<<LT)){
    		// trace(j,lastgg[j]);
    		dp[lastgg[j]] += (s[j]-'0');
    	}
    	FOR(j,1,pow3[LT]){
    		if(last2[j] == -1) continue;
    		dp[j] = dp[j-pow3[last2[j]]]+dp[j-pow3[last2[j]]*2];
    		// trace(j,dp[j]);
    	}
    	for(auto x:v) ans[x] += dp[last[x]];
    }
	REP(i,q){
		pfl(ans[i])
	}
}

Compilation message

snake_escaping.cpp:4:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
 ^
snake_escaping.cpp:54:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
snake_escaping.cpp:205:5: warning: multi-line comment [-Wcomment]
     // (UNCOMMENT FOR CIN/COUT) \
     ^
snake_escaping.cpp:213:9: warning: multi-line comment [-Wcomment]
         // (UNCOMMENT FOR CODEJAM) \
         ^
snake_escaping.cpp: In function 'void solvethetestcase()':
snake_escaping.cpp:110:33: warning: format '%lld' expects argument of type 'long long int', but argument 2 has type 'int' [-Wformat=]
 #define pfl(x) printf("%lld\n",x);
                                 ^
snake_escaping.cpp:300:7:
   pfl(ans[i])
       ~~~~~~                     
snake_escaping.cpp:300:3: note: in expansion of macro 'pfl'
   pfl(ans[i])
   ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31744 KB Output is correct
2 Correct 26 ms 31744 KB Output is correct
3 Correct 25 ms 31744 KB Output is correct
4 Correct 26 ms 31744 KB Output is correct
5 Correct 26 ms 31744 KB Output is correct
6 Correct 26 ms 31744 KB Output is correct
7 Correct 28 ms 31744 KB Output is correct
8 Correct 26 ms 31744 KB Output is correct
9 Correct 25 ms 31744 KB Output is correct
10 Correct 26 ms 31744 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31744 KB Output is correct
2 Correct 26 ms 31744 KB Output is correct
3 Correct 25 ms 31744 KB Output is correct
4 Correct 26 ms 31744 KB Output is correct
5 Correct 26 ms 31744 KB Output is correct
6 Correct 26 ms 31744 KB Output is correct
7 Correct 28 ms 31744 KB Output is correct
8 Correct 26 ms 31744 KB Output is correct
9 Correct 25 ms 31744 KB Output is correct
10 Correct 26 ms 31744 KB Output is correct
11 Correct 1420 ms 48136 KB Output is correct
12 Correct 1448 ms 47580 KB Output is correct
13 Correct 1311 ms 43808 KB Output is correct
14 Correct 1454 ms 43572 KB Output is correct
15 Correct 1655 ms 45132 KB Output is correct
16 Correct 1529 ms 43756 KB Output is correct
17 Correct 1525 ms 43880 KB Output is correct
18 Correct 1027 ms 48860 KB Output is correct
19 Correct 1213 ms 42228 KB Output is correct
20 Correct 1463 ms 47668 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31744 KB Output is correct
2 Correct 26 ms 31744 KB Output is correct
3 Correct 25 ms 31744 KB Output is correct
4 Correct 26 ms 31744 KB Output is correct
5 Correct 26 ms 31744 KB Output is correct
6 Correct 26 ms 31744 KB Output is correct
7 Correct 28 ms 31744 KB Output is correct
8 Correct 26 ms 31744 KB Output is correct
9 Correct 25 ms 31744 KB Output is correct
10 Correct 26 ms 31744 KB Output is correct
11 Correct 1420 ms 48136 KB Output is correct
12 Correct 1448 ms 47580 KB Output is correct
13 Correct 1311 ms 43808 KB Output is correct
14 Correct 1454 ms 43572 KB Output is correct
15 Correct 1655 ms 45132 KB Output is correct
16 Correct 1529 ms 43756 KB Output is correct
17 Correct 1525 ms 43880 KB Output is correct
18 Correct 1027 ms 48860 KB Output is correct
19 Correct 1213 ms 42228 KB Output is correct
20 Correct 1463 ms 47668 KB Output is correct
21 Correct 1611 ms 48152 KB Output is correct
22 Correct 1609 ms 48072 KB Output is correct
23 Correct 1560 ms 44028 KB Output is correct
24 Correct 1632 ms 43728 KB Output is correct
25 Correct 1804 ms 46548 KB Output is correct
26 Correct 1695 ms 44356 KB Output is correct
27 Correct 1735 ms 44176 KB Output is correct
28 Correct 1190 ms 50268 KB Output is correct
29 Correct 1418 ms 42228 KB Output is correct
30 Correct 1629 ms 48084 KB Output is correct
31 Correct 1830 ms 44992 KB Output is correct
32 Correct 1718 ms 44824 KB Output is correct
33 Correct 1400 ms 44552 KB Output is correct
34 Correct 1670 ms 43536 KB Output is correct
35 Correct 1704 ms 44116 KB Output is correct
36 Correct 1039 ms 46020 KB Output is correct
37 Correct 1528 ms 47960 KB Output is correct
38 Correct 1386 ms 41996 KB Output is correct
39 Correct 1651 ms 43928 KB Output is correct
40 Correct 1630 ms 43464 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31744 KB Output is correct
2 Correct 26 ms 31744 KB Output is correct
3 Correct 25 ms 31744 KB Output is correct
4 Correct 26 ms 31744 KB Output is correct
5 Correct 26 ms 31744 KB Output is correct
6 Correct 26 ms 31744 KB Output is correct
7 Correct 28 ms 31744 KB Output is correct
8 Correct 26 ms 31744 KB Output is correct
9 Correct 25 ms 31744 KB Output is correct
10 Correct 26 ms 31744 KB Output is correct
11 Runtime error 500 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31744 KB Output is correct
2 Correct 26 ms 31744 KB Output is correct
3 Correct 25 ms 31744 KB Output is correct
4 Correct 26 ms 31744 KB Output is correct
5 Correct 26 ms 31744 KB Output is correct
6 Correct 26 ms 31744 KB Output is correct
7 Correct 28 ms 31744 KB Output is correct
8 Correct 26 ms 31744 KB Output is correct
9 Correct 25 ms 31744 KB Output is correct
10 Correct 26 ms 31744 KB Output is correct
11 Correct 1420 ms 48136 KB Output is correct
12 Correct 1448 ms 47580 KB Output is correct
13 Correct 1311 ms 43808 KB Output is correct
14 Correct 1454 ms 43572 KB Output is correct
15 Correct 1655 ms 45132 KB Output is correct
16 Correct 1529 ms 43756 KB Output is correct
17 Correct 1525 ms 43880 KB Output is correct
18 Correct 1027 ms 48860 KB Output is correct
19 Correct 1213 ms 42228 KB Output is correct
20 Correct 1463 ms 47668 KB Output is correct
21 Correct 1611 ms 48152 KB Output is correct
22 Correct 1609 ms 48072 KB Output is correct
23 Correct 1560 ms 44028 KB Output is correct
24 Correct 1632 ms 43728 KB Output is correct
25 Correct 1804 ms 46548 KB Output is correct
26 Correct 1695 ms 44356 KB Output is correct
27 Correct 1735 ms 44176 KB Output is correct
28 Correct 1190 ms 50268 KB Output is correct
29 Correct 1418 ms 42228 KB Output is correct
30 Correct 1629 ms 48084 KB Output is correct
31 Correct 1830 ms 44992 KB Output is correct
32 Correct 1718 ms 44824 KB Output is correct
33 Correct 1400 ms 44552 KB Output is correct
34 Correct 1670 ms 43536 KB Output is correct
35 Correct 1704 ms 44116 KB Output is correct
36 Correct 1039 ms 46020 KB Output is correct
37 Correct 1528 ms 47960 KB Output is correct
38 Correct 1386 ms 41996 KB Output is correct
39 Correct 1651 ms 43928 KB Output is correct
40 Correct 1630 ms 43464 KB Output is correct
41 Runtime error 500 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
42 Halted 0 ms 0 KB -