mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-24 03:31:59 +00:00
C - Collision 2
https://atcoder.jp/contests/abc243/submissions/30053743
This commit is contained in:
parent
126dfda591
commit
573d0bffbd
39
AtCoder/ABC243/C/C.cpp
Normal file
39
AtCoder/ABC243/C/C.cpp
Normal file
@ -0,0 +1,39 @@
|
||||
#include <iostream>
|
||||
#include <map>
|
||||
|
||||
using std::cin;
|
||||
using std::cout;
|
||||
const char endl = '\n';
|
||||
|
||||
const int N = 2e5 + 5;
|
||||
|
||||
int n;
|
||||
int a[N], b[N], c[N];
|
||||
|
||||
std::map<int, int> map;
|
||||
|
||||
signed main() {
|
||||
std::ios::sync_with_stdio(false);
|
||||
cin >> n;
|
||||
for (int i = 1; i <= n; i++) {
|
||||
cin >> a[i] >> b[i];
|
||||
map[b[i]] = 1e9 + 5;
|
||||
}
|
||||
for (int i = 1; i <= n; i++) {
|
||||
char op;
|
||||
cin >> op;
|
||||
if (op == 'R') {
|
||||
map[b[i]] = std::min(map[b[i]], a[i]), c[i] = 1;
|
||||
}
|
||||
}
|
||||
for (int i = 1; i <= n; i++) {
|
||||
if (!c[i]) {
|
||||
if (map[b[i]] <= a[i]) {
|
||||
cout << "Yes" << endl;
|
||||
exit(0);
|
||||
}
|
||||
}
|
||||
}
|
||||
cout << "No" << endl;
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user