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 |
|---|---|---|---|---|---|---|---|
p03069 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define yn(ans) \
if (ans) \
printf("Yes\n"); \
else \
printf("No\n")
#define YN(ans) \
if (ans) \
printf("YES\n"); \
else \
printf("NO\n")
#define vector1d(type, name, ...) vector<type> name(__VA_ARGS__)
#define vector2d(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
//入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
//出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
//デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
ll intpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans *= a;
a *= a;
b /= 2;
}
return ans;
}
ll modpow(ll a, ll b, ll p) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= p;
(a *= a) %= p;
b /= 2;
}
return ans;
}
ll updivide(ll a, ll b) {
if (a % b == 0)
return a / b;
else
return (a / b) + 1;
}
int main() {
INT(n);
string s;
cin >> s;
int black = 0, white = 0;
vector<int> b(n), w(n);
rep(i, n) {
black += (s[i] == '#');
white += (s[i] == '.');
b[i] = black;
w[i] = white;
}
int ans = 100000;
rep(i, n) { ans = min(ans, b[i] + white - w[i]); }
out(ans);
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define yn(ans) \
if (ans) \
printf("Yes\n"); \
else \
printf("No\n")
#define YN(ans) \
if (ans) \
printf("YES\n"); \
else \
printf("NO\n")
#define vector1d(type, name, ...) vector<type> name(__VA_ARGS__)
#define vector2d(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
//入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
//出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
//デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
ll intpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans *= a;
a *= a;
b /= 2;
}
return ans;
}
ll modpow(ll a, ll b, ll p) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= p;
(a *= a) %= p;
b /= 2;
}
return ans;
}
ll updivide(ll a, ll b) {
if (a % b == 0)
return a / b;
else
return (a / b) + 1;
}
int main() {
INT(n);
string s;
cin >> s;
int black = 0, white = 0;
vector<int> b(n), w(n);
rep(i, n) {
black += (s[i] == '#');
white += (s[i] == '.');
b[i] = black;
w[i] = white;
}
int ans = min(white, black);
rep(i, n) { ans = min(ans, b[i] + white - w[i]); }
out(ans);
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 879,835 | 879,834 | u225660136 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto i : container)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum accumulate
#define keta fixed << setprecision
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 9223372036854775806ll;
const int mod = 1000000007ll;
const ll MOD = 1000000007LL;
/*メモ
*/
int main() {
int n;
std::cin >> n;
string s;
std::cin >> s;
std::vector<int> c(n), cc(n);
if (s[0] == '#')
c[0] = 1;
if (s[n - 1] == '.')
cc[n - 1] = 1;
rep(i, n - 1) {
c[i + 1] = c[i];
if (s[i + 1] == '#')
c[i + 1]++;
}
irep(i, n - 1) {
cc[i] = cc[i + 1];
if (s[i] == '.')
cc[i]++;
}
// rep(i,n)std::cout << c[i] << std::endl;
int ma = c[n - 1];
rep(i, n - 1) { ma = min(ma, cc[i] + c[i]); }
ma = min(ma, cc[0]);
std::cout << ma << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto i : container)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum accumulate
#define keta fixed << setprecision
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 9223372036854775806ll;
const int mod = 1000000007ll;
const ll MOD = 1000000007LL;
/*メモ
*/
int main() {
int n;
std::cin >> n;
string s;
std::cin >> s;
std::vector<int> c(n), cc(n);
if (s[0] == '#')
c[0] = 1;
if (s[n - 1] == '.')
cc[n - 1] = 1;
rep(i, n - 1) {
c[i + 1] = c[i];
if (s[i + 1] == '#')
c[i + 1]++;
}
irep(i, n - 1) {
cc[i] = cc[i + 1];
if (s[i] == '.')
cc[i]++;
}
// rep(i,n)std::cout << cc[i] << std::endl;
int ma = c[n - 1];
rep(i, n - 1) { ma = min(ma, cc[i + 1] + c[i]); }
ma = min(ma, cc[0]);
std::cout << ma << std::endl;
} | [
"assignment.change"
] | 879,841 | 879,842 | u539011156 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto i : container)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum accumulate
#define keta fixed << setprecision
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 9223372036854775806ll;
const int mod = 1000000007ll;
const ll MOD = 1000000007LL;
/*メモ
*/
int main() {
int n;
std::cin >> n;
string s;
std::cin >> s;
std::vector<int> c(n), cc(n);
if (s[0] == '#')
c[0] = 1;
if (s[n - 1] == '.')
cc[n - 1] = 1;
rep(i, n - 1) {
c[i + 1] = c[i];
if (s[i + 1] == '#')
c[i + 1]++;
}
irep(i, n - 1) {
cc[i] = cc[i + 1];
if (s[i] == '.')
cc[i]++;
}
// rep(i,n)std::cout << cc[i] << std::endl;
int ma = c[n - 1];
rep(i, n - 1) { ma = min(ma, cc[i] + c[i + 1]); }
ma = min(ma, cc[0]);
std::cout << ma << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto i : container)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum accumulate
#define keta fixed << setprecision
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 9223372036854775806ll;
const int mod = 1000000007ll;
const ll MOD = 1000000007LL;
/*メモ
*/
int main() {
int n;
std::cin >> n;
string s;
std::cin >> s;
std::vector<int> c(n), cc(n);
if (s[0] == '#')
c[0] = 1;
if (s[n - 1] == '.')
cc[n - 1] = 1;
rep(i, n - 1) {
c[i + 1] = c[i];
if (s[i + 1] == '#')
c[i + 1]++;
}
irep(i, n - 1) {
cc[i] = cc[i + 1];
if (s[i] == '.')
cc[i]++;
}
// rep(i,n)std::cout << cc[i] << std::endl;
int ma = c[n - 1];
rep(i, n - 1) { ma = min(ma, cc[i + 1] + c[i]); }
ma = min(ma, cc[0]);
std::cout << ma << std::endl;
} | [
"assignment.change",
"expression.operation.binary.remove"
] | 879,843 | 879,842 | u539011156 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
cin >> n >> s;
int cnt_w = 0;
int cnt_b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
cnt_w++;
if (s[i] == '#')
cnt_b++;
}
if (cnt_w == n || cnt_b == n) {
cout << 0 << endl;
return 0;
}
vector<int> rev_accum_w(n + 1, 0);
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '.')
rev_accum_w[i]++;
if (i == n)
continue;
rev_accum_w[i] += rev_accum_w[i + 1];
}
vector<int> accum_b(n + 1, 0);
for (int i = 1; i <= n; i++) {
accum_b[i] += accum_b[i - 1];
if (s[i - 1] == '#')
accum_b[i]++;
}
int ans = 100000000;
for (int i = 1; i <= n - 1; i++) {
int tmp = 0;
tmp += accum_b[i];
tmp += rev_accum_w[i];
ans = min(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
cin >> n >> s;
int cnt_w = 0;
int cnt_b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
cnt_w++;
if (s[i] == '#')
cnt_b++;
}
if (cnt_w == n || cnt_b == n) {
cout << 0 << endl;
return 0;
}
vector<int> rev_accum_w(n + 1, 0);
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '.')
rev_accum_w[i]++;
if (i == n)
continue;
rev_accum_w[i] += rev_accum_w[i + 1];
}
vector<int> accum_b(n + 1, 0);
for (int i = 1; i <= n; i++) {
accum_b[i] += accum_b[i - 1];
if (s[i - 1] == '#')
accum_b[i]++;
}
int ans = 100000000;
for (int i = 0; i <= n; i++) {
int tmp = 0;
tmp += accum_b[i];
tmp += rev_accum_w[i];
ans = min(ans, tmp);
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 879,848 | 879,849 | u221391729 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s;
cin >> n >> s;
int w = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
w++;
}
int b = n - w;
int ans = w;
for (int i = 0; i < n; i++) {
if (s[i] == '#')
b++;
else
w--;
ans = min(ans, b + w);
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s;
cin >> n >> s;
int w = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
w++;
}
int b = 0;
int ans = w;
for (int i = 0; i < n; i++) {
if (s[i] == '#')
b++;
else
w--;
ans = min(ans, b + w);
}
cout << ans << "\n";
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 879,854 | 879,855 | u568501780 | cpp |
p03069 | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include "bits/stdc++.h"
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e) \
for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) \
for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) \
Type __VA_ARGS__; \
input(__VA_ARGS__)
constexpr size_t operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head &&head, Tail &&...tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class T> inline istream &operator>>(istream &is, vector<T> &vec) {
for (auto &e : vec) {
is >> e;
}
return is;
}
inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail)) {
cout << " ";
}
output(forward<Tail>(tail)...);
}
template <class T>
inline ostream &operator<<(ostream &os, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e : vec) {
os << e << delim[&e == &vec.back()];
}
return os;
}
template <class T> inline vector<T> makeVector(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(initValue, args...))>(
sz, makeVector<T>(initValue, args...));
}
template <class Func> class FixPoint : Func {
public:
explicit constexpr FixPoint(Func &&f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args &&...args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func &&f) noexcept {
return FixPoint<Func>{forward<Func>(f)};
}
template <class Container> struct reverse_t {
Container &c;
reverse_t(Container &c) : c(c) {}
auto begin() { return c.rbegin(); }
auto end() { return c.rend(); }
};
template <class Container> auto reversed(Container &c) {
return reverse_t<Container>(c);
}
template <class T> inline bool chmax(T &a, const T &b) noexcept {
return b > a && (a = b, true);
}
template <class T> inline bool chmin(T &a, const T &b) noexcept {
return b < a && (a = b, true);
}
template <class T> inline T diff(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
void ioinit() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// cout.setf(ios_base::fixed);
// cout.precision(10);
}
// End Header }}}
signed main() {
ioinit();
var(size_t, N);
var(string, S);
vector<size_t> cntb(N + 2), cntw(N + 2);
rep(i, 0, N) { cntb[i + 1] = cntb[i] + (S[i] == '#'); }
cntb[N + 1] = cntb[N];
repr(i, N - 1, 0) { cntw[i + 1] = cntw[i + 2] + (S[i] == '.'); }
cntw[0] = cntw[1];
dump(cntb, cntw);
// #####
// .####
// ..###
// ...##
// ....#
// .....
size_t minv = INF;
reps(i, 0, N + 1) { chmin(minv, cntb[i] + cntw[i]); }
output(minv);
return 0;
}
| #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include "bits/stdc++.h"
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e) \
for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) \
for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) \
Type __VA_ARGS__; \
input(__VA_ARGS__)
constexpr size_t operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head &&head, Tail &&...tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class T> inline istream &operator>>(istream &is, vector<T> &vec) {
for (auto &e : vec) {
is >> e;
}
return is;
}
inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail)) {
cout << " ";
}
output(forward<Tail>(tail)...);
}
template <class T>
inline ostream &operator<<(ostream &os, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e : vec) {
os << e << delim[&e == &vec.back()];
}
return os;
}
template <class T> inline vector<T> makeVector(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(initValue, args...))>(
sz, makeVector<T>(initValue, args...));
}
template <class Func> class FixPoint : Func {
public:
explicit constexpr FixPoint(Func &&f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args &&...args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func &&f) noexcept {
return FixPoint<Func>{forward<Func>(f)};
}
template <class Container> struct reverse_t {
Container &c;
reverse_t(Container &c) : c(c) {}
auto begin() { return c.rbegin(); }
auto end() { return c.rend(); }
};
template <class Container> auto reversed(Container &c) {
return reverse_t<Container>(c);
}
template <class T> inline bool chmax(T &a, const T &b) noexcept {
return b > a && (a = b, true);
}
template <class T> inline bool chmin(T &a, const T &b) noexcept {
return b < a && (a = b, true);
}
template <class T> inline T diff(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
void ioinit() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// cout.setf(ios_base::fixed);
// cout.precision(10);
}
// End Header }}}
signed main() {
ioinit();
var(size_t, N);
var(string, S);
vector<size_t> cntb(N + 2), cntw(N + 2);
rep(i, 0, N) { cntb[i + 1] = cntb[i] + (S[i] == '#'); }
cntb[N + 1] = cntb[N];
repr(i, N - 1, 0) { cntw[i + 1] = cntw[i + 2] + (S[i] == '.'); }
cntw[0] = cntw[1];
dump(cntb, cntw);
// #####
// .####
// ..###
// ...##
// ....#
// .....
size_t minv = INF;
reps(i, 0, N) { chmin(minv, cntb[i] + cntw[i + 1]); }
output(minv);
return 0;
}
| [
"expression.operation.binary.remove"
] | 879,856 | 879,857 | u671257784 | cpp |
p03069 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
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;
}
const long long mod = 1e9 + 7;
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
ll dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
ll n;
string s;
cin >> n >> s;
bool flag = false;
ll cnt = 0;
rep(i, n) {
if (s[i] == '.')
cnt++;
}
if (cnt == 0 || cnt == n)
cout << 0;
else {
ll l, r, ans = mod;
l = 0;
r = cnt;
rep(i, n) {
if (s[i] == '.') {
r--;
} else {
l++;
}
ans = min(ans, l + r);
}
cout << ans;
}
return 0;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); } | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
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;
}
const long long mod = 1e9 + 7;
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
ll dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
ll n;
string s;
cin >> n >> s;
ll cnt = 0;
rep(i, n) {
if (s[i] == '.')
cnt++;
}
if (cnt == 0 || cnt == n)
cout << 0;
else {
ll l, r, ans = cnt;
l = 0;
r = cnt;
rep(i, n) {
if (s[i] == '.') {
r--;
} else {
l++;
}
ans = min(ans, l + r);
}
cout << ans;
}
return 0;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); } | [
"variable_declaration.remove",
"variable_declaration.value.change",
"identifier.change"
] | 879,858 | 879,859 | u401139594 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e9 + 7;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r = 0;
int l = 0;
bool flag = true;
rep(i, n - 1) if (s[i] != s[i + 1]) flag = false;
if (flag) {
cout << 0 << endl;
return 0;
}
rep(i, n) if (s[i] == '.') r++;
int ans = r;
rep(i, n) {
if (s[i] == '#') {
l++;
r--;
}
ans = min(ans, l + r);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e9 + 7;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r = 0;
int l = 0;
bool flag = true;
rep(i, n - 1) if (s[i] != s[i + 1]) flag = false;
if (flag) {
cout << 0 << endl;
return 0;
}
rep(i, n) if (s[i] == '.') r++;
int ans = r;
rep(i, n) {
if (s[i] == '#') {
l++;
} else {
r--;
}
ans = min(ans, l + r);
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.else.add"
] | 879,860 | 879,861 | u106342872 | cpp |
p03069 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T> void print(const T &v);
int main() {
int n;
string s;
cin >> n >> s;
// 境界線より右の白と，境界線より左の黒をカウントする
int black = 0, white = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.') {
++white;
}
}
int mini = INF;
for (int i = 0; i < n; i++) {
if (s[i] == '.') {
--white;
} else {
++black;
}
mini = min(mini, black + white);
}
cout << mini << endl;
return 0;
}
// Use For Debug
template <typename T> void print(T const &v) {
for (int i = 0; i < v.size(); i++) {
if (i)
cout << ' ';
cout << v[i];
}
cout << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T> void print(const T &v);
int main() {
int n;
string s;
cin >> n >> s;
// 境界線より右の白と，境界線より左の黒をカウントする
int black = 0, white = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.') {
++white;
}
}
// cout << black << ':' << white << endl;
int mini = black + white;
for (int i = 0; i < n; i++) {
if (s[i] == '.') {
--white;
} else {
++black;
}
// cout << black << ':' << white << endl;
mini = min(mini, black + white);
}
cout << mini << endl;
return 0;
}
// Use For Debug
template <typename T> void print(T const &v) {
for (int i = 0; i < v.size(); i++) {
if (i)
cout << ' ';
cout << v[i];
}
cout << endl;
} | [
"assignment.change"
] | 879,868 | 879,869 | u286623856 | cpp |
p03069 | using namespace std;
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
int N;
string s;
int w[200005], b[200005];
int main() {
cin >> N;
cin >> s;
int white = 0;
rep(i, N) {
if (s[i] == '.')
white++;
}
int cnt = min(white, N - white);
rep(i, N) { // 自分含めてi番目から左までに黒が何個あるか
if (i == 0)
b[0] = s[0] == '#' ? 1 : 0;
else
b[i] = s[i] == '#' ? b[i - 1] + 1 : b[i - 1];
}
for (int i = N - 1; i >= 0;
i--) { // 自分含めてi番目から右までに白が何個あるか
if (i == N - 1)
w[i] = s[i] == '#' ? 1 : 0;
else
w[i] = s[i] == '#' ? w[i + 1] + 1 : w[i + 1];
}
rep(i, N) {
if (i == 0)
continue;
cnt = min(cnt, w[i - 1] + b[i]);
}
cout << cnt << endl;
return 0;
} | using namespace std;
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
int N;
string s;
int w[200005], b[200005];
int main() {
cin >> N;
cin >> s;
int white = 0;
rep(i, N) {
if (s[i] == '.')
white++;
}
int cnt = min(white, N - white);
rep(i, N) { // 自分含めてi番目から左までに黒が何個あるか
if (i == 0)
b[0] = s[0] == '#' ? 1 : 0;
else
b[i] = s[i] == '#' ? b[i - 1] + 1 : b[i - 1];
}
for (int i = N - 1; i >= 0;
i--) { // 自分含めてi番目から右までに白が何個あるか
if (i == N - 1)
w[i] = s[i] == '.' ? 1 : 0;
else
w[i] = s[i] == '.' ? w[i + 1] + 1 : w[i + 1];
}
rep(i, N) {
if (i == 0)
continue;
cnt = min(cnt, w[i] + b[i - 1]);
}
cout << cnt << endl;
return 0;
} | [
"literal.string.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 879,872 | 879,873 | u288087195 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const long long INF = 1e15;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> w(n, 0), b(n, 0);
int now = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '#')
now++;
b[i] = now;
}
now = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '.')
now++;
w[i] = now;
}
int ans = mod;
for (int i = 0; i < n; i++) {
// cout << w[i]+b[i] << endl;
ans = min(ans, w[i] + b[i]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const long long INF = 1e15;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> w(n, 0), b(n, 0);
int now = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '#')
now++;
b[i] = now;
}
now = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '.')
now++;
w[i] = now;
}
int ans = mod;
for (int i = 0; i < n; i++) {
// cout << w[i]+b[i] << endl;
ans = min(ans, w[i] + b[i]);
}
cout << ans - 1 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 879,874 | 879,875 | u191484928 | cpp |
p03069 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
using P = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll MOD = 1000000007;
ll INF = 1 << 30;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> black(n), white(n);
int b = 0, w = 0;
rep(i, n) {
if (s[i] == '#')
b++;
black[i] = b;
if (s[i] == '.')
w++;
white[i] = w;
}
if (b == 0 || w == 0) {
cout << 0 << endl;
return 0;
}
int ans = 1001001;
rep(i, n) {
int cnt = 0;
cnt += black[i];
cnt += w - white[i];
ans = min(ans, cnt);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
using P = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll MOD = 1000000007;
ll INF = 1 << 30;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> black(n), white(n);
int b = 0, w = 0;
rep(i, n) {
if (s[i] == '#')
b++;
black[i] = b;
if (s[i] == '.')
w++;
white[i] = w;
}
if (b == 0 || w == 0) {
cout << 0 << endl;
return 0;
}
int ans = min(b, w);
rep(i, n) {
int cnt = 0;
cnt += black[i];
cnt += w - white[i];
ans = min(ans, cnt);
}
cout << ans << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 879,878 | 879,879 | u937618939 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 1e10;
vector<ll> wa(N + 1);
wa[0] = 0;
for (int i = 1; i <= N; i++) {
wa[i] = wa[i - 1];
if (S[i - 1] == '.')
wa[i]++;
}
for (int i = 1; i <= N; i++) {
ll l = wa[i];
ll r = wa[N] - wa[i];
ans = min(ans, (i - l) + (r));
}
ans = min(wa[N], N - wa[N]);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 1e10;
vector<ll> wa(N + 1);
wa[0] = 0;
for (int i = 1; i <= N; i++) {
wa[i] = wa[i - 1];
if (S[i - 1] == '.')
wa[i]++;
}
for (int i = 1; i <= N; i++) {
ll l = wa[i];
ll r = wa[N] - wa[i];
ans = min(ans, (i - l) + (r));
}
ans = min(min(wa[N], ans), N - wa[N]);
cout << ans << endl;
} | [
"call.add",
"call.arguments.add"
] | 879,887 | 879,888 | u893239355 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 1e10;
vector<ll> wa(N + 1);
wa[0] = 0;
for (int i = 1; i <= N; i++) {
wa[i] = wa[i - 1];
if (S[i - 1] == '.')
wa[i]++;
}
for (int i = 1; i <= N; i++) {
ll l = wa[i];
ll r = wa[N] + wa[i];
ans = min(ans, (i - l) + (r));
}
ans = min(wa[N], N - wa[N]);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 1e10;
vector<ll> wa(N + 1);
wa[0] = 0;
for (int i = 1; i <= N; i++) {
wa[i] = wa[i - 1];
if (S[i - 1] == '.')
wa[i]++;
}
for (int i = 1; i <= N; i++) {
ll l = wa[i];
ll r = wa[N] - wa[i];
ans = min(ans, (i - l) + (r));
}
ans = min(min(wa[N], ans), N - wa[N]);
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.add"
] | 879,889 | 879,888 | u893239355 | cpp |
p03069 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (ll)n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
void solve(void) {
int n;
string s;
cin >> n >> s;
int cta = 0; // ctaは白の数
rep(i, n) if (s[i] == '.') cta++;
int ans = min(n - cta, cta);
int b = 0, w = 0;
repr(i, n - 1) {
if (s[i] == '#')
b++;
else
w++;
if (s[i] != s[i + 1]) {
int x = b;
int y = cta - w;
ans = min(ans, x + y);
}
}
cout << ans << endl;
}
int main(void) { solve(); }
| #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (ll)n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
void solve(void) {
int n;
string s;
cin >> n >> s;
int cta = 0; // ctaは白の数
rep(i, n) if (s[i] == '.') cta++;
int ans = min(n - cta, cta);
int b = 0, w = 0;
rep(i, n - 1) {
if (s[i] == '#')
b++;
else
w++;
if (s[i] != s[i + 1]) {
int x = b;
int y = cta - w;
ans = min(ans, x + y);
}
}
cout << ans << endl;
}
int main(void) { solve(); }
| [
"identifier.change",
"call.function.change"
] | 879,890 | 879,891 | u110044127 | cpp |
p03069 |
// Problem : C - Stones
// Contest : AtCoder - Tenka1 Programmer Beginner Contest 2019
// URL : https://atcoder.jp/contests/tenka1-2019-beginner/tasks/tenka1_2019_c
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/*⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣠⣶⡾⠏⠉⠙⠳⢦⡀⠀⠀⠀
⠀⠀⠀⣴⠿⠏⠀⠀⠀⠀⠀⠀⢳⡀⠀
⠀⠀⢠⣟⣋⡀⢀⣀⣀⡀⠀⣀⡀⣧⠀
⠀⠀⢸⣯⡭⠁⠸⣛⣟⠆⡴⣻⡲⣿⠀
⠀⠀⣟⣿⡭⠀⠀⠀⠀⠀⢱⠀⠀⣿⠀
⠀⠀⠙⢿⣯⠄⠀⠀⠀⢀⡀⠀⠀⡿⠀⠀
⠀⠀⠀⠀⠹⣶⠆⠀⠀⠀⠀⠀⡴⠃⠀⠀
⠀⠀⠀⠀⠀⢸⣷⡦⢤⡤⢤⣞⣁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⢀⣤⣴⣿⣏⠁⠀⠀⠸⣏⢯⣷⣖⣦⡀⠀⠀⠀⠀⠀⠀
⢀⣾⣽⣿⣿⣿⣿⠛⢲⣶⣾⢉⡷⣿⣿⠵⣿⠀⠀⠀⠀⠀⠀
⣼⣿⠍⠉⣿⡭⠉⠙⢺⣇⣼⡏⠀⠀⠀⣄⢸⠀⠀⠀⠀⠀⠀
⣿⣿⣧⣀⣿.........⣀⣰⣏⣘⣆⣀⠀
*/
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
#define l00p(i, a, b) for (int i = a; i < (b); i++)
#define loop(i, a) for (int i = 0; i < (a); i++)
#define rep1(i, a, b) for (int i = (b)-1; i >= a; i--)
#define rep(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
#define imax INT_MAX
#define imin INT_MIN
//#define MOD 998244353
template <class T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ld pii = 3.14159265359;
const int MOD = 1000000007;
const char nl = '\n';
const ll INF = 1e18;
const int MX = 100001; // check the limits, dummy
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
vi pref1(n), pref2(n);
int j = 0;
loop(i, n) {
if (s[i] == '#')
j++;
pref1[i] = j;
}
j = 0;
rep(i, n) {
if (s[i] == '.')
j++;
pref2[i] = j;
}
int mn = min(pref2[0], pref1.back());
loop(i, n - 1) { mn = min(mn, pref2[i] + pref1[i + 1]); }
cout << mn;
return 0;
}
// read the question correctly (ll vs int)
// template by bqi343
|
// Problem : C - Stones
// Contest : AtCoder - Tenka1 Programmer Beginner Contest 2019
// URL : https://atcoder.jp/contests/tenka1-2019-beginner/tasks/tenka1_2019_c
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/*⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣠⣶⡾⠏⠉⠙⠳⢦⡀⠀⠀⠀
⠀⠀⠀⣴⠿⠏⠀⠀⠀⠀⠀⠀⢳⡀⠀
⠀⠀⢠⣟⣋⡀⢀⣀⣀⡀⠀⣀⡀⣧⠀
⠀⠀⢸⣯⡭⠁⠸⣛⣟⠆⡴⣻⡲⣿⠀
⠀⠀⣟⣿⡭⠀⠀⠀⠀⠀⢱⠀⠀⣿⠀
⠀⠀⠙⢿⣯⠄⠀⠀⠀⢀⡀⠀⠀⡿⠀⠀
⠀⠀⠀⠀⠹⣶⠆⠀⠀⠀⠀⠀⡴⠃⠀⠀
⠀⠀⠀⠀⠀⢸⣷⡦⢤⡤⢤⣞⣁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⢀⣤⣴⣿⣏⠁⠀⠀⠸⣏⢯⣷⣖⣦⡀⠀⠀⠀⠀⠀⠀
⢀⣾⣽⣿⣿⣿⣿⠛⢲⣶⣾⢉⡷⣿⣿⠵⣿⠀⠀⠀⠀⠀⠀
⣼⣿⠍⠉⣿⡭⠉⠙⢺⣇⣼⡏⠀⠀⠀⣄⢸⠀⠀⠀⠀⠀⠀
⣿⣿⣧⣀⣿.........⣀⣰⣏⣘⣆⣀⠀
*/
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
#define l00p(i, a, b) for (int i = a; i < (b); i++)
#define loop(i, a) for (int i = 0; i < (a); i++)
#define rep1(i, a, b) for (int i = (b)-1; i >= a; i--)
#define rep(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
#define imax INT_MAX
#define imin INT_MIN
//#define MOD 998244353
template <class T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ld pii = 3.14159265359;
const int MOD = 1000000007;
const char nl = '\n';
const ll INF = 1e18;
const int MX = 100001; // check the limits, dummy
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
vi pref1(n), pref2(n);
int j = 0;
loop(i, n) {
if (s[i] == '#')
j++;
pref1[i] = j;
}
j = 0;
rep(i, n) {
if (s[i] == '.')
j++;
pref2[i] = j;
}
int mn = min(pref2[0], pref1.back());
loop(i, n - 1) { mn = min(mn, pref2[i + 1] + pref1[i]); }
cout << mn;
return 0;
}
// read the question correctly (ll vs int)
// template by bqi343
| [
"assignment.change",
"expression.operation.binary.remove"
] | 879,897 | 879,898 | u197541395 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define mp make_pair
#define endl "\n"
#define vi vector<int>
#define vc vector<char>
#define vll vector<ll>
#define pi pair<int, int>
const int MOD = 1e9 + 7;
const ll inf = 1e18;
int main() {
int n;
cin >> n;
vc a(n);
vi cnt1(n + 1);
vi cnt2(n + 1);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
if (a[i] == '.')
cnt1[i + 1] = 1;
else
cnt2[i + 1] = 1;
}
for (int i = 1; i <= n; ++i) {
cnt1[i] += cnt1[i - 1];
cnt2[i] += cnt2[i - 1];
}
int ans = n;
for (int i = 1; i <= n; ++i) {
// cout << cnt2[i] << " " << cnt1[i] << endl ;
ans = min(ans, cnt1[i] + cnt2[n] - cnt2[i - 1]);
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define mp make_pair
#define endl "\n"
#define vi vector<int>
#define vc vector<char>
#define vll vector<ll>
#define pi pair<int, int>
const int MOD = 1e9 + 7;
const ll inf = 1e18;
int main() {
int n;
cin >> n;
vc a(n);
vi cnt1(n + 1);
vi cnt2(n + 1);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
if (a[i] == '.')
cnt1[i + 1] = 1;
else
cnt2[i + 1] = 1;
}
for (int i = 1; i <= n; ++i) {
cnt1[i] += cnt1[i - 1];
cnt2[i] += cnt2[i - 1];
}
int ans = n;
for (int i = 0; i <= n; ++i) {
// cout << cnt2[i] << " " << cnt1[i] << endl ;
ans = min(ans, cnt2[i] + cnt1[n] - cnt1[i]);
}
cout << ans;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 879,899 | 879,900 | u507638984 | cpp |
p03069 | #pragma region header
#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 rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr int inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
int main() {
/*int n;string s;cin >> n >> s;
int white = 0;
int black = 0;
int count = 0;
rep(i, n) {
if(s[i]=='.') white++;
else black++;
}*/
/*rev(i, n) {
if(s[i]=='.') {
// white++;
if(s[i-1]=='#') {
count++;
s[i-1]='.';
}
}
}
cout << min(white,count) << endl;*/
int n;
string s;
cin >> n >> s;
vi black(n + 1), white(n + 1);
rep(i, n) {
if (s[i] == '#')
black[i + 1]++;
// else white[n-i]++;
black[i + 1] += black[i];
// white[n-i-1]+=white[n-i];
}
rev(i, n) {
if (s[i] == '.')
white[i]++;
white[i] += white[i + 1];
}
int mi = inf;
/*for(auto p:black)cout << p << ' ';
cout << endl;
for(auto p:white)cout << p << ' ';
cout << endl;*/
rep(i, n + 2) { chmin(mi, black[i] + white[i]); }
cout << mi << endl;
return 0;
} | #pragma region header
#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 rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr int inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
int main() {
/*int n;string s;cin >> n >> s;
int white = 0;
int black = 0;
int count = 0;
rep(i, n) {
if(s[i]=='.') white++;
else black++;
}*/
/*rev(i, n) {
if(s[i]=='.') {
// white++;
if(s[i-1]=='#') {
count++;
s[i-1]='.';
}
}
}
cout << min(white,count) << endl;*/
int n;
string s;
cin >> n >> s;
vi black(n + 1), white(n + 1);
rep(i, n) {
if (s[i] == '#')
black[i + 1]++;
// else white[n-i]++;
black[i + 1] += black[i];
// white[n-i-1]+=white[n-i];
}
rev(i, n) {
if (s[i] == '.')
white[i]++;
white[i] += white[i + 1];
}
int mi = inf;
/*for(auto p:black)cout << p << ' ';
cout << endl;
for(auto p:white)cout << p << ' ';
cout << endl;*/
rep(i, n + 1) { chmin(mi, black[i] + white[i]); }
cout << mi << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 879,903 | 879,904 | u608773191 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int minC = 1000000;
vector<int> wsum(n + 1, 0);
vector<int> bsum(n + 1, 0);
for (int i = 1; i <= n; i++) {
if (s[i - 1] == '.') {
wsum[i] = wsum[i - 1] + 1;
bsum[i] = bsum[i - 1];
} else {
wsum[i] = wsum[i - 1];
bsum[i] = bsum[i - 1] + 1;
}
}
int mn = 1000000;
for (int i = 1; i <= n; i++) {
mn = min(mn, bsum[i] + (wsum[n] - wsum[i]));
}
cout << mn << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int minC = 1000000;
vector<int> wsum(n + 1, 0);
vector<int> bsum(n + 1, 0);
for (int i = 1; i <= n; i++) {
if (s[i - 1] == '.') {
wsum[i] = wsum[i - 1] + 1;
bsum[i] = bsum[i - 1];
} else {
wsum[i] = wsum[i - 1];
bsum[i] = bsum[i - 1] + 1;
}
}
int mn = 1000000;
for (int i = 0; i <= n; i++) {
mn = min(mn, bsum[i] + (wsum[n] - wsum[i]));
}
cout << mn << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 879,905 | 879,906 | u540491484 | cpp |
p03069 | #include <algorithm>
#include <cfenv>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long long
#define rep(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define rrep(i, s, n) for (ll i = (ll)(s); i > (ll)(n); i--)
#define all(a) (a).begin(), a.end()
#define rall(a) (a).rbegin(), (a).rend()
#define PI 3.14159265359
#define mod 1000000007
#define P pair<ll, ll>
#define V vector<ll>
#define C vector<char>
#define B vector<bool>
#define endl '\n'
const ll MAX = 510000;
const ll MOD = 1000000007;
using namespace std;
using graph = vector<vector<ll>>;
struct edge {
//辺の重みを管理できるような構造体
//コンストラクタによって簡単に値を入れられるようにしている
// operatorは辺の重みでソート出来るようにしている
ll from, to;
ll cost;
ll capa;
edge(ll s, ll d) : from(s), to(d) {
cost = 0;
capa = 0;
}
edge(ll s, ll d, ll w) : from(s), to(d), cost(w) { capa = 0; }
edge(ll s, ll d, ll x, ll y) : from(s), to(d), cost(x), capa(y) {}
bool operator<(const edge &x) const { return cost < x.cost; }
};
using Graph = vector<vector<edge>>; //重み付きグラフ
//ダイクストラ法
vector<ll> Dijkstra(ll i, vector<vector<edge>> Graph) {
// i:始点
// Graph:重み付きグラフ
ll n = Graph.size();
vector<ll> d(n, LONG_MAX);
d[i] = 0;
priority_queue<pair<ll, ll>, // pair型
vector<pair<ll, ll>>, //内部コンテナ
greater<pair<ll, ll>> //昇順
>
q;
q.push({0, i}); //第一引数:コスト 第二引数:頂点
while (!q.empty()) {
pair<ll, ll> p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first) {
continue;
}
for (auto x : Graph[v]) {
if (d[x.to] > d[v] + x.cost) {
d[x.to] = d[v] + x.cost;
q.push({d[x.to], x.to});
}
}
}
return d;
}
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll 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;
}
}
// mod. m での a の逆元 a^{-1} を計算する
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// 二項係数計算nCk,n<=10^7,k<=10^7まで
ll com(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//二項係数nCk,n<=10^9,k<=10^7まで
ll com2(ll n, ll k) {
ll res, bs = 1, bb = 1;
for (ll i = 0; i < k; i++) {
bs = (bs * (n - i)) % mod;
bb = (bb * (i + 1)) % mod;
}
res = modinv(bb, mod) % mod;
res = (res * bs) % mod;
return res;
}
// 二項係数計算nPk
ll per(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[n - k] % MOD) % MOD;
}
/* ユークリッドの互除法 最大公約数*/
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
/*最小公倍数*/
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
/*二点間の距離*/
double dist(pair<double, double> a, pair<double, double> b) {
return sqrt(pow((a.first - b.first), 2) + pow((a.second - b.second), 2));
}
//繰り返し自乗法
double ism(double aa, ll p) {
double ap = aa;
double ans = 1;
while (p > 0) {
// cout<<"p="<<p<<",ap="<<ap<<endl;
if (p & 1) { //奇数が真
ans *= ap;
}
p /= 2;
ap = ap * ap;
}
return ans;
}
//繰り返し自乗法(アマリトリバージョン)
ll ismm(ll aa, ll p) {
ll ap = aa;
ll ans = 1;
while (p > 0) {
// cout<<"p="<<p<<",ap="<<ap<<endl;
if (p & 1) { //奇数が真
ans = (ans * ap) % mod;
}
p /= 2;
ap = (ap * ap) % mod;
}
return ans;
}
ll oddXOR(ll a) { return (a + 1) / 2 % 2; }
ll XOR(ll a) {
if (a % 2 == 1)
return oddXOR(a);
else
return oddXOR(a + 1) ^ (a + 1);
}
double median(V a) { //中央値
sort(all(a));
if (a.size() % 2 == 1) {
return a[(a.size() - 1) / 2];
} else {
return (a[(a.size() - 1) / 2] + a[(a.size() - 1) / 2 + 1]) / 2.0;
}
}
struct UnionFind {
vector<ll> par;
UnionFind(ll n) : par(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 techniiue
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
// 10の9乗+7でmodをとる
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator++(auto) noexcept {
++a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator--(auto) noexcept {
--a;
if (a < 0) {
a += Modulus;
}
return *this;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
//素因数分解の関数
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1)
res.push_back({N, 1});
return res;
}
//約数列挙
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i) {
res.push_back(N / i);
}
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
}
//桁数
ll Keta(ll x) {
ll cnt = 1;
while (x >= 10) {
x /= 10;
cnt++;
}
return cnt;
}
//小数点12桁
struct all_init {
all_init() { cout << fixed << setprecision(12); }
} All_init;
int main() {
ll n, k = 0, ans = 0;
cin >> n;
string s;
cin >> s;
rep(i, 0, n) {
if (s[i] == '.') {
k++;
}
}
ans = k;
rep(i, 0, n) {
if (s[i] == '.') {
k--;
} else {
k++;
}
}
ans = min(ans, k);
cout << ans << endl;
}
| #include <algorithm>
#include <cfenv>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long long
#define rep(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define rrep(i, s, n) for (ll i = (ll)(s); i > (ll)(n); i--)
#define all(a) (a).begin(), a.end()
#define rall(a) (a).rbegin(), (a).rend()
#define PI 3.14159265359
#define mod 1000000007
#define P pair<ll, ll>
#define V vector<ll>
#define C vector<char>
#define B vector<bool>
#define endl '\n'
const ll MAX = 510000;
const ll MOD = 1000000007;
using namespace std;
using graph = vector<vector<ll>>;
struct edge {
//辺の重みを管理できるような構造体
//コンストラクタによって簡単に値を入れられるようにしている
// operatorは辺の重みでソート出来るようにしている
ll from, to;
ll cost;
ll capa;
edge(ll s, ll d) : from(s), to(d) {
cost = 0;
capa = 0;
}
edge(ll s, ll d, ll w) : from(s), to(d), cost(w) { capa = 0; }
edge(ll s, ll d, ll x, ll y) : from(s), to(d), cost(x), capa(y) {}
bool operator<(const edge &x) const { return cost < x.cost; }
};
using Graph = vector<vector<edge>>; //重み付きグラフ
//ダイクストラ法
vector<ll> Dijkstra(ll i, vector<vector<edge>> Graph) {
// i:始点
// Graph:重み付きグラフ
ll n = Graph.size();
vector<ll> d(n, LONG_MAX);
d[i] = 0;
priority_queue<pair<ll, ll>, // pair型
vector<pair<ll, ll>>, //内部コンテナ
greater<pair<ll, ll>> //昇順
>
q;
q.push({0, i}); //第一引数:コスト 第二引数:頂点
while (!q.empty()) {
pair<ll, ll> p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first) {
continue;
}
for (auto x : Graph[v]) {
if (d[x.to] > d[v] + x.cost) {
d[x.to] = d[v] + x.cost;
q.push({d[x.to], x.to});
}
}
}
return d;
}
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll 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;
}
}
// mod. m での a の逆元 a^{-1} を計算する
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// 二項係数計算nCk,n<=10^7,k<=10^7まで
ll com(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//二項係数nCk,n<=10^9,k<=10^7まで
ll com2(ll n, ll k) {
ll res, bs = 1, bb = 1;
for (ll i = 0; i < k; i++) {
bs = (bs * (n - i)) % mod;
bb = (bb * (i + 1)) % mod;
}
res = modinv(bb, mod) % mod;
res = (res * bs) % mod;
return res;
}
// 二項係数計算nPk
ll per(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[n - k] % MOD) % MOD;
}
/* ユークリッドの互除法 最大公約数*/
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
/*最小公倍数*/
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
/*二点間の距離*/
double dist(pair<double, double> a, pair<double, double> b) {
return sqrt(pow((a.first - b.first), 2) + pow((a.second - b.second), 2));
}
//繰り返し自乗法
double ism(double aa, ll p) {
double ap = aa;
double ans = 1;
while (p > 0) {
// cout<<"p="<<p<<",ap="<<ap<<endl;
if (p & 1) { //奇数が真
ans *= ap;
}
p /= 2;
ap = ap * ap;
}
return ans;
}
//繰り返し自乗法(アマリトリバージョン)
ll ismm(ll aa, ll p) {
ll ap = aa;
ll ans = 1;
while (p > 0) {
// cout<<"p="<<p<<",ap="<<ap<<endl;
if (p & 1) { //奇数が真
ans = (ans * ap) % mod;
}
p /= 2;
ap = (ap * ap) % mod;
}
return ans;
}
ll oddXOR(ll a) { return (a + 1) / 2 % 2; }
ll XOR(ll a) {
if (a % 2 == 1)
return oddXOR(a);
else
return oddXOR(a + 1) ^ (a + 1);
}
double median(V a) { //中央値
sort(all(a));
if (a.size() % 2 == 1) {
return a[(a.size() - 1) / 2];
} else {
return (a[(a.size() - 1) / 2] + a[(a.size() - 1) / 2 + 1]) / 2.0;
}
}
struct UnionFind {
vector<ll> par;
UnionFind(ll n) : par(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 techniiue
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
// 10の9乗+7でmodをとる
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator++(auto) noexcept {
++a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator--(auto) noexcept {
--a;
if (a < 0) {
a += Modulus;
}
return *this;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
//素因数分解の関数
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1)
res.push_back({N, 1});
return res;
}
//約数列挙
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i) {
res.push_back(N / i);
}
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
}
//桁数
ll Keta(ll x) {
ll cnt = 1;
while (x >= 10) {
x /= 10;
cnt++;
}
return cnt;
}
//小数点12桁
struct all_init {
all_init() { cout << fixed << setprecision(12); }
} All_init;
int main() {
ll n, k = 0, ans = 0;
cin >> n;
string s;
cin >> s;
rep(i, 0, n) {
if (s[i] == '.') {
k++;
}
}
ans = k;
rep(i, 0, n) {
if (s[i] == '.') {
k--;
} else {
k++;
}
ans = min(ans, k);
}
cout << ans << endl;
}
| [] | 879,913 | 879,914 | u553461888 | cpp |
p03069 | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define itr(it, x) for (auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) \
v[x].pb(y); \
v[y].pb(x);
#define popc __builtin_popcount
#define ANS(s) \
{ \
cout << s << "\n"; \
return; \
}
// functions
template <typename T> void unique(T &c) {
c.erase(std::unique(c.begin(), c.end()), c.end());
}
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 (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 != vec.size())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
// constants
const ll N = 1e5 + 5, M = 1e6 + 5, A = 1e7 + 5, inf = 1e9;
const long long linf = 1LL << 60;
const double er = 1e-10, pi = 3.141592653589793238463;
const ll lx[4] = {0, 1, -1, 0};
const ll ly[4] = {1, 0, 0, -1};
const ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
// io
struct fast_io {
fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
}
} fast_io_;
void solve() {
string s;
ll n;
cin >> n >> s;
ll ans = inf;
vector<ll> b(n + 1), w(n + 1);
rep(i, n) b[i + 1] = b[i] + (s[i] == '#');
repr(i, n) w[i] = w[i + 1] + (s[i] == '.');
// cout << b << endl << w << endl;
rep(i, n) { ans = min(ans, b[i + 1] + w[i + 1]); }
cout << ans;
}
int main(int argc, char const *argv[]) {
ll t = 1; // cin >> t;
while (t--) {
solve();
}
return 0;
}
| // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define itr(it, x) for (auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) \
v[x].pb(y); \
v[y].pb(x);
#define popc __builtin_popcount
#define ANS(s) \
{ \
cout << s << "\n"; \
return; \
}
// functions
template <typename T> void unique(T &c) {
c.erase(std::unique(c.begin(), c.end()), c.end());
}
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 (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 != vec.size())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
// constants
const ll N = 1e5 + 5, M = 1e6 + 5, A = 1e7 + 5, inf = 1e9;
const long long linf = 1LL << 60;
const double er = 1e-10, pi = 3.141592653589793238463;
const ll lx[4] = {0, 1, -1, 0};
const ll ly[4] = {1, 0, 0, -1};
const ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
// io
struct fast_io {
fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
}
} fast_io_;
void solve() {
string s;
ll n;
cin >> n >> s;
ll ans = inf;
vector<ll> b(n + 1), w(n + 1);
rep(i, n) b[i + 1] = b[i] + (s[i] == '#');
repr(i, n) w[i] = w[i + 1] + (s[i] == '.');
// cout << b << endl << w << endl;
rep(i, n + 1) { ans = min(ans, b[i] + w[i]); }
cout << ans;
}
int main(int argc, char const *argv[]) {
ll t = 1; // cin >> t;
while (t--) {
solve();
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 879,924 | 879,925 | u448570453 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int ans = 1 << 30;
string S;
cin >> N >> S;
vector<int> white(N + 1, 0);
vector<int> black(N + 1, 0);
for (int i = 0; i < N; ++i) {
white[i + 1] = white[i] + (S[i] == '.' ? 1 : 0);
black[i + 1] = black[i] + (S[i] == '#' ? 1 : 0);
}
for (int i = 0; i < N; i++) {
int b = black[i] - black[0];
int w = white[N] - white[i];
ans = min(b + w, ans);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int ans = 1 << 30;
string S;
cin >> N >> S;
vector<int> white(N + 1, 0);
vector<int> black(N + 1, 0);
for (int i = 0; i < N; ++i) {
white[i + 1] = white[i] + (S[i] == '.' ? 1 : 0);
black[i + 1] = black[i] + (S[i] == '#' ? 1 : 0);
}
for (int i = 0; i <= N; i++) {
int b = black[i] - black[0];
int w = white[N] - white[i];
ans = min(b + w, ans);
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 879,928 | 879,929 | u843292252 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
int n;
string s;
cin >> n;
cin >> s;
// 最終状態は
// 1. 全部黒 2.左から白が連続した後、すべて黒が連続する 3. 全部白
// あるiに対して、左にいくつ黒があって、右にいくつ白があるかの配列を作ればO(n)で2.の最大は求められる
vector<int> left_black(n);
vector<int> right_white(n);
int black = 0;
REP(i, n) { left_black[i] = (s[i] == '#') ? ++black : black; }
int white = 0;
for (int i = n - 1; i >= 0; i--) {
right_white[i] = (s[i] == '.') ? ++white : white;
}
/*
REP(i, n) { cout << left_black[i] << " "; }
cout << endl;
REP(i, n) { cout << right_white[i] << " "; }
*/
int middle_ans = INT_MAX;
REP(i, n) { middle_ans = min(middle_ans, left_black[i] + right_white[i]); }
int ans = min(middle_ans, min(black, white));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
int n;
string s;
cin >> n;
cin >> s;
// 最終状態は
// 1. 全部黒 2.左から白が連続した後、すべて黒が連続する 3. 全部白
// あるiに対して、左にいくつ黒があって、右にいくつ白があるかの配列を作ればO(n)で2.の最大は求められる
vector<int> left_black(n);
vector<int> right_white(n);
int black = 0;
REP(i, n) { left_black[i] = (s[i] == '#') ? ++black : black; }
int white = 0;
for (int i = n - 1; i >= 0; i--) {
right_white[i] = (s[i] == '.') ? ++white : white;
}
/*
REP(i, n) { cout << left_black[i] << " "; }
cout << endl;
REP(i, n) { cout << right_white[i] << " "; }
*/
int middle_ans = INT_MAX;
REP(i, n - 1) {
middle_ans = min(middle_ans, left_black[i] + right_white[i + 1]);
}
int ans = min(middle_ans, min(black, white));
cout << ans << endl;
} | [
"assignment.change"
] | 879,932 | 879,933 | u947517859 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL << 61;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll jou(ll N, ll P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = jou(N, P / 2);
return t * t % mod;
}
return (N * jou(N, P - 1)) % mod;
} // jou(n,mod-2)で逆元
// intの最大値2147483647 ≒ 2×10^9
// long longの最大値9223372036854775807 ≒ 9×10^18
//'大文字'+=32; で小文字に
// cout << fixed << setprecision (20); 小数点以下2０桁まで
//実行時間制約2秒では２×10^8回くらいまで計算できる
int main() {
int n;
string s;
cin >> n >> s;
vector<int> bl(n);
vector<int> wh(n);
int cnt = 0;
rep(i, n) {
if (s[i] == '#')
cnt++;
bl[i] = cnt;
}
cnt = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '.')
cnt++;
wh[i] = cnt;
}
int ans = 999999;
rep(i, n) { chmin(ans, bl[i] + wh[i]); }
chmin(ans, wh[0]);
chmin(ans, bl[n - 1]);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL << 61;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll jou(ll N, ll P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = jou(N, P / 2);
return t * t % mod;
}
return (N * jou(N, P - 1)) % mod;
} // jou(n,mod-2)で逆元
// intの最大値2147483647 ≒ 2×10^9
// long longの最大値9223372036854775807 ≒ 9×10^18
//'大文字'+=32; で小文字に
// cout << fixed << setprecision (20); 小数点以下2０桁まで
//実行時間制約2秒では２×10^8回くらいまで計算できる
int main() {
int n;
string s;
cin >> n >> s;
vector<int> bl(n);
vector<int> wh(n);
int cnt = 0;
rep(i, n) {
if (s[i] == '#')
cnt++;
bl[i] = cnt;
}
cnt = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '.')
cnt++;
wh[i] = cnt;
}
int ans = 999999;
rep(i, n - 1) { chmin(ans, bl[i] + wh[i + 1]); }
chmin(ans, wh[0]);
chmin(ans, bl[n - 1]);
cout << ans << endl;
} | [
"expression.operation.binary.add"
] | 879,936 | 879,937 | u604329931 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 2e5 + 23;
int a[N], b[N];
void solve() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
char c;
scanf(" %c", &c);
a[i] = c == '#';
b[i] = !a[i];
a[i] += a[i - 1];
}
int ans = 1e9;
for (int i = n; i >= 0; --i) {
b[i] += b[i + 1];
ans = min(ans, a[i] + b[i]);
}
printf("%d", min(ans, a[n]));
}
int main() {
init();
int t = 1; // scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 2e5 + 23;
int a[N], b[N];
void solve() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
char c;
scanf(" %c", &c);
a[i] = c == '#';
b[i] = !a[i];
a[i] += a[i - 1];
}
int ans = 1e9;
for (int i = n; i > 0; --i) {
b[i] += b[i + 1];
ans = min(ans, a[i - 1] + b[i]);
}
printf("%d", min(ans, a[n]));
}
int main() {
init();
int t = 1; // scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 879,953 | 879,954 | u953463534 | cpp |
p03069 | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans = 10000000000, tmp = 0;
vector<ll> A, B;
string S;
signed main() {
cin >> N >> S;
A.resize(N + 1);
B.resize(N + 1);
A[0] = 0;
B[N] = 0;
for (int i = 1; i <= N; i++) {
if (S[i] == '#')
A[i] = A[i - 1] + 1;
else
A[i] = A[i - 1];
}
for (int i = N - 1; i >= 0; i--) {
if (S[i] == '.')
B[i] = B[i + 1] + 1;
else
B[i] = B[i + 1];
}
for (int i = 0; i <= N; i++) {
ans = min(ans, A[i] + B[i]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans = 10000000000, tmp = 0;
vector<ll> A, B;
string S;
signed main() {
cin >> N >> S;
A.resize(N + 1);
B.resize(N + 1);
A[0] = 0;
B[N] = 0;
for (int i = 1; i <= N; i++) {
if (S[i - 1] == '#')
A[i] = A[i - 1] + 1;
else
A[i] = A[i - 1];
}
for (int i = N - 1; i >= 0; i--) {
if (S[i + 1] == '.')
B[i] = B[i + 1] + 1;
else
B[i] = B[i + 1];
}
for (int i = 0; i <= N; i++) {
ans = min(ans, A[i] + B[i]);
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,967 | 879,968 | u132452589 | cpp |
p03069 | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans = 10000000000, tmp = 0;
vector<ll> A, B;
string S;
signed main() {
cin >> N >> S;
A.resize(N + 1);
B.resize(N + 1);
A[0] = 0;
B[N] = 0;
for (int i = 1; i <= N; i++) {
if (S[i] == '#')
A[i] = A[i - 1] + 1;
else
A[i] = A[i - 1];
}
for (int i = N; i >= 0; i--) {
if (S[i] == '.')
B[i] = B[i + 1] + 1;
else
B[i] = B[i + 1];
}
for (int i = 0; i <= N; i++) {
ans = min(ans, A[i] + B[i]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans = 10000000000, tmp = 0;
vector<ll> A, B;
string S;
signed main() {
cin >> N >> S;
A.resize(N + 1);
B.resize(N + 1);
A[0] = 0;
B[N] = 0;
for (int i = 1; i <= N; i++) {
if (S[i - 1] == '#')
A[i] = A[i - 1] + 1;
else
A[i] = A[i - 1];
}
for (int i = N - 1; i >= 0; i--) {
if (S[i + 1] == '.')
B[i] = B[i + 1] + 1;
else
B[i] = B[i + 1];
}
for (int i = 0; i <= N; i++) {
ans = min(ans, A[i] + B[i]);
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.loop.for.initializer.change"
] | 879,969 | 879,968 | u132452589 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
const long double PI = 3.14159265358979;
const ll MAX = 200020;
int main() {
string s;
ll N;
cin >> N >> s;
ll ans = MAX, cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '.') {
cnt++;
}
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == '.') {
cnt--;
}
if (s[i] == '#') {
cnt++;
}
ans = min(ans, cnt);
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
const long double PI = 3.14159265358979;
const ll MAX = 200020;
int main() {
string s;
ll N;
cin >> N >> s;
ll ans = MAX, cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '.') {
cnt++;
}
}
ans = cnt;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '.') {
cnt--;
}
if (s[i] == '#') {
cnt++;
}
ans = min(ans, cnt);
}
cout << ans;
}
| [
"assignment.add"
] | 879,987 | 879,988 | u102070373 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main() {
int n;
cin >> n;
string str;
cin >> str;
deque<char> que;
rep(i, n) { que.push_back(str[i]); }
while (!que.empty() && que.front() == '.') {
que.pop_front();
}
while (!que.empty() && que.back() == '#') {
que.pop_back();
}
vector<char> checkVec;
while (!que.empty()) {
checkVec.push_back(que.front());
que.pop_front();
}
int ans = 0;
int smallest = 1000000007;
for (int i = 0; i < checkVec.size(); i++) {
if (checkVec[i] == '#')
ans++;
}
smallest = ans;
for (int i = 0; i < checkVec.size(); i++) {
if (checkVec[i] == '.')
ans--;
else
ans++;
smallest = min(smallest, ans);
}
cout << smallest << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main() {
int n;
cin >> n;
string str;
cin >> str;
deque<char> que;
rep(i, n) { que.push_back(str[i]); }
while (!que.empty() && que.front() == '.') {
que.pop_front();
}
while (!que.empty() && que.back() == '#') {
que.pop_back();
}
vector<char> checkVec;
while (!que.empty()) {
checkVec.push_back(que.front());
que.pop_front();
}
int ans = 0;
int smallest = 1000000007;
for (int i = 0; i < checkVec.size(); i++) {
if (checkVec[i] == '.')
ans++;
}
smallest = ans;
for (int i = 0; i < checkVec.size(); i++) {
if (checkVec[i] == '.')
ans--;
else
ans++;
smallest = min(smallest, ans);
}
cout << smallest << endl;
return 0;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 879,994 | 879,995 | u509420256 | cpp |
p03069 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
// here!!!
// define int long long !!!!!
#define int long long
// define int long long !!!!!
#define mod (int)((1e9) + 7)
// constexpr int mod = 998244353ll;
#define intt long long
#define itn long long
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
// Library
//モッドパウ
inline int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % m;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
} else {
break;
}
}
return ans;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define fin(i) scanf("%lld", &i)
#define fout(i) printf("%lld", i)
#define fendl printf("\n")
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
// cout<<kai(x, y)<<' '<<modpow(kai(y, y), mod - 2)<<endl;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
// Library-End
#define vecin(v) \
for (int i = 0; i < v.size(); i++) \
scanf("%lld", &v[i]);
#define vecout(v) \
{ \
for (int i = 0; i < (int)v.size(); i++) \
printf("%lld ", v[i]); \
printf("\n"); \
}
// SegTree
template <class T> class SegTree {
int n; // 葉の数
vector<T> data; // データを格納するvector
T def; // 初期値かつ単位元
function<T(T, T)> operation; // 区間クエリで使う処理
function<T(T, T)> update; // 点更新で使う処理
// 区間[a,b)の総和。ノードk=[l,r)に着目している。
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def; // 交差しない
if (a <= l && r <= b)
return data[k]; // a,l,r,bの順で完全に含まれる
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return operation(c1, c2);
}
}
public:
// _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
// _update:更新関数
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
// 場所i(0-indexed)の値をxで更新
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)の区間クエリを実行
T query(int a, int b) { return _query(a, b, 0, 0, n); }
// 添字でアクセス
T operator[](int i) { return data[i + n - 1]; }
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
class Union_Find {
vector<int> par;
vector<int> rankmy;
vector<int> ookisa;
public:
Union_Find(int size) {
par = vector<int>(size);
rankmy = vector<int>(size);
ookisa = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
ookisa[i] = 1;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (rankmy[x] < rankmy[y]) {
par[x] = y;
ookisa[y] += ookisa[x];
ookisa[x] = 0;
} else {
par[y] = x;
ookisa[x] += ookisa[y];
ookisa[y] = 0;
if (rankmy[x] == rankmy[y]) {
rankmy[x]++;
}
}
}
int size(int i) {
i = find(i);
return ookisa[i];
}
bool same(int x, int y) { return find(x) == find(y); }
};
// Union-Find-End
int perm[1000005];
void init_perm() {
perm[0] = 1;
REP(i, 1000000) { perm[i] = perm[i - 1] * i % mod; }
}
int nCk(int x, int y) {
return perm[x] * modpow(perm[x - y], mod - 2) % mod *
modpow(perm[y], mod - 2) % mod;
}
double kyori(pair<int, int> f, pair<int, int> s) {
double ans = 0;
double t = fabs(f.first - s.first);
double y = fabs(f.second - s.second);
ans = sqrt(t * t + y * y);
return ans;
}
inline string stringmax(string &x, string &y) {
if (x.size() > y.size()) {
return x;
}
if (x.size() < y.size()) {
return y;
}
rep(i, x.size()) {
if (x[i] > y[i]) {
return x;
}
if (x[i] < y[i]) {
return y;
}
}
return x;
}
#define endl "\n" // interactive の時に注意！！！
int n, rui[200004], rui2[200004], ans;
string s;
signed main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cin >> n >> s;
rep(i, n) {
if (s[i] == '#') {
rui[i]++;
}
if (i) {
rui[i] += rui[i - 1];
}
}
ans = inf;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '.') {
rui2[i]++;
}
rui2[i] += rui2[i + 1];
}
ans = rui[n - 1];
chmin(ans, rui2[0]);
rep(i, n) { chmin(ans, rui[i] + rui2[i]); }
cout << ans << endl;
}
| /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
// here!!!
// define int long long !!!!!
#define int long long
// define int long long !!!!!
#define mod (int)((1e9) + 7)
// constexpr int mod = 998244353ll;
#define intt long long
#define itn long long
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
// Library
//モッドパウ
inline int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % m;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
} else {
break;
}
}
return ans;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define fin(i) scanf("%lld", &i)
#define fout(i) printf("%lld", i)
#define fendl printf("\n")
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
// cout<<kai(x, y)<<' '<<modpow(kai(y, y), mod - 2)<<endl;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
// Library-End
#define vecin(v) \
for (int i = 0; i < v.size(); i++) \
scanf("%lld", &v[i]);
#define vecout(v) \
{ \
for (int i = 0; i < (int)v.size(); i++) \
printf("%lld ", v[i]); \
printf("\n"); \
}
// SegTree
template <class T> class SegTree {
int n; // 葉の数
vector<T> data; // データを格納するvector
T def; // 初期値かつ単位元
function<T(T, T)> operation; // 区間クエリで使う処理
function<T(T, T)> update; // 点更新で使う処理
// 区間[a,b)の総和。ノードk=[l,r)に着目している。
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def; // 交差しない
if (a <= l && r <= b)
return data[k]; // a,l,r,bの順で完全に含まれる
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return operation(c1, c2);
}
}
public:
// _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
// _update:更新関数
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
// 場所i(0-indexed)の値をxで更新
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)の区間クエリを実行
T query(int a, int b) { return _query(a, b, 0, 0, n); }
// 添字でアクセス
T operator[](int i) { return data[i + n - 1]; }
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
class Union_Find {
vector<int> par;
vector<int> rankmy;
vector<int> ookisa;
public:
Union_Find(int size) {
par = vector<int>(size);
rankmy = vector<int>(size);
ookisa = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
ookisa[i] = 1;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (rankmy[x] < rankmy[y]) {
par[x] = y;
ookisa[y] += ookisa[x];
ookisa[x] = 0;
} else {
par[y] = x;
ookisa[x] += ookisa[y];
ookisa[y] = 0;
if (rankmy[x] == rankmy[y]) {
rankmy[x]++;
}
}
}
int size(int i) {
i = find(i);
return ookisa[i];
}
bool same(int x, int y) { return find(x) == find(y); }
};
// Union-Find-End
int perm[1000005];
void init_perm() {
perm[0] = 1;
REP(i, 1000000) { perm[i] = perm[i - 1] * i % mod; }
}
int nCk(int x, int y) {
return perm[x] * modpow(perm[x - y], mod - 2) % mod *
modpow(perm[y], mod - 2) % mod;
}
double kyori(pair<int, int> f, pair<int, int> s) {
double ans = 0;
double t = fabs(f.first - s.first);
double y = fabs(f.second - s.second);
ans = sqrt(t * t + y * y);
return ans;
}
inline string stringmax(string &x, string &y) {
if (x.size() > y.size()) {
return x;
}
if (x.size() < y.size()) {
return y;
}
rep(i, x.size()) {
if (x[i] > y[i]) {
return x;
}
if (x[i] < y[i]) {
return y;
}
}
return x;
}
#define endl "\n" // interactive の時に注意！！！
int n, rui[200004], rui2[200004], ans;
string s;
signed main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cin >> n >> s;
rep(i, n) {
if (s[i] == '#') {
rui[i]++;
}
if (i) {
rui[i] += rui[i - 1];
}
}
ans = inf;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '.') {
rui2[i]++;
}
rui2[i] += rui2[i + 1];
}
ans = rui[n - 1];
chmin(ans, rui2[0]);
rep(i, n) { chmin(ans, rui[i] + rui2[i + 1]); }
cout << ans << endl;
}
| [
"expression.operation.binary.add"
] | 879,996 | 879,997 | u943070796 | cpp |
p03069 | #include "bits/stdc++.h"
using namespace std;
struct Solver {
void solve() {
int N;
string S;
cin >> N >> S;
vector<int> b(N + 1), w(N + 1);
for (int i = 0; i < N; ++i) {
b[i + 1] = b[i] + (S[i] == '#');
w[i + 1] = w[i] + (S[i] == '.');
}
int ans = INT_MAX;
for (int i = 1; i <= N; ++i) {
int x = b[i];
int y = w[N] - w[i];
ans = min(ans, x + y);
}
cout << ans << endl;
}
};
int main() {
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
Solver().solve();
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
struct Solver {
void solve() {
int N;
string S;
cin >> N >> S;
vector<int> b(N + 1), w(N + 1);
for (int i = 0; i < N; ++i) {
b[i + 1] = b[i] + (S[i] == '#');
w[i + 1] = w[i] + (S[i] == '.');
}
int ans = INT_MAX;
for (int i = 0; i <= N; ++i) {
int x = b[i];
int y = w[N] - w[i];
ans = min(ans, x + y);
}
cout << ans << endl;
}
};
int main() {
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
Solver().solve();
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 879,998 | 879,999 | u842596864 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) \
{ std::cout << #a << " = " << a << "\n"; }
template <class T1, class T2> inline bool minimize(T1 &a, T2 b) {
return b < a && (a = b, 1);
}
template <class T1, class T2> inline bool maximize(T1 &a, T2 b) {
return a < b && (a = b, 1);
}
template <class T, class V> istream &operator>>(istream &ist, pair<T, V> &p) {
return ist >> p.first >> p.second;
}
template <class T> ostream &operator<<(ostream &ost, pair<T, T> &p) {
return ost << p.first << ", " << p.second;
}
template <class T> istream &operator>>(istream &ist, vector<T> &vs) {
for (auto &e : vs)
ist >> e;
return ist;
}
typedef long long ll;
int const inf = INT_MAX / 2;
int main() {
int N;
cin >> N;
string S;
cin >> S;
vector<int> b(N), w(N);
rep(i, N) {
b[i] = (i ? b[i - 1] : 0) + (S[i] == '#');
w[N - i - 1] = (i ? w[N - i] : 0) + (S[N - i - 1] == '.');
}
int ans = inf;
rep(i, N) { ans = min(ans, b[i] + (i < N - 1 ? w[i + 1] : 0)); }
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) \
{ std::cout << #a << " = " << a << "\n"; }
template <class T1, class T2> inline bool minimize(T1 &a, T2 b) {
return b < a && (a = b, 1);
}
template <class T1, class T2> inline bool maximize(T1 &a, T2 b) {
return a < b && (a = b, 1);
}
template <class T, class V> istream &operator>>(istream &ist, pair<T, V> &p) {
return ist >> p.first >> p.second;
}
template <class T> ostream &operator<<(ostream &ost, pair<T, T> &p) {
return ost << p.first << ", " << p.second;
}
template <class T> istream &operator>>(istream &ist, vector<T> &vs) {
for (auto &e : vs)
ist >> e;
return ist;
}
typedef long long ll;
int const inf = INT_MAX / 2;
int main() {
int N;
cin >> N;
string S;
cin >> S;
vector<int> b(N), w(N);
rep(i, N) {
b[i] = (i ? b[i - 1] : 0) + (S[i] == '#');
w[N - i - 1] = (i ? w[N - i] : 0) + (S[N - i - 1] == '.');
}
int ans = w[0];
rep(i, N) { ans = min(ans, b[i] + (i < N - 1 ? w[i + 1] : 0)); }
cout << ans << endl;
}
| [] | 880,002 | 880,003 | u809665051 | cpp |
p03069 | #include <algorithm>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define ALL(obj) obj.begin(), obj.end()
const int iINF = 1e9;
const long long llINF = 1e18;
const int MOD = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <int MOD> struct ModInt {
long long val;
constexpr ModInt(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr ModInt operator-() const noexcept { return val ? MOD - val : 0; }
constexpr ModInt operator+(const ModInt &r) const noexcept {
return ModInt(*this) += r;
}
constexpr ModInt operator-(const ModInt &r) const noexcept {
return ModInt(*this) -= r;
}
constexpr ModInt operator*(const ModInt &r) const noexcept {
return ModInt(*this) *= r;
}
constexpr ModInt operator/(const ModInt &r) const noexcept {
return ModInt(*this) /= r;
}
constexpr ModInt &operator+=(const ModInt &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr ModInt &operator-=(const ModInt &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr ModInt &operator*=(const ModInt &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr ModInt &operator/=(const ModInt &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const ModInt &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const ModInt &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os,
const ModInt<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, ModInt<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr ModInt<MOD> modpow(const ModInt<MOD> &a,
long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = ModInt<MOD>;
long long modPow(long long x, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
template <typename T> map<T, int> compress(vector<T> x) {
map<T, int> res;
sort(x.begin(), x.end());
x.erase(unique(x.begin(), x.end()), x.end());
for (int i = 0; i < x.size(); i++) {
res[x[i]] = i;
}
return res;
}
template <typename T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <typename T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T> using Vec = vector<T>;
template <typename T> using VVec = vector<vector<T>>;
using LL = long long;
int main() {
int N;
string S;
cin >> N >> S;
Vec<int> b(N + 1, 0), w(N + 1, 0);
REP(i, N) {
b[i + 1] = b[i] + (S[i] == '#');
w[i + 1] = w[i] + (S[i] == '.');
}
int ans = iINF;
REP(i, N) { chmin(ans, b[i] + w[N] - w[i]); }
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define ALL(obj) obj.begin(), obj.end()
const int iINF = 1e9;
const long long llINF = 1e18;
const int MOD = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <int MOD> struct ModInt {
long long val;
constexpr ModInt(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr ModInt operator-() const noexcept { return val ? MOD - val : 0; }
constexpr ModInt operator+(const ModInt &r) const noexcept {
return ModInt(*this) += r;
}
constexpr ModInt operator-(const ModInt &r) const noexcept {
return ModInt(*this) -= r;
}
constexpr ModInt operator*(const ModInt &r) const noexcept {
return ModInt(*this) *= r;
}
constexpr ModInt operator/(const ModInt &r) const noexcept {
return ModInt(*this) /= r;
}
constexpr ModInt &operator+=(const ModInt &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr ModInt &operator-=(const ModInt &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr ModInt &operator*=(const ModInt &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr ModInt &operator/=(const ModInt &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const ModInt &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const ModInt &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os,
const ModInt<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, ModInt<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr ModInt<MOD> modpow(const ModInt<MOD> &a,
long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = ModInt<MOD>;
long long modPow(long long x, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
template <typename T> map<T, int> compress(vector<T> x) {
map<T, int> res;
sort(x.begin(), x.end());
x.erase(unique(x.begin(), x.end()), x.end());
for (int i = 0; i < x.size(); i++) {
res[x[i]] = i;
}
return res;
}
template <typename T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <typename T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T> using Vec = vector<T>;
template <typename T> using VVec = vector<vector<T>>;
using LL = long long;
int main() {
int N;
string S;
cin >> N >> S;
Vec<int> b(N + 1, 0), w(N + 1, 0);
REP(i, N) {
b[i + 1] = b[i] + (S[i] == '#');
w[i + 1] = w[i] + (S[i] == '.');
}
int ans = iINF;
REP(i, N + 1) { chmin(ans, b[i] + w[N] - w[i]); }
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 880,004 | 880,005 | u951479148 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int num_b, num_w, w_all;
num_b = 0;
num_w = 0;
w_all = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '.') {
w_all++;
}
}
int ans = 1000000000;
for (int i = 0; i < n; ++i) {
int cal = 0;
if (s[i] == '.') {
num_w++;
} else {
num_b++;
}
cal = num_b + w_all - num_w;
ans = min(ans, cal);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int num_b, num_w, w_all;
num_b = 0;
num_w = 0;
w_all = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '.') {
w_all++;
}
}
int ans = w_all;
for (int i = 0; i < n; ++i) {
int cal = 0;
if (s[i] == '.') {
num_w++;
} else {
num_b++;
}
cal = num_b + w_all - num_w;
ans = min(ans, cal);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 880,006 | 880,007 | u144029820 | cpp |
p03069 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef unsigned long long ll;
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int bc = 0;
int wc = 0;
rep(i, n) {
if (s[i] == '.')
wc++;
}
int ans = wc + 1;
rep(i, n) {
if (s[i] == '#') {
bc++;
} else {
wc--;
}
ans = min(ans, bc + wc);
}
cout << ans;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef unsigned long long ll;
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int bc = 0;
int wc = 0;
rep(i, n) {
if (s[i] == '.')
wc++;
}
int ans = wc;
rep(i, n) {
if (s[i] == '#') {
bc++;
} else {
wc--;
}
ans = min(ans, bc + wc);
}
cout << ans;
} | [
"expression.operation.binary.remove"
] | 880,010 | 880,011 | u721082205 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1ll << 60;
int main(int argc, char **argv) {
int n;
cin >> n;
string str;
cin >> str;
vector<ll> white_sum(n + 1, 0), black_sum(n + 1, 0);
for (int i = 0; i < n; ++i) {
white_sum[i + 1] = white_sum[i] + (str[i] == '#' ? 1 : 0);
black_sum[i + 1] = white_sum[i] + (str[i] == '.' ? 1 : 0);
}
ll res{INF};
for (int left = 0; left < n; ++left) {
ll tmp{0};
tmp += black_sum[left];
tmp += white_sum[n] - white_sum[left];
res = min(res, tmp);
}
std::cout << res << std::endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1ll << 60;
int main(int argc, char **argv) {
int n;
cin >> n;
string str;
cin >> str;
vector<ll> white_sum(n + 1, 0), black_sum(n + 1, 0);
for (int i = 0; i < n; ++i) {
black_sum[i + 1] = black_sum[i] + (str[i] == '#' ? 1 : 0);
white_sum[i + 1] = white_sum[i] + (str[i] == '.' ? 1 : 0);
}
ll res{INF};
for (int left = 0; left <= n; ++left) {
ll tmp{0};
tmp += black_sum[left];
tmp += white_sum[n] - white_sum[left];
res = min(res, tmp);
}
std::cout << res << std::endl;
} | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 880,014 | 880,015 | u350072791 | cpp |
p03069 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#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 Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF = 1e18 + 7;
const int inf = 1e9 + 7;
using P = pair<int, int>;
vector<int> dx = {0, 1, -1, 0};
vector<int> dy = {1, 0, 0, -1};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(10);
int n;
string s;
cin >> n >> s;
int cntl = 0, cntr = 0;
rep(i, n) {
if (s[i] == '#')
cntr++;
}
int ans = cntr;
rep(i, n) {
if (s[i] == '.')
cntr--;
else
cntl++;
ans = min(ans, cntl + cntr);
}
cout << ans << endl;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#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 Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF = 1e18 + 7;
const int inf = 1e9 + 7;
using P = pair<int, int>;
vector<int> dx = {0, 1, -1, 0};
vector<int> dy = {1, 0, 0, -1};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(10);
int n;
string s;
cin >> n >> s;
int cntl = 0, cntr = 0;
rep(i, n) {
if (s[i] == '.')
cntr++;
}
int ans = cntr;
rep(i, n) {
if (s[i] == '.')
cntr--;
else
cntl++;
ans = min(ans, cntl + cntr);
}
cout << ans << endl;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 880,018 | 880,019 | u424602097 | cpp |
p03069 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T> using Vvec = vector<vector<T>>;
template <class T> void debug(T &v) {
for (auto &x : v)
cout << x << " ";
cout << endl;
}
int main() {
int N;
string S;
cin >> N >> S;
vector<ll> w(N), b(N);
b[0] = (S[0] == '#') ? 1 : 0;
w[N - 1] = (S[N - 1] == '.') ? 1 : 0;
for (int i = 1; i < N; i++) {
b[i] = b[i - 1];
if (S[i] == '#')
b[i]++;
}
for (int i = N - 2; i >= 0; i--) {
w[i] = w[i + 1];
if (S[i] == '.')
w[i]++;
}
ll ans = min(w[0], b[N - 1]);
for (int i = 0; i < N - 1; i++)
ans = min(ans, w[i] + b[i + 1]);
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T> using Vvec = vector<vector<T>>;
template <class T> void debug(T &v) {
for (auto &x : v)
cout << x << " ";
cout << endl;
}
int main() {
int N;
string S;
cin >> N >> S;
vector<ll> w(N), b(N);
b[0] = (S[0] == '#') ? 1 : 0;
w[N - 1] = (S[N - 1] == '.') ? 1 : 0;
for (int i = 1; i < N; i++) {
b[i] = b[i - 1];
if (S[i] == '#')
b[i]++;
}
for (int i = N - 2; i >= 0; i--) {
w[i] = w[i + 1];
if (S[i] == '.')
w[i]++;
}
ll ans = min(w[0], b[N - 1]);
for (int i = 0; i < N - 1; i++)
ans = min(ans, b[i] + w[i + 1]);
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 880,039 | 880,040 | u440312135 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int sum[n];
sum[0] = 0;
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + (s[i - 1] == '.');
}
int ans = n;
for (int i = 0; i < n; i++) {
int a = sum[n] + i - 2 * sum[i];
ans = min(a, ans);
}
cout << ans;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int sum[n + 1];
sum[0] = 0;
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + (s[i - 1] == '.');
}
int ans = n;
for (int i = 0; i <= n; i++) {
int a = sum[n] + i - 2 * sum[i];
ans = min(a, ans);
}
cout << ans;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 880,043 | 880,044 | u724012411 | cpp |
p03069 | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N;
string S;
cin >> N >> S;
int sumw = count(ALL(S), '.');
int ans = 1 << 30, b = 0, w = 0;
REP(i, 0, N) {
if (S[i] == '.')
w++;
else
b++;
ans = min(ans, b + sumw - w);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N;
string S;
cin >> N >> S;
int sumw = count(ALL(S), '.');
int ans = sumw, b = 0, w = 0;
REP(i, 0, N) {
if (S[i] == '.')
w++;
else
b++;
ans = min(ans, b + sumw - w);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 880,045 | 880,046 | u483992368 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
string S;
cin >> N >> S;
int w = 0, b = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '.')
w++;
}
int res = 1 << 28;
for (int i = 0; i < N; i++) {
if (S[i] == '.')
w--;
if (S[i] == '#')
b++;
res = min(res, w + b);
}
cout << res << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
string S;
cin >> N >> S;
int w = 0, b = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '.')
w++;
}
int res = w + b;
for (int i = 0; i < N; i++) {
if (S[i] == '.')
w--;
if (S[i] == '#')
b++;
res = min(res, w + b);
}
cout << res << '\n';
return 0;
}
| [] | 880,049 | 880,050 | u782098901 | cpp |
p03069 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = unsigned long long;
int main() {
int n;
string s;
cin >> n >> s;
// 左にある黒
vector<int> black(s.size() + 2, 0);
// 右にある白
vector<int> white(s.size() + 2, 0);
for (int i = 1; i <= s.size(); i++) {
if (s[i - 1] == '#') {
black[i] = black[i - 1] + 1;
} else {
black[i] = black[i - 1];
}
}
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] != '#') {
white[i] = white[i + 1] + 1;
} else {
white[i] = white[i + 1];
}
}
int result = 9999999;
for (int i = 1; i <= s.size(); i++) {
int tmp = black[i] + white[i];
result = min(tmp, result);
}
cout << result << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = unsigned long long;
int main() {
int n;
string s;
cin >> n >> s;
// 左にある黒
vector<int> black(s.size() + 2, 0);
// 右にある白
vector<int> white(s.size() + 2, 0);
for (int i = 1; i <= s.size(); i++) {
if (s[i - 1] == '#') {
black[i] = black[i - 1] + 1;
} else {
black[i] = black[i - 1];
}
}
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] != '#') {
white[i] = white[i + 1] + 1;
} else {
white[i] = white[i + 1];
}
}
int result = 9999999;
for (int i = 0; i <= s.size(); i++) {
int tmp = black[i] + white[i];
result = min(tmp, result);
}
cout << result << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,053 | 880,054 | u231458241 | cpp |
p03069 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int l = 0, r = 0;
rep(i, n) {
if (s[i] == '.') {
r++;
}
}
int ans = 1e8;
rep(i, n) {
if (s[i] == '.') {
r--;
} else {
l++;
}
ans = min(ans, l + r);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int l = 0, r = 0;
rep(i, n) {
if (s[i] == '.') {
r++;
}
}
int ans = l + r;
rep(i, n) {
if (s[i] == '.') {
r--;
} else {
l++;
}
ans = min(ans, l + r);
}
cout << ans << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove"
] | 880,082 | 880,083 | u142082997 | cpp |
p03069 | // confilm 0LL and 1LL
// confilm cornercases such as 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecVec = vector<Vec>;
#define REP(i, m, n) for (ll(i) = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for (ll(i) = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for (ll(i) = (m); (i) >= (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPR(i, n, 1)
#define co(n) cout << (n) << endl
#define cosp(n) cout << (n) << ' '
#define setp(n) cout << fixed << setprecision(n);
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fs first
#define sc second
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void sonic() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
const ll INF = 1e9 + 1;
const ll LINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const double PI = acos(-1);
const double EPS = 1e-9;
int main(void) {
ll n;
cin >> n;
string s;
cin >> s;
Vec cntW(n), cntB(n);
rep(i, n) {
if (s[i] == '#')
cntB[i]++;
if (i)
cntB[i] += cntB[i - 1];
}
repr(i, n) {
if (s[i] == '.')
cntW[i]++;
if (i < n - 1)
cntW[i] += cntW[i + 1];
}
ll ans = min(cntW[0], cntB[n - 1]);
rep(i, n - 1) chmin(ans, cntW[i] + cntB[i + 1]);
co(ans);
return 0;
}
| // confilm 0LL and 1LL
// confilm cornercases such as 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecVec = vector<Vec>;
#define REP(i, m, n) for (ll(i) = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for (ll(i) = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for (ll(i) = (m); (i) >= (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPR(i, n, 1)
#define co(n) cout << (n) << endl
#define cosp(n) cout << (n) << ' '
#define setp(n) cout << fixed << setprecision(n);
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fs first
#define sc second
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void sonic() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
const ll INF = 1e9 + 1;
const ll LINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const double PI = acos(-1);
const double EPS = 1e-9;
int main(void) {
ll n;
cin >> n;
string s;
cin >> s;
Vec cntW(n), cntB(n);
rep(i, n) {
if (s[i] == '#')
cntB[i]++;
if (i)
cntB[i] += cntB[i - 1];
}
repr(i, n) {
if (s[i] == '.')
cntW[i]++;
if (i < n - 1)
cntW[i] += cntW[i + 1];
}
ll ans = min(cntW[0], cntB[n - 1]);
rep(i, n - 1) chmin(ans, cntW[i + 1] + cntB[i]);
co(ans);
return 0;
}
| [
"expression.operation.binary.remove"
] | 880,088 | 880,089 | u997368585 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define maxn 100
#define int long long int
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int mpow(int N, int P, int M) //繰り返し自乗法
{
if (P == 0)
return 1;
if (P % 2 == 0) {
int t = mpow(N, P / 2, M);
return t * t % M;
}
return N * mpow(N, P - 1, M) % M;
}
int counter(int x) { // bit計算
if (x == 0)
return 0;
return counter(x >> 1) + (x & 1);
}
vector<bool> prime(maxn + 1, true); //素数テーブル
void prime_table(void) {
prime[0] = false;
prime[1] = false;
for (int i = 2; i * i <= maxn; i++) {
if (!prime[i]) {
continue;
}
for (int j = i + i; j <= maxn; j += j + i) {
prime[j] = false;
}
}
}
bool IsPrime(int num) { //素数判定
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
signed main() {
int N;
cin >> N;
string S;
cin >> S;
int w[N], b[N];
rep(i, N) {
w[i] = 0;
b[i] = 0;
}
for (int i = 0; i < N; i++) {
if (S[i] == '#') {
b[i]++;
}
if (i > 0)
b[i] += b[i - 1];
}
for (int i = N - 1; i >= 0; i--) {
if (S[i] == '.') {
w[i]++;
}
if (i < N - 1)
w[i] += w[i + 1];
}
int ans = min(b[N - 1], w[0]);
rep(i, N - 1) {
int count = w[i] + b[i + 1];
ans = min(count, ans);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define maxn 100
#define int long long int
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int mpow(int N, int P, int M) //繰り返し自乗法
{
if (P == 0)
return 1;
if (P % 2 == 0) {
int t = mpow(N, P / 2, M);
return t * t % M;
}
return N * mpow(N, P - 1, M) % M;
}
int counter(int x) { // bit計算
if (x == 0)
return 0;
return counter(x >> 1) + (x & 1);
}
vector<bool> prime(maxn + 1, true); //素数テーブル
void prime_table(void) {
prime[0] = false;
prime[1] = false;
for (int i = 2; i * i <= maxn; i++) {
if (!prime[i]) {
continue;
}
for (int j = i + i; j <= maxn; j += j + i) {
prime[j] = false;
}
}
}
bool IsPrime(int num) { //素数判定
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
signed main() {
int N;
cin >> N;
string S;
cin >> S;
int w[N], b[N];
rep(i, N) {
w[i] = 0;
b[i] = 0;
}
for (int i = 0; i < N; i++) {
if (S[i] == '#') {
b[i]++;
}
if (i > 0)
b[i] += b[i - 1];
}
for (int i = N - 1; i >= 0; i--) {
if (S[i] == '.') {
w[i]++;
}
if (i < N - 1)
w[i] += w[i + 1];
}
int ans = min(b[N - 1], w[0]);
rep(i, N - 1) {
int count = w[i + 1] + b[i];
ans = min(count, ans);
}
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 880,090 | 880,091 | u568545273 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int out = 0;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
for (int j = 0; j < s.size(); j++) {
if (s.at(j) == '.')
count++;
out = count;
}
} else {
if (s.at(i - 1) == '.' & s.at(i) == '.') {
count--;
} else if (s.at(i - 1) == '#' & s.at(i) == '#') {
count++;
} else if (s.at(i - 1) == '.' & s.at(i) == '#') {
count--;
} else if (s.at(i - 1) == '#' & s.at(i) == '.') {
count++;
}
if (out > count) {
out = count;
}
}
if (i == s.size() - 1) {
int count2 = 0;
for (int j = 0; j < s.size(); j++) {
if (s.at(j) == '#')
count2++;
if (out > count2)
out = count2;
}
}
}
cout << out;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int out = 0;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
for (int j = 0; j < s.size(); j++) {
if (s.at(j) == '.')
count++;
out = count;
}
} else {
if (s.at(i - 1) == '.' & s.at(i) == '.') {
count--;
} else if (s.at(i - 1) == '#' & s.at(i) == '#') {
count++;
} else if (s.at(i - 1) == '.' & s.at(i) == '#') {
count--;
} else if (s.at(i - 1) == '#' & s.at(i) == '.') {
count++;
}
if (out > count) {
out = count;
}
}
if (i == s.size() - 1) {
int count2 = 0;
for (int j = 0; j < s.size(); j++) {
if (s.at(j) == '#')
count2++;
}
if (out > count2)
out = count2;
}
}
cout << out;
} | [] | 880,096 | 880,097 | u431602218 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, num = 0, ans;
string s;
cin >> n >> s;
int siro[n + 1], kuro[n + 1];
siro[0] = 0;
kuro[n] = 0;
ans = n;
for (int i = 0; i < n; ++i) {
if (s[i + 1] == '#')
num++;
siro[i + 1] = num;
}
num = 0;
for (int i = n - 1; i >= 0; --i) {
if (s[i] == '.')
num++;
kuro[i] = num;
}
for (int i = 0; i <= n; ++i) {
if (siro[i] + kuro[i] < ans)
ans = siro[i] + kuro[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, num = 0, ans;
string s;
cin >> n >> s;
int siro[n + 1], kuro[n + 1];
siro[0] = 0;
kuro[n] = 0;
ans = n;
for (int i = 1; i <= n; ++i) {
if (s[i - 1] == '#')
num++;
siro[i] = num;
}
num = 0;
for (int i = n - 1; i >= 0; --i) {
if (s[i] == '.')
num++;
kuro[i] = num;
}
for (int i = 0; i <= n; ++i) {
if (siro[i] + kuro[i] < ans)
ans = siro[i] + kuro[i];
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.c... | 880,127 | 880,128 | u021083776 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, num = 0, ans;
string s;
cin >> n >> s;
int siro[n + 1], kuro[n + 1];
siro[0] = 0;
kuro[n] = 0;
ans = n;
for (int i = 1; i <= n; ++i) {
if (s[i] == '#')
num++;
siro[i] = num;
}
num = 0;
for (int i = n - 1; i >= 0; --i) {
if (s[i] == '.')
num++;
kuro[i] = num;
}
for (int i = 0; i <= n; ++i) {
if (siro[i] + kuro[i] < ans)
ans = siro[i] + kuro[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, num = 0, ans;
string s;
cin >> n >> s;
int siro[n + 1], kuro[n + 1];
siro[0] = 0;
kuro[n] = 0;
ans = n;
for (int i = 1; i <= n; ++i) {
if (s[i - 1] == '#')
num++;
siro[i] = num;
}
num = 0;
for (int i = n - 1; i >= 0; --i) {
if (s[i] == '.')
num++;
kuro[i] = num;
}
for (int i = 0; i <= n; ++i) {
if (siro[i] + kuro[i] < ans)
ans = siro[i] + kuro[i];
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 880,129 | 880,128 | u021083776 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (int i = (n)-1; i >= s; --i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define aall(a) (a), (a) + countof(a) // for array sorting
#define raall(a) (a), (a) + countof(a), greater<>()
#define show(x) cout << #x << " = " << x << endl;
#define vfind(v, a) find(all(v), a) != v.end()
#define yn(f) \
{ \
if (f) \
puts("YES"); \
else \
puts("NO"); \
}
#define yns(f) \
{ \
if (f) \
puts("Yes"); \
else \
puts("No"); \
}
#define show_ary(...) \
{ \
cout << #__VA_ARGS__ << " = "; \
for (const auto &x : (__VA_ARGS__)) { \
cout << x << " "; \
} \
cout << endl; \
}
#define show_pair(...) \
cout << #__VA_ARGS__ << " = " << endl; \
for (const auto &x : (__VA_ARGS__)) { \
cout << " " << x.fi << " : " << x.se << endl; \
}
#define out_ary(...) \
{ \
for (const auto &x : (__VA_ARGS__)) { \
cout << x << " "; \
} \
cout << endl; \
}
#define argmax(v) distance((v).begin(), max_element(all(v)))
#define argmin(v) distance((v).begin(), min_element(all(v)))
#define vmax(v) *max_element(all(v))
#define vmin(v) *min_element(all(v))
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<P> vpair;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<string> vstr;
typedef vector<bool> vbool;
typedef vector<vint> vvint;
typedef vector<vll> vvll;
typedef vector<vstr> vvstr;
typedef vector<vbool> vvbool;
const ll LINF = 2000000000000000000ll;
const int INF = 1000000100;
const ll MOD = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
vint b(n), w(n);
int bc = INF;
if (s[0] == '.') {
b[0] = 0;
w[0] = 1;
} else {
b[0] = 1;
w[0] = 0;
}
srep(i, n, 1) {
b[i] = b[i - 1];
w[i] = w[i - 1];
if (s[i] == '.')
w[i]++;
else
b[i]++;
}
int ans = INF;
rep(i, n) { ans = min(ans, b[i] + w[n - 1] - w[i]); }
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (int i = (n)-1; i >= s; --i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define aall(a) (a), (a) + countof(a) // for array sorting
#define raall(a) (a), (a) + countof(a), greater<>()
#define show(x) cout << #x << " = " << x << endl;
#define vfind(v, a) find(all(v), a) != v.end()
#define yn(f) \
{ \
if (f) \
puts("YES"); \
else \
puts("NO"); \
}
#define yns(f) \
{ \
if (f) \
puts("Yes"); \
else \
puts("No"); \
}
#define show_ary(...) \
{ \
cout << #__VA_ARGS__ << " = "; \
for (const auto &x : (__VA_ARGS__)) { \
cout << x << " "; \
} \
cout << endl; \
}
#define show_pair(...) \
cout << #__VA_ARGS__ << " = " << endl; \
for (const auto &x : (__VA_ARGS__)) { \
cout << " " << x.fi << " : " << x.se << endl; \
}
#define out_ary(...) \
{ \
for (const auto &x : (__VA_ARGS__)) { \
cout << x << " "; \
} \
cout << endl; \
}
#define argmax(v) distance((v).begin(), max_element(all(v)))
#define argmin(v) distance((v).begin(), min_element(all(v)))
#define vmax(v) *max_element(all(v))
#define vmin(v) *min_element(all(v))
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<P> vpair;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<string> vstr;
typedef vector<bool> vbool;
typedef vector<vint> vvint;
typedef vector<vll> vvll;
typedef vector<vstr> vvstr;
typedef vector<vbool> vvbool;
const ll LINF = 2000000000000000000ll;
const int INF = 1000000100;
const ll MOD = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
vint b(n), w(n);
int bc = INF;
if (s[0] == '.') {
b[0] = 0;
w[0] = 1;
} else {
b[0] = 1;
w[0] = 0;
}
srep(i, n, 1) {
b[i] = b[i - 1];
w[i] = w[i - 1];
if (s[i] == '.')
w[i]++;
else
b[i]++;
}
int ans = w[n - 1];
rep(i, n) { ans = min(ans, b[i] + w[n - 1] - w[i]); }
cout << ans << endl;
return 0;
} | [] | 880,135 | 880,136 | u365512540 | cpp |
p03069 | #include <algorithm>
#include <cassert>
#include <cfenv>
#include <cmath>
#include <functional>
#include <iostream>
#include <vector>
using ll = unsigned long long;
using namespace std;
int gcd(int x, int y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> vec1(n);
vector<int> vec2(n);
if (s[0] == '#') {
vec1[0] = 1;
}
if (s[n - 1] == '.') {
vec2[n - 1] = 1;
}
// int c=0;
for (int i = 1; i < n; i++) {
vec1[i] = vec1[i - 1];
if (s[i] == '#') {
vec1[i]++;
}
}
for (int i = n - 2; i >= 0; i--) {
vec2[i] = vec2[i + 1];
if (s[i] == '.') {
vec2[i]++;
}
}
int Min = vec1[n - 1];
Min = min(vec2[0], Min);
// cout<<Min<<endl;
for (int i = 1; i < n - 1; i++) {
Min = min({Min, vec1[i] + vec2[i + 1]});
// cout<<vec1[i]+vec2[i]<<endl;
}
cout << Min << endl;
} | #include <algorithm>
#include <cassert>
#include <cfenv>
#include <cmath>
#include <functional>
#include <iostream>
#include <vector>
using ll = unsigned long long;
using namespace std;
int gcd(int x, int y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> vec1(n);
vector<int> vec2(n);
if (s[0] == '#') {
vec1[0] = 1;
}
if (s[n - 1] == '.') {
vec2[n - 1] = 1;
}
// int c=0;
for (int i = 1; i < n; i++) {
vec1[i] = vec1[i - 1];
if (s[i] == '#') {
vec1[i]++;
}
}
for (int i = n - 2; i >= 0; i--) {
vec2[i] = vec2[i + 1];
if (s[i] == '.') {
vec2[i]++;
}
}
int Min = vec1[n - 1];
Min = min(vec2[0], Min);
// cout<<Min<<endl;
for (int i = 0; i < n; i++) {
Min = min({Min, vec1[i] + vec2[i + 1]});
// cout<<vec1[i]+vec2[i]<<endl;
}
cout << Min << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 880,139 | 880,140 | u759162415 | cpp |
p03069 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template <class T1, class T2> bool chmin(T1 &a, T2 b) {
return b < a && (a = b, true);
}
template <class T1, class T2> bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
vll r(v.size());
rep(i, v.size()) r[i] = v[i];
return r;
}
inline void input(int &v) {
v = 0;
char c = 0;
int p = 1;
while (c < '0' || c > '9') {
if (c == '-')
p = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
v = (v << 3) + (v << 1) + c - '0';
c = getchar();
}
v *= p;
} // これを使うならば、tieとかを消して！！
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
o << "(" << v.first << ", " << v.second << ")";
return o;
}
template <size_t...> struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is> struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
using s = int[];
(void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
-> basic_ostream<Ch, Tr> & {
os << "(";
print_tuple(os, t, gen_seq<sizeof...(Args)>());
return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
rep(i, v.size()) {
rep(j, v[i].size()) o << v[i][j] << " ";
o << endl;
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it;
o << "]";
return o;
}
vector<int> range(const int x, const int y) {
vector<int> v(y - x + 1);
iota(v.begin(), v.end(), x);
return v;
}
template <typename T> istream &operator>>(istream &i, vector<T> &o) {
rep(j, o.size()) i >> o[j];
return i;
}
template <typename T, typename S, typename U>
ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.front();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> unordered_map<T, ll> counter(vector<T> vec) {
unordered_map<T, ll> ret;
for (auto &&x : vec)
ret[x]++;
return ret;
};
string substr(string s, P x) { return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
ofstream ofs("./out.dot");
ofs << "digraph graph_name {" << endl;
set<P> memo;
rep(i, g.size()) rep(j, g[i].size()) {
if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
continue;
memo.insert(P(i, g[i][j]));
ofs << " " << i << " -> " << g[i][j]
<< (mode ? " [arrowhead = none]" : "") << endl;
}
ofs << "}" << endl;
ofs.close();
system(((string) "dot -T png out.dot >" + filename).c_str());
}
size_t random_seed;
namespace std {
using argument_type = P;
template <> struct hash<argument_type> {
size_t operator()(argument_type const &x) const {
size_t seed = random_seed;
seed ^= hash<ll>{}(x.fi);
seed ^= (hash<ll>{}(x.se) << 1);
return seed;
}
};
}; // namespace std
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9 + 7)
// end of hamko utils
int main() {
int N;
cin >> N;
string S;
cin >> S;
ll ans = 1e9;
ll bl = 0, wh = 0;
for (int i = 0; i < N; ++i) {
if (S[i] == '.')
++wh;
}
for (int i = 0; i < N; ++i) {
if (S[i] == '.') {
--wh;
} else
++bl;
cerr << bl + wh << endl;
ans = min(ans, bl + wh);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template <class T1, class T2> bool chmin(T1 &a, T2 b) {
return b < a && (a = b, true);
}
template <class T1, class T2> bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
vll r(v.size());
rep(i, v.size()) r[i] = v[i];
return r;
}
inline void input(int &v) {
v = 0;
char c = 0;
int p = 1;
while (c < '0' || c > '9') {
if (c == '-')
p = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
v = (v << 3) + (v << 1) + c - '0';
c = getchar();
}
v *= p;
} // これを使うならば、tieとかを消して！！
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
o << "(" << v.first << ", " << v.second << ")";
return o;
}
template <size_t...> struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is> struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
using s = int[];
(void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
-> basic_ostream<Ch, Tr> & {
os << "(";
print_tuple(os, t, gen_seq<sizeof...(Args)>());
return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
rep(i, v.size()) {
rep(j, v[i].size()) o << v[i][j] << " ";
o << endl;
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it;
o << "]";
return o;
}
vector<int> range(const int x, const int y) {
vector<int> v(y - x + 1);
iota(v.begin(), v.end(), x);
return v;
}
template <typename T> istream &operator>>(istream &i, vector<T> &o) {
rep(j, o.size()) i >> o[j];
return i;
}
template <typename T, typename S, typename U>
ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.front();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> unordered_map<T, ll> counter(vector<T> vec) {
unordered_map<T, ll> ret;
for (auto &&x : vec)
ret[x]++;
return ret;
};
string substr(string s, P x) { return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
ofstream ofs("./out.dot");
ofs << "digraph graph_name {" << endl;
set<P> memo;
rep(i, g.size()) rep(j, g[i].size()) {
if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
continue;
memo.insert(P(i, g[i][j]));
ofs << " " << i << " -> " << g[i][j]
<< (mode ? " [arrowhead = none]" : "") << endl;
}
ofs << "}" << endl;
ofs.close();
system(((string) "dot -T png out.dot >" + filename).c_str());
}
size_t random_seed;
namespace std {
using argument_type = P;
template <> struct hash<argument_type> {
size_t operator()(argument_type const &x) const {
size_t seed = random_seed;
seed ^= hash<ll>{}(x.fi);
seed ^= (hash<ll>{}(x.se) << 1);
return seed;
}
};
}; // namespace std
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9 + 7)
// end of hamko utils
int main() {
int N;
cin >> N;
string S;
cin >> S;
ll ans = 1e9;
ll bl = 0, wh = 0;
for (int i = 0; i < N; ++i) {
if (S[i] == '.')
++wh;
}
ans = bl + wh;
for (int i = 0; i < N; ++i) {
if (S[i] == '.') {
--wh;
} else
++bl;
cerr << bl + wh << endl;
ans = min(ans, bl + wh);
}
cout << ans << endl;
} | [
"assignment.add"
] | 880,141 | 880,142 | u142878260 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007
#define INF (1 << 30)
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
vector<int> W(n + 1), B(n + 1);
rep(i, n) {
if (s[i] == '#')
B[i + 1] = B[i] + 1;
else
B[i + 1] = B[i];
}
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '.')
W[i] = W[i + 1] + 1;
else
W[i] = W[i + 1];
}
int ans = INF;
rep(i, n) ans = min(ans, W[i] + B[i]);
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007
#define INF (1 << 30)
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
vector<int> B(n + 1), W(n + 1);
rep(i, n) {
if (s[i] == '#')
B[i + 1] = B[i] + 1;
else
B[i + 1] = B[i];
}
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '.')
W[i] = W[i + 1] + 1;
else
W[i] = W[i + 1];
}
int ans = INF;
rep(i, n + 1) ans = min(ans, W[i] + B[i]);
cout << ans << '\n';
return 0;
} | [
"variable_declaration.name.change",
"identifier.change",
"assignment.change"
] | 880,149 | 880,150 | u539199630 | cpp |
p03069 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using TP = tuple<ll, ll, ll>;
ll MOD = 1e9 + 7;
ll INF = 1LL << 58;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> b(N + 1, 0), w(N + 1, 0);
char s;
REP(i, N) {
cin >> s;
if (s == '#') {
b[i]++;
} else {
w[i]++;
}
}
for (ll i = 0; i < N - 1; i++) {
b[i + 1] += b[i];
}
for (ll i = N; i > 0; i--) {
w[i - 1] += w[i];
}
ll m = 1e9;
for (int i = 1; i <= N; i++) {
// cout << b[i-1] << "," << w[i] << endl;
m = min(m, b[i - 1] + w[i]);
}
cout << m << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using TP = tuple<ll, ll, ll>;
ll MOD = 1e9 + 7;
ll INF = 1LL << 58;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> b(N + 1, 0), w(N + 1, 0);
char s;
REP(i, N) {
cin >> s;
if (s == '#') {
b[i + 1]++;
} else {
w[i]++;
}
}
for (ll i = 0; i < N - 1; i++) {
b[i + 1] += b[i];
}
for (ll i = N; i > 0; i--) {
w[i - 1] += w[i];
}
ll m = 1e9;
for (int i = 0; i <= N; i++) {
// cout << b[i] << "," << w[i] << endl;
m = min(m, b[i - 1] + w[i]);
}
cout << m << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,159 | 880,160 | u432194969 | cpp |
p03069 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vint;
typedef vector<string> vstr;
typedef vector<char> vchar;
const ll LINF = 1e18;
const ll MOD = 1e9 + 7;
int x_pos[4] = {1, 0, -1, 0}, y_pos[4] = {0, 1, 0, -1};
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
char upper(char c) { return c - 0x20; }
char lower(char c) { return c + 0x20; }
void unique_vector(vector<int> &v) {
sort(all(v));
v.erase(unique(all(v)), v.end());
}
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
int w_cnt = 0;
rep(i, n) if (s[i] == '.') w_cnt++;
int b_cnt = 0;
int ans = INF;
rep(i, n) {
if (s[i] == '#')
b_cnt++;
else
w_cnt--;
ans = min(ans, b_cnt + w_cnt);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vint;
typedef vector<string> vstr;
typedef vector<char> vchar;
const ll LINF = 1e18;
const ll MOD = 1e9 + 7;
int x_pos[4] = {1, 0, -1, 0}, y_pos[4] = {0, 1, 0, -1};
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
char upper(char c) { return c - 0x20; }
char lower(char c) { return c + 0x20; }
void unique_vector(vector<int> &v) {
sort(all(v));
v.erase(unique(all(v)), v.end());
}
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
int w_cnt = 0;
rep(i, n) if (s[i] == '.') w_cnt++;
int b_cnt = 0;
int ans = w_cnt;
rep(i, n) {
if (s[i] == '#')
b_cnt++;
else
w_cnt--;
ans = min(ans, b_cnt + w_cnt);
}
cout << ans << endl;
}
| [
"variable_declaration.value.change",
"identifier.change"
] | 880,165 | 880,166 | u130834452 | cpp |
p03069 | #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 *argv[]) {
// cin.tie(0);
// ios::sync_with_stdio(false);
int N;
cin >> N;
string S;
cin >> S;
int b = 0, w = 0;
rep(i, N) if (S[i] == '.') w++;
int ans = N;
rep(i, N) {
if (S[i] == '.')
w--;
else
b++;
ans = min(ans, b + w);
}
cout << ans << 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 *argv[]) {
// cin.tie(0);
// ios::sync_with_stdio(false);
int N;
cin >> N;
string S;
cin >> S;
int b = 0, w = 0;
rep(i, N) if (S[i] == '.') w++;
int ans = w;
rep(i, N) {
if (S[i] == '.')
w--;
else
b++;
ans = min(ans, b + w);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.change"
] | 880,167 | 880,168 | u569778242 | cpp |
p03069 | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long N;
cin >> N;
string S;
cin >> S;
long long ans = N + 1;
long long *white = new long long[N];
long long *black = new long long[N];
white[0] = 0;
black[0] = 0;
if (S[0] == '.') {
white[0] = 1;
black[0] = 0;
} else {
black[0] = 1;
white[0] = 0;
}
for (int i = 1; i < N; i++) {
white[i] = white[i - 1];
black[i] = black[i - 1];
if (S[i] == '.') {
white[i]++;
} else {
black[i]++;
}
// cout << "white[" << i << "] = " << white[i] << ", " << flush;
// cout << "black[" << i << "] = " << black[i] << endl;
}
long long change = 0;
for (int i = 0; i < N; i++) {
change = white[N - 1] - white[i] + black[i] - black[0];
if (S[0] == '#' && white[N - 1] != 0) {
change++;
}
// cout << "change = " << change << endl;
if (ans > change) {
ans = change;
}
}
cout << ans << endl;
delete[] white;
delete[] black;
} | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long N;
cin >> N;
string S;
cin >> S;
long long ans = N + 1;
long long *white = new long long[N];
long long *black = new long long[N];
white[0] = 0;
black[0] = 0;
if (S[0] == '.') {
white[0] = 1;
black[0] = 0;
} else {
black[0] = 1;
white[0] = 0;
}
for (int i = 1; i < N; i++) {
white[i] = white[i - 1];
black[i] = black[i - 1];
if (S[i] == '.') {
white[i]++;
} else {
black[i]++;
}
// cout << "white[" << i << "] = " << white[i] << ", " << flush;
// cout << "black[" << i << "] = " << black[i] << endl;
}
long long change = 0;
for (int i = 0; i < N; i++) {
change = white[N - 1] - white[i] + black[i] - black[0];
if (S[0] == '#' && white[N - 1] != 0 && i != 0) {
change++;
}
// cout << "change = " << change << endl;
if (ans > change) {
ans = change;
}
}
cout << ans << endl;
delete[] white;
delete[] black;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 880,227 | 880,228 | u375879613 | cpp |
p03069 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[]) {
int n;
string s;
cin >> n >> s;
vector<int> b(n + 1);
vector<int> w(n + 1);
b[0] = 0;
w[0] = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '.') {
w[i + 1] = w[i] + 1;
b[i + 1] = b[i];
} else {
b[i + 1] = b[i] + 1;
w[i + 1] = w[i];
}
}
ll tmp = 0;
ll ans = INF;
REP(i, n) {
tmp = b[i] + w[n] - w[i];
ans = min(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[]) {
int n;
string s;
cin >> n >> s;
vector<int> b(n + 1);
vector<int> w(n + 1);
b[0] = 0;
w[0] = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '.') {
w[i + 1] = w[i] + 1;
b[i + 1] = b[i];
} else {
b[i + 1] = b[i] + 1;
w[i + 1] = w[i];
}
}
ll tmp = 0;
ll ans = INF;
REP(i, n + 1) {
tmp = b[i] + w[n] - w[i];
ans = min(ans, tmp);
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 880,237 | 880,238 | u102602414 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> whitinng(n + 1);
vector<int> blacking(n + 1);
whitinng[0] = 0;
for (int i = 1; i < s.size() + 1; i++) {
whitinng[i] = whitinng[i - 1];
if (s[i] == '#')
whitinng[i]++;
}
blacking[n] = 0;
for (int i = n - 1; i < s.size(); i--) {
blacking[i] = blacking[i + 1];
if (s[i] == '.')
blacking[i]++;
}
if (whitinng[n] == 0 || blacking[0] == 0) {
cout << 0 << endl;
return 0;
}
int ans = s.size();
for (int i = 0; i < whitinng.size(); i++) {
ans = min(ans, whitinng[i] + blacking[i]);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> whitinng(n + 1);
vector<int> blacking(n + 1);
whitinng[0] = 0;
for (int i = 1; i < s.size() + 1; i++) {
whitinng[i] = whitinng[i - 1];
if (s[i - 1] == '#')
whitinng[i]++;
}
blacking[n] = 0;
for (int i = n - 1; i < s.size(); i--) {
blacking[i] = blacking[i + 1];
if (s[i] == '.')
blacking[i]++;
}
if (whitinng[n] == 0 || blacking[0] == 0) {
cout << 0 << endl;
return 0;
}
int ans = s.size();
for (int i = 0; i < whitinng.size(); i++) {
ans = min(ans, whitinng[i] + blacking[i]);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 880,245 | 880,246 | u735008991 | cpp |
p03069 | #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() {
long long N, ans;
string S;
cin >> N >> S;
long long ans1 = 0, ans2 = 0, ans3, t;
for (long long i = 0; i < N; i++) {
if (S[i] == '#')
ans1++;
}
for (long long i = 0; i < N; i++) {
if (S[i] == '.')
ans2++;
}
t = ans3 = ans1;
for (long long i = 0; i < N; i++) {
if (S[i] == '.') {
t--;
} else {
t++;
}
ans3 = min(t, ans3);
}
cout << min(min(ans1, ans2), ans3) << 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() {
long long N, ans;
string S;
cin >> N >> S;
long long ans1 = 0, ans2 = 0, ans3, t;
for (long long i = 0; i < N; i++) {
if (S[i] == '#')
ans1++;
}
for (long long i = 0; i < N; i++) {
if (S[i] == '.')
ans2++;
}
t = ans3 = ans2;
for (long long i = 0; i < N; i++) {
if (S[i] == '.') {
t--;
} else {
t++;
}
ans3 = min(t, ans3);
}
cout << min(min(ans1, ans2), ans3) << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 880,257 | 880,258 | u574045761 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define eFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
#define rSORT(c) sort((c).rbegin(), (c).rend())
#define LB(x, a) lower_bound((x).begin(), (x).end(), (a))
#define UB(x, a) upper_bound((x).begin(), (x).end(), (a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
// vector<vector<int> > dp;
// vector<vector<vector<int> > > vvvi;
// dp=vector<vector<int> >(N, vector<int>(M,0));
// vector<pair<int,int> > v;
// v.push_back(make_pair(x,y));
// priority_queue<int,vector<int>, greater<int> > q2;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string S;
cin >> N >> S;
VI A(N, 0), B(N, 0);
int suma = 0, sumb = 0;
REP(i, N) {
if (i == 0) {
if (S[i] == '#') {
A[i] = 1;
suma++;
}
} else if (S[i] == '#') {
A[i] = A[i - 1] + 1;
suma++;
} else {
A[i] = A[i - 1];
}
// cout << A[i] <<" "<<S[i]<<" "<<i<< endl;
}
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
if (S[i] == '.') {
B[i] = 1;
sumb++;
}
} else if (S[i] == '.') {
B[i] = B[i + 1] + 1;
sumb++;
} else {
B[i] = B[i + 1];
}
}
int ans = LLINF;
REP(i, N) {
// cout << A[i] << " " << B[i] << endl;
ans = min(ans, A[i] + B[i]);
}
ans = min(ans, suma);
ans = min(ans, sumb);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define eFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
#define rSORT(c) sort((c).rbegin(), (c).rend())
#define LB(x, a) lower_bound((x).begin(), (x).end(), (a))
#define UB(x, a) upper_bound((x).begin(), (x).end(), (a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
// vector<vector<int> > dp;
// vector<vector<vector<int> > > vvvi;
// dp=vector<vector<int> >(N, vector<int>(M,0));
// vector<pair<int,int> > v;
// v.push_back(make_pair(x,y));
// priority_queue<int,vector<int>, greater<int> > q2;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string S;
cin >> N >> S;
VI A(N, 0), B(N, 0);
int suma = 0, sumb = 0;
REP(i, N) {
if (i == 0) {
if (S[i] == '#') {
A[i] = 1;
suma++;
}
} else if (S[i] == '#') {
A[i] = A[i - 1] + 1;
suma++;
} else {
A[i] = A[i - 1];
}
// cout << A[i] <<" "<<S[i]<<" "<<i<< endl;
}
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
if (S[i] == '.') {
B[i] = 1;
sumb++;
}
} else if (S[i] == '.') {
B[i] = B[i + 1] + 1;
sumb++;
} else {
B[i] = B[i + 1];
}
}
int ans = LLINF;
REP(i, N) {
// cout << A[i] << " " << B[i] << endl;
ans = min(ans, A[i] + B[i] - 1);
}
ans = min(ans, suma);
ans = min(ans, sumb);
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 880,263 | 880,264 | u266643907 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (int i = 1; i <= N; i++)
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
// #define int long long
signed main() {
int n;
string S;
cin >> n >> S;
int bl[n + 1], wl[n + 1];
int b = 0, w = 0;
int ans = INF;
LOOP(i, n) {
if (S[i] == '.')
w++;
else
b++;
wl[i] = w;
bl[i] = b;
}
wl[n] = w, bl[n] = b;
LOOP(i, n + 1) {
int an = bl[i] + (w - wl[i]);
ans = min(ans, an);
// cerr <<i << " "<< bl[i] << " " << wl[i] << endl;
}
cout << ans << endl;
}
/* |
##>#>>####>#>>>>>##|#>#>#
12 3 4567 8 90|1 2 3
1 23 4 56789 | 0 1
1212101234343210-0121212
i = # + >
*/
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (int i = 1; i <= N; i++)
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
// #define int long long
signed main() {
int n;
string S;
cin >> n >> S;
int bl[n + 1], wl[n + 1];
int b = 0, w = 0;
int ans = INF;
LOOP(i, n) {
if (S[i] == '.')
w++;
else
b++;
wl[i] = w;
bl[i] = b;
}
wl[n] = w, bl[n] = b;
ans = w;
LOOP(i, n) {
int an = bl[i] + (w - wl[i]);
ans = min(ans, an);
// cerr <<i << " "<< bl[i] << " " << wl[i] << " " << an << endl;
}
cout << ans << endl;
}
/* |
##>#>>####>#|>>>|>>##|#>#>#
12 3 4567 8|8 | 90|1 2 3
1 23 4 |567|89 | 0 1
1212101234343210-0121212
i = # + >
*/
| [
"assignment.add",
"expression.operation.binary.remove"
] | 880,269 | 880,270 | u118951811 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (int i = 1; i <= N; i++)
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
// #define int long long
signed main() {
int n;
string S;
cin >> n >> S;
int bl[n + 1], wl[n + 1];
int b = 0, w = 0;
int ans = INF;
LOOP(i, n) {
if (S[i] == '.')
w++;
else
b++;
wl[i] = w;
bl[i] = b;
}
wl[n] = w, bl[n] = b;
LOOP(i, n) {
int an = bl[i] + (w - wl[i]);
ans = min(ans, an);
// cerr <<i << " "<< bl[i] << " " << wl[i] << endl;
}
cout << ans << endl;
}
/* |
##>#>>####>#>>>>>##|#>#>#
12 3 4567 8 90|1 2 3
1 23 4 56789 | 0 1
1212101234343210-0121212
i = # + >
*/
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (int i = 1; i <= N; i++)
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
// #define int long long
signed main() {
int n;
string S;
cin >> n >> S;
int bl[n + 1], wl[n + 1];
int b = 0, w = 0;
int ans = INF;
LOOP(i, n) {
if (S[i] == '.')
w++;
else
b++;
wl[i] = w;
bl[i] = b;
}
wl[n] = w, bl[n] = b;
ans = w;
LOOP(i, n) {
int an = bl[i] + (w - wl[i]);
ans = min(ans, an);
// cerr <<i << " "<< bl[i] << " " << wl[i] << " " << an << endl;
}
cout << ans << endl;
}
/* |
##>#>>####>#|>>>|>>##|#>#>#
12 3 4567 8|8 | 90|1 2 3
1 23 4 |567|89 | 0 1
1212101234343210-0121212
i = # + >
*/
| [
"assignment.add"
] | 880,271 | 880,270 | u118951811 | cpp |
p03069 | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int n, i, ans = 200010;
int black_left[200010];
int white_right[200010];
char stone[200010];
int main() {
cin >> n;
scanf("%s", stone);
if (stone[0] == '#')
black_left[0] = 1;
else
black_left[0] = 0;
if (stone[n - 1] == '.')
white_right[n - 1] = 1;
else
white_right[n - 1] = 0;
for (i = 1; i <= n - 1; i++) {
if (stone[i] == '#')
black_left[i] = black_left[i - 1] + 1;
else
black_left[i] = black_left[i - 1];
}
for (i = n - 2; i >= 0; i--) {
if (stone[i] == '.')
white_right[i] = white_right[i + 1] + 1;
else
white_right[i] = white_right[i + 1];
}
/*for(i=0;i<=n-1;i++) printf("%d ",black_left[i]);
cout<<endl;
for(i=n-1;i>=0;i--) printf("%d ",white_right[i]);
cout<<endl;*/
ans = min(white_right[0], black_left[0]);
for (i = 0; i <= n - 1; i++)
ans = min(ans, black_left[i] + white_right[i + 1]);
cout << ans;
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int n, i, ans = 200010;
int black_left[200010];
int white_right[200010];
char stone[200010];
int main() {
cin >> n;
scanf("%s", stone);
if (stone[0] == '#')
black_left[0] = 1;
else
black_left[0] = 0;
if (stone[n - 1] == '.')
white_right[n - 1] = 1;
else
white_right[n - 1] = 0;
for (i = 1; i <= n - 1; i++) {
if (stone[i] == '#')
black_left[i] = black_left[i - 1] + 1;
else
black_left[i] = black_left[i - 1];
}
for (i = n - 2; i >= 0; i--) {
if (stone[i] == '.')
white_right[i] = white_right[i + 1] + 1;
else
white_right[i] = white_right[i + 1];
}
// for(i=0;i<=n-1;i++) printf("%d ",black_left[i]);
// cout<<endl;
// for(i=n-1;i>=0;i--) printf("%d ",white_right[i]);
// cout<<endl;
ans = min(white_right[0], black_left[n - 1]);
for (i = 0; i <= n - 1; i++)
ans = min(ans, black_left[i] + white_right[i + 1]);
cout << ans;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change"
] | 880,276 | 880,277 | u575178129 | cpp |
p03069 | #include <bits/stdc++.h>
#define ipair pair<int, int>
#define rep(i, n) for (i = 0; i < n; i++)
#define repj(i, j, n) for (i = j; i < n; i++)
#define PB(a, i) (a).push_back(i)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a, n) (a).resize(n)
#define OK(i) cout << "OK " << i << endl
#define Yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define NO cout << "NO" << endl
using namespace std;
typedef long long int lli;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> Matrix;
int main() {
string s;
int n, i, j, k;
vi a, b;
cin >> n;
cin >> s;
SIZE(a, n + 1);
a[0] = 0;
repj(i, 1, n + 1) {
if (s[i - 1] == '#')
a[i] = a[i - 1] + 1;
else
a[i] = a[i - 1];
}
SIZE(b, n + 1);
b[0] = 0;
repj(i, 1, n + 1) {
if (s[n - i] == '.')
b[i] = b[i - 1] + 1;
else
b[i] = b[i - 1];
}
k = n + 2;
repj(i, 1, n + 1) { k = min(a[i] + b[n - i], k); }
cout << k;
return 0;
}
| #include <bits/stdc++.h>
#define ipair pair<int, int>
#define rep(i, n) for (i = 0; i < n; i++)
#define repj(i, j, n) for (i = j; i < n; i++)
#define PB(a, i) (a).push_back(i)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a, n) (a).resize(n)
#define OK(i) cout << "OK " << i << endl
#define Yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define NO cout << "NO" << endl
using namespace std;
typedef long long int lli;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> Matrix;
int main() {
string s;
int n, i, j, k;
vi a, b;
cin >> n;
cin >> s;
SIZE(a, n + 1);
a[0] = 0;
repj(i, 1, n + 1) {
if (s[i - 1] == '#')
a[i] = a[i - 1] + 1;
else
a[i] = a[i - 1];
}
SIZE(b, n + 1);
b[0] = 0;
repj(i, 1, n + 1) {
if (s[n - i] == '.')
b[i] = b[i - 1] + 1;
else
b[i] = b[i - 1];
}
k = n + 2;
rep(i, n + 1) { k = min(a[i] + b[n - i], k); }
cout << k;
return 0;
}
| [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 880,283 | 880,284 | u274055316 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, white, ans;
cin >> N;
vector<long long> V(N);
char c;
cin >> c;
if (c == '.')
V[0] = 1;
for (long long i = 1; i < N; i++) {
cin >> c;
if (c == '.')
V[i] = V[i - 1] + 1;
else
V[i] = V[i - 1];
}
white = V[N - 1];
ans = min(ans, white);
for (long long i = 0; i < N; i++) {
ans = min(ans, i + 1 - V[i] + white - V[i]);
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, white, ans;
cin >> N;
vector<long long> V(N);
char c;
cin >> c;
if (c == '.')
V[0] = 1;
for (long long i = 1; i < N; i++) {
cin >> c;
if (c == '.')
V[i] = V[i - 1] + 1;
else
V[i] = V[i - 1];
}
white = V[N - 1];
ans = white;
for (long long i = 0; i < N; i++) {
ans = min(ans, i + 1 - V[i] + white - V[i]);
}
cout << ans << "\n";
} | [
"call.remove",
"call.arguments.change"
] | 880,297 | 880,298 | u501643136 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int n, cnt1[220000], cnt2[220000], ans = 1e9;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
cnt1[i] = (s[i] == '.');
cnt2[i] = (s[i] == '#');
} else {
cnt1[i] = cnt1[i - 1] + (s[i] == '.');
cnt2[i] = cnt2[i - 1] + (s[i] == '#');
}
}
for (int i = 0; i < s.size() - 1; i++) {
if (i == 0) {
ans = min(ans, min(cnt1[s.size() - 1], cnt2[s.size() - 1]));
} else {
ans = min(ans, cnt2[i - 1] + cnt1[s.size() - 1] - cnt1[i - 1]);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, cnt1[220000], cnt2[220000], ans = 1e9;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
cnt1[i] = (s[i] == '.');
cnt2[i] = (s[i] == '#');
} else {
cnt1[i] = cnt1[i - 1] + (s[i] == '.');
cnt2[i] = cnt2[i - 1] + (s[i] == '#');
}
}
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
ans = min(ans, min(cnt1[s.size() - 1], cnt2[s.size() - 1]));
} else {
ans = min(ans, cnt2[i - 1] + cnt1[s.size() - 1] - cnt1[i - 1]);
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 880,305 | 880,306 | u386107860 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int n, cnt1[220000], cnt2[220000], ans = 1e9;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
cnt1[i] = (s[i] == '.');
cnt2[i] = (s[i] == '#');
} else {
cnt1[i] = cnt1[i - 1] + (s[i] == '.');
cnt2[i] = cnt2[i - 1] + (s[i] == '#');
}
}
for (int i = 0; i < s.size() - 1; i++) {
if (i == 0) {
ans = min(ans, min(cnt1[s.size() - 1], cnt2[s.size() - 1]));
} else {
ans = min(ans, cnt2[i] + cnt1[s.size() - 1] - cnt1[i - 1]);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, cnt1[220000], cnt2[220000], ans = 1e9;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
cnt1[i] = (s[i] == '.');
cnt2[i] = (s[i] == '#');
} else {
cnt1[i] = cnt1[i - 1] + (s[i] == '.');
cnt2[i] = cnt2[i - 1] + (s[i] == '#');
}
}
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
ans = min(ans, min(cnt1[s.size() - 1], cnt2[s.size() - 1]));
} else {
ans = min(ans, cnt2[i - 1] + cnt1[s.size() - 1] - cnt1[i - 1]);
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 880,307 | 880,306 | u386107860 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int n, cnt1[220000], cnt2[220000], ans = 1e9;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
cnt1[i] = (s[i] == '.');
cnt2[i] = (s[i] == '#');
} else {
cnt1[i] = cnt1[i - 1] + (s[i] == '.');
cnt2[i] = cnt2[i - 1] + (s[i] == '#');
}
}
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
ans = min(ans, min(cnt1[s.size() - 1], cnt2[s.size() - 1]));
} else {
ans = min(ans, cnt2[i] + cnt1[s.size() - 1] - cnt1[i - 1]);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, cnt1[220000], cnt2[220000], ans = 1e9;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
cnt1[i] = (s[i] == '.');
cnt2[i] = (s[i] == '#');
} else {
cnt1[i] = cnt1[i - 1] + (s[i] == '.');
cnt2[i] = cnt2[i - 1] + (s[i] == '#');
}
}
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
ans = min(ans, min(cnt1[s.size() - 1], cnt2[s.size() - 1]));
} else {
ans = min(ans, cnt2[i - 1] + cnt1[s.size() - 1] - cnt1[i - 1]);
}
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 880,308 | 880,306 | u386107860 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const ll MOD = 1e9 + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//-------------------
ll n;
string s;
ll sm[2 * 100000 + 5];
ll sn[2 * 100000 + 5];
int main() {
cin >> n >> s;
if (s[0] == '#')
sm[0] = 1;
FOR(i, 1, n - 1) {
if (s[i] == '#')
sm[i] = sm[i - 1] + 1;
else
sm[i] = sm[i - 1];
}
for (int i = n - 1; i >= 0; --i) {
if (s[i + 1] == '.')
sn[i] = sn[i + 1] + 1;
else
sn[i] = sn[i + 1];
}
FOR(i, 0, n - 1) sm[i] += sn[i];
ll mx = INF;
FOR(i, 0, n - 1) { chmin(mx, sm[i]); }
ll sm0 = sm[0] + (s[0] == '.' ? 1 : 0);
chmin(mx, sm0);
cout << mx;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const ll MOD = 1e9 + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//-------------------
ll n;
string s;
ll sm[2 * 100000 + 5];
ll sn[2 * 100000 + 5];
int main() {
cin >> n >> s;
if (s[0] == '#')
sm[0] = 1;
FOR(i, 1, n - 1) {
if (s[i] == '#')
sm[i] = sm[i - 1] + 1;
else
sm[i] = sm[i - 1];
}
for (int i = n - 1; i >= 0; --i) {
if (s[i + 1] == '.')
sn[i] = sn[i + 1] + 1;
else
sn[i] = sn[i + 1];
}
FOR(i, 0, n - 1) sm[i] += sn[i];
ll mx = INF;
FOR(i, 0, n - 1) { chmin(mx, sm[i]); }
ll sm0 = sn[0] + (s[0] == '.' ? 1 : 0);
chmin(mx, sm0);
cout << mx;
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 880,311 | 880,312 | u297590902 | cpp |
p03069 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long n;
string s;
cin >> n;
cin >> s;
long long ans[n + 1];
for (long long i = 0; i < n + 1; i++)
ans[i] = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '.')
ans[0]++;
}
for (long long i = 0; i < n; i++) {
if (s[i] == '#')
ans[i + 1] = ans[i] + 1;
else
ans[i + 1] = ans[i] - 1;
}
sort(ans, ans + n);
cout << ans[0] << endl;
}
| #include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long n;
string s;
cin >> n;
cin >> s;
long long ans[n + 1];
for (long long i = 0; i < n + 1; i++)
ans[i] = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '.')
ans[0]++;
}
for (long long i = 0; i < n; i++) {
if (s[i] == '#')
ans[i + 1] = ans[i] + 1;
else
ans[i + 1] = ans[i] - 1;
}
sort(ans, ans + n + 1);
cout << ans[0] << endl;
}
| [
"expression.operation.binary.add"
] | 880,317 | 880,318 | u461415203 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
#define inf 1e9
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<mp> a;
int p;
int cnt = 1;
if (s[0] == '#')
p = 0;
else
p = 1;
int res = inf;
int b = 0;
int w = 0;
for (int i = 1; i < n; i++) {
if (s[i] == '.')
w++;
}
res = min(res, w + b);
for (int i = 0; i < n; i++) {
if (s[i] == '.') {
w--;
} else {
b++;
}
res = min(res, w + b);
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
#define inf 1e9
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<mp> a;
int p;
int cnt = 1;
if (s[0] == '#')
p = 0;
else
p = 1;
int res = inf;
int b = 0;
int w = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
w++;
}
res = min(res, w + b);
for (int i = 0; i < n; i++) {
if (s[i] == '.') {
w--;
} else {
b++;
}
res = min(res, w + b);
}
cout << res << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,319 | 880,320 | u410943667 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
#define inf 1e9
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<mp> a;
int p;
int cnt = 1;
if (s[0] == '#')
p = 0;
else
p = 1;
int res = inf;
int b = 0;
int w = 0;
for (int i = 1; i < n; i++) {
if (s[i] == '#')
w++;
}
res = min(res, w + b);
for (int i = 0; i < n; i++) {
if (s[i] == '.') {
w--;
} else {
b++;
}
res = min(res, w + b);
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
#define inf 1e9
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<mp> a;
int p;
int cnt = 1;
if (s[0] == '#')
p = 0;
else
p = 1;
int res = inf;
int b = 0;
int w = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
w++;
}
res = min(res, w + b);
for (int i = 0; i < n; i++) {
if (s[i] == '.') {
w--;
} else {
b++;
}
res = min(res, w + b);
}
cout << res << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 880,321 | 880,320 | u410943667 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end()
#define rall(i) (i).begin(), (i).end(), greater<int>()
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
template <typename T> void print(T x) { std::cout << x << '\n'; }
// typedef long long ll;
#define TENNINE 1000000005
#define TENFIVE 100005
//#define int long long
signed main() {
int N;
string S;
cin >> N;
cin >> S;
int x = 0;
int y = 0;
int z = N;
int kuro[N];
int siro[N];
int ans = N;
rep(i, N) {
if (S[i] == '#') {
x++;
}
kuro[i] = x;
}
for (int i = N - 1; i >= 0; i--) {
if (S[i] == '.') {
y++;
}
siro[i] = y;
}
rep(i, N) { ans = min(ans, kuro[i] + siro[i]); }
if (x == 0 || y == 0) {
cout << "0" << endl;
return 0;
}
int ans2 = min({x, y, ans});
cout << ans2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end()
#define rall(i) (i).begin(), (i).end(), greater<int>()
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
template <typename T> void print(T x) { std::cout << x << '\n'; }
// typedef long long ll;
#define TENNINE 1000000005
#define TENFIVE 100005
//#define int long long
signed main() {
int N;
string S;
cin >> N;
cin >> S;
int x = 0;
int y = 0;
int z = N;
int kuro[N];
int siro[N];
int ans = N;
rep(i, N) {
if (S[i] == '#') {
x++;
}
kuro[i] = x;
}
for (int i = N - 1; i >= 0; i--) {
if (S[i] == '.') {
y++;
}
siro[i] = y;
}
rep(i, N - 1) { ans = min(ans, kuro[i] + siro[i + 1]); }
if (x == 0 || y == 0) {
cout << "0" << endl;
return 0;
}
int ans2 = min({x, y, ans});
cout << ans2 << endl;
return 0;
}
| [
"assignment.change"
] | 880,338 | 880,339 | u888717396 | cpp |
p03069 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, n1, n2) for (int i = n1; i < n2; i++)
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef pair<int, int> Pi;
typedef long long int ll;
const int INF = (1 << 30) - 1;
const ll INFl = 9223372036854775807;
const int MAX = 10000;
const ll MOD = 1000000007;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int n;
char s[200100];
int main() {
cin >> n;
int b = 0;
int w = 0;
REP(i, n) {
cin >> s[i];
if (s[i] == '.')
w++;
else
b++;
}
int sb[n];
int sw[n];
if (s[0] == '.') {
sb[0] = 0;
sw[0] = w;
} else {
sb[0] = 0;
sw[0] = w;
}
for (int i = 1; i < n; i++) {
if (s[i - 1] == '#') {
sb[i] = sb[i - 1] + 1;
} else {
sb[i] = sb[i - 1];
}
if (s[i] == '.') {
sw[i] = sw[i - 1] - 1;
} else {
sw[i] = sw[i - 1];
}
}
int ans = min(b, w);
REP(i, n)
ans = min(ans, sw[i] + sb[i]);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, n1, n2) for (int i = n1; i < n2; i++)
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef pair<int, int> Pi;
typedef long long int ll;
const int INF = (1 << 30) - 1;
const ll INFl = 9223372036854775807;
const int MAX = 10000;
const ll MOD = 1000000007;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int n;
char s[200100];
int main() {
cin >> n;
int b = 0;
int w = 0;
REP(i, n) {
cin >> s[i];
if (s[i] == '.')
w++;
else
b++;
}
int sb[n];
int sw[n];
if (s[0] == '.') {
sb[0] = 0;
sw[0] = w;
} else {
sb[0] = 0;
sw[0] = w;
}
for (int i = 1; i < n; i++) {
if (s[i - 1] == '#') {
sb[i] = sb[i - 1] + 1;
} else {
sb[i] = sb[i - 1];
}
if (s[i - 1] == '.') {
sw[i] = sw[i - 1] - 1;
} else {
sw[i] = sw[i - 1];
}
}
int ans = min(b, w);
REP(i, n)
ans = min(ans, sw[i] + sb[i]);
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 880,350 | 880,351 | u055303078 | cpp |
p03069 | #include <array>
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (x).begin(), (x).end()
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
using ll = long long;
using VI = vector<int>;
int main() {
int n;
string s;
CI n >> s;
int white = 0, ans = 1000000;
string tmp = s;
REP(i, n) {
if (s[i] == '.')
white++;
}
ans = min(ans, white);
REP(i, n) {
if (s[i] == '#')
white++;
if (s[i] == '.')
white--;
ans = min(ans, white);
}
CO white EN;
return 0;
}
| #include <array>
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (x).begin(), (x).end()
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
using ll = long long;
using VI = vector<int>;
int main() {
int n;
string s;
CI n >> s;
int white = 0, ans = 1000000;
string tmp = s;
REP(i, n) {
if (s[i] == '.')
white++;
}
ans = min(ans, white);
REP(i, n) {
if (s[i] == '#')
white++;
if (s[i] == '.')
white--;
ans = min(ans, white);
}
CO ans EN;
return 0;
}
| [
"identifier.change"
] | 880,354 | 880,355 | u165567408 | cpp |
p03069 | #include <array>
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (x).begin(), (x).end()
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
using ll = long long;
using VI = vector<int>;
int main() {
int n;
string s;
CI n >> s;
int white = 0, black = 0, ans = 1000000;
string tmp = s;
int ans2 = 0, ans3 = 0;
REP(i, n) {
if (s[i] == '.')
white++;
}
REP(i, n) {
if (s[i] == '#')
black++;
if (s[i] == '.')
white--;
ans = min(ans, black + white);
}
for (int i = n - 1; i > 0; i--) {
if (s[i] == '.' and s[i - 1] == '#') {
ans3++;
s[i - 1] = '.';
}
}
s = tmp;
REP(i, n) {
if (s[i] == '#' and s[i + 1] == '.') {
ans2++;
s[i + 1] = '#';
}
}
CO min(ans, min(ans2, ans3)) EN;
CO ans EN;
return 0;
}
| #include <array>
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (x).begin(), (x).end()
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
using ll = long long;
using VI = vector<int>;
int main() {
int n;
string s;
CI n >> s;
int white = 0, black = 0, ans = 1000000;
string tmp = s;
int ans2 = 0, ans3 = 0;
REP(i, n) {
if (s[i] == '.')
white++;
}
REP(i, n) {
if (s[i] == '#')
black++;
if (s[i] == '.')
white--;
ans = min(ans, black + white);
}
for (int i = n - 1; i > 0; i--) {
if (s[i] == '.' and s[i - 1] == '#') {
ans3++;
s[i - 1] = '.';
}
}
s = tmp;
REP(i, n) {
if (s[i] == '#' and s[i + 1] == '.') {
ans2++;
s[i + 1] = '#';
}
}
CO min(ans, min(ans2, ans3)) EN;
return 0;
}
| [
"variable_declaration.remove"
] | 880,356 | 880,357 | u165567408 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll amari = 1e9 + 7;
#define ben(a) a.begin(), a.end()
#define pb(a, b) a.push_back(b)
int main() {
int n;
string s;
cin >> n >> s;
int w[n];
int b[n];
b[0] = 0;
for (int i = 1; i < n; i++) {
if (s[i] == '#')
b[i] = b[i - 1] + 1;
else
b[i] = b[i - 1];
}
w[n - 1] = 0;
for (int i = n - 2; i >= 0; i--) {
if (s[i] == '.')
w[i] = w[i + 1] + 1;
else
w[i] = w[i - 1];
}
int mini = 99999999;
for (int i = 0; i < n; i++) {
mini = min(mini, b[i] + w[i]);
}
cout << mini << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll amari = 1e9 + 7;
#define ben(a) a.begin(), a.end()
#define pb(a, b) a.push_back(b)
int main() {
int n;
string s;
cin >> n >> s;
int w[n];
int b[n];
b[0] = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == '#')
b[i] = b[i - 1] + 1;
else
b[i] = b[i - 1];
// cout << b[i] << endl;
}
// cout << endl;
w[n - 1] = 0;
for (int i = n - 2; i >= 0; i--) {
if (s[i + 1] == '.')
w[i] = w[i + 1] + 1;
else
w[i] = w[i + 1];
// cout << w[i] << endl;
}
// cout << endl;
int mini = 99999999;
for (int i = 0; i < n; i++) {
mini = min(mini, b[i] + w[i]);
}
cout << mini << endl;
return 0;
}
// g++ AtCoder.cpp | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 880,358 | 880,359 | u452544900 | cpp |
p03069 | #include <cstring>
#include <iostream>
using namespace std;
int cntw[500000], cntb[500000];
int main() {
int n;
cin >> n;
char s[500000];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
memset(cntw, 0, sizeof(cntw));
memset(cntb, 0, sizeof(cntb));
for (int i = 0; i < n; i++) {
if (s[i] == '.') {
cntw[i + 1] = cntw[i] + 1;
cntb[i + 1] = cntb[i];
} else {
cntb[i + 1] = cntb[i] + 1;
cntw[i + 1] = cntw[i];
}
}
int minn = 1000000;
for (int i = 1; i <= n; i++) {
if (cntb[i] + cntw[n] - cntw[i] <= minn) {
minn = cntb[i] + cntw[n] - cntw[i];
}
}
/* for(int i=0;i<n;i++){
cout<<cntw[i]<<" ";
}
cout<<endl;
for(int i=0;i<n;i++){
cout<<cntb[i]<<" ";
}
*/ cout << minn;
return 0;
} | #include <cstring>
#include <iostream>
using namespace std;
int cntw[500000], cntb[500000];
int main() {
int n;
cin >> n;
char s[500000];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
memset(cntw, 0, sizeof(cntw));
memset(cntb, 0, sizeof(cntb));
for (int i = 0; i < n; i++) {
if (s[i] == '.') {
cntw[i + 1] = cntw[i] + 1;
cntb[i + 1] = cntb[i];
} else {
cntb[i + 1] = cntb[i] + 1;
cntw[i + 1] = cntw[i];
}
}
int minn = 1000000;
for (int i = 0; i <= n; i++) {
if (cntb[i] + cntw[n] - cntw[i] <= minn) {
minn = cntb[i] + cntw[n] - cntw[i];
}
}
/* for(int i=0;i<n;i++){
cout<<cntw[i]<<" ";
}
cout<<endl;
for(int i=0;i<n;i++){
cout<<cntb[i]<<" ";
}
*/ cout << minn;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,377 | 880,378 | u261868146 | cpp |
p03069 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int b = 0, w = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
w++;
}
int ans = 1e9;
for (int i = 0; i < n; i++) {
if (s[i] == '#')
b++;
if (s[i] == '.')
w--;
ans = min(ans, w + b);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int b = 0, w = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
w++;
}
int ans = w;
for (int i = 0; i < n; i++) {
if (s[i] == '#')
b++;
if (s[i] == '.')
w--;
ans = min(ans, w + b);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 880,383 | 880,384 | u127194462 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define P pair<int, int>
#define MOD 1000000007
#define INF 2147483647
#define NINF (-2147483647 - 1)
#define LLINF 9223372036854775807
using ll = long long;
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> white(N + 1, 0), black(N + 1, 0);
int w = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '.') {
w++;
}
}
bool bla = false;
for (int i = 0; i < N; i++) {
white[i + 1] = white[i];
black[i + 1] = black[i];
if (S[i] == '#') {
black[i + 1]++;
} else {
bla = true;
white[i + 1]++;
}
}
int ans = INF;
for (int i = 0; i < N; i++) {
ans = min(ans, black[i + 1] + w - white[i + 1]);
}
if (bla) {
cout << ans << endl;
} else {
cout << 0 << endl;
}
getchar();
getchar();
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define P pair<int, int>
#define MOD 1000000007
#define INF 2147483647
#define NINF (-2147483647 - 1)
#define LLINF 9223372036854775807
using ll = long long;
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> white(N + 1, 0), black(N + 1, 0);
int w = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '.') {
w++;
}
}
bool bla = false;
for (int i = 0; i < N; i++) {
white[i + 1] = white[i];
black[i + 1] = black[i];
if (S[i] == '#') {
black[i + 1]++;
} else {
bla = true;
white[i + 1]++;
}
}
int ans = INF;
for (int i = 0; i < N; i++) {
ans = min(ans, black[i] + w - white[i + 1]);
}
if (bla) {
cout << ans << endl;
} else {
cout << 0 << endl;
}
getchar();
getchar();
return 0;
} | [
"expression.operation.binary.remove"
] | 880,394 | 880,395 | u165374901 | cpp |
p03069 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 1000000007
#define BOUND 27182818284
typedef long long ll;
typedef long long int lli;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
template <class T> bool umax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool umin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// gcd
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
// gcd array
int findGCD(int arr[], int n) {
int result = arr[0];
for (int i = 1; i < n; i++)
result = gcd(arr[i], result);
return result;
}
template <typename T> T lcm(T m, T n) {
// 引数に0がある場合は0を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
int dx[5] = {1, 0, -1, 0};
int dy[5] = {0, 1, 0, -1};
// v.front() = -BOUND;
// v.back() = BOUND;
struct edge {
int cost, to;
edge(int in_cost, int in_to) {
cost = in_cost;
to = in_to;
}
bool operator<(const edge &a) const { return cost > a.cost; }
};
int b_to_w[200010];
int w_to_b[200010];
int main() {
int N;
Fill(b_to_w, 0);
Fill(w_to_b, 0);
string S;
cin >> N;
cin >> S;
rep(i, N) {
if (S[i] == '#') {
b_to_w[i + 1] = b_to_w[i] + 1;
} else {
b_to_w[i + 1] = b_to_w[i];
}
}
for (int i = N; i >= 1; i--) {
if (S[i] == '.') {
w_to_b[i] = w_to_b[i + 1] + 1;
} else {
w_to_b[i] = w_to_b[i + 1];
}
}
int minimum = INFint;
for (int i = 1; i <= N; i++) {
minimum = min(minimum, b_to_w[i] + w_to_b[i]);
}
cout << minimum << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 1000000007
#define BOUND 27182818284
typedef long long ll;
typedef long long int lli;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
template <class T> bool umax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool umin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// gcd
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
// gcd array
int findGCD(int arr[], int n) {
int result = arr[0];
for (int i = 1; i < n; i++)
result = gcd(arr[i], result);
return result;
}
template <typename T> T lcm(T m, T n) {
// 引数に0がある場合は0を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
int dx[5] = {1, 0, -1, 0};
int dy[5] = {0, 1, 0, -1};
// v.front() = -BOUND;
// v.back() = BOUND;
struct edge {
int cost, to;
edge(int in_cost, int in_to) {
cost = in_cost;
to = in_to;
}
bool operator<(const edge &a) const { return cost > a.cost; }
};
int b_to_w[200010];
int w_to_b[200010];
int main() {
int N;
Fill(b_to_w, 0);
Fill(w_to_b, 0);
string S;
cin >> N;
cin >> S;
rep(i, N) {
if (S[i] == '#') {
b_to_w[i + 1] = b_to_w[i] + 1;
} else {
b_to_w[i + 1] = b_to_w[i];
}
}
for (int i = N - 1; i >= 0; i--) {
if (S[i] == '.') {
w_to_b[i] = w_to_b[i + 1] + 1;
} else {
w_to_b[i] = w_to_b[i + 1];
}
}
int minimum = INFint;
for (int i = 0; i <= N; i++) {
minimum = min(minimum, b_to_w[i] + w_to_b[i]);
}
cout << minimum << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 880,408 | 880,409 | u991664217 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
#define pb push_back
#define mod 1000000007
#define inf 1000000000
#define llinf 1000000000000000
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
typedef vector<pint> vpint;
int ans, n;
void func(ll x, int counter) {
if (x > n)
return;
if (counter == 7)
ans++;
func(x * 10 + 3, counter | 4);
func(x * 10 + 5, counter | 2);
func(x * 10 + 7, counter | 1);
}
vint allcount(1000000);
int main() {
int n;
string s;
cin >> n >> s;
int num = 0;
rep(i, n) {
if (s[i] == '.') {
num++;
}
allcount[i] = num;
}
int minnum = inf;
rep(i, n) {
int num = i + 1 - allcount[i] + (allcount[n - 1] - allcount[i]);
chmin(minnum, num);
}
cout << minnum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
#define pb push_back
#define mod 1000000007
#define inf 1000000000
#define llinf 1000000000000000
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
typedef vector<pint> vpint;
int ans, n;
void func(ll x, int counter) {
if (x > n)
return;
if (counter == 7)
ans++;
func(x * 10 + 3, counter | 4);
func(x * 10 + 5, counter | 2);
func(x * 10 + 7, counter | 1);
}
vint allcount(1000000);
int main() {
int n;
string s;
cin >> n >> s;
int num = 0;
rep(i, n) {
if (s[i] == '.') {
num++;
}
allcount[i] = num;
}
int minnum = allcount[n - 1];
rep(i, n) {
int num = i + 1 - allcount[i] + (allcount[n - 1] - allcount[i]);
chmin(minnum, num);
}
cout << minnum << endl;
} | [] | 880,435 | 880,436 | u943094398 | cpp |
p03069 |
#include <algorithm>
#include <iostream>
#include <vector>
int main(void) {
int N;
std::cin >> N;
std::string S;
std::cin >> S;
std::vector<int> siro(N + 2);
siro[0] = 0;
if (S[0] == '#')
siro[1] = 1;
else
siro[1] = 0;
for (int i = 1; i < N + 1; i++) {
if (i == N)
siro[N + 1] = siro[N];
if (S[i] == '#')
siro[i + 1] = siro[i] + 1;
else
siro[i + 1] = siro[i];
}
std::vector<int> kuro(N + 2);
kuro[N + 1] = 0;
if (S[N - 1] == '.')
kuro[N] = 1;
else
kuro[N] = 0;
for (int i = N - 2; i >= 0; i--) {
if (S[i] == '.')
kuro[i + 1] = kuro[i + 2] + 1;
else
kuro[i + 1] = kuro[i + 2];
}
kuro[0] = kuro[1];
int min_ = 999999999;
for (int i = 0; i < N + 2; i++) {
min_ = std::min(min_, siro[i] + kuro[i]);
}
std::cout << min_ << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
int main(void) {
int N;
std::cin >> N;
std::string S;
std::cin >> S;
std::vector<int> siro(N + 2);
siro[0] = 0;
if (S[0] == '#')
siro[1] = 1;
else
siro[1] = 0;
for (int i = 1; i < N + 1; i++) {
if (i == N)
siro[N + 1] = siro[N];
if (S[i] == '#')
siro[i + 1] = siro[i] + 1;
else
siro[i + 1] = siro[i];
}
std::vector<int> kuro(N + 2);
kuro[N + 1] = 0;
if (S[N - 1] == '.')
kuro[N] = 1;
else
kuro[N] = 0;
for (int i = N - 2; i >= 0; i--) {
if (S[i] == '.')
kuro[i + 1] = kuro[i + 2] + 1;
else
kuro[i + 1] = kuro[i + 2];
}
kuro[0] = kuro[1];
int min_ = 999999999;
for (int i = 0; i < N + 1; i++) {
min_ = std::min(min_, siro[i] + kuro[i + 1]);
}
std::cout << min_ << std::endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 880,442 | 880,443 | u967843578 | cpp |
p03069 | #include <climits>
#include <iostream>
#include <string>
using namespace std;
int N;
string S;
int preW[200005];
int preB[200005];
int ans = INT_MAX;
int main() {
cin >> N >> S;
for (int i = 1; i <= N; i++) {
preW[i] = preW[i - 1] + (S[i - 1] == '.' ? 1 : 0);
preB[i] = preB[i - 1] + (S[i - 1] == '#' ? 1 : 0);
}
for (int i = 1; i <= N; i++)
ans = min(ans, preB[i] + preW[N] - preW[i]);
cout << ans;
return 0;
} | #include <climits>
#include <iostream>
#include <string>
using namespace std;
int N;
string S;
int preW[200005];
int preB[200005];
int ans = INT_MAX;
int main() {
cin >> N >> S;
for (int i = 1; i <= N; i++) {
preW[i] = preW[i - 1] + (S[i - 1] == '.' ? 1 : 0);
preB[i] = preB[i - 1] + (S[i - 1] == '#' ? 1 : 0);
}
for (int i = 0; i <= N; i++)
ans = min(ans, preB[i] + preW[N] - preW[i]);
cout << ans;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,448 | 880,449 | u548317837 | cpp |
p03069 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
long long int mod = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 1e9;
vector<int> w(n + 1, 0);
vector<int> b(n + 1, 0);
for (int i = 1; i <= n; i++) {
w[i] = w[i - 1];
b[i] = b[i - 1];
if (s[i - 1] == '.')
w[i]++;
if (s[i - 1] == '#')
b[i]++;
}
for (int i = 1; i < n; i++) {
int cw = b[i];
int cb = w[n] - w[i + 1];
cerr << cw << " " << cb << endl;
cnt = min(cnt, cw + cb);
}
cout << cnt << endl;
return 0;
}
// EOF
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
long long int mod = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 1e9;
vector<int> w(n + 1, 0);
vector<int> b(n + 1, 0);
for (int i = 1; i <= n; i++) {
w[i] = w[i - 1];
b[i] = b[i - 1];
if (s[i - 1] == '.')
w[i]++;
if (s[i - 1] == '#')
b[i]++;
}
for (int i = 0; i < n; i++) {
int cw = b[i];
int cb = w[n] - w[i + 1];
cerr << cw << " " << cb << endl;
cnt = min(cnt, cw + cb);
}
cout << cnt << endl;
return 0;
}
// EOF
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,450 | 880,451 | u543657872 | cpp |
p03070 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<long long>;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast")
#define G(size_1) vector<vector<int>>(size_1, vector<int>())
#define SZ(x) ((int)(x).size())
#define READ \
({ \
ll t; \
cin >> t; \
t; \
})
#define FOR(i, _begin, _end) \
for (__typeof(_end) end = _end, begin = _begin, \
i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i, end) for (__typeof(end) i = 0, _len = (end); i < (_len); i += 1)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define MOD(x, m) ((((x) % (m)) + (m)) % (m))
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EB emplace_back
#define PB push_back
#define fcout cout << fixed << setprecision(12)
#define fcerr cerr << fixed << setprecision(12)
#define print(x) cout << (x) << '\n'
#define printE(x) cout << (x) << endl
#define fprint(x) cout << fixed << setprecision(12) << (x) << endl
#define BYE(a) \
do { \
cout << (a) << endl; \
return; \
} while (false)
#ifdef DEBUG
#define DBG(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
_err(cerr, _it, args); \
}
#define ERR(x) std::cerr << #x << " = " << x << endl;
#else
#define DBG(args...) {};
#define ERR(x) {};
#endif
void _err(std::ostream &cerr, istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void _err(std::ostream &cerr, istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " ";
_err(cerr, ++it, args...);
}
const double pi = 2 * acos(.0);
const int inf = 0x3f3f3f3f;
const ll mod = (ll)(1e9) + 7;
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;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &V) {
is >> V.F >> V.S;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &V) {
for (auto &&ele : V)
is >> ele;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> V) {
os << "[";
int cnt = 0;
T curr;
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
if (V[i] == curr)
cnt++;
else
cnt = 0;
if (cnt == 4)
os << "... ";
if (cnt < 4)
os << i << ":" << V[i] << " ";
curr = V[i];
}
os << V.size() - 1 << ":" << V.back();
}
os << "]\n";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> P) {
os << "(";
os << P.first << "," << P.second;
os << ")";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const set<T, U> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template <typename K, typename H, typename P>
ostream &operator<<(ostream &os, const unordered_set<K, H, P> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template <typename K, typename C>
ostream &operator<<(ostream &os, const multiset<K, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const unordered_map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> V) {
os << "[";
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
os << V[i] << "->";
}
if (!V.empty())
os << V.back();
}
os << "]\n";
return os;
};
template <typename T, typename Cont, typename Comp>
ostream &operator<<(ostream &os, const priority_queue<T, Cont, Comp> V) {
priority_queue<T, Cont, Comp> _V = V;
os << "[";
if (!_V.empty()) {
while (_V.size() > 1) {
os << _V.top() << "->";
_V.pop();
}
os << _V.top();
}
os << "]\n";
return os;
};
template <class F> struct y_combinator {
F f; // the lambda will be stored here
// a forwarding operator():
template <class... Args> decltype(auto) operator()(Args &&...args) const {
// we pass ourselves to f, then the arguments.
// the lambda should take the first argument as `auto&& recurse` or similar.
return f(*this, std::forward<Args>(args)...);
}
};
// helper function that deduces the type of the lambda:
template <class F> y_combinator<std::decay_t<F>> recursive(F &&f) {
return {std::forward<F>(f)};
}
struct hash_pair {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
template <typename T, typename U> std::vector<T> multi_vector(int n, U v) {
return std::vector<T>(n, v);
}
template <typename U, typename... Args> auto multi_vector(int n, Args... args) {
auto val = multi_vector<U>(std::forward<Args>(args)...);
return std::vector<decltype(val)>(n, std::move(val));
}
template <signed M, unsigned T> struct mod_int {
constexpr static signed MODULO = M;
constexpr static unsigned TABLE_SIZE = T;
signed x;
mod_int() : x(0) {}
mod_int(long long y)
: x(static_cast<signed>(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO)) {}
mod_int(int y) : x(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO) {}
explicit operator int() const { return x; }
explicit operator long long() const { return x; }
explicit operator double() const { return x; }
mod_int &operator+=(const mod_int &rhs) {
if ((x += rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((x += MODULO - rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
x = static_cast<signed>(1LL * x * rhs.x % MODULO);
return *this;
}
mod_int &operator/=(const mod_int &rhs) {
x = static_cast<signed>((1LL * x * rhs.inv().x) % MODULO);
return *this;
}
mod_int operator-() const { return mod_int(-x); }
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
bool operator<(const mod_int &rhs) const { return x < rhs.x; }
mod_int inv() const {
assert(x != 0);
if (x <= static_cast<signed>(TABLE_SIZE)) {
if (_inv[1].x == 0)
prepare();
return _inv[x];
} else {
signed a = x, b = MODULO, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mod_int(u);
}
}
mod_int pow(long long t) const {
assert(!(x == 0 && t == 0));
mod_int e = *this, res = mod_int(1);
for (; t; e *= e, t >>= 1)
if (t & 1)
res *= e;
return res;
}
mod_int fact() {
if (_fact[0].x == 0)
prepare();
return _fact[x];
}
mod_int inv_fact() {
if (_fact[0].x == 0)
prepare();
return _inv_fact[x];
}
mod_int choose(mod_int y) {
assert(y.x <= x);
return this->fact() * y.inv_fact() * mod_int(x - y.x).inv_fact();
}
static mod_int _inv[TABLE_SIZE + 1];
static mod_int _fact[TABLE_SIZE + 1];
static mod_int _inv_fact[TABLE_SIZE + 1];
static void prepare() {
_inv[1] = 1;
for (int i = 2; i <= (int)TABLE_SIZE; ++i) {
_inv[i] = 1LL * _inv[MODULO % i].x * (MODULO - MODULO / i) % MODULO;
}
_fact[0] = 1;
for (unsigned i = 1; i <= TABLE_SIZE; ++i) {
_fact[i] = _fact[i - 1] * int(i);
}
_inv_fact[TABLE_SIZE] = _fact[TABLE_SIZE].inv();
for (int i = (int)TABLE_SIZE - 1; i >= 0; --i) {
_inv_fact[i] = _inv_fact[i + 1] * (i + 1);
}
}
};
template <int M, unsigned F>
std::ostream &operator<<(std::ostream &os, const mod_int<M, F> &rhs) {
return os << rhs.x;
}
template <int M, unsigned F>
std::istream &operator>>(std::istream &is, mod_int<M, F> &rhs) {
long long s;
is >> s;
rhs = mod_int<M, F>(s);
return is;
}
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_inv[TABLE_SIZE + 1];
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_inv_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
bool operator==(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return lhs.x == rhs.x;
}
template <int M, unsigned F>
bool operator!=(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return !(lhs == rhs);
}
const int MF = 1000010;
const int MOD = 1000000007;
using mint = mod_int<MOD, MF>;
mint binom(int n, int r) {
return (r < 0 || r > n || n < 0) ? 0 : mint(n).choose(r);
}
mint fact(int n) { return mint(n).fact(); }
mint inv_fact(int n) { return mint(n).inv_fact(); }
class DThreeColors {
public:
void solve(std::istream &cin, std::ostream &cout, std::ostream &cerr) {
int N;
cin >> N;
VI a(N);
cin >> a;
int S = accumulate(ALL(a), 0);
DBG(S)
auto dp1 = multi_vector<mint>(2, 1e5, 0);
auto dp2 = multi_vector<mint>(2, 1e5, 0);
dp1[0][0] = dp2[0][0] = 1;
REP(i, N) {
FOR(s, 9e4 + 5, 0) dp1[(i + 1) & 1][s] = dp1[i & 1][s] * 2;
FOR(s, 9e4 + 5, 0) dp2[(i + 1) & 1][s] = dp2[i & 1][s];
FOR(s, 9e4 + 5, 0) dp1[(i + 1) & 1][s + a[i]] += dp1[i & 1][s];
FOR(s, 9e4 + 5, 0) dp2[(i + 1) & 1][s + a[i]] += dp2[i & 1][s];
}
DBG(dp1[N & 1], dp2[N & 1])
mint s_geq_1 = 0, s_geq_2 = 0;
FOR(i, (S + 1) / 2, 1e5 - 5) s_geq_1 += dp1[N & 1][i];
FOR(i, (S + 1) / 2, 1e5 - 5) s_geq_2 += dp2[N & 1][i];
// mint ans = mint(3).pow(N)
DBG(s_geq_1, s_geq_2)
mint c_ans = mint(2).pow(N) * 3 + s_geq_1 * 3 - 3 - s_geq_2 * 6 + 3;
// if(~S&1)c_ans += dp2[N&1][S/2]*3;
DBG(c_ans)
print(mint(3).pow(N) - c_ans);
// mint ans = mint(3).pow(N) - mint(2).pow(N)*3 + 3;
// mint ans = mint(3).pow(N);
// DBG(ans);
// FOR(n,1,N-1)FOR(s,S,1e5)ans -= (mint(2).pow((N-n)) -
// 2)*dp[N&1][n][s]*3; FOR(n,1,N-1)FOR(s,S,1e5)ans -= dp[N&1][n][s]*3;
// print(ans);
}
};
#undef int
int main() {
DThreeColors solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
std::ostringstream err;
in.tie(0);
ios::sync_with_stdio(0);
solver.solve(in, out, err);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<long long>;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast")
#define G(size_1) vector<vector<int>>(size_1, vector<int>())
#define SZ(x) ((int)(x).size())
#define READ \
({ \
ll t; \
cin >> t; \
t; \
})
#define FOR(i, _begin, _end) \
for (__typeof(_end) end = _end, begin = _begin, \
i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i, end) for (__typeof(end) i = 0, _len = (end); i < (_len); i += 1)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define MOD(x, m) ((((x) % (m)) + (m)) % (m))
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EB emplace_back
#define PB push_back
#define fcout cout << fixed << setprecision(12)
#define fcerr cerr << fixed << setprecision(12)
#define print(x) cout << (x) << '\n'
#define printE(x) cout << (x) << endl
#define fprint(x) cout << fixed << setprecision(12) << (x) << endl
#define BYE(a) \
do { \
cout << (a) << endl; \
return; \
} while (false)
#ifdef DEBUG
#define DBG(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
_err(cerr, _it, args); \
}
#define ERR(x) std::cerr << #x << " = " << x << endl;
#else
#define DBG(args...) {};
#define ERR(x) {};
#endif
void _err(std::ostream &cerr, istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void _err(std::ostream &cerr, istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " ";
_err(cerr, ++it, args...);
}
const double pi = 2 * acos(.0);
const int inf = 0x3f3f3f3f;
const ll mod = (ll)(1e9) + 7;
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;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &V) {
is >> V.F >> V.S;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &V) {
for (auto &&ele : V)
is >> ele;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> V) {
os << "[";
int cnt = 0;
T curr;
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
if (V[i] == curr)
cnt++;
else
cnt = 0;
if (cnt == 4)
os << "... ";
if (cnt < 4)
os << i << ":" << V[i] << " ";
curr = V[i];
}
os << V.size() - 1 << ":" << V.back();
}
os << "]\n";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> P) {
os << "(";
os << P.first << "," << P.second;
os << ")";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const set<T, U> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template <typename K, typename H, typename P>
ostream &operator<<(ostream &os, const unordered_set<K, H, P> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template <typename K, typename C>
ostream &operator<<(ostream &os, const multiset<K, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const unordered_map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> V) {
os << "[";
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
os << V[i] << "->";
}
if (!V.empty())
os << V.back();
}
os << "]\n";
return os;
};
template <typename T, typename Cont, typename Comp>
ostream &operator<<(ostream &os, const priority_queue<T, Cont, Comp> V) {
priority_queue<T, Cont, Comp> _V = V;
os << "[";
if (!_V.empty()) {
while (_V.size() > 1) {
os << _V.top() << "->";
_V.pop();
}
os << _V.top();
}
os << "]\n";
return os;
};
template <class F> struct y_combinator {
F f; // the lambda will be stored here
// a forwarding operator():
template <class... Args> decltype(auto) operator()(Args &&...args) const {
// we pass ourselves to f, then the arguments.
// the lambda should take the first argument as `auto&& recurse` or similar.
return f(*this, std::forward<Args>(args)...);
}
};
// helper function that deduces the type of the lambda:
template <class F> y_combinator<std::decay_t<F>> recursive(F &&f) {
return {std::forward<F>(f)};
}
struct hash_pair {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
template <typename T, typename U> std::vector<T> multi_vector(int n, U v) {
return std::vector<T>(n, v);
}
template <typename U, typename... Args> auto multi_vector(int n, Args... args) {
auto val = multi_vector<U>(std::forward<Args>(args)...);
return std::vector<decltype(val)>(n, std::move(val));
}
template <signed M, unsigned T> struct mod_int {
constexpr static signed MODULO = M;
constexpr static unsigned TABLE_SIZE = T;
signed x;
mod_int() : x(0) {}
mod_int(long long y)
: x(static_cast<signed>(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO)) {}
mod_int(int y) : x(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO) {}
explicit operator int() const { return x; }
explicit operator long long() const { return x; }
explicit operator double() const { return x; }
mod_int &operator+=(const mod_int &rhs) {
if ((x += rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((x += MODULO - rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
x = static_cast<signed>(1LL * x * rhs.x % MODULO);
return *this;
}
mod_int &operator/=(const mod_int &rhs) {
x = static_cast<signed>((1LL * x * rhs.inv().x) % MODULO);
return *this;
}
mod_int operator-() const { return mod_int(-x); }
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
bool operator<(const mod_int &rhs) const { return x < rhs.x; }
mod_int inv() const {
assert(x != 0);
if (x <= static_cast<signed>(TABLE_SIZE)) {
if (_inv[1].x == 0)
prepare();
return _inv[x];
} else {
signed a = x, b = MODULO, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mod_int(u);
}
}
mod_int pow(long long t) const {
assert(!(x == 0 && t == 0));
mod_int e = *this, res = mod_int(1);
for (; t; e *= e, t >>= 1)
if (t & 1)
res *= e;
return res;
}
mod_int fact() {
if (_fact[0].x == 0)
prepare();
return _fact[x];
}
mod_int inv_fact() {
if (_fact[0].x == 0)
prepare();
return _inv_fact[x];
}
mod_int choose(mod_int y) {
assert(y.x <= x);
return this->fact() * y.inv_fact() * mod_int(x - y.x).inv_fact();
}
static mod_int _inv[TABLE_SIZE + 1];
static mod_int _fact[TABLE_SIZE + 1];
static mod_int _inv_fact[TABLE_SIZE + 1];
static void prepare() {
_inv[1] = 1;
for (int i = 2; i <= (int)TABLE_SIZE; ++i) {
_inv[i] = 1LL * _inv[MODULO % i].x * (MODULO - MODULO / i) % MODULO;
}
_fact[0] = 1;
for (unsigned i = 1; i <= TABLE_SIZE; ++i) {
_fact[i] = _fact[i - 1] * int(i);
}
_inv_fact[TABLE_SIZE] = _fact[TABLE_SIZE].inv();
for (int i = (int)TABLE_SIZE - 1; i >= 0; --i) {
_inv_fact[i] = _inv_fact[i + 1] * (i + 1);
}
}
};
template <int M, unsigned F>
std::ostream &operator<<(std::ostream &os, const mod_int<M, F> &rhs) {
return os << rhs.x;
}
template <int M, unsigned F>
std::istream &operator>>(std::istream &is, mod_int<M, F> &rhs) {
long long s;
is >> s;
rhs = mod_int<M, F>(s);
return is;
}
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_inv[TABLE_SIZE + 1];
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_inv_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
bool operator==(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return lhs.x == rhs.x;
}
template <int M, unsigned F>
bool operator!=(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return !(lhs == rhs);
}
const int MF = 1000010;
const int MOD = 998244353;
using mint = mod_int<MOD, MF>;
mint binom(int n, int r) {
return (r < 0 || r > n || n < 0) ? 0 : mint(n).choose(r);
}
mint fact(int n) { return mint(n).fact(); }
mint inv_fact(int n) { return mint(n).inv_fact(); }
class DThreeColors {
public:
void solve(std::istream &cin, std::ostream &cout, std::ostream &cerr) {
int N;
cin >> N;
VI a(N);
cin >> a;
int S = accumulate(ALL(a), 0);
DBG(S)
auto dp1 = multi_vector<mint>(2, 1e5, 0);
auto dp2 = multi_vector<mint>(2, 1e5, 0);
dp1[0][0] = dp2[0][0] = 1;
REP(i, N) {
FOR(s, 9e4 + 5, 0) dp1[(i + 1) & 1][s] = dp1[i & 1][s] * 2;
FOR(s, 9e4 + 5, 0) dp2[(i + 1) & 1][s] = dp2[i & 1][s];
FOR(s, 9e4 + 5, 0) dp1[(i + 1) & 1][s + a[i]] += dp1[i & 1][s];
FOR(s, 9e4 + 5, 0) dp2[(i + 1) & 1][s + a[i]] += dp2[i & 1][s];
}
DBG(dp1[N & 1], dp2[N & 1])
mint s_geq_1 = 0, s_geq_2 = 0;
FOR(i, (S + 1) / 2, 1e5 - 5) s_geq_1 += dp1[N & 1][i];
FOR(i, (S + 1) / 2, 1e5 - 5) s_geq_2 += dp2[N & 1][i];
// mint ans = mint(3).pow(N)
DBG(s_geq_1, s_geq_2)
mint c_ans = mint(2).pow(N) * 3 + s_geq_1 * 3 - 3 - s_geq_2 * 6 + 3;
// if(~S&1)c_ans += dp2[N&1][S/2]*3;
DBG(c_ans)
print(mint(3).pow(N) - c_ans);
// mint ans = mint(3).pow(N) - mint(2).pow(N)*3 + 3;
// mint ans = mint(3).pow(N);
// DBG(ans);
// FOR(n,1,N-1)FOR(s,S,1e5)ans -= (mint(2).pow((N-n)) -
// 2)*dp[N&1][n][s]*3; FOR(n,1,N-1)FOR(s,S,1e5)ans -= dp[N&1][n][s]*3;
// print(ans);
}
};
#undef int
int main() {
DThreeColors solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
std::ostringstream err;
in.tie(0);
ios::sync_with_stdio(0);
solver.solve(in, out, err);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 880,463 | 880,464 | u093219895 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a - 1 >= b) {
cout << 2 * a + 1 << endl;
}
else if (b - 1 >= a) {
cout << 2 * b + 1 << endl;
}
else {
cout << a + b << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a - 1 >= b) {
cout << 2 * a - 1 << endl;
}
else if (b - 1 >= a) {
cout << 2 * b - 1 << endl;
}
else {
cout << a + b << endl;
}
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,479 | 880,480 | u751515087 | cpp |
p03071 | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(a) (a).begin(), (a).end()
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << 2 * A << endl;
else
cout << 2 * A - 1 << endl;
}
| #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(a) (a).begin(), (a).end()
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << 2 * A << endl;
else
cout << 2 * max(A, B) - 1 << endl;
}
| [
"call.add",
"call.arguments.add"
] | 880,481 | 880,482 | u229582356 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
ll cnt = 0;
rep(i, 2) {
if (a >= b) {
cnt += a;
a--;
} else {
cnt += b;
b--;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
ll cnt = 0;
rep(i, 2) {
if (a >= b) {
cnt += a;
a--;
} else {
cnt += b;
b--;
}
}
cout << cnt;
}
| [] | 880,495 | 880,496 | u945761460 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
ll cnt = 0;
rep(i, 2) {
if (a >= b) {
cnt += a;
a--;
} else {
cnt += b;
b--;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
ll cnt = 0;
rep(i, 2) {
if (a >= b) {
cnt += a;
a--;
} else {
cnt += b;
b--;
}
}
cout << cnt;
}
| [] | 880,497 | 880,496 | u945761460 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int ans = 0;
if (a > b)
ans = a + a - 1;
else if (b < a)
ans = b + b - 1;
else
ans = a + b;
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int ans = 0;
if (a > b)
ans = a + a - 1;
else if (b > a)
ans = b + b - 1;
else
ans = a + b;
cout << ans;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 880,500 | 880,501 | u636577997 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b << endl;
return 0;
}
else {
if (a > b) {
cout << a * (a - 1) << endl;
return 0;
} else {
cout << b * (b - 1) << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b << endl;
return 0;
}
else {
if (a > b) {
cout << a + (a - 1) << endl;
return 0;
} else {
cout << b + (b - 1) << endl;
return 0;
}
}
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,504 | 880,505 | u332946309 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << A * 2 - 1 << endl;
else
cout << max(A, B) * 2 - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << A * 2 << endl;
else
cout << max(A, B) * 2 - 1 << endl;
} | [
"expression.operation.binary.remove"
] | 880,506 | 880,507 | u889173297 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a, b;
int c = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
c = c + b;
b = b - 1;
}
else {
c = c + a;
a = a - 1;
}
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
c = c + b;
b = b - 1;
} else {
c = c + a;
a = a - 1;
}
}
cout << c << endl;
} | [] | 880,508 | 880,509 | u667099095 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a, b;
int c = 0;
for (int i = 0; i < 1; i++) {
if (a <= b) {
c = c + b;
b = b - 1;
}
else {
c = c + a;
a = a - 1;
}
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
c = c + b;
b = b - 1;
} else {
c = c + a;
a = a - 1;
}
}
cout << c << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 880,510 | 880,509 | u667099095 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
const ll mod = 1000000007;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int main() {
int a, b;
cin >> a >> b;
int ans = max(a, b) * 2 - 1;
if (a == b)
ans = a * 1;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
const ll mod = 1000000007;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int main() {
int a, b;
cin >> a >> b;
int ans = max(a, b) * 2 - 1;
if (a == b)
ans = a * 2;
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 880,511 | 880,512 | u488493347 | cpp |
p03071 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define uni(e) e.erase(unique(e.begin(), e.end()), e.end())
#define double long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int INF = 1e10;
int MOD = 1e9 + 7;
template <class T> void out(T a) { cout << a << '\n'; }
template <class T> void yesno(T b) {
if (b)
out("yes");
else
out("no");
}
template <class T> void YesNo(T b) {
if (b)
out("Yes");
else
out("No");
}
template <class T> void YESNO(T b) {
if (b)
out("YES");
else
out("NO");
}
template <class T> void noyes(T b) {
if (b)
out("no");
else
out("yes");
}
template <class T> void NoYes(T b) {
if (b)
out("No");
else
out("Yes");
}
template <class T> void NOYES(T b) {
if (b)
out("NO");
else
out("YES");
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool sosuu(int a) {
bool b = 1;
if (a <= 1)
return 0;
else {
rep1(i, sqrt(a) - 1) {
if (a % (i + 1) == 0)
b = 0;
}
return b;
}
}
signed main() {
int a, b;
cin >> a >> b;
out(min(a + a - 1, min(a + b, b + b - 1)));
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define uni(e) e.erase(unique(e.begin(), e.end()), e.end())
#define double long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int INF = 1e10;
int MOD = 1e9 + 7;
template <class T> void out(T a) { cout << a << '\n'; }
template <class T> void yesno(T b) {
if (b)
out("yes");
else
out("no");
}
template <class T> void YesNo(T b) {
if (b)
out("Yes");
else
out("No");
}
template <class T> void YESNO(T b) {
if (b)
out("YES");
else
out("NO");
}
template <class T> void noyes(T b) {
if (b)
out("no");
else
out("yes");
}
template <class T> void NoYes(T b) {
if (b)
out("No");
else
out("Yes");
}
template <class T> void NOYES(T b) {
if (b)
out("NO");
else
out("YES");
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool sosuu(int a) {
bool b = 1;
if (a <= 1)
return 0;
else {
rep1(i, sqrt(a) - 1) {
if (a % (i + 1) == 0)
b = 0;
}
return b;
}
}
signed main() {
int a, b;
cin >> a >> b;
out(max(a + a - 1, max(a + b, b + b - 1)));
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 880,513 | 880,514 | u341447450 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(2 * a + 1, max(a + b, 2 * b + 1)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(2 * a - 1, max(a + b, 2 * b - 1)) << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,521 | 880,522 | u336145516 | cpp |
p03071 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int A, B;
cin >> A >> B;
vector<int> number_list({A, B, A - 1, B, -1});
sort(number_list.begin(), number_list.end());
cout << number_list[3] + number_list[2];
return 0;
}
| #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int A, B;
cin >> A >> B;
vector<int> number_list({A, B, A - 1, B - 1});
sort(number_list.begin(), number_list.end());
cout << number_list[3] + number_list[2];
return 0;
}
| [
"call.arguments.change"
] | 880,527 | 880,528 | u557207741 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int m = max(a, b);
if (a == b) {
cout << 2 * a << endl;
} else {
cout << 2 * a - 1 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int m = max(a, b);
if (a == b) {
cout << 2 * a << endl;
} else {
cout << 2 * m - 1 << endl;
}
}
| [
"identifier.change",
"io.output.change"
] | 880,529 | 880,530 | u927463074 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.