제출 #1276545

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1276545		sasde	Snake Escaping (JOI18_snake_escaping)	C++20	0 / 100	0 ms	332 KiB

snake_escaping

#include<bits/stdc++.h>
using namespace std;
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define emb emplace_back
const int N=2e6+5;
int node,query,ans;
string s,x;
int dpcha[N],dpcon[N],po[N];
void backtrack1(int i,vector<int>&res,bool c){
    if(i==sz(res)){
        int val=0;
        for(int j=0;j<node;++j){
            if(x[j]=='?'){
                val|=(1<<j);
                continue;
            }
            val|=((x[j]-'0')<<j);
        }
        // cout <<x<<'\n';   
        // cout <<val<<'\n';
        // cout <<val<<" "<<c<<" "<<dpcon[val]<<'\n';
        ans+=(c&1?-1:1)*dpcha[val];
        return;
    }
    x[res[i]]='0';
    backtrack1(i+1,res,c^1);
    x[res[i]]='1';
    backtrack1(i+1,res,c);
}
void backtrack0(int i,vector<int>&res,bool c){
    if(i==sz(res)){
        int val=0;
        for(int j=0;j<node;++j){
            if(x[j]=='?')continue;
            val|=((x[j]-'0')<<j);
        }
        // cout <<x<<'\n';   
        // cout <<val<<'\n';
        // cout <<val<<" "<<c<<" "<<dpcon[val]<<'\n';
        ans+=(c&1?-1:1)*dpcon[val];
        return;
    }
    x[res[i]]='0';
    backtrack0(i+1,res,c);
    x[res[i]]='1';
    backtrack0(i+1,res,c^1);
}
void backtrack(int i,vector<int>&res){
    if(i==sz(res)){
        int val=0;
        for(int j=0;j<node;++j){
            val|=((x[j]-'0')<<j);
        }
        // cout <<x<<'\n';   
        // cout <<val<<'\n';
        ans+=s[val]-'0';
        return;
    }
    x[res[i]]='0';
    backtrack(i+1,res);
    x[res[i]]='1';
    backtrack(i+1,res);
}

bool M2;
void solve(){
    cin >> node >> query >> s;
    for(int i=0;i<(1<<node);++i){
        dpcon[i]=s[i]-'0';
        dpcha[i]=s[i]-'0';
    }
    for(int j=0;j<node;++j){
    for(int mask=0;mask<(1<<node);++mask){
            if(mask>>j&1)dpcha[mask]+=dpcha[mask^(1<<j)];
            else dpcon[mask]+=dpcon[mask^(1<<j)];
        }
    }
    // cout <<dp[]
    while(query--){
        cin >> x;
        vector<int>vec[3];
        ans=0;
        reverse(all(x));
        for(int i=0;i<sz(x);++i){
            char y=x[i];
            if(y=='?')vec[0].emb(i);
            if(y=='0')vec[1].emb(i);
            if(y=='1')vec[2].emb(i);
        }

        if(sz(vec[0])<=sz(x)/3){
          backtrack(0,vec[0]);
        }
        else
        if(sz(vec[1])<=sz(x)/3){
            // backtrack1(0,vec[2],0);
            backtrack0(0,vec[1],0);
        }
        else{
            // backtrack0(0,vec[1],0);
            backtrack1(0,vec[2],0);
        }
        cout <<ans<<'\n';
    }
}
main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

}

컴파일 시 표준 에러 (stderr) 메시지

snake_escaping.cpp:107:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  107 | main()
      | ^~~~

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