제출 #1180777

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1180777		asli_bg	Snake Escaping (JOI18_snake_escaping)	C++20	5 / 100	2095 ms	2532 KiB

snake_escaping

#include<bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long
//#define int double

typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;

#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<

#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;

#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (l+r)/2

const int MAXN=1e5+5;
const int MOD=1e9+7;
const int INF=1e18;


signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int l,q;
    cin>>l>>q;
    string s;
    cin>>s;

    while(q--){
        string el;
        cin>>el;

        int ans=0;

        FOR(i,(1<<l)){ //tüm elemanlara bak
            bool f=true;
            for(int bt=0;bt<l;bt++){
                if(el[l-1-bt]=='?') continue;
                
                int bir=el[l-1-bt]-'0';
                int iki=((i&(1<<bt))>0);

                if(bir!=iki){
                    f=false;
                    break;
                }
            }
            if(f) ans+=s[i]-'0';
        }

        cout<<ans<<endl;
    }
}   

• Subtask 1: 5 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 53
• Subtask 5: 0 / 25