#634396 (C++14) No.1439 Let's Compare!!!!

• 問題: No.1439 Let's Compare!!!!
• ユーザー: hamray
• 提出日時: 2021-03-26 21:49:43
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 478 ms / 2,000 ms
• コード長: 5,207 bytes
• コンパイル時間: 2,122 ms
• コンパイル使用メモリ: 177,024 KB
• 実行使用メモリ: 13,952 KB
• 最終ジャッジ日時: 2024-05-06 22:20:38
• 合計ジャッジ時間: 6,705 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	2 ms; 6,944 KB
testcase_04	AC	2 ms; 6,940 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	2 ms; 6,940 KB
testcase_07	AC	9 ms; 6,940 KB
testcase_08	AC	13 ms; 6,940 KB
testcase_09	AC	5 ms; 6,940 KB
testcase_10	AC	454 ms; 13,440 KB
testcase_11	AC	478 ms; 13,696 KB
testcase_12	AC	468 ms; 13,440 KB
testcase_13	AC	449 ms; 13,824 KB
testcase_14	AC	444 ms; 13,824 KB
testcase_15	AC	425 ms; 13,952 KB
testcase_16	AC	400 ms; 13,824 KB
testcase_17	AC	379 ms; 13,952 KB
testcase_18	AC	371 ms; 13,824 KB

ソースコード

#include <bits/stdc++.h>

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, int> pii;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;


#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()

#define MOD 1000000007

template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
const double EPS = 1e-12, PI = acos(-1);
const double pi = 3.141592653589793238462643383279;
  
typedef string::const_iterator State;
ll GCD(ll a, ll b){
  return (b==0)?a:GCD(b, a%b);
}
ll LCM(ll a, ll b){
  return a/GCD(a, b) * b;
}
template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

using modint = ModInt< 998244353 >;
template< typename T >
struct Combination {
  vector< T > _fact, _rfact, _inv;

  Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }

  inline T fact(int k) const { return _fact[k]; }

  inline T rfact(int k) const { return _rfact[k]; }

  inline T inv(int k) const { return _inv[k]; }

  T P(int n, int r) const {
    if(r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }

  T C(int p, int q) const {
    if(q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }

  T H(int n, int r) const {
    if(n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};

ll modpow(ll x, ll n, ll mod) {
  ll res = 1;
  while(n) {
    if(n&1) res = (res * x) % mod;
    x = (x * x) % mod;
    n >>= 1;
  }
  return res;
} 

int arr[201010];
int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  
  int N; cin >> N;
  string s, t; cin >> s >> t;

  set<int> s1, s2, s3;
  for(int i=0; i<N; i++) {
    arr[i] = s[i]-t[i];

    if(s[i]-t[i] > 0) {
      s1.insert(i);
    }else if(s[i]-t[i] == 0) {
      s2.insert(i);
    }else if(s[i]-t[i] < 0){
      s3.insert(i);
    }
  }
  int Q; cin >> Q;
  while(Q--) {
    char c;
    int x, y; cin >> c >> x >> y;
    x--;
    if(s[x]-t[x] > 0) {
      s1.erase(x);
    }else if(s[x]-t[x] == 0) {
      s2.erase(x);
    }else if(s[x]-t[x] < 0){
      s3.erase(x);
    }
    if(c == 'S') {
      if((char)('0' + y) - t[x] > 0) {
        s1.insert(x);
      }else if((char)('0' + y) - t[x] == 0) {
        s2.insert(x);
      }else if((char)('0' + y) - t[x] < 0) {
        s3.insert(x);
      }
      s[x] = (char)('0' + y);
    }else{
      if(s[x] - (char)('0' + y) > 0) {
        s1.insert(x);
      }else if(s[x] - (char)('0' + y) == 0) {
        s2.insert(x);
      }else if(s[x] - (char)('0' + y) < 0) {
        s3.insert(x);
      }
      t[x] = (char)('0' + y);
    }

    if(s1.size() && s3.size()) {
      if(*s1.begin() < *s3.begin()) {
        cout << ">" << endl;
      }else if(*s1.begin() > *s3.begin()) {
        cout << "<" << endl;
      }
    }else if(s1.size()) {
      cout << ">" << endl;
    }else if(s3.size()) {
      cout << "<" << endl;
    }else cout << "=" << endl;
  }

  return 0;
}