Submission #19121600


Source Code Expand

Copy
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int n;
  cin >> n;
  set<string> A, B;
  for (int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    if (s[0] == '!') {
      A.insert(s.substr(1));
    } else {
      B.insert(s);
    }
  }
  for (auto& s : B) {
    if (A.count(s)) {
      cout << s << '\n';
      return 0;
    }
  }
  cout << "satisfiable" << '\n';
  return 0;
}

Submission Info

Submission Time
Task C - 1-SAT
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 300
Code Size 2907 Byte
Status AC
Exec Time 238 ms
Memory 15636 KB

Compile Error

./Main.cpp:78:42: warning: unused variable 'inf' [-Wunused-const-variable]
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
                                         ^
./Main.cpp:79:11: warning: unused variable 'MOD' [-Wunused-const-variable]
const int MOD = 1e9 + 7;
          ^
2 warnings generated.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All 01_small.txt, 02_small.txt, 03_small.txt, 04_small.txt, 05_small.txt, 06_small.txt, 07_small.txt, 08_small.txt, 09_small.txt, 10_small.txt, 11_small.txt, 12_small.txt, 13_small.txt, 14_small.txt, 15_small.txt, 16_satisfiable1.txt, 17_satisfiable2.txt, 18_unsatisfiable1.txt, 19_unsatisfiable1.txt, 20_unsatisfiable1.txt, 21_unsatisfiable1.txt, 22_unsatisfiable1.txt, 23_unsatisfiable1.txt, 24_unsatisfiable1.txt, 25_unsatisfiable1.txt, 26_unsatisfiable2.txt, 27_unsatisfiable2.txt, 28_same.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
01_small.txt AC 8 ms 3120 KB
02_small.txt AC 2 ms 3108 KB
03_small.txt AC 2 ms 3040 KB
04_small.txt AC 2 ms 3108 KB
05_small.txt AC 2 ms 2948 KB
06_small.txt AC 2 ms 3028 KB
07_small.txt AC 2 ms 2892 KB
08_small.txt AC 2 ms 3112 KB
09_small.txt AC 2 ms 3140 KB
10_small.txt AC 2 ms 3104 KB
11_small.txt AC 3 ms 3028 KB
12_small.txt AC 2 ms 3020 KB
13_small.txt AC 2 ms 3112 KB
14_small.txt AC 2 ms 2916 KB
15_small.txt AC 2 ms 3028 KB
16_satisfiable1.txt AC 238 ms 15556 KB
17_satisfiable2.txt AC 130 ms 4296 KB
18_unsatisfiable1.txt AC 237 ms 15608 KB
19_unsatisfiable1.txt AC 225 ms 15532 KB
20_unsatisfiable1.txt AC 209 ms 15612 KB
21_unsatisfiable1.txt AC 216 ms 15400 KB
22_unsatisfiable1.txt AC 213 ms 15636 KB
23_unsatisfiable1.txt AC 209 ms 15400 KB
24_unsatisfiable1.txt AC 213 ms 15492 KB
25_unsatisfiable1.txt AC 214 ms 15452 KB
26_unsatisfiable2.txt AC 126 ms 4280 KB
27_unsatisfiable2.txt AC 123 ms 4300 KB
28_same.txt AC 86 ms 3140 KB
sample_01.txt AC 2 ms 3112 KB
sample_02.txt AC 2 ms 2916 KB