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 |
|---|---|---|---|---|---|---|---|
p03080 | #include <stdio.h>
int main() {
char s[101], tmp;
int N, r = 0, b = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%c", &tmp);
if (tmp == 'R')
r++;
if (tmp == 'B')
b++;
}
if (r > b)
printf("Yes\n");
else
printf("No\n");
} | #include <stdio.h>
int main() {
char s[101], tmp;
int N, r = 0, b = 0;
scanf("%d\n", &N);
for (int i = 0; i < N; i++) {
scanf("%c", &tmp);
if (tmp == 'R')
r++;
if (tmp == 'B')
b++;
}
if (r > b)
printf("Yes\n");
else
printf("No\n");
} | [
"literal.string.change",
"call.arguments.change"
] | 896,262 | 896,263 | u686303803 | cpp |
p03080 | #include <stdio.h>
int main() {
char s[101], tmp;
int N, r = 0, b = 0;
scanf("%d", &N);
for (int i; i < N; i++) {
scanf("%c", &tmp);
if (tmp == 'R')
r++;
if (tmp == 'B')
b++;
}
if (r > b)
printf("Yes\n");
else
printf("No\n");
} | #include <stdio.h>
int main() {
char s[101], tmp;
int N, r = 0, b = 0;
scanf("%d\n", &N);
for (int i = 0; i < N; i++) {
scanf("%c", &tmp);
if (tmp == 'R')
r++;
if (tmp == 'B')
b++;
}
if (r > b)
printf("Yes\n");
else
printf("No\n");
} | [
"literal.string.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change"
] | 896,264 | 896,263 | u686303803 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int R, B, n;
R = 0;
B = 0;
cin >> n >> 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;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int R, B, n;
R = 0;
B = 0;
cin >> n >> 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;
} | [
"control_flow.branch.if.condition.change"
] | 896,274 | 896,275 | u057079894 | cpp |
p03080 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int Rcnt, Bcnt = 0;
for (int i = 0; i < N; i++) {
if (s[i] == 'R') {
Rcnt++;
} else {
Bcnt++;
}
}
if (Rcnt > Bcnt) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int Rcnt = 0;
int Bcnt = 0;
for (int i = 0; i < N; i++) {
if (s[i] == 'R') {
Rcnt++;
} else {
Bcnt++;
}
}
if (Rcnt > Bcnt) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"variable_declaration.add"
] | 896,280 | 896,281 | u654115954 | cpp |
p03080 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int r;
int flag = 0;
r = 0;
string s;
cin >> N >> s;
int i = 0;
while (i < N) {
if (s[i] == 'R')
r++;
i++;
if (r > (N / 2)) {
flag = 1;
}
}
if (flag == 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int r;
int flag = 0;
r = 0;
string s;
cin >> N >> s;
int i = 0;
while (i < N) {
if (s[i] == 'R')
r++;
i++;
if (r > (N / 2)) {
flag = 1;
}
}
if (flag == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,284 | 896,285 | u821732221 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> s(n);
for (int i = 0; i < n; i++)
cin >> s.at(i);
int red, blue;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'R')
red++;
else if (s.at(i) == 'B')
blue++;
}
if (red > blue)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> s(n);
for (int i = 0; i < n; i++)
cin >> s.at(i);
int red = 0;
int blue = 0;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'R')
red++;
else if (s.at(i) == 'B')
blue++;
}
if (red > blue)
cout << "Yes";
else
cout << "No";
} | [
"variable_declaration.add"
] | 896,299 | 896,300 | u775776331 | cpp |
p03080 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
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;
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll INF = 1LL << 60;
const int MAX = 510000;
const int MOD = 1000000007;
long long 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;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll n) : par(n, -1) {}
void init(ll n) { par.assign(n, -1); }
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G) {
const T INF = numeric_limits<T>::max();
using P = pair<T, int>;
int n = G.size();
vector<T> d(n, INF);
vector<int> b(n, -1);
priority_queue<P, vector<P>, greater<P>> q;
d[s] = 0;
q.emplace(d[s], s);
while (!q.empty()) {
P p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto &e : G[v]) {
int u = e.first;
T c = e.second;
if (d[u] > d[v] + c) {
d[u] = d[v] + c;
b[u] = v;
q.emplace(d[u], u);
}
}
}
return d;
}
int main() {
ll N;
cin >> N;
string s;
cin >> s;
ll countr = 0;
ll countb = 0;
rep(i, N) {
if (s[i] == 'R')
countr++;
else if (s[i] == 'B')
countb++;
if (countr > countb)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
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;
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll INF = 1LL << 60;
const int MAX = 510000;
const int MOD = 1000000007;
long long 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;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll n) : par(n, -1) {}
void init(ll n) { par.assign(n, -1); }
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G) {
const T INF = numeric_limits<T>::max();
using P = pair<T, int>;
int n = G.size();
vector<T> d(n, INF);
vector<int> b(n, -1);
priority_queue<P, vector<P>, greater<P>> q;
d[s] = 0;
q.emplace(d[s], s);
while (!q.empty()) {
P p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto &e : G[v]) {
int u = e.first;
T c = e.second;
if (d[u] > d[v] + c) {
d[u] = d[v] + c;
b[u] = v;
q.emplace(d[u], u);
}
}
}
return d;
}
int main() {
ll N;
cin >> N;
string s;
cin >> s;
ll countr = 0;
ll countb = 0;
rep(i, N) {
if (s[i] == 'R')
countr++;
else if (s[i] == 'B')
countb++;
}
if (countr > countb)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [] | 896,301 | 896,302 | u135572611 | cpp |
p03080 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
string y = "Yes";
string n = "No";
int ct = 0;
for (auto ch : s) {
if (ch == 'R')
ct++;
}
string ret = n;
if (ct > s.size() - ct)
ret = y;
cout << ret << endl;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s >> s;
string y = "Yes";
string n = "No";
int ct = 0;
for (auto ch : s) {
if (ch == 'R')
ct++;
}
string ret = n;
if (ct > s.size() - ct)
ret = y;
cout << ret << endl;
}
| [
"expression.operation.binary.add"
] | 896,303 | 896,304 | u299843956 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, b, i, n;
char c;
scanf("%d", &n);
getchar();
for (i = 0; i < n; i++) {
c = getchar();
if (c == 'R')
r++;
else
b++;
}
if (r > b)
printf("Yes");
else
printf("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r = 0, b = 0, i, n;
char c;
scanf("%d", &n);
getchar();
for (i = 0; i < n; i++) {
c = getchar();
if (c == 'R')
r++;
else
b++;
}
if (r > b)
printf("Yes");
else
printf("No");
return 0;
} | [
"variable_declaration.value.change"
] | 896,307 | 896,308 | u379393519 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> 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";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int R = 0;
int B = 0;
for (int i = 0; i < N; i++) {
if (S[i] - 'R' == 0) {
R++;
} else {
B++;
}
}
if (R > B) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 896,309 | 896,310 | u590088474 | cpp |
p03078 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, limit) for (int i = 0; i < limit; ++i)
#define FOR(i, j, limit) for (int i = j; i < limit; ++i)
#define DUMP(a) \
REP(d, a.size()) { \
cout << a[d]; \
if (d != a.size() - 1) \
cout << " "; \
else \
cout << endl; \
}
#define ECHO(x) cout << x << endl;
#define LL long long
int INF = 2147483647;
LL LINF = 9223372036854775807;
LL MOD = 1000000007;
typedef pair<int, int> P;
typedef pair<LL, LL> PL;
typedef vector<int> vi;
typedef vector<LL> vl;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
LL a[x], b[y], c[z];
REP(i, x) cin >> a[i];
sort(a, a + x, greater<LL>());
REP(i, y) cin >> b[i];
sort(b, b + y, greater<LL>());
REP(i, z) cin >> c[i];
sort(c, c + z, greater<LL>());
vector<LL> ans;
vector<LL> combo;
REP(i, x) {
REP(j, y) { combo.push_back(a[i] + b[j]); }
}
sort(combo.begin(), combo.end(), greater<LL>());
int s = combo.size();
s = min(s, k);
REP(i, s) {
REP(j, z) { ans.push_back(combo[i] + c[j]); }
}
DUMP(ans);
sort(ans.begin(), ans.end(), greater<LL>());
REP(i, k) cout << ans[i] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, limit) for (int i = 0; i < limit; ++i)
#define FOR(i, j, limit) for (int i = j; i < limit; ++i)
#define DUMP(a) \
REP(d, a.size()) { \
cout << a[d]; \
if (d != a.size() - 1) \
cout << " "; \
else \
cout << endl; \
}
#define ECHO(x) cout << x << endl;
#define LL long long
int INF = 2147483647;
LL LINF = 9223372036854775807;
LL MOD = 1000000007;
typedef pair<int, int> P;
typedef pair<LL, LL> PL;
typedef vector<int> vi;
typedef vector<LL> vl;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
LL a[x], b[y], c[z];
REP(i, x) cin >> a[i];
sort(a, a + x, greater<LL>());
REP(i, y) cin >> b[i];
sort(b, b + y, greater<LL>());
REP(i, z) cin >> c[i];
sort(c, c + z, greater<LL>());
vector<LL> ans;
vector<LL> combo;
REP(i, x) {
REP(j, y) { combo.push_back(a[i] + b[j]); }
}
sort(combo.begin(), combo.end(), greater<LL>());
int s = combo.size();
s = min(s, k);
REP(i, s) {
REP(j, z) { ans.push_back(combo[i] + c[j]); }
}
sort(ans.begin(), ans.end(), greater<LL>());
REP(i, k) cout << ans[i] << endl;
return 0;
}
| [
"call.remove"
] | 896,349 | 896,350 | u111742294 | cpp |
p03078 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
int X, Y, Z, K;
ll A[1000], B[1000], C[1000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> X >> Y >> Z >> K;
rep(i, 0, X) cin >> A[i];
rep(i, 0, Y) cin >> B[i];
rep(i, 0, Z) cin >> C[i];
sort(A, A + X);
sort(B, B + Y);
sort(C, C + Z);
ll ok = 0, ng = 4e10;
while (ng - ok > 1) {
ll mid = (ok + ng) / 2;
ll res = 0;
rep(i, 0, X) {
rep(j, 0, Y) { res += C + Z - lower_bound(C, C + Z, mid - A[i] - B[j]); }
}
if (res >= K)
ok = mid;
else
ng = mid;
}
vector<ll> v;
int cnt = 0;
bool t = true;
rep(i, 0, X) {
rep(j, 0, Y) {
rep(k, lower_bound(C, C + Z, ok - A[i] - B[j]) - C, Z) {
v.pb(A[i] + B[j] + C[k]);
if (A[X - 1] + B[Y - 1] + C[Z - 1] != A[i] + B[j] + C[k])
t = false;
;
cnt++;
if (t && cnt >= K) {
sor(v);
rer(i, K, 0) { cout << v[i] << "\n"; }
return 0;
}
}
}
}
sor(v);
rev(v);
rer(i, K, 0) { cout << v[i] << "\n"; }
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
int X, Y, Z, K;
ll A[1000], B[1000], C[1000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> X >> Y >> Z >> K;
rep(i, 0, X) cin >> A[i];
rep(i, 0, Y) cin >> B[i];
rep(i, 0, Z) cin >> C[i];
sort(A, A + X);
sort(B, B + Y);
sort(C, C + Z);
ll ok = 0, ng = 4e10;
while (ng - ok > 1) {
ll mid = (ok + ng) / 2;
ll res = 0;
rep(i, 0, X) {
rep(j, 0, Y) { res += C + Z - lower_bound(C, C + Z, mid - A[i] - B[j]); }
}
if (res >= K)
ok = mid;
else
ng = mid;
}
vector<ll> v;
int cnt = 0;
bool t = true;
rep(i, 0, X) {
rep(j, 0, Y) {
rep(k, lower_bound(C, C + Z, ok - A[i] - B[j]) - C, Z) {
v.pb(A[i] + B[j] + C[k]);
if (A[X - 1] + B[Y - 1] + C[Z - 1] != A[i] + B[j] + C[k])
t = false;
cnt++;
if (t && cnt >= K) {
sor(v);
rer(i, K, 0) { cout << v[i] << "\n"; }
return 0;
}
}
}
}
sor(v);
rev(v);
rep(i, 0, K) { cout << v[i] << "\n"; }
} | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 896,357 | 896,358 | u235155157 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(a) begin(a), end(a)
int main(void) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
REP(i, X) cin >> A[i];
REP(i, Y) cin >> B[i];
REP(i, Z) cin >> C[i];
sort(ALL(A), greater<ll>());
sort(ALL(B), greater<ll>());
sort(ALL(C), greater<ll>());
vector<ll> temp;
REP(i, X) {
REP(j, Y) { temp.pb(A[i] + B[j]); }
}
sort(ALL(temp), greater<ll>());
vector<ll> ans;
REP(i, min(K, X)) {
REP(j, Z) { ans.pb(temp[i] + C[j]); }
}
sort(ALL(ans), greater<ll>());
REP(i, K) { cout << ans[i] << endl; }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(a) begin(a), end(a)
int main(void) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
REP(i, X) cin >> A[i];
REP(i, Y) cin >> B[i];
REP(i, Z) cin >> C[i];
sort(ALL(A), greater<ll>());
sort(ALL(B), greater<ll>());
sort(ALL(C), greater<ll>());
vector<ll> temp;
REP(i, X) {
REP(j, Y) { temp.pb(A[i] + B[j]); }
}
sort(ALL(temp), greater<ll>());
vector<ll> ans;
REP(i, min(K, X * Y)) {
REP(j, Z) { ans.pb(temp[i] + C[j]); }
}
sort(ALL(ans), greater<ll>());
REP(i, K) { cout << ans[i] << endl; }
return 0;
} | [] | 896,359 | 896,360 | u511344501 | cpp |
p03078 | #include <bits/stdc++.h>
#define int long long
using namespace std;
priority_queue<pair<int, pair<int, int>>> q, q1;
const int maxn = 1e3 + 10;
int x, y, z, k, a[maxn], b[maxn], c[maxn], d[maxn * 3], ans[maxn * 3];
inline bool cmp(int x, int y) { return x > y; }
signed main() {
scanf("%lld%lld%lld%lld", &x, &y, &z, &k);
for (register int i = 1; i <= x; i++)
scanf("%lld", &a[i]);
sort(a + 1, a + x + 1, cmp);
for (register int i = 1; i <= y; i++)
scanf("%lld", &b[i]);
sort(b + 1, b + y + 1, cmp);
for (register int i = 1; i <= z; i++)
scanf("%lld", &c[i]);
sort(c + 1, c + z + 1, cmp);
q.push(make_pair(a[1] + b[1], make_pair(1, 1)));
int len = min(k, x * y);
for (register int cas = 1; cas <= len; cas++) {
int i = q.top().second.first, j = q.top().second.second;
d[cas] = q.top().first;
q.pop();
if (j < y)
q.push(make_pair(a[i] + b[j + 1], make_pair(i, j + 1)));
if (j == 1 && i < x)
q.push(make_pair(a[i + 1] + b[j], make_pair(i + 1, j)));
}
q1.push(make_pair(c[1] + d[1], make_pair(1, 1)));
for (register int cas = 1; cas <= k; cas++) {
int i = q1.top().second.first, j = q.top().second.second;
ans[cas] = q1.top().first;
q1.pop();
if (j < len)
q1.push(make_pair(c[i] + d[j + 1], make_pair(i, j + 1)));
if (j == 1 && i < z)
q1.push(make_pair(c[i + 1] + d[j], make_pair(i + 1, j)));
}
for (register int i = 1; i <= k; i++)
printf("%lld\n", ans[i]);
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
priority_queue<pair<int, pair<int, int>>> q, q1;
const int maxn = 1e3 + 10;
int x, y, z, k, a[maxn], b[maxn], c[maxn], d[maxn * 3], ans[maxn * 3];
inline bool cmp(int x, int y) { return x > y; }
signed main() {
scanf("%lld%lld%lld%lld", &x, &y, &z, &k);
for (register int i = 1; i <= x; i++)
scanf("%lld", &a[i]);
sort(a + 1, a + x + 1, cmp);
for (register int i = 1; i <= y; i++)
scanf("%lld", &b[i]);
sort(b + 1, b + y + 1, cmp);
for (register int i = 1; i <= z; i++)
scanf("%lld", &c[i]);
sort(c + 1, c + z + 1, cmp);
q.push(make_pair(a[1] + b[1], make_pair(1, 1)));
int len = min(k, x * y);
for (register int cas = 1; cas <= len; cas++) {
int i = q.top().second.first, j = q.top().second.second;
d[cas] = q.top().first;
q.pop();
if (j < y)
q.push(make_pair(a[i] + b[j + 1], make_pair(i, j + 1)));
if (j == 1 && i < x)
q.push(make_pair(a[i + 1] + b[j], make_pair(i + 1, j)));
}
q1.push(make_pair(c[1] + d[1], make_pair(1, 1)));
for (register int cas = 1; cas <= k; cas++) {
int i = q1.top().second.first, j = q1.top().second.second;
ans[cas] = q1.top().first;
q1.pop();
if (j < len)
q1.push(make_pair(c[i] + d[j + 1], make_pair(i, j + 1)));
if (j == 1 && i < z)
q1.push(make_pair(c[i + 1] + d[j], make_pair(i + 1, j)));
}
for (register int i = 1; i <= k; i++)
printf("%lld\n", ans[i]);
return 0;
}
| [
"identifier.change"
] | 896,391 | 896,392 | u276479653 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int x, y, z, k, a[1000], b[1000], c[1000];
vector<long long> d;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x, greater<long long>());
sort(b, b + y, greater<long long>());
sort(c, c + z, greater<long long>());
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
for (int u = 0; u < z; u++) {
if ((i + 1) * (j + 1) * (u + 1) <= k) {
d.push_back(a[i] + b[j] + c[u]);
} else
break;
}
}
}
sort(d.begin(), d.end(), greater<long long>());
for (int i = 0; i < k; i++) {
cout << d[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long x, y, z, k, a[1000], b[1000], c[1000];
vector<long long> d;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x, greater<long long>());
sort(b, b + y, greater<long long>());
sort(c, c + z, greater<long long>());
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
for (int u = 0; u < z; u++) {
if ((i + 1) * (j + 1) * (u + 1) <= k) {
d.push_back(a[i] + b[j] + c[u]);
} else
break;
}
}
}
sort(d.begin(), d.end(), greater<long long>());
for (int i = 0; i < k; i++) {
cout << d[i] << endl;
}
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 896,413 | 896,414 | u974214237 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
#define INF 1e18
typedef long long ll;
typedef pair<ll, ll> P;
typedef struct {
int first;
int second;
int third;
} T;
//昇順
bool comp_Se(T &l, T &r) { return l.second < r.second; }
class cake {
public:
ll sum;
int x, y, z;
cake(ll sum, int x, int y, int z) {
this->sum = sum;
this->x = x;
this->y = y;
this->z = z;
}
};
bool operator<(const cake &l, const cake &r) { return l.sum < r.sum; }
int main(void) {
int i, j, X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
vector<P> a(X, P(0, 0)), b(Y, P(0, 0)), c(Z, P(0, 0));
REP(i, X) cin >> A[i];
REP(i, Y) cin >> B[i];
REP(i, Z) cin >> C[i];
sort(A.begin(), A.end(), greater<ll>());
sort(B.begin(), B.end(), greater<ll>());
sort(C.begin(), C.end(), greater<ll>());
priority_queue<cake> que;
map<ll, ll> memo;
ll sum;
sum = A[0] + B[0] + C[0];
que.push(cake(sum, 0, 0, 0));
memo[0] = sum;
REP(i, K) {
cake ca = que.top();
que.pop();
cout << ca.sum << endl;
int x = ca.x + 1, y = ca.y, z = ca.z;
if (!memo.count((x * 1000 + y) * 1000 + z) && x < X) {
sum = A[x] + B[y] + C[z];
que.push(cake(sum, x, y, z));
memo[(x * 1000 + y) * 1000 + z] = sum;
}
x = ca.x, y = ca.y + 1, z = ca.z;
if (!memo.count((x * 1000 + y) * 1000 + z) && x < X) {
sum = A[x] + B[y] + C[z];
que.push(cake(sum, x, y, z));
memo[(x * 1000 + y) * 1000 + z] = sum;
}
x = ca.x, y = ca.y, z = ca.z + 1;
if (!memo.count((x * 1000 + y) * 1000 + z) && x < X) {
sum = A[x] + B[y] + C[z];
que.push(cake(sum, x, y, z));
memo[(x * 1000 + y) * 1000 + z] = sum;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
#define INF 1e18
typedef long long ll;
typedef pair<ll, ll> P;
typedef struct {
int first;
int second;
int third;
} T;
//昇順
bool comp_Se(T &l, T &r) { return l.second < r.second; }
class cake {
public:
ll sum;
int x, y, z;
cake(ll sum, int x, int y, int z) {
this->sum = sum;
this->x = x;
this->y = y;
this->z = z;
}
};
bool operator<(const cake &l, const cake &r) { return l.sum < r.sum; }
int main(void) {
int i, j, X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
vector<P> a(X, P(0, 0)), b(Y, P(0, 0)), c(Z, P(0, 0));
REP(i, X) cin >> A[i];
REP(i, Y) cin >> B[i];
REP(i, Z) cin >> C[i];
sort(A.begin(), A.end(), greater<ll>());
sort(B.begin(), B.end(), greater<ll>());
sort(C.begin(), C.end(), greater<ll>());
priority_queue<cake> que;
map<ll, ll> memo;
ll sum;
sum = A[0] + B[0] + C[0];
que.push(cake(sum, 0, 0, 0));
memo[0] = sum;
REP(i, K) {
cake ca = que.top();
que.pop();
cout << ca.sum << endl;
int x = ca.x + 1, y = ca.y, z = ca.z;
if (!memo.count((x * 1000 + y) * 1000 + z) && x < X) {
sum = A[x] + B[y] + C[z];
que.push(cake(sum, x, y, z));
memo[(x * 1000 + y) * 1000 + z] = sum;
}
x = ca.x, y = ca.y + 1, z = ca.z;
if (!memo.count((x * 1000 + y) * 1000 + z) && y < Y) {
sum = A[x] + B[y] + C[z];
que.push(cake(sum, x, y, z));
memo[(x * 1000 + y) * 1000 + z] = sum;
}
x = ca.x, y = ca.y, z = ca.z + 1;
if (!memo.count((x * 1000 + y) * 1000 + z) && z < Z) {
sum = A[x] + B[y] + C[z];
que.push(cake(sum, x, y, z));
memo[(x * 1000 + y) * 1000 + z] = sum;
}
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 896,415 | 896,416 | u069450081 | cpp |
p03078 | // ~/Remember,remember the 6th of March
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 100000000;
const int N = 2e6 + 10;
void fast() { std::ios_base::sync_with_stdio(0); }
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt","w",stdout);
#endif*/
ll x, y, z, k;
scanf("%lld%lld%lld%lld", &x, &y, &z, &k);
vector<ll> arrx(x);
for (ll &i : arrx)
scanf("%lld", &i);
vector<ll> arry(y);
for (ll &i : arry)
scanf("%lld", &i);
vector<ll> arrz(z);
for (ll &i : arrz)
scanf("%lld", &i);
sort(arrx.rbegin(), arrx.rend());
sort(arry.rbegin(), arry.rend());
sort(arrz.rbegin(), arrz.rend());
vector<ll> ans;
for (int i = 0; i < x; i++)
for (int j = 0; j < y; j++)
for (int kk = 0; kk < z; kk++)
if ((i + 1) * (j + 1) * (kk + 1) <= k)
ans.push_back(arrx[i] + arry[j] + arrz[k]);
else
break;
sort(ans.rbegin(), ans.rend());
for (int i = 0; i < k; i++)
printf("%lld\n", ans[i]);
return 0;
} | // ~/Remember,remember the 6th of March
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 100000000;
const int N = 2e6 + 10;
void fast() { std::ios_base::sync_with_stdio(0); }
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt","w",stdout);
#endif*/
ll x, y, z, k;
scanf("%lld%lld%lld%lld", &x, &y, &z, &k);
vector<ll> arrx(x);
for (ll &i : arrx)
scanf("%lld", &i);
vector<ll> arry(y);
for (ll &i : arry)
scanf("%lld", &i);
vector<ll> arrz(z);
for (ll &i : arrz)
scanf("%lld", &i);
sort(arrx.rbegin(), arrx.rend());
sort(arry.rbegin(), arry.rend());
sort(arrz.rbegin(), arrz.rend());
vector<ll> ans;
for (int i = 0; i < x; i++)
for (int j = 0; j < y; j++)
for (int kk = 0; kk < z; kk++)
if ((i + 1) * (j + 1) * (kk + 1) <= k)
ans.push_back(arrx[i] + arry[j] + arrz[kk]);
else
break;
sort(ans.rbegin(), ans.rend());
for (int i = 0; i < k; i++)
printf("%lld\n", ans[i]);
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 896,434 | 896,435 | u692176965 | cpp |
p03081 | #include <bits/stdc++.h>
const int INF = 1e9, MOD = 1e9 + 7;
const long long LINF = 1e18;
using namespace std;
#define int long long
// template
// main
signed main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
std::vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int now = 0;
for (int i = Q - 1; i >= 0; i--) {
if (t[i] == s[now] && d[i] == 'L')
now++;
if (now == 0)
continue;
if (t[i] == s[now - 1] && d[i] == 'R')
now--;
}
int now2 = N - 1;
for (int i = Q - 1; i >= 0; i--) {
if (t[i] == s[now2] && d[i] == 'R')
now2--;
if (now2 == N - 1)
continue;
if (t[i] == s[now + 1] && d[i] == 'L')
now2++;
}
cout << max(0LL, now2 - now + 1) << endl;
}
| #include <bits/stdc++.h>
const int INF = 1e9, MOD = 1e9 + 7;
const long long LINF = 1e18;
using namespace std;
#define int long long
// template
// main
signed main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
std::vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int now = 0;
for (int i = Q - 1; i >= 0; i--) {
if (t[i] == s[now] && d[i] == 'L')
now++;
if (now == 0)
continue;
if (t[i] == s[now - 1] && d[i] == 'R')
now--;
}
int now2 = N - 1;
for (int i = Q - 1; i >= 0; i--) {
if (t[i] == s[now2] && d[i] == 'R')
now2--;
if (now2 == N - 1)
continue;
if (t[i] == s[now2 + 1] && d[i] == 'L')
now2++;
}
cout << max(0LL, now2 - now + 1) << endl;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 896,449 | 896,450 | u942774736 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define sperase(v, n) (v).erase(remove(all(v), n), (v).end());
#define vdelete(v) (v).erase(unique(all(v)), (v).end());
#define pb(n) push_back(n);
#define mp make_pair
#define MOD 1000000007
#define INF 9223372036854775807
int n, q, now, ans;
string s;
bool memo1[200000], memo2[200000];
char t[200000], d[200000];
signed main() {
cin >> n >> q >> s;
rep(i, q) cin >> t[i] >> d[i];
now = 0;
repm(i, q) {
if (t[i] == s[now] && d[i] == 'L')
memo1[now] = true, now++;
if (now)
if (t[i] == s[now - 1] && d[i] == 'R')
now--, memo1[now] = false;
if (now == s.size())
break;
}
now = s.size() - 1;
repm(i, q) {
if (t[i] == s[now] && d[i] == 'R')
memo2[now] = true, now--;
if (now != s.size() - 1)
if (t[i] == s[now + 1] && d[i] == 'L')
n++, memo2[now] = false;
if (now < 0)
break;
}
rep(i, n) if (memo1[i] | memo2[i]) ans++;
cout << n - ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define sperase(v, n) (v).erase(remove(all(v), n), (v).end());
#define vdelete(v) (v).erase(unique(all(v)), (v).end());
#define pb(n) push_back(n);
#define mp make_pair
#define MOD 1000000007
#define INF 9223372036854775807
int n, q, now, ans;
string s;
bool memo1[200000], memo2[200000];
char t[200000], d[200000];
signed main() {
cin >> n >> q >> s;
rep(i, q) cin >> t[i] >> d[i];
now = 0;
repm(i, q) {
if (t[i] == s[now] && d[i] == 'L')
memo1[now] = true, now++;
if (now)
if (t[i] == s[now - 1] && d[i] == 'R')
now--, memo1[now] = false;
if (now == s.size())
break;
}
now = s.size() - 1;
repm(i, q) {
if (t[i] == s[now] && d[i] == 'R')
memo2[now] = true, now--;
if (now != s.size() - 1)
if (t[i] == s[now + 1] && d[i] == 'L')
now++, memo2[now] = false;
if (now < 0)
break;
}
rep(i, n) if (memo1[i] | memo2[i]) ans++;
cout << n - ans << endl;
}
| [
"identifier.change"
] | 896,456 | 896,457 | u721367699 | cpp |
p03081 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n, q;
string str;
int main() {
cin >> n >> q;
cin >> str;
vector<pair<char, char>> arr(q);
for (int i = 0; i < q; i++) {
cin >> arr[i].first >> arr[i].second;
}
reverse(arr.begin(), arr.end());
int l = 0;
int r = n;
for (pair<char, char> p : arr) {
char al = p.first;
char op = p.second;
// cout << al << "," << op << endl;
if (l < str.size() && str[l] == al && op == 'L') {
l++;
} else if (l > 0 && str[l - 1] == al && op == 'R') {
l--;
}
if (r > 0 && str[r - 1] == al && op == 'R') {
r--;
} else if (r < str.size() - 1 && str[r] == al && op == 'R') {
r++;
}
// cout << l << "," << r << endl;
}
int ans = max(0, r - l);
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n, q;
string str;
int main() {
cin >> n >> q;
cin >> str;
vector<pair<char, char>> arr(q);
for (int i = 0; i < q; i++) {
cin >> arr[i].first >> arr[i].second;
}
reverse(arr.begin(), arr.end());
int l = 0;
int r = n;
for (pair<char, char> p : arr) {
char al = p.first;
char op = p.second;
// cout << al << "," << op << endl;
if (l < str.size() && str[l] == al && op == 'L') {
l++;
} else if (l > 0 && str[l - 1] == al && op == 'R') {
l--;
}
if (r > 0 && str[r - 1] == al && op == 'R') {
r--;
} else if (r < str.size() && str[r] == al && op == 'L') {
r++;
}
// cout << l << "," << r << endl;
}
int ans = max(0, r - l);
cout << ans << endl;
}
| [
"expression.operation.binary.remove",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 896,458 | 896,459 | u508729896 | cpp |
p03081 | // Ryo Kamoi
//#define DEBUG
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
int INF = 1000000000;
int n, q;
string s;
char t[200010], d[200010];
int lidx, ridx;
int main() {
cin >> n >> q;
cin >> s;
REP(i, q) { cin >> t[i] >> d[i]; }
lidx = 0;
ridx = n - 1;
for (int i = q - 1; i >= 0; i--) {
if (d[i] == 'R') {
if (t[i] == s[ridx])
ridx--;
if (lidx > 0) {
if (t[i] == s[lidx - 1])
lidx--;
}
}
if (d[i] == 'L') {
if (t[i] == s[lidx])
lidx++;
if (ridx < (q - 1)) {
if (t[i] == s[ridx + 1])
ridx++;
}
}
#ifdef DEBUG
cout << i << " " << d[i] << " " << lidx << " " << ridx << endl;
#endif
}
cout << max(0, ridx - lidx + 1) << endl;
}
| // Ryo Kamoi
//#define DEBUG
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
int INF = 1000000000;
int n, q;
string s;
char t[200010], d[200010];
int lidx, ridx;
int main() {
cin >> n >> q;
cin >> s;
REP(i, q) { cin >> t[i] >> d[i]; }
lidx = 0;
ridx = n - 1;
for (int i = q - 1; i >= 0; i--) {
if (d[i] == 'R') {
if (t[i] == s[ridx])
ridx--;
if (lidx > 0) {
if (t[i] == s[lidx - 1])
lidx--;
}
}
if (d[i] == 'L') {
if (t[i] == s[lidx])
lidx++;
if (ridx < (n - 1)) {
if (t[i] == s[ridx + 1])
ridx++;
}
}
#ifdef DEBUG
cout << i << " " << d[i] << " " << lidx << " " << ridx << endl;
#endif
}
cout << max(0, ridx - lidx + 1) << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 896,466 | 896,467 | u632114133 | cpp |
p03081 | #include <bitset>
#include <iostream>
#include <queue>
using namespace std; // 575
const int MAX = 200002;
int main() {
int N, Q;
static char t[MAX], d[MAX];
string s;
cin >> N >> Q >> s;
for (int i = 0; i < Q; ++i)
cin >> t[i] >> d[i];
int l = -1, r = N;
for (int i = Q - 1; i >= 0; --i) {
if (s[l + 1] == t[i] && d[i] == 'L')
++l;
if (0 <= l && s[l] == t[i] && d[i] == 'R')
--l;
if (s[r - 1] == t[i] && d[i] == 'R')
--r;
if (r < N && s[r] == t[i] && d[i] == 'l')
++r;
if (r - l <= 1)
break;
}
cout << max(0, r - l - 1);
return 0;
}
/*
31536000のコメント解説欄
ここテンプレで用意してるから、A問題とかだとこの先空欄の危険あり
また、コンテスト後に https://31536000.hatenablog.com/
で解説していると思うので、良かったら読んでねー
逆順に考えれば良い
そうすれば左右から順に伸ばしていくだけになる
最後に、残った区間はその間なので一発で求まる
*/ | #include <bitset>
#include <iostream>
#include <queue>
using namespace std; // 575
const int MAX = 200002;
int main() {
int N, Q;
static char t[MAX], d[MAX];
string s;
cin >> N >> Q >> s;
for (int i = 0; i < Q; ++i)
cin >> t[i] >> d[i];
int l = -1, r = N;
for (int i = Q - 1; i >= 0; --i) {
if (s[l + 1] == t[i] && d[i] == 'L')
++l;
if (0 <= l && s[l] == t[i] && d[i] == 'R')
--l;
if (s[r - 1] == t[i] && d[i] == 'R')
--r;
if (r < N && s[r] == t[i] && d[i] == 'L')
++r;
if (r - l <= 1)
break;
}
cout << max(0, r - l - 1);
return 0;
}
/*
31536000のコメント解説欄
ここテンプレで用意してるから、A問題とかだとこの先空欄の危険あり
また、コンテスト後に https://31536000.hatenablog.com/
で解説していると思うので、良かったら読んでねー
逆順に考えれば良い
そうすれば左右から順に伸ばしていくだけになる
最後に、残った区間はその間なので一発で求まる
*/ | [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 896,480 | 896,481 | u550314572 | cpp |
p03081 | #include <bits/stdc++.h>
std::vector<char> t, d;
std::string s;
int N, Q;
int end(int);
int main() {
scanf("%d%d", &N, &Q);
std::cin >> s;
t.resize(Q);
d.resize(Q);
for (int i{}; i < Q; i++)
scanf(" %c %c", &t[i], &d[i]);
int left{}, right{N};
while (left + 1 < right) {
int mid{(left + right) / 2};
if (end(mid) == -1)
left = mid;
else
right = mid;
}
int sum{left + 1};
left = -1;
right = N;
while (left + 1 < right) {
int mid{(left + right) / 2};
if (end(mid) == N)
right = mid;
else
left = mid;
}
sum += N - right;
printf("%d\n", N - sum);
return 0;
}
int end(int pos) {
for (int i{}; i < Q; i++) {
if (pos < 0 || pos >= N)
return pos;
if (t[i] != s[pos])
continue;
if (d[i] == 'R')
pos++;
else
pos--;
}
return pos;
} | #include <bits/stdc++.h>
std::vector<char> t, d;
std::string s;
int N, Q;
int end(int);
int main() {
scanf("%d%d", &N, &Q);
std::cin >> s;
t.resize(Q);
d.resize(Q);
for (int i{}; i < Q; i++)
scanf(" %c %c", &t[i], &d[i]);
int left{-1}, right{N};
while (left + 1 < right) {
int mid{(left + right) / 2};
if (end(mid) == -1)
left = mid;
else
right = mid;
}
int sum{left + 1};
left = -1;
right = N;
while (left + 1 < right) {
int mid{(left + right) / 2};
if (end(mid) == N)
right = mid;
else
left = mid;
}
sum += N - right;
printf("%d\n", N - sum);
return 0;
}
int end(int pos) {
for (int i{}; i < Q; i++) {
if (pos < 0 || pos >= N)
return pos;
if (t[i] != s[pos])
continue;
if (d[i] == 'R')
pos++;
else
pos--;
}
return pos;
} | [] | 896,492 | 896,493 | u086849314 | cpp |
p03081 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define FOR(x, xs) for (auto &x : xs)
using namespace std;
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
typedef vector<int> VI;
typedef vector<ll> VL;
template <class T, template <class, class> class C, class charT = char>
void vdump(const C<T, allocator<T>> &v, const charT *delimiter = ", ",
ostream &stream = cout) {
copy(v.begin(), v.end(), ostream_iterator<T>(stream, delimiter));
stream << endl;
}
int main() {
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<pair<char, char>> tds(q);
FOR(td, tds) {
string a, b;
cin >> a >> b;
td.first = a[0];
td.second = b[0];
}
int l = -1;
int r = n;
while (l + 1 < r) {
int m = (l + r) / 2;
int x = m;
FOR(td, tds) {
char tx = s[x];
char t = td.first;
char d = td.second;
if (tx == t) {
if (d == 'L') {
x--;
} else {
x++;
}
}
if (x < 0 || x >= n) {
break;
}
}
if (x < 0) {
l = m;
} else {
r = m;
}
}
int ld = l;
l = -1;
r = n;
while (l + 1 < r) {
int m = (l + r) / 2;
int x = m;
FOR(td, tds) {
char tx = s[x];
char t = td.first;
char d = td.second;
if (tx == t) {
if (d == 'L') {
x--;
} else {
x++;
}
}
if (x < 0 || x >= n) {
break;
}
}
if (x >= n) {
r = m;
} else {
l = m;
}
}
int rd = r;
cout << rd - ld + 1 << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define FOR(x, xs) for (auto &x : xs)
using namespace std;
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
typedef vector<int> VI;
typedef vector<ll> VL;
template <class T, template <class, class> class C, class charT = char>
void vdump(const C<T, allocator<T>> &v, const charT *delimiter = ", ",
ostream &stream = cout) {
copy(v.begin(), v.end(), ostream_iterator<T>(stream, delimiter));
stream << endl;
}
int main() {
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<pair<char, char>> tds(q);
FOR(td, tds) {
string a, b;
cin >> a >> b;
td.first = a[0];
td.second = b[0];
}
int l = -1;
int r = n;
while (l + 1 < r) {
int m = (l + r) / 2;
int x = m;
FOR(td, tds) {
char tx = s[x];
char t = td.first;
char d = td.second;
if (tx == t) {
if (d == 'L') {
x--;
} else {
x++;
}
}
if (x < 0 || x >= n) {
break;
}
}
if (x < 0) {
l = m;
} else {
r = m;
}
}
int ld = l;
l = -1;
r = n;
while (l + 1 < r) {
int m = (l + r) / 2;
int x = m;
FOR(td, tds) {
char tx = s[x];
char t = td.first;
char d = td.second;
if (tx == t) {
if (d == 'L') {
x--;
} else {
x++;
}
}
if (x < 0 || x >= n) {
break;
}
}
if (x >= n) {
r = m;
} else {
l = m;
}
}
int rd = r;
cout << rd - ld - 1 << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 896,496 | 896,497 | u652683896 | cpp |
p03081 | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define pii pair<int, int>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) FORR(i, n, 0)
#define ALL(c) ((c).begin()), ((c).end())
#define PB(a) push_back(a)
#define EMPB(...) emplace_back(__VA_ARGS__)
#define EMP(...) emplace(__VA_ARGS__)
#define MP(a, b) make_pair(a, b)
#define MT(...) make_tuple(__VA_ARGS__)
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MINF(a) memset(a, 0x3f, sizeof(a))
#define PW(n) (1LL << (n))
using namespace std;
template <class T> inline bool CHMIN(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool CHMAX(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline void SORT(T &a) { sort(a.begin(), a.end()); }
template <class T> inline void REV(T &a) { reverse(a.begin(), a.end()); }
template <class T> inline void UNI(T &a) {
sort(a.begin(), a.end());
a.erase(unique(a.begin(), a.end()), a.end());
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-10;
/* ----------------------------------------------------------------------------------------------------
*/
int N, Q;
string S;
char t[200010], d[200010];
bool check(string s, int x, int b) {
REP(i, Q) {
if (t[i] == s[x]) {
if (b > 0) {
if (d[i] == 'L')
x--;
else
x++;
} else {
if (d[i] == 'L')
x++;
else
x--;
}
if (x < 0 || x >= N)
return true;
}
}
return false;
}
int calc(string s, int b) {
int ok = -1, ng = N;
while (ng - ok > 1) {
int m = (ok + ng) / 2;
if (check(s, m, b))
ok = m;
else
ng = m;
}
return ng;
}
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N >> Q >> S;
REP(i, Q) cin >> t[i] >> d[i];
int L = calc(S, 1);
reverse(ALL(S));
int R = calc(S, -1);
cout << N - L - R << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define pii pair<int, int>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) FORR(i, n, 0)
#define ALL(c) ((c).begin()), ((c).end())
#define PB(a) push_back(a)
#define EMPB(...) emplace_back(__VA_ARGS__)
#define EMP(...) emplace(__VA_ARGS__)
#define MP(a, b) make_pair(a, b)
#define MT(...) make_tuple(__VA_ARGS__)
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MINF(a) memset(a, 0x3f, sizeof(a))
#define PW(n) (1LL << (n))
using namespace std;
template <class T> inline bool CHMIN(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool CHMAX(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline void SORT(T &a) { sort(a.begin(), a.end()); }
template <class T> inline void REV(T &a) { reverse(a.begin(), a.end()); }
template <class T> inline void UNI(T &a) {
sort(a.begin(), a.end());
a.erase(unique(a.begin(), a.end()), a.end());
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-10;
/* ----------------------------------------------------------------------------------------------------
*/
int N, Q;
string S;
char t[200010], d[200010];
bool check(string s, int x, int b) {
REP(i, Q) {
if (t[i] == s[x]) {
if (b > 0) {
if (d[i] == 'L')
x--;
else
x++;
} else {
if (d[i] == 'L')
x++;
else
x--;
}
if (x < 0)
return true;
}
}
return false;
}
int calc(string s, int b) {
int ok = -1, ng = N;
while (ng - ok > 1) {
int m = (ok + ng) / 2;
if (check(s, m, b))
ok = m;
else
ng = m;
}
return ng;
}
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N >> Q >> S;
REP(i, Q) cin >> t[i] >> d[i];
int L = calc(S, 1);
reverse(ALL(S));
int R = calc(S, -1);
cout << N - L - R << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 896,515 | 896,516 | u141642872 | cpp |
p03081 | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N, Q;
string s;
cin >> N >> Q >> s;
vector<char> t(Q), d(Q);
for (ll i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
//[left, right]にあるものは生き残る
ll left = 0, right = N - 1;
for (ll i = Q - 1; i >= 0; i--) {
if (d[i] == 'L') {
if (t[i] == s[left]) {
left++;
} else if (right < N - 1 && t[i] == s[right + 1]) {
right++;
}
} else {
if (t[i] == s[right]) {
right--;
} else if (left > 0 && t[i] == s[left - 1]) {
left--;
}
}
}
cout << max(right - left + 1, (ll)0) << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N, Q;
string s;
cin >> N >> Q >> s;
vector<char> t(Q), d(Q);
for (ll i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
//[left, right]にあるものは生き残る
ll left = 0, right = N - 1;
for (ll i = Q - 1; i >= 0; i--) {
if (d[i] == 'L') {
if (t[i] == s[left]) {
left++;
}
if (right < N - 1 && t[i] == s[right + 1]) {
right++;
}
} else {
if (t[i] == s[right]) {
right--;
}
if (left > 0 && t[i] == s[left - 1]) {
left--;
}
}
}
cout << max(right - left + 1, (ll)0) << endl;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 896,521 | 896,522 | u456065785 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
const int NS = (int)2e5 + 4;
int N, Q;
char arr[NS], mov[NS][4];
int main() {
scanf("%d %d", &N, &Q);
scanf("%s", arr + 1);
for (int i = 1; i <= Q; ++i)
scanf(" %c %c", &mov[i][1], &mov[i][2]);
int ans = N;
int l = 1, r = N, mid;
while (l < r) {
mid = (l + r) / 2 + 1;
int pos = mid;
for (int i = 1; i <= Q; ++i)
if (mov[i][1] == arr[pos]) {
pos += mov[i][2] == 'L' ? -1 : 1;
if (!pos)
break;
}
if (!pos)
l = mid;
else
r = mid - 1;
}
if (l == 1 && r == 1) {
mid = 1;
int pos = mid;
for (int i = 1; i <= Q; ++i)
if (mov[i][1] == arr[pos]) {
pos += mov[i][2] == 'L' ? -1 : 1;
if (!pos)
break;
}
if (pos)
r = 0;
}
ans -= r;
l = 1, r = N, mid;
while (l < r) {
mid = (l + r) / 2;
int pos = mid;
for (int i = 1; i <= Q; ++i)
if (mov[i][1] == arr[pos]) {
pos += mov[i][2] == 'L' ? -1 : 1;
if (pos > N)
break;
}
if (pos > N)
r = mid;
else
l = mid + 1;
}
if (l == N && r == N) {
mid = 1;
int pos = mid;
for (int i = 1; i <= Q; ++i)
if (mov[i][1] == arr[pos]) {
pos += mov[i][2] == 'L' ? -1 : 1;
if (pos > N)
break;
}
if (pos <= N)
l = N + 1;
}
ans -= N - l + 1;
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int NS = (int)2e5 + 4;
int N, Q;
char arr[NS], mov[NS][4];
int main() {
scanf("%d %d", &N, &Q);
scanf("%s", arr + 1);
for (int i = 1; i <= Q; ++i)
scanf(" %c %c", &mov[i][1], &mov[i][2]);
int ans = N;
int l = 1, r = N, mid;
while (l < r) {
mid = (l + r) / 2 + 1;
int pos = mid;
for (int i = 1; i <= Q; ++i)
if (mov[i][1] == arr[pos]) {
pos += mov[i][2] == 'L' ? -1 : 1;
if (!pos)
break;
}
if (!pos)
l = mid;
else
r = mid - 1;
}
if (l == 1 && r == 1) {
mid = 1;
int pos = mid;
for (int i = 1; i <= Q; ++i)
if (mov[i][1] == arr[pos]) {
pos += mov[i][2] == 'L' ? -1 : 1;
if (!pos)
break;
}
if (pos)
r = 0;
}
ans -= r;
l = 1, r = N, mid;
while (l < r) {
mid = (l + r) / 2;
int pos = mid;
for (int i = 1; i <= Q; ++i)
if (mov[i][1] == arr[pos]) {
pos += mov[i][2] == 'L' ? -1 : 1;
if (pos > N)
break;
}
if (pos > N)
r = mid;
else
l = mid + 1;
}
if (l == N && r == N) {
mid = N;
int pos = mid;
for (int i = 1; i <= Q; ++i)
if (mov[i][1] == arr[pos]) {
pos += mov[i][2] == 'L' ? -1 : 1;
if (pos > N)
break;
}
if (pos <= N)
l = N + 1;
}
ans -= N - l + 1;
printf("%d\n", ans);
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 896,529 | 896,530 | u565057006 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define repm(i, a, b) for (int i = (int)(a); i > (int)(b); --i)
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
S = "*" + S + "*";
int x = 0, y = N + 1;
int l = 0, r = N + 1;
vector<char> t(Q), d(Q);
repp(i, 0, Q) cin >> t[i] >> d[i];
repm(i, Q - 1, -1) {
if (d[i] == 'L') {
if (S[l + 1] == t[i])
++l;
if (S[r] == t[i])
++r;
} else {
if (S[l] == t[i])
--l;
if (S[r - 1] == t[i])
--r;
}
x = max(x, l);
y = min(y, r);
}
cout << N - min(N, x + N + 1 - y) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define repm(i, a, b) for (int i = (int)(a); i > (int)(b); --i)
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
S = "*" + S + "*";
int x = 0, y = N + 1;
int l = 0, r = N + 1;
vector<char> t(Q), d(Q);
repp(i, 0, Q) cin >> t[i] >> d[i];
repm(i, Q - 1, -1) {
if (d[i] == 'L') {
if (S[l + 1] == t[i])
++l;
if (S[r] == t[i])
++r;
} else {
if (S[l] == t[i])
--l;
if (S[r - 1] == t[i])
--r;
}
x = max(x, l);
y = min(y, r);
}
cout << N - min(N, l + N + 1 - r) << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 896,537 | 896,538 | u007446928 | cpp |
p03081 | /*
* If you gave me a chance
* I'll take it
* It's a shot in the dark
* But I will make it:D
*/
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#ifndef rd
#define endl '\n'
#endif
#ifdef rd
#define trace(...) \
cout << "Line:" << __LINE__ << " "; \
__f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define deb cout << "Line: " << __LINE__ << " plz "
#define pb push_back
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double f80;
#define double long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) ((long long)x.size())
#define fr(a, b, c) for (int a = b; a <= c; a++)
#define rep(a, b, c) for (int a = b; a < c; a++)
#define trav(a, x) for (auto &a : x)
#define all(con) con.begin(), con.end()
const ll infl = 2e18;
const int infi = 2e9;
const int mod = 1e9 + 7;
typedef vector<int> vi;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
oset;
mt19937 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
auto clk = clock();
int rng(int lim) {
uniform_int_distribution<int> uid(0, lim - 1);
return uid(rang);
}
void solve() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int lo = -1, hi = n - 1, mid = (lo + hi + 1) / 2;
char te1, te2;
vector<pair<char, char>> moves;
for (int i = 0; i < q; i++) {
cin >> te1 >> te2;
moves.pb({te1, te2});
}
// trace(s);
while (lo < hi) {
// trace(lo,hi);
int place = mid;
bool dark = 0;
for (int i = 0; i < q; i++) {
if (s[place] == moves[i].fi) {
if (moves[i].se == 'L')
place--;
else
place++;
if (place == n) {
break;
}
if (place == -1) {
dark = 1;
break;
}
}
}
if (dark) {
lo = mid;
} else {
hi = mid - 1;
}
mid = (lo + hi + 1) / 2;
}
int ans = mid + 1;
lo = 0;
hi = n;
mid = (lo + hi) / 2;
while (lo < hi) {
// trace(lo,hi);
int place = mid;
bool dark = 0;
for (int i = 0; i < q; i++) {
if (moves[i].fi == s[place]) {
if (moves[i].se == 'R')
place++;
else
place--;
if (place == -1) {
break;
}
if (place == n) {
dark = 1;
break;
}
}
}
if (dark)
hi = mid;
else
lo = mid + 1;
mid = (lo + hi) / 2;
}
ans += n - mid;
cout << n - ans << endl;
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
int t = 1;
// cin>>t;
while (t--)
solve();
#ifdef rd
cerr << endl << endl << (double)(clock() - clk) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
| /*
* If you gave me a chance
* I'll take it
* It's a shot in the dark
* But I will make it:D
*/
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#ifndef rd
#define endl '\n'
#endif
#ifdef rd
#define trace(...) \
cout << "Line:" << __LINE__ << " "; \
__f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define deb cout << "Line: " << __LINE__ << " plz "
#define pb push_back
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double f80;
#define double long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) ((long long)x.size())
#define fr(a, b, c) for (int a = b; a <= c; a++)
#define rep(a, b, c) for (int a = b; a < c; a++)
#define trav(a, x) for (auto &a : x)
#define all(con) con.begin(), con.end()
const ll infl = 2e18;
const int infi = 2e9;
const int mod = 1e9 + 7;
typedef vector<int> vi;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
oset;
mt19937 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
auto clk = clock();
int rng(int lim) {
uniform_int_distribution<int> uid(0, lim - 1);
return uid(rang);
}
void solve() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int lo = -1, hi = n - 1, mid = (lo + hi + 1) / 2;
char te1, te2;
vector<pair<char, char>> moves;
for (int i = 0; i < q; i++) {
cin >> te1 >> te2;
moves.pb({te1, te2});
}
// trace(s);
while (lo < hi) {
// trace(lo,hi);
int place = mid;
bool dark = 0;
for (int i = 0; i < q; i++) {
if (s[place] == moves[i].fi) {
if (moves[i].se == 'L')
place--;
else
place++;
if (place == n) {
break;
}
if (place == -1) {
dark = 1;
break;
}
}
}
if (dark) {
lo = mid;
} else {
hi = mid - 1;
}
mid = (lo + hi + 1) / 2;
}
int ans = lo + 1;
lo = 0;
hi = n;
mid = (lo + hi) / 2;
while (lo < hi) {
// trace(lo,hi);
int place = mid;
bool dark = 0;
for (int i = 0; i < q; i++) {
if (moves[i].fi == s[place]) {
if (moves[i].se == 'R')
place++;
else
place--;
if (place == -1) {
break;
}
if (place == n) {
dark = 1;
break;
}
}
}
if (dark)
hi = mid;
else
lo = mid + 1;
mid = (lo + hi) / 2;
}
ans += n - mid;
cout << n - ans << endl;
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
int t = 1;
// cin>>t;
while (t--)
solve();
#ifdef rd
cerr << endl << endl << (double)(clock() - clk) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 896,543 | 896,544 | u317879811 | cpp |
p03081 | #include <cstdio>
using namespace std;
char s[200001];
char t[200000];
int d[200000];
int main() {
int n, q, l1, r1, m1, l2, r2, m2, i;
scanf("%d %d", &n, &q);
scanf("%s", s);
for (i = 0; i < q; i++) {
char c1[2];
char c2[2];
scanf("%s %s", c1, c2);
t[i] = c1[0];
if (c2[0] == 'L') {
d[i] = -1;
} else {
d[i] = 1;
}
}
l1 = -1, r1 = n, m1 = (l1 + r1) / 2;
while (r1 - l1 > 1) {
int x = m1;
for (i = 0; i < q; i++) {
if (s[x] == t[i])
x += d[i];
if (x < 0 || x >= n)
break;
}
if (x < 0) {
l1 = m1;
m1 = (l1 + r1) / 2;
} else {
r1 = m1;
m1 = (l1 + r1) / 2;
}
}
l2 = -1, r2 = n, m2 = (l2 + r2) / 2;
while (r2 - l2 > 2) {
int x = m2;
for (i = 0; i < q; i++) {
if (s[x] == t[i])
x += d[i];
if (x < 0 || x >= n)
break;
}
if (x >= n) {
r2 = m2;
m2 = (l2 + r2) / 2;
} else {
l2 = m2;
m2 = (l2 + r2) / 2;
}
}
printf("%d\n", n - (l1 + 1) - (n - r2));
return 0;
}
| #include <cstdio>
using namespace std;
char s[200001];
char t[200000];
int d[200000];
int main() {
int n, q, l1, r1, m1, l2, r2, m2, i;
scanf("%d %d", &n, &q);
scanf("%s", s);
for (i = 0; i < q; i++) {
char c1[2];
char c2[2];
scanf("%s %s", c1, c2);
t[i] = c1[0];
if (c2[0] == 'L') {
d[i] = -1;
} else {
d[i] = 1;
}
}
l1 = -1, r1 = n, m1 = (l1 + r1) / 2;
while (r1 - l1 > 1) {
int x = m1;
for (i = 0; i < q; i++) {
if (s[x] == t[i])
x += d[i];
if (x < 0 || x >= n)
break;
}
if (x < 0) {
l1 = m1;
m1 = (l1 + r1) / 2;
} else {
r1 = m1;
m1 = (l1 + r1) / 2;
}
}
l2 = -1, r2 = n, m2 = (l2 + r2) / 2;
while (r2 - l2 > 1) {
int x = m2;
for (i = 0; i < q; i++) {
if (s[x] == t[i])
x += d[i];
if (x < 0 || x >= n)
break;
}
if (x >= n) {
r2 = m2;
m2 = (l2 + r2) / 2;
} else {
l2 = m2;
m2 = (l2 + r2) / 2;
}
}
printf("%d\n", n - (l1 + 1) - (n - r2));
return 0;
}
| [
"literal.number.change",
"control_flow.loop.condition.change"
] | 896,545 | 896,546 | u387061829 | cpp |
p03081 | #include <iostream>
#include <string>
#include <vector>
// binary search to get the left and right boundary
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q);
vector<char> d(Q);
for (int i = 0; i < Q; i += 1) {
cin >> t[i] >> d[i];
}
int L = -1;
int left = 0, right = N - 1;
while (left < right) {
int mid = (left + right) >> 1;
int inx = mid;
for (int i = 0; i < Q; i += 1) {
if (s[inx] == t[i]) {
if (d[i] == 'L')
inx -= 1;
else
inx += 1;
}
if (inx < 0 || inx > N - 1)
break;
}
if (inx < 0) {
L = mid;
left = mid + 1;
} else
right = mid - 1;
}
int R = N;
left = 0, right = N - 1;
while (left < right) {
int mid = (left + right) >> 1;
int inx = mid;
for (int i = 0; i < Q; i += 1) {
if (s[inx] == t[i]) {
if (d[i] == 'R')
inx += 1;
else
inx -= 1;
}
if (inx < 0 || inx > N - 1)
break;
}
if (inx > N - 1) {
R = mid;
right = mid - 1;
} else
left = mid + 1;
}
std::cout << std::to_string(R - L - 1) << std::endl;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
// binary search to get the left and right boundary separately
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q);
vector<char> d(Q);
for (int i = 0; i < Q; i += 1) {
cin >> t[i] >> d[i];
}
int L = -1;
int left = 0, right = N - 1;
while (left <= right) {
int mid = (left + right) >> 1;
int inx = mid;
for (int i = 0; i < Q; i += 1) {
if (s[inx] == t[i]) {
if (d[i] == 'L')
inx -= 1;
else
inx += 1;
}
if (inx < 0 || inx > N - 1)
break;
}
if (inx < 0) {
L = mid;
left = mid + 1;
} else
right = mid - 1;
}
int R = N;
left = 0, right = N - 1;
while (left <= right) {
int mid = (left + right) >> 1;
int inx = mid;
for (int i = 0; i < Q; i += 1) {
if (s[inx] == t[i]) {
if (d[i] == 'R')
inx += 1;
else
inx -= 1;
}
if (inx < 0 || inx > N - 1)
break;
}
if (inx > N - 1) {
R = mid;
right = mid - 1;
} else
left = mid + 1;
}
std::cout << std::to_string(R - L - 1) << std::endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 896,549 | 896,550 | u436484848 | cpp |
p03081 | #include <iostream>
#include <string>
#include <vector>
// binary search to get the left and right boundary
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q);
vector<char> d(Q);
for (int i = 0; i < Q; i += 1) {
cin >> t[i] >> d[i];
}
int L = -1;
int left = 0, right = N - 1;
while (left < right) {
int mid = (left + right) >> 1;
int inx = mid;
for (int i = 0; i < Q; i += 1) {
if (s[inx] == t[i]) {
if (d[i] == 'L')
inx -= 1;
else
inx += 1;
}
if (inx < 0 || inx > N - 1)
break;
}
if (inx < 0) {
L = mid;
left = mid + 1;
} else
right = mid - 1;
}
int R = N;
left = 0, right = N - 1;
while (left < right) {
int mid = (left + right) >> 1;
int inx = mid;
for (int i = 0; i < Q; i += 1) {
if (s[inx] == t[i]) {
if (d[i] == 'R')
inx += 1;
else
inx -= 1;
}
if (inx < 0 || inx > N - 1)
break;
}
if (inx > N - 1) {
R = mid;
right = mid - 1;
} else
left = mid + 1;
}
std::cout << std::to_string(R - L - 1) << std::endl;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
// binary search to get the left and right boundary
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q);
vector<char> d(Q);
for (int i = 0; i < Q; i += 1) {
cin >> t[i] >> d[i];
}
int L = -1;
int left = 0, right = N - 1;
while (left <= right) {
int mid = (left + right) >> 1;
int inx = mid;
for (int i = 0; i < Q; i += 1) {
if (s[inx] == t[i]) {
if (d[i] == 'L')
inx -= 1;
else
inx += 1;
}
if (inx < 0 || inx > N - 1)
break;
}
if (inx < 0) {
L = mid;
left = mid + 1;
} else
right = mid - 1;
}
int R = N;
left = 0, right = N - 1;
while (left <= right) {
int mid = (left + right) >> 1;
int inx = mid;
for (int i = 0; i < Q; i += 1) {
if (s[inx] == t[i]) {
if (d[i] == 'R')
inx += 1;
else
inx -= 1;
}
if (inx < 0 || inx > N - 1)
break;
}
if (inx > N - 1) {
R = mid;
right = mid - 1;
} else
left = mid + 1;
}
std::cout << std::to_string(R - L - 1) << std::endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 896,549 | 896,551 | u436484848 | cpp |
p03081 | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;
int N, Q;
string s;
char t[200010], d[200010];
int get_state(int x) {
for (int i = 0; i < Q; i++) {
if (s[x] == t[i]) {
if (d[i] == 'L')
x--;
if (d[i] == 'R')
x++;
}
if (x < 0)
return 1;
if (x >= N)
return 2;
}
return 0;
}
int bs1() {
int ub = N + 1, lb = 0;
while (ub - lb > 1) {
int mid = (ub + lb) / 2;
if (get_state(mid) == 1)
lb = mid;
else
ub = mid;
}
return lb;
}
int bs2() {
int ub = N, lb = -1;
while (ub - lb > 1) {
int mid = (ub + lb) / 2;
if (get_state(mid) == 2)
ub = mid;
else
lb = mid;
}
return ub;
}
signed main() {
cin >> N >> Q;
cin >> s;
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int s1 = bs1() + 1;
int s2 = bs2();
// fprintf(stderr, "s1 = %lld, s2 = %lld\n", s1, s2);
int ans = N - s1 - (N - s2);
cout << ans << endl;
return 0;
}
| // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;
int N, Q;
string s;
char t[200010], d[200010];
int get_state(int x) {
for (int i = 0; i < Q; i++) {
if (s[x] == t[i]) {
if (d[i] == 'L')
x--;
if (d[i] == 'R')
x++;
}
if (x < 0)
return 1;
if (x >= N)
return 2;
}
return 0;
}
int bs1() {
int ub = N, lb = -1;
while (ub - lb > 1) {
int mid = (ub + lb) / 2;
if (get_state(mid) == 1)
lb = mid;
else
ub = mid;
}
return lb;
}
int bs2() {
int ub = N, lb = -1;
while (ub - lb > 1) {
int mid = (ub + lb) / 2;
if (get_state(mid) == 2)
ub = mid;
else
lb = mid;
}
return ub;
}
signed main() {
cin >> N >> Q;
cin >> s;
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int s1 = bs1() + 1;
int s2 = bs2();
// fprintf(stderr, "s1 = %lld, s2 = %lld\n", s1, s2);
int ans = N - s1 - (N - s2);
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change"
] | 896,567 | 896,568 | u119460590 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
enum Result { Left, Right, None };
struct Magic {
char t, d;
};
Result move(string s, vector<Magic> magics, int index) {
for (auto m : magics) {
if (s[index] == m.t) {
if (m.d == 'L')
index--;
if (index == -1)
return Left;
else
index++;
if (index == s.size())
return Right;
}
}
return None;
}
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<Magic> magics(q);
for (int i = 0; i < q; i++) {
char t, d;
cin >> t >> d;
magics[i] = Magic{t, d};
}
int l = -1, r = n;
int lb = -1, ub = n;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
if (move(s, magics, mid) == Left) {
l = mid;
lb = mid;
} else {
ub = mid;
}
}
lb = -1, ub = n;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
if (move(s, magics, mid) == Right) {
r = mid;
ub = mid;
} else {
lb = mid;
}
}
cout << max(0, r - 1 - l) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
enum Result { Left, Right, None };
struct Magic {
char t, d;
};
Result move(string s, vector<Magic> magics, int index) {
for (auto m : magics) {
if (s[index] == m.t) {
if (m.d == 'L') {
index--;
if (index == -1)
return Left;
} else {
index++;
if (index == s.size())
return Right;
}
}
}
return None;
}
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<Magic> magics(q);
for (int i = 0; i < q; i++) {
char t, d;
cin >> t >> d;
magics[i] = Magic{t, d};
}
int l = -1, r = n;
int lb = -1, ub = n;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
if (move(s, magics, mid) == Left) {
l = mid;
lb = mid;
} else {
ub = mid;
}
}
lb = -1, ub = n;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
if (move(s, magics, mid) == Right) {
r = mid;
ub = mid;
} else {
lb = mid;
}
}
cout << max(0, r - 1 - l) << endl;
return 0;
}
| [] | 896,573 | 896,574 | u280512618 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
#define DBG(fmt, ...)
#endif
const ll LLINF = (1LL << 60);
const int INF = (1LL << 30);
const double DINF = std::numeric_limits<double>::infinity();
const int MOD = 1000000007;
#define MAX_N 100010
ll N, Q;
string S;
vector<char> T;
vector<char> D;
// 左から消滅できるなら true
static inline bool check_l(ll ind) {
ll cur = ind; // 現在地
REP(i, Q) {
if (T[i] == S[ind]) {
if (D[i] == 'L') {
ind--;
if (ind < 0) {
return true;
}
} else {
ind++;
}
}
}
return false;
}
// 右から消滅できるなら true
static inline bool check_r(ll ind) {
ll cur = ind; // 現在地
REP(i, Q) {
if (T[i] == S[ind]) {
if (D[i] == 'L') {
ind--;
} else {
ind++;
if (ind >= N) {
return true;
}
}
}
}
return false;
}
ll solve() {
// 左側に消える最大のインデックス
ll del_l = -1;
ll lb = 0, rb = N - 1;
while (rb - lb > 1) {
ll mid = (lb + rb) / 2;
if (check_l(mid)) {
lb = mid;
} else {
rb = mid;
}
}
if (check_l(rb)) {
del_l = rb;
} else if (check_l(lb)) {
del_l = lb;
}
// 右側に消える最大のインデックス
ll del_r = -1;
lb = 0;
rb = N - 1;
while (rb - lb > 1) {
ll mid = (lb + rb) / 2;
bool ret = check_r(mid);
if (ret) {
rb = mid;
} else {
lb = mid;
}
}
if (check_r(lb)) {
del_r = rb;
} else if (check_r(rb)) {
del_r = lb;
}
if (del_l == -1) {
if (del_r == -1) {
return N;
}
return del_r;
}
if (del_r == -1) {
return N - (del_l + 1);
}
if (del_l >= del_r) {
return 0;
}
return N - (del_l + 1) - (N - del_r);
}
signed main() {
cin >> N >> Q >> S;
T.resize(Q);
D.resize(Q);
REP(i, Q) { cin >> T[i] >> D[i]; }
ll ans = solve();
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
#define DBG(fmt, ...)
#endif
const ll LLINF = (1LL << 60);
const int INF = (1LL << 30);
const double DINF = std::numeric_limits<double>::infinity();
const int MOD = 1000000007;
#define MAX_N 100010
ll N, Q;
string S;
vector<char> T;
vector<char> D;
// 左から消滅できるなら true
static inline bool check_l(ll ind) {
ll cur = ind; // 現在地
REP(i, Q) {
if (T[i] == S[ind]) {
if (D[i] == 'L') {
ind--;
if (ind < 0) {
return true;
}
} else {
ind++;
}
}
}
return false;
}
// 右から消滅できるなら true
static inline bool check_r(ll ind) {
ll cur = ind; // 現在地
REP(i, Q) {
if (T[i] == S[ind]) {
if (D[i] == 'L') {
ind--;
} else {
ind++;
if (ind >= N) {
return true;
}
}
}
}
return false;
}
ll solve() {
// 左側に消える最大のインデックス
ll del_l = -1;
ll lb = 0, rb = N - 1;
while (rb - lb > 1) {
ll mid = (lb + rb) / 2;
if (check_l(mid)) {
lb = mid;
} else {
rb = mid;
}
}
if (check_l(rb)) {
del_l = rb;
} else if (check_l(lb)) {
del_l = lb;
}
// 右側に消える最大のインデックス
ll del_r = -1;
lb = 0;
rb = N - 1;
while (rb - lb > 1) {
ll mid = (lb + rb) / 2;
bool ret = check_r(mid);
if (ret) {
rb = mid;
} else {
lb = mid;
}
}
if (check_r(lb)) {
del_r = lb;
} else if (check_r(rb)) {
del_r = rb;
}
if (del_l == -1) {
if (del_r == -1) {
return N;
}
return del_r;
}
if (del_r == -1) {
return N - (del_l + 1);
}
if (del_l >= del_r) {
return 0;
}
return N - (del_l + 1) - (N - del_r);
}
signed main() {
cin >> N >> Q >> S;
T.resize(Q);
D.resize(Q);
REP(i, Q) { cin >> T[i] >> D[i]; }
ll ans = solve();
printf("%lld\n", ans);
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 896,584 | 896,585 | u633020228 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
const int INF = 0x3fffffff;
const double DINF = numeric_limits<double>::infinity();
const vector<pii> four = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) for (ll i = 0; i < n; ++i)
#define _rep2(i, n) for (ll i = 0; i < n; ++i)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) for (ll i = n - 1; i >= 0; i--)
#define _rrep2(i, n) for (ll i = n - 1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = b - 1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define yes(i) out(i ? "yes" : "no")
#define Yes(i) out(i ? "Yes" : "No")
#define YES(i) out(i ? "YES" : "NO")
#define Possible(i) out(i ? "Possible" : "Impossible")
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
if (a < b) {
ll c = a;
a = b;
b = c;
}
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline constexpr ll intpow(const ll &a, const ll &b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr ll modpow(const ll &a, const ll &b, const ll &mod = MOD) {
if (b == 0)
return 1;
ll ans = modpow(a, b / 2, mod);
ans = ans * ans % mod;
if (b & 1)
ans = ans * a % mod;
return ans;
}
template <typename T> inline constexpr bool update_min(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool update_max(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
inline void in() {}
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << vec[0];
rep(i, 1, vec.size()) { os << ' ' << vec[i]; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> &deq) {
os << deq[0];
rep(i, 1, deq.size()) { os << ' ' << deq[i]; }
return os;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T, class L> pair<T, L> operator+(pair<T, L> a, pair<T, L> b) {
return {a.first + b.first, a.second + b.second};
}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
template <class Head, class... Tail> inline void err(Head head, Tail... tail) {
cerr << head << ' ';
out(move(tail)...);
}
signed main() {
LL(n, q);
STR(s);
VEC(pcc, a, q);
ll l = 0, r = n;
reverse(range(a));
each(i, a) {
if (i.second == 'L') {
if (s[l] == i.first)
l++;
if (r < n - 1 && s[r] == i.first)
r++;
} else {
if (l > 0 && s[l - 1] == i.first)
l--;
if (s[r - 1] == i.first)
r--;
}
if (l == r)
return out(0);
}
out(r - l);
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
const int INF = 0x3fffffff;
const double DINF = numeric_limits<double>::infinity();
const vector<pii> four = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) for (ll i = 0; i < n; ++i)
#define _rep2(i, n) for (ll i = 0; i < n; ++i)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) for (ll i = n - 1; i >= 0; i--)
#define _rrep2(i, n) for (ll i = n - 1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = b - 1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define yes(i) out(i ? "yes" : "no")
#define Yes(i) out(i ? "Yes" : "No")
#define YES(i) out(i ? "YES" : "NO")
#define Possible(i) out(i ? "Possible" : "Impossible")
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
if (a < b) {
ll c = a;
a = b;
b = c;
}
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline constexpr ll intpow(const ll &a, const ll &b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr ll modpow(const ll &a, const ll &b, const ll &mod = MOD) {
if (b == 0)
return 1;
ll ans = modpow(a, b / 2, mod);
ans = ans * ans % mod;
if (b & 1)
ans = ans * a % mod;
return ans;
}
template <typename T> inline constexpr bool update_min(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool update_max(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
inline void in() {}
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << vec[0];
rep(i, 1, vec.size()) { os << ' ' << vec[i]; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> &deq) {
os << deq[0];
rep(i, 1, deq.size()) { os << ' ' << deq[i]; }
return os;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T, class L> pair<T, L> operator+(pair<T, L> a, pair<T, L> b) {
return {a.first + b.first, a.second + b.second};
}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
template <class Head, class... Tail> inline void err(Head head, Tail... tail) {
cerr << head << ' ';
out(move(tail)...);
}
signed main() {
LL(n, q);
STR(s);
VEC(pcc, a, q);
ll l = 0, r = n;
reverse(range(a));
each(i, a) {
if (i.second == 'L') {
if (s[l] == i.first)
l++;
if (r < n && s[r] == i.first)
r++;
} else {
if (l > 0 && s[l - 1] == i.first)
l--;
if (s[r - 1] == i.first)
r--;
}
if (l == r)
return out(0);
}
out(r - l);
}
| [
"expression.operation.binary.remove"
] | 896,586 | 896,587 | u874644572 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
int N, Q;
string S;
char T[200010];
char D[200010];
bool ok[200010];
bool check_right(int pos) {
for (int i = 0; i < Q; i++) {
if (T[i] == S[pos]) {
if (D[i] == 'L')
pos--;
if (D[i] == 'R')
pos++;
}
if (pos >= N)
return true;
}
return false;
}
bool check_left(int pos) {
for (int i = 0; i < Q; i++) {
if (T[i] == S[pos]) {
if (D[i] == 'L')
pos--;
if (D[i] == 'R')
pos++;
}
if (pos < 0)
return true;
}
return false;
}
int main() {
cin >> N >> Q;
cin >> S;
for (int i = 0; i < Q; i++)
cin >> T[i] >> D[i];
{
int lb = -1;
int ub = N - 1;
while (ub - lb > 1) {
int mid = (ub + lb) / 2;
if (check_right(mid))
ub = mid;
else
lb = mid;
}
for (int i = ub; i < N; i++) {
ok[i] = true;
}
}
{
int lb = 0;
int ub = N;
while (ub - lb > 1) {
int mid = (ub + lb) / 2;
if (check_left(mid))
lb = mid;
else
ub = mid;
}
for (int i = 0; i <= lb; i++) {
ok[i] = true;
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (ok[i])
ans++;
}
cout << N - ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
int N, Q;
string S;
char T[200010];
char D[200010];
bool ok[200010];
bool check_right(int pos) {
for (int i = 0; i < Q; i++) {
if (T[i] == S[pos]) {
if (D[i] == 'L')
pos--;
if (D[i] == 'R')
pos++;
}
if (pos >= N)
return true;
}
return false;
}
bool check_left(int pos) {
for (int i = 0; i < Q; i++) {
if (T[i] == S[pos]) {
if (D[i] == 'L')
pos--;
if (D[i] == 'R')
pos++;
}
if (pos < 0)
return true;
}
return false;
}
int main() {
cin >> N >> Q;
cin >> S;
for (int i = 0; i < Q; i++)
cin >> T[i] >> D[i];
{
int lb = -1;
int ub = N;
while (ub - lb > 1) {
int mid = (ub + lb) / 2;
if (check_right(mid))
ub = mid;
else
lb = mid;
}
for (int i = ub; i < N; i++) {
ok[i] = true;
}
}
{
int lb = -1;
int ub = N;
while (ub - lb > 1) {
int mid = (ub + lb) / 2;
if (check_left(mid))
lb = mid;
else
ub = mid;
}
for (int i = 0; i <= lb; i++) {
ok[i] = true;
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (ok[i])
ans++;
}
cout << N - ans << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change"
] | 896,588 | 896,589 | u489053642 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define nummax 220000
int drop(int n, int N, int Q, string s, char t[], char d[]) {
int i, posi = n;
for (i = 1; i <= Q; i++) {
if (s[posi - 1] == t[i]) {
if (d[i] == 'R') {
posi++;
if (posi > N)
return 1;
} else {
posi--;
if (posi < 1)
return -1;
}
}
}
return 0;
}
int main() {
int i, N, Q, LL, LR, RL, RR, LM, RM, ans;
char t[nummax], d[nummax];
string s;
cin >> N >> Q;
cin >> s;
for (i = 1; i <= N; i++) {
cin >> t[i] >> d[i];
}
LL = 0;
RL = 0;
LR = N + 1;
RR = N + 1;
while (1) {
LM = (LL + LR) / 2;
if (drop(LM, N, Q, s, t, d) == -1)
LL = LM;
else
LR = LM;
if (LR - LL == 1)
break;
}
while (1) {
RM = (RL + RR) / 2;
if (drop(RM, N, Q, s, t, d) == 1)
RR = RM;
else
RL = RM;
if (RR - RL == 1)
break;
}
ans = RR - LR;
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define nummax 220000
int drop(int n, int N, int Q, string s, char t[], char d[]) {
int i, posi = n;
for (i = 1; i <= Q; i++) {
if (s[posi - 1] == t[i]) {
if (d[i] == 'R') {
posi++;
if (posi > N)
return 1;
} else {
posi--;
if (posi < 1)
return -1;
}
}
}
return 0;
}
int main() {
int i, N, Q, LL, LR, RL, RR, LM, RM, ans;
char t[nummax], d[nummax];
string s;
cin >> N >> Q;
cin >> s;
for (i = 1; i <= Q; i++) {
cin >> t[i] >> d[i];
}
LL = 0;
RL = 0;
LR = N + 1;
RR = N + 1;
while (1) {
LM = (LL + LR) / 2;
if (drop(LM, N, Q, s, t, d) == -1)
LL = LM;
else
LR = LM;
if (LR - LL == 1)
break;
}
while (1) {
RM = (RL + RR) / 2;
if (drop(RM, N, Q, s, t, d) == 1)
RR = RM;
else
RL = RM;
if (RR - RL == 1)
break;
}
ans = RR - LR;
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 896,613 | 896,614 | u541884637 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n';
typedef int64_t Int;
Int mod = 1e9 + 7;
Int INF = 1e9 + 18;
Int n, q;
string s;
char t[200001], l[200001];
bool f(Int cur, Int d) {
for (Int i = 0; i < q; i++) {
if (s[cur] == t[i]) {
if (l[i] == 'L') {
cur--;
} else {
cur++;
}
}
}
return cur == d;
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> q;
cin >> s;
s = '.' + s + '.';
for (Int i = 0; i < q; i++)
cin >> t[i] >> l[i];
Int res = n;
Int ok = 1;
Int ng = n + 1;
while (abs(ok - ng) > 1) {
Int mid = (ok + ng) / 2;
if (f(mid, 0)) {
ok = mid;
} else {
ng = mid;
}
}
res -= ok;
if (ok == 1 && !f(1, 0))
res++;
ok = n;
ng = 0;
while (abs(ok - ng) > 1) {
Int mid = (ok + ng) / 2;
if (f(mid, n + 1)) {
ok = mid;
} else {
ng = mid;
}
}
res -= n - ok + 1;
if (ok == n && !f(1, n + 1))
res++;
dump(res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n';
typedef int64_t Int;
Int mod = 1e9 + 7;
Int INF = 1e9 + 18;
Int n, q;
string s;
char t[200001], l[200001];
bool f(Int cur, Int d) {
for (Int i = 0; i < q; i++) {
if (s[cur] == t[i]) {
if (l[i] == 'L') {
cur--;
} else {
cur++;
}
}
}
return cur == d;
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> q;
cin >> s;
s = '.' + s + '.';
for (Int i = 0; i < q; i++)
cin >> t[i] >> l[i];
Int res = n;
Int ok = 1;
Int ng = n + 1;
while (abs(ok - ng) > 1) {
Int mid = (ok + ng) / 2;
if (f(mid, 0)) {
ok = mid;
} else {
ng = mid;
}
}
res -= ok;
if (ok == 1 && !f(1, 0))
res++;
ok = n;
ng = 0;
while (abs(ok - ng) > 1) {
Int mid = (ok + ng) / 2;
if (f(mid, n + 1)) {
ok = mid;
} else {
ng = mid;
}
}
res -= n - ok + 1;
if (ok == n && !f(n, n + 1))
res++;
dump(res);
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 896,639 | 896,640 | u572665222 | cpp |
p03081 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long long INF=(long long)1E17;
#define i_7 (long long)(1e9 + 7)
//#define i_7 998'244'353
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
bool prime_(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
} else {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
long long gcd_(long long a, long long b) {
if (a < b) {
swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd_(b, a % b);
}
}
long long lcm_(long long x, long long y) { return (x / gcd_(x, y)) * y; }
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
char t[q], d[q];
REP(i, q) { cin >> t[i] >> d[i]; }
int l = 0, r = n + 1; //(l,r]:左から落ちない範囲
while (r - l > 1) {
int m = (l + r) / 2;
int now = m;
REP(i, n) {
if (now == 0 || now == n + 1)
break;
if (s[now - 1] == t[i]) {
if (d[i] == 'L') {
now--;
} else {
now++;
}
} else {
continue;
}
}
if (now == 0) {
l = m;
} else {
r = m;
}
}
int left = r;
l = 0, r = n + 1; //[l,r):右から落ちない範囲
while (r - l > 1) {
int m = (l + r) / 2;
int now = m;
REP(i, n) {
if (now == 0 || now == n + 1)
break;
if (s[now - 1] == t[i]) {
if (d[i] == 'L') {
now--;
} else {
now++;
}
} else {
continue;
}
}
if (now == n + 1) {
r = m;
} else {
l = m;
}
}
int right = l;
int ans;
if (left == n + 1) {
ans = 0;
} else if (right == 0) {
ans = 0;
} else if (left > right) {
ans = 0;
} else {
ans = right - left + 1;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long long INF=(long long)1E17;
#define i_7 (long long)(1e9 + 7)
//#define i_7 998'244'353
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
bool prime_(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
} else {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
long long gcd_(long long a, long long b) {
if (a < b) {
swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd_(b, a % b);
}
}
long long lcm_(long long x, long long y) { return (x / gcd_(x, y)) * y; }
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
char t[q], d[q];
REP(i, q) { cin >> t[i] >> d[i]; }
int l = 0, r = n + 1; //(l,r]:左から落ちない範囲
while (r - l > 1) {
int m = (l + r) / 2;
int now = m;
REP(i, q) {
if (now == 0 || now == n + 1)
break;
if (s[now - 1] == t[i]) {
if (d[i] == 'L') {
now--;
} else {
now++;
}
} else {
continue;
}
}
if (now == 0) {
l = m;
} else {
r = m;
}
}
int left = r;
l = 0, r = n + 1; //[l,r):右から落ちない範囲
while (r - l > 1) {
int m = (l + r) / 2;
int now = m;
REP(i, q) {
if (now == 0 || now == n + 1)
break;
if (s[now - 1] == t[i]) {
if (d[i] == 'L') {
now--;
} else {
now++;
}
} else {
continue;
}
}
if (now == n + 1) {
r = m;
} else {
l = m;
}
}
int right = l;
int ans;
if (left == n + 1) {
ans = 0;
} else if (right == 0) {
ans = 0;
} else if (left > right) {
ans = 0;
} else {
ans = right - left + 1;
}
cout << ans << endl;
return 0;
}
| [] | 896,643 | 896,644 | u222293734 | cpp |
p03081 | #include <fstream>
#include <iostream>
#include <string>
using namespace std;
int N, M, solst, soldr;
string s;
struct spell {
char c, d;
} a[200005];
bool Check(int poz, bool dir) {
int i;
for (i = 1; i <= M; i++) {
if (a[i].c == s[poz]) {
if (a[i].d == 'R')
poz++;
else
poz--;
}
if (poz < 0 && dir == 0)
return true;
else if (poz >= N && dir == 0)
return false;
if (poz >= N && dir == 1)
return true;
else if (poz < 0 && dir == 1)
return false;
}
return false;
}
void CautBin(int st, int dr, bool dir) {
int mid = (st + dr) / 2;
if (st == dr && dir == 0 && Check(mid, dir) == 1)
solst = mid;
else if (st == dr && dir == 0 && Check(mid, dir) == 0)
solst = -1;
else if (st == dr && dir == 1 && Check(mid, dir) == 1)
soldr = mid;
else if (st == dr && dir == 1 && Check(mid, dir) == 0)
soldr = N;
else {
if (dir == 0 && Check(mid + 1, dir) == 0)
CautBin(st, mid, dir);
else if (dir == 0)
CautBin(mid + 1, dr, dir);
if (dir == 1 && Check(mid, dir) == 0)
CautBin(mid + 1, dr, dir);
else if (dir == 0)
CautBin(st, mid, dir);
}
}
int main() {
int i;
cin >> N >> M;
cin >> s;
for (i = 1; i <= M; i++) {
cin >> a[i].c >> a[i].d;
}
CautBin(0, N - 1, false);
CautBin(0, N - 1, true);
cout << soldr - solst - 1;
return 0;
} | #include <fstream>
#include <iostream>
#include <string>
using namespace std;
int N, M, solst, soldr;
string s;
struct spell {
char c, d;
} a[200005];
bool Check(int poz, bool dir) {
int i;
for (i = 1; i <= M; i++) {
if (a[i].c == s[poz]) {
if (a[i].d == 'R')
poz++;
else
poz--;
}
if (poz < 0 && dir == 0)
return true;
else if (poz >= N && dir == 0)
return false;
if (poz >= N && dir == 1)
return true;
else if (poz < 0 && dir == 1)
return false;
}
return false;
}
void CautBin(int st, int dr, bool dir) {
int mid = (st + dr) / 2;
if (st == dr && dir == 0 && Check(mid, dir) == 1)
solst = mid;
else if (st == dr && dir == 0 && Check(mid, dir) == 0)
solst = -1;
else if (st == dr && dir == 1 && Check(mid, dir) == 1)
soldr = mid;
else if (st == dr && dir == 1 && Check(mid, dir) == 0)
soldr = N;
else {
if (dir == 0 && Check(mid + 1, dir) == 0)
CautBin(st, mid, dir);
else if (dir == 0)
CautBin(mid + 1, dr, dir);
if (dir == 1 && Check(mid, dir) == 0)
CautBin(mid + 1, dr, dir);
else if (dir == 1)
CautBin(st, mid, dir);
}
}
int main() {
int i;
cin >> N >> M;
cin >> s;
for (i = 1; i <= M; i++) {
cin >> a[i].c >> a[i].d;
}
CautBin(0, N - 1, false);
CautBin(0, N - 1, true);
cout << soldr - solst - 1;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 896,651 | 896,652 | u432635701 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
using P = pair<int, int>;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
ll N, Q;
string s;
vector<char> t, d;
//愚直にシミュレーション
// Xが左に落ちないときtrue
bool checkl(ll X) {
rep(i, Q) {
if (t[i] == s[X]) {
if (d[i] == 'R') {
X++;
} else {
X--;
}
}
if (X == -1) {
return false;
}
}
return true;
}
// Xが右に落ちないときtrue
bool checkr(ll X) {
rep(i, Q) {
if (t[i] == s[X]) {
if (d[i] == 'R') {
X++;
} else {
X--;
}
if (X == N) {
return false;
}
}
}
return true;
}
int main() {
cin >> N >> Q >> s;
t.resize(Q);
d.resize(Q);
rep(i, Q) { cin >> t[i] >> d[i]; }
//左に落ちるとき
ll ng = 0;
ll ok = N;
while (ok - ng > 1) {
ll mid = (ok + ng) / 2;
if (checkl(mid)) {
ok = mid;
} else {
ng = mid;
}
}
ll l = ok;
//右に落ちるとき
ok = -1;
ng = N;
while (ng - ok > 1) {
ll mid = (ok + ng) / 2;
if (checkr(mid)) {
ok = mid;
} else {
ng = mid;
}
}
ll r = ok;
// cerr<<l<<" "<<r<<endl;
cout << r - l + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
using P = pair<int, int>;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
ll N, Q;
string s;
vector<char> t, d;
//愚直にシミュレーション
// Xが左に落ちないときtrue
bool checkl(ll X) {
rep(i, Q) {
if (t[i] == s[X]) {
if (d[i] == 'R') {
X++;
} else {
X--;
}
}
if (X == -1) {
return false;
}
}
return true;
}
// Xが右に落ちないときtrue
bool checkr(ll X) {
rep(i, Q) {
if (t[i] == s[X]) {
if (d[i] == 'R') {
X++;
} else {
X--;
}
if (X == N) {
return false;
}
}
}
return true;
}
int main() {
cin >> N >> Q >> s;
t.resize(Q);
d.resize(Q);
rep(i, Q) { cin >> t[i] >> d[i]; }
//左に落ちるとき
ll ng = -1;
ll ok = N;
while (ok - ng > 1) {
ll mid = (ok + ng) / 2;
if (checkl(mid)) {
ok = mid;
} else {
ng = mid;
}
}
ll l = ok;
//右に落ちるとき
ok = -1;
ng = N;
while (ng - ok > 1) {
ll mid = (ok + ng) / 2;
if (checkr(mid)) {
ok = mid;
} else {
ng = mid;
}
}
ll r = ok;
// cerr<<l<<" "<<r<<endl;
cout << r - l + 1 << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 896,655 | 896,656 | u106297876 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto itr : vec)
cout << itr << ' ';
cout << endl;
}
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
const ll inf = 1e15;
int n, q;
string s;
vector<char> t(200010), d(200010);
bool left(int x) {
int now = x;
rep(i, q) {
if (t[i] == s[now]) {
if (d[i] == 'L')
now--;
else
now++;
}
if (now == -1)
return true;
if (now == n)
break;
}
return false;
}
bool right(int x) {
int now = x;
rep(i, q) {
if (t[i] == s[now]) {
if (d[i] == 'L')
now--;
else
now++;
}
if (now == n)
return true;
if (now == -1)
break;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> q;
cin >> s;
rep(i, q) cin >> t[i] >> d[i];
int high = n, low = 0, mid;
int ans1, ans2;
while (high - low > 1) {
mid = (high + low) / 2;
if (left(mid))
low = mid;
else
high = mid;
}
ans1 = low;
high = n - 1, low = -1;
while (high - low > 1) {
mid = (high + low) / 2;
if (right(mid))
high = mid;
else
low = mid;
}
ans2 = high;
if (ans1 >= ans2)
cout << 0 << endl;
else {
cout << ans2 - ans1 - 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto itr : vec)
cout << itr << ' ';
cout << endl;
}
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
const ll inf = 1e15;
int n, q;
string s;
vector<char> t(200010), d(200010);
bool left(int x) {
int now = x;
rep(i, q) {
if (t[i] == s[now]) {
if (d[i] == 'L')
now--;
else
now++;
}
if (now == -1)
return true;
if (now == n)
break;
}
return false;
}
bool right(int x) {
int now = x;
rep(i, q) {
if (t[i] == s[now]) {
if (d[i] == 'L')
now--;
else
now++;
}
if (now == n)
return true;
if (now == -1)
break;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> q;
cin >> s;
rep(i, q) cin >> t[i] >> d[i];
int high = n, low = -1, mid;
int ans1, ans2;
while (high - low > 1) {
mid = (high + low) / 2;
if (left(mid))
low = mid;
else
high = mid;
}
ans1 = low;
high = n, low = -1;
while (high - low > 1) {
mid = (high + low) / 2;
if (right(mid))
high = mid;
else
low = mid;
}
ans2 = high;
// cout<<ans1<<' '<<ans2<<endl;
if (ans1 >= ans2)
cout << 0 << endl;
else {
cout << ans2 - ans1 - 1 << endl;
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 896,663 | 896,664 | u340010271 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define MAX_T 1001
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1 << 29) // 536870912
const long double PI = acos(-1);
const ll DEP = 1e18;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, Q;
string s;
char t[200002], d[200002];
int binary_search(int x) {
for (int i = 0; i < Q; i++) {
if (s[x] == t[i]) {
if (d[i] == 'R')
x++;
else
x--;
}
if (x == -1)
return -1;
if (x == N)
return 1;
}
return 0;
}
int main() {
cin >> N >> Q;
cin >> s;
vector<int> go(N + 1, -2);
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int l = -1;
int r = N;
int mid;
while (l < r - 1) {
mid = (l + r) / 2;
if (binary_search(mid) == -1)
l = mid;
else
r = mid;
}
int z = 1;
l = -1;
r = N;
while (l < r - 1) {
mid = (l + r) / 2;
if (binary_search(mid) == 1)
r = mid;
else
l = mid;
}
int zz = r;
cout << zz - z - 1 << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define MAX_T 1001
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1 << 29) // 536870912
const long double PI = acos(-1);
const ll DEP = 1e18;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, Q;
string s;
char t[200002], d[200002];
int binary_search(int x) {
for (int i = 0; i < Q; i++) {
if (s[x] == t[i]) {
if (d[i] == 'R')
x++;
else
x--;
}
if (x == -1)
return -1;
if (x == N)
return 1;
}
return 0;
}
int main() {
cin >> N >> Q;
cin >> s;
vector<int> go(N + 1, -2);
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int l = -1;
int r = N;
int mid;
while (l < r - 1) {
mid = (l + r) / 2;
if (binary_search(mid) == -1)
l = mid;
else
r = mid;
}
int z = l;
l = -1;
r = N;
while (l < r - 1) {
mid = (l + r) / 2;
if (binary_search(mid) == 1)
r = mid;
else
l = mid;
}
int zz = r;
cout << zz - z - 1 << endl;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 896,689 | 896,690 | u342051078 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1 << 29) // 536870912
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, Q;
string s;
char t[200020], d[200020];
int check(int x) {
for (int i = 0; i < Q; i++) {
if (s[x] == t[i]) {
if (d[i] == 'R')
x++;
if (d[i] == 'L')
x--;
}
if (x == -1)
return -1;
if (x == N)
return 1;
}
return 0;
}
int main() {
cin >> N >> Q;
cin >> s;
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int l = -1;
int r = N;
int mid;
while (l <= r - 2) {
mid = (l + r) / 2;
if (check(mid) == -1)
l = mid;
else
r = mid;
}
int z = l;
l = -1;
r = N;
while (l < r - 1) {
mid = (l + r) / 2;
if (check(mid) == -1)
l = mid;
else
r = mid;
}
int zz = r;
cout << zz - z - 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1 << 29) // 536870912
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, Q;
string s;
char t[200020], d[200020];
int check(int x) {
for (int i = 0; i < Q; i++) {
if (s[x] == t[i]) {
if (d[i] == 'R')
x++;
if (d[i] == 'L')
x--;
}
if (x == -1)
return -1;
if (x == N)
return 1;
}
return 0;
}
int main() {
cin >> N >> Q;
cin >> s;
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int l = -1;
int r = N;
int mid;
while (l <= r - 2) {
mid = (l + r) / 2;
if (check(mid) == -1)
l = mid;
else
r = mid;
}
int z = l;
l = -1;
r = N;
while (l < r - 1) {
mid = (l + r) / 2;
if (check(mid) == 1)
r = mid;
else
l = mid;
}
int zz = r;
cout << zz - z - 1 << endl;
}
| [
"expression.operation.unary.arithmetic.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 896,691 | 896,692 | u342051078 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1 << 29) // 536870912
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
ll n, q;
string s;
char t[200020], d[200020];
int solt(ll x) {
for (int i = 0; i < q; i++) {
if (s[x] == t[i]) {
if (d[i] == 'L')
x--;
if (d[i] == 'R')
x++;
}
if (x == -1)
return 1;
if (x == n)
return 2;
}
return 0;
}
int main() {
cin >> n >> q >> s;
for (int i = 0; i < q; i++) {
cin >> t[i] >> d[i];
}
ll mid;
ll ls = -1;
ll rs = n;
while (ls < rs - 1) {
mid = (ls + rs) / 2;
if (solt(mid) == 1)
ls = mid;
else
rs = mid;
}
ll lt = -1;
ll rt = n;
while (lt < ls - 1) {
mid = (lt + rs) / 2;
if (solt(mid) == 2)
rt = mid;
else
lt = mid;
}
cout << rt - ls - 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1 << 29) // 536870912
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
ll n, q;
string s;
char t[200020], d[200020];
int solt(ll x) {
for (int i = 0; i < q; i++) {
if (s[x] == t[i]) {
if (d[i] == 'L')
x--;
if (d[i] == 'R')
x++;
}
if (x == -1)
return 1;
if (x == n)
return 2;
}
return 0;
}
int main() {
cin >> n >> q >> s;
for (int i = 0; i < q; i++) {
cin >> t[i] >> d[i];
}
ll mid;
ll ls = -1;
ll rs = n;
while (ls < rs - 1) {
mid = (ls + rs) / 2;
if (solt(mid) == 1)
ls = mid;
else
rs = mid;
}
ll lt = -1;
ll rt = n;
while (lt < rt - 1) {
mid = (lt + rt) / 2;
if (solt(mid) == 2)
rt = mid;
else
lt = mid;
}
cout << rt - ls - 1 << endl;
return 0;
}
| [
"identifier.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 896,693 | 896,694 | u342051078 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<char> t(q);
vector<char> d(q);
for (int i = 0; i < q; i++) {
cin >> t[i] >> d[i];
}
int ll = 0, lr = n;
int rl = 0, rr = n;
while (ll < lr) {
int m = (lr + ll + 1) / 2;
int md = m;
bool v = false;
for (int i = 0; i < q; i++) {
if (t[i] != s[md])
continue;
if (d[i] == 'L')
md--;
if (d[i] == 'R')
md++;
if (md <= -1 || md >= n) {
v = (md <= -1);
break;
}
}
if (v) {
ll = m;
} else {
lr = m - 1;
}
// cout << ll << " " << lr << " " << m << endl;
}
while (rl < rr) {
int m = (rr + rl) / 2;
int md = m;
bool v = false;
for (int i = 0; i < q; i++) {
if (t[i] != s[md])
continue;
if (d[i] == 'L')
md--;
if (d[i] == 'R')
md++;
if (md == -1 || md >= n) {
v = (md >= n);
break;
}
}
if (v) {
rr = m;
} else {
rl = m + 1;
}
// cout << rl << " " << rr << " " << m << endl;
}
cout << rl - ll - 1 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<char> t(q);
vector<char> d(q);
for (int i = 0; i < q; i++) {
cin >> t[i] >> d[i];
}
int ll = -1, lr = n - 1;
int rl = 0, rr = n;
while (ll < lr) {
int m = (lr + ll + 1) / 2;
int md = m;
bool v = false;
for (int i = 0; i < q; i++) {
if (t[i] != s[md])
continue;
if (d[i] == 'L')
md--;
if (d[i] == 'R')
md++;
if (md <= -1 || md >= n) {
v = (md <= -1);
break;
}
}
if (v) {
ll = m;
} else {
lr = m - 1;
}
// cout << ll << " " << lr << " " << m << endl;
}
while (rl < rr) {
int m = (rr + rl) / 2;
int md = m;
bool v = false;
for (int i = 0; i < q; i++) {
if (t[i] != s[md])
continue;
if (d[i] == 'L')
md--;
if (d[i] == 'R')
md++;
if (md == -1 || md >= n) {
v = (md >= n);
break;
}
}
if (v) {
rr = m;
} else {
rl = m + 1;
}
// cout << rl << " " << rr << " " << m << endl;
}
cout << rl - ll - 1 << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 896,706 | 896,707 | u769062455 | cpp |
p03081 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define sz(c) ((int)(c).size())
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
const int MAX = 2e5 + 5;
int main() {
int N, Q;
cin >> N >> Q;
char s[MAX], t[MAX], d[MAX];
s[0] = '0', s[N + 1] = '0';
rep1(i, N) cin >> s[i];
rep1(i, Q) cin >> t[i] >> d[i];
int x = 0, y = N + 1;
for (int i = Q; i >= 1; i--) {
if (s[x + 1] == t[i] && d[i] == 'L')
x++;
if (s[x] == t[i] && d[i] == 'R')
x--;
if (s[y - 1] == t[i] && d[i] == 'R')
y--;
if (s[y - 1] == t[i] && d[i] == 'L')
y++;
}
cout << max(0, y - x - 1) << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define sz(c) ((int)(c).size())
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
const int MAX = 2e5 + 5;
int main() {
int N, Q;
cin >> N >> Q;
char s[MAX], t[MAX], d[MAX];
s[0] = '0', s[N + 1] = '0';
rep1(i, N) cin >> s[i];
rep1(i, Q) cin >> t[i] >> d[i];
int x = 0, y = N + 1;
for (int i = Q; i >= 1; i--) {
if (s[x + 1] == t[i] && d[i] == 'L')
x++;
if (s[x] == t[i] && d[i] == 'R')
x--;
if (s[y - 1] == t[i] && d[i] == 'R')
y--;
if (s[y] == t[i] && d[i] == 'L')
y++;
}
cout << max(0, y - x - 1) << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 896,710 | 896,711 | u228214259 | cpp |
p03081 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define sz(c) ((int)(c).size())
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
const int MAX = 2e5 + 5;
int main() {
int N, Q;
cin >> N >> Q;
char s[MAX], t[MAX], d[MAX];
s[0] = '0', s[N + 1] = '0';
rep1(i, N) cin >> s[i];
rep1(i, Q) cin >> t[i] >> d[i];
int x = 0, y = N + 1;
for (int i = Q; i >= 1; i--) {
if (s[x + 1] == t[i] && d[i] == 'L')
x++;
if (s[x] == t[i] && d[i] == 'R')
x--;
if (s[y - 1] == t[i] && d[i] == 'R')
y--;
if (s[y - 1] == t[i] && d[i] == 'R')
y++;
}
cout << max(0, y - x - 1) << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define sz(c) ((int)(c).size())
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
const int MAX = 2e5 + 5;
int main() {
int N, Q;
cin >> N >> Q;
char s[MAX], t[MAX], d[MAX];
s[0] = '0', s[N + 1] = '0';
rep1(i, N) cin >> s[i];
rep1(i, Q) cin >> t[i] >> d[i];
int x = 0, y = N + 1;
for (int i = Q; i >= 1; i--) {
if (s[x + 1] == t[i] && d[i] == 'L')
x++;
if (s[x] == t[i] && d[i] == 'R')
x--;
if (s[y - 1] == t[i] && d[i] == 'R')
y--;
if (s[y] == t[i] && d[i] == 'L')
y++;
}
cout << max(0, y - x - 1) << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 896,712 | 896,711 | u228214259 | cpp |
p03081 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
template <typename T> 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);
}
#define ARRAY_MAX 5005
const ll INF = 1e9 + 7;
struct circle {
double x;
double y;
double r;
};
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};
const ll MOD = 1e9 + 7;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<char> c(q), t(q);
for (int i = 0; i < q; i++) {
cin >> c[i] >> t[i];
}
int ng = -1;
int ok = n - 1;
while (ok - ng > 1) {
int mid = (ok + ng) / 2; //ここまでは左に落ちる
int idx = mid;
bool flag = false;
for (int i = 0; i < q; i++) {
if (s[idx] == c[i]) {
if (t[i] == 'L') {
idx--;
} else {
idx++;
}
}
if (idx < 0) {
flag = true;
break;
}
if (idx >= n) {
flag = false;
break;
}
}
if (flag) {
ng = mid;
} else {
ok = mid;
}
}
int ng2 = -1;
int ok2 = n - 1;
while (ok2 - ng2 > 1) {
int mid = (ok2 + ng2) / 2; //ここまでは左に落ちる
int idx = mid;
bool flag = false;
for (int i = 0; i < q; i++) {
if (s[idx] == c[i]) {
if (t[i] == 'L') {
idx--;
} else {
idx++;
}
}
if (idx < 0) {
flag = false;
break;
}
if (idx >= n) {
flag = true;
break;
}
}
if (flag) {
ok2 = mid;
} else {
ng2 = mid;
}
}
cout << ok2 - ok << endl;
return 0;
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
template <typename T> 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);
}
#define ARRAY_MAX 5005
const ll INF = 1e9 + 7;
struct circle {
double x;
double y;
double r;
};
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};
const ll MOD = 1e9 + 7;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<char> c(q), t(q);
for (int i = 0; i < q; i++) {
cin >> c[i] >> t[i];
}
int ng = -1;
int ok = n;
while (ok - ng > 1) {
int mid = (ok + ng) / 2; //ここまでは左に落ちる
int idx = mid;
bool flag = false;
for (int i = 0; i < q; i++) {
if (s[idx] == c[i]) {
if (t[i] == 'L') {
idx--;
} else {
idx++;
}
}
if (idx < 0) {
flag = true;
break;
}
if (idx >= n) {
flag = false;
break;
}
}
if (flag) {
ng = mid;
} else {
ok = mid;
}
}
int ng2 = -1;
int ok2 = n;
while (ok2 - ng2 > 1) {
int mid = (ok2 + ng2) / 2; //ここまでは左に落ちる
int idx = mid;
bool flag = false;
for (int i = 0; i < q; i++) {
if (s[idx] == c[i]) {
if (t[i] == 'L') {
idx--;
} else {
idx++;
}
}
if (idx < 0) {
flag = false;
break;
}
if (idx >= n) {
flag = true;
break;
}
}
if (flag) {
ok2 = mid;
} else {
ng2 = mid;
}
}
cout << ok2 - ok << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 896,719 | 896,720 | u504142483 | cpp |
p03081 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, Q, ansL, ansR, L, R;
string S;
static pair<char, char> A[200000];
cin >> N >> Q >> S;
for (int i = 0; i < Q; i++) {
cin >> A[i].first >> A[i].second;
}
L = 0, R = N;
while (R - L > 1) {
int mid = (L + R) / 2, G = mid;
bool check = true;
for (int i = 0; i < Q; i++) {
if (S[G] == A[i].first) {
if (A[i].second == 'L')
G--;
else
G++;
}
if (G < 0) {
check = false;
break;
}
if (G >= N) {
break;
}
}
if (check)
R = mid;
else
L = mid + 1;
}
ansL = R;
L = 0, R = N;
while (R - L > 1) {
int mid = (L + R) / 2, G = mid;
bool check = true;
for (int i = 0; i < Q; i++) {
if (S[G] == A[i].first) {
if (A[i].second == 'L')
G--;
else
G++;
}
if (G >= N) {
check = false;
break;
}
if (G < 0) {
break;
}
}
if (check)
L = mid + 1;
else
R = mid;
}
ansR = L;
cout << ansR - ansL + 1;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, Q, ansL, ansR, L, R;
string S;
static pair<char, char> A[200000];
cin >> N >> Q >> S;
for (int i = 0; i < Q; i++) {
cin >> A[i].first >> A[i].second;
}
L = 0, R = N;
while (R - L > 0) {
int mid = (L + R) / 2, G = mid;
bool check = true;
for (int i = 0; i < Q; i++) {
if (S[G] == A[i].first) {
if (A[i].second == 'L')
G--;
else
G++;
}
if (G < 0) {
check = false;
break;
}
if (G >= N) {
break;
}
}
if (check)
R = mid;
else
L = mid + 1;
}
ansL = R;
L = 0, R = N;
while (R - L > 0) {
int mid = (L + R) / 2, G = mid;
bool check = true;
for (int i = 0; i < Q; i++) {
if (S[G] == A[i].first) {
if (A[i].second == 'L')
G--;
else
G++;
}
if (G >= N) {
check = false;
break;
}
if (G < 0) {
break;
}
}
if (check)
L = mid + 1;
else
R = mid;
}
ansR = L;
cout << ansR - ansL;
} | [
"literal.number.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 896,725 | 896,726 | u454087021 | cpp |
p03081 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
const int MX = 200005;
#define RET(ans) \
{ \
cout << ans << endl; \
return 0; \
}
// 二次元ベクターの基本
/*
vector<vector<int>> dp; // 宣言
dp.resize(n); // 1次元めの要素数決定
dp[i].push_back(int); // プッシュバック
rep(i,n){
sort(dp[i].begin(),dp[i].end()); // 二次元めを昇順ソート
}
*/
// 整数スキャン（複数）
/*
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s; cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s; cin >> s;
slist.push_back(s);
}
*/
int syori(int x, int q, string s, char t[], char d[]) {
rep(i, s.size()) {
if (s[x] == t[i]) {
if (d[i] == 'L') {
x--;
} else {
x++;
}
if (x == -1) {
return 1;
}
if (x == s.size()) {
return 3;
}
}
}
return 2;
}
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
char t[q];
char d[q];
rep(i, q) { cin >> t[i] >> d[i]; }
int a[n];
// -1:uncertain 1:fall left 2:stand 3:fall right
rep(i, n) { a[i] = -1; }
int l = 0;
int r = n - 1;
while (true) {
if (a[(l + r) / 2] == -1) {
a[(l + r) / 2] = syori((l + r) / 2, q, s, t, d);
if (a[(l + r) / 2] == 1) {
rep(i, (l + r) / 2) { a[i] = 1; }
l = (l + r) / 2 + 1;
}
if (a[(l + r) / 2] == 3) {
srep(i, (l + r) / 2, n) { a[i] = 3; }
r = (l + r) / 2 - 1;
}
if (a[(l + r) / 2] == 2) {
r = (l + r) / 2 - 1;
}
} else {
break;
}
}
l = 0;
r = n - 1;
while (a[l] == 1 || a[l] == 2) {
l++;
}
while (true) {
a[(l + r) / 2] = syori((l + r) / 2, q, s, t, d);
if (a[(l + r) / 2] == 2) {
l = (l + r) / 2 + 1;
}
if (a[(l + r) / 2] == 3) {
srep(i, (l + r) / 2, n) { a[i] = 3; }
r = (l + r) / 2 - 1;
}
if (r < l)
break;
}
int ans = n;
rep(i, n) {
if (a[i] == 1 || a[i] == 3)
ans--;
}
/*
rep(i,n){
cout << a[i];
}
cout << endl;
*/
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
const int MX = 200005;
#define RET(ans) \
{ \
cout << ans << endl; \
return 0; \
}
// 二次元ベクターの基本
/*
vector<vector<int>> dp; // 宣言
dp.resize(n); // 1次元めの要素数決定
dp[i].push_back(int); // プッシュバック
rep(i,n){
sort(dp[i].begin(),dp[i].end()); // 二次元めを昇順ソート
}
*/
// 整数スキャン（複数）
/*
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s; cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s; cin >> s;
slist.push_back(s);
}
*/
int syori(int x, int q, string s, char t[], char d[]) {
rep(i, q) {
if (s[x] == t[i]) {
if (d[i] == 'L') {
x--;
} else {
x++;
}
if (x == -1) {
return 1;
}
if (x == s.size()) {
return 3;
}
}
}
return 2;
}
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
char t[q];
char d[q];
rep(i, q) { cin >> t[i] >> d[i]; }
int a[n];
// -1:uncertain 1:fall left 2:stand 3:fall right
rep(i, n) { a[i] = -1; }
int l = 0;
int r = n - 1;
while (true) {
if (a[(l + r) / 2] == -1) {
a[(l + r) / 2] = syori((l + r) / 2, q, s, t, d);
if (a[(l + r) / 2] == 1) {
rep(i, (l + r) / 2) { a[i] = 1; }
l = (l + r) / 2 + 1;
}
if (a[(l + r) / 2] == 3) {
srep(i, (l + r) / 2, n) { a[i] = 3; }
r = (l + r) / 2 - 1;
}
if (a[(l + r) / 2] == 2) {
r = (l + r) / 2 - 1;
}
} else {
break;
}
}
l = 0;
r = n - 1;
while (a[l] == 1 || a[l] == 2) {
l++;
}
while (true) {
a[(l + r) / 2] = syori((l + r) / 2, q, s, t, d);
if (a[(l + r) / 2] == 2) {
l = (l + r) / 2 + 1;
}
if (a[(l + r) / 2] == 3) {
srep(i, (l + r) / 2, n) { a[i] = 3; }
r = (l + r) / 2 - 1;
}
if (r < l)
break;
}
int ans = n;
rep(i, n) {
if (a[i] == 1 || a[i] == 3)
ans--;
}
/*
rep(i,n){
cout << a[i];
}
cout << endl;
*/
cout << ans << endl;
return 0;
}
| [
"call.arguments.change",
"call.remove"
] | 896,738 | 896,739 | u791593901 | cpp |
p03081 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
const int MX = 200005;
#define RET(ans) \
{ \
cout << ans << endl; \
return 0; \
}
// 二次元ベクターの基本
/*
vector<vector<int>> dp; // 宣言
dp.resize(n); // 1次元めの要素数決定
dp[i].push_back(int); // プッシュバック
rep(i,n){
sort(dp[i].begin(),dp[i].end()); // 二次元めを昇順ソート
}
*/
// 整数スキャン（複数）
/*
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s; cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s; cin >> s;
slist.push_back(s);
}
*/
int syori(int x, int q, string s, char t[], char d[]) {
rep(i, s.size()) {
if (s[x] == t[i]) {
if (d[i] == 'L') {
x--;
} else {
x++;
}
if (x == -1) {
return 1;
}
if (x == s.size()) {
return 3;
}
}
}
return 2;
}
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
char t[q];
char d[q];
rep(i, q) { cin >> t[i] >> d[i]; }
int a[n];
// -1:uncertain 1:fall left 2:stand 3:fall right
rep(i, n) { a[i] = -1; }
int l = 0;
int r = n - 1;
while (true) {
if (a[(l + r) / 2] == -1) {
a[(l + r) / 2] = syori((l + r) / 2, q, s, t, d);
if (a[(l + r) / 2] == 1) {
rep(i, (l + r) / 2) { a[i] = 1; }
l = (l + r) / 2 + 1;
}
if (a[(l + r) / 2] == 3) {
srep(i, (l + r) / 2, n) { a[i] = 3; }
r = (l + r) / 2 - 1;
}
if (a[(l + r) / 2] == 2) {
r = (l + r) / 2 - 1;
}
} else {
break;
}
}
l = 0;
r = n - 1;
while (a[l] == 1 || a[l] == 2) {
l++;
}
while (true) {
a[(l + r) / 2] = syori((l + r) / 2, q, s, t, d);
if (a[(l + r) / 2] == 2) {
l = (l + r) / 2 + 1;
}
if (a[(l + r) / 2] == 3) {
srep(i, (l + r) / 2, n) { a[i] == 3; }
r = (l + r) / 2 - 1;
}
if (r < l)
break;
}
int ans = n;
rep(i, n) {
if (a[i] == 1 || a[i] == 3)
ans--;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
const int MX = 200005;
#define RET(ans) \
{ \
cout << ans << endl; \
return 0; \
}
// 二次元ベクターの基本
/*
vector<vector<int>> dp; // 宣言
dp.resize(n); // 1次元めの要素数決定
dp[i].push_back(int); // プッシュバック
rep(i,n){
sort(dp[i].begin(),dp[i].end()); // 二次元めを昇順ソート
}
*/
// 整数スキャン（複数）
/*
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s; cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s; cin >> s;
slist.push_back(s);
}
*/
int syori(int x, int q, string s, char t[], char d[]) {
rep(i, q) {
if (s[x] == t[i]) {
if (d[i] == 'L') {
x--;
} else {
x++;
}
if (x == -1) {
return 1;
}
if (x == s.size()) {
return 3;
}
}
}
return 2;
}
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
char t[q];
char d[q];
rep(i, q) { cin >> t[i] >> d[i]; }
int a[n];
// -1:uncertain 1:fall left 2:stand 3:fall right
rep(i, n) { a[i] = -1; }
int l = 0;
int r = n - 1;
while (true) {
if (a[(l + r) / 2] == -1) {
a[(l + r) / 2] = syori((l + r) / 2, q, s, t, d);
if (a[(l + r) / 2] == 1) {
rep(i, (l + r) / 2) { a[i] = 1; }
l = (l + r) / 2 + 1;
}
if (a[(l + r) / 2] == 3) {
srep(i, (l + r) / 2, n) { a[i] = 3; }
r = (l + r) / 2 - 1;
}
if (a[(l + r) / 2] == 2) {
r = (l + r) / 2 - 1;
}
} else {
break;
}
}
l = 0;
r = n - 1;
while (a[l] == 1 || a[l] == 2) {
l++;
}
while (true) {
a[(l + r) / 2] = syori((l + r) / 2, q, s, t, d);
if (a[(l + r) / 2] == 2) {
l = (l + r) / 2 + 1;
}
if (a[(l + r) / 2] == 3) {
srep(i, (l + r) / 2, n) { a[i] = 3; }
r = (l + r) / 2 - 1;
}
if (r < l)
break;
}
int ans = n;
rep(i, n) {
if (a[i] == 1 || a[i] == 3)
ans--;
}
/*
rep(i,n){
cout << a[i];
}
cout << endl;
*/
cout << ans << endl;
return 0;
}
| [
"call.arguments.change",
"call.remove",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 896,740 | 896,739 | u791593901 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define MOD ((int)1e9 + 7)
#define endl "\n"
#define yn(f) ((f) ? "Yes" : "No")
#define YN(f) ((f) ? "YES" : "NO")
#define MAX 210000
int N, Q;
vector<pair<char, char>> golem;
string s;
int check(int num) {
if (num >= N)
return 1;
else if (num < 0)
return -1;
for (int i = 0; i < Q; i++) {
if (s[num] == golem[i].first) {
if (golem[i].second == 'R')
num++;
else
num--;
}
// cout<<num<<" ";
if (num >= N)
return 1;
if (num < 0)
return -1;
}
return 0;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
char t, d;
cin >> N >> Q;
cin >> s;
for (int i = 0; i < Q; i++) {
cin >> t >> d;
golem.push_back(make_pair(t, d));
}
int low = -1, high = N + 1, m, ans = 0;
// for(int i = 0; i < N; i++){
// cout<<"i = "<<i<<" "<<check(i)<<endl;
// }
while (low + 1 < high) {
m = (low + high) / 2;
// cout<<low<<" h "<<m<<" l "<<high<<endl;
if (check(m) == -1)
low = m + 1;
else
high = m;
}
ans = m;
low = -1, high = N + 1;
while (low + 1 < high) {
m = (low + high) / 2;
if (check(m) != 1)
low = m;
else
high = m;
}
// cout<<ans<<" "<<N-m<<endl;
ans = N - (ans + N - m);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define MOD ((int)1e9 + 7)
#define endl "\n"
#define yn(f) ((f) ? "Yes" : "No")
#define YN(f) ((f) ? "YES" : "NO")
#define MAX 210000
int N, Q;
vector<pair<char, char>> golem;
string s;
int check(int num) {
if (num >= N)
return 1;
else if (num < 0)
return -1;
for (int i = 0; i < Q; i++) {
if (s[num] == golem[i].first) {
if (golem[i].second == 'R')
num++;
else
num--;
}
// cout<<num<<" ";
if (num >= N)
return 1;
if (num < 0)
return -1;
}
return 0;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
char t, d;
cin >> N >> Q;
cin >> s;
for (int i = 0; i < Q; i++) {
cin >> t >> d;
golem.push_back(make_pair(t, d));
}
int low = -1, high = N + 1, m, ans = 0;
// for(int i = 0; i < N; i++){
// cout<<"i = "<<i<<" "<<check(i)<<endl;
// }
while (low + 1 < high) {
m = (low + high) / 2;
if (check(m) == -1)
low = m;
else
high = m;
}
ans = high;
low = -1, high = N + 1;
while (low + 1 < high) {
m = (low + high) / 2;
if (check(m) != 1)
low = m;
else
high = m;
}
// cout<<ans<<" "<<N-high<<endl;
ans = N - (ans + N - high);
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 896,749 | 896,750 | u233393801 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define MOD ((int)1e9 + 7)
#define endl "\n"
#define yn(f) ((f) ? "Yes" : "No")
#define YN(f) ((f) ? "YES" : "NO")
#define MAX 210000
int N, Q;
vector<pair<char, char>> golem;
string s;
int check(int num) {
if (num >= N)
return 1;
else if (num < 0)
return -1;
for (int i = 0; i < Q; i++) {
if (s[num] == golem[i].first) {
if (golem[i].second == 'R')
num++;
else
num--;
}
// cout<<num<<" ";
if (num >= N)
return 1;
if (num < 0)
return -1;
}
return 0;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
char t, d;
cin >> N >> Q;
cin >> s;
for (int i = 0; i < Q; i++) {
cin >> t >> d;
golem.push_back(make_pair(t, d));
}
int low = -1, high = N + 1, m, ans = 0;
// for(int i = 0; i < N; i++){
// cout<<"i = "<<i<<" "<<check(i)<<endl;
// }
while (low + 1 < high) {
m = (low + high) / 2;
if (check(m) == -1)
low = m;
else
high = m;
}
ans = m;
low = -1, high = N + 1;
while (low + 1 < high) {
m = (low + high) / 2;
if (check(m) != 1)
low = m;
else
high = m;
}
// cout<<ans<<" "<<N-m<<endl;
ans = N - (ans + N - m);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define MOD ((int)1e9 + 7)
#define endl "\n"
#define yn(f) ((f) ? "Yes" : "No")
#define YN(f) ((f) ? "YES" : "NO")
#define MAX 210000
int N, Q;
vector<pair<char, char>> golem;
string s;
int check(int num) {
if (num >= N)
return 1;
else if (num < 0)
return -1;
for (int i = 0; i < Q; i++) {
if (s[num] == golem[i].first) {
if (golem[i].second == 'R')
num++;
else
num--;
}
// cout<<num<<" ";
if (num >= N)
return 1;
if (num < 0)
return -1;
}
return 0;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
char t, d;
cin >> N >> Q;
cin >> s;
for (int i = 0; i < Q; i++) {
cin >> t >> d;
golem.push_back(make_pair(t, d));
}
int low = -1, high = N + 1, m, ans = 0;
// for(int i = 0; i < N; i++){
// cout<<"i = "<<i<<" "<<check(i)<<endl;
// }
while (low + 1 < high) {
m = (low + high) / 2;
if (check(m) == -1)
low = m;
else
high = m;
}
ans = high;
low = -1, high = N + 1;
while (low + 1 < high) {
m = (low + high) / 2;
if (check(m) != 1)
low = m;
else
high = m;
}
// cout<<ans<<" "<<N-high<<endl;
ans = N - (ans + N - high);
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 896,751 | 896,750 | u233393801 | cpp |
p03081 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define MOD 1000000007
#define INF 1ll << 30
#define MAX 100010
#define eps 1e-11
#define bit_max 1ll << 32
#define _USE_MATH_DEFINES
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n, q;
cin >> n >> q;
string s;
cin >> s;
string c, d;
c = "";
d = "";
for (int i = 0; i < q; i++) {
char cc, dd;
cin >> cc >> dd;
c += cc;
d += dd;
}
int l = -1, r = n;
int mid = l + ((r - l) / 2);
int l_max = -1;
for (int i = 0; i < 80; i++) {
if (l + 1 < r) {
mid = l + ((r - l) / 2);
int index = mid;
char val = s[index];
bool reached = false;
for (int j = 0; j < q; j++) {
if (c[j] == val && d[j] == 'L') {
index--;
} else if (c[j] == val && d[j] == 'R') {
index++;
}
if (index == -1) {
reached = true;
break;
} else if (index == n)
break;
val = s[index];
}
if (reached) {
l = mid;
l_max = mid;
} else
r = mid;
} else {
break;
}
}
l = -1, r = n;
mid = l + ((r - l) / 2);
int r_max = n;
for (int i = 0; i < 80; i++) {
if (l + 1 < r) {
mid = l + ((r - l) / 2);
int index = mid;
char val = s[index];
bool reached = false;
for (int j = 0; j < q; j++) {
if (c[j] == val && d[j] == 'L') {
index--;
} else if (c[j] == val && d[j] == 'R') {
index++;
}
if (index == n) {
reached = true;
break;
} else if (index == -1)
break;
val = s[index];
}
if (reached) {
r = mid;
r_max = mid;
} else
l = mid + 1;
} else {
break;
}
}
l_max++;
r_max--;
cout << max(0, r_max - l_max + 1);
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define MOD 1000000007
#define INF 1ll << 30
#define MAX 100010
#define eps 1e-11
#define bit_max 1ll << 32
#define _USE_MATH_DEFINES
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n, q;
cin >> n >> q;
string s;
cin >> s;
string c, d;
c = "";
d = "";
for (int i = 0; i < q; i++) {
char cc, dd;
cin >> cc >> dd;
c += cc;
d += dd;
}
int l = -1, r = n;
int mid = l + ((r - l) / 2);
int l_max = -1;
for (int i = 0; i < 80; i++) {
if (l + 1 < r) {
mid = l + ((r - l) / 2);
int index = mid;
char val = s[index];
bool reached = false;
for (int j = 0; j < q; j++) {
if (c[j] == val && d[j] == 'L') {
index--;
} else if (c[j] == val && d[j] == 'R') {
index++;
}
if (index == -1) {
reached = true;
break;
} else if (index == n)
break;
val = s[index];
}
if (reached) {
l = mid;
l_max = mid;
} else
r = mid;
} else {
break;
}
}
l = -1, r = n;
mid = l + ((r - l) / 2);
int r_max = n;
for (int i = 0; i < 80; i++) {
if (l + 1 < r) {
mid = l + ((r - l) / 2);
int index = mid;
char val = s[index];
bool reached = false;
for (int j = 0; j < q; j++) {
if (c[j] == val && d[j] == 'L') {
index--;
} else if (c[j] == val && d[j] == 'R') {
index++;
}
if (index == n) {
reached = true;
break;
} else if (index == -1)
break;
val = s[index];
}
if (reached) {
r = mid;
r_max = mid;
} else
l = mid;
} else {
break;
}
}
l_max++;
r_max--;
cout << max(0, r_max - l_max + 1);
return 0;
} | [
"expression.operation.binary.remove"
] | 896,754 | 896,755 | u566864240 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
long long n, q, l, r;
string s;
char t[1000000], d[1000000];
int main() {
cin >> n >> q >> s;
for (int i = 0; i < q; i++) {
cin >> t[i] >> d[i];
}
l = -1;
r = n;
for (int i = q - 1; i >= 0; i--) {
if (d[i] == 'L') {
if (l + 1 < n && s[l + 1] == t[i])
l++;
} else {
if (l >= 0 && s[l] == t[i])
l--;
}
}
for (int i = q - 1; i >= 0; i--) {
if (d[i] == 'R') {
if (r - 1 >= 0 && s[r - 1] == t[i])
r--;
} else {
if (l < n && s[r] == t[i])
l++;
}
}
cout << max(r - l - 1ll, 0ll) << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, q, l, r;
string s;
char t[1000000], d[1000000];
int main() {
cin >> n >> q >> s;
for (int i = 0; i < q; i++) {
cin >> t[i] >> d[i];
}
l = -1;
r = n;
for (int i = q - 1; i >= 0; i--) {
if (d[i] == 'L') {
if (l + 1 < n && s[l + 1] == t[i])
l++;
} else {
if (l >= 0 && s[l] == t[i])
l--;
}
}
for (int i = q - 1; i >= 0; i--) {
if (d[i] == 'R') {
if (r - 1 >= 0 && s[r - 1] == t[i])
r--;
} else {
if (l < n && s[r] == t[i])
r++;
}
}
cout << max(r - l - 1ll, 0ll) << "\n";
return 0;
}
| [
"identifier.change"
] | 896,760 | 896,761 | u036145426 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typedef long long ll;
const int INF = 1000000000;
const int MOD = 1000000007;
int main(int argc, char const *argv[]) {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<ll> a(x), b(y), c(z);
rep(i, a.size()) cin >> a[i];
rep(i, b.size()) cin >> b[i];
rep(i, c.size()) cin >> c[i];
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
vector<ll> sum;
rep(i, a.size()) {
rep(j, b.size()) {
rep(k, c.size()) {
if ((i + 1) + (j + 1) + (k + 1) <= K)
sum.push_back(a[i] + b[j] + c[k]);
else
break;
}
}
}
sort(all(sum), greater<ll>());
rep(i, K) cout << sum[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typedef long long ll;
const int INF = 1000000000;
const int MOD = 1000000007;
int main(int argc, char const *argv[]) {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<ll> a(x), b(y), c(z);
rep(i, a.size()) cin >> a[i];
rep(i, b.size()) cin >> b[i];
rep(i, c.size()) cin >> c[i];
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
vector<ll> sum;
rep(i, a.size()) rep(j, b.size()) rep(k, c.size()) {
if ((i + 1) * (j + 1) * (k + 1) <= K)
sum.push_back(a[i] + b[j] + c[k]);
else
break;
}
sort(all(sum), greater<ll>());
rep(i, K) cout << sum[i] << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 896,768 | 896,769 | u569778242 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typedef long long ll;
const int INF = 1000000000;
const int MOD = 1000000007;
int main(int argc, char const *argv[]) {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<ll> a(x), b(y), c(z);
rep(i, a.size()) cin >> a[i];
rep(i, b.size()) cin >> b[i];
rep(i, c.size()) cin >> c[i];
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
vector<ll> sum;
rep(i, a.size()) rep(j, b.size()) rep(k, c.size()) {
if ((i + 1) + (j + 1) + (k + 1) <= K)
sum.push_back(a[i] + b[j] + c[k]);
else
break;
}
sort(all(sum), greater<ll>());
rep(i, K) cout << sum[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typedef long long ll;
const int INF = 1000000000;
const int MOD = 1000000007;
int main(int argc, char const *argv[]) {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<ll> a(x), b(y), c(z);
rep(i, a.size()) cin >> a[i];
rep(i, b.size()) cin >> b[i];
rep(i, c.size()) cin >> c[i];
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
vector<ll> sum;
rep(i, a.size()) rep(j, b.size()) rep(k, c.size()) {
if ((i + 1) * (j + 1) * (k + 1) <= K)
sum.push_back(a[i] + b[j] + c[k]);
else
break;
}
sort(all(sum), greater<ll>());
rep(i, K) cout << sum[i] << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 896,770 | 896,769 | u569778242 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vll A, B, C;
for (int i = 0; i < X; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < Y; ++i) {
ll b;
cin >> b;
B.push_back(b);
}
for (int i = 0; i < Z; ++i) {
ll c;
cin >> c;
C.push_back(c);
}
sort(A.begin(), A.end(), greater<ll>());
sort(B.begin(), B.end(), greater<ll>());
sort(C.begin(), C.end(), greater<ll>());
vll D;
for (int i = 0; i < X; ++i) {
for (int j = 0; j < Y; ++j) {
D.push_back(A[i] + B[j]);
}
}
sort(D.begin(), D.end(), greater<ll>());
vll E;
int K_ = min(K, X * Y);
for (int i = 0; i < K_; ++i) {
for (int j = 0; j < Z; ++j) {
E.push_back(D[i] + E[j]);
}
}
sort(E.begin(), E.end(), greater<ll>());
for (int i = 0; i < K; ++i) {
cout << E[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vll A, B, C;
for (int i = 0; i < X; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < Y; ++i) {
ll b;
cin >> b;
B.push_back(b);
}
for (int i = 0; i < Z; ++i) {
ll c;
cin >> c;
C.push_back(c);
}
sort(A.begin(), A.end(), greater<ll>());
sort(B.begin(), B.end(), greater<ll>());
sort(C.begin(), C.end(), greater<ll>());
vll D;
for (int i = 0; i < X; ++i) {
for (int j = 0; j < Y; ++j) {
D.push_back(A[i] + B[j]);
}
}
sort(D.begin(), D.end(), greater<ll>());
vll E;
int K_ = min(K, X * Y);
for (int i = 0; i < K_; ++i) {
for (int j = 0; j < Z; ++j) {
E.push_back(D[i] + C[j]);
}
}
sort(E.begin(), E.end(), greater<ll>());
for (int i = 0; i < K; ++i) {
cout << E[i] << endl;
}
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 896,771 | 896,772 | u826487371 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> X >> K;
vll A(X), B(Y), C(Z);
for (int i = 0; i < X; ++i) {
ll a;
cin >> a;
A[i] = a;
}
for (int i = 0; i < Y; ++i) {
ll b;
cin >> b;
B[i] = b;
}
for (int i = 0; i < Z; ++i) {
ll c;
cin >> c;
C[i] = c;
}
vll partial_sum;
for (int i = 0; i < X; ++i) {
for (int j = 0; j < Y; ++j) {
ll s = A[i] + B[j];
partial_sum.push_back(s);
}
}
sort(partial_sum.begin(), partial_sum.end(), greater<ll>());
vll ans;
int K_ = min(K, X * Y);
for (int i = 0; i < K_; ++i) {
for (int j = 0; j < Z; ++j) {
ll t = partial_sum[i] + C[j];
ans.push_back(t);
}
}
sort(ans.begin(), ans.end(), greater<ll>());
for (int i = 0; i < K; ++i) {
cout << ans[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vll A(X), B(Y), C(Z);
for (int i = 0; i < X; ++i) {
ll a;
cin >> a;
A[i] = a;
}
for (int i = 0; i < Y; ++i) {
ll b;
cin >> b;
B[i] = b;
}
for (int i = 0; i < Z; ++i) {
ll c;
cin >> c;
C[i] = c;
}
vll partial_sum;
for (int i = 0; i < X; ++i) {
for (int j = 0; j < Y; ++j) {
ll s = A[i] + B[j];
partial_sum.push_back(s);
}
}
sort(partial_sum.begin(), partial_sum.end(), greater<ll>());
vll ans;
int K_ = min(K, X * Y);
for (int i = 0; i < K_; ++i) {
for (int j = 0; j < Z; ++j) {
ll t = partial_sum[i] + C[j];
ans.push_back(t);
}
}
sort(ans.begin(), ans.end(), greater<ll>());
for (int i = 0; i < K; ++i) {
cout << ans[i] << endl;
}
return 0;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 896,773 | 896,774 | u826487371 | cpp |
p03078 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define endl '\n'
#define ll long long
#define mod 1000000007
#define NCONS 1000000000
//#define NCONS 100001
//#define NCONS 1001
//#define NCONS 101
#define MCONS 2001
#define LIMIT 1000000000
#define TRUE 1
#define FALSE 0
using namespace std;
int main(void) {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x, 0), b(y, 0), c(z, 0);
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
vector<ll> ab, ret;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
ab.push_back(a[i] + b[j]);
}
}
sort(ab.begin(), ab.end(), greater<ll>());
while (ab.size() <= k) {
ab.pop_back();
}
for (int i = 0; i < ab.size(); i++) {
for (int j = 0; j < z; j++) {
ret.push_back(ab[i] + c[j]);
}
}
sort(ret.begin(), ret.end());
while (k--) {
cout << ret.back() << endl;
ret.pop_back();
}
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define endl '\n'
#define ll long long
#define mod 1000000007
#define NCONS 1000000000
//#define NCONS 100001
//#define NCONS 1001
//#define NCONS 101
#define MCONS 2001
#define LIMIT 1000000000
#define TRUE 1
#define FALSE 0
using namespace std;
int main(void) {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x, 0), b(y, 0), c(z, 0);
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
vector<ll> ab, ret;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
ab.push_back(a[i] + b[j]);
}
}
sort(ab.begin(), ab.end(), greater<ll>());
while (ab.size() > k) {
ab.pop_back();
}
for (int i = 0; i < ab.size(); i++) {
for (int j = 0; j < z; j++) {
ret.push_back(ab[i] + c[j]);
}
}
sort(ret.begin(), ret.end());
while (k--) {
cout << ret.back() << endl;
ret.pop_back();
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 896,775 | 896,776 | u285118720 | cpp |
p03078 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define all(a) a.begin(), a.end()
#define VV(T) vector<vector<T>>
#define rep(i, N) for (int i = 0; i < N; i++)
#define repsg(i, s, g) for (int i = s; i < g; i++)
#define name(x) #x
using namespace std;
const int INF = INT_MAX;
const long long INFL = 1LL << 40;
const double PI = atan(1) * 4;
const long long MOD = pow(10, 9) + 7;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
typedef long long ll, LL;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pLL;
// vector入力
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
// vector出力
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
}
return os;
}
class summation {
public:
ll sum;
int iA;
int iB;
int iC;
summation(ll s, int ia, int ib, int ic) {
this->sum = s;
this->iA = ia;
this->iB = ib;
this->iC = ic;
}
};
bool operator<(const summation &s1, const summation &s2) {
return s1.sum < s2.sum;
};
set<ll> used;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
cin >> a;
cin >> b;
cin >> c;
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
priority_queue<summation> sum;
int ia = 0, ib = 0, ic = 0;
used.insert(ia + 10000 * ib + 10000 * 10000 * ic);
summation temp(a[ia] + b[ib] + c[ic], ia, ib, ic);
sum.push(temp);
rep(n, k) {
summation top = sum.top();
cout << top.sum << endl;
sum.pop();
int iA = top.iA;
int iB = top.iB;
int iC = top.iC;
summation inp(top);
if (iA + 1 < x &&
used.count(iA + 1 + 10000 * iB + 10000 * 10000 * iC) == 0) {
inp.sum = a[iA + 1] + b[iB] + c[iC];
inp.iA = iA + 1;
inp.iB = iB;
inp.iC = iC;
sum.push(inp);
used.insert(iA + 10000 * iB + 10000 * 10000 * iC);
}
if (iB + 1 < y &&
used.count(iA + 10000 * (iB + 1) + 10000 * 10000 * iC) == 0) {
inp.sum = a[iA] + b[iB + 1] + c[iC];
inp.iA = iA;
inp.iB = iB + 1;
inp.iC = iC;
sum.push(inp);
used.insert(iA + 10000 * (iB + 1) + 10000 * 10000 * iC);
}
if (iC + 1 < z &&
used.count(iA + 10000 * iB + 10000 * 10000 * (iC + 1)) == 0) {
inp.sum = a[iA] + b[iB] + c[iC + 1];
inp.iA = iA;
inp.iB = iB;
inp.iC = iC + 1;
sum.push(inp);
used.insert(iA + 10000 * iB + 10000 * 10000 * (iC + 1));
}
}
return 0;
}
/*
A,B,Cはソートしておける。
0番目は自明に最も大きいものをそれぞれ取れば良い。 ia = 0, ib = 0, ic = 0
1番目は、A,B,Cのそれぞれで二番目に大きいものにするケースを計算して比較すればいい。3パターン
e.g. ia = 1, ib = 0, ic = 0;
2番目は、1番目ですでに計算したもののあまり +
1番目で変更したものの三番目に大きいものの計算結果のなかから求めればいい。
1番目で変更しなかったものをずらすと自明に値が小さくなるので、2番目の候補にはなれない。
{ia = 0, ib = 0, ic = 0}, {ia = 1, ib = 0, ic = 0} ////{ia = 0,ib=1,ic=0}, {ia
= 0, ib = 0, ic = 1}, {ia = 2, ib = 0, ic = 0} の中で三番目に大きいもの
3番目は、
{ia = 0,ib=1,ic=0}, {ia = 0, ib = 0, ic = 1}, {ia = 2, ib = 0, ic =
0}からどう遷移したかで考える。
前ステップで選択されたもの以外はそのまま残る。選択されたものについて、3通り試す必要がある。
...
k番目は、k-1番目までで計算した候補のあまり + (前回選択されたものの遷移先)
各ステップで候補が2個増えていく。priority queueで処理。
-> uniqueなものだけ取り出してくる処理が必要なので、setで管理しておく。
*/
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define all(a) a.begin(), a.end()
#define VV(T) vector<vector<T>>
#define rep(i, N) for (int i = 0; i < N; i++)
#define repsg(i, s, g) for (int i = s; i < g; i++)
#define name(x) #x
using namespace std;
const int INF = INT_MAX;
const long long INFL = 1LL << 40;
const double PI = atan(1) * 4;
const long long MOD = pow(10, 9) + 7;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
typedef long long ll, LL;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pLL;
// vector入力
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
// vector出力
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
}
return os;
}
class summation {
public:
ll sum;
int iA;
int iB;
int iC;
summation(ll s, int ia, int ib, int ic) {
this->sum = s;
this->iA = ia;
this->iB = ib;
this->iC = ic;
}
};
bool operator<(const summation &s1, const summation &s2) {
return s1.sum < s2.sum;
};
set<ll> used;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
cin >> a;
cin >> b;
cin >> c;
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
priority_queue<summation> sum;
int ia = 0, ib = 0, ic = 0;
used.insert(ia + 10000 * ib + 10000 * 10000 * ic);
summation temp(a[ia] + b[ib] + c[ic], ia, ib, ic);
sum.push(temp);
rep(n, k) {
summation top = sum.top();
cout << top.sum << endl;
sum.pop();
int iA = top.iA;
int iB = top.iB;
int iC = top.iC;
summation inp(top);
if (iA + 1 < x &&
used.count(iA + 1 + 10000 * iB + 10000 * 10000 * iC) == 0) {
inp.sum = a[iA + 1] + b[iB] + c[iC];
inp.iA = iA + 1;
inp.iB = iB;
inp.iC = iC;
sum.push(inp);
used.insert(iA + 1 + 10000 * iB + 10000 * 10000 * iC);
}
if (iB + 1 < y &&
used.count(iA + 10000 * (iB + 1) + 10000 * 10000 * iC) == 0) {
inp.sum = a[iA] + b[iB + 1] + c[iC];
inp.iA = iA;
inp.iB = iB + 1;
inp.iC = iC;
sum.push(inp);
used.insert(iA + 10000 * (iB + 1) + 10000 * 10000 * iC);
}
if (iC + 1 < z &&
used.count(iA + 10000 * iB + 10000 * 10000 * (iC + 1)) == 0) {
inp.sum = a[iA] + b[iB] + c[iC + 1];
inp.iA = iA;
inp.iB = iB;
inp.iC = iC + 1;
sum.push(inp);
used.insert(iA + 10000 * iB + 10000 * 10000 * (iC + 1));
}
}
return 0;
}
/*
A,B,Cはソートしておける。
0番目は自明に最も大きいものをそれぞれ取れば良い。 ia = 0, ib = 0, ic = 0
1番目は、A,B,Cのそれぞれで二番目に大きいものにするケースを計算して比較すればいい。3パターン
e.g. ia = 1, ib = 0, ic = 0;
2番目は、1番目ですでに計算したもののあまり +
1番目で変更したものの三番目に大きいものの計算結果のなかから求めればいい。
1番目で変更しなかったものをずらすと自明に値が小さくなるので、2番目の候補にはなれない。
{ia = 0, ib = 0, ic = 0}, {ia = 1, ib = 0, ic = 0} ////{ia = 0,ib=1,ic=0}, {ia
= 0, ib = 0, ic = 1}, {ia = 2, ib = 0, ic = 0} の中で三番目に大きいもの
3番目は、
{ia = 0,ib=1,ic=0}, {ia = 0, ib = 0, ic = 1}, {ia = 2, ib = 0, ic =
0}からどう遷移したかで考える。
前ステップで選択されたもの以外はそのまま残る。選択されたものについて、3通り試す必要がある。
...
k番目は、k-1番目までで計算した候補のあまり + (前回選択されたものの遷移先)
各ステップで候補が2個増えていく。priority queueで処理。
-> uniqueなものだけ取り出してくる処理が必要なので、setで管理しておく。
*/
| [
"expression.operation.binary.add"
] | 896,798 | 896,799 | u966854856 | cpp |
p03078 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define all(a) a.begin(), a.end()
#define VV(T) vector<vector<T>>
#define rep(i, N) for (int i = 0; i < N; i++)
#define repsg(i, s, g) for (int i = s; i < g; i++)
#define name(x) #x
using namespace std;
const int INF = INT_MAX;
const long long INFL = 1LL << 40;
const double PI = atan(1) * 4;
const long long MOD = pow(10, 9) + 7;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
typedef long long ll, LL;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pLL;
// vector入力
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
// vector出力
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
}
return os;
}
class summation {
public:
ll sum;
int iA;
int iB;
int iC;
summation(ll s, int ia, int ib, int ic) {
this->sum = s;
this->iA = ia;
this->iB = ib;
this->iC = ic;
}
};
bool operator<(const summation &s1, const summation &s2) {
return s1.sum < s2.sum;
};
set<ll> used;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
cin >> a;
cin >> b;
cin >> c;
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
priority_queue<summation> sum;
int ia = 0, ib = 0, ic = 0;
used.insert(ia + 10000 * ib + 10000 * 10000 * ic);
summation temp(a[ia] + b[ib] + c[ic], ia, ib, ic);
sum.push(temp);
rep(n, k) {
summation top = sum.top();
cout << top.sum << endl;
sum.pop();
int iA = top.iA;
int iB = top.iB;
int iC = top.iC;
summation inp(top);
if (iA + 1 < x &&
used.count(iA + 1 + 10000 * iB + 10000 * 10000 * iC) == 0) {
inp.sum = a[iA + 1] + b[iB] + c[iC];
inp.iA = iA + 1;
inp.iB = iB;
inp.iC = iC;
sum.push(inp);
used.insert(iA + 10000 * iB + 10000 * 10000 * iC);
}
if (iB + 1 < y &&
used.count(iA + 2000 * (iB + 1) + 10000 * 10000 * iC) == 0) {
inp.sum = a[iA] + b[iB + 1] + c[iC];
inp.iA = iA;
inp.iB = iB + 1;
inp.iC = iC;
sum.push(inp);
used.insert(iA + 10000 * (iB + 1) + 10000 * 10000 * iC);
}
if (iC + 1 < z &&
used.count(iA + 10000 * iB + 10000 * 10000 * (iC + 1)) == 0) {
inp.sum = a[iA] + b[iB] + c[iC + 1];
inp.iA = iA;
inp.iB = iB;
inp.iC = iC + 1;
sum.push(inp);
used.insert(iA + 10000 * iB + 10000 * 10000 * (iC + 1));
}
}
return 0;
}
/*
A,B,Cはソートしておける。
0番目は自明に最も大きいものをそれぞれ取れば良い。 ia = 0, ib = 0, ic = 0
1番目は、A,B,Cのそれぞれで二番目に大きいものにするケースを計算して比較すればいい。3パターン
e.g. ia = 1, ib = 0, ic = 0;
2番目は、1番目ですでに計算したもののあまり +
1番目で変更したものの三番目に大きいものの計算結果のなかから求めればいい。
1番目で変更しなかったものをずらすと自明に値が小さくなるので、2番目の候補にはなれない。
{ia = 0, ib = 0, ic = 0}, {ia = 1, ib = 0, ic = 0} ////{ia = 0,ib=1,ic=0}, {ia
= 0, ib = 0, ic = 1}, {ia = 2, ib = 0, ic = 0} の中で三番目に大きいもの
3番目は、
{ia = 0,ib=1,ic=0}, {ia = 0, ib = 0, ic = 1}, {ia = 2, ib = 0, ic =
0}からどう遷移したかで考える。
前ステップで選択されたもの以外はそのまま残る。選択されたものについて、3通り試す必要がある。
...
k番目は、k-1番目までで計算した候補のあまり + (前回選択されたものの遷移先)
各ステップで候補が2個増えていく。priority queueで処理。
-> uniqueなものだけ取り出してくる処理が必要なので、setで管理しておく。
*/
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define all(a) a.begin(), a.end()
#define VV(T) vector<vector<T>>
#define rep(i, N) for (int i = 0; i < N; i++)
#define repsg(i, s, g) for (int i = s; i < g; i++)
#define name(x) #x
using namespace std;
const int INF = INT_MAX;
const long long INFL = 1LL << 40;
const double PI = atan(1) * 4;
const long long MOD = pow(10, 9) + 7;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
typedef long long ll, LL;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pLL;
// vector入力
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
// vector出力
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
}
return os;
}
class summation {
public:
ll sum;
int iA;
int iB;
int iC;
summation(ll s, int ia, int ib, int ic) {
this->sum = s;
this->iA = ia;
this->iB = ib;
this->iC = ic;
}
};
bool operator<(const summation &s1, const summation &s2) {
return s1.sum < s2.sum;
};
set<ll> used;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
cin >> a;
cin >> b;
cin >> c;
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
priority_queue<summation> sum;
int ia = 0, ib = 0, ic = 0;
used.insert(ia + 10000 * ib + 10000 * 10000 * ic);
summation temp(a[ia] + b[ib] + c[ic], ia, ib, ic);
sum.push(temp);
rep(n, k) {
summation top = sum.top();
cout << top.sum << endl;
sum.pop();
int iA = top.iA;
int iB = top.iB;
int iC = top.iC;
summation inp(top);
if (iA + 1 < x &&
used.count(iA + 1 + 10000 * iB + 10000 * 10000 * iC) == 0) {
inp.sum = a[iA + 1] + b[iB] + c[iC];
inp.iA = iA + 1;
inp.iB = iB;
inp.iC = iC;
sum.push(inp);
used.insert(iA + 1 + 10000 * iB + 10000 * 10000 * iC);
}
if (iB + 1 < y &&
used.count(iA + 10000 * (iB + 1) + 10000 * 10000 * iC) == 0) {
inp.sum = a[iA] + b[iB + 1] + c[iC];
inp.iA = iA;
inp.iB = iB + 1;
inp.iC = iC;
sum.push(inp);
used.insert(iA + 10000 * (iB + 1) + 10000 * 10000 * iC);
}
if (iC + 1 < z &&
used.count(iA + 10000 * iB + 10000 * 10000 * (iC + 1)) == 0) {
inp.sum = a[iA] + b[iB] + c[iC + 1];
inp.iA = iA;
inp.iB = iB;
inp.iC = iC + 1;
sum.push(inp);
used.insert(iA + 10000 * iB + 10000 * 10000 * (iC + 1));
}
}
return 0;
}
/*
A,B,Cはソートしておける。
0番目は自明に最も大きいものをそれぞれ取れば良い。 ia = 0, ib = 0, ic = 0
1番目は、A,B,Cのそれぞれで二番目に大きいものにするケースを計算して比較すればいい。3パターン
e.g. ia = 1, ib = 0, ic = 0;
2番目は、1番目ですでに計算したもののあまり +
1番目で変更したものの三番目に大きいものの計算結果のなかから求めればいい。
1番目で変更しなかったものをずらすと自明に値が小さくなるので、2番目の候補にはなれない。
{ia = 0, ib = 0, ic = 0}, {ia = 1, ib = 0, ic = 0} ////{ia = 0,ib=1,ic=0}, {ia
= 0, ib = 0, ic = 1}, {ia = 2, ib = 0, ic = 0} の中で三番目に大きいもの
3番目は、
{ia = 0,ib=1,ic=0}, {ia = 0, ib = 0, ic = 1}, {ia = 2, ib = 0, ic =
0}からどう遷移したかで考える。
前ステップで選択されたもの以外はそのまま残る。選択されたものについて、3通り試す必要がある。
...
k番目は、k-1番目までで計算した候補のあまり + (前回選択されたものの遷移先)
各ステップで候補が2個増えていく。priority queueで処理。
-> uniqueなものだけ取り出してくる処理が必要なので、setで管理しておく。
*/
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 896,800 | 896,799 | u966854856 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) {
cin >> A.at(i);
}
for (int i = 0; i < Y; i++) {
cin >> B.at(i);
}
for (int i = 0; i < Z; i++) {
cin >> C.at(i);
}
vector<long> AplusB(X * Y);
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
AplusB.at(i * Y + j) = A.at(i) + B.at(j);
}
}
sort(AplusB.begin(), AplusB.end(), greater<int>());
int T = min(K, X * Y);
vector<long> AB(T);
for (int i = 0; i < T; i++) {
AB.at(i) = AplusB.at(i);
}
vector<long> sum(T * Z);
for (int i = 0; i < T; i++) {
for (int j = 0; j < Z; j++) {
sum.at(i * Z + j) = AB.at(i) + C.at(j);
}
}
sort(sum.begin(), sum.end(), greater<int>());
for (int i = 0; i < K; i++) {
cout << sum.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) {
cin >> A.at(i);
}
for (int i = 0; i < Y; i++) {
cin >> B.at(i);
}
for (int i = 0; i < Z; i++) {
cin >> C.at(i);
}
vector<long> AplusB(X * Y);
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
AplusB.at(i * Y + j) = A.at(i) + B.at(j);
}
}
sort(AplusB.begin(), AplusB.end(), greater<long>());
int T = min(K, X * Y);
vector<long> AB(T);
for (int i = 0; i < T; i++) {
AB.at(i) = AplusB.at(i);
}
vector<long> sum(T * Z);
for (int i = 0; i < T; i++) {
for (int j = 0; j < Z; j++) {
sum.at(i * Z + j) = AB.at(i) + C.at(j);
}
}
sort(sum.begin(), sum.end(), greater<long>());
for (int i = 0; i < K; i++) {
cout << sum.at(i) << endl;
}
} | [
"variable_declaration.type.primitive.change"
] | 896,801 | 896,802 | u824310141 | cpp |
p03078 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<long long> a, b, c, comb;
for (int i = 0; i < x; i++) {
int tmp;
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < y; i++) {
int tmp;
cin >> tmp;
b.push_back(tmp);
}
for (int i = 0; i < z; i++) {
int tmp;
cin >> tmp;
c.push_back(tmp);
}
sort(a.begin(), a.end(), greater<long long>());
sort(b.begin(), b.end(), greater<long long>());
sort(c.begin(), c.end(), greater<long long>());
for (int i = 0; i < x; i++)
for (int j = 0; j < y; j++)
for (int l = 0; l < z; l++) {
if ((i + 1) * (j + 1) * (l + 1) > k)
break;
comb.push_back(a[i] + b[j] + c[l]);
}
sort(comb.begin(), comb.end(), greater<long long>());
for (int i = 0; i < k; i++)
cout << comb[i] << endl;
} | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<long long> a, b, c, comb;
for (int i = 0; i < x; i++) {
long long tmp;
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < y; i++) {
long long tmp;
cin >> tmp;
b.push_back(tmp);
}
for (int i = 0; i < z; i++) {
long long tmp;
cin >> tmp;
c.push_back(tmp);
}
sort(a.begin(), a.end(), greater<long long>());
sort(b.begin(), b.end(), greater<long long>());
sort(c.begin(), c.end(), greater<long long>());
for (int i = 0; i < x; i++)
for (int j = 0; j < y; j++)
for (int l = 0; l < z; l++) {
if ((i + 1) * (j + 1) * (l + 1) > k)
break;
comb.push_back(a[i] + b[j] + c[l]);
}
sort(comb.begin(), comb.end(), greater<long long>());
for (int i = 0; i < k; i++)
cout << comb[i] << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 896,806 | 896,807 | u898965510 | cpp |
p03078 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<int> cakesA(X);
vector<int> cakesB(Y);
vector<int> cakesC(Z);
for (int i = 0; i < X; i++)
cin >> cakesA[i];
for (int i = 0; i < Y; i++)
cin >> cakesB[i];
for (int i = 0; i < Z; i++)
cin >> cakesC[i];
vector<long long> cakesAB;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
cakesAB.push_back(cakesA[i] + cakesB[j]);
}
}
sort(cakesAB.begin(), cakesAB.end());
reverse(cakesAB.begin(), cakesAB.end());
vector<long long> cakesABC;
for (int i = 0; i < min(K, (int)cakesAB.size()); i++) {
for (int j = 0; j < Z; j++) {
cakesABC.push_back(cakesAB[i] + cakesC[j]);
}
}
sort(cakesABC.begin(), cakesABC.end());
reverse(cakesABC.begin(), cakesABC.end());
for (int i = 0; i < K; i++) {
cout << cakesABC[i] << endl;
}
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> cakesA(X);
vector<long long> cakesB(Y);
vector<long long> cakesC(Z);
for (int i = 0; i < X; i++)
cin >> cakesA[i];
for (int i = 0; i < Y; i++)
cin >> cakesB[i];
for (int i = 0; i < Z; i++)
cin >> cakesC[i];
vector<long long> cakesAB;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
cakesAB.push_back(cakesA[i] + cakesB[j]);
}
}
sort(cakesAB.begin(), cakesAB.end());
reverse(cakesAB.begin(), cakesAB.end());
vector<long long> cakesABC;
for (int i = 0; i < min(K, (int)cakesAB.size()); i++) {
for (int j = 0; j < Z; j++) {
cakesABC.push_back(cakesAB[i] + cakesC[j]);
}
}
sort(cakesABC.begin(), cakesABC.end());
reverse(cakesABC.begin(), cakesABC.end());
for (int i = 0; i < K; i++) {
cout << cakesABC[i] << endl;
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 896,810 | 896,811 | u652286295 | cpp |
p03078 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for (int i = 0; i < Y; i++) {
cin >> B[i];
}
for (int i = 0; i < Z; i++) {
cin >> C[i];
}
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
sort(C.rbegin(), C.rend());
vector<ll> ans;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) >= K)
break;
ans.push_back(A[i] + B[j] + C[k]);
}
}
}
sort(ans.rbegin(), ans.rend());
for (int i = 0; i < K; i++) {
cout << ans[i] << endl;
}
} | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for (int i = 0; i < Y; i++) {
cin >> B[i];
}
for (int i = 0; i < Z; i++) {
cin >> C[i];
}
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
sort(C.rbegin(), C.rend());
vector<ll> ans;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) > K)
break;
ans.push_back(A[i] + B[j] + C[k]);
}
}
}
sort(ans.rbegin(), ans.rend());
for (int i = 0; i < K; i++) {
cout << ans[i] << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 896,812 | 896,813 | u650243369 | cpp |
p03078 | #include <algorithm> // for sort
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int x, y, z, kLen;
int i, j, k;
vector<long long int> a, b, c;
vector<long long int> total;
cin >> x >> y >> z >> kLen;
for (i = 0; i < x; i++) {
long long int value;
cin >> value;
a.push_back(value);
}
for (i = 0; i < y; i++) {
long long int value;
cin >> value;
b.push_back(value);
}
for (i = 0; i < z; i++) {
long long int value;
cin >> value;
c.push_back(value);
}
std::sort(a.begin(), a.end(), std::greater<long long int>());
std::sort(b.begin(), b.end(), std::greater<long long int>());
std::sort(c.begin(), c.end(), std::greater<long long int>());
/*
for(i=0;i<x;i++){
cout << a[i] << " ";
}
cout << endl;
for(i=0;i<y;i++){
cout << b[i] << " ";
}
cout << endl;
for(i=0;i<z;i++){
cout << c[i] << " ";
}
cout << endl;
*/
long long int aMax = a[0];
long long int bMax = b[0];
long long int cMax = c[0];
i = j = k = 1;
long long int diff = 0;
long long int aDiff, bDiff, cDiff;
int count = 0;
while (1) {
aDiff = bDiff = cDiff = LLONG_MAX;
if (i < a.size()) {
aDiff = aMax - a[i];
}
if (j < b.size()) {
bDiff = bMax - b[j];
}
if (k < c.size()) {
cDiff = cMax - c[k];
}
if (aDiff <= bDiff && aDiff <= cDiff) {
i++;
}
if (bDiff <= aDiff && bDiff <= cDiff) {
j++;
}
if (cDiff <= aDiff && cDiff <= bDiff) {
k++;
}
if (i == a.size() && j == b.size() && k == c.size())
break;
if (i * j * k > kLen)
break;
}
int l, m, n;
for (l = 0; l < i; l++) {
for (m = 0; m < j; m++) {
for (n = 0; n < k; n++) {
total.push_back(a[l] + b[m] + c[n]);
}
}
}
std::sort(total.begin(), total.end(), std::greater<long long int>());
while (1) {
std::sort(total.begin(), total.end(), std::greater<long long int>());
if (i < a.size() - 1 && total[kLen - 1] < a[i] + bMax + cMax) {
for (m = 0; m < j; m++) {
for (n = 0; n < k; n++) {
total.push_back(a[i] + b[m] + c[n]);
}
}
i++;
} else if (j < b.size() - 1 && total[kLen - 1] < aMax + b[j] + cMax) {
for (m = 0; m < i; m++) {
for (n = 0; n < k; n++) {
total.push_back(a[m] + b[j] + c[n]);
}
}
j++;
} else if (k < c.size() - 1 && total[kLen - 1] < aMax + bMax + c[k]) {
for (m = 0; m < i; m++) {
for (n = 0; n < j; n++) {
total.push_back(a[m] + b[n] + c[k]);
}
}
k++;
} else {
break;
}
}
// cout << i << "," << j << "," << k << endl;
for (i = 0; i < kLen; i++) {
cout << total[i] << endl;
}
return 0;
}
| #include <algorithm> // for sort
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int x, y, z, kLen;
int i, j, k;
vector<long long int> a, b, c;
vector<long long int> total;
cin >> x >> y >> z >> kLen;
for (i = 0; i < x; i++) {
long long int value;
cin >> value;
a.push_back(value);
}
for (i = 0; i < y; i++) {
long long int value;
cin >> value;
b.push_back(value);
}
for (i = 0; i < z; i++) {
long long int value;
cin >> value;
c.push_back(value);
}
std::sort(a.begin(), a.end(), std::greater<long long int>());
std::sort(b.begin(), b.end(), std::greater<long long int>());
std::sort(c.begin(), c.end(), std::greater<long long int>());
/*
for(i=0;i<x;i++){
cout << a[i] << " ";
}
cout << endl;
for(i=0;i<y;i++){
cout << b[i] << " ";
}
cout << endl;
for(i=0;i<z;i++){
cout << c[i] << " ";
}
cout << endl;
*/
long long int aMax = a[0];
long long int bMax = b[0];
long long int cMax = c[0];
i = j = k = 1;
long long int diff = 0;
long long int aDiff, bDiff, cDiff;
int count = 0;
while (1) {
aDiff = bDiff = cDiff = LLONG_MAX;
if (i < a.size()) {
aDiff = aMax - a[i];
}
if (j < b.size()) {
bDiff = bMax - b[j];
}
if (k < c.size()) {
cDiff = cMax - c[k];
}
if (aDiff <= bDiff && aDiff <= cDiff) {
i++;
}
if (bDiff <= aDiff && bDiff <= cDiff) {
j++;
}
if (cDiff <= aDiff && cDiff <= bDiff) {
k++;
}
if (i == a.size() && j == b.size() && k == c.size())
break;
if (i * j * k > kLen)
break;
}
int l, m, n;
for (l = 0; l < i; l++) {
for (m = 0; m < j; m++) {
for (n = 0; n < k; n++) {
total.push_back(a[l] + b[m] + c[n]);
}
}
}
std::sort(total.begin(), total.end(), std::greater<long long int>());
while (1) {
std::sort(total.begin(), total.end(), std::greater<long long int>());
if (i < a.size() && total[kLen - 1] < a[i] + bMax + cMax) {
for (m = 0; m < j; m++) {
for (n = 0; n < k; n++) {
total.push_back(a[i] + b[m] + c[n]);
}
}
i++;
} else if (j < b.size() && total[kLen - 1] < aMax + b[j] + cMax) {
for (m = 0; m < i; m++) {
for (n = 0; n < k; n++) {
total.push_back(a[m] + b[j] + c[n]);
}
}
j++;
} else if (k < c.size() && total[kLen - 1] < aMax + bMax + c[k]) {
for (m = 0; m < i; m++) {
for (n = 0; n < j; n++) {
total.push_back(a[m] + b[n] + c[k]);
}
}
k++;
} else {
break;
}
}
// cout << i << "," << j << "," << k << endl;
for (i = 0; i < kLen; i++) {
cout << total[i] << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 896,816 | 896,817 | u925478083 | cpp |
p03078 | #include <algorithm> // for sort
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int x, y, z, kLen;
int i, j, k;
vector<long long int> a, b, c;
vector<long long int> total;
cin >> x >> y >> z >> kLen;
for (i = 0; i < x; i++) {
long long int value;
cin >> value;
a.push_back(value);
}
for (i = 0; i < y; i++) {
long long int value;
cin >> value;
b.push_back(value);
}
for (i = 0; i < z; i++) {
long long int value;
cin >> value;
c.push_back(value);
}
std::sort(a.begin(), a.end(), std::greater<long long int>());
std::sort(b.begin(), b.end(), std::greater<long long int>());
std::sort(c.begin(), c.end(), std::greater<long long int>());
long long int aMax = a[0];
long long int bMax = b[0];
long long int cMax = c[0];
i = j = k = 1;
long long int diff = 0;
long long int aDiff, bDiff, cDiff;
while (1) {
aDiff = bDiff = cDiff = LLONG_MAX;
if (i < a.size()) {
aDiff = aMax - a[i];
}
if (j < b.size()) {
bDiff = bMax - b[j];
}
if (k < c.size()) {
cDiff = cMax - c[k];
}
if (aDiff <= bDiff && aDiff <= cDiff) {
i++;
}
if (bDiff <= aDiff && bDiff <= cDiff) {
j++;
}
if (cDiff <= aDiff && cDiff <= bDiff) {
k++;
}
if (i == a.size() && j == b.size() && k == c.size())
break;
if (i * j * k >= kLen * 2)
break;
}
int l, m, n;
for (l = 0; l < i; l++) {
for (m = 0; m < j; m++) {
for (n = 0; n < k; n++) {
total.push_back(a[l] + b[m] + c[n]);
}
}
}
std::sort(total.begin(), total.end(), std::greater<long long int>());
for (i = 0; i < kLen; i++) {
cout << total[i] << endl;
}
return 0;
}
| #include <algorithm> // for sort
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int x, y, z, kLen;
int i, j, k;
vector<long long int> a, b, c;
vector<long long int> total;
cin >> x >> y >> z >> kLen;
for (i = 0; i < x; i++) {
long long int value;
cin >> value;
a.push_back(value);
}
for (i = 0; i < y; i++) {
long long int value;
cin >> value;
b.push_back(value);
}
for (i = 0; i < z; i++) {
long long int value;
cin >> value;
c.push_back(value);
}
std::sort(a.begin(), a.end(), std::greater<long long int>());
std::sort(b.begin(), b.end(), std::greater<long long int>());
std::sort(c.begin(), c.end(), std::greater<long long int>());
long long int aMax = a[0];
long long int bMax = b[0];
long long int cMax = c[0];
i = j = k = 1;
long long int diff = 0;
long long int aDiff, bDiff, cDiff;
while (1) {
aDiff = bDiff = cDiff = LLONG_MAX;
if (i < a.size()) {
aDiff = aMax - a[i];
}
if (j < b.size()) {
bDiff = bMax - b[j];
}
if (k < c.size()) {
cDiff = cMax - c[k];
}
if (aDiff <= bDiff && aDiff <= cDiff) {
i++;
}
if (bDiff <= aDiff && bDiff <= cDiff) {
j++;
}
if (cDiff <= aDiff && cDiff <= bDiff) {
k++;
}
if (i == a.size() && j == b.size() && k == c.size())
break;
if (i * j * k >= kLen * 15)
break;
}
int l, m, n;
for (l = 0; l < i; l++) {
for (m = 0; m < j; m++) {
for (n = 0; n < k; n++) {
total.push_back(a[l] + b[m] + c[n]);
}
}
}
std::sort(total.begin(), total.end(), std::greater<long long int>());
for (i = 0; i < kLen; i++) {
cout << total[i] << endl;
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 896,820 | 896,819 | u925478083 | cpp |
p03078 | #include <algorithm> // for sort
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int x, y, z, kLen;
int i, j, k;
vector<long long int> a, b, c;
vector<long long int> total;
cin >> x >> y >> z >> kLen;
for (i = 0; i < x; i++) {
long long int value;
cin >> value;
a.push_back(value);
}
for (i = 0; i < y; i++) {
long long int value;
cin >> value;
b.push_back(value);
}
for (i = 0; i < z; i++) {
long long int value;
cin >> value;
c.push_back(value);
}
std::sort(a.begin(), a.end(), std::greater<long long int>());
std::sort(b.begin(), b.end(), std::greater<long long int>());
std::sort(c.begin(), c.end(), std::greater<long long int>());
long long int aMax = a[0];
long long int bMax = b[0];
long long int cMax = c[0];
i = j = k = 1;
long long int diff = 0;
long long int aDiff, bDiff, cDiff;
while (1) {
aDiff = bDiff = cDiff = LLONG_MAX;
if (i < a.size()) {
aDiff = aMax - a[i];
}
if (j < b.size()) {
bDiff = bMax - b[j];
}
if (k < c.size()) {
cDiff = cMax - c[k];
}
if (aDiff <= bDiff && aDiff <= cDiff) {
i++;
}
if (bDiff <= aDiff && bDiff <= cDiff) {
j++;
}
if (cDiff <= aDiff && cDiff <= bDiff) {
k++;
}
if (i == a.size() && j == b.size() && k == c.size())
break;
if (i * j * k >= kLen)
break;
}
int l, m, n;
for (l = 0; l < i; l++) {
for (m = 0; m < j; m++) {
for (n = 0; n < k; n++) {
total.push_back(a[l] + b[m] + c[n]);
}
}
}
std::sort(total.begin(), total.end(), std::greater<long long int>());
for (i = 0; i < kLen; i++) {
cout << total[i] << endl;
}
return 0;
}
| #include <algorithm> // for sort
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int x, y, z, kLen;
int i, j, k;
vector<long long int> a, b, c;
vector<long long int> total;
cin >> x >> y >> z >> kLen;
for (i = 0; i < x; i++) {
long long int value;
cin >> value;
a.push_back(value);
}
for (i = 0; i < y; i++) {
long long int value;
cin >> value;
b.push_back(value);
}
for (i = 0; i < z; i++) {
long long int value;
cin >> value;
c.push_back(value);
}
std::sort(a.begin(), a.end(), std::greater<long long int>());
std::sort(b.begin(), b.end(), std::greater<long long int>());
std::sort(c.begin(), c.end(), std::greater<long long int>());
long long int aMax = a[0];
long long int bMax = b[0];
long long int cMax = c[0];
i = j = k = 1;
long long int diff = 0;
long long int aDiff, bDiff, cDiff;
while (1) {
aDiff = bDiff = cDiff = LLONG_MAX;
if (i < a.size()) {
aDiff = aMax - a[i];
}
if (j < b.size()) {
bDiff = bMax - b[j];
}
if (k < c.size()) {
cDiff = cMax - c[k];
}
if (aDiff <= bDiff && aDiff <= cDiff) {
i++;
}
if (bDiff <= aDiff && bDiff <= cDiff) {
j++;
}
if (cDiff <= aDiff && cDiff <= bDiff) {
k++;
}
if (i == a.size() && j == b.size() && k == c.size())
break;
if (i * j * k >= kLen * 15)
break;
}
int l, m, n;
for (l = 0; l < i; l++) {
for (m = 0; m < j; m++) {
for (n = 0; n < k; n++) {
total.push_back(a[l] + b[m] + c[n]);
}
}
}
std::sort(total.begin(), total.end(), std::greater<long long int>());
for (i = 0; i < kLen; i++) {
cout << total[i] << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 896,825 | 896,819 | u925478083 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a[1001], b[1001], c[1001];
int x, y, z, k;
priority_queue<LL> q;
int main() {
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x, greater<LL>());
sort(b, b + y, greater<LL>());
sort(c, c + z, greater<LL>());
for (int i = 0; i < x; i++)
for (int j = 0; j < y; j++) {
if ((i + 1) * (j + 1) - 1 >= k)
break;
for (int t = 0; t < z; t++) {
if ((i + 1) * (j + 1) * (t + 1) - 1 >= k)
break;
LL tmp = a[i] * b[j] * c[t];
q.push(tmp);
}
}
for (int i = 0; i < k; i++) {
cout << q.top() << endl;
q.pop();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a[1001], b[1001], c[1001];
int x, y, z, k;
priority_queue<LL> q;
int main() {
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x, greater<LL>());
sort(b, b + y, greater<LL>());
sort(c, c + z, greater<LL>());
for (int i = 0; i < x; i++)
for (int j = 0; j < y; j++) {
if ((i + 1) * (j + 1) - 1 >= k)
break;
for (int t = 0; t < z; t++) {
if ((i + 1) * (j + 1) * (t + 1) - 1 >= k)
break;
LL tmp = a[i] + b[j] + c[t];
q.push(tmp);
}
}
for (int i = 0; i < k; i++) {
cout << q.top() << endl;
q.pop();
}
return 0;
}
| [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 896,828 | 896,829 | u339483858 | cpp |
p03078 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define DEBUG(x) cout << #x << ": " << x << endl
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
long long A[X], B[Y], C[Z];
for (int i = 0; i < X; i++)
cin >> A[i];
for (int j = 0; j < Y; j++)
cin >> B[j];
for (int k = 0; k < Z; k++)
cin >> C[k];
sort(A, A + X, greater<long long>());
sort(B, B + Y, greater<long long>());
sort(C, C + Z, greater<long long>());
vector<long long> ans;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
if ((i + 1) * (j + 1) > K)
break;
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) > K)
break;
ans.push_back(A[i] + B[j] + C[k]);
}
}
}
sort(ans.begin(), ans.end(), greater<long long>());
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define DEBUG(x) cout << #x << ": " << x << endl
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
long long A[X], B[Y], C[Z];
for (int i = 0; i < X; i++)
cin >> A[i];
for (int j = 0; j < Y; j++)
cin >> B[j];
for (int k = 0; k < Z; k++)
cin >> C[k];
sort(A, A + X, greater<long long>());
sort(B, B + Y, greater<long long>());
sort(C, C + Z, greater<long long>());
vector<long long> ans;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
if ((i + 1) * (j + 1) > K)
break;
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) > K)
break;
ans.push_back(A[i] + B[j] + C[k]);
}
}
}
sort(ans.begin(), ans.end(), greater<long long>());
for (int i = 0; i < K; i++) {
cout << ans[i] << endl;
}
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove"
] | 896,836 | 896,837 | u574045761 | cpp |
p03078 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
const int MX = 200005;
#define RET(ans) \
{ \
cout << ans << endl; \
return 0; \
}
// 二次元ベクターの基本
/*
vector<vector<int>> dp; // 宣言
dp.resize(n); // 1次元めの要素数決定
dp[i].push_back(int); // プッシュバック
rep(i,n){
sort(dp[i].begin(),dp[i].end()); // 二次元めを昇順ソート
}
*/
// 整数スキャン（複数）
/*
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s; cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s; cin >> s;
slist.push_back(s);
}
*/
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
ll a[x], b[y], c[z];
rep(i, x) { cin >> a[i]; }
sort(a, a + x);
rep(i, y) { cin >> b[i]; }
sort(b, b + y);
rep(i, z) { cin >> c[i]; }
sort(c, c + z);
ll ans1[200000] = {};
int count = 0;
rep(i, x) {
rep(j, y) {
if ((x - i) * (y - j) <= 3100) {
ans1[count] = a[i] + b[j];
count++;
}
}
}
sort(ans1, ans1 + 20000);
ll ans[200000] = {};
count = 0;
for (int i = 199999; i > 190000; i--) {
rep(j, z) {
if ((200000 - i) * (z - j) <= 3100 && ans1[i] != 0) {
ans[count] = ans1[i] + c[j];
count++;
}
}
}
sort(ans, ans + 200000);
rep(i, k) { cout << ans[199999 - i] << endl; }
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
const int MX = 200005;
#define RET(ans) \
{ \
cout << ans << endl; \
return 0; \
}
// 二次元ベクターの基本
/*
vector<vector<int>> dp; // 宣言
dp.resize(n); // 1次元めの要素数決定
dp[i].push_back(int); // プッシュバック
rep(i,n){
sort(dp[i].begin(),dp[i].end()); // 二次元めを昇順ソート
}
*/
// 整数スキャン（複数）
/*
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s; cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s; cin >> s;
slist.push_back(s);
}
*/
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
ll a[x], b[y], c[z];
rep(i, x) { cin >> a[i]; }
sort(a, a + x);
rep(i, y) { cin >> b[i]; }
sort(b, b + y);
rep(i, z) { cin >> c[i]; }
sort(c, c + z);
ll ans1[200000] = {};
int count = 0;
rep(i, x) {
rep(j, y) {
if ((x - i) * (y - j) <= 3100) {
ans1[count] = a[i] + b[j];
count++;
}
}
}
sort(ans1, ans1 + 200000);
ll ans[200000] = {};
count = 0;
for (int i = 199999; i > 195000; i--) {
rep(j, z) {
if ((200000 - i) * (z - j) <= 3100 && ans1[i] != 0) {
ans[count] = ans1[i] + c[j];
count++;
}
}
}
sort(ans, ans + 200000);
rep(i, k) { cout << ans[199999 - i] << endl; }
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 896,838 | 896,839 | u791593901 | cpp |
p03078 | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <memory>
#include <queue>
#include <utility>
#include <vector>
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> v1(x), v2(y), v3(z);
rep(i, x) cin >> v1[i];
rep(i, y) cin >> v2[i];
rep(i, z) cin >> v3[i];
vector<ll> v;
rep(i, x) {
rep(j, y) { v.push_back(v1[i] + v2[j]); }
}
vector<ll> v4;
sort(v.begin(), v.end(), less<ll>());
rep(i, min(k, int(v.size()))) {
rep(j, z) { v4.push_back(v[i] + v3[j]); }
}
sort(v4.begin(), v4.end(), less<ll>());
rep(i, k) { cout << v4[i] << endl; }
return 0;
} | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <memory>
#include <queue>
#include <utility>
#include <vector>
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> v1(x), v2(y), v3(z);
rep(i, x) cin >> v1[i];
rep(i, y) cin >> v2[i];
rep(i, z) cin >> v3[i];
vector<ll> v;
rep(i, x) {
rep(j, y) { v.push_back(v1[i] + v2[j]); }
}
vector<ll> v4;
sort(v.begin(), v.end(), greater<ll>());
rep(i, min(k, int(v.size()))) {
rep(j, z) { v4.push_back(v[i] + v3[j]); }
}
sort(v4.begin(), v4.end(), greater<ll>());
rep(i, k) { cout << v4[i] << endl; }
return 0;
} | [
"identifier.change",
"call.arguments.change"
] | 896,850 | 896,851 | u704411633 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
int A[X], B[Y], C[Z];
for (int i = 0; i < X; i++)
cin >> A[i];
for (int i = 0; i < Y; i++)
cin >> B[i];
for (int i = 0; i < Z; i++)
cin >> C[i];
int AB[X * Y];
int k = 0;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
AB[k++] = A[i] + B[j];
}
}
sort(AB, AB + X * Y, greater<int>());
int xy = min(X * Y, K);
long long ABC[xy * Z];
k = 0;
for (int i = 0; i < xy; i++) {
for (int j = 0; j < Z; j++) {
ABC[k++] = AB[i] + C[j];
}
}
sort(ABC, ABC + xy * Z, greater<long long>());
for (int i = 0; i < K; i++)
cout << ABC[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
long long A[X], B[Y], C[Z];
for (int i = 0; i < X; i++)
cin >> A[i];
for (int i = 0; i < Y; i++)
cin >> B[i];
for (int i = 0; i < Z; i++)
cin >> C[i];
long long AB[X * Y];
int k = 0;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
AB[k++] = A[i] + B[j];
}
}
sort(AB, AB + X * Y, greater<long long>());
int xy = min(X * Y, K);
long long ABC[xy * Z];
k = 0;
for (int i = 0; i < xy; i++) {
for (int j = 0; j < Z; j++) {
ABC[k++] = AB[i] + C[j];
}
}
sort(ABC, ABC + xy * Z, greater<long long>());
for (int i = 0; i < K; i++)
cout << ABC[i] << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 896,854 | 896,855 | u303454114 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF 1000000000000000000
#define MOD 10007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++)
cin >> A[i];
for (int i = 0; i < Y; i++)
cin >> B[i];
for (int i = 0; i < Z; i++)
cin >> C[i];
sort(rrng(A));
sort(rrng(B));
sort(rrng(C));
vector<ll> AB;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
AB.push_back(A[i] + B[j]);
}
}
sort(rrng(AB));
vector<ll> ABC;
for (int i = 0; i < Z; i++) {
for (int j = 0; j < K && j < ABC.size(); j++) {
ABC.push_back(AB[j] + C[i]);
}
}
sort(rrng(ABC));
for (int i = 0; i < K; i++)
cout << ABC[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF 1000000000000000000
#define MOD 10007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++)
cin >> A[i];
for (int i = 0; i < Y; i++)
cin >> B[i];
for (int i = 0; i < Z; i++)
cin >> C[i];
sort(rrng(A));
sort(rrng(B));
sort(rrng(C));
vector<ll> AB;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
AB.push_back(A[i] + B[j]);
}
}
sort(rrng(AB));
vector<ll> ABC;
for (int i = 0; i < Z; i++) {
for (int j = 0; j < K && j < AB.size(); j++) {
ABC.push_back(AB[j] + C[i]);
}
}
sort(rrng(ABC));
for (int i = 0; i < K; i++)
cout << ABC[i] << endl;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 896,856 | 896,857 | u864171425 | cpp |
p03078 | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
for (long long i = 0; i < z; ++i)
cin >> c[i];
sort(a, a + x, greater<long long>());
sort(b, b + y, greater<long long>());
sort(c, c + z, greater<long long>());
long long t[k * 4], ti = 0;
for (long long i = 0; i < x; ++i)
for (long long j = 0; j < y; ++j)
for (long long l = 0; l < z; ++l) {
if ((i + 1) * (j + 1) * (l + 1) <= k) {
t[ti] = a[i] + b[j] + c[l];
++ti;
continue;
} else
break;
}
sort(t, t + ti, greater<long long>());
for (long long i = 0; i < k; ++i)
cout << t[i] << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
for (long long i = 0; i < z; ++i)
cin >> c[i];
sort(a, a + x, greater<long long>());
sort(b, b + y, greater<long long>());
sort(c, c + z, greater<long long>());
long long t[k * k * 3], ti = 0;
for (long long i = 0; i < x; ++i)
for (long long j = 0; j < y; ++j)
for (long long l = 0; l < z; ++l) {
if ((i + 1) * (j + 1) * (l + 1) <= k) {
t[ti] = a[i] + b[j] + c[l];
++ti;
continue;
}
break;
}
sort(t, t + ti, greater<long long>());
for (long long i = 0; i < k; ++i)
cout << t[i] << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"control_flow.branch.else.remove"
] | 896,863 | 896,864 | u146240825 | cpp |
p03078 | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
for (long long i = 0; i < z; ++i)
cin >> c[i];
sort(a, a + x, greater<long long>());
sort(b, b + y, greater<long long>());
sort(c, c + z, greater<long long>());
long long t[k * 4], ti = 0;
for (long long i = 0; i < x; ++i)
for (long long j = 0; j < y; ++j)
for (long long l = 0; l < z; ++l) {
if ((i + 1) * (j + 1) * (l + 1) <= k) {
t[ti] = a[i] + b[j] + c[l];
++ti;
continue;
}
break;
}
sort(t, t + ti, greater<long long>());
for (long long i = 0; i < k; ++i)
cout << t[i] << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
for (long long i = 0; i < z; ++i)
cin >> c[i];
sort(a, a + x, greater<long long>());
sort(b, b + y, greater<long long>());
sort(c, c + z, greater<long long>());
long long t[k * k * 3], ti = 0;
for (long long i = 0; i < x; ++i)
for (long long j = 0; j < y; ++j)
for (long long l = 0; l < z; ++l) {
if ((i + 1) * (j + 1) * (l + 1) <= k) {
t[ti] = a[i] + b[j] + c[l];
++ti;
continue;
}
break;
}
sort(t, t + ti, greater<long long>());
for (long long i = 0; i < k; ++i)
cout << t[i] << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 896,865 | 896,864 | u146240825 | cpp |
p03078 | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
for (long long i = 0; i < z; ++i)
cin >> c[i];
sort(a, a + x, greater<long long>());
sort(b, b + y, greater<long long>());
sort(c, c + z, greater<long long>());
long long t[k * 4], ti = 0;
for (long long i = 0; i < x; ++i)
for (long long j = 0; j < y; ++j)
for (long long l = 0; l < z; ++l) {
if ((i + 1) * (j + 1) * (l + 1) <= k) {
t[ti] = a[i] + b[j] + c[l];
++ti;
}
break;
}
sort(t, t + ti, greater<long long>());
for (long long i = 0; i < k; ++i)
cout << t[i] << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
for (long long i = 0; i < z; ++i)
cin >> c[i];
sort(a, a + x, greater<long long>());
sort(b, b + y, greater<long long>());
sort(c, c + z, greater<long long>());
long long t[k * k * 3], ti = 0;
for (long long i = 0; i < x; ++i)
for (long long j = 0; j < y; ++j)
for (long long l = 0; l < z; ++l) {
if ((i + 1) * (j + 1) * (l + 1) <= k) {
t[ti] = a[i] + b[j] + c[l];
++ti;
continue;
}
break;
}
sort(t, t + ti, greater<long long>());
for (long long i = 0; i < k; ++i)
cout << t[i] << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 896,866 | 896,864 | u146240825 | cpp |
p03078 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
static void D_Cake123();
int main() {
D_Cake123();
fflush(stdout);
return 0;
}
void GetUlls(std::vector<unsigned long long> &vUll, unsigned int cnt,
FILE *strm = stdin) {
unsigned long long ull = 0;
for (unsigned int i = 0; i < cnt; i++) {
fscanf(strm, " %llu", &ull);
vUll.push_back(ull);
}
}
void GetInts(std::vector<int> &vInt, unsigned int cnt, FILE *strm = stdin) {
int num = 0;
for (unsigned int i = 0; i < cnt; i++) {
fscanf(strm, " %d", &num);
vInt.push_back(num);
}
}
static void D_Cake123() {
int X, Y, Z, K;
scanf(" %d %d %d %d", &X, &Y, &Z, &K);
std::vector<unsigned long long> vAx, vBy, vCz, vAxBy, vAxByCz;
GetUlls(vAx, X);
GetUlls(vBy, Y);
GetUlls(vCz, Z);
for (int x = 0; x < X; x++) {
for (int y = 0; y < Y; y++) {
vAxBy.push_back(vAx[x] + vBy[y]);
}
}
std::sort(vAxBy.begin(), vAxBy.end(), std::greater<unsigned long long>());
int abCnt = vAxBy.size();
if (abCnt > K)
abCnt = K;
for (int ab = 0; ab < K; ab++) {
for (int z = 0; z < Z; z++) {
vAxByCz.push_back(vAxBy[ab] + vCz[z]);
}
}
std::sort(vAxByCz.begin(), vAxByCz.end(), std::greater<unsigned long long>());
for (int k = 0; k < K; k++) {
printf("%llu\n", vAxByCz[k]);
}
}
|
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
static void D_Cake123();
int main() {
D_Cake123();
fflush(stdout);
return 0;
}
void GetUlls(std::vector<unsigned long long> &vUll, unsigned int cnt,
FILE *strm = stdin) {
unsigned long long ull = 0;
for (unsigned int i = 0; i < cnt; i++) {
fscanf(strm, " %llu", &ull);
vUll.push_back(ull);
}
}
void GetInts(std::vector<int> &vInt, unsigned int cnt, FILE *strm = stdin) {
int num = 0;
for (unsigned int i = 0; i < cnt; i++) {
fscanf(strm, " %d", &num);
vInt.push_back(num);
}
}
static void D_Cake123() {
int X, Y, Z, K;
scanf(" %d %d %d %d", &X, &Y, &Z, &K);
std::vector<unsigned long long> vAx, vBy, vCz, vAxBy, vAxByCz;
GetUlls(vAx, X);
GetUlls(vBy, Y);
GetUlls(vCz, Z);
for (int x = 0; x < X; x++) {
for (int y = 0; y < Y; y++) {
vAxBy.push_back(vAx[x] + vBy[y]);
}
}
std::sort(vAxBy.begin(), vAxBy.end(), std::greater<unsigned long long>());
int abCnt = vAxBy.size();
if (abCnt > K)
abCnt = K;
for (int ab = 0; ab < abCnt; ab++) {
for (int z = 0; z < Z; z++) {
vAxByCz.push_back(vAxBy[ab] + vCz[z]);
}
}
std::sort(vAxByCz.begin(), vAxByCz.end(), std::greater<unsigned long long>());
for (int k = 0; k < K; k++) {
printf("%llu\n", vAxByCz[k]);
}
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 896,881 | 896,882 | u887675488 | cpp |
p03078 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace placeholders;
using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VS = vector<string>;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair<int, int>;
using VPII = vector<pair<int, int>>;
template <typename T = int> using VT = vector<T>;
template <typename T = int> using VVT = vector<vector<T>>;
template <typename T = int> using LIM = numeric_limits<T>;
template <typename T> inline istream &operator>>(istream &s, vector<T> &v) {
for (T &t : v) {
s >> t;
}
return s;
}
template <typename T>
inline ostream &operator<<(ostream &s, const vector<T> &v) {
for (int i = 0; i < int(v.size()); ++i) {
s << (" " + !i) << v[i];
}
return s;
}
void in_impl(){};
template <typename T, typename... TS> void in_impl(T &head, TS &...tail) {
cin >> head;
in_impl(tail...);
}
#define IN(T, ...) \
T __VA_ARGS__; \
in_impl(__VA_ARGS__);
template <typename T> struct getv_fmt;
template <> struct getv_fmt<int> { static constexpr const char *fmt = "%d"; };
template <> struct getv_fmt<long long> {
static constexpr const char *fmt = "%lld";
};
template <typename T> void getv(std::vector<T> &v) {
for_each(begin(v), end(v), [](T &a) { scanf(getv_fmt<T>::fmt, &a); });
};
template <typename T> inline T fromString(const string &s) {
T res;
istringstream iss(s);
iss >> res;
return res;
}
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
}
#define NUMBERED(name, number) NUMBERED2(name, number)
#define NUMBERED2(name, number) name##_##number
#define REP1(n) REP2(NUMBERED(REP_COUNTER, __LINE__), n)
#define REP2(i, n) REP3(i, 0, n)
#define REP3(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define GET_REP(a, b, c, F, ...) F
#define REP(...) GET_REP(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)
#define FOR(e, c) for (auto &&e : c)
#define ALL(c) begin(c), end(c)
#define AALL(a) \
(remove_all_extents<decltype(a)>::type *)a, \
(remove_all_extents<decltype(a)>::type *)a + \
sizeof(a) / sizeof(remove_all_extents<decltype(a)>::type)
#define DRANGE(c, p) begin(c), begin(c) + (p), end(c)
#define SZ(v) ((int)(v).size())
#define EXIST(c, e) ((c).find(e) != (c).end())
template <typename T> inline bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter
#define MP make_pair
#define fst first
#define snd second
#define DUMP(x) cerr << #x << " = " << (x) << endl
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(12) << fixed;
IN(int, X, Y, Z, K);
VT<LL> A(X), B(Y), C(Z);
cin >> A >> B >> C;
sort(ALL(A), greater<LL>());
sort(ALL(B), greater<LL>());
sort(ALL(C), greater<LL>());
VT<LL> res;
REP(i, X) {
REP(j, Y) {
REP(k, Z) {
if (K < (i + 1) + (j + 1) + (k + 1)) {
break;
}
res.PB(A[i] + B[j] + C[k]);
}
}
}
sort(ALL(res), greater<LL>());
copy(begin(res), begin(res) + K, ostream_iterator<LL>(cout, "\n"));
cout << flush;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace placeholders;
using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VS = vector<string>;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair<int, int>;
using VPII = vector<pair<int, int>>;
template <typename T = int> using VT = vector<T>;
template <typename T = int> using VVT = vector<vector<T>>;
template <typename T = int> using LIM = numeric_limits<T>;
template <typename T> inline istream &operator>>(istream &s, vector<T> &v) {
for (T &t : v) {
s >> t;
}
return s;
}
template <typename T>
inline ostream &operator<<(ostream &s, const vector<T> &v) {
for (int i = 0; i < int(v.size()); ++i) {
s << (" " + !i) << v[i];
}
return s;
}
void in_impl(){};
template <typename T, typename... TS> void in_impl(T &head, TS &...tail) {
cin >> head;
in_impl(tail...);
}
#define IN(T, ...) \
T __VA_ARGS__; \
in_impl(__VA_ARGS__);
template <typename T> struct getv_fmt;
template <> struct getv_fmt<int> { static constexpr const char *fmt = "%d"; };
template <> struct getv_fmt<long long> {
static constexpr const char *fmt = "%lld";
};
template <typename T> void getv(std::vector<T> &v) {
for_each(begin(v), end(v), [](T &a) { scanf(getv_fmt<T>::fmt, &a); });
};
template <typename T> inline T fromString(const string &s) {
T res;
istringstream iss(s);
iss >> res;
return res;
}
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
}
#define NUMBERED(name, number) NUMBERED2(name, number)
#define NUMBERED2(name, number) name##_##number
#define REP1(n) REP2(NUMBERED(REP_COUNTER, __LINE__), n)
#define REP2(i, n) REP3(i, 0, n)
#define REP3(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define GET_REP(a, b, c, F, ...) F
#define REP(...) GET_REP(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)
#define FOR(e, c) for (auto &&e : c)
#define ALL(c) begin(c), end(c)
#define AALL(a) \
(remove_all_extents<decltype(a)>::type *)a, \
(remove_all_extents<decltype(a)>::type *)a + \
sizeof(a) / sizeof(remove_all_extents<decltype(a)>::type)
#define DRANGE(c, p) begin(c), begin(c) + (p), end(c)
#define SZ(v) ((int)(v).size())
#define EXIST(c, e) ((c).find(e) != (c).end())
template <typename T> inline bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter
#define MP make_pair
#define fst first
#define snd second
#define DUMP(x) cerr << #x << " = " << (x) << endl
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(12) << fixed;
IN(int, X, Y, Z, K);
VT<LL> A(X), B(Y), C(Z);
cin >> A >> B >> C;
sort(ALL(A), greater<LL>());
sort(ALL(B), greater<LL>());
sort(ALL(C), greater<LL>());
VT<LL> res;
REP(i, X) {
REP(j, Y) {
REP(k, Z) {
if (K < (i + 1) * (j + 1) * (k + 1)) {
break;
}
res.PB(A[i] + B[j] + C[k]);
}
}
}
sort(ALL(res), greater<LL>());
copy(begin(res), begin(res) + K, ostream_iterator<LL>(cout, "\n"));
cout << flush;
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 896,890 | 896,891 | u938924220 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
long long x, y, z, K, a[1005], b[1005], c[1005];
vector<long long> vec;
int main() {
cin >> x >> y >> z >> K;
for (int i = 0; i < x; ++i)
cin >> a[i];
sort(a, a + x, greater<long long>());
for (int i = 0; i < y; ++i)
cin >> b[i];
sort(b, b + y, greater<long long>());
for (int i = 0; i < z; ++i)
cin >> c[i];
sort(c, c + z, greater<long long>());
for (int i = 0; i < x; ++i) {
for (int j = 0; j < y; ++j) {
for (int k = 1; k < z; ++k) {
if ((i + 1) * (j + 1) * (k + 1) <= K)
vec.push_back(a[i] + b[j] + c[k]);
else
break;
}
}
}
sort(vec.begin(), vec.end(), greater<long long>());
for (int i = 0; i < K; ++i)
cout << vec[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long x, y, z, K, a[1005], b[1005], c[1005];
vector<long long> vec;
int main() {
cin >> x >> y >> z >> K;
for (int i = 0; i < x; ++i)
cin >> a[i];
sort(a, a + x, greater<long long>());
for (int i = 0; i < y; ++i)
cin >> b[i];
sort(b, b + y, greater<long long>());
for (int i = 0; i < z; ++i)
cin >> c[i];
sort(c, c + z, greater<long long>());
for (int i = 0; i < x; ++i) {
for (int j = 0; j < y; ++j) {
for (int k = 0; k < z; ++k) {
if ((i + 1) * (j + 1) * (k + 1) <= K)
vec.push_back(a[i] + b[j] + c[k]);
else
break;
}
}
}
sort(vec.begin(), vec.end(), greater<long long>());
for (int i = 0; i < K; ++i)
cout << vec[i] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 896,892 | 896,893 | u678652070 | cpp |
p03078 | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
vector<ll> g[3];
void solve() {
int a, b, c, k;
cin >> a >> b >> c >> k;
g[0].resize(a);
g[1].resize(b);
g[2].resize(c);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < g[i].size(); j++) {
cin >> g[i][j];
}
sort(g[i].begin(), g[i].end());
reverse(g[i].begin(), g[i].end());
}
priority_queue<ll> q;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
for (int k = 0; k < c; k++) {
ll curr = g[0][i] + g[1][j] + g[2][k];
if (q.size() == k && curr <= -q.top())
break;
q.push(-curr);
if (q.size() > k)
q.pop();
}
}
}
vector<ll> ret;
while (q.size()) {
ret.push_back(-q.top());
q.pop();
}
sort(ret.begin(), ret.end());
reverse(ret.begin(), ret.end());
for (ll out : ret)
cout << out << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
}
| #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
vector<ll> g[3];
void solve() {
int a, b, c, kk;
cin >> a >> b >> c >> kk;
g[0].resize(a);
g[1].resize(b);
g[2].resize(c);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < g[i].size(); j++) {
cin >> g[i][j];
}
sort(g[i].begin(), g[i].end());
reverse(g[i].begin(), g[i].end());
}
priority_queue<ll> q;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
for (int k = 0; k < c; k++) {
ll curr = g[0][i] + g[1][j] + g[2][k];
if (q.size() == kk && curr <= -q.top())
break;
q.push(-curr);
if (q.size() > kk)
q.pop();
}
}
}
vector<ll> ret;
while (q.size()) {
ret.push_back(-q.top());
q.pop();
}
sort(ret.begin(), ret.end());
reverse(ret.begin(), ret.end());
for (ll out : ret)
cout << out << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
}
| [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 896,898 | 896,899 | u109256064 | cpp |
p03078 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a[1005], b[1005], c[1005];
int x, y, z, k;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x);
reverse(a, a + x);
sort(b, b + y);
reverse(b, b + y);
sort(c, c + z);
reverse(c, c + z);
vector<ll> abc;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
if ((i + 1) * (j + 1) > k)
break;
for (int l = 0; l < z; l++) {
if ((i + 1) + (j + 1) + (l + 1) > k)
break;
abc.push_back(a[i] + b[j] + c[l]);
}
}
}
sort(abc.begin(), abc.end());
reverse(abc.begin(), abc.end());
for (int i = 0; i < k; i++)
cout << abc[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a[1005], b[1005], c[1005];
int x, y, z, k;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x);
reverse(a, a + x);
sort(b, b + y);
reverse(b, b + y);
sort(c, c + z);
reverse(c, c + z);
vector<ll> abc;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
if ((i + 1) * (j + 1) > k)
break;
for (int l = 0; l < z; l++) {
if ((i + 1) * (j + 1) * (l + 1) > k)
break;
abc.push_back(a[i] + b[j] + c[l]);
}
}
}
sort(abc.begin(), abc.end());
reverse(abc.begin(), abc.end());
for (int i = 0; i < k; i++)
cout << abc[i] << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 896,914 | 896,915 | u876558178 | cpp |
p03078 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define mod 1000000007
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main() {
int X, Y, Z;
int K;
cin >> X >> Y >> Z;
cin >> K;
vector<long long> A(X), B(Y), C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
vector<long long> AB;
rep(i, A.size()) rep(j, B.size()) AB.push_back(A[i] + B[j]);
sort(AB.begin(), AB.end(), greater<long long>());
vector<long long> ABC;
if (K < AB.size())
rep(i, K) rep(j, C.size()) ABC.push_back(AB[i] + C[j]);
else
rep(i, K) rep(j, C.size()) ABC.push_back(AB[i] + C[j]);
sort(ABC.begin(), ABC.end(), greater<long long>());
rep(i, K) cout << ABC[i] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define mod 1000000007
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main() {
int X, Y, Z;
int K;
cin >> X >> Y >> Z;
cin >> K;
vector<long long> A(X), B(Y), C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
vector<long long> AB;
rep(i, A.size()) rep(j, B.size()) AB.push_back(A[i] + B[j]);
sort(AB.begin(), AB.end(), greater<long long>());
vector<long long> ABC;
if (K < AB.size())
rep(i, K) rep(j, C.size()) ABC.push_back(AB[i] + C[j]);
else
rep(i, AB.size()) rep(j, C.size()) ABC.push_back(AB[i] + C[j]);
sort(ABC.begin(), ABC.end(), greater<long long>());
rep(i, K) cout << ABC[i] << endl;
return 0;
} | [
"call.arguments.change",
"call.add"
] | 896,916 | 896,917 | u859125915 | cpp |
p03081 | #include <stdio.h>
using namespace std;
int n, q;
char s[200000], t[200000], d[200000];
char last_place(int index) {
for (int i = 0; i < q; i++) {
if (s[index] == t[i]) {
if (d[i] == 'R')
index++;
else
index--;
}
if (index == -1)
return 'l'; // lift
else if (index == n)
return 'r'; // right
}
return 'i'; // inside
}
int l_limit(int l, int r) {
int mid = (r + l) / 2;
if (mid == r)
return mid - 1;
else if (mid == l)
return mid;
// int index = mid;
char result = last_place(mid);
if (result == 'l')
return l_limit(mid, r);
return l_limit(l, mid);
}
int r_limit(int l, int r) {
int mid = (r + l) / 2;
if (mid == r)
return mid;
else if (mid == l)
return mid + 1;
char result = last_place(mid);
if (result == 'r')
return r_limit(l, mid);
return r_limit(mid, r);
}
int main() {
scanf("%d%d", &n, &q);
scanf("%s", s);
for (int i = 0; i < q; i++) {
scanf(" %c %c", &t[i], &d[i]);
}
int vanish_left = l_limit(-1, n) + 1;
int vanish_right = n - r_limit(-1, n);
printf("%d\n", n - vanish_left + vanish_right);
return 0;
}
| #include <stdio.h>
using namespace std;
int n, q;
char s[200001], t[200000], d[200000];
char last_place(int index) {
for (int i = 0; i < q; i++) {
if (s[index] == t[i]) {
if (d[i] == 'R')
index++;
else
index--;
}
if (index == -1)
return 'l'; // lift
else if (index == n)
return 'r'; // right
}
return 'i'; // inside
}
int l_limit(int l, int r) {
int mid = (r + l) / 2;
if (mid == r)
return mid - 1;
else if (mid == l)
return mid;
char result = last_place(mid);
if (result == 'l')
return l_limit(mid, r);
return l_limit(l, mid);
}
int r_limit(int l, int r) {
int mid = (r + l) / 2;
if (mid == r)
return mid;
else if (mid == l)
return mid + 1;
char result = last_place(mid);
if (result == 'r')
return r_limit(l, mid);
return r_limit(mid, r);
}
int main() {
scanf("%d%d", &n, &q);
scanf("%s", s);
for (int i = 0; i < q; i++) {
scanf(" %c %c", &t[i], &d[i]);
}
int vanish_left = l_limit(-1, n) + 1;
int vanish_right = n - r_limit(-1, n);
printf("%d\n", n - vanish_left - vanish_right);
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 896,927 | 896,925 | u638659855 | cpp |
p03081 | #include <stdio.h>
using namespace std;
int n, q;
char s[200000], t[200000], d[200000];
char last_place(int index) {
for (int i = 0; i < q; i++) {
if (s[index] == t[i]) {
if (d[i] == 'R')
index++;
else
index--;
}
if (index == -1)
return 'l'; // lift
else if (index == n)
return 'r'; // right
}
return 'i'; // inside
}
int l_limit(int l, int r) {
int mid = (r + l) / 2;
if (mid == r)
return mid - 1;
else if (mid == l)
return mid;
// int index = mid;
char result = last_place(mid);
if (result == 'l')
return l_limit(mid, r);
return l_limit(l, mid);
}
int r_limit(int l, int r) {
int mid = (r + l) / 2;
if (mid == r)
return mid;
else if (mid == l)
return mid + 1;
char result = last_place(mid);
if (result == 'r')
return r_limit(l, mid);
return r_limit(mid, r);
}
int main() {
scanf("%d%d", &n, &q);
scanf("%s", s);
for (int i = 0; i < q; i++) {
scanf(" %c %c", &t[i], &d[i]);
}
int vanish_left = l_limit(-1, n) + 1;
int vanish_right = n - r_limit(-1, n);
printf("%d\n", n - vanish_left + vanish_right);
return 0;
}
| #include <stdio.h>
using namespace std;
int n, q;
char s[200001], t[200000], d[200001];
char last_place(int index) {
for (int i = 0; i < q; i++) {
if (s[index] == t[i]) {
if (d[i] == 'R')
index++;
else
index--;
}
if (index == -1)
return 'l'; // lift
else if (index == n)
return 'r'; // right
}
return 'i'; // inside
}
int l_limit(int l, int r) {
int mid = (r + l) / 2;
if (mid == r)
return mid - 1;
else if (mid == l)
return mid;
char result = last_place(mid);
if (result == 'l')
return l_limit(mid, r);
return l_limit(l, mid);
}
int r_limit(int l, int r) {
int mid = (r + l) / 2;
if (mid == r)
return mid;
else if (mid == l)
return mid + 1;
char result = last_place(mid);
if (result == 'r')
return r_limit(l, mid);
return r_limit(mid, r);
}
int main() {
scanf("%d%d", &n, &q);
scanf("%s", s);
for (int i = 0; i < q; i++) {
scanf(" %c %c", &t[i], &d[i]);
}
int vanish_left = l_limit(-1, n) + 1;
int vanish_right = n - r_limit(-1, n);
printf("%d\n", n - vanish_left - vanish_right);
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 896,927 | 896,928 | u638659855 | cpp |
p03081 | #include <stdio.h>
using namespace std;
int n, q;
char s[200000], t[200000], d[200000];
char last_place(int index) {
for (int i = 0; i < q; i++) {
if (s[index] == t[i]) {
if (d[i] == 'R')
index++;
else
index--;
}
if (index == -1)
return 'l'; // lift
else if (index == n)
return 'r'; // right
}
return 'i'; // inside
}
int l_limit(int l, int r) {
int mid = (r + l) / 2;
if (mid == r)
return mid - 1;
else if (mid == l)
return mid;
// int index = mid;
char result = last_place(mid);
if (result == 'l')
return l_limit(mid, r);
return l_limit(l, mid);
}
int r_limit(int l, int r) {
int mid = (r + l) / 2;
if (mid == r)
return mid;
else if (mid == l)
return mid + 1;
char result = last_place(mid);
if (result == 'r')
return r_limit(l, mid);
return r_limit(mid, r);
}
int main() {
scanf("%d%d", &n, &q);
scanf("%s", s);
for (int i = 0; i < q; i++) {
scanf(" %c %c", &t[i], &d[i]);
}
int vanish_left = l_limit(-1, n) + 1;
int vanish_right = n - r_limit(-1, n);
printf("%d\n", n - vanish_left + vanish_right);
return 0;
}
| #include <stdio.h>
using namespace std;
int n, q;
char s[200001], t[200001], d[200001];
char last_place(int index) {
for (int i = 0; i < q; i++) {
if (s[index] == t[i]) {
if (d[i] == 'R')
index++;
else
index--;
}
if (index == -1)
return 'l'; // lift
else if (index == n)
return 'r'; // right
}
return 'i'; // inside
}
int l_limit(int l, int r) {
int mid = (r + l) / 2;
if (mid == r)
return mid - 1;
else if (mid == l)
return mid;
char result = last_place(mid);
if (result == 'l')
return l_limit(mid, r);
return l_limit(l, mid);
}
int r_limit(int l, int r) {
int mid = (r + l) / 2;
if (mid == r)
return mid;
else if (mid == l)
return mid + 1;
char result = last_place(mid);
if (result == 'r')
return r_limit(l, mid);
return r_limit(mid, r);
}
int main() {
scanf("%d%d", &n, &q);
scanf("%s", s);
for (int i = 0; i < q; i++) {
scanf(" %c %c", &t[i], &d[i]);
}
int vanish_left = l_limit(-1, n) + 1;
int vanish_right = n - r_limit(-1, n);
printf("%d\n", n - vanish_left - vanish_right);
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 896,927 | 896,929 | u638659855 | cpp |
p03081 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool check(int i, string &s, vector<char> &t, vector<char> &d, int c) {
for (int j = 0; j < t.size(); j++) {
if (s[i] == t[j]) {
if (d[j] == 'R')
i++;
else
i--;
}
}
return i == c;
}
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
s.insert(s.begin(), '#');
vector<char> t(q), d(q);
s.push_back('#');
for (int i = 0; i < n; i++)
cin >> t[i] >> d[i];
int ok1 = 0, ng1 = n + 1;
while (ng1 - ok1 > 1) {
int mid = (ok1 + ng1) / 2;
if (check(mid, s, t, d, 0)) {
ok1 = mid;
} else {
ng1 = mid;
}
}
int ok2 = n + 1, ng2 = 0;
while (ok2 - ng2 > 1) {
int mid = (ok2 + ng2) / 2;
if (check(mid, s, t, d, n + 1)) {
ok2 = mid;
} else {
ng2 = mid;
}
}
cout << ng2 - ok1;
cerr << ok1 << endl;
cerr << ng1 << endl;
cerr << ng2 << endl;
cerr << ok2 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool check(int i, string &s, vector<char> &t, vector<char> &d, int c) {
for (int j = 0; j < t.size(); j++) {
if (s[i] == t[j]) {
if (d[j] == 'R')
i++;
else
i--;
}
}
return i == c;
}
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
s.insert(s.begin(), '#');
vector<char> t(q), d(q);
s.push_back('#');
for (int i = 0; i < q; i++)
cin >> t[i] >> d[i];
int ok1 = 0, ng1 = n + 1;
while (ng1 - ok1 > 1) {
int mid = (ok1 + ng1) / 2;
if (check(mid, s, t, d, 0)) {
ok1 = mid;
} else {
ng1 = mid;
}
}
int ok2 = n + 1, ng2 = 0;
while (ok2 - ng2 > 1) {
int mid = (ok2 + ng2) / 2;
if (check(mid, s, t, d, n + 1)) {
ok2 = mid;
} else {
ng2 = mid;
}
}
cout << ng2 - ok1;
cerr << ok1 << endl;
cerr << ng1 << endl;
cerr << ng2 << endl;
cerr << ok2 << endl;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 896,940 | 896,941 | u809153881 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
char T[200000], D[200000];
rep(i, Q) { cin >> T[i] >> D[i]; }
int L = -1;
for (int i = Q - 1; i >= 0; i--) {
if (L < N - 1 && D[i] == 'L' && S[L + 1] == T[i])
L++;
else if (L >= 0 && D[i] == 'R' && S[L] == T[i])
L--;
}
int R = N;
for (int i = Q - 1; i >= 0; i--) {
if (R > 0 && D[i] == 'R' && S[R - 1] == T[i])
R--;
else if (R < N && D[i] == 'L' && S[R] == T[i])
L--;
}
int kotae = max(0, R - L - 1);
co(kotae);
Would you please return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
char T[200000], D[200000];
rep(i, Q) { cin >> T[i] >> D[i]; }
int L = -1;
for (int i = Q - 1; i >= 0; i--) {
if (L < N - 1 && D[i] == 'L' && S[L + 1] == T[i])
L++;
else if (L >= 0 && D[i] == 'R' && S[L] == T[i])
L--;
}
int R = N;
for (int i = Q - 1; i >= 0; i--) {
if (R > 0 && D[i] == 'R' && S[R - 1] == T[i])
R--;
else if (R < N && D[i] == 'L' && S[R] == T[i])
R++;
}
int kotae = max(0, R - L - 1);
co(kotae);
Would you please return 0;
} | [] | 896,953 | 896,954 | u096883693 | cpp |
p03081 | #include <cstring>
#include <iostream>
using namespace std;
typedef pair<char, char> P;
int n, q;
string s;
P td[200005];
int ans;
int ans2;
bool cimu(int pos, bool swi) {
for (int i = 0; i < q; i++) {
if (td[i].first != s[pos])
continue;
if (td[i].second == 'L')
pos--;
else
pos++;
if (pos < 0 && swi)
return true;
else if (pos >= n && !swi)
return true;
}
return false;
}
void solve() {
int l = -1, r = n + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
// cout << "l1 = "<<l <<" r1 = "<<r<< endl;
if (cimu(mid, true) == true)
l = mid;
else
r = mid;
}
ans = l;
// cout << ans << endl;
l = -1;
r = n + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
// cout << "l2 = "<<l <<" r2 = "<<r<< endl;
if (cimu(mid, false) == true)
r = mid;
else
l = mid;
}
ans2 = n - l;
return;
}
int main() {
cin >> n >> q >> s;
for (int i = 0; i < q; i++)
cin >> td[i].first >> td[i].second;
solve();
cout << n - (ans + ans2) << endl;
}
| #include <cstring>
#include <iostream>
using namespace std;
typedef pair<char, char> P;
int n, q;
string s;
P td[200005];
int ans;
int ans2;
bool cimu(int pos, bool swi) {
for (int i = 0; i < q; i++) {
if (td[i].first != s[pos])
continue;
if (td[i].second == 'L')
pos--;
else
pos++;
if (pos < 0 && swi)
return true;
else if (pos >= n && !swi)
return true;
}
return false;
}
void solve() {
int l = -1, r = n;
while (r - l > 1) {
int mid = (l + r) / 2;
// cout << "l1 = "<<l <<" r1 = "<<r<< endl;
if (cimu(mid, true) == true)
l = mid;
else
r = mid;
}
ans = l;
// cout << ans << endl;
l = -1;
r = n;
while (r - l > 1) {
int mid = (l + r) / 2;
// cout << "l2 = "<<l <<" r2 = "<<r<< endl;
if (cimu(mid, false) == true)
r = mid;
else
l = mid;
}
ans2 = n - l;
return;
}
int main() {
cin >> n >> q >> s;
for (int i = 0; i < q; i++)
cin >> td[i].first >> td[i].second;
solve();
cout << n - (ans + ans2) << endl;
}
| [
"expression.operation.binary.remove"
] | 896,957 | 896,958 | u126361752 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define forrn(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define PYMOD(a, m) ((((a) % (m)) + (m)) % (m))
#define all(v) v.begin(), v.end()
#define mp make_pair
#define ff first
#define ss second
const int mod = 1e9 + 7;
struct query {
char t;
char d;
};
enum result { LEFT, STAY, RIGHT };
result where(int i, const string &s, const vector<query> &qs) {
for (const query &q : qs) {
if (q.t == s[i]) {
if (q.d == 'L')
i--;
else
i++;
}
if (i < 0)
return LEFT;
else if (i >= (int)s.size())
return RIGHT;
}
return STAY;
}
int main() {
// Code here:
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<query> qs(q);
for (query &qu : qs)
cin >> qu.t >> qu.d;
int ans = n;
int lt = -1, rt = n - 1;
while (lt < rt - 1) {
int mid = (lt + rt) / 2;
if (where(mid, s, qs) == LEFT)
lt = mid;
else
rt = mid;
}
cerr << "last LEFT: " << lt << endl;
ans -= rt;
lt = rt;
rt = n;
while (lt < rt - 1) {
int mid = (lt + rt) / 2;
if (where(mid, s, qs) == STAY)
lt = mid;
else
rt = mid;
}
cerr << "first RIGHT: " << rt << endl;
ans -= n - rt;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define forrn(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define PYMOD(a, m) ((((a) % (m)) + (m)) % (m))
#define all(v) v.begin(), v.end()
#define mp make_pair
#define ff first
#define ss second
const int mod = 1e9 + 7;
struct query {
char t;
char d;
};
enum result { LEFT, STAY, RIGHT };
result where(int i, const string &s, const vector<query> &qs) {
for (const query &q : qs) {
if (q.t == s[i]) {
if (q.d == 'L')
i--;
else
i++;
}
if (i < 0)
return LEFT;
else if (i >= (int)s.size())
return RIGHT;
}
return STAY;
}
int main() {
// Code here:
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<query> qs(q);
for (query &qu : qs)
cin >> qu.t >> qu.d;
int ans = n;
int lt = -1, rt = n - 1;
while (lt < rt - 1) {
int mid = (lt + rt) / 2;
if (where(mid, s, qs) == LEFT)
lt = mid;
else
rt = mid;
}
cerr << "last LEFT: " << lt << endl;
ans -= rt;
rt = n;
while (lt < rt - 1) {
int mid = (lt + rt) / 2;
if (where(mid, s, qs) == STAY)
lt = mid;
else
rt = mid;
}
cerr << "first RIGHT: " << rt << endl;
ans -= n - rt;
cout << ans << endl;
return 0;
}
| [] | 896,969 | 896,970 | u725927710 | cpp |
p03081 | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
bool vanish(int n, string s, vector<string> t, vector<string> d, int m) {
int Q = t.size();
int x = n - 1;
int L = s.length();
for (int i = 0; i < Q; i++) {
if (t[i][0] == s[x]) {
x += (d[i][0] == 'R' ? 1 : -1);
if (x == -1 || x == L)
break;
}
}
if (x == -1 && m == 0) {
return true;
} else if (x == L && m == 1) {
return true;
} else {
return false;
}
}
int main() {
int N, Q;
string s;
cin >> N >> Q >> s;
vector<string> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int Lleft = 0, Lright = N + 1;
while (Lright - Lleft > 1) {
int mid = Lleft + (Lright - Lleft) / 2;
if (vanish(mid, s, t, d, 0)) {
Lleft = mid;
} else {
Lright = mid;
}
// cout << Lleft << " " << Lright << endl;
}
int Rleft = 0, Rright = N + 1;
while (Rright - Rleft > 1) {
int mid = Rleft + (Rright - Rleft) / 2;
if (vanish(mid, s, t, d, 1)) {
Rright = mid;
} else {
Rleft = mid;
}
}
if (Rleft >= Lright) {
cout << Rleft - Lright + 1 << endl;
} else {
cout << N << endl;
}
}
| #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
bool vanish(int n, string s, vector<string> t, vector<string> d, int m) {
int Q = t.size();
int x = n - 1;
int L = s.length();
for (int i = 0; i < Q; i++) {
if (t[i][0] == s[x]) {
x += (d[i][0] == 'R' ? 1 : -1);
if (x == -1 || x == L)
break;
}
}
if (x == -1 && m == 0) {
return true;
} else if (x == L && m == 1) {
return true;
} else {
return false;
}
}
int main() {
int N, Q;
string s;
cin >> N >> Q >> s;
vector<string> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int Lleft = 0, Lright = N + 1;
while (Lright - Lleft > 1) {
int mid = Lleft + (Lright - Lleft) / 2;
if (vanish(mid, s, t, d, 0)) {
Lleft = mid;
} else {
Lright = mid;
}
// cout << Lleft << " " << Lright << endl;
}
int Rleft = 0, Rright = N + 1;
while (Rright - Rleft > 1) {
int mid = Rleft + (Rright - Rleft) / 2;
if (vanish(mid, s, t, d, 1)) {
Rright = mid;
} else {
Rleft = mid;
}
}
if (Rleft >= Lright) {
cout << Rleft - Lright + 1 << endl;
} else {
cout << 0 << endl;
}
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 896,980 | 896,981 | u119098168 | cpp |
p03081 | #include <iostream>
#include <string>
#define MAX_SIZE (200 * 1000)
char query[MAX_SIZE][2];
bool die(int pos, int N, int Q, std::string text, bool isLeft) {
for (int i = 0; i < Q; ++i) {
if (text[pos] == query[i][0]) {
if (query[i][1] == 'L') {
--pos;
} else {
++pos;
}
if (pos < 0) {
return isLeft;
}
if (pos >= N) {
return !isLeft;
}
}
}
return false;
}
int main() {
int N, Q;
std::string text;
std::cin >> N >> Q >> text;
for (int i = 0; i < Q; ++i) {
std::cin >> query[i][0] >> query[i][1];
}
bool visited[MAX_SIZE];
for (int i = 0; i < N; ++i) {
visited[i] = false;
}
int Lmin = -1;
int Lmax = N;
int Rmin = -1;
int Rmax = N;
for (int i = 0; i < 20; ++i) {
int Lpos = (Lmin + Lmax + 1) / 2;
if (die(Lpos, N, Q, text, true)) {
Lmin = Lpos;
} else {
Lmax = Lpos;
}
int Rpos = (Rmin + Rmax - 1) / 2;
if (die(Rpos, N, Q, text, false)) {
Rmax = Rpos;
} else {
Rmin = Rpos;
}
}
if (Lmin > Rmax) {
std::cout << 0 << std::endl;
} else {
std::cout << (Rmax - Lmin - 1) << std::endl;
}
return 0;
}
| #include <iostream>
#include <string>
#define MAX_SIZE (200 * 1000)
char query[MAX_SIZE][2];
bool die(int pos, int N, int Q, std::string text, bool isLeft) {
for (int i = 0; i < Q; ++i) {
if (text[pos] == query[i][0]) {
if (query[i][1] == 'L') {
--pos;
} else {
++pos;
}
if (pos < 0) {
return isLeft;
}
if (pos >= N) {
return !isLeft;
}
}
}
return false;
}
int main() {
int N, Q;
std::string text;
std::cin >> N >> Q >> text;
for (int i = 0; i < Q; ++i) {
std::cin >> query[i][0] >> query[i][1];
}
bool visited[MAX_SIZE];
for (int i = 0; i < N; ++i) {
visited[i] = false;
}
int Lmin = -1;
int Lmax = N;
int Rmin = -1;
int Rmax = N;
for (int i = 0; i < 20; ++i) {
int Lpos = (Lmin + Lmax) / 2;
if (die(Lpos, N, Q, text, true)) {
Lmin = Lpos;
} else {
Lmax = Lpos;
}
int Rpos = (Rmin + Rmax) / 2;
if (die(Rpos, N, Q, text, false)) {
Rmax = Rpos;
} else {
Rmin = Rpos;
}
}
if (Lmin > Rmax) {
std::cout << 0 << std::endl;
} else {
std::cout << (Rmax - Lmin - 1) << std::endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 896,984 | 896,985 | u716085737 | cpp |
p03081 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
const int MAXN = 234567;
char s[MAXN];
int t[MAXN], d[MAXN];
bool check1(int ans, int N, int Q) {
int cur = ans;
for (int i = 0; i < Q; i++) {
if (s[cur] - 'A' != t[i])
continue;
cur += d[i];
if (cur < 0)
return true;
}
return false;
}
bool check2(int ans, int N, int Q) {
int cur = ans;
for (int i = 0; i < Q; i++) {
if (s[cur] - 'A' != t[i])
continue;
cur += d[i];
if (cur >= N)
return true;
}
return false;
}
int main() {
int N, Q;
scanf("%d %d", &N, &Q);
scanf("%s", s);
for (int i = 0; i < Q; i++) {
char tmp[6];
scanf("%s", tmp);
t[i] = tmp[0] - 'A';
scanf("%s", tmp);
if (tmp[0] == 'R')
d[i] = 1;
else
d[i] = -1;
}
int l = 0, r = N + 1, ans1 = -1, ans2 = N;
while (l < r) {
int mid = (l + r) / 2;
if (check1(mid, N, Q)) {
ans1 = mid;
l = mid + 1;
} else
r = mid;
}
l = 0, r = N + 1;
while (l < r) {
int mid = (l + r) / 2;
if (check2(mid, N, Q)) {
ans2 = mid;
r = mid;
} else
l = mid + 1;
}
int ans = N;
ans -= (ans1 + 1);
ans -= (N - ans2);
if (ans < 0)
ans = 0;
printf("%d\n", ans);
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
const int MAXN = 234567;
char s[MAXN];
int t[MAXN], d[MAXN];
bool check1(int ans, int N, int Q) {
int cur = ans;
for (int i = 0; i < Q; i++) {
if (s[cur] - 'A' != t[i])
continue;
cur += d[i];
if (cur < 0)
return true;
}
return false;
}
bool check2(int ans, int N, int Q) {
int cur = ans;
for (int i = 0; i < Q; i++) {
if (s[cur] - 'A' != t[i])
continue;
cur += d[i];
if (cur >= N)
return true;
}
return false;
}
int main() {
int N, Q;
scanf("%d %d", &N, &Q);
scanf("%s", s);
for (int i = 0; i < Q; i++) {
char tmp[6];
scanf("%s", tmp);
t[i] = tmp[0] - 'A';
scanf("%s", tmp);
if (tmp[0] == 'R')
d[i] = 1;
else
d[i] = -1;
}
int l = 0, r = N, ans1 = -1, ans2 = N;
while (l < r) {
int mid = (l + r) / 2;
if (check1(mid, N, Q)) {
ans1 = mid;
l = mid + 1;
} else
r = mid;
}
l = 0, r = N;
while (l < r) {
int mid = (l + r) / 2;
if (check2(mid, N, Q)) {
ans2 = mid;
r = mid;
} else
l = mid + 1;
}
int ans = N;
ans -= (ans1 + 1);
ans -= (N - ans2);
if (ans < 0)
ans = 0;
printf("%d\n", ans);
return 0;
}
| [
"expression.operation.binary.remove"
] | 896,986 | 896,987 | u004342119 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_r(i, n, m) for (int i = m; i < n; i++)
#define END cout << endl
#define MOD 1000000007
#define pb push_back
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<int>())
typedef pair<char, char> pc;
int main() {
int n, q;
string s;
cin >> n >> q;
cin >> s;
vector<char> t(q), d(q);
rep(i, q) cin >> t[i] >> d[i];
ll a, b;
{
auto check = [&](int mid) {
ll mmid = mid;
for (int i = 0; i < q; ++i) {
if (s[mmid] == t[i]) {
if (d[i] == 'R')
mmid += 1;
else
mmid -= 1;
}
// 左に落ちた
if (mmid < 0)
return true;
}
// 落ちない or 右に落ちる
return false;
};
int l = 0, r = n - 1;
while (r - l > 0) {
int mid = (l + r) / 2;
if (check(mid)) {
l = mid + 1;
} else {
r = mid - 1;
}
}
a = l;
}
{
auto check = [&](int mid) {
ll mmid = mid;
for (int i = 0; i < q; ++i) {
if (s[mmid] == t[i]) {
if (d[i] == 'R')
mmid += 1;
else
mmid -= 1;
}
// 右に落ちた
if (mmid >= n)
return true;
}
// 落ちない or 左に落ちる
return false;
};
int l = 0, r = n - 1;
while (r - l > 0) {
int mid = (l + r) / 2;
if (check(mid)) {
r = mid - 1;
} else {
l = mid + 1;
}
}
b = r;
}
if (b - a < 0)
cout << 0 << endl;
else
cout << b - a << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_r(i, n, m) for (int i = m; i < n; i++)
#define END cout << endl
#define MOD 1000000007
#define pb push_back
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<int>())
typedef pair<char, char> pc;
int main() {
int n, q;
string s;
cin >> n >> q;
cin >> s;
vector<char> t(q), d(q);
rep(i, q) cin >> t[i] >> d[i];
ll a, b;
{
auto check = [&](int mid) {
ll mmid = mid;
for (int i = 0; i < q; ++i) {
if (s[mmid] == t[i]) {
if (d[i] == 'R')
mmid += 1;
else
mmid -= 1;
}
// 左に落ちた
if (mmid < 0)
return true;
}
// 落ちない or 右に落ちる
return false;
};
int l = 0, r = n - 1;
while (r - l >= 0) {
int mid = (l + r) / 2;
if (check(mid)) {
l = mid + 1;
} else {
r = mid - 1;
}
}
a = l;
}
{
auto check = [&](int mid) {
ll mmid = mid;
for (int i = 0; i < q; ++i) {
if (s[mmid] == t[i]) {
if (d[i] == 'R')
mmid += 1;
else
mmid -= 1;
}
// 右に落ちた
if (mmid >= n)
return true;
}
// 落ちない or 左に落ちる
return false;
};
int l = 0, r = n - 1;
while (r - l >= 0) {
int mid = (l + r) / 2;
if (check(mid)) {
r = mid - 1;
} else {
l = mid + 1;
}
}
b = r;
}
// cout << a << " " << b << endl;
if (b - a < 0)
cout << 0 << endl;
else
cout << b - a + 1 << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 897,017 | 897,018 | u898749314 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define fill0(ar) fill((ar), 0)
#define fillinf(ar, n) fr(i, 0, (n)) ar[i] = INF
#define debug(x) cout << #x << ": " << x << endl
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
/*Author Ritick Goenka || ritick(codechef) ||ritick(codeforces) */
/*IIT Roorkee = <3 */
#define ull unsigned long long
#define ld double
#define ui unsigned int
#define all(ar) ar.begin(), ar.end()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define y0 yyyyyy0
#define y1 yyyyyy1
#define sot(bello) bello.begin(), bello.end()
#define BIT(n) (1 << (n))
#define SQR(x) ((x) * (x))
#define CUBE(x) ((x) * (x) * (x))
#define LSOne(S) (S) & (-S)
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<string> vs;
template <typename T> inline T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <typename T> inline T lcm(T a, T b) { return (a * b) / gcd(a, b); }
template <typename T> string toStr(T x) {
stringstream st;
st << x;
string s;
st >> s;
return s;
}
template <class T> void splitStr(const string &s, vector<T> &out) {
istringstream in(s);
out.clear();
copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));
}
inline int two(int n) { return 1 << n; }
inline int isOnBit(int n, int b) { return (n >> b) & 1; }
inline void onBit(int &n, int b) { n |= two(b); }
inline void offBit(int &n, int b) { n &= ~two(b); }
inline int lastBit(int n) { return n & (-n); }
inline int cntBit(int n) {
int res = 0;
while (n && ++res)
n -= n & (-n);
return res;
}
const int dx4[] = {-1, 0, 1, 0};
const int dy4[] = {0, 1, 0, -1};
const int dx8[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy8[] = {0, 1, 0, -1, -1, 1, -1, 1};
#define INP "test.inp"
#define OUT "test.out"
#define PI 3.1415926535897932385
#define INF 1000000000000000
#define EPS 1e-7
#define MAXN 100000
#define MOD 1000000007
#define dec decr
#define endl '\n'
// END OF COMPETITVE PROGRAMMING TEMPLATE
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll modexp(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll n, q;
string s;
vector<pair<char, char>> v;
ll checkleft(ll x) {
// debug(x);
ll cur = x;
rep(i, q) {
// debug(cur);
if (s[cur] == v[i].ff) {
if (v[i].ss == 'R') {
cur++;
} else {
cur--;
}
if (cur == -1)
return 1;
else if (cur == n)
return 0;
}
}
return 0;
}
ll checkright(ll x) {
ll cur = x;
rep(i, n) {
if (s[cur] == v[i].ff) {
if (v[i].ss == 'R') {
cur++;
} else {
cur--;
}
if (cur == n)
return 1;
else if (cur == -1)
return 0;
}
}
return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << setprecision(11);
cin >> n >> q;
cin >> s;
rep(i, q) {
char a, b;
cin >> a >> b;
v.pb(mp(a, b));
}
ll l = 0, r = n - 1;
ll ans1 = -1;
ll ans2 = n;
while (l <= r) {
ll mid = (l + r) / 2;
if (checkleft(mid)) {
ans1 = max(ans1, mid);
l = mid + 1;
} else {
r = mid - 1;
}
}
l = 0, r = n - 1;
while (l <= r) {
ll mid = (l + r) / 2;
if (checkright(mid)) {
ans2 = min(ans2, mid);
r = mid - 1;
} else {
l = mid + 1;
}
}
// debug(ans2);
// debug(ans1);
cout << ans2 - ans1 - 1;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define fill0(ar) fill((ar), 0)
#define fillinf(ar, n) fr(i, 0, (n)) ar[i] = INF
#define debug(x) cout << #x << ": " << x << endl
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
/*Author Ritick Goenka || ritick(codechef) ||ritick(codeforces) */
/*IIT Roorkee = <3 */
#define ull unsigned long long
#define ld double
#define ui unsigned int
#define all(ar) ar.begin(), ar.end()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define y0 yyyyyy0
#define y1 yyyyyy1
#define sot(bello) bello.begin(), bello.end()
#define BIT(n) (1 << (n))
#define SQR(x) ((x) * (x))
#define CUBE(x) ((x) * (x) * (x))
#define LSOne(S) (S) & (-S)
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<string> vs;
template <typename T> inline T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <typename T> inline T lcm(T a, T b) { return (a * b) / gcd(a, b); }
template <typename T> string toStr(T x) {
stringstream st;
st << x;
string s;
st >> s;
return s;
}
template <class T> void splitStr(const string &s, vector<T> &out) {
istringstream in(s);
out.clear();
copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));
}
inline int two(int n) { return 1 << n; }
inline int isOnBit(int n, int b) { return (n >> b) & 1; }
inline void onBit(int &n, int b) { n |= two(b); }
inline void offBit(int &n, int b) { n &= ~two(b); }
inline int lastBit(int n) { return n & (-n); }
inline int cntBit(int n) {
int res = 0;
while (n && ++res)
n -= n & (-n);
return res;
}
const int dx4[] = {-1, 0, 1, 0};
const int dy4[] = {0, 1, 0, -1};
const int dx8[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy8[] = {0, 1, 0, -1, -1, 1, -1, 1};
#define INP "test.inp"
#define OUT "test.out"
#define PI 3.1415926535897932385
#define INF 1000000000000000
#define EPS 1e-7
#define MAXN 100000
#define MOD 1000000007
#define dec decr
#define endl '\n'
// END OF COMPETITVE PROGRAMMING TEMPLATE
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll modexp(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll n, q;
string s;
vector<pair<char, char>> v;
ll checkleft(ll x) {
ll cur = x;
rep(i, q) {
if (s[cur] == v[i].ff) {
if (v[i].ss == 'R') {
cur++;
} else {
cur--;
}
if (cur == -1)
return 1;
else if (cur == n)
return 0;
}
}
return 0;
}
ll checkright(ll x) {
ll cur = x;
rep(i, q) {
if (s[cur] == v[i].ff) {
if (v[i].ss == 'R') {
cur++;
} else {
cur--;
}
if (cur == n)
return 1;
else if (cur == -1)
return 0;
}
}
return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << setprecision(11);
cin >> n >> q;
cin >> s;
rep(i, q) {
char a, b;
cin >> a >> b;
v.pb(mp(a, b));
}
ll l = 0, r = n - 1;
ll ans1 = -1;
ll ans2 = n;
while (l <= r) {
ll mid = (l + r) / 2;
if (checkleft(mid)) {
ans1 = max(ans1, mid);
l = mid + 1;
} else {
r = mid - 1;
}
}
l = 0, r = n - 1;
while (l <= r) {
ll mid = (l + r) / 2;
if (checkright(mid)) {
ans2 = min(ans2, mid);
r = mid - 1;
} else {
l = mid + 1;
}
}
cout << ans2 - ans1 - 1;
} | [] | 897,019 | 897,020 | u795058347 | cpp |
p03081 | #include <iostream>
#define NMAX (2 * 100000)
int main() {
int N, Q;
std::string S;
std::cin >> N >> Q;
std::cin >> S;
using P = std::pair<char, char>;
P temp, td[NMAX];
for (int i = 0; i < Q; ++i) {
std::cin >> temp.first >> temp.second;
td[i] = temp;
}
int lcur = 0;
int rcur = N - 1;
for (int i = Q - 1; i >= 0; --i) {
// std::cout << td[i].first << " " << td[i].second << std::endl;
if (S[lcur] == td[i].first && td[i].second == 'L') {
lcur++;
} else if (S[lcur - 1] == td[i].first && td[i].second == 'R' && lcur != 0) {
lcur--;
} else if (S[rcur] == td[i].first && td[i].second == 'R') {
rcur--;
} else if (S[rcur + 1] == td[i].first && td[i].second == 'L' && rcur != N) {
rcur++;
}
// std::cout << lcur << " " << rcur << std::endl;
}
int ans = N;
if (lcur >= 0)
ans -= lcur;
if (rcur <= N - 1)
ans -= ((N - 1) - rcur);
std::cout << ans << std::endl;
} | #include <iostream>
#define NMAX (2 * 100000)
int main() {
int N, Q;
std::string S;
std::cin >> N >> Q;
std::cin >> S;
using P = std::pair<char, char>;
P temp, td[NMAX];
for (int i = 0; i < Q; ++i) {
std::cin >> temp.first >> temp.second;
td[i] = temp;
}
int lcur = 0;
int rcur = N - 1;
for (int i = Q - 1; i >= 0; --i) {
// std::cout << td[i].first << " " << td[i].second << std::endl;
if (S[lcur] == td[i].first && td[i].second == 'L') {
lcur++;
} else if (S[lcur - 1] == td[i].first && td[i].second == 'R' && lcur != 0) {
lcur--;
}
if (S[rcur] == td[i].first && td[i].second == 'R') {
rcur--;
} else if (S[rcur + 1] == td[i].first && td[i].second == 'L' && rcur != N) {
rcur++;
}
// std::cout << lcur << " " << rcur << std::endl;
}
int ans = N;
if (lcur >= 0)
ans -= lcur;
if (rcur <= N - 1)
ans -= ((N - 1) - rcur);
std::cout << ans << std::endl;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 897,033 | 897,034 | u930737792 | cpp |
p03081 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<char> s(n + 2);
s[0] = 'n';
s[n + 1] = 'n';
for (int i = 1; i <= n; ++i)
cin >> s[i];
vector<char> t(q), d(q);
REP(i, q) { cin >> t[i] >> d[i]; }
int left = 0, right = n + 1;
for (int i = q - 1; i >= 0; --i) {
if (d[i] == 'L') {
if (t[i] == s[left + 1])
left++; // point.
else if (t[i] == s[right])
right++;
} else {
if (t[i] == s[right - 1])
right--; // point.
else if (t[i] == s[left])
left--;
}
}
cout << max(0, right - left - 1) << endl;
return 0;
} //解答解説参考. | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<char> s(n + 2);
s[0] = 'n';
s[n + 1] = 'n';
for (int i = 1; i <= n; ++i)
cin >> s[i];
vector<char> t(q), d(q);
REP(i, q) { cin >> t[i] >> d[i]; }
int left = 0, right = n + 1;
for (int i = q - 1; i >= 0; --i) {
if (d[i] == 'L') {
if (t[i] == s[left + 1])
left++; // point.
if (t[i] == s[right])
right++;
} else {
if (t[i] == s[right - 1])
right--; // point.
if (t[i] == s[left])
left--;
}
}
cout << max(0, right - left - 1) << endl;
return 0;
} //解答解説参考. | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 897,037 | 897,038 | u209767598 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.