problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b) {
if (b == c) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b) {
if (b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,698 | 895,699 | u288905450 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define p_q priority_queue
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define RFOR(i, a, b) for (int i = (a); i >= b; i--)
#define MN 200005
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "YES\n";
} else {
cout << "NO\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define p_q priority_queue
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define RFOR(i, a, b) for (int i = (a); i >= b; i--)
#define MN 200005
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,710 | 895,711 | u396284099 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && c == a) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && c == a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,712 | 895,713 | u342129174 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && a == c && b == c && c == a) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && a == c && b == c && c == a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,718 | 895,719 | u466983830 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
scanf("%d %d %d", &a, &b, &c);
if (a == b && b == c)
printf("Yes\n");
printf("No\n");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
scanf("%d %d %d", &a, &b, &c);
if (a == b && b == c)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 895,720 | 895,721 | u574811687 | cpp |
p03080 | #pragma region
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s)-1; (i) >= 0; --(i))
#define all(x) x.begin(), x.end()
#pragma region UnionFind
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
#pragma endregion
#pragma region GCD
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
#pragma endregion
#pragma region LCM
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
#pragma endregion
#pragma region chmin
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma region chmax
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma endregion
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r, b;
for (char c : s) {
if (c == 'R')
++r;
else
++b;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #pragma region
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s)-1; (i) >= 0; --(i))
#define all(x) x.begin(), x.end()
#pragma region UnionFind
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
#pragma endregion
#pragma region GCD
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
#pragma endregion
#pragma region LCM
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
#pragma endregion
#pragma region chmin
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma region chmax
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma endregion
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r, b;
r = b = 0;
for (char c : s) {
if (c == 'R')
++r;
else
++b;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"assignment.add"
] | 895,734 | 895,735 | u521389909 | cpp |
p03080 | #include <iostream>
using namespace std;
int main(void) {
int n, r, b;
r = 0;
b = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
r += (s[i] == 'R');
b += (s[i] == 'B');
}
if (r > b) {
cout << "YES";
} else {
cout << "NO";
}
cout << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int n, r, b;
r = 0;
b = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
r += (s[i] == 'R');
b += (s[i] == 'B');
}
if (r > b) {
cout << "Yes";
} else {
cout << "No";
}
cout << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,738 | 895,739 | u520276780 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = a; i <= (b); ++i)
#define rep3(i, a, b) for (int i = a; i >= (b); --i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define Dcout(a) cout << setprecision(20) << a << endl
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define fi first
#define se second
using Graph = vector<vector<ll>>;
const ll INF = (1LL << 60);
const double pi = acos(-1.0);
/******************* debug ********************/
#define debug(var) \
do { \
std::cout << #var << " : "; \
view(var); \
} while (0)
#define deb cout << "line : " << __LINE__ << " debug" << endl
template <typename T> void view(T e) { cout << e << endl; }
template <typename T> void view(const vector<T> &v) {
for (const auto &e : v)
cout << e << " ";
cout << endl;
}
template <typename T> void view(const vector<vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
/****** Template of some basic operations *****/
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = ll> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <typename F> struct FixPoint : F {
FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args> decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F> inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
/********************************************************/
/******************** Start coding ! *******************/
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r, b;
rep(i, n) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = a; i <= (b); ++i)
#define rep3(i, a, b) for (int i = a; i >= (b); --i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define Dcout(a) cout << setprecision(20) << a << endl
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define fi first
#define se second
using Graph = vector<vector<ll>>;
const ll INF = (1LL << 60);
const double pi = acos(-1.0);
/******************* debug ********************/
#define debug(var) \
do { \
std::cout << #var << " : "; \
view(var); \
} while (0)
#define deb cout << "line : " << __LINE__ << " debug" << endl
template <typename T> void view(T e) { cout << e << endl; }
template <typename T> void view(const vector<T> &v) {
for (const auto &e : v)
cout << e << " ";
cout << endl;
}
template <typename T> void view(const vector<vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
/****** Template of some basic operations *****/
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = ll> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <typename F> struct FixPoint : F {
FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args> decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F> inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
/********************************************************/
/******************** Start coding ! *******************/
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r = 0, b = 0;
rep(i, n) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"variable_declaration.value.change"
] | 895,740 | 895,741 | u502312544 | cpp |
p03080 | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a = 0, b = 0, c, d, m, n, maxi = 0, f = 0, mini = INF, sum = 0;
string str;
cin >> str;
rep(i, str.length()) if (str[i] == 'R') a++;
else b++;
if (a > b)
Yes;
else
No;
return 0;
}
| // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a = 0, b = 0, c, d, m, n, maxi = 0, f = 0, mini = INF, sum = 0;
string str;
cin >> n;
cin >> str;
rep(i, str.length()) if (str[i] == 'R') a++;
else b++;
if (a > b)
Yes;
else
No;
return 0;
}
| [] | 895,742 | 895,743 | u683769494 | cpp |
p03080 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define lb(c, x) distance(c.begin(), lower_bound(all(c), x))
#define ub(c, x) distance(c.begin(), upper_bound(all(c), x))
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e9 + 7;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll ans = 0;
rep(i, n) {
if (s[i] == 'R')
ans++;
else
ans--;
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define lb(c, x) distance(c.begin(), lower_bound(all(c), x))
#define ub(c, x) distance(c.begin(), upper_bound(all(c), x))
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e9 + 7;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll ans = 0;
rep(i, n) {
if (s[i] == 'R')
ans++;
else
ans--;
}
if (ans > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 895,744 | 895,745 | u882039496 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string s;
cin >> N >> s;
int i = 0;
for (int k = 0; k < N; ++k) {
if (s[k] = 'R')
++i;
else
--i;
}
if (i > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string s;
cin >> N >> s;
int i = 0;
for (int k = 0; k < N; ++k) {
if (s[k] == 'R')
++i;
else
--i;
}
if (i > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 895,750 | 895,751 | u830745382 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string s;
cin >> N >> s;
int i = 0;
for (int k = 0; k < N; ++k) {
if (s.at(k) = 'R')
++i;
else
--i;
}
if (i > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string s;
cin >> N >> s;
int i = 0;
for (int k = 0; k < N; ++k) {
if (s[k] == 'R')
++i;
else
--i;
}
if (i > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.remove"
] | 895,752 | 895,751 | u830745382 | cpp |
p03080 | #include <cstdio>
char s[101];
int main() {
int n;
scanf("%d", &n);
int cntR = 0;
for (int i = 1; i <= n; i++)
cntR += (s[i] == 'R');
if (cntR > n - cntR)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| #include <cstdio>
char s[101];
int main() {
int n;
scanf("%d%s", &n, s + 1);
int cntR = 0;
for (int i = 1; i <= n; i++)
cntR += (s[i] == 'R');
if (cntR > n - cntR)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"call.arguments.add"
] | 895,757 | 895,758 | u602509796 | cpp |
p03080 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll r = 0;
ll b = 0;
rep(i, n) {
if (s.at(i) = 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll r = 0;
ll b = 0;
rep(i, n) {
if (s.at(i) == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 895,780 | 895,781 | u449123607 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T> void fin(T a) {
cout << a << endl;
exit(0);
}
bool IsPrime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
ld sqrtNum = sqrt(num);
for (ll i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0)
return false;
}
return true;
}
//実行部
void Main() {
ll n;
cin >> n;
str s;
cin >> s;
ll r = 0, b = 0;
rep(i, n) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
fin("YES");
fin("NO");
}
//前処理
int main() {
ifstream in("text.txt");
cin.rdbuf(in.rdbuf());
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20); //高精度少数表示
Main();
return 0;
}
/*
//test時
g++ test.cpp -o test;./test
*/
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T> void fin(T a) {
cout << a << endl;
exit(0);
}
bool IsPrime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
ld sqrtNum = sqrt(num);
for (ll i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0)
return false;
}
return true;
}
//実行部
void Main() {
ll n;
cin >> n;
str s;
cin >> s;
ll r = 0, b = 0;
rep(i, n) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
fin("Yes");
fin("No");
}
//前処理
int main() {
ifstream in("text.txt");
cin.rdbuf(in.rdbuf());
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20); //高精度少数表示
Main();
return 0;
}
/*
//test時
g++ test.cpp -o test;./test
*/
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 895,784 | 895,785 | u743889070 | cpp |
p03080 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n;
cin >> n;
string s;
ll r = 0, b = 0;
rep(i, n) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll r = 0, b = 0;
rep(i, n) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [] | 895,786 | 895,787 | u614128939 | cpp |
p03080 | #include <bits/stdc++.h>
#define enld '\n'
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr double INFD = 1e100;
constexpr ll mod = 1000000007;
constexpr ll mod2 = 998244353;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// ios::sync_with_stdio(false);
// cin.tie(nullptr);
// ---------------------------------------------------------------------------
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'R')
cnt++;
else
cnt--;
}
if (cnt > N / 2) {
cout << "Yes" << enld;
} else {
cout << "No" << enld;
}
return 0;
} | #include <bits/stdc++.h>
#define enld '\n'
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr double INFD = 1e100;
constexpr ll mod = 1000000007;
constexpr ll mod2 = 998244353;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// ios::sync_with_stdio(false);
// cin.tie(nullptr);
// ---------------------------------------------------------------------------
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'R')
cnt++;
else
cnt--;
}
if (cnt > 0) {
cout << "Yes" << enld;
} else {
cout << "No" << enld;
}
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 895,788 | 895,789 | u550014122 | cpp |
p03080 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
//#define int long long
#define endl "\n"
#define fir first
#define sec second
#define fro front
#define m_p make_pair
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//#define all(v) v.begin(),v.end()
#define vecin(v) \
for (int i = 0; i < (int)v.size(); i++) \
cin >> v[i];
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int jousu(int x00, int y00) {
int z00 = 1;
for (int i = 0; i < y00; i++) {
z00 *= x00;
}
return z00;
}
int keta(int x00) {
int z00 = x00;
int w00 = 0;
while (z00 != 0) {
z00 /= 10;
w00++;
}
return w00;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int modpow(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res *a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)
swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) { return xx * yy / gcd(xx, yy); }
bool prime(int xx) {
int a = xx;
for (int i = 2; i * i <= xx; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
int com(int xx, int yy) {
int zz = 1;
for (int i = xx; i > xx - yy; i--) {
zz *= i;
zz %= mod;
}
for (int i = 1; i <= yy; i++) {
zz *= modinv(i, mod);
zz %= mod;
}
return zz;
}
int main() {
int n, a = 0, b = 0;
string s;
cin >> n >> s;
rep(i, n) {
if (s[i] = 'R') {
a++;
} else {
b++;
}
}
a > b ? cout << "Yes" << endl : cout << "No" << endl;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
//#define int long long
#define endl "\n"
#define fir first
#define sec second
#define fro front
#define m_p make_pair
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//#define all(v) v.begin(),v.end()
#define vecin(v) \
for (int i = 0; i < (int)v.size(); i++) \
cin >> v[i];
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int jousu(int x00, int y00) {
int z00 = 1;
for (int i = 0; i < y00; i++) {
z00 *= x00;
}
return z00;
}
int keta(int x00) {
int z00 = x00;
int w00 = 0;
while (z00 != 0) {
z00 /= 10;
w00++;
}
return w00;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int modpow(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res *a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)
swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) { return xx * yy / gcd(xx, yy); }
bool prime(int xx) {
int a = xx;
for (int i = 2; i * i <= xx; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
int com(int xx, int yy) {
int zz = 1;
for (int i = xx; i > xx - yy; i--) {
zz *= i;
zz %= mod;
}
for (int i = 1; i <= yy; i++) {
zz *= modinv(i, mod);
zz %= mod;
}
return zz;
}
int main() {
int n, a = 0, b = 0;
string s;
cin >> n >> s;
rep(i, n) {
if (s[i] == 'R') {
a++;
} else {
b++;
}
}
a > b ? cout << "Yes" << endl : cout << "No" << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 895,790 | 895,791 | u294700660 | cpp |
p03080 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define pi 3.1415926535
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
ll n, m, i, j, k, h, t, maxn, ttt, t1, t2, sig = 0, l, d;
int main() {
cin >> n;
string s;
n = 0, m = 0;
for (i = 0; i < s.length(); i++) {
if (s[i] == 'R')
n++;
if (s[i] == 'B')
m++;
}
if (n > m)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define pi 3.1415926535
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
ll n, m, i, j, k, h, t, maxn, ttt, t1, t2, sig = 0, l, d;
int main() {
cin >> n;
string s;
n = 0, m = 0;
cin >> s;
for (i = 0; i < s.length(); i++) {
if (s[i] == 'R')
n++;
if (s[i] == 'B')
m++;
}
if (n > m)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [] | 895,805 | 895,806 | u167906550 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
string S;
cin >> S;
int R = 0, B = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'R')
R++;
if (S.at(i) == 'B')
B++;
}
cout << (R > B ? "YES" : "NO") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
string S;
cin >> S;
int R = 0, B = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'R')
R++;
if (S.at(i) == 'B')
B++;
}
cout << (R > B ? "Yes" : "No") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,811 | 895,812 | u845937249 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
ll MOD = 1000000007;
ll INF = 200000000000000000;
double EPS = 1e-12;
double PI = 3.141592653589793238;
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<ll> connection;
UnionFind(int N) : par(N), rank(N), connection(N) {
rep(i, N) {
par[i] = i;
rank[i] = 0;
connection[i] = 1;
}
}
int root(int x) {
while (x != par[x]) {
x = par[x] = par[par[x]];
}
return x;
}
bool same(int x, int y) { return root(x) == root(y); }
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (!same(x, y)) {
connection[root(x)] += connection[root(y)];
connection[root(y)] = connection[root(x)];
}
if (rx == ry)
return;
if (rank[x] > rank[y]) {
par[y] = rx;
}
if (rank[x] < rank[y]) {
par[rx] = ry;
} else {
par[ry] = rx;
if (rank[x] == rank[y]) {
rank[rx]++;
}
}
}
ll SIZE(int x) { return connection[root(x)]; }
};
int main() {
ll N;
string S;
cin >> N >> S;
if (count(ALL(S), 'R') >= (S.size() + 1) / 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
ll MOD = 1000000007;
ll INF = 200000000000000000;
double EPS = 1e-12;
double PI = 3.141592653589793238;
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<ll> connection;
UnionFind(int N) : par(N), rank(N), connection(N) {
rep(i, N) {
par[i] = i;
rank[i] = 0;
connection[i] = 1;
}
}
int root(int x) {
while (x != par[x]) {
x = par[x] = par[par[x]];
}
return x;
}
bool same(int x, int y) { return root(x) == root(y); }
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (!same(x, y)) {
connection[root(x)] += connection[root(y)];
connection[root(y)] = connection[root(x)];
}
if (rx == ry)
return;
if (rank[x] > rank[y]) {
par[y] = rx;
}
if (rank[x] < rank[y]) {
par[rx] = ry;
} else {
par[ry] = rx;
if (rank[x] == rank[y]) {
rank[rx]++;
}
}
}
ll SIZE(int x) { return connection[root(x)]; }
};
int main() {
ll N;
string S;
cin >> N >> S;
if (count(ALL(S), 'R') >= (S.size()) / 2 + 1) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 895,813 | 895,814 | u393754572 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
int size, num = 0;
cin >> size >> s;
for (int i = 0; i < size; i++) {
if (s[i] = 'R')
++num;
}
if (num > (size - num))
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
int size, num = 0;
cin >> size >> s;
for (int i = 0; i < size; i++) {
if (s[i] == 'R')
++num;
}
if (num > (size - num))
cout << "Yes";
else
cout << "No";
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 895,827 | 895,828 | u512624048 | cpp |
p03080 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define ALL(a) (a).begin(), (a).end()
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 0;
rep(i, n) if (s[i] == 'R') cnt++;
if (cnt <= n / 2)
cout << "Yes";
else
cout << "No";
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define ALL(a) (a).begin(), (a).end()
int main() {
int n;
string s;
cin >> n;
cin >> s;
int cnt = 0;
rep(i, n) if (s[i] == 'R') cnt++;
if (cnt > n / 2)
cout << "Yes";
else
cout << "No";
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 895,831 | 895,832 | u969116807 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define pri priority_queue
#define syo <int,V<int>
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
//#define min min<int>
//#define max max<int>
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
*/
int gcm(int a, int b) {
int d = a, e = b, f;
if (a < b)
swap(a, b);
int c, m = 1;
while (m) {
c = a % b;
if (c == 0) {
f = b;
m--;
} else {
a = b;
b = c;
}
}
return f;
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
/*int gcm(int a,int b){
if(b==0)
return a;
return gcm(b,a%b);
}*/
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
signed main() {
int a;
cin >> a;
string b;
cin >> b;
Sort(b);
if (b[a / 2] == 'R')
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define pri priority_queue
#define syo <int,V<int>
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
//#define min min<int>
//#define max max<int>
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
*/
int gcm(int a, int b) {
int d = a, e = b, f;
if (a < b)
swap(a, b);
int c, m = 1;
while (m) {
c = a % b;
if (c == 0) {
f = b;
m--;
} else {
a = b;
b = c;
}
}
return f;
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
/*int gcm(int a,int b){
if(b==0)
return a;
return gcm(b,a%b);
}*/
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
signed main() {
int a;
cin >> a;
string b;
cin >> b;
Sort(b);
rev(b);
if (b[a / 2] == 'R')
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"call.add"
] | 895,835 | 895,836 | u322177979 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define be begin()
#define en end()
#define le length()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (__typeof(n) i = 0; i < n; i++)
#define repo(i, n) for (__typeof(n) i = 1; i <= n; i++)
#define eps 1e-6
#define pi 3.141592653589793
#define c(a) cout << a << "\n";
#define a(a) \
for (auto i : a) \
cout << i << " ";
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
ll n;
string s;
cin >> s;
ll l = 0, r = 0;
rep(i, n) {
if (s[i] == 'R')
r++;
else
l++;
}
if (r > l)
c("Yes") else c("No")
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define be begin()
#define en end()
#define le length()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (__typeof(n) i = 0; i < n; i++)
#define repo(i, n) for (__typeof(n) i = 1; i <= n; i++)
#define eps 1e-6
#define pi 3.141592653589793
#define c(a) cout << a << "\n";
#define a(a) \
for (auto i : a) \
cout << i << " ";
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll l = 0, r = 0;
rep(i, n) {
if (s[i] == 'R')
r++;
else
l++;
}
if (r > l)
c("Yes") else c("No")
} | [] | 895,840 | 895,841 | u062908837 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r = 0;
int b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
r++;
} else {
b++;
}
}
if (b > r) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r = 0;
int b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
r++;
} else {
b++;
}
}
if (b >= r) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 895,846 | 895,847 | u079553980 | cpp |
p03080 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::string s;
std::cin >> s;
int red = std::count(s.begin(), s.end(), 'R');
int blue = red - s.length();
if (red > blue) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::string s;
std::cin >> s;
int red = std::count(s.begin(), s.end(), 'R');
int blue = s.length() - red;
if (red > blue) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 895,852 | 895,853 | u914739916 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int count = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'R')
count++;
else
count--;
}
cout << (count > 0 ? "YES" : "NO") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int count = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'R')
count++;
else
count--;
}
cout << (count > 0 ? "Yes" : "No") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,868 | 895,869 | u849739818 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPL(i, a, n) for (ll i = a; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ENT "\n"
#define SORTVG(v) sort(v.begin(), v.end(), greater<>())
#define SORTV(v) sort(v.begin(), v.end())
#define ALL(v) (v).begin(), (v).end()
//#define MOD 1000000007
#define MOD 998244353
#define INF LLONG_MAX / 2
typedef long long ll;
typedef tuple<int, int, bool> Tb;
typedef pair<int, int> Pii;
typedef vector<int> Vi;
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
template <class T> void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> void YesNo(T &a) {
if (a) {
cout << "Yes" << ENT;
} else {
cout << "No" << ENT;
}
}
template <class T> void YESNO(T &a) {
if (a) {
cout << "YES" << ENT;
} else {
cout << "NO" << ENT;
}
}
template <class T> void AorB(T &a, string A, string B) {
if (a) {
cout << A << ENT;
} else {
cout << B << ENT;
}
}
int atcoder() {
string s;
int ans = 0;
cin >> s;
REP(i, 0, s.length()) {
if (s[i] == 'R')
ans++;
else
ans--;
}
if (ans > 0)
cout << "Yes" << ENT;
else
cout << "No" << ENT;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
atcoder();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPL(i, a, n) for (ll i = a; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ENT "\n"
#define SORTVG(v) sort(v.begin(), v.end(), greater<>())
#define SORTV(v) sort(v.begin(), v.end())
#define ALL(v) (v).begin(), (v).end()
//#define MOD 1000000007
#define MOD 998244353
#define INF LLONG_MAX / 2
typedef long long ll;
typedef tuple<int, int, bool> Tb;
typedef pair<int, int> Pii;
typedef vector<int> Vi;
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
template <class T> void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> void YesNo(T &a) {
if (a) {
cout << "Yes" << ENT;
} else {
cout << "No" << ENT;
}
}
template <class T> void YESNO(T &a) {
if (a) {
cout << "YES" << ENT;
} else {
cout << "NO" << ENT;
}
}
template <class T> void AorB(T &a, string A, string B) {
if (a) {
cout << A << ENT;
} else {
cout << B << ENT;
}
}
int atcoder() {
string s;
int ans = 0;
cin >> s >> s;
REP(i, 0, s.length()) {
if (s[i] == 'R')
ans++;
else
ans--;
}
if (ans > 0)
cout << "Yes" << ENT;
else
cout << "No" << ENT;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
atcoder();
return 0;
}
| [
"expression.operation.binary.add"
] | 895,879 | 895,880 | u635484372 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
string s;
int r, b;
int n;
cin >> n >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
string s;
int r = 0, b = 0;
int n;
cin >> n >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 895,885 | 895,886 | u187711881 | cpp |
p03080 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int r_total = 0, b_total = 0;
for (int i = 1; i <= a; i++) {
char s;
cin >> s;
if (s == 'B')
b_total++;
else if (s == 'R')
r_total++;
}
if (b_total > r_total)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int r_total = 0, b_total = 0;
for (int i = 1; i <= a; i++) {
char s;
cin >> s;
if (s == 'B')
b_total++;
else if (s == 'R')
r_total++;
}
if (b_total < r_total)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 895,892 | 895,893 | u952557476 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int r, b;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
cout << (r > b ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int r = 0, b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
cout << (r > b ? "Yes" : "No") << endl;
} | [
"variable_declaration.value.change"
] | 895,906 | 895,907 | u798086274 | cpp |
p03080 | // Pantyhose(black) + glasses = infinity
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) \
{ \
cerr << #A << " = "; \
for (int _ = 1; _ <= n; ++_) \
cerr << A[_] << ' '; \
cerr << '\n'; \
}
#define PR0(A, n) \
{ \
cerr << #A << " = "; \
for (int _ = 0; _ < n; ++_) \
cerr << A[_] << ' '; \
cerr << '\n'; \
}
#define FILE_NAME "data"
int main() {
#ifdef GLASSES_GIRL
freopen(FILE_NAME ".in", "r", stdin);
freopen(FILE_NAME ".out", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
if (count(s.begin(), s.end(), 'R') * 2 > s.size())
cout << "Yes";
else
cout << "No";
} | // Pantyhose(black) + glasses = infinity
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) \
{ \
cerr << #A << " = "; \
for (int _ = 1; _ <= n; ++_) \
cerr << A[_] << ' '; \
cerr << '\n'; \
}
#define PR0(A, n) \
{ \
cerr << #A << " = "; \
for (int _ = 0; _ < n; ++_) \
cerr << A[_] << ' '; \
cerr << '\n'; \
}
#define FILE_NAME "data"
int main() {
#ifdef GLASSES_GIRL
freopen(FILE_NAME ".in", "r", stdin);
freopen(FILE_NAME ".out", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
int n;
string s;
cin >> n >> s;
if (count(s.begin(), s.end(), 'R') * 2 > s.size())
cout << "Yes";
else
cout << "No";
} | [
"variable_declaration.add"
] | 895,914 | 895,915 | u682090147 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
string Answer = "No";
int N, Red = 0;
char input;
scanf("%d", &N);
for (int i = 0; i <= N; i++) {
if ((input = getchar()) == 'R')
Red++;
}
if (2 * Red - N)
Answer = "Yes";
cout << Answer;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string Answer = "No";
int N, Red = 0;
char input;
scanf("%d", &N);
for (int i = 0; i <= N; i++) {
if ((input = getchar()) == 'R')
Red++;
}
if (2 * Red - N > 0)
Answer = "Yes";
cout << Answer;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 895,916 | 895,917 | u038569501 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll amari = 1e9 + 7;
#define ben(a) a.begin(), a.end()
int main() {
string s;
cin >> s;
int r = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (b < r)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll amari = 1e9 + 7;
#define ben(a) a.begin(), a.end()
int main() {
string s;
int n;
cin >> n >> s;
int r = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (b < r)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"variable_declaration.add"
] | 895,918 | 895,919 | u452544900 | cpp |
p03080 | #include <iostream>
using namespace std;
int main() {
/* int N = 4;
string s = "BRBR";
*/
int N;
string s;
cin >> N >> s;
int cnt_R = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'L') {
cnt_R++;
}
}
int cnt_B = s.size() - cnt_R;
if (cnt_R > cnt_B) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
/* int N = 4;
string s = "RRBR";
*/
int N;
string s;
cin >> N >> s;
int cnt_R = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R') {
cnt_R++;
}
}
int cnt_B = s.size() - cnt_R;
if (cnt_R > cnt_B) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 895,924 | 895,925 | u915355756 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int cR = 0;
int cB = 0;
string s;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> s;
if (s == "R") {
++cR;
} else if (s == "B") {
++cB;
}
}
if (cR > cB) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int cR = 0;
int cB = 0;
char s;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> s;
if (s == 'R') {
++cR;
} else if (s == 'B') {
++cB;
}
}
if (cR > cB) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"variable_declaration.type.change",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 895,926 | 895,927 | u348914050 | cpp |
p03080 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
string b;
cin >> a >> b;
int R = 0;
for (int i = 0; i < a; i++) {
if (b[0] == 'R') {
R++;
}
}
if (2 * R > a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
string b;
cin >> a >> b;
int R = 0;
for (int i = 0; i < a; i++) {
if (b[i] == 'R') {
R++;
}
}
if (2 * R > a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 895,928 | 895,929 | u208430248 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, k, n) for (int i = k; i < n; ++i)
#define fore(i, a) for (auto &i : a)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int mod = 1000000000 + 7;
const static int inf = INT_MAX / 2;
const static llong INF = LLONG_MAX / 2;
const static double eps = 1e-10;
const static int dx[] = {1, 0, -1, 0};
const static int dy[] = {0, 1, 0, -1};
signed main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
int r, b;
rep(i, n) {
if (s[i] == 'R')
++r;
else
++b;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, k, n) for (int i = k; i < n; ++i)
#define fore(i, a) for (auto &i : a)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int mod = 1000000000 + 7;
const static int inf = INT_MAX / 2;
const static llong INF = LLONG_MAX / 2;
const static double eps = 1e-10;
const static int dx[] = {1, 0, -1, 0};
const static int dy[] = {0, 1, 0, -1};
signed main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
static int r, b;
rep(i, n) {
if (s[i] == 'R')
++r;
else
++b;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"variable_declaration.specifier.add"
] | 895,952 | 895,953 | u943004959 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, k, n) for (int i = k; i < n; ++i)
#define fore(i, a) for (auto &i : a)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int mod = 1000000000 + 7;
const static int inf = INT_MAX / 2;
const static llong INF = LLONG_MAX / 2;
const static double eps = 1e-10;
const static int dx[] = {1, 0, -1, 0};
const static int dy[] = {0, 1, 0, -1};
signed main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
int r, b;
rep(i, n) {
if (s[i] == 'R')
++r;
else
++b;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, k, n) for (int i = k; i < n; ++i)
#define fore(i, a) for (auto &i : a)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int mod = 1000000000 + 7;
const static int inf = INT_MAX / 2;
const static llong INF = LLONG_MAX / 2;
const static double eps = 1e-10;
const static int dx[] = {1, 0, -1, 0};
const static int dy[] = {0, 1, 0, -1};
signed main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
int r = 0, b = 0;
rep(i, n) {
if (s[i] == 'R')
++r;
else
++b;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 895,952 | 895,954 | u943004959 | cpp |
p03080 | #include <iostream>
using namespace std;
int main() {
int N;
int red = 0, blue = 0;
string S;
cin >> S;
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
red += 1;
} else {
blue += 1;
};
};
if (red > blue) {
cout << "Yes";
} else {
cout << "No";
};
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
int red = 0, blue = 0;
string S;
cin >> N;
cin >> S;
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
red += 1;
} else {
blue += 1;
};
};
if (red > blue) {
cout << "Yes";
} else {
cout << "No";
};
return 0;
}
| [] | 895,955 | 895,956 | u404459933 | cpp |
p03080 | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
typedef long long ll;
typedef long double R;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }
inline R sq(R x) { return sqrt(max(x, 0.0L)); }
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
// Problem Specific Parameter:
int main() {
int N;
cin >> N;
string s;
cin >> s;
int red = 0, blue = 0;
for (int i = 0; i < N; ++i) {
if (s[i] == 'R')
red++;
else if (s[i] == 'B')
blue;
}
if (red > blue)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
typedef long long ll;
typedef long double R;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }
inline R sq(R x) { return sqrt(max(x, 0.0L)); }
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
// Problem Specific Parameter:
int main() {
int N;
cin >> N;
string s;
cin >> s;
int red = 0, blue = 0;
for (int i = 0; i < N; ++i) {
if (s[i] == 'R')
red++;
else if (s[i] == 'B')
blue++;
}
if (red > blue)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [] | 895,957 | 895,958 | u013803727 | cpp |
p03080 | #include <iostream>
#include <string>
using namespace std;
int main() {
int Rcnt, N;
string s;
cin >> N;
cin >> s;
for (int i = 0; i < N; ++i) {
if (s[i] == 'R')
++Rcnt;
}
if (Rcnt > N - Rcnt)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int Rcnt = 0;
int N;
string s;
cin >> N;
cin >> s;
for (int i = 0; i < N; ++i) {
if (s[i] == 'R')
++Rcnt;
}
if (Rcnt > N - Rcnt)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
return 0;
} | [
"variable_declaration.add"
] | 895,961 | 895,962 | u929996201 | cpp |
p03080 | #include <iostream>
#include <string>
using namespace std;
int main() {
int Rcnt, N;
string s;
cin >> N >> s;
for (int i = 0; i < N; ++i) {
if (s[i] == 'R')
++Rcnt;
}
if (Rcnt > N - Rcnt)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int Rcnt = 0;
int N;
string s;
cin >> N;
cin >> s;
for (int i = 0; i < N; ++i) {
if (s[i] == 'R')
++Rcnt;
}
if (Rcnt > N - Rcnt)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
return 0;
} | [
"variable_declaration.add"
] | 895,963 | 895,962 | u929996201 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.setf(ios::fixed);
cout.precision(20);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
string s;
cin >> n;
int c1 = 0, c2 = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == 'R')
++c1;
else
++c2;
}
if (c1 > c2) {
cout << "Yes\n";
} else {
cout << "No\n";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.setf(ios::fixed);
cout.precision(20);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
string s;
cin >> s;
int c1 = 0, c2 = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == 'R')
++c1;
else
++c2;
}
if (c1 > c2) {
cout << "Yes\n";
} else {
cout << "No\n";
}
} | [
"identifier.change",
"expression.operation.binary.change"
] | 895,965 | 895,966 | u108304786 | cpp |
p03080 | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS 0.0000000001
using namespace std;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <typename Head, typename Value>
auto vectors(const Head &head, const Value &v) {
return vector<Value>(head, v);
}
template <typename Head, typename... Tail> auto vectors(Head x, Tail... tail) {
auto inner = vectors(tail...);
return vector<decltype(inner)>(x, inner);
}
template <class T> void join(T &a) {
int t = 0;
for (auto itr : a) {
if (t++)
cout << " ";
cout << itr;
}
cout << endl;
}
using ld = long double;
using pii = pair<int, int>;
using piii = pair<int, pii>;
int W, H;
int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
bool valid(int x, int y) { return (0 <= x && x < W) && (0 <= y && y < H); }
signed main() {
// std::ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int n;
cin >> n;
string s;
cin >> s;
int a = 0, c = 0;
for (auto c : s)
if (c == 'R')
a++;
else
c++;
cout << (a > c ? "Yes" : "No") << endl;
}
| #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS 0.0000000001
using namespace std;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <typename Head, typename Value>
auto vectors(const Head &head, const Value &v) {
return vector<Value>(head, v);
}
template <typename Head, typename... Tail> auto vectors(Head x, Tail... tail) {
auto inner = vectors(tail...);
return vector<decltype(inner)>(x, inner);
}
template <class T> void join(T &a) {
int t = 0;
for (auto itr : a) {
if (t++)
cout << " ";
cout << itr;
}
cout << endl;
}
using ld = long double;
using pii = pair<int, int>;
using piii = pair<int, pii>;
int W, H;
int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
bool valid(int x, int y) { return (0 <= x && x < W) && (0 <= y && y < H); }
signed main() {
// std::ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int n;
cin >> n;
string s;
cin >> s;
int a = 0, b = 0;
for (auto c : s) {
if (c == 'R')
a++;
else
b++;
}
cout << (a > b ? "Yes" : "No") << endl;
}
| [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 895,967 | 895,968 | u318334550 | cpp |
p03080 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, R = 0, B = 0;
string S, answer;
cin >> N >> S;
for (int i = 0; i < N; i++) {
if (S.at(1) == 'R') {
R++;
} else {
B++;
}
}
if (R > B) {
answer = "Yes";
} else {
answer = "No";
}
cout << answer << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, R = 0, B = 0;
string S, answer;
cin >> N >> S;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'R') {
R++;
} else {
B++;
}
}
if (R > B) {
answer = "Yes";
} else {
answer = "No";
}
cout << answer << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 895,969 | 895,970 | u514653860 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
string s;
int a, b;
int main() {
cin >> s;
for (char c : s) {
if (c == 'R')
a++;
else
b++;
}
printf("%s\n", a > b ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string s;
int a, b, n;
int main() {
cin >> n >> s;
for (char c : s) {
if (c == 'R')
a++;
else
b++;
}
printf("%s\n", a > b ? "Yes" : "No");
return 0;
} | [
"variable_declaration.add"
] | 895,976 | 895,977 | u184802358 | cpp |
p03080 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, r, b;
cin >> N;
char s[N];
cin >> s;
for (int i = 0; i < N; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int N, r = 0, b = 0;
cin >> N;
char s[N];
cin >> s;
for (int i = 0; i < N; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 895,985 | 895,986 | u528256243 | cpp |
p03080 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, r, b;
cin >> N;
char s[N];
cin >> s;
for (int i = 0; i < N; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, r = 0, b = 0;
cin >> N;
char s[N];
cin >> s;
for (int i = 0; i < N; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 895,989 | 895,986 | u528256243 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char s[100];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int num1 = 0, num2 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
num1++;
if (s[i] == 'B')
num2++;
}
if (num1 >= num2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char s[100];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int num1 = 0, num2 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
num1++;
if (s[i] == 'B')
num2++;
}
if (num1 > num2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 895,994 | 895,995 | u815448579 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, coun = 0, c = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
coun++;
} else if (s[i] == 'B') {
c++;
}
if (coun > c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, coun = 0, c = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
coun++;
} else if (s[i] == 'B') {
c++;
}
}
if (coun > c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"variable_declaration.type.change"
] | 896,005 | 896,006 | u333683836 | cpp |
p03080 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int red = 0;
int blue = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'R') {
++red;
} else {
++blue;
}
}
if (red > blue)
cout << "Yes" << endl;
else
cout << "NO" << endl;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int red = 0;
int blue = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'R') {
++red;
} else {
++blue;
}
}
if (red > blue)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,007 | 896,008 | u068896454 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n >> s;
int b = 0, r = 0;
for (auto c : s)
r += (c == 'R'), b = (c == 'B');
if (r > b)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n >> s;
int b = 0, r = 0;
for (auto c : s)
r += (c == 'R'), b += (c == 'B');
if (r > b)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| [
"assignment.value.change"
] | 896,009 | 896,010 | u386842336 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
#define dump(x) cout << #x << " = " << (x) << endl
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
int N;
int main() {
string s;
cin >> N >> s;
int a = 0;
rep(i, N) {
if (s[i] == 'R') {
++a;
} else {
--a;
}
}
puts(a ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
#define dump(x) cout << #x << " = " << (x) << endl
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
int N;
int main() {
string s;
cin >> N >> s;
int a = 0;
rep(i, N) {
if (s[i] == 'R') {
++a;
} else {
--a;
}
}
puts(a > 0 ? "Yes" : "No");
return 0;
} | [
"expression.operation.binary.add"
] | 896,011 | 896,012 | u742529680 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, r, b;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
r++;
} else {
b++;
}
}
cout << (r > b ? "Yes" : "No") << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, r = 0, b = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
r++;
} else {
b++;
}
}
cout << (r > b ? "Yes" : "No") << '\n';
return 0;
} | [
"variable_declaration.value.change"
] | 896,018 | 896,019 | u580075993 | cpp |
p03080 | #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int r = 0, b = 0;
for (char c : s)
if (c == 'R')
r++;
else
b++;
cout << (r > b ? "Yes" : "no") << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int r = 0, b = 0;
for (char c : s)
if (c == 'R')
r++;
else
b++;
cout << (r > b ? "Yes" : "No") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,029 | 896,030 | u374416262 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
cin >> str;
int len = str.length();
int r = 0, b = 0;
for (int i = 0; i < len; i++) {
if (str[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes\n";
else
cout << "no\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
cin >> str;
int len = str.length();
int r = 0, b = 0;
for (int i = 0; i < len; i++) {
if (str[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes\n";
else
cout << "No\n";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,031 | 896,032 | u047442155 | cpp |
p03080 | #include <stdio.h>
int main() {
int n, a = 0, b = 0;
char m;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%c", &m);
if (m == 'R') {
a++;
} else {
b++;
}
}
if (a > b) {
printf("Yes");
} else {
printf("No");
}
} | #include <stdio.h>
int main() {
int n, a = 0, b = 0;
char m;
scanf("%d", &n);
getchar();
for (int i = 0; i < n; i++) {
scanf("%c", &m);
if (m == 'R') {
a++;
} else {
b++;
}
}
if (a > b) {
printf("Yes");
} else {
printf("No");
}
} | [
"call.add"
] | 896,033 | 896,034 | u439952269 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int redsum = 0;
for (int i = 0; i < n; i++) {
if ('R' == s[i])
++redsum;
}
if (redsum > (n - 1) / 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int redsum = 0;
for (int i = 0; i < n; i++) {
if ('R' == s[i])
++redsum;
}
if (redsum > n - redsum)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.remove"
] | 896,043 | 896,044 | u465516065 | cpp |
p03080 | #include <iostream>
int main() {
int n;
std::cin >> n;
int x = 0;
for (int i = 0; i < n; ++i) {
char c;
std::cin >> c;
if (c == 'R')
++c;
else
--c;
}
if (x > 0)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
} | #include <iostream>
int main() {
int n;
std::cin >> n;
int x = 0;
for (int i = 0; i < n; ++i) {
char c;
std::cin >> c;
if (c == 'R')
++x;
else
--x;
}
if (x > 0)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
}
| [
"identifier.change"
] | 896,067 | 896,068 | u492926158 | cpp |
p03080 | #include <algorithm>
#include <chrono>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 100000000
#define uint unsigned int
#define MOD 1e9 + 7
using namespace std;
int main() {
int N;
char s;
int red = 0;
rep(i, N) {
cin >> s;
if (s == 'R') {
red++;
} else {
red--;
}
}
if (red > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <chrono>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 100000000
#define uint unsigned int
#define MOD 1e9 + 7
using namespace std;
int main() {
int N;
cin >> N;
char s;
int red = 0;
rep(i, N) {
cin >> s;
if (s == 'R') {
red++;
} else {
red--;
}
}
if (red > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [] | 896,071 | 896,072 | u668785999 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
string S;
cin >> N;
cin >> S;
ll r = 0;
for (int i = 0; i < N; ++i) {
if (S[i] == 'R')
r++;
}
if (r < N - r)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
string S;
cin >> N;
cin >> S;
ll r = 0;
for (int i = 0; i < N; ++i) {
if (S[i] == 'R')
r++;
}
if (r <= N - r)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 896,073 | 896,074 | u084968244 | cpp |
p03080 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, n, m) for (int i = n; i < int(m); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
int vx[] = {0, 0, -1, 1};
int vy[] = {1, -1, 0, 0};
int dx[] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy[] = {1, 1, 1, 0, 0, -1, -1, -1};
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
const ll mod = 1e9 + 7;
const int INF = INT_MAX / 2;
const int N_MAX = 100010;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int a, b;
REP(i, s.length()) {
if (s[i] == 'R') {
a++;
} else if (s[i] == 'B') {
b++;
}
}
if (a > b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, n, m) for (int i = n; i < int(m); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
int vx[] = {0, 0, -1, 1};
int vy[] = {1, -1, 0, 0};
int dx[] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy[] = {1, 1, 1, 0, 0, -1, -1, -1};
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
const ll mod = 1e9 + 7;
const int INF = INT_MAX / 2;
const int N_MAX = 100010;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int a = 0, b = 0;
REP(i, s.length()) {
if (s[i] == 'R') {
a++;
} else if (s[i] == 'B') {
b++;
}
}
if (a > b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"variable_declaration.value.change"
] | 896,097 | 896,098 | u369883202 | cpp |
p03080 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, n, m) for (int i = n; i < int(m); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
int vx[] = {0, 0, -1, 1};
int vy[] = {1, -1, 0, 0};
int dx[] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy[] = {1, 1, 1, 0, 0, -1, -1, -1};
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
const ll mod = 1e9 + 7;
const int INF = INT_MAX / 2;
const int N_MAX = 100010;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int a, b;
REP(i, s.length()) {
if (s[i] == 'A') {
a++;
} else if (s[i] == 'B') {
b++;
}
}
if (a > b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, n, m) for (int i = n; i < int(m); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
int vx[] = {0, 0, -1, 1};
int vy[] = {1, -1, 0, 0};
int dx[] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy[] = {1, 1, 1, 0, 0, -1, -1, -1};
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
const ll mod = 1e9 + 7;
const int INF = INT_MAX / 2;
const int N_MAX = 100010;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int a = 0, b = 0;
REP(i, s.length()) {
if (s[i] == 'R') {
a++;
} else if (s[i] == 'B') {
b++;
}
}
if (a > b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"variable_declaration.value.change",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 896,099 | 896,098 | u369883202 | cpp |
p03080 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
int b = 0;
int c = 0;
int N = s.size();
for (int i = 0; i < N; i++) {
if (s.at(i) == 'R') {
b++;
} else {
c++;
}
}
if (b > c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
int b = 0;
int c = 0;
int N = s.size();
for (int i = 0; i < N; i++) {
if (s.at(i) == 'R') {
b++;
} else {
c++;
}
}
if (b > c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [] | 896,103 | 896,104 | u870797515 | cpp |
p03080 |
/*
LANG:C++
PROB:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;
typedef unsigned long long ui64;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// ifstream fin(".in");
// ofstream fout(".in");
int n;
int b = 0, r = 0;
string s;
cin >> n;
cin >> s;
forn(i, n) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes";
else
cout << "NO";
return 0;
}
|
/*
LANG:C++
PROB:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;
typedef unsigned long long ui64;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// ifstream fin(".in");
// ofstream fout(".in");
int n;
int b = 0, r = 0;
string s;
cin >> n;
cin >> s;
forn(i, n) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,105 | 896,106 | u114047445 | cpp |
p03080 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
string S;
int main() {
cin >> S;
int r = 0, b = 0;
for (auto s : S) {
if (s == 'R') {
r++;
} else {
b++;
}
}
if (r > b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
string S;
int main() {
int n;
cin >> n >> S;
int r = 0, b = 0;
for (auto s : S) {
if (s == 'R') {
r++;
} else {
b++;
}
}
if (r > b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"variable_declaration.add"
] | 896,107 | 896,108 | u114234520 | cpp |
p03080 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// typedef pair<string,string> P;
// double dat[100][100];
// int dp[6][1010];//動的計画法
// int prime[100001];
// char str[1010][1010];
// typedef pair<ll,ll> A;
// vector<A> pc;
// int ABS(int a){return max(a,-a);}
int main() {
int n, r = 0, b = 0;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "no" << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// typedef pair<string,string> P;
// double dat[100][100];
// int dp[6][1010];//動的計画法
// int prime[100001];
// char str[1010][1010];
// typedef pair<ll,ll> A;
// vector<A> pc;
// int ABS(int a){return max(a,-a);}
int main() {
int n, r = 0, b = 0;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,109 | 896,110 | u559645647 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
const int N = 100 + 5;
int main() {
string a;
int n;
cin >> n;
cin >> a;
int r, g;
for (auto i : a) {
if (i == 'R')
++r;
else
++g;
}
if (r > g)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 100 + 5;
int main() {
string a;
int n;
cin >> n;
cin >> a;
int r = 0, g = 0;
for (auto i : a) {
if (i == 'R')
++r;
else
++g;
}
if (r > g)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 896,111 | 896,112 | u758675363 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef vector<int> VI;
typedef pair<int, int> PII;
//--------
int N;
signed main() {
cin >> N;
string s;
cin >> s;
int r, b;
REP(i, N) {
if (s[i] == 'R') {
r++;
} else {
b++;
}
}
if (r > b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef vector<int> VI;
typedef pair<int, int> PII;
//--------
int N;
signed main() {
cin >> N;
string s;
cin >> s;
int r = 0, b = 0;
REP(i, N) {
if (s[i] == 'R') {
r++;
} else {
b++;
}
}
if (r > b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"variable_declaration.value.change"
] | 896,136 | 896,137 | u465379376 | cpp |
p03080 | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define pb push_back
#define sz(i) (int)(i.size())
#define F first
#define S second
#define L long double
#define P pair<int, int>
const int inf = 0x3f3f3f3f3f3f3f3LL;
const int mod = (int)1e9 + 7;
using namespace std;
#if LOCAL
#include "../../tr.h"
#else
#define tr(...)
#define endl '\n'
#endif
template <class T> void smin(T &a, T val) {
if (a > val)
a = val;
}
template <class T> void smax(T &a, T val) {
if (a < val)
a = val;
}
const int N = 5 * (int)1e5 + 10;
int n, a[N];
int32_t main() {
_
cin >>
n;
string s;
cin >> s;
int red = 0, blue = 0;
for (int i = 0; i < n; ++i) {
red += (s[i] == 'R');
blue += (s[i] == 'R');
}
if (red > blue) {
cout << "Yes\n";
} else {
cout << "No\n";
}
#warning make sure N size is correct!
return 0;
} | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define pb push_back
#define sz(i) (int)(i.size())
#define F first
#define S second
#define L long double
#define P pair<int, int>
const int inf = 0x3f3f3f3f3f3f3f3LL;
const int mod = (int)1e9 + 7;
using namespace std;
#if LOCAL
#include "../../tr.h"
#else
#define tr(...)
#define endl '\n'
#endif
template <class T> void smin(T &a, T val) {
if (a > val)
a = val;
}
template <class T> void smax(T &a, T val) {
if (a < val)
a = val;
}
const int N = 5 * (int)1e5 + 10;
int n, a[N];
int32_t main() {
_
cin >>
n;
string s;
cin >> s;
int red = 0, blue = 0;
for (int i = 0; i < n; ++i) {
red += (s[i] == 'R');
blue += (s[i] == 'B');
}
if (red > blue) {
cout << "Yes\n";
} else {
cout << "No\n";
}
#warning make sure N size is correct!
return 0;
} | [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 896,138 | 896,139 | u063043074 | cpp |
p03080 | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
static const int giga = pow(10, 9);
// double pi = 3.141592653589793238463;
int main(void) {
int n;
cin >> n;
int red = 0, blue = 0;
for (int i = 0; i < n; i++) {
char temp;
cin >> temp;
if (temp = 'R') {
red++;
} else {
blue++;
}
}
if (red > blue) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
static const int giga = pow(10, 9);
// double pi = 3.141592653589793238463;
int main(void) {
int n;
cin >> n;
int red = 0, blue = 0;
for (int i = 0; i < n; i++) {
char temp;
cin >> temp;
if (temp == 'R') {
red++;
} else {
blue++;
}
}
if (red > blue) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 896,142 | 896,143 | u746560455 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const ll INF = 1LL << 58;
const ll MOD = 1000000007;
struct Edge {
ll s, t, d;
};
typedef vector<vector<Edge>> Graph;
typedef vector<pii> vpii;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
int A, B, N;
cin >> N;
A = 0;
B = 0;
char c;
REP(i, N) {
cin >> c;
if (c = 'R')
A++;
else
B++;
}
if (A > B)
cout << "Yes" << endl;
else
cout << "No" << endl;
// system("pause");
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const ll INF = 1LL << 58;
const ll MOD = 1000000007;
struct Edge {
ll s, t, d;
};
typedef vector<vector<Edge>> Graph;
typedef vector<pii> vpii;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
int A, B, N;
cin >> N;
A = 0;
B = 0;
char c;
REP(i, N) {
cin >> c;
if (c == 'R')
A++;
else
B++;
}
if (A > B)
cout << "Yes" << endl;
else
cout << "No" << endl;
// system("pause");
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 896,144 | 896,145 | u913836622 | cpp |
p03080 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
string S;
int main() {
int N, r, b;
cin >> N;
cin >> S;
rep(i, 0, N - 1) {
if (S[i] == 'R')
r++;
else
b++;
}
puts(r > b ? "Yes" : "No");
}
| #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
string S;
int main() {
int N, r = 0, b = 0;
cin >> N;
cin >> S;
rep(i, 0, N - 1) {
if (S[i] == 'R')
r++;
else
b++;
}
puts(r > b ? "Yes" : "No");
}
| [
"variable_declaration.value.change"
] | 896,150 | 896,151 | u146532488 | cpp |
p03080 | #include <bits/stdc++.h>
#define ll long long
#define inf 1000000000
#define infll 1000000000000000000ll
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define mpr make_pair
#define fi first
#define se second
#define pq priority_queue<int>
#define pqll priority_queue<ll>
#define up(x, y) (x < (y) ? x = (y) : 0)
#define dn(x, y) (x > (y) ? x = (y) : 0)
#define ad(x, y) (x = (x + (y)) % mod)
using namespace std;
int n, a[1000];
char s[1000009];
int main() {
scanf("%d%s", &n, s + 1);
int i;
for (i = 1; i <= n; i++)
a[s[i]]++;
puts(s['R'] > s['B'] ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define inf 1000000000
#define infll 1000000000000000000ll
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define mpr make_pair
#define fi first
#define se second
#define pq priority_queue<int>
#define pqll priority_queue<ll>
#define up(x, y) (x < (y) ? x = (y) : 0)
#define dn(x, y) (x > (y) ? x = (y) : 0)
#define ad(x, y) (x = (x + (y)) % mod)
using namespace std;
int n, a[1000];
char s[1000009];
int main() {
scanf("%d%s", &n, s + 1);
int i;
for (i = 1; i <= n; i++)
a[s[i]]++;
puts(a['R'] > a['B'] ? "Yes" : "No");
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 896,160 | 896,161 | u070528238 | cpp |
p03080 | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define TDARRAY(int, a, n, m) vector<vector<int>> a(n, vector<int>(m, 0));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int n;
string s;
int main() {
cin >> n >> s;
int r, b;
REP(i, n) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b) {
put("Yes");
} else {
put("No");
}
return 0;
}
| #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define TDARRAY(int, a, n, m) vector<vector<int>> a(n, vector<int>(m, 0));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int n;
string s;
int main() {
cin >> n >> s;
int r = 0, b = 0;
REP(i, n) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b) {
put("Yes");
} else {
put("No");
}
return 0;
}
| [
"variable_declaration.value.change"
] | 896,162 | 896,163 | u030685402 | cpp |
p03080 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstddef>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// clang-format off
template <typename T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); }
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> T clamp(T val, T min, T max) { return val < min ? min : (max < val ? max : val); }
template <typename T> size_t max_index(T begin, T end) { return distance(begin, max_element(begin, end)); }
template <typename T> size_t min_index(T begin, T end) { return distance(begin, min_element(begin, end)); }
// clang-format on
#define int long long
using namespace std;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
int r = 0;
int b = 0;
for (int i = 0; i < n; ++i)
if (s[i] == 'R')
++r;
else
++b;
if (r > b)
cout << 'Yes';
else
cout << 'No';
cout << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstddef>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// clang-format off
template <typename T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); }
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> T clamp(T val, T min, T max) { return val < min ? min : (max < val ? max : val); }
template <typename T> size_t max_index(T begin, T end) { return distance(begin, max_element(begin, end)); }
template <typename T> size_t min_index(T begin, T end) { return distance(begin, min_element(begin, end)); }
// clang-format on
#define int long long
using namespace std;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
int r = 0;
int b = 0;
for (int i = 0; i < n; ++i)
if (s[i] == 'R')
++r;
else
++b;
if (r > b)
cout << "Yes";
else
cout << "No";
cout << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 896,166 | 896,167 | u076865901 | cpp |
p03080 | using ll = long long;
using ull = unsigned long long;
#include <limits>
namespace pcl {
template <typename T> constexpr T TNF = std::numeric_limits<T>::max() / 2;
constexpr int INF = TNF<int>;
constexpr ll LNF = TNF<ll>;
constexpr double DNF = TNF<double>;
constexpr double EPS = 1e-8;
constexpr int P7 = 1'000'000'007;
constexpr int DX[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int DY[] = {0, 1, 0, -1, -1, 1, 1, -1};
} // namespace pcl
#include <algorithm>
#include <cmath>
#include <iostream>
namespace pcl {
template <typename T> void updmax(T &a, T const &b) { a = std::max(a, b); }
template <typename T> void updmin(T &a, T const &b) { a = std::min(a, b); }
template <typename T, typename U, typename V>
bool in_range(T const &begin, U const &mid, V const &end) {
return begin <= mid && mid < end;
}
template <typename T, typename U, typename V>
bool in_range(T const &begin, std::initializer_list<U> list, V const &end) {
auto p = std::minmax_element(list.begin(), list.end());
return begin <= *p.first && *p.second < end;
}
template <typename T, typename U, typename V>
bool in_range_strict(T const &begin, std::initializer_list<U> list,
V const &end) {
if (!std::is_sorted(list.begin(), list.end()))
return false;
return in_range(begin, list, end);
}
template <typename T> inline T cget() {
T x;
std::cin >> x;
return x;
}
} // namespace pcl
#include <iostream>
#include <vector>
namespace pcl {
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> const &v) {
os << '[';
for (size_t i = 0; i < v.size(); i++) {
if (i != 0)
os << ",";
os << v[i];
}
os << ']';
return os;
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for (size_t i = 0; i < v.size(); i++)
is >> v[i];
return is;
}
} // namespace pcl
#include <bits/stdc++.h>
using namespace std;
using namespace pcl;
int main() {
int n;
string s;
int r = 0, b = 0;
cin >> n >> s;
for (char c : s) {
if (c == 'r')
r++;
if (c == 'b')
b++;
}
cout << (r > b ? "Yes" : "No") << endl;
}
| using ll = long long;
using ull = unsigned long long;
#include <limits>
namespace pcl {
template <typename T> constexpr T TNF = std::numeric_limits<T>::max() / 2;
constexpr int INF = TNF<int>;
constexpr ll LNF = TNF<ll>;
constexpr double DNF = TNF<double>;
constexpr double EPS = 1e-8;
constexpr int P7 = 1'000'000'007;
constexpr int DX[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int DY[] = {0, 1, 0, -1, -1, 1, 1, -1};
} // namespace pcl
#include <algorithm>
#include <cmath>
#include <iostream>
namespace pcl {
template <typename T> void updmax(T &a, T const &b) { a = std::max(a, b); }
template <typename T> void updmin(T &a, T const &b) { a = std::min(a, b); }
template <typename T, typename U, typename V>
bool in_range(T const &begin, U const &mid, V const &end) {
return begin <= mid && mid < end;
}
template <typename T, typename U, typename V>
bool in_range(T const &begin, std::initializer_list<U> list, V const &end) {
auto p = std::minmax_element(list.begin(), list.end());
return begin <= *p.first && *p.second < end;
}
template <typename T, typename U, typename V>
bool in_range_strict(T const &begin, std::initializer_list<U> list,
V const &end) {
if (!std::is_sorted(list.begin(), list.end()))
return false;
return in_range(begin, list, end);
}
template <typename T> inline T cget() {
T x;
std::cin >> x;
return x;
}
} // namespace pcl
#include <iostream>
#include <vector>
namespace pcl {
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> const &v) {
os << '[';
for (size_t i = 0; i < v.size(); i++) {
if (i != 0)
os << ",";
os << v[i];
}
os << ']';
return os;
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for (size_t i = 0; i < v.size(); i++)
is >> v[i];
return is;
}
} // namespace pcl
#include <bits/stdc++.h>
using namespace std;
using namespace pcl;
int main() {
int n;
string s;
int r = 0, b = 0;
cin >> n >> s;
for (char c : s) {
if (c == 'R')
r++;
if (c == 'B')
b++;
}
cout << (r > b ? "Yes" : "No") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 896,170 | 896,171 | u747446319 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
class Solution {
string s;
public:
void run() {
cin >> s;
cin >> s;
cout << (count(s.begin(), s.end(), 'R') > count(s.begin(), s.end(), 'B')
? "YES"
: "NO")
<< '\n';
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
Solution().run();
}
| #include <bits/stdc++.h>
using namespace std;
class Solution {
string s;
public:
void run() {
cin >> s;
cin >> s;
cout << (count(s.begin(), s.end(), 'R') > count(s.begin(), s.end(), 'B')
? "Yes"
: "No")
<< '\n';
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
Solution().run();
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,172 | 896,173 | u459737327 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int c = 0, d = 0;
int i;
for (i = 0; i < s.size(); i++) {
if (s[i] == 'R')
c++;
else
d++;
}
if (c > d) {
cout << "Yes\n";
} else
cout << "NO\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int c = 0, d = 0;
int i;
for (i = 0; i < s.size(); i++) {
if (s[i] == 'R')
c++;
else
d++;
}
if (c > d) {
cout << "Yes\n";
} else
cout << "No\n";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,176 | 896,177 | u859075846 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define p_q priority_queue
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define RFOR(i, a, b) for (int i = (a); i >= b; i--)
#define MN 200005
int n;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> s;
int r = 0, b = 0;
F0R(i, n) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define p_q priority_queue
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define RFOR(i, a, b) for (int i = (a); i >= b; i--)
#define MN 200005
int n;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> s;
int r = 0, b = 0;
F0R(i, n) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,179 | 896,180 | u396284099 | cpp |
p03080 | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struct edge {
long long to, cost;
};
vector<vector<edge>> G;
int n, r, b;
int main() {
string h;
cin >> h;
for (int i = 0; i < h.length(); ++i) {
if (h[i] == 'R') {
++r;
} else {
++b;
}
}
if (r > b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struct edge {
long long to, cost;
};
vector<vector<edge>> G;
int n, r, b;
int main() {
string h;
cin >> n;
cin >> h;
for (int i = 0; i < h.length(); ++i) {
if (h[i] == 'R') {
++r;
} else {
++b;
}
}
if (r > b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [] | 896,181 | 896,182 | u539402331 | cpp |
p03080 | #include <bits/stdc++.h>
#define X first
#define Y second
#define INF 1000 * 1000 * 1000
#define PB push_back
const int MAX = 505;
using namespace std;
int main() {
int N;
cin >> N;
int r = 0, b = 0;
while (N--) {
char c;
cin >> c;
r += c == 'R';
b += c != 'R';
}
cout << ((r > b) ? "YES" : "NO");
return 0;
}
| #include <bits/stdc++.h>
#define X first
#define Y second
#define INF 1000 * 1000 * 1000
#define PB push_back
const int MAX = 505;
using namespace std;
int main() {
int N;
cin >> N;
int r = 0, b = 0;
while (N--) {
char c;
cin >> c;
r += c == 'R';
b += c != 'R';
}
cout << ((r > b) ? "Yes" : "No");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,183 | 896,184 | u804093140 | cpp |
p03081 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<pair<char, ll>> a(q);
for (int i = 0; i < q; i++) {
char dir;
cin >> a[i].first >> dir;
if (dir == 'L')
a[i].second = -1;
else
a[i].second = 1;
}
ll res = 0;
//左に到達するか
ll l = 0;
ll r = n - 1;
while (1) {
if (r - l <= 1)
break;
ll mid = (r + l) / 2;
ll now = mid;
bool left = false;
for (int i = 0; i < q; i++) {
if (a[i].first == s[now])
now += a[i].second;
if (now >= n)
break;
if (now < 0) {
left = true;
break;
}
}
if (left)
l = mid;
else
r = mid;
}
res += r;
// cout << l << " " << r << endl;
//右に到達するか
l = -1;
r = n;
while (1) {
if (r - l <= 1)
break;
ll mid = (r + l) / 2;
ll now = mid;
bool right = false;
for (int i = 0; i < q; i++) {
if (a[i].first == s[now])
now += a[i].second;
if (now < 0)
break;
if (now >= n) {
right = true;
break;
}
}
// cout << "right" << " " << mid << " " << right << endl;
if (right)
r = mid;
else
l = mid;
}
res += n - r;
// cout << l << " " << r << endl;
cout << n - res << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<pair<char, ll>> a(q);
for (int i = 0; i < q; i++) {
char dir;
cin >> a[i].first >> dir;
if (dir == 'L')
a[i].second = -1;
else
a[i].second = 1;
}
ll res = 0;
//左に到達するか
ll l = -1;
ll r = n;
while (1) {
if (r - l <= 1)
break;
ll mid = (r + l) / 2;
ll now = mid;
bool left = false;
for (int i = 0; i < q; i++) {
if (a[i].first == s[now])
now += a[i].second;
if (now >= n)
break;
if (now < 0) {
left = true;
break;
}
}
if (left)
l = mid;
else
r = mid;
}
res += r;
// cout << l << " " << r << endl;
//右に到達するか
l = -1;
r = n;
while (1) {
if (r - l <= 1)
break;
ll mid = (r + l) / 2;
ll now = mid;
bool right = false;
for (int i = 0; i < q; i++) {
if (a[i].first == s[now])
now += a[i].second;
if (now < 0)
break;
if (now >= n) {
right = true;
break;
}
}
// cout << "right" << " " << mid << " " << right << endl;
if (right)
r = mid;
else
l = mid;
}
res += n - r;
// cout << l << " " << r << endl;
cout << n - res << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 896,185 | 896,186 | u567906952 | cpp |
p03081 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int t1 = -1;
int f1 = N;
while (f1 - t1 > 1) {
int mid = (t1 + f1) / 2;
int pos = mid;
for (int i = 0; i < mid; i++) {
if (s[pos] == t[i]) {
if (d[i] == 'L') {
pos--;
} else {
pos++;
}
}
if (pos == -1 || pos == N) {
break;
}
}
if (pos == -1) {
t1 = mid;
} else {
f1 = mid;
}
}
int t2 = N;
int f2 = -1;
while (t2 - f2 > 1) {
int mid = (t2 + f2) / 2;
int pos = mid;
for (int i = 0; i < mid; i++) {
if (s[pos] == t[i]) {
if (d[i] == 'L') {
pos--;
} else {
pos++;
}
}
if (pos == -1 || pos == N) {
break;
}
}
if (pos == N) {
t2 = mid;
} else {
f2 = mid;
}
}
cout << t2 - t1 - 1 << endl;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int t1 = -1;
int f1 = N;
while (f1 - t1 > 1) {
int mid = (t1 + f1) / 2;
int pos = mid;
for (int i = 0; i < Q; i++) {
if (s[pos] == t[i]) {
if (d[i] == 'L') {
pos--;
} else {
pos++;
}
}
if (pos == -1 || pos == N) {
break;
}
}
if (pos == -1) {
t1 = mid;
} else {
f1 = mid;
}
}
int t2 = N;
int f2 = -1;
while (t2 - f2 > 1) {
int mid = (t2 + f2) / 2;
int pos = mid;
for (int i = 0; i < Q; i++) {
if (s[pos] == t[i]) {
if (d[i] == 'L') {
pos--;
} else {
pos++;
}
}
if (pos == -1 || pos == N) {
break;
}
}
if (pos == N) {
t2 = mid;
} else {
f2 = mid;
}
}
cout << t2 - t1 - 1 << endl;
} | [
"identifier.change",
"control_flow.loop.condition.change"
] | 896,199 | 896,200 | u424374375 | cpp |
p03081 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int t1 = -1;
int f1 = N;
while (f1 - t1 > 1) {
int mid = (t1 + f1) / 2;
int pos = mid;
for (int i = 0; i < mid; i++) {
if (s[pos] == t[i]) {
if (d[i] == 'L') {
pos--;
} else {
pos++;
}
}
if (pos == -1 || pos == N) {
break;
}
}
if (pos == -1) {
t1 = mid;
} else {
f1 = mid;
}
}
int t2 = N;
int f2 = -1;
while (t2 - f2 > 1) {
int mid = (t2 + f2) / 2;
int pos = mid;
for (int i = 0; i < mid; i++) {
if (s[pos] == t[i]) {
if (d[i] == 'L') {
pos--;
} else {
pos++;
}
}
if (pos == -1 || pos == N) {
break;
}
}
if (pos == N) {
t2 = mid;
} else {
f2 = mid;
}
}
cout << t2 - t1 + 1 << endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int t1 = -1;
int f1 = N;
while (f1 - t1 > 1) {
int mid = (t1 + f1) / 2;
int pos = mid;
for (int i = 0; i < Q; i++) {
if (s[pos] == t[i]) {
if (d[i] == 'L') {
pos--;
} else {
pos++;
}
}
if (pos == -1 || pos == N) {
break;
}
}
if (pos == -1) {
t1 = mid;
} else {
f1 = mid;
}
}
int t2 = N;
int f2 = -1;
while (t2 - f2 > 1) {
int mid = (t2 + f2) / 2;
int pos = mid;
for (int i = 0; i < Q; i++) {
if (s[pos] == t[i]) {
if (d[i] == 'L') {
pos--;
} else {
pos++;
}
}
if (pos == -1 || pos == N) {
break;
}
}
if (pos == N) {
t2 = mid;
} else {
f2 = mid;
}
}
cout << t2 - t1 - 1 << endl;
} | [
"identifier.change",
"control_flow.loop.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 896,201 | 896,200 | u424374375 | cpp |
p03081 | #pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(), (a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i, j, k) mkp(i, mkp(j, k))
#define rng(i, s, n) for (int i = (s); i < (n); i++)
#define rep(i, n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define pb emplace_back
#define crdcomp(b) \
sort(all((b))); \
(b).erase(unique(all((b))), (b).end())
#define getidx(b, i) lower_bound(all(b), (i)) - b.begin()
#define ssp(i, n) (i == (int)(n)-1 ? "\n" : " ")
#define ctoi(c) (int)(c - '0')
#define itoc(c) (char)(c + '0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) \
int quetimes_ = (n); \
rep(qq123_, quetimes_)
#define gcj printf("Case #%lld: ", qq123_ + 1)
#define readv(a, n) \
a.resize(n, 0); \
rep(i, (n)) a[i] = read()
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int MXN = 500000 + 100;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vec<int> dx{-1, 1, 0, 0}, dy{0, 0, -1, 1};
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll read() {
ll u, k = scanf("%lld", &u);
return u;
}
string reads() {
string s;
cin >> s;
return s;
}
H readh(bool g = 0) {
H u;
int k = scanf("%lld %lld", &u.fs, &u.sc);
if (g)
u.fs--, u.sc--;
return u;
}
bool ina(H t, int h, int w) {
return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w;
}
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll mod_pow(ll x, ll n, ll p = mod) {
ll res = 1;
x %= p;
while (n > 0) {
if (n & 1)
res = res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
} // x^n%p
ll bitcount(ll x) {
int sum = 0;
for (int i = 0; i < 60; i++)
if ((1ll << i) & x)
sum++;
return sum;
}
/*constexpr int fn_ = 5000005;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll m) {
if (!fact_[0]) {
fact_[0] = 1; comp_[0] = 1;
for (int i = 1; i < fn_; i++)
fact_[i] = fact_[i - 1] * i % m;
comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], m - 2, m);
for (int i = fn_ - 2; i > 0; i--)
comp_iiiiiiiiiiiijijiii[i] = comp_[i + 1] * (i + 1) % m;
}
if (x < y) return 0;
return fact_[x] * comp_[x - y] % m * comp_[y] % m;
}*/
//--------------------------------------------------------------
int n, q;
string s;
char t[300000], d[300000];
signed main() {
cin >> n >> q >> s;
rep(i, q) cin >> t[i] >> d[i];
auto F = [&](int x, int y) -> bool {
rep(i, q) {
if (s[x] == t[i]) {
if (d[i] == 'L')
x--;
else
x++;
}
if (x == y)
return 1;
if (!ina(x, 0, n))
return 0;
}
};
vec<int> c(n);
rep(i, n) c[i] = i;
cout << partition_point(all(c), [&](int i) { return F(i, n) == 0; }) -
partition_point(all(c), [&](int i) { return F(i, -1); })
<< endl;
} | #pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(), (a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i, j, k) mkp(i, mkp(j, k))
#define rng(i, s, n) for (int i = (s); i < (n); i++)
#define rep(i, n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define pb emplace_back
#define crdcomp(b) \
sort(all((b))); \
(b).erase(unique(all((b))), (b).end())
#define getidx(b, i) lower_bound(all(b), (i)) - b.begin()
#define ssp(i, n) (i == (int)(n)-1 ? "\n" : " ")
#define ctoi(c) (int)(c - '0')
#define itoc(c) (char)(c + '0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) \
int quetimes_ = (n); \
rep(qq123_, quetimes_)
#define gcj printf("Case #%lld: ", qq123_ + 1)
#define readv(a, n) \
a.resize(n, 0); \
rep(i, (n)) a[i] = read()
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int MXN = 500000 + 100;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vec<int> dx{-1, 1, 0, 0}, dy{0, 0, -1, 1};
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll read() {
ll u, k = scanf("%lld", &u);
return u;
}
string reads() {
string s;
cin >> s;
return s;
}
H readh(bool g = 0) {
H u;
int k = scanf("%lld %lld", &u.fs, &u.sc);
if (g)
u.fs--, u.sc--;
return u;
}
bool ina(H t, int h, int w) {
return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w;
}
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll mod_pow(ll x, ll n, ll p = mod) {
ll res = 1;
x %= p;
while (n > 0) {
if (n & 1)
res = res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
} // x^n%p
ll bitcount(ll x) {
int sum = 0;
for (int i = 0; i < 60; i++)
if ((1ll << i) & x)
sum++;
return sum;
}
/*constexpr int fn_ = 5000005;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll m) {
if (!fact_[0]) {
fact_[0] = 1; comp_[0] = 1;
for (int i = 1; i < fn_; i++)
fact_[i] = fact_[i - 1] * i % m;
comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], m - 2, m);
for (int i = fn_ - 2; i > 0; i--)
comp_iiiiiiiiiiiijijiii[i] = comp_[i + 1] * (i + 1) % m;
}
if (x < y) return 0;
return fact_[x] * comp_[x - y] % m * comp_[y] % m;
}*/
//--------------------------------------------------------------
int n, q;
string s;
char t[300000], d[300000];
signed main() {
cin >> n >> q >> s;
rep(i, q) cin >> t[i] >> d[i];
auto F = [&](int x, int y) -> bool {
rep(i, q) {
if (s[x] == t[i]) {
if (d[i] == 'L')
x--;
else
x++;
}
if (x == y)
return 1;
if (!ina(x, 0, n))
return 0;
}
return 0;
};
vec<int> c(n);
rep(i, n) c[i] = i;
cout << partition_point(all(c), [F](int i) { return F(i, n) == 0; }) -
partition_point(all(c), [F](int i) { return F(i, -1); })
<< endl;
} | [
"control_flow.return.add",
"control_flow.return.0.add",
"io.output.change"
] | 896,216 | 896,215 | u811004127 | cpp |
p03081 | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i <= (ll)(n); i++)
#define per(i, j, n) for (ll i = (ll)(j); (ll)(n) <= i; i--)
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (ll)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (ll)(key)))
#define pb emplace_back
#define mp std::make_pair
#define endl "\n"
using std::cin;
using std::cout;
using std::lower_bound;
using std::string;
using std::upper_bound;
using std::vector;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll, ll>;
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD=998244353;
// constexpr ll MOD=100000;
constexpr ll MAX = 1e7;
constexpr ll INF = (1ll << 60);
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
struct Binary_indexed_tree {
int N;
vi bit;
Binary_indexed_tree(int n) : N(n) { bit.resize(N + 1, 0); }
void add(int x, int a) {
for (x; x <= N; x += (x & -x))
bit[x] += a;
}
ll sum(int x) {
ll ret = 0;
for (x; x > 0; x -= (x & -x))
ret += bit[x];
return ret;
}
ll lower_bound(ll X) {
if (sum(N) < X)
return -1;
ll ret = 0, memo = 1, sum = 0;
while (memo * 2 <= N)
memo *= 2;
while (memo > 0) {
if (memo + ret <= N && sum + bit[memo + ret] < X) {
sum += bit[memo + ret];
ret += memo;
}
memo /= 2;
}
return ret + 1;
}
};
struct Union_Find {
ll N;
vi par;
vi siz;
Union_Find(int n) : N(n) {
par.resize(N);
siz.resize(N, 1);
rep(i, 0, N) par[i] = i;
}
ll root(ll X) {
if (par[X] == X)
return X;
return par[X] = root(par[X]);
}
bool same(ll X, ll Y) { return root(X) == root(Y); }
void unite(ll X, ll Y) {
X = root(X);
Y = root(Y);
if (X == Y)
return;
par[X] = Y;
siz[Y] += siz[X];
siz[X] = 0;
}
ll size(ll X) { return siz[root(X)]; }
};
ll modpow(ll X, ll Y, ll mod) {
ll sum = X, cnt = 1;
vi A;
while (cnt <= Y) {
A.pb(sum);
sum *= sum;
sum %= mod;
cnt *= 2;
}
int M = A.size();
ll ret = 1;
REP(i, 1, M) {
if (Y >= (1ll << M - i)) {
Y -= (1ll << M - i);
ret *= A[M - i];
ret %= mod;
}
}
return ret;
}
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(ll n, ll r) {
if (n < r || n < 0 || r < 0)
return 0;
return fac[n] * finv[r] % MOD * finv[n - r] % MOD;
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
ll N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<char> T(Q), D(Q);
rep(i, 0, Q) { cin >> T[i] >> D[i]; }
ll left = 0, right = N;
ll ans = N;
while (left + 1 < right) {
ll mid = (left + right) / 2;
if (mid == 0)
left = mid;
else {
ll X = mid - 1;
bool flag = 1;
rep(i, 0, Q) {
if (S[X] == T[i]) {
if (D[i] == 'L')
X--;
else
X++;
}
if (X == -1) {
flag = 0;
break;
}
if (X == N)
break;
}
if (flag)
right = mid;
else
left = mid;
}
}
ll memo = left;
ll x = right - 1;
bool f = 1;
rep(i, 0, Q) {
if (S[x] == T[i]) {
if (D[i] == 'L')
x--;
else
x++;
}
if (x == -1) {
f = 0;
break;
}
if (x == N)
break;
}
if (!f)
memo = right;
ans -= memo;
left = 0, right = N;
while (left + 1 < right) {
ll mid = (left + right) / 2;
if (mid == 0)
left = mid;
else {
ll X = N - mid;
bool flag = 1;
rep(i, 0, Q) {
if (S[X] == T[i]) {
if (D[i] == 'L')
X--;
else
X++;
}
if (X == N) {
flag = 0;
break;
}
if (X == -1)
break;
}
if (flag)
right = mid;
else
left = mid;
}
}
memo = N - right, f = 1;
rep(i, 0, Q) {
if (S[x] == T[i]) {
if (D[i] == 'L')
x--;
else
x++;
}
if (x == N) {
f = 0;
break;
}
if (x == -1)
break;
}
if (!f)
memo = right;
ans -= memo;
cout << ans << endl;
} | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i <= (ll)(n); i++)
#define per(i, j, n) for (ll i = (ll)(j); (ll)(n) <= i; i--)
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (ll)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (ll)(key)))
#define pb emplace_back
#define mp std::make_pair
#define endl "\n"
using std::cin;
using std::cout;
using std::lower_bound;
using std::string;
using std::upper_bound;
using std::vector;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll, ll>;
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD=998244353;
// constexpr ll MOD=100000;
constexpr ll MAX = 1e7;
constexpr ll INF = (1ll << 60);
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
struct Binary_indexed_tree {
int N;
vi bit;
Binary_indexed_tree(int n) : N(n) { bit.resize(N + 1, 0); }
void add(int x, int a) {
for (x; x <= N; x += (x & -x))
bit[x] += a;
}
ll sum(int x) {
ll ret = 0;
for (x; x > 0; x -= (x & -x))
ret += bit[x];
return ret;
}
ll lower_bound(ll X) {
if (sum(N) < X)
return -1;
ll ret = 0, memo = 1, sum = 0;
while (memo * 2 <= N)
memo *= 2;
while (memo > 0) {
if (memo + ret <= N && sum + bit[memo + ret] < X) {
sum += bit[memo + ret];
ret += memo;
}
memo /= 2;
}
return ret + 1;
}
};
struct Union_Find {
ll N;
vi par;
vi siz;
Union_Find(int n) : N(n) {
par.resize(N);
siz.resize(N, 1);
rep(i, 0, N) par[i] = i;
}
ll root(ll X) {
if (par[X] == X)
return X;
return par[X] = root(par[X]);
}
bool same(ll X, ll Y) { return root(X) == root(Y); }
void unite(ll X, ll Y) {
X = root(X);
Y = root(Y);
if (X == Y)
return;
par[X] = Y;
siz[Y] += siz[X];
siz[X] = 0;
}
ll size(ll X) { return siz[root(X)]; }
};
ll modpow(ll X, ll Y, ll mod) {
ll sum = X, cnt = 1;
vi A;
while (cnt <= Y) {
A.pb(sum);
sum *= sum;
sum %= mod;
cnt *= 2;
}
int M = A.size();
ll ret = 1;
REP(i, 1, M) {
if (Y >= (1ll << M - i)) {
Y -= (1ll << M - i);
ret *= A[M - i];
ret %= mod;
}
}
return ret;
}
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(ll n, ll r) {
if (n < r || n < 0 || r < 0)
return 0;
return fac[n] * finv[r] % MOD * finv[n - r] % MOD;
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
ll N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<char> T(Q), D(Q);
rep(i, 0, Q) { cin >> T[i] >> D[i]; }
ll left = 0, right = N;
ll ans = N;
while (left + 1 < right) {
ll mid = (left + right) / 2;
if (mid == 0)
left = mid;
else {
ll X = mid - 1;
bool flag = 1;
rep(i, 0, Q) {
if (S[X] == T[i]) {
if (D[i] == 'L')
X--;
else
X++;
}
if (X == -1) {
flag = 0;
break;
}
if (X == N)
break;
}
if (flag)
right = mid;
else
left = mid;
}
}
ll memo = left;
ll x = right - 1;
bool f = 1;
rep(i, 0, Q) {
if (S[x] == T[i]) {
if (D[i] == 'L')
x--;
else
x++;
}
if (x == -1) {
f = 0;
break;
}
if (x == N)
break;
}
if (!f)
memo = right;
ans -= memo;
left = 0, right = N;
while (left + 1 < right) {
ll mid = (left + right) / 2;
if (mid == 0)
left = mid;
else {
ll X = N - mid;
bool flag = 1;
rep(i, 0, Q) {
if (S[X] == T[i]) {
if (D[i] == 'L')
X--;
else
X++;
}
if (X == N) {
flag = 0;
break;
}
if (X == -1)
break;
}
if (flag)
right = mid;
else
left = mid;
}
}
memo = left;
x = N - right, f = 1;
rep(i, 0, Q) {
if (S[x] == T[i]) {
if (D[i] == 'L')
x--;
else
x++;
}
if (x == N) {
f = 0;
break;
}
if (x == -1)
break;
}
if (!f)
memo = right;
ans -= memo;
cout << ans << endl;
} | [
"assignment.add"
] | 896,217 | 896,218 | u347057617 | cpp |
p03081 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
const long long inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<P, int> PP;
typedef pair<int, PP> PPP;
struct edge {
int to;
int to2;
int cost;
};
string qt, qd;
signed main() {
int n, q;
cin >> n >> q;
string X;
cin >> X;
string s = "%";
s += X;
s.push_back('%');
rep(i, q) {
char t, d;
cin >> t >> d;
qt.push_back(t);
qd.push_back(d);
}
int lb = 0, ub = n + 1;
while (ub - lb > 1) {
int mi = (lb + ub) / 2;
char nlt = s[mi];
int pos = mi;
rep(i, q) {
if (pos == 0)
break;
if (nlt == qt[i]) {
if (qd[i] == 'L') {
pos--;
nlt = s[pos];
} else if (qd[i] == 'R') {
pos++;
nlt = s[pos];
}
}
}
if (pos == 0)
lb = mi;
else
ub = mi;
}
int lb2 = 0, ub2 = n + 1;
while (ub2 - lb2 > 1) {
int mi = (lb2 + ub2) / 2;
char nlt = s[mi];
int pos = mi;
rep(i, q) {
if (pos == n + 1)
break;
if (nlt == qt[i]) {
if (qd[i] == 'L') {
pos--;
nlt = s[pos];
} else if (qd[i] == 'R') {
pos++;
nlt = s[pos];
}
}
}
if (pos == n + 1)
ub2 = mi;
else
lb2 = mi;
}
cout << n - lb2 + ub << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
const long long inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<P, int> PP;
typedef pair<int, PP> PPP;
struct edge {
int to;
int to2;
int cost;
};
string qt, qd;
signed main() {
int n, q;
cin >> n >> q;
string X;
cin >> X;
string s = "%";
s += X;
s.push_back('%');
rep(i, q) {
char t, d;
cin >> t >> d;
qt.push_back(t);
qd.push_back(d);
}
int lb = 0, ub = n + 1;
while (ub - lb > 1) {
int mi = (lb + ub) / 2;
char nlt = s[mi];
int pos = mi;
rep(i, q) {
if (pos == 0)
break;
if (nlt == qt[i]) {
if (qd[i] == 'L') {
pos--;
nlt = s[pos];
} else if (qd[i] == 'R') {
pos++;
nlt = s[pos];
}
}
}
if (pos == 0)
lb = mi;
else
ub = mi;
}
int lb2 = 0, ub2 = n + 1;
while (ub2 - lb2 > 1) {
int mi = (lb2 + ub2) / 2;
char nlt = s[mi];
int pos = mi;
rep(i, q) {
if (pos == n + 1)
break;
if (nlt == qt[i]) {
if (qd[i] == 'L') {
pos--;
nlt = s[pos];
} else if (qd[i] == 'R') {
pos++;
nlt = s[pos];
}
}
}
if (pos == n + 1)
ub2 = mi;
else
lb2 = mi;
}
cout << ub2 - lb - 1 << endl;
} | [
"identifier.change",
"io.output.change"
] | 896,219 | 896,220 | u722628899 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<char, char>;
void leave(string message) {
cout << message << endl;
exit(0);
}
int main() {
lint n, q;
string s;
cin >> n >> q >> s;
vector<P> td(q);
for (int i = 0; i < q; i++)
cin >> td[i].first >> td[i].second;
// -1: NG_LEFT, 0: NG_RIGHT, 1: OK
auto simulate = [&](int idx) {
for (auto e : td) {
char t = e.first, d = e.second;
if (s[idx] == t) {
idx += (d == 'L' ? -1 : +1);
if (idx < 0)
return -1;
if (idx > n - 1)
return 0;
}
}
return 1;
};
if (simulate(0) == 0)
leave(0);
if (simulate(n - 1) == -1)
leave(0);
int ng, ok;
ng = -1, ok = n;
while (ok - ng > 1) {
int mid = (ok + ng) / 2;
(simulate(mid) == -1 ? ng : ok) = mid;
}
int left = ok;
if (simulate(left) == 0)
leave(0);
ng = n;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
(simulate(mid) == 1 ? ok : ng) = mid;
}
int right = ng;
cout << right - left << endl;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<char, char>;
void leave(string message) {
cout << message << endl;
exit(0);
}
int main() {
lint n, q;
string s;
cin >> n >> q >> s;
vector<P> td(q);
for (int i = 0; i < q; i++)
cin >> td[i].first >> td[i].second;
// -1: NG_LEFT, 0: NG_RIGHT, 1: OK
auto simulate = [&](int idx) {
for (auto e : td) {
char t = e.first, d = e.second;
if (s[idx] == t) {
idx += (d == 'L' ? -1 : +1);
if (idx < 0)
return -1;
if (idx > n - 1)
return 0;
}
}
return 1;
};
if (simulate(0) == 0)
leave("0");
if (simulate(n - 1) == -1)
leave("0");
int ng, ok;
ng = -1, ok = n;
while (ok - ng > 1) {
int mid = (ok + ng) / 2;
(simulate(mid) == -1 ? ng : ok) = mid;
}
int left = ok;
if (simulate(left) == 0)
leave("0");
ng = n;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
(simulate(mid) == 1 ? ok : ng) = mid;
}
int right = ng;
cout << right - left << endl;
} | [
"call.arguments.change"
] | 896,223 | 896,224 | u194268736 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int left = 0, right = N;
while (right - left > 1) {
int mid = (right + left) / 2, mid1 = mid;
for (int i = 0; i < Q; i++) {
if (t[i] == s[mid] && d[i] == 'L')
mid--;
if (t[i] == s[mid] && d[i] == 'R')
mid++;
if (mid == N || mid == -1)
break;
}
if (mid == -1)
left = mid1;
else
right = mid1;
}
int ans_left = left;
left = -1, right = N;
while (right - left > 1) {
int mid = (right + left) / 2, mid1 = mid;
for (int i = 0; i < Q; i++) {
if (t[i] == s[mid] && d[i] == 'L')
mid--;
if (t[i] == s[mid] && d[i] == 'R')
mid++;
if (mid == N || mid == -1)
break;
}
if (mid == N)
right = mid1;
else
left = mid1;
}
int ans_right = right;
cout << ans_right - ans_left - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int left = -1, right = N;
while (right - left > 1) {
int mid = (right + left) / 2, mid1 = mid;
for (int i = 0; i < Q; i++) {
if (t[i] == s[mid] && d[i] == 'L')
mid--;
if (t[i] == s[mid] && d[i] == 'R')
mid++;
if (mid == N || mid == -1)
break;
}
if (mid == -1)
left = mid1;
else
right = mid1;
}
int ans_left = left;
left = -1, right = N;
while (right - left > 1) {
int mid = (right + left) / 2, mid1 = mid;
for (int i = 0; i < Q; i++) {
if (t[i] == s[mid] && d[i] == 'L')
mid--;
if (t[i] == s[mid] && d[i] == 'R')
mid++;
if (mid == N || mid == -1)
break;
}
if (mid == N)
right = mid1;
else
left = mid1;
}
int ans_right = right;
cout << ans_right - ans_left - 1 << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 896,225 | 896,226 | u265359795 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int left = 0, right = N, ans = N;
while (right - left > 1) {
int mid = (right + left) / 2, mid1 = mid;
for (int i = 0; i < Q; i++) {
if (t[i] == s[mid] && d[i] == 'L')
mid--;
if (t[i] == s[mid] && d[i] == 'R')
mid++;
if (mid == N || mid == -1)
break;
}
if (mid == -1)
left = mid1;
else
right = mid1;
}
ans -= left + 1;
left = -1, right = N;
while (right - left > 1) {
int mid = (right + left) / 2, mid1 = mid;
for (int i = 0; i < Q; i++) {
if (t[i] == s[mid] && d[i] == 'L')
mid--;
if (t[i] == s[mid] && d[i] == 'R')
mid++;
if (mid == N || mid == -1)
break;
}
if (mid == N)
right = mid1;
else
left = mid1;
}
ans -= (N - right);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int left = -1, right = N, ans = N;
while (right - left > 1) {
int mid = (right + left) / 2, mid1 = mid;
for (int i = 0; i < Q; i++) {
if (t[i] == s[mid] && d[i] == 'L')
mid--;
if (t[i] == s[mid] && d[i] == 'R')
mid++;
if (mid == N || mid == -1)
break;
}
if (mid == -1)
left = mid1;
else
right = mid1;
}
ans -= left + 1;
left = -1, right = N;
while (right - left > 1) {
int mid = (right + left) / 2, mid1 = mid;
for (int i = 0; i < Q; i++) {
if (t[i] == s[mid] && d[i] == 'L')
mid--;
if (t[i] == s[mid] && d[i] == 'R')
mid++;
if (mid == N || mid == -1)
break;
}
if (mid == N)
right = mid1;
else
left = mid1;
}
ans -= (N - right);
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 896,227 | 896,228 | u265359795 | cpp |
p03081 | ///////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <typeinfo>
#include <unistd.h>
#include <unordered_map>
#include <vector>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 1
#define pb push_back
#define V vector
#define M unordered_map
#define rep(i, n) for (ll i = 0LL; i < n; ++i)
#define srep(i, s, n) for (ll i = s; i < n; ++i)
#define rrep(i, n) for (ll i = n - 1LL; i >= 0LL; --i)
#define ALL(a) (a).begin(), (a).end()
#define CIN(x) \
do { \
assert(!cin.eof()); \
cin >> x; \
assert(!cin.fail()); \
} while (0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#endif // DEBUG
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T>>;
template <typename S, typename T> T get_m(M<S, T> &m, S k, S default_value) {
if (m.find(k) == m.end())
return m[k] = default_value;
return m[k];
}
struct UnionFind {
ull *parent, *count, *rank;
UnionFind(ull n) {
parent = new ull[n + 1];
count = new ull[n + 1];
rank = new ull[n + 1];
for (ull i = 0ULL; i < n + 1; ++i) {
parent[i] = i;
count[i] = 1;
rank[i] = 0;
}
}
~UnionFind() {
delete rank;
delete count;
delete parent;
}
ull root(ull i) {
if (parent[i] == i)
return i;
parent[i] = root(parent[i]);
return parent[i];
}
void unite(ull i, ull j) {
ull rooti = root(i);
ull rootj = root(j);
if (rooti == rootj)
return;
if (rank[rootj] < rank[rooti]) {
parent[i] = parent[j] = parent[rootj] = rooti;
count[rooti] += count[rootj];
} else {
parent[i] = parent[j] = parent[rooti] = rootj;
count[rootj] += count[rooti];
if (rank[rootj] == rank[rooti])
rank[rootj]++;
}
}
bool same(ull i, ull j) { return root(i) == root(j); }
};
struct UnionFindM {
M<ull, ull> parent, count, rank;
ull root(ull i) {
ull parent_i = get_m(parent, i, i);
if (parent_i == i)
return i;
return parent[i] = root(parent_i);
}
void unite(ull i, ull j) {
ull rooti = root(i);
ull rootj = root(j);
if (rooti == rootj)
return;
if (get_m(rank, rootj, 0ULL) < get_m(rank, rooti, 0ULL)) {
parent[i] = parent[j] = parent[rootj] = rooti;
count[rooti] = get_m(count, rooti, 1ULL) + get_m(count, rootj, 1ULL);
} else {
parent[i] = parent[j] = parent[rooti] = rootj;
count[rootj] = get_m(count, rootj, 1ULL) + get_m(count, rooti, 1ULL);
if (get_m(rank, rootj, 0ULL) == get_m(rank, rooti, 0ULL))
rank[rootj]++;
}
}
bool same(ull i, ull j) { return root(i) == root(j); }
};
struct BIT {
ll *tree;
ll size;
BIT(ll n, ll init) {
tree = new ll[n + 1];
size = n;
memset(tree, 0, sizeof(ll) * (n + 1));
this->init(init);
}
void init(ll init) {
rep(i0, size) {
ll idx = i0 + 1LL;
while (idx <= size) {
tree[idx] += init;
idx += (idx & (-idx));
}
}
}
// idx is 1 origin
void add(ll idx, ll x) {
assert(idx > 0LL);
while (idx <= size) {
tree[idx] += x;
idx += (idx & (-idx));
}
}
// idx is 1 origin
ll sum(ll idx) {
assert(idx > 0LL);
ll ret = 0LL;
while (idx > 0LL) {
ret += tree[idx];
idx -= (idx & (-idx));
}
return ret;
}
};
struct MaxFlow {
V<ll> links[1005];
ll capacities[1005][1005];
ll nodes;
MaxFlow(ll nodes) {
// i == 0 --> S
// i == nodes+1 --> T
rep(i, nodes + 2LL) links[i].clear();
memset(capacities, 0, sizeof(capacities));
this->nodes = nodes;
}
void add_path(ll a, ll b, ll capacity) {
links[a].pb(b);
links[b].pb(a);
capacities[a][b] = capacity;
capacities[b][a] = 0LL;
}
ll solve(void) {
deque<V<ll>> q;
ll ret = 0LL;
for (;; q.clear()) {
V<ll> start;
start.pb(0);
q.push_front(start);
bool checked[nodes + 2];
memset(checked, 0, sizeof(checked));
V<ll> found;
for (; !(q.empty());) {
V<ll> path = q.front();
q.pop_front();
ll last = path[path.size() - 1];
if (checked[last])
continue;
if (last == nodes + 1) {
found = path;
break;
}
checked[last] = true;
for (auto next : (links[last])) {
if (capacities[last][next] == 0)
continue;
V<ll> newpath(path);
newpath.pb(next);
q.push_front(newpath);
}
}
if (found.size() == 0) {
break;
} else {
ll flowcount = capacities[found[0]][found[1]];
rep(i, found.size() - 1) {
ll src = found[i];
ll dst = found[i + 1];
flowcount = min(flowcount, capacities[src][dst]);
}
rep(i, found.size() - 1) {
ll src = found[i];
ll dst = found[i + 1];
capacities[src][dst] -= flowcount;
capacities[dst][src] += flowcount;
}
ret += flowcount;
}
}
return ret;
}
};
template <typename T> struct SegmentTree {
T *nodes;
t2 *ranges; // [start, end)
ll nodecount;
ll itemcount;
T unit;
T (*op)(T, T);
SegmentTree(ll itemcount, T unit, T op(T, T)) {
ll orig_itemcount = itemcount;
this->itemcount = 1LL;
while (this->itemcount < orig_itemcount)
this->itemcount *= 2LL;
nodecount = this->itemcount * 2 - 1;
nodes = new T[nodecount];
ranges = new t2[nodecount];
this->unit = unit;
this->op = op;
ll start = 0LL;
ll end = this->itemcount;
ll len = this->itemcount;
rep(i, nodecount) {
nodes[i] = unit;
ranges[i] = t2(start, end);
if (end >= this->itemcount) {
len /= 2LL;
start = 0LL;
end = len;
} else {
start = end;
end = start + len;
}
}
}
void update(ll k, T v) {
ll idx = k + itemcount - 1LL;
nodes[idx] = v;
idx = (idx - 1LL) / 2LL;
for (; idx >= 0; idx = (idx - 1LL) / 2LL) {
nodes[idx] = op(nodes[idx * 2LL + 1LL], nodes[idx * 2LL + 2LL]);
if (!idx)
break;
}
}
T query(ll start, ll end) const { return _query(start, end, 0LL); }
T _query(ll start, ll end, ll idx) const {
ll rstart = get<0>(ranges[idx]);
ll rend = get<1>(ranges[idx]);
if (start <= rstart && rend <= end) {
return nodes[idx];
}
if (rend <= start || end <= rstart) {
return unit;
}
T left = _query(start, end, idx * 2LL + 1LL);
T right = _query(start, end, idx * 2LL + 2LL);
return op(left, right);
}
};
void llin(ll &a) { CIN(a); }
void llinl1(auto &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a;
CIN(a);
v.push_back(a);
}
}
void llinl2(auto &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b;
CIN(a >> b);
v.push_back(t2(a, b));
}
}
void llinl3(auto &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b, c;
CIN(a >> b >> c);
v.push_back(t3(a, b, c));
}
}
void llinl4(auto &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b, c, d;
CIN(a >> b >> c >> d);
v.push_back(t4(a, b, c, d));
}
}
void llina(auto &v, ll count) { llinl1(v, count); }
template <typename T> T min(const V<T> v) {
T ret = v[0];
for (auto i : v)
ret = min(ret, i);
return ret;
}
template <typename T> T max(const V<T> v) {
T ret = v[0];
for (auto i : v)
ret = max(ret, i);
return ret;
}
ll absll(ll x) {
if (x < 0)
return -x;
return x;
}
ll mod_mlt(ll x, ll y, ll mod) {
ll ret = 0LL;
x %= mod;
while (y) {
if (y & 1LL) {
ret += x;
ret %= mod;
}
y >>= 1;
x <<= 1;
x %= mod;
}
return ret;
}
// O(log(exp))
ll mod_pow(ll base, ll exp, ll mod) {
ll ret = 1LL;
for (; exp;) {
if (exp & 1LL) {
ret *= base;
ret %= mod;
}
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
// O(log(mod))
ll mod_inv(ll x, ll mod) {
// available only when mod is prime
return mod_pow(x, mod - 2LL, mod);
}
ll gcm(ll x, ll y) {
while (y != 0) {
ll z = x % y;
x = y;
y = z;
}
return x;
}
template <typename T> void sort(V<T> &v) { sort(v.begin(), v.end()); }
template <typename T> void sort_reverse(V<T> &v) {
sort(v.begin(), v.end(), greater<T>());
}
void get_divisors(V<ll> &retlist, ll x) {
for (ll i = 1LL; i < sqrt(x) + 3LL; ++i) {
if (x % i == 0LL) {
retlist.push_back(i);
retlist.push_back(x / i);
}
}
}
void get_factors(V<ll> &retlist, ll x) {
for (ll i = 2LL; i < (ll)(sqrt(x)) + 3LL; ++i) {
while (x % i == 0LL) {
retlist.pb(i);
x /= i;
}
}
retlist.pb(x);
}
bool is_prime(ll x) {
V<ll> factors, factors2;
get_factors(factors, x);
for (auto factor : factors) {
if (factor > 1)
factors2.pb(factor);
}
return factors2.size() == 1 && x == factors2[0];
}
template <typename T>
void intersection(const set<T> &a, const set<T> &b, set<T> &result) {
set_intersection(ALL(a), ALL(b), inserter(result, result.end()));
}
ull combination(ll x, ll y) {
if (y > x / 2LL)
y = x - y;
ull ret = 1LL;
for (ll i = 0LL; i < y; ++i) {
ret *= x--;
ret /= (i + 1LL);
}
return ret;
}
ull mod_combination(ll x, ll y, ll mod) {
if (y > x / 2LL)
y = x - y;
ll ret = 1;
for (ll i = 0LL; i < y; ++i) {
ret = (ret * x--) % mod;
ret = (ret * mod_inv(i + 1LL, mod)) % mod;
}
return ret;
}
void make_linklist(const V<t2> &srclist, V<ll> dstlist[]) {
for (auto src : srclist) {
ll a = get<0>(src);
ll b = get<1>(src);
dstlist[a].pb(b);
dstlist[b].pb(a);
}
}
void make_parental_relation(const V<ll> linklist[], ll root, ll n, ll parent[],
V<ll> children[], ll level[]) {
queue<ll> q;
bool checked[n + 1];
memset(checked, 0, sizeof(checked));
q.push(root);
checked[root] = true;
parent[root] = root;
level[root] = 0LL;
for (; !(q.empty());) {
ll now = q.front();
q.pop();
for (auto next : linklist[now]) {
if (checked[next])
continue;
q.push(next);
checked[next] = true;
parent[next] = now;
children[now].pb(next);
level[next] = level[now] + 1LL;
}
}
}
void make_subtree_sizes(const ll child_count[], const ll parents[],
ll subtree_sizes[], ll n) {
ll remain_count[n + 1LL];
memcpy(remain_count, child_count, sizeof(remain_count));
queue<ll> q;
srep(node, 1LL, n + 1LL) {
subtree_sizes[node] = 1LL;
if (remain_count[node] > 0)
continue;
q.push(node);
}
while (!q.empty()) {
ll node = q.front();
q.pop();
ll parent = parents[node];
if (node == parent)
continue;
remain_count[parent]--;
subtree_sizes[parent] += subtree_sizes[node];
if (remain_count[parent] == 0LL)
q.push(parent);
}
}
void get_centroids(const V<ll> children[], const ll subtree_sizes[], ll root,
ll n, V<ll> ¢roids) {
queue<ll> q;
q.push(root);
while (!q.empty()) {
ll now = q.front();
q.pop();
bool is_centroid = true;
for (auto child : children[now]) {
q.push(child);
if (subtree_sizes[child] > n / 2LL)
is_centroid = false;
}
if (n - subtree_sizes[now] > n / 2LL)
is_centroid = false;
if (is_centroid)
centroids.pb(now);
}
assert(centroids.size() == 1LL || centroids.size() == 2LL);
}
#define POW_ANCESTOR_MAXSIZE 20
// preprocess for get_common_ancestor()
void make_pow_ancestor(const ll parent[], ll n,
ll (*pow_ancestor)[POW_ANCESTOR_MAXSIZE]) {
rep(i, n) pow_ancestor[i + 1][0] = parent[i + 1];
for (int pow2 = 1; pow(2, pow2) <= n; ++pow2) {
rep(i0, n) {
int i = i0 + 1;
ll prev = pow_ancestor[i][pow2 - 1];
pow_ancestor[i][pow2] = pow_ancestor[prev][pow2 - 1];
}
}
}
ll get_common_ancestor(ll n, ll x, ll y,
const ll (*pow_ancestor)[POW_ANCESTOR_MAXSIZE],
const ll level[]) {
if (level[x] < level[y]) {
ll diff = level[y] - level[x];
for (; diff;) {
ll bit = diff & -diff;
y = pow_ancestor[y][(int)log2(bit)];
diff -= bit;
}
} else {
ll diff = level[x] - level[y];
for (; diff;) {
ll bit = diff & -diff;
x = pow_ancestor[x][(int)log2(bit)];
diff -= bit;
}
}
if (x == y)
return x;
rrep(i, (int)log2(n) + 1) {
if (pow_ancestor[x][i] != pow_ancestor[y][i]) {
x = pow_ancestor[x][i];
y = pow_ancestor[y][i];
}
}
return pow_ancestor[x][0];
}
void kmp_init(const string &pattern, ll kmp_next[]) {
kmp_next[0] = -1LL;
ll plen = pattern.size();
ll prefix_end = -1;
rep(suffix_end, pattern.size()) {
while (prefix_end >= 0 && pattern[suffix_end] != pattern[prefix_end]) {
prefix_end = kmp_next[prefix_end];
}
kmp_next[suffix_end + 1] = ++prefix_end;
}
kmp_next[0] = 0LL;
}
// founds ... list of text's idx of match position. start position idx.
void kmp_search(const string &text, const string &pattern, const ll kmp_next[],
V<ll> &founds) {
ll text_size = text.size();
ll pattern_size = pattern.size();
ll text_start = 0LL;
ll pattern_idx = 0LL;
assert(pattern_size <= text_size);
for (;;) {
if (text_start + pattern_idx >= text_size)
break;
if (pattern_idx >= pattern_size)
break;
if (text[text_start + pattern_idx] == pattern[pattern_idx]) {
pattern_idx++;
if (pattern_idx == pattern_size) {
founds.pb(text_start);
pattern_idx = kmp_next[pattern_idx];
text_start += (pattern_size - pattern_idx);
}
}
else {
text_start += (pattern_idx - kmp_next[pattern_idx]);
pattern_idx = kmp_next[pattern_idx];
if (pattern_idx == 0LL && text[text_start] != pattern[0]) {
text_start++;
}
}
}
}
void _debug_print(auto x) { cout << x << endl; }
void _debug_print(const t2 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
cout << "-- " << x1 << " -- " << x2 << endl;
}
void _debug_print(const t3 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}
void _debug_print(const t4 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
ll x4 = get<3>(x);
cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << " -- " << x4 << endl;
}
template <typename T> void _debug_print(T xarray[], ll n) {
rep(i, n) _debug_print(xarray[i]);
}
template <typename T> void _debug_print(const V<T> &xlist) {
for (auto x : xlist) {
cout << "-- ";
_debug_print(x);
}
}
template <typename T> void _debug_print(const set<T> &xset) {
for (auto x : xset) {
cout << "-- ";
_debug_print(x);
}
}
template <typename S, typename T> void _debug_print(const M<S, T> &xlist) {
for (auto x : xlist) {
S k = x.first;
T v = x.second;
cout << "====" << endl;
cout << "K=";
_debug_print(k);
cout << "V=";
_debug_print(v);
}
}
int _main();
int main() {
cout << setprecision(12);
return _main();
}
///////////////////////////////////////////////////////////////////////////////
typedef tuple<char, char> tcc;
ll solve_left_drop(const string &s, const V<tcc> &tdlist, ll n) {
ll left = 0LL;
ll right = n - 1LL;
ll start = (left + right) / 2LL;
ll ret = -1LL;
for (; left <= right; start = (left + right) / 2LL) {
ll now = start;
for (auto td : tdlist) {
char t = get<0>(td);
char d = get<1>(td);
if (s[now] == t) {
if (d == 'L')
now--;
if (d == 'R')
now++;
}
if (now < 0LL || n <= now)
break;
}
if (now < 0LL) {
ret = max(ret, start);
left = start + 1LL;
} else {
right = start - 1LL;
}
}
return ret + 1LL;
}
ll solve_right_drop(const string &s, const V<tcc> &tdlist, ll n) {
ll left = 0LL;
ll right = n - 1LL;
ll start = (left + right) / 2LL;
ll ret = n;
for (; left <= right; start = (left + right) / 2LL) {
ll now = start;
debug_printf("------ start=%lld\n", start);
for (auto td : tdlist) {
char t = get<0>(td);
char d = get<1>(td);
debug_printf("-- now %lld ", now);
if (s[now] == t) {
if (d == 'L')
now--;
if (d == 'R')
now++;
}
debug_printf("-> %lld\n", now);
if (now < 0LL || n <= now)
break;
}
debug_printf("!! now = %lld %lld\n", now, n);
if (now >= n) {
debug_printf("!! update\n");
ret = min(ret, start);
right = start - 1LL;
} else {
left = start + 1LL;
}
}
return n - ret;
}
int _main() {
ll n;
llin(n);
ll q;
llin(q);
string s;
CIN(s);
V<tcc> tdlist;
rep(i, q) {
char t, d;
CIN(t);
CIN(d);
tdlist.pb(tcc(t, d));
}
ll left_drop = solve_left_drop(s, tdlist, n);
debug_printf("---- left_drop=%lld\n", left_drop);
ll right_drop = solve_right_drop(s, tdlist, n);
debug_printf("---- right_drop=%lld\n", right_drop);
cout << n - left_drop - right_drop << endl;
return 0;
}
///////////////////////////////////////////////////////////////////////////////
| ///////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <typeinfo>
#include <unistd.h>
#include <unordered_map>
#include <vector>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V vector
#define M unordered_map
#define rep(i, n) for (ll i = 0LL; i < n; ++i)
#define srep(i, s, n) for (ll i = s; i < n; ++i)
#define rrep(i, n) for (ll i = n - 1LL; i >= 0LL; --i)
#define ALL(a) (a).begin(), (a).end()
#define CIN(x) \
do { \
assert(!cin.eof()); \
cin >> x; \
assert(!cin.fail()); \
} while (0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#endif // DEBUG
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T>>;
template <typename S, typename T> T get_m(M<S, T> &m, S k, S default_value) {
if (m.find(k) == m.end())
return m[k] = default_value;
return m[k];
}
struct UnionFind {
ull *parent, *count, *rank;
UnionFind(ull n) {
parent = new ull[n + 1];
count = new ull[n + 1];
rank = new ull[n + 1];
for (ull i = 0ULL; i < n + 1; ++i) {
parent[i] = i;
count[i] = 1;
rank[i] = 0;
}
}
~UnionFind() {
delete rank;
delete count;
delete parent;
}
ull root(ull i) {
if (parent[i] == i)
return i;
parent[i] = root(parent[i]);
return parent[i];
}
void unite(ull i, ull j) {
ull rooti = root(i);
ull rootj = root(j);
if (rooti == rootj)
return;
if (rank[rootj] < rank[rooti]) {
parent[i] = parent[j] = parent[rootj] = rooti;
count[rooti] += count[rootj];
} else {
parent[i] = parent[j] = parent[rooti] = rootj;
count[rootj] += count[rooti];
if (rank[rootj] == rank[rooti])
rank[rootj]++;
}
}
bool same(ull i, ull j) { return root(i) == root(j); }
};
struct UnionFindM {
M<ull, ull> parent, count, rank;
ull root(ull i) {
ull parent_i = get_m(parent, i, i);
if (parent_i == i)
return i;
return parent[i] = root(parent_i);
}
void unite(ull i, ull j) {
ull rooti = root(i);
ull rootj = root(j);
if (rooti == rootj)
return;
if (get_m(rank, rootj, 0ULL) < get_m(rank, rooti, 0ULL)) {
parent[i] = parent[j] = parent[rootj] = rooti;
count[rooti] = get_m(count, rooti, 1ULL) + get_m(count, rootj, 1ULL);
} else {
parent[i] = parent[j] = parent[rooti] = rootj;
count[rootj] = get_m(count, rootj, 1ULL) + get_m(count, rooti, 1ULL);
if (get_m(rank, rootj, 0ULL) == get_m(rank, rooti, 0ULL))
rank[rootj]++;
}
}
bool same(ull i, ull j) { return root(i) == root(j); }
};
struct BIT {
ll *tree;
ll size;
BIT(ll n, ll init) {
tree = new ll[n + 1];
size = n;
memset(tree, 0, sizeof(ll) * (n + 1));
this->init(init);
}
void init(ll init) {
rep(i0, size) {
ll idx = i0 + 1LL;
while (idx <= size) {
tree[idx] += init;
idx += (idx & (-idx));
}
}
}
// idx is 1 origin
void add(ll idx, ll x) {
assert(idx > 0LL);
while (idx <= size) {
tree[idx] += x;
idx += (idx & (-idx));
}
}
// idx is 1 origin
ll sum(ll idx) {
assert(idx > 0LL);
ll ret = 0LL;
while (idx > 0LL) {
ret += tree[idx];
idx -= (idx & (-idx));
}
return ret;
}
};
struct MaxFlow {
V<ll> links[1005];
ll capacities[1005][1005];
ll nodes;
MaxFlow(ll nodes) {
// i == 0 --> S
// i == nodes+1 --> T
rep(i, nodes + 2LL) links[i].clear();
memset(capacities, 0, sizeof(capacities));
this->nodes = nodes;
}
void add_path(ll a, ll b, ll capacity) {
links[a].pb(b);
links[b].pb(a);
capacities[a][b] = capacity;
capacities[b][a] = 0LL;
}
ll solve(void) {
deque<V<ll>> q;
ll ret = 0LL;
for (;; q.clear()) {
V<ll> start;
start.pb(0);
q.push_front(start);
bool checked[nodes + 2];
memset(checked, 0, sizeof(checked));
V<ll> found;
for (; !(q.empty());) {
V<ll> path = q.front();
q.pop_front();
ll last = path[path.size() - 1];
if (checked[last])
continue;
if (last == nodes + 1) {
found = path;
break;
}
checked[last] = true;
for (auto next : (links[last])) {
if (capacities[last][next] == 0)
continue;
V<ll> newpath(path);
newpath.pb(next);
q.push_front(newpath);
}
}
if (found.size() == 0) {
break;
} else {
ll flowcount = capacities[found[0]][found[1]];
rep(i, found.size() - 1) {
ll src = found[i];
ll dst = found[i + 1];
flowcount = min(flowcount, capacities[src][dst]);
}
rep(i, found.size() - 1) {
ll src = found[i];
ll dst = found[i + 1];
capacities[src][dst] -= flowcount;
capacities[dst][src] += flowcount;
}
ret += flowcount;
}
}
return ret;
}
};
template <typename T> struct SegmentTree {
T *nodes;
t2 *ranges; // [start, end)
ll nodecount;
ll itemcount;
T unit;
T (*op)(T, T);
SegmentTree(ll itemcount, T unit, T op(T, T)) {
ll orig_itemcount = itemcount;
this->itemcount = 1LL;
while (this->itemcount < orig_itemcount)
this->itemcount *= 2LL;
nodecount = this->itemcount * 2 - 1;
nodes = new T[nodecount];
ranges = new t2[nodecount];
this->unit = unit;
this->op = op;
ll start = 0LL;
ll end = this->itemcount;
ll len = this->itemcount;
rep(i, nodecount) {
nodes[i] = unit;
ranges[i] = t2(start, end);
if (end >= this->itemcount) {
len /= 2LL;
start = 0LL;
end = len;
} else {
start = end;
end = start + len;
}
}
}
void update(ll k, T v) {
ll idx = k + itemcount - 1LL;
nodes[idx] = v;
idx = (idx - 1LL) / 2LL;
for (; idx >= 0; idx = (idx - 1LL) / 2LL) {
nodes[idx] = op(nodes[idx * 2LL + 1LL], nodes[idx * 2LL + 2LL]);
if (!idx)
break;
}
}
T query(ll start, ll end) const { return _query(start, end, 0LL); }
T _query(ll start, ll end, ll idx) const {
ll rstart = get<0>(ranges[idx]);
ll rend = get<1>(ranges[idx]);
if (start <= rstart && rend <= end) {
return nodes[idx];
}
if (rend <= start || end <= rstart) {
return unit;
}
T left = _query(start, end, idx * 2LL + 1LL);
T right = _query(start, end, idx * 2LL + 2LL);
return op(left, right);
}
};
void llin(ll &a) { CIN(a); }
void llinl1(auto &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a;
CIN(a);
v.push_back(a);
}
}
void llinl2(auto &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b;
CIN(a >> b);
v.push_back(t2(a, b));
}
}
void llinl3(auto &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b, c;
CIN(a >> b >> c);
v.push_back(t3(a, b, c));
}
}
void llinl4(auto &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b, c, d;
CIN(a >> b >> c >> d);
v.push_back(t4(a, b, c, d));
}
}
void llina(auto &v, ll count) { llinl1(v, count); }
template <typename T> T min(const V<T> v) {
T ret = v[0];
for (auto i : v)
ret = min(ret, i);
return ret;
}
template <typename T> T max(const V<T> v) {
T ret = v[0];
for (auto i : v)
ret = max(ret, i);
return ret;
}
ll absll(ll x) {
if (x < 0)
return -x;
return x;
}
ll mod_mlt(ll x, ll y, ll mod) {
ll ret = 0LL;
x %= mod;
while (y) {
if (y & 1LL) {
ret += x;
ret %= mod;
}
y >>= 1;
x <<= 1;
x %= mod;
}
return ret;
}
// O(log(exp))
ll mod_pow(ll base, ll exp, ll mod) {
ll ret = 1LL;
for (; exp;) {
if (exp & 1LL) {
ret *= base;
ret %= mod;
}
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
// O(log(mod))
ll mod_inv(ll x, ll mod) {
// available only when mod is prime
return mod_pow(x, mod - 2LL, mod);
}
ll gcm(ll x, ll y) {
while (y != 0) {
ll z = x % y;
x = y;
y = z;
}
return x;
}
template <typename T> void sort(V<T> &v) { sort(v.begin(), v.end()); }
template <typename T> void sort_reverse(V<T> &v) {
sort(v.begin(), v.end(), greater<T>());
}
void get_divisors(V<ll> &retlist, ll x) {
for (ll i = 1LL; i < sqrt(x) + 3LL; ++i) {
if (x % i == 0LL) {
retlist.push_back(i);
retlist.push_back(x / i);
}
}
}
void get_factors(V<ll> &retlist, ll x) {
for (ll i = 2LL; i < (ll)(sqrt(x)) + 3LL; ++i) {
while (x % i == 0LL) {
retlist.pb(i);
x /= i;
}
}
retlist.pb(x);
}
bool is_prime(ll x) {
V<ll> factors, factors2;
get_factors(factors, x);
for (auto factor : factors) {
if (factor > 1)
factors2.pb(factor);
}
return factors2.size() == 1 && x == factors2[0];
}
template <typename T>
void intersection(const set<T> &a, const set<T> &b, set<T> &result) {
set_intersection(ALL(a), ALL(b), inserter(result, result.end()));
}
ull combination(ll x, ll y) {
if (y > x / 2LL)
y = x - y;
ull ret = 1LL;
for (ll i = 0LL; i < y; ++i) {
ret *= x--;
ret /= (i + 1LL);
}
return ret;
}
ull mod_combination(ll x, ll y, ll mod) {
if (y > x / 2LL)
y = x - y;
ll ret = 1;
for (ll i = 0LL; i < y; ++i) {
ret = (ret * x--) % mod;
ret = (ret * mod_inv(i + 1LL, mod)) % mod;
}
return ret;
}
void make_linklist(const V<t2> &srclist, V<ll> dstlist[]) {
for (auto src : srclist) {
ll a = get<0>(src);
ll b = get<1>(src);
dstlist[a].pb(b);
dstlist[b].pb(a);
}
}
void make_parental_relation(const V<ll> linklist[], ll root, ll n, ll parent[],
V<ll> children[], ll level[]) {
queue<ll> q;
bool checked[n + 1];
memset(checked, 0, sizeof(checked));
q.push(root);
checked[root] = true;
parent[root] = root;
level[root] = 0LL;
for (; !(q.empty());) {
ll now = q.front();
q.pop();
for (auto next : linklist[now]) {
if (checked[next])
continue;
q.push(next);
checked[next] = true;
parent[next] = now;
children[now].pb(next);
level[next] = level[now] + 1LL;
}
}
}
void make_subtree_sizes(const ll child_count[], const ll parents[],
ll subtree_sizes[], ll n) {
ll remain_count[n + 1LL];
memcpy(remain_count, child_count, sizeof(remain_count));
queue<ll> q;
srep(node, 1LL, n + 1LL) {
subtree_sizes[node] = 1LL;
if (remain_count[node] > 0)
continue;
q.push(node);
}
while (!q.empty()) {
ll node = q.front();
q.pop();
ll parent = parents[node];
if (node == parent)
continue;
remain_count[parent]--;
subtree_sizes[parent] += subtree_sizes[node];
if (remain_count[parent] == 0LL)
q.push(parent);
}
}
void get_centroids(const V<ll> children[], const ll subtree_sizes[], ll root,
ll n, V<ll> ¢roids) {
queue<ll> q;
q.push(root);
while (!q.empty()) {
ll now = q.front();
q.pop();
bool is_centroid = true;
for (auto child : children[now]) {
q.push(child);
if (subtree_sizes[child] > n / 2LL)
is_centroid = false;
}
if (n - subtree_sizes[now] > n / 2LL)
is_centroid = false;
if (is_centroid)
centroids.pb(now);
}
assert(centroids.size() == 1LL || centroids.size() == 2LL);
}
#define POW_ANCESTOR_MAXSIZE 20
// preprocess for get_common_ancestor()
void make_pow_ancestor(const ll parent[], ll n,
ll (*pow_ancestor)[POW_ANCESTOR_MAXSIZE]) {
rep(i, n) pow_ancestor[i + 1][0] = parent[i + 1];
for (int pow2 = 1; pow(2, pow2) <= n; ++pow2) {
rep(i0, n) {
int i = i0 + 1;
ll prev = pow_ancestor[i][pow2 - 1];
pow_ancestor[i][pow2] = pow_ancestor[prev][pow2 - 1];
}
}
}
ll get_common_ancestor(ll n, ll x, ll y,
const ll (*pow_ancestor)[POW_ANCESTOR_MAXSIZE],
const ll level[]) {
if (level[x] < level[y]) {
ll diff = level[y] - level[x];
for (; diff;) {
ll bit = diff & -diff;
y = pow_ancestor[y][(int)log2(bit)];
diff -= bit;
}
} else {
ll diff = level[x] - level[y];
for (; diff;) {
ll bit = diff & -diff;
x = pow_ancestor[x][(int)log2(bit)];
diff -= bit;
}
}
if (x == y)
return x;
rrep(i, (int)log2(n) + 1) {
if (pow_ancestor[x][i] != pow_ancestor[y][i]) {
x = pow_ancestor[x][i];
y = pow_ancestor[y][i];
}
}
return pow_ancestor[x][0];
}
void kmp_init(const string &pattern, ll kmp_next[]) {
kmp_next[0] = -1LL;
ll plen = pattern.size();
ll prefix_end = -1;
rep(suffix_end, pattern.size()) {
while (prefix_end >= 0 && pattern[suffix_end] != pattern[prefix_end]) {
prefix_end = kmp_next[prefix_end];
}
kmp_next[suffix_end + 1] = ++prefix_end;
}
kmp_next[0] = 0LL;
}
// founds ... list of text's idx of match position. start position idx.
void kmp_search(const string &text, const string &pattern, const ll kmp_next[],
V<ll> &founds) {
ll text_size = text.size();
ll pattern_size = pattern.size();
ll text_start = 0LL;
ll pattern_idx = 0LL;
assert(pattern_size <= text_size);
for (;;) {
if (text_start + pattern_idx >= text_size)
break;
if (pattern_idx >= pattern_size)
break;
if (text[text_start + pattern_idx] == pattern[pattern_idx]) {
pattern_idx++;
if (pattern_idx == pattern_size) {
founds.pb(text_start);
pattern_idx = kmp_next[pattern_idx];
text_start += (pattern_size - pattern_idx);
}
}
else {
text_start += (pattern_idx - kmp_next[pattern_idx]);
pattern_idx = kmp_next[pattern_idx];
if (pattern_idx == 0LL && text[text_start] != pattern[0]) {
text_start++;
}
}
}
}
void _debug_print(auto x) { cout << x << endl; }
void _debug_print(const t2 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
cout << "-- " << x1 << " -- " << x2 << endl;
}
void _debug_print(const t3 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}
void _debug_print(const t4 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
ll x4 = get<3>(x);
cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << " -- " << x4 << endl;
}
template <typename T> void _debug_print(T xarray[], ll n) {
rep(i, n) _debug_print(xarray[i]);
}
template <typename T> void _debug_print(const V<T> &xlist) {
for (auto x : xlist) {
cout << "-- ";
_debug_print(x);
}
}
template <typename T> void _debug_print(const set<T> &xset) {
for (auto x : xset) {
cout << "-- ";
_debug_print(x);
}
}
template <typename S, typename T> void _debug_print(const M<S, T> &xlist) {
for (auto x : xlist) {
S k = x.first;
T v = x.second;
cout << "====" << endl;
cout << "K=";
_debug_print(k);
cout << "V=";
_debug_print(v);
}
}
int _main();
int main() {
cout << setprecision(12);
return _main();
}
///////////////////////////////////////////////////////////////////////////////
typedef tuple<char, char> tcc;
ll solve_left_drop(const string &s, const V<tcc> &tdlist, ll n) {
ll left = 0LL;
ll right = n - 1LL;
ll start = (left + right) / 2LL;
ll ret = -1LL;
for (; left <= right; start = (left + right) / 2LL) {
ll now = start;
for (auto td : tdlist) {
char t = get<0>(td);
char d = get<1>(td);
if (s[now] == t) {
if (d == 'L')
now--;
if (d == 'R')
now++;
}
if (now < 0LL || n <= now)
break;
}
if (now < 0LL) {
ret = max(ret, start);
left = start + 1LL;
} else {
right = start - 1LL;
}
}
return ret + 1LL;
}
ll solve_right_drop(const string &s, const V<tcc> &tdlist, ll n) {
ll left = 0LL;
ll right = n - 1LL;
ll start = (left + right) / 2LL;
ll ret = n;
for (; left <= right; start = (left + right) / 2LL) {
ll now = start;
debug_printf("------ start=%lld\n", start);
for (auto td : tdlist) {
char t = get<0>(td);
char d = get<1>(td);
debug_printf("-- now %lld ", now);
if (s[now] == t) {
if (d == 'L')
now--;
if (d == 'R')
now++;
}
debug_printf("-> %lld\n", now);
if (now < 0LL || n <= now)
break;
}
debug_printf("!! now = %lld %lld\n", now, n);
if (now >= n) {
debug_printf("!! update\n");
ret = min(ret, start);
right = start - 1LL;
} else {
left = start + 1LL;
}
}
return n - ret;
}
int _main() {
ll n;
llin(n);
ll q;
llin(q);
string s;
CIN(s);
V<tcc> tdlist;
rep(i, q) {
char t, d;
CIN(t);
CIN(d);
tdlist.pb(tcc(t, d));
}
ll left_drop = solve_left_drop(s, tdlist, n);
debug_printf("---- left_drop=%lld\n", left_drop);
ll right_drop = solve_right_drop(s, tdlist, n);
debug_printf("---- right_drop=%lld\n", right_drop);
cout << n - left_drop - right_drop << endl;
return 0;
}
///////////////////////////////////////////////////////////////////////////////
| [
"preprocessor.define.value.change",
"literal.integer.change"
] | 896,231 | 896,232 | u167931717 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long i64;
typedef pair<i64, i64> P;
int n;
string s;
int main() {
cin >> n;
cin >> s;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
cnt++;
}
if (cnt < n - cnt) {
cout << "No" << endl;
} else
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long i64;
typedef pair<i64, i64> P;
int n;
string s;
int main() {
cin >> n;
cin >> s;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
cnt++;
}
if (cnt <= n - cnt) {
cout << "No" << endl;
} else
cout << "Yes" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 896,239 | 896,240 | u414947284 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<char> cap(N);
for (int i = 0; i < N; i++) {
cin >> cap.at(i);
}
int red = 0, blue = 0;
for (int i = 0; i < N; i++) {
if (cap.at(i) == 'R') {
red += 1;
} else {
blue += 1;
}
}
if (red > blue) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<char> cap(N);
for (int i = 0; i < N; i++) {
cin >> cap.at(i);
}
int red = 0, blue = 0;
for (int i = 0; i < N; i++) {
if (cap.at(i) == 'R') {
red += 1;
} else {
blue += 1;
}
}
if (red > blue) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,241 | 896,242 | u552847961 | cpp |
p03080 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int R = 0;
int B = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'R') {
R++;
} else {
B++;
}
}
if (R > B) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <fstream>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int R = 0;
int B = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'R') {
R++;
} else {
B++;
}
}
if (R > B) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"variable_declaration.add"
] | 896,245 | 896,246 | u545206239 | cpp |
p03080 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> using vv = vector<V<T>>;
template <class T> using VV = vector<V<T>>;
#define fi first
#define se second
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (ll i = (ll)(b)-1; i >= a; --i)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define eb(val) emplace_back(val)
const double PI = acos(-1);
const double EPS = 1e-10;
const ll MOD = 1e9 + 7;
void cioacc() { // accelerate cin/cout
cin.tie(0);
ios::sync_with_stdio(false);
}
signed main() {
int n;
string s;
cin >> n >> s;
int r = 0, b = 0;
REP(i, n) {
if (s[0] == 'R')
++r;
else
++b;
}
cout << (r > b ? "Yes" : "No") << endl;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> using vv = vector<V<T>>;
template <class T> using VV = vector<V<T>>;
#define fi first
#define se second
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (ll i = (ll)(b)-1; i >= a; --i)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define eb(val) emplace_back(val)
const double PI = acos(-1);
const double EPS = 1e-10;
const ll MOD = 1e9 + 7;
void cioacc() { // accelerate cin/cout
cin.tie(0);
ios::sync_with_stdio(false);
}
signed main() {
int n;
string s;
cin >> n >> s;
int r = 0, b = 0;
REP(i, n) {
if (s[i] == 'R')
++r;
else
++b;
}
cout << (r > b ? "Yes" : "No") << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 896,247 | 896,248 | u949798495 | cpp |
p03080 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9
#define MOD 0
//#define int ll
using namespace std;
typedef vector<int> vi;
signed main() {
int n;
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
int r = 0, b = 0;
char a;
rep(i, n) {
cin >> a;
if (a = 'R')
r++;
else
b++;
}
if (r > b)
puts("Yes");
else
puts("No");
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9
#define MOD 0
//#define int ll
using namespace std;
typedef vector<int> vi;
signed main() {
int n;
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
int r = 0, b = 0;
char a;
rep(i, n) {
cin >> a;
if (a == 'R')
r++;
else
b++;
}
if (r > b)
puts("Yes");
else
puts("No");
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 896,252 | 896,253 | u244583418 | cpp |
p03080 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
int r = 0;
for (int i = 0; i < n; i++) {
if (getchar() == 'R') {
r++;
}
}
getchar();
if (r > (n - r)) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return (0);
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
int r = 0;
for (int i = 0; i <= n; i++) {
if (getchar() == 'R') {
r++;
}
}
if (r > (n - r)) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return (0);
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.remove"
] | 896,258 | 896,259 | u149751724 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.