Submission #1114773

#TimeUsernameProblemLanguageResultExecution timeMemory
1114773Dan4LifeSnake Escaping (JOI18_snake_escaping)C++17
0 / 100
3 ms592 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define sz(a) (int)a.size() #define all(a) begin(a),end(a) const int B1 = 7; const int N = 1<<B1; vector<array<int,2>> v[N], w[N]; string s; int l, q, ans[1000010], dp[1594324/(3*3*3)]; int calc(string lol){ int p = 1, ans = 0, xd; for(int i = 0; i < sz(lol); i++){ if(lol[i]=='?') xd=2; else xd = lol[i]-'0'; ans+=xd*p, p*=3; } return ans; } int calc(int lol){ int p = 1, ans = 0; for(int i = 0; i < B1; i++) ans+=(lol>>i&1)*p, p*=3; return ans; } int32_t main(){ ios_base::sync_with_stdio(false); cin.tie(0); cin >> l >> q >> s; for(int mask = 0; mask < (1<<l); mask++){ int m1 = 0, m2 = mask; if(l>B1) m1 = mask&((1<<B1)-1), m2>>=B1; w[calc(m1)].pb({calc(m2),s[mask]-'0'}); } for(int i = 0; i < q; i++){ string t; cin >> t; reverse(all(t)); string x=""; if(l>B1) x = t.substr(0,B1),t=t.substr(B1); v[calc(x)].pb({calc(t),i}); } for(int _ = 0; _ < N; _++){ if(!sz(w[_])) continue; memset(dp,0,sizeof(dp)); for(auto [xd,sc] : w[_]) dp[xd]+=sc; for(int i = 0; i < 1594324/(3*3*3); i++){ int xd = i, p = 1, ok = 0; while(xd){ int r = xd%3; if(r==2) { dp[i]+=dp[i-2*p]+dp[i-p]; ok = 1; break; } xd/=3; p*=3; } } for(auto [x,i] : v[_]) ans[i] = dp[x]; } for(int i = 0; i < q; i++) cout << ans[i] << "\n"; }

Compilation message (stderr)

snake_escaping.cpp: In function 'int32_t main()':
snake_escaping.cpp:49:23: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   49 |    int xd = i, p = 1, ok = 0;
      |                       ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...