提出 #30067227

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

int main() {
  int N;
  cin >> N;
  vector<vector<int> > A(N, vector<int>(2));
  map<int, int> R;
  map<int, int> L;
  string ope;
  
  for (int i=0;i<N; ++i){
    cin >> A.at(i).at(0) >> A.at(i).at(1);
  }
  cin >> ope;
  
  for (int i=0;i<N; ++i){
    if (ope.at(i) == 'R'){
      if (R.count(A.at(i).at(1))){
        if (R.at(A.at(i).at(1)) > A.at(i).at(0)){
          R[A.at(i).at(1)] = A.at(i).at(0);
        }
      }
      else{
        R[A.at(i).at(1)] = A.at(i).at(0);
        L[A.at(i).at(1)] = 0;
      }
    }
    else{
      if (L.count(A.at(i).at(1))){
        if (L.at(A.at(i).at(1)) < A.at(i).at(0)){
          L[A.at(i).at(1)] = A.at(i).at(0);
        }
      }
      else{
        L[A.at(i).at(1)] = A.at(i).at(0);
        R[A.at(i).at(1)] = 100000000;
      }
    }
  }
  bool f = false;
  for (pair<int, int> p : R){
    if (p.second<L.at(p.first)) {
      f = true;
      break;
    }
  }
  cout << (f ? "Yes" : "No") << endl;
  return 0;
}

提出情報

ジャッジ結果