Submission #159657

#TimeUsernameProblemLanguageResultExecution timeMemory
159657GioChkhaidzeSnake Escaping (JOI18_snake_escaping)C++14
5 / 100
2069 ms5540 KiB
#include <bits/stdc++.h> #define F first #define S second using namespace std; int n,q,C[1148576],M[20],dp[1794323],vs; pair < int , int > v[1794323]; main () { ios::sync_with_stdio(false); cin>>n>>q; M[0]=1; for (int i=1; i<=n; i++) M[i]=M[i-1]*3; for (int i=0; i<(1<<n); i++) { char c; cin>>c; C[i]=c-'0'; int x=0; for (int j=0; j<n; j++) if (i&(1<<j)) x+=M[j]; dp[x]+=C[i]; } for (int i=0; i<M[n]; i++) { int x=i,rs=0; for (int j=n-1; j>=0; j--) if (x-2*M[j]>=0) x-=2*M[j],rs++; else if (x-M[j]>=0) x-=M[j]; v[++vs].F=rs; v[vs].S=i; } sort(v+1,v+vs+1); for (int i=1; i<=vs; i++) { int x=v[i].S; for (int j=n-1; j>=0; j--) { if (x-2*M[j]>=0) { x-=2*M[j]; if (dp[v[i].S]<(dp[v[i].S-2*M[j]]+dp[v[i].S-M[j]])) dp[v[i].S]=(dp[v[i].S-2*M[j]]+dp[v[i].S-M[j]]); } else if (x-M[j]>=0) x-=M[j]; } } for (int i=1; i<=q; i++) { string s; int x=0; cin>>s; for (int j=0; j<s.size(); j++) { if (s[s.size()-j-1]=='?') x+=2*M[j]; else if (s[s.size()-j-1]=='1') x+=M[j]; } cout<<dp[x]<<endl; } }

Compilation message (stderr)

snake_escaping.cpp:9:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () { 
       ^
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:59:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j=0; j<s.size(); j++) {
                 ~^~~~~~~~~
#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...