Submission #19131811

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, N) for(int i = 0; i < (int)N; i++)
#define CREP(i, l, r) for(int i = l; i <= r; i++)
using namespace std;
typedef long long ll;
typedef tuple<int,int,int> T; 
typedef pair<int,int> P;
typedef vector<int> V;
typedef vector<int> Vll;
const int INF = 1000000000;      //10^9, 2*INF
const ll LLINF = (1LL << 60);   // > 10^18 ll  2*LLINF

int main() {
    int n;
    cin >> n;
    vector<string> s(n);
    set<string> st;
    set<string> lst;
    rep(i, n) {
        cin >> s[i];
        st.insert(s[i]);
        if(s[i][0] == '!'){
            lst.insert(s[i].substr(1));
        }
    }

    bool f = false;
    string ans;
    auto itr = lst.begin();
    while(itr != lst.end()){
        auto titr = st.find(*itr);
        if(titr != st.end()){
            ans = *itr;
            f = true;
            break;
        }

        itr++;
    }


    if(f) cout << ans << "\n";
    else puts("satisfiable");
}

Submission Info

Judge Result