Submission #1556309

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define _rep(i,n) _repl(i,0,n)
#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000

string s,t;

vector<pair<int,int>> vec;

int p=0;
int literal(){
  bool neg = false;
  if(s[p]=='~'){p++;neg=true;}
  int ret = 0;
  while(isdigit(s[p])){
    ret = ret*10 + s[p++] - '0';
  }
  if(neg) return -ret;
  else return ret;
}
void clause(){
  assert(s[p++]=='(');
  int l = literal();
  assert(s[p++]=='v');
  int r = literal();
  vec.pb(mp(l,r));
  assert(s[p++]==')');
}
void parse(){
  clause();
  while(p < s.size()){
    assert(s[p++]=='^');
    clause();
  }
}

int ans = 11;

void dfs(int d, vector<bool> bl){
  bool ok = true;
  for(auto &pa : vec){
    int l = pa.first, r = pa.second;
    bool val = false;
    if(l>0) val |= bl[l];
    else val |= !bl[-l];
    if(r>0) val |= bl[r];
    else val |= !bl[-r];

    if(!val){
      ok = false;
      if(d<10){
        bl[abs(l)] = !bl[abs(l)];
        dfs(d+1, bl);
        bl[abs(l)] = !bl[abs(l)];
        bl[abs(r)] = !bl[abs(r)];
        dfs(d+1, bl);
        bl[abs(r)] = !bl[abs(r)];
      }
      break;
    }
  }
  if(ok) ans = min(ans, d);
}

int main(){
  int n,m;
  cin>>n>>m;
  cin>>s>>t;
  parse();
  assert(m==vec.size());

  vector<bool> bl(n+1);
  rep(i,n) bl[i+1] = t[i]=='T';

  dfs(0,bl);

  if(ans>10) cout << "TOO LARGE" << endl;
  else cout << ans << endl;

  return 0;
}

Submission Info

Judge Result