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 |
|---|---|---|---|---|---|---|---|
p03018 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define dump(x) cout << #x << " = " << (x) << endl;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
int i = 0;
ll ans = 0;
int sz = S.size();
// aがabcの前になんこつづいているか
int ac = 0;
while (1) {
if (i >= sz - 2) {
break;
}
// S[i]がAだったらacをふやす、ちがったらacをリセットする
if (S[i] == 'A') {
ac++;
// ABCをみつけたらacの数だけansをふやしてiをi+2まですすめる
if (S[i + 1] == 'B' && S[i + 2] == 'C') {
S[i + 2] = 'A';
ans += ac;
ac = 0;
i += 2;
} else {
i++;
}
} else {
ac = 0;
i++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define dump(x) cout << #x << " = " << (x) << endl;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
int i = 0;
ll ans = 0;
int sz = S.size();
// aがabcの前になんこつづいているか
int ac = 0;
while (1) {
if (i >= sz - 2) {
break;
}
// S[i]がAだったらacをふやす、ちがったらacをリセットする
if (S[i] == 'A') {
ac++;
// ABCをみつけたらacの数だけansをふやしてiをi+2まですすめる
if (S[i + 1] == 'B' && S[i + 2] == 'C') {
S[i + 2] = 'A';
ans += ac;
ac--;
i += 2;
} else {
i++;
}
} else {
ac = 0;
i++;
}
}
cout << ans << endl;
return 0;
} | [] | 833,785 | 833,786 | u520129469 | cpp |
p03018 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
long res = 0;
long a = 0;
for (int p = 0; p < (int)s.size() - 2; p++) {
if (s[p] == 'A') {
if (s[p + 1] == 'B' && s[p + 2] == 'C') {
res += a;
s[p + 2] = 'A';
p++;
} else {
a++;
}
} else {
a = 0;
}
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
long res = 0;
long a = 0;
for (int p = 0; p < (int)s.size() - 2; p++) {
if (s[p] == 'A') {
if (s[p + 1] == 'B' && s[p + 2] == 'C') {
res += a + 1;
s[p + 2] = 'A';
p++;
} else {
a++;
}
} else {
a = 0;
}
}
cout << res << endl;
return 0;
}
| [
"assignment.change"
] | 833,789 | 833,790 | u382513779 | cpp |
p03018 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
string s;
cin >> s;
int idx = 0;
int ans = 0;
int countA = 0;
while (idx < ((int)s.size()) - 2) {
if (s[idx] == 'A') {
if (s[idx + 1] == 'B' && s[idx + 2] == 'C') {
ans++;
ans += countA;
s[idx] = 'B';
s[idx + 1] = 'C';
s[idx + 2] = 'A';
idx++;
countA = 0;
} else {
countA++;
}
} else
countA = 0;
idx++;
}
cout << ans << endl;
}
| /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
string s;
cin >> s;
int idx = 0;
ll ans = 0;
ll countA = 0;
while (idx < ((int)s.size()) - 2) {
if (s[idx] == 'A') {
if (s[idx + 1] == 'B' && s[idx + 2] == 'C') {
ans++;
ans += countA;
s[idx] = 'B';
s[idx + 1] = 'C';
s[idx + 2] = 'A';
idx++;
// dont inc or decrement countA
} else {
countA++;
}
} else
countA = 0;
idx++;
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 833,811 | 833,810 | u014617387 | cpp |
p03018 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'B' && s[i + 1] == 'C') {
s.replace(i, 2, 1, 'S');
}
}
int count = 0;
int a_count = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'S')
count += a_count;
else if (s[i] == 'A')
a_count++;
else
a_count = 0;
}
cout << count << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'B' && s[i + 1] == 'C') {
s.replace(i, 2, 1, 'S');
}
}
long int count = 0;
long int a_count = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'S')
count += a_count;
else if (s[i] == 'A')
a_count++;
else
a_count = 0;
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 833,814 | 833,813 | u225891650 | cpp |
p03018 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (long long i = l; i < r; i++)
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
class dijkstra {
int V;
int d[100002];
priority_queue<P, vector<P>, greater<P>> que;
void update(int s, vector<edge> G[]) {
fill(d, d + V + 1, 100000000000ll);
d[s] = 0;
que.push(make_pair(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
rep(i, G[v].size()) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(make_pair(d[e.to], e.to));
}
}
}
}
public:
dijkstra(int v, int s, vector<edge> G[]) {
V = v;
update(s, G);
}
int find(int e) { return d[e]; }
};
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool prime(int a) {
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
class Union_Find {
private:
vector<int> t, s;
public:
Union_Find(int max_length) {
rep(i, max_length + 1) {
t.push_back(i);
s.push_back(1);
}
}
void Union(int x, int y) {
if (same(x, y))
return;
int tx = Find(x), ty = Find(y);
if (s[tx] < s[ty]) {
s[ty] += s[tx];
t[tx] = ty;
} else if (s[tx] > s[ty]) {
s[tx] += s[ty];
t[ty] = tx;
} else if (tx > ty) {
t[tx] = ty;
s[ty] += s[tx];
} else {
t[ty] = tx;
s[tx] += s[ty];
}
}
int Find(int n) {
if (t[n] == n)
return n;
else
return t[n] = Find(t[n]);
}
bool same(int x, int y) { return Find(x) == Find(y); }
int get_Size(int a) { return s[a]; }
};
signed main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
if (s[s.size() - 1] == 'C' && s[s.size() - 2] == 'B')
cnt = 1;
for (int i = s.size() - 3; i >= 0; i--) {
if (s[i + 1] == 'C' && s[i] == 'B')
cnt++;
if (s[i + 1] == 'C' && s[i] == 'A')
cnt = 0;
if (s[i + 1] == 'C' && s[i] == 'C')
cnt = 0;
if (s[i + 1] == 'B' && s[i] == 'B')
cnt = 0;
if (s[i + 1] == 'A' && s[i] == 'B')
cnt = 0;
if (s[i] == 'A' && cnt) {
ans += cnt;
cnt = 1;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (long long i = l; i < r; i++)
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
class dijkstra {
int V;
int d[100002];
priority_queue<P, vector<P>, greater<P>> que;
void update(int s, vector<edge> G[]) {
fill(d, d + V + 1, 100000000000ll);
d[s] = 0;
que.push(make_pair(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
rep(i, G[v].size()) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(make_pair(d[e.to], e.to));
}
}
}
}
public:
dijkstra(int v, int s, vector<edge> G[]) {
V = v;
update(s, G);
}
int find(int e) { return d[e]; }
};
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool prime(int a) {
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
class Union_Find {
private:
vector<int> t, s;
public:
Union_Find(int max_length) {
rep(i, max_length + 1) {
t.push_back(i);
s.push_back(1);
}
}
void Union(int x, int y) {
if (same(x, y))
return;
int tx = Find(x), ty = Find(y);
if (s[tx] < s[ty]) {
s[ty] += s[tx];
t[tx] = ty;
} else if (s[tx] > s[ty]) {
s[tx] += s[ty];
t[ty] = tx;
} else if (tx > ty) {
t[tx] = ty;
s[ty] += s[tx];
} else {
t[ty] = tx;
s[tx] += s[ty];
}
}
int Find(int n) {
if (t[n] == n)
return n;
else
return t[n] = Find(t[n]);
}
bool same(int x, int y) { return Find(x) == Find(y); }
int get_Size(int a) { return s[a]; }
};
signed main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
if (s[s.size() - 1] == 'C' && s[s.size() - 2] == 'B')
cnt = 1;
for (int i = s.size() - 3; i >= 0; i--) {
if (s[i + 1] == 'C' && s[i] == 'B')
cnt++;
if (s[i + 1] == 'C' && s[i] == 'A')
cnt = 0;
if (s[i + 1] == 'C' && s[i] == 'C')
cnt = 0;
if (s[i + 1] == 'B' && s[i] == 'B')
cnt = 0;
if (s[i + 1] == 'A' && s[i] == 'B')
cnt = 0;
if (s[i] == 'A' && cnt) {
ans += cnt;
}
}
cout << ans << endl;
}
| [] | 833,819 | 833,820 | u073057072 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define M 998244353
#define ll long long
#define ld long double
#define vi vector<ll>
#define pi pair<ll, ll>
#define vii vector<pi>
#define vvi vector<vi>
#define pb push_back
#define endl "\n"
#define REP(i, s, e) for (ll i = s; i < e; i++)
#define RREP(i, s, e) for (ll i = s; i > e; i--)
#define all(v) v.begin(), v.end()
#define part(v, s, e) v.begin() + s, v.begin() + e
#define print(v) \
for (auto i : v) \
cout << i << " ";
int main() {
fast;
string s;
cin >> s;
ll n = s.size();
ll c = 0, t = 0, j;
REP(i, 0, n - 1) {
if (s[i] == 'A') {
t++;
if (t == 1)
j = i;
}
if (s[i] == 'B' && s[i + 1] == 'C') {
c += t;
if (t) {
swap(s[i], s[j]);
swap(s[i + 1], s[j + 1]);
}
}
if (s[i] != 'A')
t = 0;
}
cout << c << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define M 998244353
#define ll long long
#define ld long double
#define vi vector<ll>
#define pi pair<ll, ll>
#define vii vector<pi>
#define vvi vector<vi>
#define pb push_back
#define endl "\n"
#define REP(i, s, e) for (ll i = s; i < e; i++)
#define RREP(i, s, e) for (ll i = s; i > e; i--)
#define all(v) v.begin(), v.end()
#define part(v, s, e) v.begin() + s, v.begin() + e
#define print(v) \
for (auto i : v) \
cout << i << " ";
int main() {
fast;
string s;
cin >> s;
ll n = s.size();
ll c = 0, t = 0, j;
REP(i, 0, n - 1) {
if (s[i] == 'A') {
t++;
if (t == 1)
j = i;
}
if (s[i] == 'B' && s[i + 1] == 'C') {
c += t;
if (t) {
swap(s[i], s[j]);
swap(s[i + 1], s[j + 1]);
}
i++;
continue;
}
if (s[i] != 'A')
t = 0;
}
cout << c << endl;
return 0;
}
| [
"expression.unary.arithmetic.add"
] | 833,827 | 833,828 | u760200622 | cpp |
p03018 | #include <bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
using vvint = vector<vector<int>>;
using vvLL = vector<vector<LL>>;
int main() {
string s;
cin >> s;
int n = s.size();
int cnt = 0;
LL ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == 'C') {
if (i >= 1 && s[i - 1] == 'B')
cnt++;
else
cnt = 0;
} else if (s[i] == 'A') {
ans += cnt;
} else {
cnt = 0;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
using vvint = vector<vector<int>>;
using vvLL = vector<vector<LL>>;
int main() {
string s;
cin >> s;
int n = s.size();
int cnt = 0;
LL ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == 'C') {
if (i >= 1 && s[i - 1] == 'B') {
cnt++;
i--;
} else
cnt = 0;
} else if (s[i] == 'A') {
ans += cnt;
} else {
cnt = 0;
}
}
cout << ans << endl;
} | [
"expression.unary.arithmetic.add"
] | 833,829 | 833,830 | u510175787 | cpp |
p03018 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cVf ?Y! JM V$ `
+++++= OunkoI Xppppp dMN .MM+ .MM MM| MM] JMMMMMM+
|@tqkoh) ,y0 (V$ yyyyyyyV7 VV JMWyZWr TWVVVVW&,
++++++ dZZZZ0 Xppppp ^HMN, _.db WMm, .MMF MM| ..MM` JMF .
|yk .WV&. .XW' yy 4yn. jyn +. JM #S
`++++` ?ZZZX= ?WWWW= -THMMMMH9^ (TMMMMM9! MMMMMMM"" JMMMMMMMME
|UU. ?TUUUUY= UU. (UU- ^7TUUUV7! JUUUUUUUU 7TUNKO*/
// Ricty Diminished
#include "bits/stdc++.h"
using namespace std;
typedef long long lint;
typedef vector<lint> liv;
//#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define linf 1152921504606846976
#define MAXN 100100
#define md 1000000007 // 998244353
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1, _2, _3, _4, name, ...) name
#define _getname3(_1, _2, _3, name, ...) name
#define _trep2(tuple) _rep2 tuple
#define _trep3(tuple) _rep3 tuple
#define _trep4(tuple) _rep4 tuple
#define _rep1(n) for (lint i = 0; i < n; ++i)
#define _rep2(i, n) for (lint i = 0; i < n; ++i)
#define _rep3(i, a, b) for (lint i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (lint i = a; i < b; i += c)
#define _trrep2(tuple) _rrep2 tuple
#define _trrep3(tuple) _rrep3 tuple
#define _trrep4(tuple) _rrep4 tuple
#define _rrep1(n) for (lint i = n - 1; i >= 0; --i)
#define _rrep2(i, n) for (lint i = n - 1; i >= 0; --i)
#define _rrep3(i, a, b) for (lint i = b - 1; i >= a; --i)
#define _rrep4(i, a, b, c) \
for (lint i = a + (b - a - 1) / c * c; i >= a; i -= c)
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
// template<class T>
// ostream& operator<<(ostream& os,vector<T>& vec){
// os<<vec[0];rep(i,1,vec.size())os<<' '<<vec[i];return os; } template<class T>
// ostream& operator<<(ostream& os,deque<T>& deq){
// os<<deq[0];rep(i,1,deq.size())os<<' '<<deq[i];return os; }
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
} // http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
#define rep(...) \
_vcppunko4((__VA_ARGS__, _trep4, _trep3, _trep2, _rep1))((__VA_ARGS__))
#define rrep(...) \
_vcppunko4((__VA_ARGS__, _trrep4, _trrep3, _trrep2, _rrep1))((__VA_ARGS__))
#define each(v) for (auto &i : v)
#define lin(...) \
lint __VA_ARGS__; \
in(__VA_ARGS__)
#define stin(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define vin(type, name, size) \
vector<type> name(size); \
in(name)
#define fi i.first
#define se i.second
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define o(p) cout << p << endl, 0
#define sp(p) cout << p << " "
#define deb(p) cerr << p << endl, 0
#define dd(n) cout << fixed << setprecision(n)
#define inf linf
//死ね
// int main(){
// lint n,a,b,c,d;in(n,a,b,c,d);--a;--b;--c;--d;
// stin(s);
// int ans=1,nukasu=0,aku=0;
// if((a<b)^(c<d))nukasu=(a>b?1:2);
// rep(i,a,min(c-1,n-1)){
// if(s[i]=='#'&&s[i+1]=='#')ans=0;
// }
// rep(i,max({a,b,1ll})-1,min({c,d,n-1})-1){
// if(s[i]=='.'&&s[i+1]=='.'&&s[i+2]=='.')aku=1;
// }
// rep(i,b,min(d-1,n-1)){
// if(s[i]=='#'&&s[i+1]=='#')ans=0;
// }
// if(nukasu&&!aku)ans=0;
// Yes(ans);
//}
int main() {
stin(s);
lint n = s.size(), ans = 0, a = 0, f = 0;
rep(n - 2) {
if (!a && s[i] == 'A')
f = i;
if (s[i] == 'A')
++a;
else
a = 0, f = i;
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
s[i + 1] = 'A', s[i + 2] = 'A', s[f] = 'B', s[f + 1] = 'C',
s[f + 2] = 'A', ans += a, f = f + 2;
}
o(ans);
}
// sub_EOF
// map<lint,lint> zip;
// lint unzip[MAXN];
//
// void compress(vector<lint> &a,map<lint,lint> &z,lint u[]){
// vector<lint> v=a;
// sort(all(v));
// v.erase(unique(all(v)),v.end());
// rep(i,v.size()){
// z[v[i]]=i;
// u[i]=v[i];
// }return;
//}
//
// int main(){
// lint n,qn;in(n,qn);
// vector<lint> a;
// struct query{ lint t,x,y; };
// vector<query>q(n);
// rep(qn){
// cin>>q[i].t>>q[i].x>>q[i].y;
// a.pb(q[i].x);
// a.pb(q[i].y);
// }compress(a,zip,unzip);
// lint m=a.size();
//}
// sub-EOF
|
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cVf ?Y! JM V$ `
+++++= OunkoI Xppppp dMN .MM+ .MM MM| MM] JMMMMMM+
|@tqkoh) ,y0 (V$ yyyyyyyV7 VV JMWyZWr TWVVVVW&,
++++++ dZZZZ0 Xppppp ^HMN, _.db WMm, .MMF MM| ..MM` JMF .
|yk .WV&. .XW' yy 4yn. jyn +. JM #S
`++++` ?ZZZX= ?WWWW= -THMMMMH9^ (TMMMMM9! MMMMMMM"" JMMMMMMMME
|UU. ?TUUUUY= UU. (UU- ^7TUUUV7! JUUUUUUUU 7TUNKO*/
// Ricty Diminished
#include "bits/stdc++.h"
using namespace std;
typedef long long lint;
typedef vector<lint> liv;
//#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define linf 1152921504606846976
#define MAXN 100100
#define md 1000000007 // 998244353
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1, _2, _3, _4, name, ...) name
#define _getname3(_1, _2, _3, name, ...) name
#define _trep2(tuple) _rep2 tuple
#define _trep3(tuple) _rep3 tuple
#define _trep4(tuple) _rep4 tuple
#define _rep1(n) for (lint i = 0; i < n; ++i)
#define _rep2(i, n) for (lint i = 0; i < n; ++i)
#define _rep3(i, a, b) for (lint i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (lint i = a; i < b; i += c)
#define _trrep2(tuple) _rrep2 tuple
#define _trrep3(tuple) _rrep3 tuple
#define _trrep4(tuple) _rrep4 tuple
#define _rrep1(n) for (lint i = n - 1; i >= 0; --i)
#define _rrep2(i, n) for (lint i = n - 1; i >= 0; --i)
#define _rrep3(i, a, b) for (lint i = b - 1; i >= a; --i)
#define _rrep4(i, a, b, c) \
for (lint i = a + (b - a - 1) / c * c; i >= a; i -= c)
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
// template<class T>
// ostream& operator<<(ostream& os,vector<T>& vec){
// os<<vec[0];rep(i,1,vec.size())os<<' '<<vec[i];return os; } template<class T>
// ostream& operator<<(ostream& os,deque<T>& deq){
// os<<deq[0];rep(i,1,deq.size())os<<' '<<deq[i];return os; }
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
} // http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
#define rep(...) \
_vcppunko4((__VA_ARGS__, _trep4, _trep3, _trep2, _rep1))((__VA_ARGS__))
#define rrep(...) \
_vcppunko4((__VA_ARGS__, _trrep4, _trrep3, _trrep2, _rrep1))((__VA_ARGS__))
#define each(v) for (auto &i : v)
#define lin(...) \
lint __VA_ARGS__; \
in(__VA_ARGS__)
#define stin(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define vin(type, name, size) \
vector<type> name(size); \
in(name)
#define fi i.first
#define se i.second
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define o(p) cout << p << endl, 0
#define sp(p) cout << p << " "
#define deb(p) cerr << p << endl, 0
#define dd(n) cout << fixed << setprecision(n)
#define inf linf
//死ね
// int main(){
// lint n,a,b,c,d;in(n,a,b,c,d);--a;--b;--c;--d;
// stin(s);
// int ans=1,nukasu=0,aku=0;
// if((a<b)^(c<d))nukasu=(a>b?1:2);
// rep(i,a,min(c-1,n-1)){
// if(s[i]=='#'&&s[i+1]=='#')ans=0;
// }
// rep(i,max({a,b,1ll})-1,min({c,d,n-1})-1){
// if(s[i]=='.'&&s[i+1]=='.'&&s[i+2]=='.')aku=1;
// }
// rep(i,b,min(d-1,n-1)){
// if(s[i]=='#'&&s[i+1]=='#')ans=0;
// }
// if(nukasu&&!aku)ans=0;
// Yes(ans);
//}
int main() {
stin(s);
lint n = s.size(), ans = 0, a = 0, f = 0;
rep(n - 2) {
if (!a && s[i] == 'A')
f = i;
if (s[i] == 'A')
++a;
else
a = 0, f = i;
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
s[i + 1] = 'A', s[i + 2] = 'A', s[f] = 'B', s[f + 1] = 'C',
s[f + 2] = 'A', ans += a, a -= 2, f = f + 2;
}
o(ans);
}
// sub_EOF
// map<lint,lint> zip;
// lint unzip[MAXN];
//
// void compress(vector<lint> &a,map<lint,lint> &z,lint u[]){
// vector<lint> v=a;
// sort(all(v));
// v.erase(unique(all(v)),v.end());
// rep(i,v.size()){
// z[v[i]]=i;
// u[i]=v[i];
// }return;
//}
//
// int main(){
// lint n,qn;in(n,qn);
// vector<lint> a;
// struct query{ lint t,x,y; };
// vector<query>q(n);
// rep(qn){
// cin>>q[i].t>>q[i].x>>q[i].y;
// a.pb(q[i].x);
// a.pb(q[i].y);
// }compress(a,zip,unzip);
// lint m=a.size();
//}
// sub-EOF
| [] | 833,834 | 833,835 | u675296835 | cpp |
p03018 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int AAA = 0, BC = 0, ans = 0;
for (int i = 0; i < S.size() - 1; ++i) {
if (S.at(i) == 'A')
AAA++;
if (S.at(i) == 'B' && S.at(i + 1) == 'C') {
ans += AAA;
++i;
} else
AAA = 0;
}
cout << ans << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
long int AAA = 0, BC = 0, ans = 0;
for (int i = 0; i < S.size() - 1; ++i) {
if (S.at(i) == 'A')
AAA++;
else if (S.at(i) == 'B' && S.at(i + 1) == 'C') {
ans += AAA;
++i;
} else
AAA = 0;
}
cout << ans << endl;
}
| [
"variable_declaration.type.widen.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 833,865 | 833,864 | u041282550 | cpp |
p03018 | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
string S;
ll BC[200010] = {};
int main() {
cin >> S;
int N = S.size();
if (N <= 2) {
cout << 0 << endl;
return 0;
}
ll bc = 0;
ll ans = 0;
int i = N - 2;
while (i >= 0) {
if (S[i] == 'A') {
if (S[i] != 'C') {
ans += bc;
i--;
} else {
bc = 0;
i--;
}
} else if (S[i] == 'B') {
if (S[i + 1] == 'C') {
bc++;
i--;
} else {
bc = 0;
i--;
}
} else {
if (S[i + 1] == 'C') {
bc = 0;
}
i--;
}
}
cout << ans << endl;
} | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
string S;
ll BC[200010] = {};
int main() {
cin >> S;
int N = S.size();
if (N <= 2) {
cout << 0 << endl;
return 0;
}
ll bc = 0;
ll ans = 0;
int i = N - 2;
while (i >= 0) {
if (S[i] == 'A') {
if (S[i + 1] != 'C') {
ans += bc;
i--;
} else {
bc = 0;
i--;
}
} else if (S[i] == 'B') {
if (S[i + 1] == 'C') {
bc++;
i--;
} else {
bc = 0;
i--;
}
} else {
if (S[i + 1] == 'C') {
bc = 0;
}
i--;
}
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 833,896 | 833,897 | u623954643 | cpp |
p03018 | // Optimise
#include <bits/stdc++.h>
using namespace std;
#define Online 1
// #define multitest 1
#define Debug 1
void ControlIO();
void TimerStart();
void TimerStop();
#ifdef Debug
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " = " << arg1;
ZZ(comma, args...);
}
#else
#define db(...)
#endif
typedef long long ll;
typedef long double ld;
#define f first
#define s second
#define pb push_back
const long long mod = 1000000007;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve() {
string s;
cin >> s;
ll cnt = 0;
int n = s.size(), x = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == 'A') {
if (i + 2 < n) {
x++;
if (s[i + 1] == 'B' && s[i + 2] == 'C') {
cnt += x;
s[i] = 'B';
s[i + 1] = 'C';
s[i + 2] = 'A';
// cout << s << ' ' << i << '\n';
i = i + 2;
}
}
} else
x = 0;
}
cout << cnt;
}
int main() {
ControlIO();
int t = 1;
#ifdef multitest
cin >> t;
#endif
TimerStart();
while (t--)
solve();
TimerStop();
return 0;
}
void ControlIO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef Online
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
auto TimeStart = chrono::steady_clock::now();
auto TimeEnd = chrono::steady_clock::now();
void TimerStart() {
#ifndef Online
TimeStart = chrono::steady_clock::now();
#endif
}
void TimerStop() {
#ifndef Online
TimeEnd = chrono::steady_clock::now();
auto ElapsedTime = TimeEnd - TimeStart;
cout << "\n\nTime elapsed: " << chrono::duration<double>(ElapsedTime).count()
<< " seconds.\n";
#endif
} | // Optimise
#include <bits/stdc++.h>
using namespace std;
#define Online 1
// #define multitest 1
#define Debug 1
void ControlIO();
void TimerStart();
void TimerStop();
#ifdef Debug
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " = " << arg1;
ZZ(comma, args...);
}
#else
#define db(...)
#endif
typedef long long ll;
typedef long double ld;
#define f first
#define s second
#define pb push_back
const long long mod = 1000000007;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve() {
string s;
cin >> s;
ll cnt = 0;
int n = s.size(), x = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == 'A') {
if (i + 2 < n) {
x++;
if (s[i + 1] == 'B' && s[i + 2] == 'C') {
cnt += x;
s[i] = 'B';
s[i + 1] = 'C';
s[i + 2] = 'A';
// cout << s << ' ' << i << '\n';
i = i + 1;
x--;
}
}
} else
x = 0;
}
cout << cnt;
}
int main() {
ControlIO();
int t = 1;
#ifdef multitest
cin >> t;
#endif
TimerStart();
while (t--)
solve();
TimerStop();
return 0;
}
void ControlIO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef Online
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
auto TimeStart = chrono::steady_clock::now();
auto TimeEnd = chrono::steady_clock::now();
void TimerStart() {
#ifndef Online
TimeStart = chrono::steady_clock::now();
#endif
}
void TimerStop() {
#ifndef Online
TimeEnd = chrono::steady_clock::now();
auto ElapsedTime = TimeEnd - TimeStart;
cout << "\n\nTime elapsed: " << chrono::duration<double>(ElapsedTime).count()
<< " seconds.\n";
#endif
} | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.unary.arithmetic.add"
] | 833,959 | 833,960 | u467423063 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
string S;
int main() {
cin >> S;
int64_t ans = 0;
int64_t Acnt = 0;
for (int i = 0; i < S.size(); i++) {
if (i + 1 < S.size() && S[i] == 'B' && S[i + 1] == 'C') {
ans += Acnt;
Acnt = 1;
i++;
} else if (S[i] == 'A') {
Acnt++;
} else {
Acnt = 0;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
string S;
int main() {
cin >> S;
int64_t ans = 0;
int64_t Acnt = 0;
for (int i = 0; i < S.size(); i++) {
if (i + 1 < S.size() && S[i] == 'B' && S[i + 1] == 'C') {
ans += Acnt;
i++;
} else if (S[i] == 'A') {
Acnt++;
} else {
Acnt = 0;
}
}
cout << ans << endl;
} | [] | 833,963 | 833,964 | u992875223 | cpp |
p03018 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
template <typename T> void output(T, int);
int gcd(int a, int b);
ll solve(string s) {
ll ans = 0;
ll count = 0;
rep(i, s.size()) {
if (s[i] == 'B') {
ans += count;
} else if (s[i] == 'A') {
count++;
} else {
count = 0;
}
}
return ans;
}
int main() {
// source
string s;
cin >> s;
// string mine = "";
int dust = 0;
int n = s.size();
ll count = 0;
ll ans = 0;
rep(i, n) {
if (dust == 0) {
if (s[i] == 'A') {
// mine += "A";
count++;
} else if (s[i] == 'B') {
if (i + 1 != n) {
if (s[i + 1] == 'C') {
// mine += "B";
ans += count;
i++;
} else if (s[i + 1] == 'A') {
// mine += "D";
count = 0;
} else {
// mine += "D";
count = 0;
dust = 1;
}
}
} else {
dust = 1;
// mine += "D";
count = 0;
}
} else {
if (s[i] == 'A') {
// mine += "A";
ans = count;
dust = 0;
}
}
}
// rep(i, mine.size()) { ans = solve(mine); }
cout << ans << endl;
return 0;
}
template <typename T> void output(T a, int precision) {
if (precision > 0) {
cout << setprecision(precision) << a << "\n";
} else {
cout << a << "\n";
}
}
template <typename T> T min(T a, T b) {
if (a < b) {
return a;
} else {
return b;
}
}
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
template <typename T> void output(T, int);
int gcd(int a, int b);
ll solve(string s) {
ll ans = 0;
ll count = 0;
rep(i, s.size()) {
if (s[i] == 'B') {
ans += count;
} else if (s[i] == 'A') {
count++;
} else {
count = 0;
}
}
return ans;
}
int main() {
// source
string s;
cin >> s;
// string mine = "";
int dust = 0;
int n = s.size();
ll count = 0;
ll ans = 0;
rep(i, n) {
if (dust == 0) {
if (s[i] == 'A') {
// mine += "A";
count++;
} else if (s[i] == 'B') {
if (i + 1 != n) {
if (s[i + 1] == 'C') {
// mine += "B";
ans += count;
i++;
} else if (s[i + 1] == 'A') {
// mine += "D";
count = 0;
} else {
// mine += "D";
count = 0;
dust = 1;
}
}
} else {
dust = 1;
// mine += "D";
count = 0;
}
} else {
if (s[i] == 'A') {
// mine += "A";
count++;
dust = 0;
}
}
}
// rep(i, mine.size()) { ans = solve(mine); }
cout << ans << endl;
return 0;
}
template <typename T> void output(T a, int precision) {
if (precision > 0) {
cout << setprecision(precision) << a << "\n";
} else {
cout << a << "\n";
}
}
template <typename T> T min(T a, T b) {
if (a < b) {
return a;
} else {
return b;
}
}
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
| [
"assignment.change"
] | 833,998 | 833,999 | u030992242 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
long long ans = 0;
long long cnt = 0;
for (int i = 0; i < n - 1;) {
if (s[i] == 'A')
cnt++;
if (s[i] == 'C')
cnt = 0;
if (s[i] == 'B' && s[i + 1] != 'C')
cnt = 0;
if (s[i] == 'B' && s[i + 1] == 'C') {
ans += cnt;
cnt = 1;
i++;
}
i++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
long long ans = 0;
long long cnt = 0;
for (int i = 0; i < n - 1;) {
if (s[i] == 'A')
cnt++;
if (s[i] == 'C')
cnt = 0;
if (s[i] == 'B' && s[i + 1] != 'C')
cnt = 0;
if (s[i] == 'B' && s[i + 1] == 'C') {
ans += cnt;
i++;
}
i++;
}
cout << ans << endl;
} | [] | 834,044 | 834,045 | u676029460 | cpp |
p03018 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s;
cin >> s;
ll a = 0;
ll ans = 0;
for (int z = 0; z < s.size() - 1; z++) {
if (s[z] == 'A')
a++;
else if (s[z] == 'B' && s[z + 1] == 'C') {
a--;
ans += 1;
z += 2;
ll bc = 0;
for (; z < s.size() - 1; z++) {
if (s[z] == 'B' && s[z] == 'C') {
bc++;
} else
break;
}
z--;
ans += (a + bc + a * bc);
a = 1;
} else
a = 0;
}
cout << ans << endl;
cin >> s;
}
| #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s;
cin >> s;
ll a = 0;
ll ans = 0;
for (int z = 0; z < s.size() - 1; z++) {
if (s[z] == 'A')
a++;
else if (s[z] == 'B' && s[z + 1] == 'C') {
a--;
ans += 1;
z += 2;
ll bc = 0;
for (; z < s.size() - 1; z++) {
if (s[z] == 'B' && s[z] == 'C') {
bc++;
} else
break;
}
z--;
ans += (a + bc + a * bc);
a += 1;
} else
a = 0;
}
cout << ans << endl;
cin >> s;
}
| [
"assignment.value.change"
] | 834,046 | 834,047 | u553927381 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main() {
string s;
cin >> s;
ll n = s.size() - 1;
ll ans = 0, a = 0;
for (ll i = 0; i < n; i++) {
if (s[i] == 'A')
a++;
else if (s[i] == 'B') {
if (s[i + 1] == 'C')
ans += a, i++;
} else {
a = 0;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main() {
string s;
cin >> s;
ll n = s.size() - 1;
ll ans = 0, a = 0;
for (ll i = 0; i < n; i++) {
if (s[i] == 'A')
a++;
else if (s[i] == 'B') {
if (s[i + 1] == 'C')
ans += a, i++;
else
a = 0;
} else {
a = 0;
}
}
cout << ans << endl;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 834,063 | 834,064 | u026867297 | cpp |
p03018 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int Anum = 0;
int state = 0;
int ans = 0;
for (char c : s) {
if (state == 0 && c == 'A') {
Anum = 1;
state = 1;
} else if (state == 1) {
switch (c) {
case 'A':
Anum++;
break;
case 'B':
state = 2;
break;
default:
Anum = 0;
state = 0;
}
} else if (state == 2) {
switch (c) {
case 'A':
Anum = 1;
state = 1;
break;
case 'C':
ans += Anum;
Anum = 1;
state = 1;
break;
default:
Anum = 0;
state = 0;
}
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int Anum = 0;
int state = 0;
long long ans = 0;
for (char c : s) {
if (state == 0 && c == 'A') {
Anum = 1;
state = 1;
} else if (state == 1) {
switch (c) {
case 'A':
Anum++;
break;
case 'B':
state = 2;
break;
default:
Anum = 0;
state = 0;
}
} else if (state == 2) {
switch (c) {
case 'A':
Anum = 1;
state = 1;
break;
case 'C':
ans += Anum;
state = 1;
break;
default:
Anum = 0;
state = 0;
}
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 834,093 | 834,092 | u868132236 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>
#define vbool vector<bool>
#define INF 100000000000000009
#define int long long
using P = pair<int, int>;
signed main() {
string s;
cin >> s;
int ans = 0;
string r = regex_replace(s, regex("BC"), "X");
// cout << r << endl;
int acount = 0;
rep(i, r.size()) {
if (r[i] == 'A') {
acount++;
} else if (r[i] == 'X') {
ans += acount;
acount = 1;
} else {
acount = 0;
}
// cout << acount << " " << ans << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>
#define vbool vector<bool>
#define INF 100000000000000009
#define int long long
using P = pair<int, int>;
signed main() {
string s;
cin >> s;
int ans = 0;
string r = regex_replace(s, regex("BC"), "X");
// cout << r << endl;
int acount = 0;
rep(i, r.size()) {
if (r[i] == 'A') {
acount++;
} else if (r[i] == 'X') {
ans += acount;
} else {
acount = 0;
}
// cout << acount << " " << ans << endl;
}
cout << ans << endl;
} | [] | 834,142 | 834,143 | u613960672 | cpp |
p03018 | #define _USE_MATH_DEFINES
#ifdef __GNUC__
#include <bits/stdc++.h>
#else
#define _CRT_SECURE_NO_WARNINGS
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)
using namespace std;
using ll = long long;
using ld = long double;
using VB = vector<bool>;
using VVB = vector<VB>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VS = vector<string>;
using VD = vector<ld>;
using PII = pair<int, int>;
using VP = vector<PII>;
using PLL = pair<ll, ll>;
using VPL = vector<PLL>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr ll inf_ll = (ll)1e18, MOD = 1000000007;
constexpr ld PI = M_PI, EPS = 1e-12;
// --- input --- //
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#define fwrite_unlocked _fwrite_nolock
#define fflush_unlocked _fflush_nolock
#endif
inline int gc() { return getchar_unlocked(); }
template <class T> inline void InputF(T &v) { cin >> v; }
inline void InputF(char &v) {
while (isspace(v = gc()))
;
}
inline void InputF(bool &v) {
char c;
InputF(c);
v = c != '0';
}
inline void InputF(string &v) {
char c;
for (InputF(c); !isspace(c); c = gc())
v += c;
}
inline void InputF(int &v) {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(long long &v) {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(double &v) {
double dp = 1;
bool neg = false, adp = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c) || c == '.'; c = gc()) {
if (c == '.')
adp = true;
else if (adp)
v += (c - '0') * (dp *= 0.1);
else
v = v * 10 + (c - '0');
}
if (neg)
v = -v;
}
template <class T, class U> inline void InputF(pair<T, U> &v) {
InputF(v.first);
InputF(v.second);
}
template <class T> inline void InputF(vector<T> &v) {
for (auto &e : v)
InputF(e);
}
template <class T> inline T InputF() {
T v;
InputF(v);
return v;
}
struct InputV {
int n, m;
InputV(int N) : n(N), m(0) {}
InputV(pair<int, int> N) : n(N.first), m(N.second) {}
template <class T> operator vector<T>() {
vector<T> v(n);
InputF(v);
return v;
}
template <class T> operator vector<vector<T>>() {
vector<vector<T>> v(n, vector<T>(m));
InputF(v);
return v;
}
};
struct Input {
template <class T> operator T() { return InputF<T>(); }
int operator--(int) {
int v;
InputF(v);
v--;
return v;
}
InputV operator[](int n) { return InputV(n); }
InputV operator[](pair<int, int> n) { return InputV(n); }
void operator()() {}
template <class H, class... T> void operator()(H &&h, T &&...t) {
InputF(h);
operator()(forward<T>(t)...);
}
template <class T> Input &operator,(T &&v) {
InputF(v);
return *this;
}
} in;
#define input(T) InputF<T>()
#define ini input(int)
#define inl input(ll)
#define ins input(string)
#define inputs(T, ...) \
T __VA_ARGS__; \
in(__VA_ARGS__)
#define INT(...) inputs(int, __VA_ARGS__)
#define LL(...) inputs(ll, __VA_ARGS__)
#define STR(...) inputs(string, __VA_ARGS__)
// --- output --- //
struct BoolStr {
const char *t, *f;
BoolStr(const char *_t, const char *_f) : t(_t), f(_f) {}
} Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
const char *d, *l;
DivStr(const char *_d, const char *_l) : d(_d), l(_l) {}
} spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"),
no_endl(" ", "");
class Output {
BoolStr B{Yes};
DivStr D{spc};
void p(int v) {
if (v < 0)
putchar_unlocked('-'), v = -v;
char b[10];
int n = 0;
while (v)
b[n++] = '0' + v % 10, v /= 10;
if (!n)
b[n++] = '0';
while (n--)
putchar_unlocked(b[n]);
}
void p(ll v) {
if (v < 0)
putchar_unlocked('-'), v = -v;
char b[20];
int n = 0;
while (v)
b[n++] = '0' + v % 10, v /= 10;
if (!n)
b[n++] = '0';
while (n--)
putchar_unlocked(b[n]);
}
void p(bool v) { p(v ? B.t : B.f); }
void p(char v) { putchar_unlocked(v); }
void p(const char *v) { fwrite_unlocked(v, 1, strlen(v), stdout); }
void p(double v) { printf("%.20f", v); }
void p(ld v) { printf("%.20Lf", v); }
template <class T> void p(const T &v) { cout << v; }
template <class T, class U> void p(const pair<T, U> &v) {
p(v.first);
p(D.d);
p(v.second);
}
template <class T> void p(const vector<T> &v) {
rep(i, sz(v)) {
if (i)
p(D.d);
p(v[i]);
}
}
template <class T> void p(const vector<vector<T>> &v) {
rep(i, sz(v)) {
if (i)
p(D.l);
p(v[i]);
}
}
public:
Output &operator()() {
p(D.l);
return *this;
}
template <class H> Output &operator()(H &&h) {
p(h);
p(D.l);
return *this;
}
template <class H, class... T> Output &operator()(H &&h, T &&...t) {
p(h);
p(D.d);
return operator()(forward<T>(t)...);
}
template <class... T> void exit(T &&...t) {
operator()(forward<T>(t)...);
std::exit(EXIT_SUCCESS);
}
Output &flush() {
fflush_unlocked(stdout);
return *this;
}
Output &set(const BoolStr &b) {
B = b;
return *this;
}
Output &set(const DivStr &d) {
D = d;
return *this;
}
Output &set(const char *t, const char *f) {
B = BoolStr(t, f);
return *this;
}
} out;
// --- step --- //
template <class T> struct Step {
class It {
T a, b, c;
public:
constexpr It() : a(T()), b(T()), c(T()) {}
constexpr It(T _b, T _c, T _s) : a(_b), b(_c), c(_s) {}
constexpr It &operator++() {
--b;
a += c;
return *this;
}
constexpr It operator++(int) {
It tmp = *this;
--b;
a += c;
return tmp;
}
constexpr const T &operator*() const { return a; }
constexpr const T *operator->() const { return &a; }
constexpr bool operator==(const It &i) const { return b == i.b; }
constexpr bool operator!=(const It &i) const { return !(b == i.b); }
constexpr T start() const { return a; }
constexpr T count() const { return b; }
constexpr T step() const { return c; }
};
constexpr Step(T b, T c, T s) : be(b, c, s) {}
constexpr It begin() const { return be; }
constexpr It end() const { return en; }
constexpr T start() const { return be.start(); }
constexpr T count() const { return be.count(); }
constexpr T step() const { return be.step(); }
constexpr T sum() const {
return start() * count() + step() * (count() * (count() - 1) / 2);
}
operator vector<T>() const { return as_vector(); }
vector<T> as_vector() const {
vector<T> res;
res.reserve(count());
each([&](T i) { res.push_back(i); });
return res;
}
template <class F> void each(const F &f) const {
for (T i : *this)
f(i);
}
template <class F> auto map(const F &f) const {
vector<decay_t<result_of_t<F(T)>>> res;
res.reserve(count());
each([&](T i) { res.push_back(f(i)); });
return res;
}
template <class F> int count_if(const F &f) const {
int res = 0;
each([&](T i) { res += static_cast<bool>(f(i)); });
return res;
}
template <class F> vector<T> select(const F &f) const {
vector<T> res;
each([&](T i) {
if (f(i))
res.push_back(i);
});
return res;
}
template <class F> auto max(const F &f) const {
auto v = map(f);
return *max_element(v.begin(), v.end());
}
template <class F> auto min(const F &f) const {
auto v = map(f);
return *min_element(v.begin(), v.end());
}
template <class F, class U = decay_t<result_of_t<F(T)>>>
auto sum(const F &f) const {
U res = 0;
each([&](T i) { res += static_cast<U>(f(i)); });
return res;
}
using value_type = T;
using iterator = It;
private:
It be, en;
};
template <class T> inline constexpr auto step(T a) { return Step<T>(0, a, 1); }
template <class T> inline constexpr auto step(T a, T b) {
return Step<T>(a, b - a, 1);
}
template <class T> inline constexpr auto step(T a, T b, T c) {
return Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);
}
// --- functions --- //
inline namespace {
template <class T> inline void Sort(T &a) { sort(all(a)); }
template <class T> inline void RSort(T &a) { sort(rall(a)); }
template <class T> inline T Sorted(T a) {
Sort(a);
return a;
}
template <class T> inline T RSorted(T a) {
RSort(a);
return a;
}
template <class T, class F> inline void Sort(T &a, const F &f) {
sort(all(a), [&](const auto &x, const auto &y) { return f(x) < f(y); });
}
template <class T, class F> inline void RSort(T &a, const F &f) {
sort(rall(a), [&](const auto &x, const auto &y) { return f(x) < f(y); });
}
template <class T> inline void Reverse(T &a) { reverse(all(a)); }
template <class T> inline void Unique(T &a) {
a.erase(unique(all(a)), a.end());
}
template <class T> inline T Reversed(T a) {
Reverse(a);
return a;
}
template <class T> inline T Uniqued(T a) {
Unique(a);
return a;
}
template <class T> inline auto Max(const T &a) { return *max_element(all(a)); }
template <class T> inline auto Min(const T &a) { return *min_element(all(a)); }
template <class T> inline int MaxPos(const T &a) {
return max_element(all(a)) - a.begin();
}
template <class T> inline int MinPos(const T &a) {
return min_element(all(a)) - a.begin();
}
template <class T, class F> inline auto Max(const T &a, const F &f) {
return *max_element(
all(a), [&](const auto &x, const auto &y) { return f(x) < f(y); });
}
template <class T, class F> inline auto Min(const T &a, const F &f) {
return *min_element(
all(a), [&](const auto &x, const auto &y) { return f(x) < f(y); });
}
template <class T, class U> inline int Count(const T &a, const U &v) {
return count(all(a), v);
}
template <class T, class F> inline int CountIf(const T &a, const F &f) {
return count_if(all(a), f);
}
template <class T, class U> inline int Find(const T &a, const U &v) {
return find(all(a), v) - a.begin();
}
template <class T, class F> inline int FindIf(const T &a, const F &f) {
return find_if(all(a), f) - a.begin();
}
template <class T, class U = typename T::value_type> inline U Sum(const T &a) {
return accumulate(all(a), U());
}
template <class T, class F> inline auto Sum(const T &v, const F &f) {
return accumulate(next(v.begin()), v.end(), f(v.front()),
[&](auto a, auto b) { return a + f(b); });
}
template <class T, class U> inline int Lower(const T &a, const U &v) {
return lower_bound(all(a), v) - a.begin();
}
template <class T, class U> inline int Upper(const T &a, const U &v) {
return upper_bound(all(a), v) - a.begin();
}
template <class T, class F> inline void RemoveIf(T &a, const F &f) {
a.erase(remove_if(all(a), f), a.end());
}
template <class F> inline auto Vector(size_t size, const F &f) {
vector<decay_t<result_of_t<F(size_t)>>> res(size);
for (size_t i = 0; i < size; ++i)
res[i] = f(i);
return res;
}
template <class T> inline auto Grid(size_t h, size_t w, const T &v = T()) {
return vector<vector<T>>(h, vector<T>(w, v));
}
template <class T> inline auto Slice(const T &v, size_t i, size_t len) {
return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size()))
: T();
}
template <class T, class F> inline auto Each(const T &v, const F &f) {
for (auto &i : v)
f(i);
}
template <class T, class F> inline auto Select(const T &v, const F &f) {
T res;
for (const auto &e : v)
if (f(e))
res.push_back(e);
return res;
}
template <class T, class F> inline auto Map(const T &v, const F &f) {
vector<decay_t<result_of_t<F(typename T::value_type)>>> res(v.size());
size_t i = 0;
for (const auto &e : v)
res[i++] = f(e);
return res;
}
template <class T, class F> inline auto MapIndex(const T &v, const F &f) {
vector<decay_t<result_of_t<F(size_t, typename T::value_type)>>> res(v.size());
size_t i = 0;
for (auto it = v.begin(); it != v.end(); ++it, ++i)
res[i] = f(i, *it);
return res;
}
template <class T, class F> inline auto TrueIndex(const T &v, const F &f) {
vector<size_t> res;
for (size_t i = 0; i < v.size(); ++i)
if (f(v[i]))
res.push_back(i);
return res;
}
inline string operator*(string s, size_t n) {
string ret;
for (size_t i = 0; i < n; ++i)
ret += s;
return ret;
}
template <class T> inline T Ceil(T n, T m) { return (n + m - 1) / m; }
template <class T> inline T Ceil2(T n, T m) { return Ceil(n, m) * m; }
template <class T> inline T Tri(T n) {
return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);
}
template <class T> inline T nC2(T n) {
return (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);
}
template <class T> inline T Mid(const T &l, const T &r) {
return l + (r - l) / 2;
}
template <class T> inline int pop_count(T n) { return bitset<64>(n).count(); }
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool inRange(const T &v, const T &min, const T &max) {
return min <= v && v < max;
}
template <class T = ll> inline T BIT(int b) { return T{1} << b; }
template <class T> inline T Gcd(T n, T m) { return m ? Gcd(m, n % m) : n; }
template <class T> inline T Lcm(T n, T m) { return n / Gcd(n, m) * m; }
template <class T, class U = typename T::value_type> inline U Gcdv(const T &v) {
return accumulate(next(v.begin()), v.end(), U(*v.begin()), Gcd<U>);
}
template <class T, class U = typename T::value_type> inline U Lcmv(const T &v) {
return accumulate(next(v.begin()), v.end(), U(*v.begin()), Lcm<U>);
}
template <class T> inline T Pow(T a, T n) {
T r = 1;
while (n > 0) {
if (n & 1)
r *= a;
a *= a;
n /= 2;
}
return r;
}
template <class T> inline T Powmod(T a, T n, T m = MOD) {
T r = 1;
while (n > 0) {
if (n & 1)
r = r * a % m, n--;
else
a = a * a % m, n /= 2;
}
return r;
}
} // namespace
// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
// ---------------------------------------------------------------- //
template <class T> class BinaryIndexedTree {
int n, n2;
vector<T> a;
public:
BinaryIndexedTree(int n_) : n(n_), a(n_ + 1), n2(1) {
while (n2 < n)
n2 *= 2;
n2 /= 2;
}
T operator()(int i) const { // [0, i]
assert(0 < ++i);
T res = 0;
for (; i > 0; i -= i & -i)
res += a[i];
return res;
}
T operator()(int i, int j) const { // [i, j]
return operator()(j) - (i ? operator()(i - 1) : 0);
}
T operator[](int i) const { return operator()(i, i); }
void add(int i, T x) {
assert(0 < ++i);
for (; i <= n; i += i & -i)
a[i] += x;
}
int lower_bound(T k) const {
if (k <= 0)
return 0;
int res = 0;
for (int i = n2; i > 0; i /= 2) {
if (res + i <= n && a[res + i] < k) {
k -= a[res + i];
res += i;
}
}
return res;
}
vector<int> debug() const {
vector<int> res(n);
for (int i = 0; i < n; ++i)
res[i] = operator()(i, i);
return res;
}
};
ll cnt(const VI &v) {
ll res = 0, cnt0 = 0;
rrep(i, sz(v)) {
if (v[i] == 0) {
cnt0++;
} else {
res += cnt0;
}
}
return res;
}
int main() {
string s = in;
int n = sz(s);
VVI a{VI()};
for (int i = 0; i < n;) {
if (s[i] == 'A') {
a.back().push_back(0);
i++;
} else if (i < n - 1 && s[i] == 'B' && s[i + 1] == 'C') {
a.back().push_back(1);
i += 2;
} else {
a.push_back(VI());
i++;
}
}
dump(a);
ll sum = 0;
for (auto v : a) {
sum += cnt(v);
}
out(sum);
} | #define _USE_MATH_DEFINES
#ifdef __GNUC__
#include <bits/stdc++.h>
#else
#define _CRT_SECURE_NO_WARNINGS
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)
using namespace std;
using ll = long long;
using ld = long double;
using VB = vector<bool>;
using VVB = vector<VB>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VS = vector<string>;
using VD = vector<ld>;
using PII = pair<int, int>;
using VP = vector<PII>;
using PLL = pair<ll, ll>;
using VPL = vector<PLL>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr ll inf_ll = (ll)1e18, MOD = 1000000007;
constexpr ld PI = M_PI, EPS = 1e-12;
// --- input --- //
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#define fwrite_unlocked _fwrite_nolock
#define fflush_unlocked _fflush_nolock
#endif
inline int gc() { return getchar_unlocked(); }
template <class T> inline void InputF(T &v) { cin >> v; }
inline void InputF(char &v) {
while (isspace(v = gc()))
;
}
inline void InputF(bool &v) {
char c;
InputF(c);
v = c != '0';
}
inline void InputF(string &v) {
char c;
for (InputF(c); !isspace(c); c = gc())
v += c;
}
inline void InputF(int &v) {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(long long &v) {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(double &v) {
double dp = 1;
bool neg = false, adp = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c) || c == '.'; c = gc()) {
if (c == '.')
adp = true;
else if (adp)
v += (c - '0') * (dp *= 0.1);
else
v = v * 10 + (c - '0');
}
if (neg)
v = -v;
}
template <class T, class U> inline void InputF(pair<T, U> &v) {
InputF(v.first);
InputF(v.second);
}
template <class T> inline void InputF(vector<T> &v) {
for (auto &e : v)
InputF(e);
}
template <class T> inline T InputF() {
T v;
InputF(v);
return v;
}
struct InputV {
int n, m;
InputV(int N) : n(N), m(0) {}
InputV(pair<int, int> N) : n(N.first), m(N.second) {}
template <class T> operator vector<T>() {
vector<T> v(n);
InputF(v);
return v;
}
template <class T> operator vector<vector<T>>() {
vector<vector<T>> v(n, vector<T>(m));
InputF(v);
return v;
}
};
struct Input {
template <class T> operator T() { return InputF<T>(); }
int operator--(int) {
int v;
InputF(v);
v--;
return v;
}
InputV operator[](int n) { return InputV(n); }
InputV operator[](pair<int, int> n) { return InputV(n); }
void operator()() {}
template <class H, class... T> void operator()(H &&h, T &&...t) {
InputF(h);
operator()(forward<T>(t)...);
}
template <class T> Input &operator,(T &&v) {
InputF(v);
return *this;
}
} in;
#define input(T) InputF<T>()
#define ini input(int)
#define inl input(ll)
#define ins input(string)
#define inputs(T, ...) \
T __VA_ARGS__; \
in(__VA_ARGS__)
#define INT(...) inputs(int, __VA_ARGS__)
#define LL(...) inputs(ll, __VA_ARGS__)
#define STR(...) inputs(string, __VA_ARGS__)
// --- output --- //
struct BoolStr {
const char *t, *f;
BoolStr(const char *_t, const char *_f) : t(_t), f(_f) {}
} Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
const char *d, *l;
DivStr(const char *_d, const char *_l) : d(_d), l(_l) {}
} spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"),
no_endl(" ", "");
class Output {
BoolStr B{Yes};
DivStr D{spc};
void p(int v) {
if (v < 0)
putchar_unlocked('-'), v = -v;
char b[10];
int n = 0;
while (v)
b[n++] = '0' + v % 10, v /= 10;
if (!n)
b[n++] = '0';
while (n--)
putchar_unlocked(b[n]);
}
void p(ll v) {
if (v < 0)
putchar_unlocked('-'), v = -v;
char b[20];
int n = 0;
while (v)
b[n++] = '0' + v % 10, v /= 10;
if (!n)
b[n++] = '0';
while (n--)
putchar_unlocked(b[n]);
}
void p(bool v) { p(v ? B.t : B.f); }
void p(char v) { putchar_unlocked(v); }
void p(const char *v) { fwrite_unlocked(v, 1, strlen(v), stdout); }
void p(double v) { printf("%.20f", v); }
void p(ld v) { printf("%.20Lf", v); }
template <class T> void p(const T &v) { cout << v; }
template <class T, class U> void p(const pair<T, U> &v) {
p(v.first);
p(D.d);
p(v.second);
}
template <class T> void p(const vector<T> &v) {
rep(i, sz(v)) {
if (i)
p(D.d);
p(v[i]);
}
}
template <class T> void p(const vector<vector<T>> &v) {
rep(i, sz(v)) {
if (i)
p(D.l);
p(v[i]);
}
}
public:
Output &operator()() {
p(D.l);
return *this;
}
template <class H> Output &operator()(H &&h) {
p(h);
p(D.l);
return *this;
}
template <class H, class... T> Output &operator()(H &&h, T &&...t) {
p(h);
p(D.d);
return operator()(forward<T>(t)...);
}
template <class... T> void exit(T &&...t) {
operator()(forward<T>(t)...);
std::exit(EXIT_SUCCESS);
}
Output &flush() {
fflush_unlocked(stdout);
return *this;
}
Output &set(const BoolStr &b) {
B = b;
return *this;
}
Output &set(const DivStr &d) {
D = d;
return *this;
}
Output &set(const char *t, const char *f) {
B = BoolStr(t, f);
return *this;
}
} out;
// --- step --- //
template <class T> struct Step {
class It {
T a, b, c;
public:
constexpr It() : a(T()), b(T()), c(T()) {}
constexpr It(T _b, T _c, T _s) : a(_b), b(_c), c(_s) {}
constexpr It &operator++() {
--b;
a += c;
return *this;
}
constexpr It operator++(int) {
It tmp = *this;
--b;
a += c;
return tmp;
}
constexpr const T &operator*() const { return a; }
constexpr const T *operator->() const { return &a; }
constexpr bool operator==(const It &i) const { return b == i.b; }
constexpr bool operator!=(const It &i) const { return !(b == i.b); }
constexpr T start() const { return a; }
constexpr T count() const { return b; }
constexpr T step() const { return c; }
};
constexpr Step(T b, T c, T s) : be(b, c, s) {}
constexpr It begin() const { return be; }
constexpr It end() const { return en; }
constexpr T start() const { return be.start(); }
constexpr T count() const { return be.count(); }
constexpr T step() const { return be.step(); }
constexpr T sum() const {
return start() * count() + step() * (count() * (count() - 1) / 2);
}
operator vector<T>() const { return as_vector(); }
vector<T> as_vector() const {
vector<T> res;
res.reserve(count());
each([&](T i) { res.push_back(i); });
return res;
}
template <class F> void each(const F &f) const {
for (T i : *this)
f(i);
}
template <class F> auto map(const F &f) const {
vector<decay_t<result_of_t<F(T)>>> res;
res.reserve(count());
each([&](T i) { res.push_back(f(i)); });
return res;
}
template <class F> int count_if(const F &f) const {
int res = 0;
each([&](T i) { res += static_cast<bool>(f(i)); });
return res;
}
template <class F> vector<T> select(const F &f) const {
vector<T> res;
each([&](T i) {
if (f(i))
res.push_back(i);
});
return res;
}
template <class F> auto max(const F &f) const {
auto v = map(f);
return *max_element(v.begin(), v.end());
}
template <class F> auto min(const F &f) const {
auto v = map(f);
return *min_element(v.begin(), v.end());
}
template <class F, class U = decay_t<result_of_t<F(T)>>>
auto sum(const F &f) const {
U res = 0;
each([&](T i) { res += static_cast<U>(f(i)); });
return res;
}
using value_type = T;
using iterator = It;
private:
It be, en;
};
template <class T> inline constexpr auto step(T a) { return Step<T>(0, a, 1); }
template <class T> inline constexpr auto step(T a, T b) {
return Step<T>(a, b - a, 1);
}
template <class T> inline constexpr auto step(T a, T b, T c) {
return Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);
}
// --- functions --- //
inline namespace {
template <class T> inline void Sort(T &a) { sort(all(a)); }
template <class T> inline void RSort(T &a) { sort(rall(a)); }
template <class T> inline T Sorted(T a) {
Sort(a);
return a;
}
template <class T> inline T RSorted(T a) {
RSort(a);
return a;
}
template <class T, class F> inline void Sort(T &a, const F &f) {
sort(all(a), [&](const auto &x, const auto &y) { return f(x) < f(y); });
}
template <class T, class F> inline void RSort(T &a, const F &f) {
sort(rall(a), [&](const auto &x, const auto &y) { return f(x) < f(y); });
}
template <class T> inline void Reverse(T &a) { reverse(all(a)); }
template <class T> inline void Unique(T &a) {
a.erase(unique(all(a)), a.end());
}
template <class T> inline T Reversed(T a) {
Reverse(a);
return a;
}
template <class T> inline T Uniqued(T a) {
Unique(a);
return a;
}
template <class T> inline auto Max(const T &a) { return *max_element(all(a)); }
template <class T> inline auto Min(const T &a) { return *min_element(all(a)); }
template <class T> inline int MaxPos(const T &a) {
return max_element(all(a)) - a.begin();
}
template <class T> inline int MinPos(const T &a) {
return min_element(all(a)) - a.begin();
}
template <class T, class F> inline auto Max(const T &a, const F &f) {
return *max_element(
all(a), [&](const auto &x, const auto &y) { return f(x) < f(y); });
}
template <class T, class F> inline auto Min(const T &a, const F &f) {
return *min_element(
all(a), [&](const auto &x, const auto &y) { return f(x) < f(y); });
}
template <class T, class U> inline int Count(const T &a, const U &v) {
return count(all(a), v);
}
template <class T, class F> inline int CountIf(const T &a, const F &f) {
return count_if(all(a), f);
}
template <class T, class U> inline int Find(const T &a, const U &v) {
return find(all(a), v) - a.begin();
}
template <class T, class F> inline int FindIf(const T &a, const F &f) {
return find_if(all(a), f) - a.begin();
}
template <class T, class U = typename T::value_type> inline U Sum(const T &a) {
return accumulate(all(a), U());
}
template <class T, class F> inline auto Sum(const T &v, const F &f) {
return accumulate(next(v.begin()), v.end(), f(v.front()),
[&](auto a, auto b) { return a + f(b); });
}
template <class T, class U> inline int Lower(const T &a, const U &v) {
return lower_bound(all(a), v) - a.begin();
}
template <class T, class U> inline int Upper(const T &a, const U &v) {
return upper_bound(all(a), v) - a.begin();
}
template <class T, class F> inline void RemoveIf(T &a, const F &f) {
a.erase(remove_if(all(a), f), a.end());
}
template <class F> inline auto Vector(size_t size, const F &f) {
vector<decay_t<result_of_t<F(size_t)>>> res(size);
for (size_t i = 0; i < size; ++i)
res[i] = f(i);
return res;
}
template <class T> inline auto Grid(size_t h, size_t w, const T &v = T()) {
return vector<vector<T>>(h, vector<T>(w, v));
}
template <class T> inline auto Slice(const T &v, size_t i, size_t len) {
return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size()))
: T();
}
template <class T, class F> inline auto Each(const T &v, const F &f) {
for (auto &i : v)
f(i);
}
template <class T, class F> inline auto Select(const T &v, const F &f) {
T res;
for (const auto &e : v)
if (f(e))
res.push_back(e);
return res;
}
template <class T, class F> inline auto Map(const T &v, const F &f) {
vector<decay_t<result_of_t<F(typename T::value_type)>>> res(v.size());
size_t i = 0;
for (const auto &e : v)
res[i++] = f(e);
return res;
}
template <class T, class F> inline auto MapIndex(const T &v, const F &f) {
vector<decay_t<result_of_t<F(size_t, typename T::value_type)>>> res(v.size());
size_t i = 0;
for (auto it = v.begin(); it != v.end(); ++it, ++i)
res[i] = f(i, *it);
return res;
}
template <class T, class F> inline auto TrueIndex(const T &v, const F &f) {
vector<size_t> res;
for (size_t i = 0; i < v.size(); ++i)
if (f(v[i]))
res.push_back(i);
return res;
}
inline string operator*(string s, size_t n) {
string ret;
for (size_t i = 0; i < n; ++i)
ret += s;
return ret;
}
template <class T> inline T Ceil(T n, T m) { return (n + m - 1) / m; }
template <class T> inline T Ceil2(T n, T m) { return Ceil(n, m) * m; }
template <class T> inline T Tri(T n) {
return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);
}
template <class T> inline T nC2(T n) {
return (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);
}
template <class T> inline T Mid(const T &l, const T &r) {
return l + (r - l) / 2;
}
template <class T> inline int pop_count(T n) { return bitset<64>(n).count(); }
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool inRange(const T &v, const T &min, const T &max) {
return min <= v && v < max;
}
template <class T = ll> inline T BIT(int b) { return T{1} << b; }
template <class T> inline T Gcd(T n, T m) { return m ? Gcd(m, n % m) : n; }
template <class T> inline T Lcm(T n, T m) { return n / Gcd(n, m) * m; }
template <class T, class U = typename T::value_type> inline U Gcdv(const T &v) {
return accumulate(next(v.begin()), v.end(), U(*v.begin()), Gcd<U>);
}
template <class T, class U = typename T::value_type> inline U Lcmv(const T &v) {
return accumulate(next(v.begin()), v.end(), U(*v.begin()), Lcm<U>);
}
template <class T> inline T Pow(T a, T n) {
T r = 1;
while (n > 0) {
if (n & 1)
r *= a;
a *= a;
n /= 2;
}
return r;
}
template <class T> inline T Powmod(T a, T n, T m = MOD) {
T r = 1;
while (n > 0) {
if (n & 1)
r = r * a % m, n--;
else
a = a * a % m, n /= 2;
}
return r;
}
} // namespace
// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
// ---------------------------------------------------------------- //
template <class T> class BinaryIndexedTree {
int n, n2;
vector<T> a;
public:
BinaryIndexedTree(int n_) : n(n_), a(n_ + 1), n2(1) {
while (n2 < n)
n2 *= 2;
n2 /= 2;
}
T operator()(int i) const { // [0, i]
assert(0 < ++i);
T res = 0;
for (; i > 0; i -= i & -i)
res += a[i];
return res;
}
T operator()(int i, int j) const { // [i, j]
return operator()(j) - (i ? operator()(i - 1) : 0);
}
T operator[](int i) const { return operator()(i, i); }
void add(int i, T x) {
assert(0 < ++i);
for (; i <= n; i += i & -i)
a[i] += x;
}
int lower_bound(T k) const {
if (k <= 0)
return 0;
int res = 0;
for (int i = n2; i > 0; i /= 2) {
if (res + i <= n && a[res + i] < k) {
k -= a[res + i];
res += i;
}
}
return res;
}
vector<int> debug() const {
vector<int> res(n);
for (int i = 0; i < n; ++i)
res[i] = operator()(i, i);
return res;
}
};
ll cnt(const VI &v) {
ll res = 0, cnt0 = 0;
rrep(i, sz(v)) {
if (v[i] == 0) {
cnt0++;
} else {
res += cnt0;
}
}
return res;
}
int main() {
string s = in;
int n = sz(s);
VVI a{VI()};
for (int i = 0; i < n;) {
if (s[i] == 'A') {
a.back().push_back(1);
i++;
} else if (i < n - 1 && s[i] == 'B' && s[i + 1] == 'C') {
a.back().push_back(0);
i += 2;
} else {
a.push_back(VI());
i++;
}
}
dump(a);
ll sum = 0;
for (auto v : a) {
sum += cnt(v);
}
out(sum);
} | [
"literal.number.change",
"call.arguments.change"
] | 834,150 | 834,151 | u172873334 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int, int>
#define priq priority_queue<int>
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
#define tii tuple<int, int, int>
#define Priq priority_queue<int, vi, greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll << 60)
signed main() {
string S;
cin >> S;
int N = S.size();
int cnt = 0, ans = 0;
rep(i, 0, N - 1) {
if (S[i] == 'A')
cnt++;
else if (S[i] == 'B') {
if (S[i + 1] == 'C')
ans += cnt;
else
cnt = 0;
} else
cnt = 0;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int, int>
#define priq priority_queue<int>
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
#define tii tuple<int, int, int>
#define Priq priority_queue<int, vi, greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll << 60)
signed main() {
string S;
cin >> S;
int N = S.size();
int cnt = 0, ans = 0;
rep(i, 0, N - 1) {
if (S[i] == 'A')
cnt++;
else if (S[i] == 'B') {
if (S[i + 1] == 'C') {
ans += cnt;
i++;
} else
cnt = 0;
} else
cnt = 0;
}
cout << ans << endl;
}
| [
"expression.unary.arithmetic.add"
] | 834,163 | 834,164 | u347057617 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll a, b, c, x, n;
string s, t, u;
in(s);
a = 0;
t = "";
n = s.size();
while (a < n) {
if (s[a] == 'A') {
u = 'A';
t = t + u;
} else if (s[a] == 'B') {
if (a < n - 1 && s[a + 1] == 'C') {
u = 'T';
t = t + u;
a++;
} else {
u = 'B';
t = t + u;
}
} else {
u = 'C';
t = t + u;
}
a++;
}
x = 0;
t += "XXX";
n = t.size();
a = 0;
x = 0;
rep(i, n) {
if (t[i] == 'A')
a++;
if (t[i] == 'T')
x += a;
}
out(x);
memi;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll a, b, c, x, n;
string s, t, u;
in(s);
a = 0;
t = "";
n = s.size();
while (a < n) {
if (s[a] == 'A') {
u = 'A';
t = t + u;
} else if (s[a] == 'B') {
if (a < n - 1 && s[a + 1] == 'C') {
u = 'T';
t = t + u;
a++;
} else {
u = 'B';
t = t + u;
}
} else {
u = 'C';
t = t + u;
}
a++;
}
x = 0;
t += "XXX";
n = t.size();
a = 0;
x = 0;
rep(i, n) {
if (t[i] == 'A')
a++;
else if (t[i] == 'T')
x += a;
else
a = 0;
}
out(x);
memi;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 834,203 | 834,204 | u917049698 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
long long arr[1000000];
int main() {
string s;
long long n, i, j, k, m, x, y, z;
cin >> s;
x = 0;
y = 0;
i = 0;
while (i < s.length() - 1) {
if (s[i] == 'A') {
x++;
i++;
} else if (s[i] == 'B' && s[i + 1] == 'C') {
if (x > 0) {
y = x + y;
x = 1;
i = i + 2;
} else {
i = i + 2;
}
} else {
x = 0;
i++;
}
}
cout << y << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long arr[1000000];
int main() {
string s;
long long n, i, j, k, m, x, y, z;
cin >> s;
x = 0;
y = 0;
i = 0;
while (i < s.length() - 1) {
if (s[i] == 'A') {
x++;
i++;
} else if (s[i] == 'B' && s[i + 1] == 'C') {
if (x > 0) {
y = x + y;
x = x;
i = i + 2;
} else {
i = i + 2;
}
} else {
x = 0;
i++;
}
}
cout << y << endl;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 834,207 | 834,208 | u349470793 | cpp |
p03018 | //解説AC
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int ans = 0, count_a = 0;
int len = s.length();
rep(i, len) {
if (s.at(i) == 'A')
count_a++;
if (s.at(i) == 'B' && i != len - 1) {
if (s.at(i + 1) == 'C') {
ans += count_a;
i++;
} else {
count_a = 0;
}
}
if (s.at(i) == 'C')
count_a = 0;
}
cout << ans << endl;
return 0;
} | //解説AC
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
long long ans = 0, count_a = 0;
int len = s.length();
rep(i, len) {
if (s.at(i) == 'A')
count_a++;
if (s.at(i) == 'B' && i != len - 1) {
if (s.at(i + 1) == 'C') {
ans += count_a;
i++;
} else {
count_a = 0;
}
} else if (s.at(i) == 'C')
count_a = 0;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 834,260 | 834,259 | u690475097 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
const ll MOD = (ll)1e9 + 7;
const ll HIGHINF = (ll)1e18;
int main() {
string s;
cin >> s;
ll i = 0;
ll ans = 0;
ll ac = 0;
while (i < s.size() - 1) {
if (s.at(i) == 'A') {
ac++;
i++;
} else if (s.at(i) == 'B' && s.at(i + 1) == 'C') {
if (ac > 0) {
ans += ac;
i += 2;
ac = 1;
} else {
i++;
}
} else {
ac = 0;
i++;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
const ll MOD = (ll)1e9 + 7;
const ll HIGHINF = (ll)1e18;
int main() {
string s;
cin >> s;
ll i = 0;
ll ans = 0;
ll ac = 0;
while (i < s.size() - 1) {
if (s.at(i) == 'A') {
ac++;
i++;
} else if (s.at(i) == 'B' && s.at(i + 1) == 'C') {
if (ac > 0) {
ans += ac;
i += 2;
} else {
i++;
}
} else {
ac = 0;
i++;
}
}
cout << ans << endl;
return 0;
}
| [] | 834,276 | 834,277 | u077337864 | cpp |
p03018 | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
string S;
cin >> S;
reverse(S.begin(), S.end());
ULL ans = 0;
ULL buf = 0;
for (UL i = 0; i < S.size(); i++) {
if (S[i] == 'A')
ans += buf;
if (S[i] == 'C') {
if (i == S.size() - 1)
continue;
if (S[i + 1] == 'B') {
buf++;
i++;
} else
buf = 0;
}
if (S[i] == 'B') {
buf = 0;
}
}
cout << ans << endl;
}
Problem();
};
int main() {
unique_ptr<Problem> p(new Problem());
p->Solve();
return 0;
}
Problem::Problem() { cout << fixed << setprecision(10); } | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
string S;
cin >> S;
reverse(S.begin(), S.end());
ULL ans = 0;
ULL buf = 0;
for (UL i = 0; i < S.size(); i++) {
if (S[i] == 'A')
ans += buf;
else if (S[i] == 'C') {
if (i == S.size() - 1)
continue;
if (S[i + 1] == 'B') {
buf++;
i++;
} else
buf = 0;
} else if (S[i] == 'B') {
buf = 0;
}
}
cout << ans << endl;
}
Problem();
};
int main() {
unique_ptr<Problem> p(new Problem());
p->Solve();
return 0;
}
Problem::Problem() { cout << fixed << setprecision(10); } | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 834,286 | 834,287 | u331948661 | cpp |
p03018 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
int main() {
string s;
cin >> s;
if (s.size() < 3) {
cout << 0 << endl;
return 0;
}
ll pos = 0;
ll ret = 0;
bool apart = true;
ll numA = 0;
ll numBC = 0;
while (pos < s.size()) {
if (apart) {
if (s[pos] == 'A') {
numA++;
pos++;
} else {
if (numA == 0)
pos++;
else
apart = false;
}
} else {
if (s.substr(pos, 2) == "BC") {
numBC++;
pos += 2;
} else {
if (numBC == 0) {
numA = 0;
pos++;
apart = true;
} else {
ret += numA * numBC;
numA = 1;
numBC = 0;
apart = true;
}
}
}
}
ret += numA * numBC;
cout << ret << "\n";
// for (int i = 0; i < s.size() - 2; ++i) {
// if (s.substr(i, 3) == "ABC")
// pos.push_back(i);
// }
// while (pos.size() != 0) {
// int i = pos.front();
// pos.pop_front();
// if (s.substr(i, 3) == "ABC") {
// ret++;
// s[i] = 'B';
// s[i + 1] = 'C';
// s[i + 2] = 'A';
// if (i < s.size() - 4 && s[i + 3] == 'B' && s[i + 4] == 'C')
// pos.push_front(i + 2);
// if (i > 0 && s[i - 1] == 'A')
// pos.push_front(i - 1);
// }
// }
// cout << ret << "\n";
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
int main() {
string s;
cin >> s;
if (s.size() < 3) {
cout << 0 << endl;
return 0;
}
ll pos = 0;
ll ret = 0;
bool apart = true;
ll numA = 0;
ll numBC = 0;
while (pos < s.size()) {
if (apart) {
if (s[pos] == 'A') {
numA++;
pos++;
} else {
if (numA == 0)
pos++;
else
apart = false;
}
} else {
if (s.substr(pos, 2) == "BC") {
numBC++;
pos += 2;
} else {
if (numBC == 0) {
numA = 0;
pos++;
apart = true;
// } else if (numBC == 1) {
// ret += numA * numBC;
// numBC = 0;
// apart = true;
} else {
ret += numA * numBC;
// numA = 1;
numBC = 0;
apart = true;
}
}
}
}
ret += numA * numBC;
cout << ret << "\n";
return 0;
} | [] | 834,301 | 834,302 | u756088996 | cpp |
p03018 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
int main() {
string s;
cin >> s;
if (s.size() < 3) {
cout << 0 << endl;
return 0;
}
ll pos = 0;
ll ret = 0;
bool apart = true;
ll numA = 0;
ll numBC = 0;
while (pos < s.size() - 1) {
if (apart) {
if (s[pos] == 'A') {
numA++;
pos++;
} else {
if (numA == 0)
pos++;
else
apart = false;
}
} else {
if (s.substr(pos, 2) == "BC") {
numBC++;
pos += 2;
} else {
if (numBC == 0) {
numA = 0;
pos++;
apart = true;
} else {
ret += numA * numBC;
numA = 1;
numBC = 0;
apart = true;
}
}
}
}
ret += numA * numBC;
cout << ret << "\n";
// for (int i = 0; i < s.size() - 2; ++i) {
// if (s.substr(i, 3) == "ABC")
// pos.push_back(i);
// }
// while (pos.size() != 0) {
// int i = pos.front();
// pos.pop_front();
// if (s.substr(i, 3) == "ABC") {
// ret++;
// s[i] = 'B';
// s[i + 1] = 'C';
// s[i + 2] = 'A';
// if (i < s.size() - 4 && s[i + 3] == 'B' && s[i + 4] == 'C')
// pos.push_front(i + 2);
// if (i > 0 && s[i - 1] == 'A')
// pos.push_front(i - 1);
// }
// }
// cout << ret << "\n";
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
int main() {
string s;
cin >> s;
if (s.size() < 3) {
cout << 0 << endl;
return 0;
}
ll pos = 0;
ll ret = 0;
bool apart = true;
ll numA = 0;
ll numBC = 0;
while (pos < s.size()) {
if (apart) {
if (s[pos] == 'A') {
numA++;
pos++;
} else {
if (numA == 0)
pos++;
else
apart = false;
}
} else {
if (s.substr(pos, 2) == "BC") {
numBC++;
pos += 2;
} else {
if (numBC == 0) {
numA = 0;
pos++;
apart = true;
// } else if (numBC == 1) {
// ret += numA * numBC;
// numBC = 0;
// apart = true;
} else {
ret += numA * numBC;
// numA = 1;
numBC = 0;
apart = true;
}
}
}
}
ret += numA * numBC;
cout << ret << "\n";
return 0;
} | [
"expression.operation.binary.remove"
] | 834,303 | 834,302 | u756088996 | cpp |
p03018 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; \
};
int main() {
string s;
cin >> s;
int N = s.size();
ll cnta(0);
ll ans(0);
for (int i(0); i < N; i++) {
if (s[i] == 'A')
cnta++;
else
cnta = 0;
// cout << i << " " << cnta << endl;
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ll cntbc = 0;
while (s[i + 2 + cntbc * 2 + 1] == 'B' &&
s[i + 2 + cntbc * 2 + 2] == 'C') {
cntbc++;
}
// cout <<i <<" " << cnta << " " << cntbc << endl;
// ans += cnta;
// ans += cntbc;
ans += cnta * (cntbc + 1);
i += 2 * (cntbc + 1);
cnta = 1;
}
}
cout << ans << endl;
return 0;
}
| // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; \
};
int main() {
string s;
cin >> s;
int N = s.size();
ll cnta(0);
ll ans(0);
for (int i(0); i < N; i++) {
if (s[i] == 'A')
cnta++;
else
cnta = 0;
// cout << i << " " << cnta << endl;
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ll cntbc = 0;
while (s[i + 2 + cntbc * 2 + 1] == 'B' &&
s[i + 2 + cntbc * 2 + 2] == 'C') {
cntbc++;
}
// cout <<i <<" " << cnta << " " << cntbc << endl;
// ans += cnta;
// ans += cntbc;
ans += cnta * (cntbc + 1);
i += 2 * (cntbc + 1);
// cnta = 1;
}
}
cout << ans << endl;
return 0;
}
| [] | 834,306 | 834,307 | u991846372 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define vd vector<double>
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vcc vector<vector<char>>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define X first
#define Y second
#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 rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), 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;
}
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// #define mp make_pair
//#define endl '\n'
int main() {
string s;
cin >> s;
s += "EEEEE";
int n = int(s.length());
int ans, a_count = 0;
int i = 0;
while (i < n) {
if (s[i] == 'E')
break;
if (s[i] == 'A') {
a_count++;
i++;
} else if (s[i] == 'B' && s[i + 1] == 'C') {
ans += a_count;
i += 2;
} else {
a_count = 0;
i++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define vd vector<double>
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vcc vector<vector<char>>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define X first
#define Y second
#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 rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), 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;
}
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// #define mp make_pair
//#define endl '\n'
int main() {
string s;
cin >> s;
s += "EEEEE";
int n = int(s.length());
ll ans = 0, a_count = 0;
int i = 0;
while (i < n) {
if (s[i] == 'E')
break;
if (s[i] == 'A') {
a_count++;
i++;
} else if (s[i] == 'B' && s[i + 1] == 'C') {
ans += a_count;
i += 2;
} else {
a_count = 0;
i++;
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change",
"variable_declaration.value.change"
] | 834,314 | 834,313 | u948618130 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define MOD 1000000007
#define all(v) v.begin(), v.end()
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
struct edge {
int to, cost;
};
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool prime(int a) {
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
bool kosa(double ax, double ay, double bx, double by, double cx, double cy,
double dx, double dy) { //線分の交差判定
double ta = (cx - dx) * (ay - cy) + (cy - dy) * (cx - ax);
double tb = (cx - dx) * (by - cy) + (cy - dy) * (cx - bx);
double tc = (ax - bx) * (cy - ay) + (ay - by) * (ax - cx);
double td = (ax - bx) * (dy - ay) + (ay - by) * (ax - dx);
return tc * td < 0 && ta * tb < 0;
}
int kaijo(int n) {
int ans = 1;
for (int i = 2; i <= n; i++) {
ans *= i;
ans %= MOD;
}
return ans;
}
int modpow(int a, int b) {
if (b == 0)
return 1;
if (b % 2)
return modpow(a, b - 1) * a % MOD;
return modpow(a, b / 2) * modpow(a, b / 2) % MOD;
}
int comb(int a, int b) {
return kaijo(a) * modpow(kaijo(a - b), MOD - 2) % MOD *
modpow(kaijo(b), MOD - 2) % MOD;
}
int cnt = 0, ans = 0;
string s;
signed main() {
cin >> s;
rep(i, s.size()) {
if (s[i] == 'A') {
cnt++;
} else if (s[i] == 'B' && s[i + 1] == 'C') {
ans += cnt;
cnt = 1;
i++;
} else
cnt = 0;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define MOD 1000000007
#define all(v) v.begin(), v.end()
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
struct edge {
int to, cost;
};
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool prime(int a) {
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
bool kosa(double ax, double ay, double bx, double by, double cx, double cy,
double dx, double dy) { //線分の交差判定
double ta = (cx - dx) * (ay - cy) + (cy - dy) * (cx - ax);
double tb = (cx - dx) * (by - cy) + (cy - dy) * (cx - bx);
double tc = (ax - bx) * (cy - ay) + (ay - by) * (ax - cx);
double td = (ax - bx) * (dy - ay) + (ay - by) * (ax - dx);
return tc * td < 0 && ta * tb < 0;
}
int kaijo(int n) {
int ans = 1;
for (int i = 2; i <= n; i++) {
ans *= i;
ans %= MOD;
}
return ans;
}
int modpow(int a, int b) {
if (b == 0)
return 1;
if (b % 2)
return modpow(a, b - 1) * a % MOD;
return modpow(a, b / 2) * modpow(a, b / 2) % MOD;
}
int comb(int a, int b) {
return kaijo(a) * modpow(kaijo(a - b), MOD - 2) % MOD *
modpow(kaijo(b), MOD - 2) % MOD;
}
int cnt = 0, ans = 0;
string s;
signed main() {
cin >> s;
rep(i, s.size()) {
if (s[i] == 'A') {
cnt++;
} else if (s[i] == 'B' && s[i + 1] == 'C') {
ans += cnt;
i++;
} else
cnt = 0;
}
cout << ans << endl;
return 0;
}
| [] | 834,334 | 834,335 | u006686215 | cpp |
p03018 | #include <bits/stdc++.h>
#define ll long long
#define ra return a;
#define pb push_back
#define sti stack<ll>
#define spi stack<pair<ll, ll>>
#define S second
#define msi map<string, ll>
#define msi map<string, ll>
#define mii map<ll, ll>
#define dbg(x) \
{ cerr << #x << ": " << x << endl; }
#define dbg2(x, y) \
{ cerr << #x << ": " << x << " , " << #y << ": " << y << endl; }
#define dbg3(x, y, z) \
{ \
cerr << #x << ": " << x << " , " << #y << ": " << y << " , " << #z << ": " \
<< z << endl; \
}
#define mis map<ll, string>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define mpi map<pair<ll, ll>, ll>
#define pii pair<ll, ll>
#define ppb pop_back
#define F first
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define si set<ll>
#define vs vector<string>
#define all(a) (a).begin(), (a).end()
#define sz(x) (ll) x.size()
#define hell 1000000007
#define bs binary_search
#define mp make_pair
#define qi queue<ll>
#define qs queue<string>
#define qpi queue<pair<ll, ll>>
#define qps queue<pair<ll, string>>
#define endl '\n'
#define itr(a, it) \
for (typeof(a.begin()) it = a.begin(); it != a.end(); \
it++) // This will produce const_iterator for const object and normal
// iterator for non-const object
#define ss set<string>
using namespace std;
#define N 300005
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
string s;
cin >> s;
ll n = sz(s), ans = 0, j;
ll cnt = 0;
rep(i, 0, n - 1) {
if (s[i] == 'A')
cnt++;
else if (s[i] == 'B') {
if (s[i + 1] == 'C') {
ans += cnt;
i += 1;
}
} else
cnt = 0;
// dbg2(i,cnt);
}
cout << ans;
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ra return a;
#define pb push_back
#define sti stack<ll>
#define spi stack<pair<ll, ll>>
#define S second
#define msi map<string, ll>
#define msi map<string, ll>
#define mii map<ll, ll>
#define dbg(x) \
{ cerr << #x << ": " << x << endl; }
#define dbg2(x, y) \
{ cerr << #x << ": " << x << " , " << #y << ": " << y << endl; }
#define dbg3(x, y, z) \
{ \
cerr << #x << ": " << x << " , " << #y << ": " << y << " , " << #z << ": " \
<< z << endl; \
}
#define mis map<ll, string>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define mpi map<pair<ll, ll>, ll>
#define pii pair<ll, ll>
#define ppb pop_back
#define F first
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define si set<ll>
#define vs vector<string>
#define all(a) (a).begin(), (a).end()
#define sz(x) (ll) x.size()
#define hell 1000000007
#define bs binary_search
#define mp make_pair
#define qi queue<ll>
#define qs queue<string>
#define qpi queue<pair<ll, ll>>
#define qps queue<pair<ll, string>>
#define endl '\n'
#define itr(a, it) \
for (typeof(a.begin()) it = a.begin(); it != a.end(); \
it++) // This will produce const_iterator for const object and normal
// iterator for non-const object
#define ss set<string>
using namespace std;
#define N 300005
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
string s;
cin >> s;
ll n = sz(s), ans = 0, j;
ll cnt = 0;
rep(i, 0, n - 1) {
if (s[i] == 'A')
cnt++;
else if (s[i] == 'B') {
if (s[i + 1] == 'C') {
ans += cnt;
i += 1;
} else
cnt = 0;
} else
cnt = 0;
// dbg2(i,cnt);
}
cout << ans;
}
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 834,338 | 834,339 | u231573377 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string S;
cin >> S;
int ss = S.size();
int aj = 0, ans = 0;
for (int i = 0; i < ss - 2; i++) {
if (S[i] == 'A')
aj++;
else
aj = 0;
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
ans += aj;
S[i + 2] = 'A';
aj = 0;
i++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string S;
cin >> S;
int ss = S.size();
ll aj = 0, ans = 0;
for (int i = 0; i < ss - 2; i++) {
if (S[i] == 'A')
aj++;
else
aj = 0;
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
ans += aj;
S[i + 2] = 'A';
aj--;
i++;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 834,342 | 834,343 | u045811375 | cpp |
p03018 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int N = S.length();
bool f = false;
int t = 0;
for (int i = N - 1; i >= 0; --i) {
if (S[i] == 'C') {
if (i < 1 or S[i - 1] != 'B')
f = false, t = 0;
else
f = true, ++t;
--i;
} else if (S[i] == 'A' and f) {
ans += t;
} else {
f = false;
t = 0;
}
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
long long ans = 0;
int N = S.length();
bool f = false;
long long t = 0;
for (int i = N - 1; i >= 0; --i) {
if (S[i] == 'C') {
if (i < 1 or S[i - 1] != 'B')
f = false, t = 0;
else
f = true, ++t, --i;
} else if (S[i] == 'A' and f) {
ans += t;
} else {
f = false;
t = 0;
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 834,352 | 834,353 | u107077660 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
long long calbubble(string s) {
long long ret = 0, ycnt = 0;
for (int i = s.size() - 1; i >= 0; --i) {
if (s[i] == 'y')
++ycnt;
else
ret += ycnt;
}
return ret;
}
int main() {
string s;
cin >> s;
string t = "";
long long ans = 0;
bool foo = false;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'A')
t += "x";
else if (s[i] == 'B') {
if (i == s.size() - 1)
foo = true;
else if (s[i + 1] == 'C') {
t += "y";
++i;
}
} else
foo = true;
if (foo) {
ans += calbubble(t);
t = "";
foo = false;
}
}
ans += calbubble(t);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long calbubble(string s) {
long long ret = 0, ycnt = 0;
for (int i = s.size() - 1; i >= 0; --i) {
if (s[i] == 'y')
++ycnt;
else
ret += ycnt;
}
return ret;
}
int main() {
string s;
cin >> s;
string t = "";
long long ans = 0;
bool foo = false;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'A')
t += "x";
else if (s[i] == 'B') {
if (i == s.size() - 1)
foo = true;
else if (s[i + 1] == 'C') {
t += "y";
++i;
} else
foo = true;
} else
foo = true;
if (foo) {
ans += calbubble(t);
t = "";
foo = false;
}
}
ans += calbubble(t);
cout << ans << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 834,360 | 834,361 | u604693716 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int ans = 0;
string s;
int N;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
cin >> s;
N = s.size();
int cntA = 0;
for (int i = 0; i < N; i++) {
if (i + 2 < N) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
s[i] = 'B';
s[i + 1] = 'C';
s[i + 2] = 'A';
ans += cntA + 1;
cntA = 0;
} else {
if (s[i] == 'A')
cntA++;
else
cntA = 0;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int ans = 0;
string s;
int N;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
cin >> s;
N = s.size();
int cntA = 0;
for (int i = 0; i < N; i++) {
if (i + 2 < N) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
s[i] = 'B';
s[i + 1] = 'C';
s[i + 2] = 'A';
ans += cntA + 1;
i++;
} else {
if (s[i] == 'A')
cntA++;
else
cntA = 0;
}
}
}
cout << ans << endl;
return 0;
}
| [] | 834,368 | 834,369 | u424103788 | cpp |
p03018 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
long long MOD =
1000000000 + 7; // ;//1000000000 + 7 998244353 924844033 1000000000 + 9;
constexpr long long INF = numeric_limits<LL>::max();
constexpr long long DINF = 1000000000000;
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr << #x << ": " << x << '\n'
typedef pair<LL, LL> Pll;
typedef pair<double, double> Dll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll {
LL first, second, third;
};
struct Fll {
LL first, second, third, fourth;
};
typedef pair<LL, Tll> Ptll;
#define rep(i, rept) for (LL i = 0; i < rept; i++)
#define Rrep(i, mf) for (LL i = mf - 1; i >= 0; i--)
void YN(bool f) {
if (f)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void yn(bool f) {
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
struct Edge {
LL to, cost;
};
struct edge {
LL from, to, cost;
};
vector<vector<Edge>> g;
vector<edge> ed;
vector<Pll> pv;
map<LL, LL> ma;
set<LL> st;
int di[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
LL n, m, k, p, q, w, h, ans, cnt, sum, a[3100], b[3100];
string str;
bool f[1100];
char c;
int main() {
cin >> str;
rep(i, str.size() - 1) {
if (str[i] == 'B' && str[i + 1] == 'C') {
ans += cnt;
cnt = 1;
i = i + 1;
} else if (str[i] == 'A')
cnt++;
else
cnt = 0;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
long long MOD =
1000000000 + 7; // ;//1000000000 + 7 998244353 924844033 1000000000 + 9;
constexpr long long INF = numeric_limits<LL>::max();
constexpr long long DINF = 1000000000000;
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr << #x << ": " << x << '\n'
typedef pair<LL, LL> Pll;
typedef pair<double, double> Dll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll {
LL first, second, third;
};
struct Fll {
LL first, second, third, fourth;
};
typedef pair<LL, Tll> Ptll;
#define rep(i, rept) for (LL i = 0; i < rept; i++)
#define Rrep(i, mf) for (LL i = mf - 1; i >= 0; i--)
void YN(bool f) {
if (f)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void yn(bool f) {
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
struct Edge {
LL to, cost;
};
struct edge {
LL from, to, cost;
};
vector<vector<Edge>> g;
vector<edge> ed;
vector<Pll> pv;
map<LL, LL> ma;
set<LL> st;
int di[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
LL n, m, k, p, q, w, h, ans, cnt, sum, a[3100], b[3100];
string str;
bool f[1100];
char c;
int main() {
cin >> str;
rep(i, str.size() - 1) {
if (str[i] == 'B' && str[i + 1] == 'C') {
ans += cnt;
i = i + 1;
} else if (str[i] == 'A')
cnt++;
else
cnt = 0;
}
cout << ans << endl;
return 0;
}
| [] | 834,370 | 834,371 | u202928696 | cpp |
p03018 | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
string s;
cin >> s;
ll ans = 0, A_num = 0;
for (ll i = 0; i < (ll)s.size() - 1; i++) {
if (s[i] == 'A') {
A_num++;
} else if (A_num > 0 && s[i] == 'B' && s[i + 1] == 'C') {
ans += A_num;
A_num = 1;
i += 1;
} else {
A_num = 0;
}
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
string s;
cin >> s;
ll ans = 0, A_num = 0;
for (ll i = 0; i < (ll)s.size() - 1; i++) {
if (s[i] == 'A') {
A_num++;
} else if (A_num > 0 && s[i] == 'B' && s[i + 1] == 'C') {
ans += A_num;
i += 1;
} else {
A_num = 0;
}
}
cout << ans << endl;
} | [] | 834,382 | 834,383 | u456065785 | cpp |
p03018 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int(n); i++)
#define RREP(i, m, n) for (int i = int(n) - 1; i >= int(m); --i)
#define EACH(i, c) for (auto &(i) : c)
#define all(c) begin(c), end(c)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(begin(c), end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) \
do { \
} while (0)
#define dump(x) \
do { \
} while (0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int, int>;
using VP = vector<PII>;
// struct edge {int from, to, cost;};
constexpr double EPS = 1e-10;
// constexpr double PI = acos(-1.0);
// constexpr int INF = INT_MAX;
constexpr int MOD = 1'000'000'007;
// inline void modAdd(LL &l, LL &r) {l = (l + r) % MOD;}
template <class T> inline T sqr(T x) { return x * x; }
void solve() {
string s;
cin >> s;
int n = s.size();
LL ans = 0;
int cnt = 0;
REP(i, 0, n) {
if (s[i] == 'A') {
if (i > 0 && s[i - 1] != 'A')
cnt = 0;
++cnt;
} else if (s[i] == 'C') {
if (i < 2)
continue;
if (s[i - 2] != 'A' || s[i - 1] != 'B') {
cnt = 0;
continue;
}
ans += cnt;
cnt = 1;
s[i] = 'A';
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int(n); i++)
#define RREP(i, m, n) for (int i = int(n) - 1; i >= int(m); --i)
#define EACH(i, c) for (auto &(i) : c)
#define all(c) begin(c), end(c)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(begin(c), end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) \
do { \
} while (0)
#define dump(x) \
do { \
} while (0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int, int>;
using VP = vector<PII>;
// struct edge {int from, to, cost;};
constexpr double EPS = 1e-10;
// constexpr double PI = acos(-1.0);
// constexpr int INF = INT_MAX;
constexpr int MOD = 1'000'000'007;
// inline void modAdd(LL &l, LL &r) {l = (l + r) % MOD;}
template <class T> inline T sqr(T x) { return x * x; }
void solve() {
string s;
cin >> s;
int n = s.size();
LL ans = 0;
int cnt = 0;
REP(i, 0, n) {
if (s[i] == 'A') {
if (i > 0 && s[i - 1] != 'A')
cnt = 0;
++cnt;
} else if (s[i] == 'C') {
if (i < 2)
continue;
if (s[i - 2] != 'A' || s[i - 1] != 'B') {
cnt = 0;
continue;
}
ans += cnt;
// cnt = 1;
s[i] = 'A';
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | [] | 834,415 | 834,416 | u608965386 | cpp |
p03018 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define LL long long
string s;
int main() {
cin >> s;
int n = s.size();
LL cnt = 0;
LL ret = 0;
int idx = 0;
while (idx < n - 1) {
if (s[idx] == 'A') {
cnt++;
idx++;
} else if (s[idx] == 'B' && s[idx + 1] == 'C') {
ret += (LL)cnt;
idx += 2;
} else {
idx++;
}
}
cout << ret << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define LL long long
string s;
int main() {
cin >> s;
int n = s.size();
LL cnt = 0;
LL ret = 0;
int idx = 0;
while (idx < n - 1) {
if (s[idx] == 'A') {
cnt++;
idx++;
} else if (s[idx] == 'B' && s[idx + 1] == 'C') {
ret += (LL)cnt;
idx += 2;
} else {
cnt = 0;
idx++;
}
}
cout << ret << endl;
return 0;
}
| [
"assignment.add"
] | 834,419 | 834,420 | u190952243 | cpp |
p03018 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define forr(i, a, b, c) for (int i = a; i < b; i += c)
#define forrb(i, a, b, c) for (int i = a; i > b; i -= c)
#define fori(i, n) forr(i, 0, n, 1)
#define forib(i, n) forrb(i, n - 1, -1, 1)
#define forn(i, n) forr(i, 1, n, 1)
#define fornb(i, n) forrb(i, n - 1, 0, 1)
#define fort(i, m, n) forr(i, m, n, 1)
#define fortb(i, m, n) forrb(i, n - 1, m - 1, 1)
#define forin(i, arr) fori(i, arr.size())
#define forinb(i, arr) forib(i, arr.size())
#define forrl(i, a, b, c) for (lol i = a; i < b; i += c)
#define forrbl(i, a, b, c) for (lol i = a; i > b; i -= c)
#define foril(i, n) forrl(i, 0, n, 1)
#define foribl(i, n) forrbl(i, n - 1, -1, 1)
#define fornl(i, n) forrl(i, 1, n, 1)
#define fornbl(i, n) forrbl(i, n - 1, 0, 1)
#define fortl(i, m, n) forrl(i, m, n, 1)
#define fortbl(i, m, n) forrbl(i, n - 1, m - 1, 1)
#define forinl(i, arr) foril(i, arr.size())
#define forinbl(i, arr) foribl(i, arr.size())
#define into(i) cin >> i;
#define def(i) \
lol i; \
into(i)
#define deft(t, i) \
t i; \
into(i)
#define defl(i) \
lol i; \
into(i)
#define defs(i) \
string i; \
into(i)
#define defn def(n)
#define defp def(p)
#define defm def(m)
#define defk def(k)
#define defa def(a)
#define defb def(b)
#define defc def(c)
#define defd def(d)
#define vec(a) vector<a>
#define co cout <<
#define out(a) cout << a << ' ';
#define el << endl;
#define outv(arr, n) fori(i, n){out(arr[i])} co "" el
#define cas(p) co "Case #" << p + 1 << ": ";
#define ex return 0;
#define qii queue<int>
#define sti stack<int>
#define dei deque<int>
#define con continue;
#define br break;
#define maxi 998244353
#define mod % 998244353
#define wne(arr) while (!arr.empty())
#define all(arr) arr.begin(), arr.end()
typedef vector<int> veci;
typedef long long lol;
typedef unsigned long long ulol;
typedef vector<lol> vecl;
#define table(name, n, m) vector<veci> name(n, veci(m));
#define tablel(name, n, m) vector<vecl> name(n, vecl(m));
typedef pair<lol, lol> point;
typedef pair<point, point> poin;
typedef pair<lol, point> poing;
typedef vector<point> vecp;
#define poi(x, y) make_pair(x, y)
lol gcd(lol a, lol b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
lol triangle(lol x) { return (((lol)(x + 1)) * (x)) / 2; }
point add(point x, point y) {
return make_pair(x.first + y.first, x.second + y.second);
}
lol modInverse(lol a) {
lol m = maxi;
lol y = 0, x = 1;
while (a > 1) {
lol q = a / m;
lol t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0) {
x += maxi;
}
return x;
}
vector<vector<map<int, int>>> segtree(19);
int findsum(int l, int r, int p, int lv) {
if (l >= r) {
ex
}
if (lv == 0) {
lol sum = 0;
if (segtree[lv][l].find(p) != segtree[lv][l].end()) {
sum += segtree[lv][l][p];
}
return sum + findsum(l + 1, r, p, lv);
}
if (r - l < (1 << lv)) {
return findsum(l, r, p, lv - 4);
}
int ll = (l + (1 << lv) - 1) >> lv;
int rr = r >> lv;
if (ll >= rr) {
return findsum(l, r, p, lv - 4);
}
lol sum = 0;
if (segtree[lv][ll].find(p) != segtree[lv][ll].end()) {
sum += segtree[lv][ll][p];
}
sum += findsum(l, ll << lv, p, lv - 4);
sum += findsum((ll + 1) << lv, r, p, lv);
return sum;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
defs(line) int n = line.size();
int i = 0;
lol sum = 0;
lol cur = 0;
while (i < n) {
if (line[i] == 'A') {
cur++;
}
if (line[i] == 'C') {
cur++;
}
if (line[i] == 'B') {
if (i + 1 < n && line[i + 1] == 'C') {
i++;
sum += cur;
} else {
cur = 0;
}
}
i++;
}
co sum el ex
} | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define forr(i, a, b, c) for (int i = a; i < b; i += c)
#define forrb(i, a, b, c) for (int i = a; i > b; i -= c)
#define fori(i, n) forr(i, 0, n, 1)
#define forib(i, n) forrb(i, n - 1, -1, 1)
#define forn(i, n) forr(i, 1, n, 1)
#define fornb(i, n) forrb(i, n - 1, 0, 1)
#define fort(i, m, n) forr(i, m, n, 1)
#define fortb(i, m, n) forrb(i, n - 1, m - 1, 1)
#define forin(i, arr) fori(i, arr.size())
#define forinb(i, arr) forib(i, arr.size())
#define forrl(i, a, b, c) for (lol i = a; i < b; i += c)
#define forrbl(i, a, b, c) for (lol i = a; i > b; i -= c)
#define foril(i, n) forrl(i, 0, n, 1)
#define foribl(i, n) forrbl(i, n - 1, -1, 1)
#define fornl(i, n) forrl(i, 1, n, 1)
#define fornbl(i, n) forrbl(i, n - 1, 0, 1)
#define fortl(i, m, n) forrl(i, m, n, 1)
#define fortbl(i, m, n) forrbl(i, n - 1, m - 1, 1)
#define forinl(i, arr) foril(i, arr.size())
#define forinbl(i, arr) foribl(i, arr.size())
#define into(i) cin >> i;
#define def(i) \
lol i; \
into(i)
#define deft(t, i) \
t i; \
into(i)
#define defl(i) \
lol i; \
into(i)
#define defs(i) \
string i; \
into(i)
#define defn def(n)
#define defp def(p)
#define defm def(m)
#define defk def(k)
#define defa def(a)
#define defb def(b)
#define defc def(c)
#define defd def(d)
#define vec(a) vector<a>
#define co cout <<
#define out(a) cout << a << ' ';
#define el << endl;
#define outv(arr, n) fori(i, n){out(arr[i])} co "" el
#define cas(p) co "Case #" << p + 1 << ": ";
#define ex return 0;
#define qii queue<int>
#define sti stack<int>
#define dei deque<int>
#define con continue;
#define br break;
#define maxi 998244353
#define mod % 998244353
#define wne(arr) while (!arr.empty())
#define all(arr) arr.begin(), arr.end()
typedef vector<int> veci;
typedef long long lol;
typedef unsigned long long ulol;
typedef vector<lol> vecl;
#define table(name, n, m) vector<veci> name(n, veci(m));
#define tablel(name, n, m) vector<vecl> name(n, vecl(m));
typedef pair<lol, lol> point;
typedef pair<point, point> poin;
typedef pair<lol, point> poing;
typedef vector<point> vecp;
#define poi(x, y) make_pair(x, y)
lol gcd(lol a, lol b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
lol triangle(lol x) { return (((lol)(x + 1)) * (x)) / 2; }
point add(point x, point y) {
return make_pair(x.first + y.first, x.second + y.second);
}
lol modInverse(lol a) {
lol m = maxi;
lol y = 0, x = 1;
while (a > 1) {
lol q = a / m;
lol t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0) {
x += maxi;
}
return x;
}
vector<vector<map<int, int>>> segtree(19);
int findsum(int l, int r, int p, int lv) {
if (l >= r) {
ex
}
if (lv == 0) {
lol sum = 0;
if (segtree[lv][l].find(p) != segtree[lv][l].end()) {
sum += segtree[lv][l][p];
}
return sum + findsum(l + 1, r, p, lv);
}
if (r - l < (1 << lv)) {
return findsum(l, r, p, lv - 4);
}
int ll = (l + (1 << lv) - 1) >> lv;
int rr = r >> lv;
if (ll >= rr) {
return findsum(l, r, p, lv - 4);
}
lol sum = 0;
if (segtree[lv][ll].find(p) != segtree[lv][ll].end()) {
sum += segtree[lv][ll][p];
}
sum += findsum(l, ll << lv, p, lv - 4);
sum += findsum((ll + 1) << lv, r, p, lv);
return sum;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
defs(line) int n = line.size();
int i = 0;
lol sum = 0;
lol cur = 0;
while (i < n) {
if (line[i] == 'A') {
cur++;
}
if (line[i] == 'C') {
cur = 0;
}
if (line[i] == 'B') {
if (i + 1 < n && line[i + 1] == 'C') {
i++;
sum += cur;
} else {
cur = 0;
}
}
i++;
}
co sum el ex
} | [] | 834,443 | 834,444 | u681005504 | cpp |
p03019 | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V vector
#define M unordered_map
#define S static
#define rep(i, n) for (ll i = 0LL; i < n; ++i)
#define srep(i, s, n) for (ll i = s; i < n; ++i)
#define rrep(i, n) for (ll i = n - 1LL; i >= 0LL; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define CIN(x) \
do { \
assert(!cin.eof()); \
cin >> x; \
assert(!cin.fail()); \
} while (0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T>>;
///////////////////////////////////////////////////////////////////////////////
template <typename TT, typename T> T get_m(M<TT, T> &m, TT k, T default_value) {
if (m.find(k) == m.end())
return m[k] = default_value;
return m[k];
}
template <typename TT, typename T> void incr_m(M<TT, T> &m, TT k) {
if (m.find(k) == m.end())
m[k] = 0;
m[k]++;
}
template <typename TT, typename T> void incr_m(map<TT, T> &m, TT k) {
if (m.find(k) == m.end())
m[k] = 0;
m[k]++;
}
void llin(ll &a) { CIN(a); }
void llinl1(V<ll> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a;
CIN(a);
v.push_back(a);
}
}
void llinl2(V<t2> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b;
CIN(a >> b);
v.push_back(t2(a, b));
}
}
void llinl3(V<t3> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b, c;
CIN(a >> b >> c);
v.push_back(t3(a, b, c));
}
}
void llinl4(V<t4> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b, c, d;
CIN(a >> b >> c >> d);
v.push_back(t4(a, b, c, d));
}
}
void llina(V<ll> &v, ll count) { llinl1(v, count); }
template <typename T> void sort(V<T> &v) { sort(v.begin(), v.end()); }
template <typename T> void sort_reverse(V<T> &v) {
sort(v.begin(), v.end(), greater<T>());
}
template <typename T> void _debug_print(T x) { cout << x << endl; }
void _debug_print(const t2 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
cout << "-- " << x1 << " -- " << x2 << endl;
}
void _debug_print(const t3 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}
void _debug_print(const t4 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
ll x4 = get<3>(x);
cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << " -- " << x4 << endl;
}
template <typename T> void _debug_print(T xarray[], ll n) {
rep(i, n) _debug_print(xarray[i]);
}
template <typename T> void _debug_print(const V<T> &xlist) {
for (auto x : xlist) {
cout << "-- ";
_debug_print(x);
}
}
template <typename T> void _debug_print(const set<T> &xset) {
for (auto x : xset) {
cout << "-- ";
_debug_print(x);
}
}
template <typename TT, typename T> void _debug_print(const M<TT, T> &xlist) {
for (auto x : xlist) {
TT k = x.first;
T v = x.second;
cout << "====" << endl;
cout << "K=";
_debug_print(k);
cout << "V=";
_debug_print(v);
}
}
template <typename TT, typename T> void _debug_print(const map<TT, T> &xlist) {
for (auto x : xlist) {
TT k = x.first;
T v = x.second;
cout << "====" << endl;
cout << "K=";
_debug_print(k);
cout << "V=";
_debug_print(v);
}
}
void _debug_print_time(const char *prefix) {
struct timeval tv;
gettimeofday(&tv, NULL);
#if DEBUG
struct tm *tm = localtime(&tv.tv_sec);
#endif
debug_printf("-- %s %02d:%02d:%02d.%06ld\n", prefix, tm->tm_hour, tm->tm_min,
tm->tm_sec, tv.tv_usec);
}
///////////////////////////////////////////////////////////////////////////////
void _main();
int main() {
cout << setprecision(12);
#if !DEBUG
ios::sync_with_stdio(false);
cin.tie(0);
#endif
_main();
return 0;
}
void _main() {
ll n;
llin(n);
ll max_a;
llin(max_a);
V<t3> blulist;
llinl3(blulist, n);
bool allmax = true;
for (auto blu : blulist) {
ll b = get<0>(blu);
if (b < max_a)
allmax = false;
}
if (allmax) {
cout << max_a * n << endl;
return;
}
ll aim = 0;
for (auto blu : blulist) {
ll b = get<0>(blu);
ll left = get<1>(blu);
ll right = get<2>(blu);
aim += b * left;
}
debug_printf("---- aim = %lld\n", aim);
V<t4> incr_blulist;
rep(i, n) {
ll b = get<0>(blulist[i]);
ll left = get<1>(blulist[i]);
ll right = get<2>(blulist[i]);
incr_blulist.pb(t4(b * left + (max_a - b) * right, b, left, right));
}
sort_reverse(incr_blulist);
ll base = 0;
ll end = 0;
for (auto item : incr_blulist) {
ll incr = get<0>(item);
ll b = get<1>(item);
ll left = get<2>(item);
ll right = get<3>(item);
debug_printf("--- base=%lld incr=%lld b=%lld left=%lld right=%lld\n", base,
incr, b, left, right);
if (base + incr <= aim) {
base += incr;
end++;
} else
break;
}
ll min_append = max_a;
rep(i, n) {
ll lbase = base;
if (i < end) {
lbase -= get<0>(incr_blulist[i]);
lbase += get<0>(incr_blulist[end]);
}
ll incr = get<0>(incr_blulist[i]);
ll b = get<1>(incr_blulist[i]);
ll left = get<2>(incr_blulist[i]);
ll right = get<3>(incr_blulist[i]);
ll laim = aim - lbase;
assert(laim > 0);
ll floor = 0;
ll ceil = max_a;
ll nowpos = (floor + ceil) / 2LL;
ll append = max_a;
for (; floor <= ceil; nowpos = (floor + ceil) / 2LL) {
ll lincr = left * min(nowpos, b);
lincr += right * max(0LL, nowpos - b);
if (lincr < laim) {
floor = nowpos + 1LL;
} else {
ceil = nowpos - 1LL;
append = min(append, nowpos);
}
}
min_append = min(min_append, append);
}
debug_printf("---- ans\n");
cout << end * max_a + min_append << endl;
}
///////////////////////////////////////////////////////////////////////////////
| ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V vector
#define M unordered_map
#define S static
#define rep(i, n) for (ll i = 0LL; i < n; ++i)
#define srep(i, s, n) for (ll i = s; i < n; ++i)
#define rrep(i, n) for (ll i = n - 1LL; i >= 0LL; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define CIN(x) \
do { \
assert(!cin.eof()); \
cin >> x; \
assert(!cin.fail()); \
} while (0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T>>;
///////////////////////////////////////////////////////////////////////////////
template <typename TT, typename T> T get_m(M<TT, T> &m, TT k, T default_value) {
if (m.find(k) == m.end())
return m[k] = default_value;
return m[k];
}
template <typename TT, typename T> void incr_m(M<TT, T> &m, TT k) {
if (m.find(k) == m.end())
m[k] = 0;
m[k]++;
}
template <typename TT, typename T> void incr_m(map<TT, T> &m, TT k) {
if (m.find(k) == m.end())
m[k] = 0;
m[k]++;
}
void llin(ll &a) { CIN(a); }
void llinl1(V<ll> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a;
CIN(a);
v.push_back(a);
}
}
void llinl2(V<t2> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b;
CIN(a >> b);
v.push_back(t2(a, b));
}
}
void llinl3(V<t3> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b, c;
CIN(a >> b >> c);
v.push_back(t3(a, b, c));
}
}
void llinl4(V<t4> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b, c, d;
CIN(a >> b >> c >> d);
v.push_back(t4(a, b, c, d));
}
}
void llina(V<ll> &v, ll count) { llinl1(v, count); }
template <typename T> void sort(V<T> &v) { sort(v.begin(), v.end()); }
template <typename T> void sort_reverse(V<T> &v) {
sort(v.begin(), v.end(), greater<T>());
}
template <typename T> void _debug_print(T x) { cout << x << endl; }
void _debug_print(const t2 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
cout << "-- " << x1 << " -- " << x2 << endl;
}
void _debug_print(const t3 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}
void _debug_print(const t4 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
ll x4 = get<3>(x);
cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << " -- " << x4 << endl;
}
template <typename T> void _debug_print(T xarray[], ll n) {
rep(i, n) _debug_print(xarray[i]);
}
template <typename T> void _debug_print(const V<T> &xlist) {
for (auto x : xlist) {
cout << "-- ";
_debug_print(x);
}
}
template <typename T> void _debug_print(const set<T> &xset) {
for (auto x : xset) {
cout << "-- ";
_debug_print(x);
}
}
template <typename TT, typename T> void _debug_print(const M<TT, T> &xlist) {
for (auto x : xlist) {
TT k = x.first;
T v = x.second;
cout << "====" << endl;
cout << "K=";
_debug_print(k);
cout << "V=";
_debug_print(v);
}
}
template <typename TT, typename T> void _debug_print(const map<TT, T> &xlist) {
for (auto x : xlist) {
TT k = x.first;
T v = x.second;
cout << "====" << endl;
cout << "K=";
_debug_print(k);
cout << "V=";
_debug_print(v);
}
}
void _debug_print_time(const char *prefix) {
struct timeval tv;
gettimeofday(&tv, NULL);
#if DEBUG
struct tm *tm = localtime(&tv.tv_sec);
#endif
debug_printf("-- %s %02d:%02d:%02d.%06ld\n", prefix, tm->tm_hour, tm->tm_min,
tm->tm_sec, tv.tv_usec);
}
///////////////////////////////////////////////////////////////////////////////
void _main();
int main() {
cout << setprecision(12);
#if !DEBUG
ios::sync_with_stdio(false);
cin.tie(0);
#endif
_main();
return 0;
}
void _main() {
ll n;
llin(n);
ll max_a;
llin(max_a);
V<t3> blulist;
llinl3(blulist, n);
bool allmax = true;
for (auto blu : blulist) {
ll b = get<0>(blu);
if (b < max_a)
allmax = false;
}
if (allmax) {
cout << max_a * n << endl;
return;
}
ll aim = 0;
for (auto blu : blulist) {
ll b = get<0>(blu);
ll left = get<1>(blu);
ll right = get<2>(blu);
aim += b * left;
}
debug_printf("---- aim = %lld\n", aim);
V<t4> incr_blulist;
rep(i, n) {
ll b = get<0>(blulist[i]);
ll left = get<1>(blulist[i]);
ll right = get<2>(blulist[i]);
incr_blulist.pb(t4(b * left + (max_a - b) * right, b, left, right));
}
sort_reverse(incr_blulist);
ll base = 0;
ll end = 0;
for (auto item : incr_blulist) {
ll incr = get<0>(item);
ll b = get<1>(item);
ll left = get<2>(item);
ll right = get<3>(item);
debug_printf("--- base=%lld incr=%lld b=%lld left=%lld right=%lld\n", base,
incr, b, left, right);
if (base + incr <= aim) {
base += incr;
end++;
} else
break;
}
ll min_append = max_a;
rep(i, n) {
ll lbase = base;
if (i < end) {
lbase -= get<0>(incr_blulist[i]);
lbase += get<0>(incr_blulist[end]);
}
ll incr = get<0>(incr_blulist[i]);
ll b = get<1>(incr_blulist[i]);
ll left = get<2>(incr_blulist[i]);
ll right = get<3>(incr_blulist[i]);
ll laim = aim - lbase;
assert(laim >= 0);
ll floor = 0;
ll ceil = max_a;
ll nowpos = (floor + ceil) / 2LL;
ll append = max_a;
for (; floor <= ceil; nowpos = (floor + ceil) / 2LL) {
ll lincr = left * min(nowpos, b);
lincr += right * max(0LL, nowpos - b);
if (lincr < laim) {
floor = nowpos + 1LL;
} else {
ceil = nowpos - 1LL;
append = min(append, nowpos);
}
}
min_append = min(min_append, append);
}
debug_printf("---- ans\n");
cout << end * max_a + min_append << endl;
}
///////////////////////////////////////////////////////////////////////////////
| [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 834,461 | 834,462 | u167931717 | cpp |
p03019 | #include <bits/stdc++.h>
#define owo(i, a, b) for (int i = (a); i < (b); ++i)
#define uwu(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout << "ayaya~" << endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
gpu_hash_map<int, int> mp;*/
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
const ll root = 62;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll binpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % MOD;
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
ll modInv(ll a) { return binpow(a, MOD - 2); }
const double PI = acos(-1);
const double eps = -1e6;
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll NINFLL = 0xc0c0c0c0c0c0c0c0;
const int mxN = 100001;
int n, x;
int arr[mxN];
array<ll, 2> lr[mxN];
pair<ll, int> takeval[mxN];
ll psum[mxN];
ll bad = 0;
int main() {
// freopen("greedy.in", "r", stdin);
// freopen("file.out", "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
cin.tie(0)->sync_with_stdio(0);
cin >> n >> x;
owo(i, 0, n) {
cin >> arr[i] >> lr[i][0] >> lr[i][1];
bad -= 1LL * lr[i][0] * arr[i];
takeval[i].first = arr[i] * lr[i][0] + (x - arr[i]) * lr[i][1];
takeval[i].second = i;
}
sort(takeval, takeval + n);
reverse(takeval, takeval + n);
owo(i, 0, n) { psum[i + 1] = psum[i] + takeval[i].first; }
ll l = 0;
ll r = 1LL * n * x;
while (l < r) {
ll deficit = bad;
ll mid = (l + r) / 2;
int tt = mid / x;
int over = mid - tt * x;
owo(i, 0, n) {
ll curr = 0;
curr += psum[tt];
if (i < tt && tt != n) {
curr -= takeval[i].first;
curr += takeval[tt].first;
}
int id = takeval[i].second;
curr += 1LL * min(over, arr[i]) * lr[id][0] +
1LL * max(0, over - arr[i]) * lr[i][1];
deficit = max(deficit, bad + curr);
}
if (deficit >= 0) {
r = mid;
} else {
l = mid + 1;
}
}
cout << l << "\n";
return 0;
} | #include <bits/stdc++.h>
#define owo(i, a, b) for (int i = (a); i < (b); ++i)
#define uwu(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout << "ayaya~" << endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
gpu_hash_map<int, int> mp;*/
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
const ll root = 62;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll binpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % MOD;
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
ll modInv(ll a) { return binpow(a, MOD - 2); }
const double PI = acos(-1);
const double eps = -1e6;
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll NINFLL = 0xc0c0c0c0c0c0c0c0;
const int mxN = 100001;
int n, x;
int arr[mxN];
array<ll, 2> lr[mxN];
pair<ll, int> takeval[mxN];
ll psum[mxN];
ll bad = 0;
int main() {
// freopen("greedy.in", "r", stdin);
// freopen("file.out", "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
cin.tie(0)->sync_with_stdio(0);
cin >> n >> x;
owo(i, 0, n) {
cin >> arr[i] >> lr[i][0] >> lr[i][1];
bad -= 1LL * lr[i][0] * arr[i];
takeval[i].first = arr[i] * lr[i][0] + (x - arr[i]) * lr[i][1];
takeval[i].second = i;
}
sort(takeval, takeval + n);
reverse(takeval, takeval + n);
owo(i, 0, n) { psum[i + 1] = psum[i] + takeval[i].first; }
ll l = 0;
ll r = 1LL * n * x;
while (l < r) {
ll deficit = bad;
ll mid = (l + r) / 2;
int tt = mid / x;
int over = mid - tt * x;
owo(i, 0, n) {
ll curr = 0;
curr += psum[tt];
if (i < tt && tt != n) {
curr -= takeval[i].first;
curr += takeval[tt].first;
}
int id = takeval[i].second;
curr += 1LL * min(over, arr[id]) * lr[id][0] +
1LL * max(0, over - arr[id]) * lr[id][1];
deficit = max(deficit, bad + curr);
}
if (deficit >= 0) {
r = mid;
} else {
l = mid + 1;
}
}
cout << l << "\n";
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 834,463 | 834,464 | u532199771 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 300010
ll n, x;
struct ver {
ll b, l, r;
ll allsum() { return b * l + (x - b) * r; }
ll opp() { return b * l; }
ver(ll b, ll l, ll r) { this->b = b, this->l = l, this->r = r; }
};
bool operator<(const ver &a, const ver &b) {
ll vl = a.b * a.l + (x - a.b) * a.r;
ll vr = b.b * b.l + (x - b.b) * b.r;
return vl > vr;
};
vector<ver> v;
ll cs[N], oppsum;
bool judge(ll k, ll t) {
ll cost = k / x;
if (cost >= n)
return 1;
ll res = min(k % x, v[t].b) * v[t].l + max(0LL, k % x - v[t].b) * v[t].r;
res += cs[min(t, cost)] - cs[0];
res += max(0LL, cs[cost] - cs[t + 1]);
return oppsum <= res;
}
bool solve(ll k) {
for (int i = 0; i < n; i++) {
if (judge(k, i))
return 1;
}
return 0;
}
int main() {
cin >> n >> x;
for (int i = 0; i < n; i++) {
ll b, l, r;
cin >> b >> l >> r;
v.push_back(ver(b, l, r));
}
sort(v.begin(), v.end());
oppsum = 0;
for (auto t : v)
oppsum += t.opp();
cs[0] = 0;
for (int i = 0; i < v.size(); i++) {
cs[i + 1] = cs[i] + v[i].allsum();
}
ll l = -1, r = 1e17, m;
while (l < r - 1) {
m = (l + r) >> 1;
if (solve(m))
r = m;
else
l = m;
}
cout << r << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 300010
ll n, x;
struct ver {
ll b, l, r;
ll allsum() { return b * l + (x - b) * r; }
ll opp() { return b * l; }
ver(ll b, ll l, ll r) { this->b = b, this->l = l, this->r = r; }
};
bool operator<(const ver &a, const ver &b) {
ll vl = a.b * a.l + (x - a.b) * a.r;
ll vr = b.b * b.l + (x - b.b) * b.r;
return vl > vr;
};
vector<ver> v;
ll cs[N], oppsum;
bool judge(ll k, ll t) {
ll cost = k / x;
if (cost >= n)
return 1;
ll res = min(k % x, v[t].b) * v[t].l + max(0LL, k % x - v[t].b) * v[t].r;
res += cs[min(t, cost)] - cs[0];
res += max(0LL, cs[cost + 1] - cs[t + 1]);
return oppsum <= res;
}
bool solve(ll k) {
for (int i = 0; i < n; i++) {
if (judge(k, i))
return 1;
}
return 0;
}
int main() {
cin >> n >> x;
for (int i = 0; i < n; i++) {
ll b, l, r;
cin >> b >> l >> r;
v.push_back(ver(b, l, r));
}
sort(v.begin(), v.end());
oppsum = 0;
for (auto t : v)
oppsum += t.opp();
cs[0] = 0;
for (int i = 0; i < v.size(); i++) {
cs[i + 1] = cs[i] + v[i].allsum();
}
ll l = -1, r = 1e17, m;
while (l < r - 1) {
m = (l + r) >> 1;
if (solve(m))
r = m;
else
l = m;
}
cout << r << endl;
return 0;
}
| [
"assignment.change"
] | 834,495 | 834,496 | u924885571 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, s, t) for (int i = s; i < t; i++)
const int MAXNUM = 150005;
int n;
ll x;
struct node {
ll b, l, r;
bool operator<(const node &nn) const {
return x * r - b * (r - l) > x * nn.r - nn.b * (nn.r - nn.l);
}
};
node alln[MAXNUM];
int main() {
scanf("%d%lld", &n, &x);
ll sum = 0;
rep(i, 1, n + 1) scanf("%lld%lld%lld", &alln[i].b, &alln[i].l, &alln[i].r),
sum += alln[i].b * alln[i].l;
sort(alln + 1, alln + n + 1);
ll nownum = 0, r = 0;
int k = 0;
rep(i, 1, n + 1) {
if (nownum + x * alln[i].r - alln[i].b * (alln[i].r - alln[i].l) > sum) {
k = i;
break;
}
nownum += x * alln[i].r - alln[i].b * (alln[i].r - alln[i].l), r += x;
}
if (nownum == sum) {
printf("%lld\n", r);
return 0;
}
ll res = 1e18;
rep(i, 1, k) {
ll xx =
sum - (nownum - x * alln[i].r - alln[i].b * (alln[i].r - alln[i].l));
xx -= x * alln[k].r - alln[k].b * (alln[k].r - alln[k].l);
res = min(res, r + (xx / alln[i].l + (xx % alln[i].l != 0)));
xx += alln[i].b * (alln[i].r - alln[i].l);
res = min(res, r + (xx / alln[i].r + (xx % alln[i].r != 0)));
}
rep(i, k, n + 1) {
ll xx = sum - nownum;
res = min(res, r + (xx / alln[i].l + (xx % alln[i].l != 0)));
xx += alln[i].b * (alln[i].r - alln[i].l);
res = min(res, r + (xx / alln[i].r + (xx % alln[i].r != 0)));
}
printf("%lld\n", res);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, s, t) for (int i = s; i < t; i++)
const int MAXNUM = 150005;
int n;
ll x;
struct node {
ll b, l, r;
bool operator<(const node &nn) const {
return x * r - b * (r - l) > x * nn.r - nn.b * (nn.r - nn.l);
}
};
node alln[MAXNUM];
int main() {
scanf("%d%lld", &n, &x);
ll sum = 0;
rep(i, 1, n + 1) scanf("%lld%lld%lld", &alln[i].b, &alln[i].l, &alln[i].r),
sum += alln[i].b * alln[i].l;
sort(alln + 1, alln + n + 1);
ll nownum = 0, r = 0;
int k = 0;
rep(i, 1, n + 1) {
if (nownum + x * alln[i].r - alln[i].b * (alln[i].r - alln[i].l) > sum) {
k = i;
break;
}
nownum += x * alln[i].r - alln[i].b * (alln[i].r - alln[i].l), r += x;
}
if (nownum == sum) {
printf("%lld\n", r);
return 0;
}
ll res = 1e18;
rep(i, 1, k) {
ll xx =
sum - (nownum - x * alln[i].r + alln[i].b * (alln[i].r - alln[i].l));
xx -= x * alln[k].r - alln[k].b * (alln[k].r - alln[k].l);
res = min(res, r + (xx / alln[i].l + (xx % alln[i].l != 0)));
xx += alln[i].b * (alln[i].r - alln[i].l);
res = min(res, r + (xx / alln[i].r + (xx % alln[i].r != 0)));
}
rep(i, k, n + 1) {
ll xx = sum - nownum;
res = min(res, r + (xx / alln[i].l + (xx % alln[i].l != 0)));
xx += alln[i].b * (alln[i].r - alln[i].l);
res = min(res, r + (xx / alln[i].r + (xx % alln[i].r != 0)));
}
printf("%lld\n", res);
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 834,510 | 834,511 | u930038564 | cpp |
p03019 | #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 88 88 !//
//! 88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b. !//
//! 88 88 88ooood8 88' '88 88' '88 88ooood8 88' '88 !//
//! 88 88 88. ... 88. .88 88. .88 88. ... 88 !//
//! dP dP '88888P' '88888P8 '88888P8 '88888P' dP !//
//!===========================================================!//
template <typename T, typename A>
std::istream &operator>>(std::istream &is, std::vector<T, A> &v) {
for (auto &e : v) {
is >> e;
}
return is;
}
template <typename T> T read() {
T v;
return std::cin >> v, v;
}
template <typename T> std::vector<T> readVec(const std::size_t l) {
std::vector<T> v(l);
for (auto &e : v) {
std::cin >> e;
}
return v;
}
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T> constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F> constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T> bool chmin(T &a, const T &b) {
return (a > b ? a = b, true : false);
}
template <typename T> bool chmax(T &a, const T &b) {
return (a < b ? a = b, true : false);
}
template <typename T> std::vector<T> Vec(const std::size_t n, T v) {
return std::vector<T>(n, v);
}
template <class... Args> auto Vec(const std::size_t n, Args... args) {
return std::vector<decltype(Vec(args...))>(n, Vec(args...));
}
template <typename T> constexpr T popCount(const T u) {
#ifdef __has_builtin
return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
unsigned long long v = static_cast<unsigned long long>(u);
return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL),
v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL),
v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL,
static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T> constexpr T log2p1(const T u) {
#ifdef __has_builtin
return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
unsigned long long v = static_cast<unsigned long long>(u);
return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2),
v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32),
popCount(v);
#endif
}
template <typename T> constexpr T clog(const T v) {
return v == 0 ? T(0) : log2p1(v - 1);
}
template <typename T> constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T> constexpr T lsbp1(const T v) {
#ifdef __has_builtin
return __builtin_ffsll(v);
#else
return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T> constexpr bool ispow2(const T v) {
return popCount(v) == 1;
}
template <typename T> constexpr T ceil2(const T v) {
return v == 0 ? T(1) : T(1) << log2p1(v - 1);
}
template <typename T> constexpr T floor2(const T v) {
return v == 0 ? T(0) : T(1) << (log2p1(v) - 1);
}
//!============================================!//
//! 8888ba.88ba oo !//
//! 88 '8b '8b !//
//! 88 88 88 .d8888b. dP 88d888b. !//
//! 88 88 88 88' '88 88 88' '88 !//
//! 88 88 88 88. .88 88 88 88 !//
//! dP dP dP '88888P8 dP dP dP !//
//!============================================!//
int main() {
const int N = read<int>();
const ll X = read<ll>();
std::vector<ll> b(N), l(N), u(N);
ll ans = 0;
for (int i = 0; i < N; i++) {
std::cin >> b[i] >> l[i] >> u[i], ans += b[i];
}
std::vector<int> ind(N);
std::iota(ind.begin(), ind.end(), 0);
std::sort(ind.begin(), ind.end(), [&](const int i, const int j) {
return l[i] * b[i] + u[i] * (X - b[i]) > l[j] * b[j] + u[j] * (X - b[j]);
});
auto ok = [&](const ll U) -> bool {
std::vector<ll> a(N, 0LL);
ll R = U;
int p = -1;
for (int i = 0; i < N and U > 0; i++) {
a[ind[i]] = std::min(X, R), R -= a[ind[i]];
if (R == 0) {
p = i;
}
}
ll score = 0;
for (int i = 0; i < N; i++) {
score += (a[ind[i]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[i]] - b[ind[i]]);
}
for (int i = 0; i < N; i++) {
ll S = score;
S -= (a[ind[p]] < b[ind[p]] ? l[ind[p]] : u[ind[p]]) *
(a[ind[p]] - b[ind[p]]);
S -= (a[ind[i]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[i]] - b[ind[i]]);
S += (a[ind[i]] < b[ind[p]] ? l[ind[p]] : u[ind[p]]) *
(a[ind[i]] - b[ind[p]]);
S += (a[ind[p]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[p]] - b[ind[i]]);
if (S >= 0) {
return true;
}
}
return false;
};
ll inf = -1, sup = X * (ll)N + 1LL;
while (sup - inf > 1) {
const ll mid = (inf + sup) / 2LL;
(ok(mid) ? sup : inf) = mid;
}
std::cout << sup << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 88 88 !//
//! 88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b. !//
//! 88 88 88ooood8 88' '88 88' '88 88ooood8 88' '88 !//
//! 88 88 88. ... 88. .88 88. .88 88. ... 88 !//
//! dP dP '88888P' '88888P8 '88888P8 '88888P' dP !//
//!===========================================================!//
template <typename T, typename A>
std::istream &operator>>(std::istream &is, std::vector<T, A> &v) {
for (auto &e : v) {
is >> e;
}
return is;
}
template <typename T> T read() {
T v;
return std::cin >> v, v;
}
template <typename T> std::vector<T> readVec(const std::size_t l) {
std::vector<T> v(l);
for (auto &e : v) {
std::cin >> e;
}
return v;
}
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T> constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F> constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T> bool chmin(T &a, const T &b) {
return (a > b ? a = b, true : false);
}
template <typename T> bool chmax(T &a, const T &b) {
return (a < b ? a = b, true : false);
}
template <typename T> std::vector<T> Vec(const std::size_t n, T v) {
return std::vector<T>(n, v);
}
template <class... Args> auto Vec(const std::size_t n, Args... args) {
return std::vector<decltype(Vec(args...))>(n, Vec(args...));
}
template <typename T> constexpr T popCount(const T u) {
#ifdef __has_builtin
return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
unsigned long long v = static_cast<unsigned long long>(u);
return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL),
v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL),
v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL,
static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T> constexpr T log2p1(const T u) {
#ifdef __has_builtin
return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
unsigned long long v = static_cast<unsigned long long>(u);
return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2),
v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32),
popCount(v);
#endif
}
template <typename T> constexpr T clog(const T v) {
return v == 0 ? T(0) : log2p1(v - 1);
}
template <typename T> constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T> constexpr T lsbp1(const T v) {
#ifdef __has_builtin
return __builtin_ffsll(v);
#else
return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T> constexpr bool ispow2(const T v) {
return popCount(v) == 1;
}
template <typename T> constexpr T ceil2(const T v) {
return v == 0 ? T(1) : T(1) << log2p1(v - 1);
}
template <typename T> constexpr T floor2(const T v) {
return v == 0 ? T(0) : T(1) << (log2p1(v) - 1);
}
//!============================================!//
//! 8888ba.88ba oo !//
//! 88 '8b '8b !//
//! 88 88 88 .d8888b. dP 88d888b. !//
//! 88 88 88 88' '88 88 88' '88 !//
//! 88 88 88 88. .88 88 88 88 !//
//! dP dP dP '88888P8 dP dP dP !//
//!============================================!//
int main() {
const int N = read<int>();
const ll X = read<ll>();
std::vector<ll> b(N), l(N), u(N);
ll ans = 0;
for (int i = 0; i < N; i++) {
std::cin >> b[i] >> l[i] >> u[i], ans += b[i];
}
std::vector<int> ind(N);
std::iota(ind.begin(), ind.end(), 0);
std::sort(ind.begin(), ind.end(), [&](const int i, const int j) {
return l[i] * b[i] + u[i] * (X - b[i]) > l[j] * b[j] + u[j] * (X - b[j]);
});
auto ok = [&](const ll U) -> bool {
std::vector<ll> a(N, 0LL);
ll R = U;
int p = -1;
for (int i = 0; i < N and R > 0; i++) {
a[ind[i]] = std::min(X, R), R -= a[ind[i]];
if (R == 0) {
p = i;
}
}
ll score = 0;
for (int i = 0; i < N; i++) {
score += (a[ind[i]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[i]] - b[ind[i]]);
}
for (int i = 0; i < N; i++) {
ll S = score;
S -= (a[ind[p]] < b[ind[p]] ? l[ind[p]] : u[ind[p]]) *
(a[ind[p]] - b[ind[p]]);
S -= (a[ind[i]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[i]] - b[ind[i]]);
S += (a[ind[i]] < b[ind[p]] ? l[ind[p]] : u[ind[p]]) *
(a[ind[i]] - b[ind[p]]);
S += (a[ind[p]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[p]] - b[ind[i]]);
if (S >= 0) {
return true;
}
}
return false;
};
ll inf = -1, sup = X * (ll)N + 1LL;
while (sup - inf > 1) {
const ll mid = (inf + sup) / 2LL;
(ok(mid) ? sup : inf) = mid;
}
std::cout << sup << std::endl;
return 0;
}
| [
"identifier.change"
] | 834,516 | 834,517 | u603303736 | cpp |
p03019 | #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 88 88 !//
//! 88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b. !//
//! 88 88 88ooood8 88' '88 88' '88 88ooood8 88' '88 !//
//! 88 88 88. ... 88. .88 88. .88 88. ... 88 !//
//! dP dP '88888P' '88888P8 '88888P8 '88888P' dP !//
//!===========================================================!//
template <typename T, typename A>
std::istream &operator>>(std::istream &is, std::vector<T, A> &v) {
for (auto &e : v) {
is >> e;
}
return is;
}
template <typename T> T read() {
T v;
return std::cin >> v, v;
}
template <typename T> std::vector<T> readVec(const std::size_t l) {
std::vector<T> v(l);
for (auto &e : v) {
std::cin >> e;
}
return v;
}
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T> constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F> constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T> bool chmin(T &a, const T &b) {
return (a > b ? a = b, true : false);
}
template <typename T> bool chmax(T &a, const T &b) {
return (a < b ? a = b, true : false);
}
template <typename T> std::vector<T> Vec(const std::size_t n, T v) {
return std::vector<T>(n, v);
}
template <class... Args> auto Vec(const std::size_t n, Args... args) {
return std::vector<decltype(Vec(args...))>(n, Vec(args...));
}
template <typename T> constexpr T popCount(const T u) {
#ifdef __has_builtin
return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
unsigned long long v = static_cast<unsigned long long>(u);
return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL),
v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL),
v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL,
static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T> constexpr T log2p1(const T u) {
#ifdef __has_builtin
return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
unsigned long long v = static_cast<unsigned long long>(u);
return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2),
v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32),
popCount(v);
#endif
}
template <typename T> constexpr T clog(const T v) {
return v == 0 ? T(0) : log2p1(v - 1);
}
template <typename T> constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T> constexpr T lsbp1(const T v) {
#ifdef __has_builtin
return __builtin_ffsll(v);
#else
return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T> constexpr bool ispow2(const T v) {
return popCount(v) == 1;
}
template <typename T> constexpr T ceil2(const T v) {
return v == 0 ? T(1) : T(1) << log2p1(v - 1);
}
template <typename T> constexpr T floor2(const T v) {
return v == 0 ? T(0) : T(1) << (log2p1(v) - 1);
}
//!============================================!//
//! 8888ba.88ba oo !//
//! 88 '8b '8b !//
//! 88 88 88 .d8888b. dP 88d888b. !//
//! 88 88 88 88' '88 88 88' '88 !//
//! 88 88 88 88. .88 88 88 88 !//
//! dP dP dP '88888P8 dP dP dP !//
//!============================================!//
int main() {
const int N = read<int>();
const ll X = read<ll>();
std::vector<ll> b(N), l(N), u(N);
ll ans = 0;
for (int i = 0; i < N; i++) {
std::cin >> b[i] >> l[i] >> u[i], ans += b[i];
}
std::vector<int> ind(N);
std::iota(ind.begin(), ind.end(), 0);
std::sort(ind.begin(), ind.end(), [&](const int i, const int j) {
return l[i] * b[i] + u[i] * (X - b[i]) > l[j] * b[j] + u[j] * (X - b[j]);
});
auto ok = [&](const ll U) -> bool {
std::vector<ll> a(N, 0LL);
ll R = U;
int p = -1;
for (int i = 0; i < N; i++) {
a[ind[i]] = std::min(X, R), R -= a[ind[i]];
if (R == 0) {
p = i;
}
}
ll score = 0;
for (int i = 0; i < N; i++) {
score += (a[ind[i]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[i]] - b[ind[i]]);
}
for (int i = 0; i < N; i++) {
ll S = score;
S -= (a[ind[p]] < b[ind[p]] ? l[ind[p]] : u[ind[p]]) *
(a[ind[p]] - b[ind[p]]);
S -= (a[ind[i]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[i]] - b[ind[i]]);
S += (a[ind[i]] < b[ind[p]] ? l[ind[p]] : u[ind[p]]) *
(a[ind[i]] - b[ind[p]]);
S += (a[ind[p]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[p]] - b[ind[i]]);
if (S >= 0) {
return true;
}
}
return false;
};
ll inf = -1, sup = X * (ll)N + 1LL;
while (sup - inf > 1) {
const ll mid = (inf + sup) / 2LL;
(ok(mid) ? sup : inf) = mid;
}
std::cout << sup << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 88 88 !//
//! 88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b. !//
//! 88 88 88ooood8 88' '88 88' '88 88ooood8 88' '88 !//
//! 88 88 88. ... 88. .88 88. .88 88. ... 88 !//
//! dP dP '88888P' '88888P8 '88888P8 '88888P' dP !//
//!===========================================================!//
template <typename T, typename A>
std::istream &operator>>(std::istream &is, std::vector<T, A> &v) {
for (auto &e : v) {
is >> e;
}
return is;
}
template <typename T> T read() {
T v;
return std::cin >> v, v;
}
template <typename T> std::vector<T> readVec(const std::size_t l) {
std::vector<T> v(l);
for (auto &e : v) {
std::cin >> e;
}
return v;
}
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T> constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F> constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T> bool chmin(T &a, const T &b) {
return (a > b ? a = b, true : false);
}
template <typename T> bool chmax(T &a, const T &b) {
return (a < b ? a = b, true : false);
}
template <typename T> std::vector<T> Vec(const std::size_t n, T v) {
return std::vector<T>(n, v);
}
template <class... Args> auto Vec(const std::size_t n, Args... args) {
return std::vector<decltype(Vec(args...))>(n, Vec(args...));
}
template <typename T> constexpr T popCount(const T u) {
#ifdef __has_builtin
return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
unsigned long long v = static_cast<unsigned long long>(u);
return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL),
v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL),
v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL,
static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T> constexpr T log2p1(const T u) {
#ifdef __has_builtin
return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
unsigned long long v = static_cast<unsigned long long>(u);
return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2),
v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32),
popCount(v);
#endif
}
template <typename T> constexpr T clog(const T v) {
return v == 0 ? T(0) : log2p1(v - 1);
}
template <typename T> constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T> constexpr T lsbp1(const T v) {
#ifdef __has_builtin
return __builtin_ffsll(v);
#else
return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T> constexpr bool ispow2(const T v) {
return popCount(v) == 1;
}
template <typename T> constexpr T ceil2(const T v) {
return v == 0 ? T(1) : T(1) << log2p1(v - 1);
}
template <typename T> constexpr T floor2(const T v) {
return v == 0 ? T(0) : T(1) << (log2p1(v) - 1);
}
//!============================================!//
//! 8888ba.88ba oo !//
//! 88 '8b '8b !//
//! 88 88 88 .d8888b. dP 88d888b. !//
//! 88 88 88 88' '88 88 88' '88 !//
//! 88 88 88 88. .88 88 88 88 !//
//! dP dP dP '88888P8 dP dP dP !//
//!============================================!//
int main() {
const int N = read<int>();
const ll X = read<ll>();
std::vector<ll> b(N), l(N), u(N);
ll ans = 0;
for (int i = 0; i < N; i++) {
std::cin >> b[i] >> l[i] >> u[i], ans += b[i];
}
std::vector<int> ind(N);
std::iota(ind.begin(), ind.end(), 0);
std::sort(ind.begin(), ind.end(), [&](const int i, const int j) {
return l[i] * b[i] + u[i] * (X - b[i]) > l[j] * b[j] + u[j] * (X - b[j]);
});
auto ok = [&](const ll U) -> bool {
std::vector<ll> a(N, 0LL);
ll R = U;
int p = -1;
for (int i = 0; i < N and R > 0; i++) {
a[ind[i]] = std::min(X, R), R -= a[ind[i]];
if (R == 0) {
p = i;
}
}
ll score = 0;
for (int i = 0; i < N; i++) {
score += (a[ind[i]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[i]] - b[ind[i]]);
}
for (int i = 0; i < N; i++) {
ll S = score;
S -= (a[ind[p]] < b[ind[p]] ? l[ind[p]] : u[ind[p]]) *
(a[ind[p]] - b[ind[p]]);
S -= (a[ind[i]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[i]] - b[ind[i]]);
S += (a[ind[i]] < b[ind[p]] ? l[ind[p]] : u[ind[p]]) *
(a[ind[i]] - b[ind[p]]);
S += (a[ind[p]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[p]] - b[ind[i]]);
if (S >= 0) {
return true;
}
}
return false;
};
ll inf = -1, sup = X * (ll)N + 1LL;
while (sup - inf > 1) {
const ll mid = (inf + sup) / 2LL;
(ok(mid) ? sup : inf) = mid;
}
std::cout << sup << std::endl;
return 0;
}
| [] | 834,518 | 834,517 | u603303736 | cpp |
p03019 | #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 88 88 !//
//! 88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b. !//
//! 88 88 88ooood8 88' '88 88' '88 88ooood8 88' '88 !//
//! 88 88 88. ... 88. .88 88. .88 88. ... 88 !//
//! dP dP '88888P' '88888P8 '88888P8 '88888P' dP !//
//!===========================================================!//
template <typename T, typename A>
std::istream &operator>>(std::istream &is, std::vector<T, A> &v) {
for (auto &e : v) {
is >> e;
}
return is;
}
template <typename T> T read() {
T v;
return std::cin >> v, v;
}
template <typename T> std::vector<T> readVec(const std::size_t l) {
std::vector<T> v(l);
for (auto &e : v) {
std::cin >> e;
}
return v;
}
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T> constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F> constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T> bool chmin(T &a, const T &b) {
return (a > b ? a = b, true : false);
}
template <typename T> bool chmax(T &a, const T &b) {
return (a < b ? a = b, true : false);
}
template <typename T> std::vector<T> Vec(const std::size_t n, T v) {
return std::vector<T>(n, v);
}
template <class... Args> auto Vec(const std::size_t n, Args... args) {
return std::vector<decltype(Vec(args...))>(n, Vec(args...));
}
template <typename T> constexpr T popCount(const T u) {
#ifdef __has_builtin
return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
unsigned long long v = static_cast<unsigned long long>(u);
return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL),
v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL),
v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL,
static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T> constexpr T log2p1(const T u) {
#ifdef __has_builtin
return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
unsigned long long v = static_cast<unsigned long long>(u);
return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2),
v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32),
popCount(v);
#endif
}
template <typename T> constexpr T clog(const T v) {
return v == 0 ? T(0) : log2p1(v - 1);
}
template <typename T> constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T> constexpr T lsbp1(const T v) {
#ifdef __has_builtin
return __builtin_ffsll(v);
#else
return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T> constexpr bool ispow2(const T v) {
return popCount(v) == 1;
}
template <typename T> constexpr T ceil2(const T v) {
return v == 0 ? T(1) : T(1) << log2p1(v - 1);
}
template <typename T> constexpr T floor2(const T v) {
return v == 0 ? T(0) : T(1) << (log2p1(v) - 1);
}
//!============================================!//
//! 8888ba.88ba oo !//
//! 88 '8b '8b !//
//! 88 88 88 .d8888b. dP 88d888b. !//
//! 88 88 88 88' '88 88 88' '88 !//
//! 88 88 88 88. .88 88 88 88 !//
//! dP dP dP '88888P8 dP dP dP !//
//!============================================!//
int main() {
const int N = read<int>();
const ll X = read<ll>();
std::vector<ll> b(N), l(N), u(N);
ll ans = 0;
for (int i = 0; i < N; i++) {
std::cin >> b[i] >> l[i] >> u[i], ans += b[i];
}
std::vector<int> ind(N);
std::iota(ind.begin(), ind.end(), 0);
std::sort(ind.begin(), ind.end(), [&](const int i, const int j) {
return l[i] * b[i] + u[i] * (X - b[i]) > l[j] * b[j] + u[j] * (X - b[j]);
});
auto ok = [&](const ll U) -> bool {
std::vector<ll> a(N, 0LL);
ll R = U;
int p = -1;
for (int i = 0; i < N; i++) {
a[ind[i]] = std::min(X, R), R -= a[ind[i]];
if (R == 0) {
p = i;
}
}
ll score = 0;
for (int i = 0; i < N; i++) {
score += (a[ind[i]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[i]] - b[ind[i]]);
}
for (int i = 0; i < N; i++) {
ll S = score;
S -= (a[ind[p]] < b[ind[p]] ? l[ind[p]] : u[ind[p]]) *
(a[ind[p]] - b[ind[p]]);
S -= (a[ind[i]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[i]] - b[ind[i]]);
S += (a[ind[i]] < b[ind[p]] ? l[ind[p]] : u[ind[p]]) *
(a[ind[i]] - b[ind[p]]);
S += (a[ind[p]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[p]] - b[ind[i]]);
if (S >= 0) {
return true;
}
}
return false;
};
ll inf = -1, sup = X * (ll)N + 1LL;
while (sup - inf > 1) {
const ll mid = (inf + sup) / 2;
(ok(mid) ? sup : inf) = mid;
}
std::cout << sup << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 88 88 !//
//! 88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b. !//
//! 88 88 88ooood8 88' '88 88' '88 88ooood8 88' '88 !//
//! 88 88 88. ... 88. .88 88. .88 88. ... 88 !//
//! dP dP '88888P' '88888P8 '88888P8 '88888P' dP !//
//!===========================================================!//
template <typename T, typename A>
std::istream &operator>>(std::istream &is, std::vector<T, A> &v) {
for (auto &e : v) {
is >> e;
}
return is;
}
template <typename T> T read() {
T v;
return std::cin >> v, v;
}
template <typename T> std::vector<T> readVec(const std::size_t l) {
std::vector<T> v(l);
for (auto &e : v) {
std::cin >> e;
}
return v;
}
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T> constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F> constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T> bool chmin(T &a, const T &b) {
return (a > b ? a = b, true : false);
}
template <typename T> bool chmax(T &a, const T &b) {
return (a < b ? a = b, true : false);
}
template <typename T> std::vector<T> Vec(const std::size_t n, T v) {
return std::vector<T>(n, v);
}
template <class... Args> auto Vec(const std::size_t n, Args... args) {
return std::vector<decltype(Vec(args...))>(n, Vec(args...));
}
template <typename T> constexpr T popCount(const T u) {
#ifdef __has_builtin
return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
unsigned long long v = static_cast<unsigned long long>(u);
return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL),
v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL),
v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL,
static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T> constexpr T log2p1(const T u) {
#ifdef __has_builtin
return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
unsigned long long v = static_cast<unsigned long long>(u);
return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2),
v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32),
popCount(v);
#endif
}
template <typename T> constexpr T clog(const T v) {
return v == 0 ? T(0) : log2p1(v - 1);
}
template <typename T> constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T> constexpr T lsbp1(const T v) {
#ifdef __has_builtin
return __builtin_ffsll(v);
#else
return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T> constexpr bool ispow2(const T v) {
return popCount(v) == 1;
}
template <typename T> constexpr T ceil2(const T v) {
return v == 0 ? T(1) : T(1) << log2p1(v - 1);
}
template <typename T> constexpr T floor2(const T v) {
return v == 0 ? T(0) : T(1) << (log2p1(v) - 1);
}
//!============================================!//
//! 8888ba.88ba oo !//
//! 88 '8b '8b !//
//! 88 88 88 .d8888b. dP 88d888b. !//
//! 88 88 88 88' '88 88 88' '88 !//
//! 88 88 88 88. .88 88 88 88 !//
//! dP dP dP '88888P8 dP dP dP !//
//!============================================!//
int main() {
const int N = read<int>();
const ll X = read<ll>();
std::vector<ll> b(N), l(N), u(N);
ll ans = 0;
for (int i = 0; i < N; i++) {
std::cin >> b[i] >> l[i] >> u[i], ans += b[i];
}
std::vector<int> ind(N);
std::iota(ind.begin(), ind.end(), 0);
std::sort(ind.begin(), ind.end(), [&](const int i, const int j) {
return l[i] * b[i] + u[i] * (X - b[i]) > l[j] * b[j] + u[j] * (X - b[j]);
});
auto ok = [&](const ll U) -> bool {
std::vector<ll> a(N, 0LL);
ll R = U;
int p = -1;
for (int i = 0; i < N and R > 0; i++) {
a[ind[i]] = std::min(X, R), R -= a[ind[i]];
if (R == 0) {
p = i;
}
}
ll score = 0;
for (int i = 0; i < N; i++) {
score += (a[ind[i]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[i]] - b[ind[i]]);
}
for (int i = 0; i < N; i++) {
ll S = score;
S -= (a[ind[p]] < b[ind[p]] ? l[ind[p]] : u[ind[p]]) *
(a[ind[p]] - b[ind[p]]);
S -= (a[ind[i]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[i]] - b[ind[i]]);
S += (a[ind[i]] < b[ind[p]] ? l[ind[p]] : u[ind[p]]) *
(a[ind[i]] - b[ind[p]]);
S += (a[ind[p]] < b[ind[i]] ? l[ind[i]] : u[ind[i]]) *
(a[ind[p]] - b[ind[i]]);
if (S >= 0) {
return true;
}
}
return false;
};
ll inf = -1, sup = X * (ll)N + 1LL;
while (sup - inf > 1) {
const ll mid = (inf + sup) / 2LL;
(ok(mid) ? sup : inf) = mid;
}
std::cout << sup << std::endl;
return 0;
}
| [
"literal.number.type.widen.change"
] | 834,519 | 834,517 | u603303736 | cpp |
p03019 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
ll n, x;
cin >> n >> x;
vector<ll> b(n), l(n), u(n);
rep(i, n) cin >> b[i] >> l[i] >> u[i];
// priority_queue<pair<pair<ll,ll>,int> > pq;
vector<pair<ll, ll>> v(n);
ll tar = 0;
rep(i, n) {
// pq.push(MP(MP((x-b[i])*u[i]+b[i]*l[i],u[i]),i));
v[i] = MP((x - b[i]) * u[i] + b[i] * l[i], i);
tar += b[i] * l[i];
}
sort(v.rbegin(), v.rend());
ll s = 0;
set<int> st;
int spe = -1;
for (auto x : v) {
ll ss = x.first;
int id = x.second;
if (s + ss >= tar) {
s += ss;
spe = id;
break;
} else {
s += ss;
st.insert(id);
}
}
ll cnt = st.size();
ll res = x * cnt;
ll ans = 1ll << 60;
rep(i, n) {
if (st.count(i) == 1) {
ll ss = s - ((x - b[i]) * u[i] + b[i] * l[i]);
ll sss = tar - ss;
// cerr << s << " " << ss << " " << tar << endl;
if ((sss + l[i] - 1) / l[i] <= b[i]) {
ans = min(ans, res + (tar - sss + l[i] - 1) / l[i]);
} else {
ans =
min(ans, res + b[i] + (tar - sss - b[i] * l[i] + u[i] - 1) / u[i]);
}
} else {
ll ss = s - ((x - b[spe]) * u[spe] + b[spe] * l[spe]);
ll sss = tar - ss;
// cerr << s << " " << ss << " " << sss << endl;
if ((sss + l[i] - 1) / l[i] <= b[i]) {
ans = min(ans, res + (sss + l[i] - 1) / l[i]);
} else {
ans = min(ans, res + b[i] + (sss - b[i] * l[i] + u[i] - 1) / u[i]);
}
}
}
cout << ans << endl;
// while(!pq.empty()){
// auto y = pq.top();
// pq.pop();
// int id = y.second;
// ll pp = y.first.first;
// if(s+pp<tar){
// s += pp;
// res += x;
// }else{
// if((tar-s+l[id]-1)/l[id]<=b[id]){
// ans = min(ans,res+(tar-s+l[id]-1)/l[id]);
// }else{
// ans = min(ans,res+b[id]+(tar-s-b[id]*l[id]+u[id]-1)/u[id]);
// }
// }
// cerr << id << " " << s << " " << tar << " " << res << endl;
// }
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
ll n, x;
cin >> n >> x;
vector<ll> b(n), l(n), u(n);
rep(i, n) cin >> b[i] >> l[i] >> u[i];
// priority_queue<pair<pair<ll,ll>,int> > pq;
vector<pair<ll, ll>> v(n);
ll tar = 0;
rep(i, n) {
// pq.push(MP(MP((x-b[i])*u[i]+b[i]*l[i],u[i]),i));
v[i] = MP((x - b[i]) * u[i] + b[i] * l[i], i);
tar += b[i] * l[i];
}
sort(v.rbegin(), v.rend());
ll s = 0;
set<int> st;
int spe = -1;
for (auto x : v) {
ll ss = x.first;
int id = x.second;
if (s + ss >= tar) {
s += ss;
spe = id;
break;
} else {
s += ss;
st.insert(id);
}
}
ll cnt = st.size();
ll res = x * cnt;
ll ans = 1ll << 60;
rep(i, n) {
if (st.count(i) == 1) {
ll ss = s - ((x - b[i]) * u[i] + b[i] * l[i]);
ll sss = tar - ss;
// cerr << s << " " << ss << " " << tar << endl;
if ((sss + l[i] - 1) / l[i] <= b[i]) {
ans = min(ans, res + (sss + l[i] - 1) / l[i]);
} else {
ans = min(ans, res + b[i] + (sss - b[i] * l[i] + u[i] - 1) / u[i]);
}
} else {
ll ss = s - ((x - b[spe]) * u[spe] + b[spe] * l[spe]);
ll sss = tar - ss;
// cerr << s << " " << ss << " " << sss << endl;
if ((sss + l[i] - 1) / l[i] <= b[i]) {
ans = min(ans, res + (sss + l[i] - 1) / l[i]);
} else {
ans = min(ans, res + b[i] + (sss - b[i] * l[i] + u[i] - 1) / u[i]);
}
}
}
cout << ans << endl;
// while(!pq.empty()){
// auto y = pq.top();
// pq.pop();
// int id = y.second;
// ll pp = y.first.first;
// if(s+pp<tar){
// s += pp;
// res += x;
// }else{
// if((tar-s+l[id]-1)/l[id]<=b[id]){
// ans = min(ans,res+(tar-s+l[id]-1)/l[id]);
// }else{
// ans = min(ans,res+b[id]+(tar-s-b[id]*l[id]+u[id]-1)/u[id]);
// }
// }
// cerr << id << " " << s << " " << tar << " " << res << endl;
// }
return 0;
} | [
"expression.operation.binary.remove"
] | 834,520 | 834,521 | u007610006 | cpp |
p03019 | #include <bits/stdc++.h>
using std::abs;
using std::bitset;
using std::cerr;
using std::cin;
using std::cout;
using std::map;
using std::max;
using std::min;
using std::pair;
using std::set;
using std::sort;
using std::string;
using std::swap;
using std::unordered_map;
using std::unordered_set;
using std::vector;
using ll = long long;
using uint = unsigned int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ull = unsigned long long;
using ld = long double;
template <typename T> void _dbg(const char *s, T h) {
cerr << s << " = " << h << "\n";
}
template <typename T, typename... Ts> void _dbg(const char *s, T h, Ts... t) {
int b = 0;
while (((b += *s == '(') -= *s == ')') != 0 || *s != ',')
cerr << *s++;
cerr << " = " << h << ",";
_dbg(s + 1, t...);
} // break continue pop_back 998244353
#define int ll
#define pii pll
#define f first
#define s second
#define pb emplace_back
#define forn(i, n) for (int i = 0; i < (n); ++i)
struct init {
init() {
cin.tie(0);
std::iostream::sync_with_stdio(0);
cout << std::fixed << std::setprecision(10);
cerr << std::fixed << std::setprecision(5);
}
~init() {
#ifdef LOCAL
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
cerr << "Time elapsed: " << (double)clock() / CLOCKS_PER_SEC << "s.\n";
#else
#define dbg(...)
#endif
}
} init;
template <typename T, typename U> void upx(T &x, U y) {
if (x < y)
x = y;
}
template <typename T, typename U> void upn(T &x, U y) {
if (x > y)
x = y;
}
const int N = 1e5;
struct kek {
int b, l, u, delta;
} a[N];
int n, x;
bool check(int m) {
int full = m / x;
int rest = m % x, sum;
if (rest) {
sum = 0;
forn(i, n) sum += a[i].b * a[i].l;
forn(i, full + 1) sum -= a[i].delta;
int kok = 1e18;
forn(i, full + 1) {
upn(kok, (x - rest) * a[i].u);
upn(kok, -a[i].b * a[i].u + a[i].b * a[i].l + a[i].u * x -
a[i].l * (x - rest));
}
sum += kok;
if (sum <= 0)
return 1;
}
sum = 0;
forn(i, n) sum += a[i].b * a[i].l;
forn(i, full) sum -= a[i].delta;
int best = 0;
for (int i = full; i < n; ++i) {
upx(best, rest * a[i].u + a[i].b * (a[i].l - a[i].u));
upx(best, rest * a[i].l);
}
sum -= best;
return sum <= 0;
}
int32_t main() {
cin >> n >> x;
forn(i, n) {
cin >> a[i].b >> a[i].l >> a[i].u;
a[i].delta = x * a[i].u + a[i].b * (a[i].l - a[i].u);
}
sort(a, a + n,
[](const kek &p1, const kek &p2) { return p1.delta > p2.delta; });
int l = -1, r = n * x;
while (r - l > 1) {
int m = (l + r) / 2;
if (check(m))
r = m;
else
l = m;
}
cout << r << '\n';
return 0;
}
| #include <bits/stdc++.h>
using std::abs;
using std::bitset;
using std::cerr;
using std::cin;
using std::cout;
using std::map;
using std::max;
using std::min;
using std::pair;
using std::set;
using std::sort;
using std::string;
using std::swap;
using std::unordered_map;
using std::unordered_set;
using std::vector;
using ll = long long;
using uint = unsigned int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ull = unsigned long long;
using ld = long double;
template <typename T> void _dbg(const char *s, T h) {
cerr << s << " = " << h << "\n";
}
template <typename T, typename... Ts> void _dbg(const char *s, T h, Ts... t) {
int b = 0;
while (((b += *s == '(') -= *s == ')') != 0 || *s != ',')
cerr << *s++;
cerr << " = " << h << ",";
_dbg(s + 1, t...);
} // break continue pop_back 998244353
#define int ll
#define pii pll
#define f first
#define s second
#define pb emplace_back
#define forn(i, n) for (int i = 0; i < (n); ++i)
struct init {
init() {
cin.tie(0);
std::iostream::sync_with_stdio(0);
cout << std::fixed << std::setprecision(10);
cerr << std::fixed << std::setprecision(5);
}
~init() {
#ifdef LOCAL
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
cerr << "Time elapsed: " << (double)clock() / CLOCKS_PER_SEC << "s.\n";
#else
#define dbg(...)
#endif
}
} init;
template <typename T, typename U> void upx(T &x, U y) {
if (x < y)
x = y;
}
template <typename T, typename U> void upn(T &x, U y) {
if (x > y)
x = y;
}
const int N = 1e5;
struct kek {
int b, l, u, delta;
} a[N];
int n, x;
bool check(int m) {
int full = m / x;
int rest = m % x, sum;
if (rest) {
sum = 0;
forn(i, n) sum += a[i].b * a[i].l;
forn(i, full + 1) sum -= a[i].delta;
int kok = 1e18;
forn(i, full + 1) {
upn(kok, (x - rest) * a[i].u);
upn(kok, -a[i].b * a[i].u + a[i].b * a[i].l + a[i].u * x - a[i].l * rest);
}
sum += kok;
if (sum <= 0)
return 1;
}
sum = 0;
forn(i, n) sum += a[i].b * a[i].l;
forn(i, full) sum -= a[i].delta;
int best = 0;
for (int i = full; i < n; ++i) {
upx(best, rest * a[i].u + a[i].b * (a[i].l - a[i].u));
upx(best, rest * a[i].l);
}
sum -= best;
return sum <= 0;
}
int32_t main() {
cin >> n >> x;
forn(i, n) {
cin >> a[i].b >> a[i].l >> a[i].u;
a[i].delta = x * a[i].u + a[i].b * (a[i].l - a[i].u);
}
sort(a, a + n,
[](const kek &p1, const kek &p2) { return p1.delta > p2.delta; });
int l = -1, r = n * x;
while (r - l > 1) {
int m = (l + r) / 2;
if (check(m))
r = m;
else
l = m;
}
cout << r << '\n';
return 0;
}
| [
"call.arguments.change"
] | 834,524 | 834,525 | u247904511 | cpp |
p03019 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
long long N, X;
long long L[1 < 20], R[1 << 20], B[1 << 20];
long long min_score = 0;
vector<pair<long long, int>> v;
vector<long long> csum(1 << 20);
bool possible(long long num_study_hrs) {
if (num_study_hrs == 0)
return (min_score >= 0);
int num_complete = num_study_hrs / X;
int partial = num_study_hrs % X;
if (partial == 0)
return ((csum[num_complete - 1] + min_score) >= 0);
for (int i = 0; i < N; i++) {
long long tsr = 0;
if (partial <= B[v[i].second])
tsr = partial * 1LL * L[v[i].second];
else
tsr = B[v[i].second] * 1LL * L[v[i].second] +
(partial - B[v[i].second]) * 1LL * R[v[i].second];
if (num_complete != 0) {
if (i <= (num_complete - 1))
tsr = csum[num_complete] - v[i].first + tsr;
else
tsr = csum[num_complete - 1] + tsr;
}
if ((tsr + min_score) >= 0)
return true;
}
return false;
}
int main() {
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> B[i] >> L[i] >> R[i];
min_score += -(1LL * B[i]) * L[i];
v.push_back({B[i] * 1LL * L[i] + (X - B[i]) * 1LL * R[i], i});
}
sort(v.begin(), v.end(), greater<>());
csum[0] = v[0].first;
for (int i = 1; i < N; i++) {
csum[i] = csum[i - 1] + v[i].first;
}
long long lo = 0, hi = (1LL * N) * X, mid = 0;
while (lo < hi) {
mid = (lo + hi) / 2;
if (possible(mid)) {
hi = mid;
} // cout<<mid<<endl;}
else
lo = mid + 1;
}
cout << lo; // << v[0].first <<" "<<v[1].first<<endl;
return 0;
}
| #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
int N, X;
int L[1 << 20], R[1 << 20], B[1 << 20];
long long min_score = 0;
vector<pair<long long, int>> v;
vector<long long> csum(1 << 20);
bool possible(long long num_study_hrs) {
if (num_study_hrs == 0)
return (min_score >= 0);
int num_complete = num_study_hrs / X;
int partial = num_study_hrs % X;
if (partial == 0)
return ((csum[num_complete - 1] + min_score) >= 0);
for (int i = 0; i < N; i++) {
long long tsr = 0;
if (partial <= B[v[i].second])
tsr = partial * 1LL * L[v[i].second];
else
tsr = B[v[i].second] * 1LL * L[v[i].second] +
(partial - B[v[i].second]) * 1LL * R[v[i].second];
if (num_complete != 0) {
if (i <= (num_complete - 1))
tsr = csum[num_complete] - v[i].first + tsr;
else
tsr = csum[num_complete - 1] + tsr;
}
if ((tsr + min_score) >= 0)
return true;
}
return false;
}
int main() {
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> B[i] >> L[i] >> R[i];
min_score += -(1LL * B[i]) * L[i];
v.push_back({B[i] * 1LL * L[i] + (X - B[i]) * 1LL * R[i], i});
}
sort(v.begin(), v.end(), greater<>());
csum[0] = v[0].first;
for (int i = 1; i < N; i++) {
csum[i] = csum[i - 1] + v[i].first;
}
long long lo = 0, hi = (1LL * N) * X, mid = 0;
while (lo < hi) {
mid = (lo + hi) / 2;
if (possible(mid)) {
hi = mid;
} // cout<<mid<<endl;}
else
lo = mid + 1;
}
cout << lo; // << v[0].first <<" "<<v[1].first<<endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"expression.operation.binary.change"
] | 834,537 | 834,538 | u079603018 | cpp |
p03019 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
int N, X;
int L[1 < 20], R[1 << 20], B[1 << 20];
long long min_score = 0;
vector<pair<long long, int>> v;
vector<long long> csum(1 << 20);
bool possible(long long num_study_hrs) {
if (num_study_hrs == 0)
return (min_score >= 0);
int num_complete = num_study_hrs / X;
int partial = num_study_hrs % X;
if (partial == 0)
return ((csum[num_complete - 1] + min_score) >= 0);
for (int i = 0; i < N; i++) {
long long tsr = 0;
if (partial <= B[v[i].second])
tsr = partial * 1LL * L[v[i].second];
else
tsr = B[v[i].second] * 1LL * L[v[i].second] +
(partial - B[v[i].second]) * 1LL * R[v[i].second];
if (num_complete != 0) {
if (i <= (num_complete - 1))
tsr = csum[num_complete] - v[i].first + tsr;
else
tsr = csum[num_complete - 1] + tsr;
}
if ((tsr + min_score) >= 0)
return true;
}
return false;
}
int main() {
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> B[i] >> L[i] >> R[i];
min_score += -(1LL * B[i]) * L[i];
v.push_back({B[i] * 1LL * L[i] + (X - B[i]) * 1LL * R[i], i});
}
sort(v.begin(), v.end(), greater<>());
csum[0] = v[0].first;
for (int i = 1; i < N; i++) {
csum[i] = csum[i - 1] + v[i].first;
}
long long lo = 0, hi = (1LL * N) * X, mid = 0;
while (lo < hi) {
mid = (lo + hi) / 2;
if (possible(mid)) {
hi = mid;
} // cout<<mid<<endl;}
else
lo = mid + 1;
}
cout << lo; // << v[0].first <<" "<<v[1].first<<endl;
return 0;
}
| #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
int N, X;
int L[1 << 20], R[1 << 20], B[1 << 20];
long long min_score = 0;
vector<pair<long long, int>> v;
vector<long long> csum(1 << 20);
bool possible(long long num_study_hrs) {
if (num_study_hrs == 0)
return (min_score >= 0);
int num_complete = num_study_hrs / X;
int partial = num_study_hrs % X;
if (partial == 0)
return ((csum[num_complete - 1] + min_score) >= 0);
for (int i = 0; i < N; i++) {
long long tsr = 0;
if (partial <= B[v[i].second])
tsr = partial * 1LL * L[v[i].second];
else
tsr = B[v[i].second] * 1LL * L[v[i].second] +
(partial - B[v[i].second]) * 1LL * R[v[i].second];
if (num_complete != 0) {
if (i <= (num_complete - 1))
tsr = csum[num_complete] - v[i].first + tsr;
else
tsr = csum[num_complete - 1] + tsr;
}
if ((tsr + min_score) >= 0)
return true;
}
return false;
}
int main() {
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> B[i] >> L[i] >> R[i];
min_score += -(1LL * B[i]) * L[i];
v.push_back({B[i] * 1LL * L[i] + (X - B[i]) * 1LL * R[i], i});
}
sort(v.begin(), v.end(), greater<>());
csum[0] = v[0].first;
for (int i = 1; i < N; i++) {
csum[i] = csum[i - 1] + v[i].first;
}
long long lo = 0, hi = (1LL * N) * X, mid = 0;
while (lo < hi) {
mid = (lo + hi) / 2;
if (possible(mid)) {
hi = mid;
} // cout<<mid<<endl;}
else
lo = mid + 1;
}
cout << lo; // << v[0].first <<" "<<v[1].first<<endl;
return 0;
}
| [
"expression.operation.binary.change"
] | 834,540 | 834,538 | u079603018 | cpp |
p03019 | #include <bits/stdc++.h>
#define rt "\n"
#define sp " "
#define test(n) cout << "test" << n << endl;
#define fixsp(n) fixed << setprecision(n)
#define defsp(n) defaultfloat << setprecision(n)
#define kyopro \
ios::sync_with_stdio(false); \
cin.tie(NULL)
#define MOD 1000000007
#define iikae auto &
#define vector3D(K, N, M, DP) \
vector<vector<vector<ll>>> DP(K, vector<vector<ll>>(N, vector<ll>(M)));
#define vector4D(K, N, M, O, DP) \
vector<vector<vector<vector<ll>>>> DP( \
K, vector<vector<vector<ll>>>(N, vector<vector<ll>>(M, vector<ll>(O))));
#define zenbu(a) a.begin(), a.end()
#define rzenbu(a) a.rbegin(), a.rend()
#define rep(i, s, N) for (ll i{s}; i < N; i++)
#define rem(i, N, s) for (ll i{N}; i > s; i--)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
template <typename T> T gcd(T a, T b) { return b != 0 ? gcd(b, a % b) : a; }
template <typename T> struct UnionFind {
vector<T> par;
UnionFind(T n) : par(n, -1) {}
void init(T n) { par.assign(n, -1); }
T root(T x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(T x, T y) { return root(x) == root(y); }
bool merge(T x, T y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
template <typename T> ll combpm(T N_, T C_) {
const int NUM_ = 400001;
static ll fact[NUM_ + 1], factr[NUM_ + 1], inv[NUM_ + 1];
if (fact[0] == 0) {
inv[1] = fact[0] = factr[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = 1; i <= NUM_; ++i)
fact[i] = fact[i - 1] * i % MOD, factr[i] = factr[i - 1] * inv[i] % MOD;
}
if (C_ < 0 || C_ > N_)
return 0;
return factr[C_] * fact[N_] % MOD * factr[N_ - C_] % MOD;
}
struct phash {
inline size_t operator()(const pair<ll, ll> &p) const {
const auto h1 = hash<ll>()(p.first);
const auto h2 = hash<ll>()(p.second);
return h1 ^ (h2 << 1);
}
};
/* ここからコード開始 */
int main() {
kyopro;
ll N, X;
cin >> N >> X;
vector<ll> b(N), l(N), u(N);
rep(i, 0, N) { cin >> b[i] >> l[i] >> u[i]; }
vector<P> bli(N);
ll sum{};
rep(i, 0, N) {
bli[i].first = b[i] * l[i] + (X - b[i]) * u[i];
bli[i].second = i;
sum -= b[i] * l[i];
}
sort(rzenbu(bli));
ll hours{};
vector<ll> remain;
vector<ll> resub;
ll sumlast;
rep(i, 0, N) {
if (sum > 0)
resub.push_back(bli[i].second);
else {
sum += bli[i].first;
hours += X;
remain.push_back(bli[i].second);
sumlast = bli[i].first;
}
}
resub.push_back(remain[remain.size() - 1]);
rep(i, 0, N) {
if (sum - (X - b[i]) * u[i] < 0) {
ll d = sum / u[i];
} else {
ll d = (X - b[i]) + (sum - (X - b[i]) * u[i]) / l[i];
}
}
ll alpha{};
for (auto &&i : remain) {
if (sum - (X - b[i]) * u[i] < 0) {
ll d = sum / u[i];
alpha = max(d, alpha);
// cout << d << rt;
} else {
ll d = (X - b[i]) + (sum - (X - b[i]) * u[i]) / l[i];
alpha = max(d, alpha);
// cout << d << rt;
}
}
sum -= sumlast;
for (auto &&i : resub) {
if (sum + b[i] * l[i] < 0) {
ll d = (-sum + l[i] - 1) / l[i];
alpha = max(X - d, alpha);
// cout << X-d << rt;
} else {
ll d = b[i] + (-sum - b[i] * l[i] + u[i] - 1) / u[i];
alpha = max(X - d, alpha);
// cout << X-d << rt;
}
}
cout << hours - alpha << rt;
} | #include <bits/stdc++.h>
#define rt "\n"
#define sp " "
#define test(n) cout << "test" << n << endl;
#define fixsp(n) fixed << setprecision(n)
#define defsp(n) defaultfloat << setprecision(n)
#define kyopro \
ios::sync_with_stdio(false); \
cin.tie(NULL)
#define MOD 1000000007
#define iikae auto &
#define vector3D(K, N, M, DP) \
vector<vector<vector<ll>>> DP(K, vector<vector<ll>>(N, vector<ll>(M)));
#define vector4D(K, N, M, O, DP) \
vector<vector<vector<vector<ll>>>> DP( \
K, vector<vector<vector<ll>>>(N, vector<vector<ll>>(M, vector<ll>(O))));
#define zenbu(a) a.begin(), a.end()
#define rzenbu(a) a.rbegin(), a.rend()
#define rep(i, s, N) for (ll i{s}; i < N; i++)
#define rem(i, N, s) for (ll i{N}; i > s; i--)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
template <typename T> T gcd(T a, T b) { return b != 0 ? gcd(b, a % b) : a; }
template <typename T> struct UnionFind {
vector<T> par;
UnionFind(T n) : par(n, -1) {}
void init(T n) { par.assign(n, -1); }
T root(T x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(T x, T y) { return root(x) == root(y); }
bool merge(T x, T y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
template <typename T> ll combpm(T N_, T C_) {
const int NUM_ = 400001;
static ll fact[NUM_ + 1], factr[NUM_ + 1], inv[NUM_ + 1];
if (fact[0] == 0) {
inv[1] = fact[0] = factr[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = 1; i <= NUM_; ++i)
fact[i] = fact[i - 1] * i % MOD, factr[i] = factr[i - 1] * inv[i] % MOD;
}
if (C_ < 0 || C_ > N_)
return 0;
return factr[C_] * fact[N_] % MOD * factr[N_ - C_] % MOD;
}
struct phash {
inline size_t operator()(const pair<ll, ll> &p) const {
const auto h1 = hash<ll>()(p.first);
const auto h2 = hash<ll>()(p.second);
return h1 ^ (h2 << 1);
}
};
/* ここからコード開始 */
int main() {
kyopro;
ll N, X;
cin >> N >> X;
vector<ll> b(N), l(N), u(N);
rep(i, 0, N) { cin >> b[i] >> l[i] >> u[i]; }
vector<P> bli(N);
ll sum{};
rep(i, 0, N) {
bli[i].first = b[i] * l[i] + (X - b[i]) * u[i];
bli[i].second = i;
sum -= b[i] * l[i];
}
sort(rzenbu(bli));
ll hours{};
vector<ll> remain;
vector<ll> resub;
ll sumlast;
rep(i, 0, N) {
if (sum > 0)
resub.push_back(bli[i].second);
else {
sum += bli[i].first;
hours += X;
remain.push_back(bli[i].second);
sumlast = bli[i].first;
}
}
resub.push_back(remain[remain.size() - 1]);
rep(i, 0, N) {
if (sum - (X - b[i]) * u[i] < 0) {
ll d = sum / u[i];
} else {
ll d = (X - b[i]) + (sum - (X - b[i]) * u[i]) / l[i];
}
}
ll alpha{};
for (auto &&i : remain) {
if (sum - (X - b[i]) * u[i] < 0) {
ll d = sum / u[i];
alpha = max(d, alpha);
// cout << d << rt;
} else {
ll d = (X - b[i]) + (sum - (X - b[i]) * u[i]) / l[i];
alpha = max(d, alpha);
// cout << d << rt;
}
}
sum -= sumlast;
for (auto &&i : resub) {
if (sum + b[i] * l[i] >= 0) {
ll d = (-sum + l[i] - 1) / l[i];
alpha = max(X - d, alpha);
// cout << X-d << rt;
} else {
ll d = b[i] + (-sum - b[i] * l[i] + u[i] - 1) / u[i];
alpha = max(X - d, alpha);
// cout << X-d << rt;
}
}
cout << hours - alpha << rt;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 834,554 | 834,555 | u936790121 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string s;
cin >> s;
vector<char> v;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'B' && s[i + 1] == 'C' && i + 1 < s.size()) {
v.push_back('D');
i++;
continue;
}
if (s[i] != 'A') {
s[i] = 'Z';
}
v.push_back(s[i]);
}
int size = (int)v.size();
for (int i = 0; i < size; i++) {
if (v[i] == 'Z') {
int last = i - 1;
int j = i - 1;
while (v[j] != 'Z' && j >= 0) {
if (s[j] == 'A') {
ans += last - j;
last--;
}
j--;
}
}
if (i == size - 1 && v[i] != 'Z') {
int last = i;
int j = i;
while (v[j] != 'Z' && j >= 0) {
if (v[j] == 'A') {
ans += last - j;
// cout << last << " " << j << '\n';
last--;
}
j--;
}
}
}
cout << ans << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0;
string s;
cin >> s;
vector<char> v;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'B' && s[i + 1] == 'C' && i + 1 < s.size()) {
v.push_back('D');
i++;
continue;
}
if (s[i] != 'A') {
s[i] = 'Z';
}
v.push_back(s[i]);
}
// for(int i =0; i < v.size(); i++){cout << v[i];}
int size = (int)v.size();
for (int i = 0; i < size; i++) {
if (v[i] == 'Z') {
int last = i - 1;
int j = i - 1;
while (v[j] != 'Z' && j >= 0) {
if (v[j] == 'A') {
ans += last - j;
// cout << last << " " << j << '\n';
last--;
}
j--;
}
// cout << ans << '\n';
}
if (i == size - 1 && v[i] != 'Z') {
int last = i;
int j = i;
while (v[j] != 'Z' && j >= 0) {
if (v[j] == 'A') {
ans += last - j;
// cout << last << " " << j << '\n';
last--;
}
j--;
}
}
}
cout << ans << '\n';
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 834,620 | 834,619 | u422827820 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string s;
cin >> s;
vector<char> v;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'B' && s[i + 1] == 'C' && i + 1 < s.size()) {
v.push_back('D');
i++;
continue;
}
if (s[i] != 'A') {
s[i] = 'Z';
}
v.push_back(s[i]);
}
int size = (int)v.size();
for (int i = 0; i < size; i++) {
if (v[i] == 'Z') {
int last = i - 1;
int j = i - 1;
while (v[j] != 'Z' && j >= 0) {
if (s[j] == 'A') {
ans += last - j;
last--;
}
j--;
}
}
if (i == size - 1 && v[i] != 'Z') {
int last = i;
int j = i;
while (v[j] != 'Z' && j >= 0) {
if (s[j] == 'A') {
ans += last - j;
last--;
}
j--;
}
}
}
cout << ans << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0;
string s;
cin >> s;
vector<char> v;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'B' && s[i + 1] == 'C' && i + 1 < s.size()) {
v.push_back('D');
i++;
continue;
}
if (s[i] != 'A') {
s[i] = 'Z';
}
v.push_back(s[i]);
}
// for(int i =0; i < v.size(); i++){cout << v[i];}
int size = (int)v.size();
for (int i = 0; i < size; i++) {
if (v[i] == 'Z') {
int last = i - 1;
int j = i - 1;
while (v[j] != 'Z' && j >= 0) {
if (v[j] == 'A') {
ans += last - j;
// cout << last << " " << j << '\n';
last--;
}
j--;
}
// cout << ans << '\n';
}
if (i == size - 1 && v[i] != 'Z') {
int last = i;
int j = i;
while (v[j] != 'Z' && j >= 0) {
if (v[j] == 'A') {
ans += last - j;
// cout << last << " " << j << '\n';
last--;
}
j--;
}
}
}
cout << ans << '\n';
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 834,621 | 834,619 | u422827820 | cpp |
p03018 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
typedef pair<string, int> P;
bool pairCompare(const P &firstElof, const P &secondElof) {
return firstElof.second > secondElof.second;
}
bool pairCompare2(const P &firstElof, const P &secondElof) {
if (firstElof.first < secondElof.first) {
return firstElof.first < secondElof.first;
} else if (firstElof.first == secondElof.first) {
return firstElof.second > secondElof.second;
} else
return firstElof.first > secondElof.first;
}
typedef long long ll;
int main(void) {
string s;
cin >> s;
ll n = s.size();
ll i = 0;
ll cnt = 0;
ll cnt_a = 0;
ll cnt_bc = 0;
while (i < n - 1) { // cerr<<i<<endl;
if (s[i] == 'A') {
cnt_a++;
} else {
cnt_a = 0;
}
if (s.substr(i, 3) == "ABC") {
cnt += cnt_a;
s[i] = 'B', s[i + 1] = 'C', s[i + 2] = 'A';
i += 2;
cnt_a = 0;
// cerr<<"AC"<<endl;
} else {
i++;
}
}
cout << cnt << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
typedef pair<string, int> P;
bool pairCompare(const P &firstElof, const P &secondElof) {
return firstElof.second > secondElof.second;
}
bool pairCompare2(const P &firstElof, const P &secondElof) {
if (firstElof.first < secondElof.first) {
return firstElof.first < secondElof.first;
} else if (firstElof.first == secondElof.first) {
return firstElof.second > secondElof.second;
} else
return firstElof.first > secondElof.first;
}
typedef long long ll;
int main(void) {
string s;
cin >> s;
ll n = s.size();
ll i = 0;
ll cnt = 0;
ll cnt_a = 0;
ll cnt_bc = 0;
while (i < n - 1) { // cerr<<i<<endl;
if (s[i] == 'A') {
cnt_a++;
} else {
cnt_a = 0;
}
if (s.substr(i, 3) == "ABC") {
cnt += cnt_a;
s[i] = 'B', s[i + 1] = 'C', s[i + 2] = 'A';
i += 2;
cnt_a--;
// cerr<<"AC"<<endl;
} else {
i++;
}
}
cout << cnt << endl;
return 0;
} | [] | 834,716 | 834,717 | u074445770 | cpp |
p03018 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
long ans = 0;
char s[200001] = {};
cin >> s;
long j = 0, old = 0;
for (long i = 0; s[i] != 0; i++) {
for (j = 0; s[i + j] == 'A'; j++)
;
if (j > 0 || old > 0) {
if (s[i + j] == 'B' && s[i + j + 1] == 'C') {
ans += j + old;
old += j;
i += j + 1;
} else {
old = 0;
i += j - 1;
}
} else {
old = 0;
}
}
printf("%f", ans);
return 0;
}
| #include <cstdio>
#include <iostream>
using namespace std;
int main() {
long ans = 0;
char s[200001] = {};
cin >> s;
long j = 0, old = 0;
for (long i = 0; s[i] != 0; i++) {
for (j = 0; s[i + j] == 'A'; j++)
;
if (j > 0 || old > 0) {
if (s[i + j] == 'B' && s[i + j + 1] == 'C') {
ans += j + old;
old += j;
i += j + 1;
} else {
old = 0;
i += j - 1;
}
} else {
old = 0;
}
}
printf("%ld", ans);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 834,727 | 834,728 | u145483532 | cpp |
p03018 | #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;
typedef pair<ll, ll> P;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
int n = s.length();
ll ans = 0;
ll cnt = 0;
REP(i, n) {
if (s[i] == 'A') {
++cnt;
} else if (s[i] == 'B' and i + 1 < n) {
if (s[i + 1] == 'C') {
ans += cnt;
} else
cnt = 0;
} else
cnt = 0;
}
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;
typedef pair<ll, ll> P;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
int n = s.length();
ll ans = 0;
ll cnt = 0;
REP(i, n) {
if (s[i] == 'A') {
++cnt;
} else if (s[i] == 'B' and i + 1 < n) {
if (s[i + 1] == 'C') {
ans += cnt;
++i;
} else
cnt = 0;
} else
cnt = 0;
}
cout << ans << endl;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 834,730 | 834,731 | u102602414 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).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;
}
const int MOD = 1000000007;
int main() {
string s;
cin >> s;
int a = 0;
int c = 0;
REP(i, s.size() - 1) {
if (s[i] == 'A') {
a++;
} else if (s[i] == 'B' && s[i + 1] == 'C') {
c += a;
i++;
a = 1;
} else {
a = 0;
}
}
cout << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).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;
}
const int MOD = 1000000007;
int main() {
string s;
cin >> s;
ll a = 0;
ll c = 0;
REP(i, s.size() - 1) {
if (s[i] == 'A') {
a++;
} else if (s[i] == 'B' && s[i + 1] == 'C') {
c += a;
i++;
} else {
a = 0;
}
}
cout << c << endl;
}
| [
"variable_declaration.type.change"
] | 834,793 | 834,792 | u540491484 | cpp |
p03018 |
#include <cinttypes>
#include <iostream>
#include <regex>
#include <string>
using ui = std::uint32_t;
using ul = std::uint64_t;
int main() {
std::string raw;
std::cin >> raw;
auto s = std::regex_replace(raw, std::regex{"BC"}, "X");
ui ac;
ul ans{};
for (const auto &c : s)
if (c == 'A')
++ac;
else if (c == 'X')
ans += ac;
else
ac = 0;
std::cout << ans << "\n";
return 0;
} |
#include <cinttypes>
#include <iostream>
#include <regex>
#include <string>
using ui = std::uint32_t;
using ul = std::uint64_t;
int main() {
std::string raw;
std::cin >> raw;
auto s = std::regex_replace(raw, std::regex{"BC"}, "X");
ui ac{};
ul ans{};
for (const auto &c : s)
if (c == 'A')
++ac;
else if (c == 'X')
ans += ac;
else
ac = 0;
std::cout << ans << "\n";
return 0;
} | [] | 834,796 | 834,797 | u837286475 | cpp |
p03018 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s;
void solve() {
reverse(s.begin(), s.end());
char prev = '#';
int ans = 0;
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (prev == '#') {
if (s[i] == 'C')
prev = 'C';
} else if (prev == 'C') {
if (s[i] == 'B') {
count++;
prev = 'B';
} else if (prev == 'C') {
count = 0;
} else {
count = 0;
prev = '#';
}
} else if (prev == 'B') {
if (s[i] == 'A') {
ans += count;
} else if (s[i] == 'C') {
prev = 'C';
} else {
count = 0;
prev = '#';
}
}
}
cout << ans << endl;
}
int main() {
cin >> s;
solve();
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s;
void solve() {
reverse(s.begin(), s.end());
char prev = '#';
long long ans = 0;
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (prev == '#') {
if (s[i] == 'C')
prev = 'C';
} else if (prev == 'C') {
if (s[i] == 'B') {
count++;
prev = 'B';
} else if (s[i] == 'C') {
count = 0;
} else {
count = 0;
prev = '#';
}
} else if (prev == 'B') {
if (s[i] == 'A') {
ans += count;
} else if (s[i] == 'C') {
prev = 'C';
} else {
count = 0;
prev = '#';
}
}
}
cout << ans << endl;
}
int main() {
cin >> s;
solve();
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 834,836 | 834,835 | u540433787 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, j, n) for (int i = (j); i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
int m;
vector<int> a, bc, abc;
bool connected(int i) {
if (abc[i] + 2 * bc[i] + 3 == abc[i + 1] - a[i + 1])
return true;
else
return false;
}
signed main() {
string s;
cin >> s;
int n = s.size();
rep(i, n - 2) if (s.substr(i, 3) == "ABC") abc.push_back(i);
for (auto &&u : abc) {
int i = u, cnt = 0;
while (i >= 0 && s[i] == 'A') {
i--;
cnt++;
}
a.push_back(cnt);
}
for (auto &&u : abc) {
int i = u + 3, cnt = 0;
while (i < n - 2 && s.substr(i, 2) == "BC") {
i += 2;
cnt++;
}
bc.push_back(cnt);
}
m = abc.size();
int ans = 0;
int M = 0;
for (int i = 0; i < m; i++) {
M += a[i] + 1;
ans += M * (bc[i] + 1);
if (i < m - 1) {
if (!connected(i))
M = 0;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, j, n) for (int i = (j); i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
int m;
vector<int> a, bc, abc;
bool connected(int i) {
if (abc[i] + 2 * bc[i] + 3 == abc[i + 1] - a[i + 1])
return true;
else
return false;
}
signed main() {
string s;
cin >> s;
int n = s.size();
rep(i, n - 2) if (s.substr(i, 3) == "ABC") abc.push_back(i);
for (auto &&u : abc) {
int i = u - 1, cnt = 0;
while (i >= 0 && s[i] == 'A') {
i--;
cnt++;
}
a.push_back(cnt);
}
for (auto &&u : abc) {
int i = u + 3, cnt = 0;
while (i < n - 1 && s.substr(i, 2) == "BC") {
i += 2;
cnt++;
}
bc.push_back(cnt);
}
// for (auto&& u : abc) cout << u << ((&u < &abc.back()) ? " " : "\n");
// for (auto&& u : a) cout << u << ((&u < &a.back()) ? " " : "\n");
// for (auto&& u : bc) cout << u << ((&u < &bc.back()) ? " " : "\n");
m = abc.size();
int ans = 0;
int M = 0;
for (int i = 0; i < m; i++) {
M += a[i] + 1;
ans += M * (bc[i] + 1);
if (i < m - 1) {
if (!connected(i))
M = 0;
}
}
cout << ans << endl;
} | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 834,840 | 834,838 | u731175398 | cpp |
p03019 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
long long b[n], l[n], u[n];
for (int i = 0; i < n; i++)
cin >> b[i] >> l[i] >> u[i];
vector<int> v(n);
iota(v.begin(), v.end(), 0);
sort(v.begin(), v.end(), [&](int i, int j) {
return (u[i] - l[i]) * b[i] - u[i] * x < (u[j] - l[j]) * b[j] - u[j] * x;
});
long long sum = 0;
for (int i = 0; i < n; i++)
sum -= l[i] * b[i];
long long s[n + 1];
s[0] = sum;
for (int i = 0; i < n; i++) {
int j = v[i];
s[i + 1] = s[i] + u[j] * (x - b[j]) + l[j] * b[j];
}
// cerr << sum << endl;
long long ans = 1LL << 60;
for (int i = 0; i < n; i++) {
int j = v[i];
long long add = 1LL << 60;
if (s[i] >= 0) {
int k = lower_bound(s, s + i, -l[j] * b[j] - u[j] * (x - b[j])) - s;
if (s[k] + l[j] * b[j] >= 0) {
add = b[j] + (-s[k] + l[j] - 1) / l[j];
} else {
long long amt = -(l[j] * b[j] + s[k]);
add = b[j] + (amt + u[j] - 1) / u[j];
}
ans = min(ans, (long long)x * k + max(add, 0LL));
} else {
int k = lower_bound(s, s + n, 0) - s;
long long t = s[k] - l[j] * b[j] - u[j] * (x - b[j]);
if (t + l[j] * b[j] >= 0) {
add = (-t + l[j] - 1) / l[j];
} else {
long long amt = -(l[j] * b[j] + t);
add = b[j] + (amt + u[j] - 1) / u[j];
}
ans = min(ans, (long long)x * (k - 1) + add);
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
long long b[n], l[n], u[n];
for (int i = 0; i < n; i++)
cin >> b[i] >> l[i] >> u[i];
vector<int> v(n);
iota(v.begin(), v.end(), 0);
sort(v.begin(), v.end(), [&](int i, int j) {
return (u[i] - l[i]) * b[i] - u[i] * x < (u[j] - l[j]) * b[j] - u[j] * x;
});
long long sum = 0;
for (int i = 0; i < n; i++)
sum -= l[i] * b[i];
long long s[n + 1];
s[0] = sum;
for (int i = 0; i < n; i++) {
int j = v[i];
s[i + 1] = s[i] + u[j] * (x - b[j]) + l[j] * b[j];
}
// cerr << sum << endl;
long long ans = 1LL << 60;
for (int i = 0; i < n; i++) {
int j = v[i];
long long add = 1LL << 60;
if (s[i] >= 0) {
int k = lower_bound(s, s + i, -l[j] * b[j] - u[j] * (x - b[j])) - s;
if (s[k] + l[j] * b[j] >= 0) {
add = (-s[k] + l[j] - 1) / l[j];
} else {
long long amt = -(l[j] * b[j] + s[k]);
add = b[j] + (amt + u[j] - 1) / u[j];
}
ans = min(ans, (long long)x * k + max(add, 0LL));
} else {
int k = lower_bound(s, s + n, 0) - s;
long long t = s[k] - l[j] * b[j] - u[j] * (x - b[j]);
if (t + l[j] * b[j] >= 0) {
add = (-t + l[j] - 1) / l[j];
} else {
long long amt = -(l[j] * b[j] + t);
add = b[j] + (amt + u[j] - 1) / u[j];
}
ans = min(ans, (long long)x * (k - 1) + add);
}
}
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 834,875 | 834,876 | u374416262 | cpp |
p03019 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
int b[maxn] = {0}, l[maxn] = {0}, u[maxn] = {0};
long long pre[maxn] = {0}, sum[maxn] = {0};
int mult(int who, int k) {
if (k >= b[who]) {
return u[who];
}
return l[who];
}
// vector <pair <long long, int> > G;
pair<long long, int> a[maxn];
bool check(int n, int m, int k) {
for (int i = 1; i <= m; i++) {
int p = a[i].second;
// int p = G[i - 1].second;
int multi = mult(p, k);
long long a1 =
sum[m + 1] - sum[i] + sum[i + 1] + (long long)(k - b[p]) * multi;
long long a2 = pre[n] - pre[m + 1];
/*if(sum[m + 1] - sum[i] + sum[i - 1] +
(long long)(k - b[p]) * multi - pre[n] + pre[m + 1] >= 0){
return true;
}*/
if (a1 >= a2) {
return true;
}
}
for (int i = m + 1; i <= n; i++) {
int p = a[i].second;
// int p = G[i - 1].second;
int multi = mult(p, k);
long long a1 = sum[m] + (long long)(k - b[p]) * multi;
long long a2 = pre[n] - pre[i] + pre[i - 1] - pre[m];
/*if(sum[m] + (long long)(k - b[p]) * multi
- pre[n] + pre[i] - pre[i - 1] + pre[m] >= 0){return true;}*/
if (a1 >= a2) {
return true;
}
}
// system("pause");
return false;
}
/*int check(int n, int m, int k)
{
for(int i = 1; i <= m; i++)
{
int p = a[i].second;
if(sum[m+1]-sum[i]+sum[i-1]+(long long)(k-b[p])*(k >= b[p] ?
u[p] : l[p])-pre[n]+pre[m+1]>=0)
{
return true;
}
}
for(int i = m+1; i <= n; i++)
{
int p = a[i].second;
if(sum[m]+(long long)(k-b[p])*(k >= b[p] ? u[p] :
l[p])-pre[n]+pre[i]-pre[i-1]+pre[m]>=0)
{
return true;
}
}
return false;
}*/
/*int main(){
int n, x;
scanf("%d%d", &n, &x);
for(int i = 1; i <= n; i++){
scanf("%d%d%d", &B[i], &L[i], &U[i]);
long long anw = (long long)B[i] * L[i] + (long long)((x - B[i]) * U[i]);
//G.push_back(make_pair(anw, i));
G[i] = make_pair(anw, i);
}
sort(G + 1, G + 1 + n);
reverse(G + 1, G + 1 + n);
//sort(G.begin(), G.end());
//reverse(G.begin(), G.end());
for(int i = 1; i <= n; i++){
int j = G[i].second;
//int j = G[i - 1].second;
pre[i] = pre[i - 1] + (long long)(B[j] * L[j]);
sum[i] = sum[i - 1] + (long long)((x - B[j]) * U[j]);
}
long long L1 = 0, R = (long long)n * x;
while(L1 < R){
long long mid = (L1 + R) >> 1;
if(check(n, mid / x, mid % x)){
R = mid;
}
else{
L1 = mid + 1;
}
}
printf("%lld", L1);
return 0;
}*/
int main() {
int n, x;
scanf("%d%d", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d%d%d", &b[i], &l[i], &u[i]);
long long anw = (long long)b[i] * l[i] + (long long)(x - b[i]) * u[i];
a[i] = make_pair(anw, i);
// a[i] = make_pair((ll)(x-b[i])*u[i]+(ll)b[i]*l[i], i);
}
sort(a + 1, a + 1 + n);
reverse(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
int j = a[i].second;
pre[i] = pre[i - 1] + (ll)b[j] * l[j];
sum[i] = sum[i - 1] + (ll)(x - b[j]) * u[j];
}
ll l = 0, r = (ll)n * x;
while (l < r) {
ll mid = (l + r) >> 1;
if (check(n, mid / x, mid % x)) {
r = mid;
} else {
l = mid + 1;
}
}
printf("%lld\n", l);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
int b[maxn] = {0}, l[maxn] = {0}, u[maxn] = {0};
long long pre[maxn] = {0}, sum[maxn] = {0};
int mult(int who, int k) {
if (k >= b[who]) {
return u[who];
}
return l[who];
}
// vector <pair <long long, int> > G;
pair<long long, int> a[maxn];
bool check(int n, int m, int k) {
for (int i = 1; i <= m; i++) {
int p = a[i].second;
// int p = G[i - 1].second;
int multi = mult(p, k);
long long a1 =
sum[m + 1] - sum[i] + sum[i - 1] + (long long)(k - b[p]) * multi;
long long a2 = pre[n] - pre[m + 1];
/*if(sum[m + 1] - sum[i] + sum[i - 1] +
(long long)(k - b[p]) * multi - pre[n] + pre[m + 1] >= 0){
return true;
}*/
if (a1 >= a2) {
return true;
}
}
for (int i = m + 1; i <= n; i++) {
int p = a[i].second;
// int p = G[i - 1].second;
int multi = mult(p, k);
long long a1 = sum[m] + (long long)(k - b[p]) * multi;
long long a2 = pre[n] - pre[i] + pre[i - 1] - pre[m];
/*if(sum[m] + (long long)(k - b[p]) * multi
- pre[n] + pre[i] - pre[i - 1] + pre[m] >= 0){return true;}*/
if (a1 >= a2) {
return true;
}
}
// system("pause");
return false;
}
/*int main(){
int n, x;
scanf("%d%d", &n, &x);
for(int i = 1; i <= n; i++){
scanf("%d%d%d", &B[i], &L[i], &U[i]);
long long anw = (long long)B[i] * L[i] + (long long)((x - B[i]) * U[i]);
//G.push_back(make_pair(anw, i));
G[i] = make_pair(anw, i);
}
sort(G + 1, G + 1 + n);
reverse(G + 1, G + 1 + n);
//sort(G.begin(), G.end());
//reverse(G.begin(), G.end());
for(int i = 1; i <= n; i++){
int j = G[i].second;
//int j = G[i - 1].second;
pre[i] = pre[i - 1] + (long long)(B[j] * L[j]);
sum[i] = sum[i - 1] + (long long)((x - B[j]) * U[j]);
}
long long L1 = 0, R = (long long)n * x;
while(L1 < R){
long long mid = (L1 + R) >> 1;
if(check(n, mid / x, mid % x)){
R = mid;
}
else{
L1 = mid + 1;
}
}
printf("%lld", L1);
return 0;
}*/
int main() {
int n, x;
scanf("%d%d", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d%d%d", &b[i], &l[i], &u[i]);
long long anw = (long long)b[i] * l[i] + (long long)(x - b[i]) * u[i];
a[i] = make_pair(anw, i);
// a[i] = make_pair((ll)(x-b[i])*u[i]+(ll)b[i]*l[i], i);
}
sort(a + 1, a + 1 + n);
reverse(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
int j = a[i].second;
pre[i] = pre[i - 1] + (long long)b[j] * l[j];
sum[i] = sum[i - 1] + (long long)(x - b[j]) * u[j];
}
ll l = 0, r = (ll)n * x;
while (l < r) {
ll mid = (l + r) >> 1;
if (check(n, mid / x, mid % x)) {
r = mid;
} else {
l = mid + 1;
}
}
printf("%lld\n", l);
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_declaration.type.widen.change"
] | 834,885 | 834,884 | u125824817 | cpp |
p03019 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
int b[maxn] = {0}, l[maxn] = {0}, u[maxn] = {0};
long long pre[maxn] = {0}, sum[maxn] = {0};
int mult(int who, int k) {
if (k >= b[who]) {
return u[who];
}
return l[who];
}
// vector <pair <long long, int> > G;
pair<long long, int> a[maxn];
bool check(int n, int m, int k) {
for (int i = 1; i <= m; i++) {
int p = a[i].second;
// int p = G[i - 1].second;
int multi = mult(p, k);
long long a1 =
sum[m + 1] - sum[i] + sum[i + 1] + (long long)(k - b[p]) * multi;
long long a2 = pre[n] - pre[m + 1];
/*if(sum[m + 1] - sum[i] + sum[i - 1] +
(long long)(k - b[p]) * multi - pre[n] + pre[m + 1] >= 0){
return true;
}*/
if (a1 >= a2) {
return true;
}
}
for (int i = m + 1; i <= n; i++) {
int p = a[i].second;
// int p = G[i - 1].second;
int multi = mult(p, k);
long long a1 = sum[m] + (long long)(k - b[p]) * multi;
long long a2 = pre[n] - pre[i] + pre[i - 1] - pre[m];
/*if(sum[m] + (long long)(k - b[p]) * multi
- pre[n] + pre[i] - pre[i - 1] + pre[m] >= 0){return true;}*/
if (a1 >= a2) {
return true;
}
}
// system("pause");
return false;
}
/*int check(int n, int m, int k)
{
for(int i = 1; i <= m; i++)
{
int p = a[i].second;
if(sum[m+1]-sum[i]+sum[i-1]+(long long)(k-b[p])*(k >= b[p] ?
u[p] : l[p])-pre[n]+pre[m+1]>=0)
{
return true;
}
}
for(int i = m+1; i <= n; i++)
{
int p = a[i].second;
if(sum[m]+(long long)(k-b[p])*(k >= b[p] ? u[p] :
l[p])-pre[n]+pre[i]-pre[i-1]+pre[m]>=0)
{
return true;
}
}
return false;
}*/
/*int main(){
int n, x;
scanf("%d%d", &n, &x);
for(int i = 1; i <= n; i++){
scanf("%d%d%d", &B[i], &L[i], &U[i]);
long long anw = (long long)B[i] * L[i] + (long long)((x - B[i]) * U[i]);
//G.push_back(make_pair(anw, i));
G[i] = make_pair(anw, i);
}
sort(G + 1, G + 1 + n);
reverse(G + 1, G + 1 + n);
//sort(G.begin(), G.end());
//reverse(G.begin(), G.end());
for(int i = 1; i <= n; i++){
int j = G[i].second;
//int j = G[i - 1].second;
pre[i] = pre[i - 1] + (long long)(B[j] * L[j]);
sum[i] = sum[i - 1] + (long long)((x - B[j]) * U[j]);
}
long long L1 = 0, R = (long long)n * x;
while(L1 < R){
long long mid = (L1 + R) >> 1;
if(check(n, mid / x, mid % x)){
R = mid;
}
else{
L1 = mid + 1;
}
}
printf("%lld", L1);
return 0;
}*/
int main() {
int n, x;
scanf("%d%d", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d%d%d", &b[i], &l[i], &u[i]);
long long anw = (long long)b[i] * l[i] + (long long)(x - b[i]) * u[i];
a[i] = make_pair(anw, i);
// a[i] = make_pair((ll)(x-b[i])*u[i]+(ll)b[i]*l[i], i);
}
sort(a + 1, a + 1 + n);
reverse(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
int j = a[i].second;
pre[i] = pre[i - 1] + (ll)b[j] * l[j];
sum[i] = sum[i - 1] + (ll)(x - b[j]) * u[j];
}
ll l = 0, r = (ll)n * x;
while (l < r) {
ll mid = (l + r) >> 1;
if (check(n, mid / x, mid % x)) {
r = mid;
} else {
l = mid + 1;
}
}
printf("%lld\n", l);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
int b[maxn] = {0}, l[maxn] = {0}, u[maxn] = {0};
long long pre[maxn] = {0}, sum[maxn] = {0};
int mult(int who, int k) {
if (k >= b[who]) {
return u[who];
}
return l[who];
}
// vector <pair <long long, int> > G;
pair<long long, int> a[maxn];
bool check(int n, int m, int k) {
for (int i = 1; i <= m; i++) {
int p = a[i].second;
// int p = G[i - 1].second;
int multi = mult(p, k);
long long a1 =
sum[m + 1] - sum[i] + sum[i - 1] + (long long)(k - b[p]) * multi;
long long a2 = pre[n] - pre[m + 1];
/*if(sum[m + 1] - sum[i] + sum[i - 1] +
(long long)(k - b[p]) * multi - pre[n] + pre[m + 1] >= 0){
return true;
}*/
if (a1 >= a2) {
return true;
}
}
for (int i = m + 1; i <= n; i++) {
int p = a[i].second;
// int p = G[i - 1].second;
int multi = mult(p, k);
long long a1 = sum[m] + (long long)(k - b[p]) * multi;
long long a2 = pre[n] - pre[i] + pre[i - 1] - pre[m];
/*if(sum[m] + (long long)(k - b[p]) * multi
- pre[n] + pre[i] - pre[i - 1] + pre[m] >= 0){return true;}*/
if (a1 >= a2) {
return true;
}
}
// system("pause");
return false;
}
/*int check(int n, int m, int k)
{
for(int i = 1; i <= m; i++)
{
int p = a[i].second;
if(sum[m+1]-sum[i]+sum[i-1]+(long long)(k-b[p])*(k >= b[p] ?
u[p] : l[p])-pre[n]+pre[m+1]>=0)
{
return true;
}
}
for(int i = m+1; i <= n; i++)
{
int p = a[i].second;
if(sum[m]+(long long)(k-b[p])*(k >= b[p] ? u[p] :
l[p])-pre[n]+pre[i]-pre[i-1]+pre[m]>=0)
{
return true;
}
}
return false;
}*/
/*int main(){
int n, x;
scanf("%d%d", &n, &x);
for(int i = 1; i <= n; i++){
scanf("%d%d%d", &B[i], &L[i], &U[i]);
long long anw = (long long)B[i] * L[i] + (long long)((x - B[i]) * U[i]);
//G.push_back(make_pair(anw, i));
G[i] = make_pair(anw, i);
}
sort(G + 1, G + 1 + n);
reverse(G + 1, G + 1 + n);
//sort(G.begin(), G.end());
//reverse(G.begin(), G.end());
for(int i = 1; i <= n; i++){
int j = G[i].second;
//int j = G[i - 1].second;
pre[i] = pre[i - 1] + (long long)(B[j] * L[j]);
sum[i] = sum[i - 1] + (long long)((x - B[j]) * U[j]);
}
long long L1 = 0, R = (long long)n * x;
while(L1 < R){
long long mid = (L1 + R) >> 1;
if(check(n, mid / x, mid % x)){
R = mid;
}
else{
L1 = mid + 1;
}
}
printf("%lld", L1);
return 0;
}*/
int main() {
int n, x;
scanf("%d%d", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d%d%d", &b[i], &l[i], &u[i]);
long long anw = (long long)b[i] * l[i] + (long long)(x - b[i]) * u[i];
a[i] = make_pair(anw, i);
// a[i] = make_pair((ll)(x-b[i])*u[i]+(ll)b[i]*l[i], i);
}
sort(a + 1, a + 1 + n);
reverse(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
int j = a[i].second;
pre[i] = pre[i - 1] + (ll)b[j] * l[j];
sum[i] = sum[i - 1] + (ll)(x - b[j]) * u[j];
}
ll l = 0, r = (ll)n * x;
while (l < r) {
ll mid = (l + r) >> 1;
if (check(n, mid / x, mid % x)) {
r = mid;
} else {
l = mid + 1;
}
}
printf("%lld\n", l);
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 834,885 | 834,886 | u125824817 | cpp |
p03019 | #include <algorithm>
#include <cstdio>
#include <cstring>
#define ll long long
using namespace std;
int rdn() {
int ret = 0;
bool fx = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-')
fx = 0;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
ret = ret * 10 + ch - '0', ch = getchar();
return fx ? ret : -ret;
}
ll Mx(ll a, ll b) { return a > b ? a : b; }
const int N = 1e5 + 5;
int n, X, nw;
ll sf[N], val;
bool vis[N];
struct Node {
int l, r, b;
ll s1, sm;
bool operator<(const Node &b) const { return sm > b.sm; }
} a[N];
ll cal(int i) {
if (nw <= a[i].b)
return (ll)nw * a[i].l;
return a[i].s1 + (ll)(nw - a[i].b) * a[i].r;
}
bool chk(ll mid) {
if (mid % X == 0)
return sf[mid / X];
ll lj = 0;
int k = mid / X;
nw = mid % X;
for (int i = 1; i <= k; i++)
lj = Mx(lj, sf[k] - a[i].sm + a[k + 1].sm + cal(i));
for (int i = k + 1; i <= n; i++)
lj = Mx(lj, sf[k] + cal(i));
return lj >= val;
}
int main() {
n = rdn();
X = rdn();
ll l = 0, r = 0, ans;
for (int i = 1; i <= n; i++) {
a[i].b = rdn();
a[i].l = rdn();
a[i].r = rdn();
a[i].s1 = (ll)a[i].b * a[i].l;
a[i].sm = a[i].s1 + (ll)(X - a[i].b) * a[i].r;
val += a[i].s1;
r += a[i].b;
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++)
sf[i] = sf[i - 1] + a[i].sm;
while (l <= r) {
ll mid = l + r >> 1;
if (chk(mid))
ans = mid, r = mid - 1;
else
l = mid + 1;
}
printf("%lld\n", ans);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#define ll long long
using namespace std;
int rdn() {
int ret = 0;
bool fx = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-')
fx = 0;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
ret = ret * 10 + ch - '0', ch = getchar();
return fx ? ret : -ret;
}
ll Mx(ll a, ll b) { return a > b ? a : b; }
const int N = 1e5 + 5;
int n, X, nw;
ll sf[N], val;
bool vis[N];
struct Node {
int l, r, b;
ll s1, sm;
bool operator<(const Node &b) const { return sm > b.sm; }
} a[N];
ll cal(int i) {
if (nw <= a[i].b)
return (ll)nw * a[i].l;
return a[i].s1 + (ll)(nw - a[i].b) * a[i].r;
}
bool chk(ll mid) {
if (mid % X == 0)
return sf[mid / X] >= val;
ll lj = 0;
int k = mid / X;
nw = mid % X;
for (int i = 1; i <= k; i++)
lj = Mx(lj, sf[k] - a[i].sm + a[k + 1].sm + cal(i));
for (int i = k + 1; i <= n; i++)
lj = Mx(lj, sf[k] + cal(i));
return lj >= val;
}
int main() {
n = rdn();
X = rdn();
ll l = 0, r = 0, ans;
for (int i = 1; i <= n; i++) {
a[i].b = rdn();
a[i].l = rdn();
a[i].r = rdn();
a[i].s1 = (ll)a[i].b * a[i].l;
a[i].sm = a[i].s1 + (ll)(X - a[i].b) * a[i].r;
val += a[i].s1;
r += a[i].b;
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++)
sf[i] = sf[i - 1] + a[i].sm;
while (l <= r) {
ll mid = l + r >> 1;
if (chk(mid))
ans = mid, r = mid - 1;
else
l = mid + 1;
}
printf("%lld\n", ans);
return 0;
}
| [
"expression.operation.binary.add"
] | 834,889 | 834,890 | u756994119 | cpp |
p03019 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#define ll long long
#define rg register
#define go(i, x, a) for (rg int i = a; i < x; i++)
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
using namespace std;
const int maxn = 1e5 + 5;
ll n, X;
ll sf[maxn], ans;
struct pt {
ll l, r, b, f;
friend bool operator<(pt a, pt b) { return a.f > b.f; }
} p[maxn];
inline int rd() {
int ret = 0, af = 1;
char gc = getchar();
while (gc < '0' || gc > '9') {
if (gc == '-')
af = -af;
gc = getchar();
}
while (gc >= '0' && gc <= '9')
ret = ret * 10 + gc - '0', gc = getchar();
return ret * af;
}
inline bool check(ll x) {
ll a = x / X, b = x % X;
if (a == n)
return ans + sf[a] >= 0;
go(i, n + 1, 1) {
ll ss = ans;
if (i <= a) {
if (b <= p[i].b)
ss = ss + sf[a + 1] - p[i].f + b * p[i].l;
else
ss = ss + sf[a + 1] - p[i].f + p[i].b * p[i].l + (b - p[i].b) * p[i].r;
} else {
if (b <= p[i].b)
ss = ss + sf[a] + b * p[i].l;
else
ss = ss + sf[a] + p[i].b * p[i].l + (b - p[i].b) * p[i].r;
}
if (ss >= 0)
return 1;
}
return 0;
}
void pre() {
go(i, n + 1, 1) p[i].f = (ll)(X - p[i].b) * p[i].r + p[i].b * p[i].l,
ans = ans - p[i].b * p[i].l;
sort(p + 1, p + n + 1);
go(i, n + 1, 1) sf[i] = sf[i - 1] + p[i].f;
}
int main() {
// freopen("1.in","r",stdin);
n = rd();
X = rd();
ll l = 0, r, res = -1;
go(i, n + 1, 1) p[i].b = rd(), p[i].l = rd(), p[i].r = rd(), r = r + p[i].b;
pre();
while (l <= r) {
ll mid = l + r >> 1;
if (check(mid))
res = mid, r = mid - 1;
else
l = mid + 1;
}
printf("%lld", res);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#define ll long long
#define rg register
#define go(i, x, a) for (rg int i = a; i < x; i++)
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
using namespace std;
const int maxn = 1e5 + 5;
ll n, X;
ll sf[maxn], ans;
struct pt {
ll l, r, b, f;
friend bool operator<(pt a, pt b) { return a.f > b.f; }
} p[maxn];
inline int rd() {
int ret = 0, af = 1;
char gc = getchar();
while (gc < '0' || gc > '9') {
if (gc == '-')
af = -af;
gc = getchar();
}
while (gc >= '0' && gc <= '9')
ret = ret * 10 + gc - '0', gc = getchar();
return ret * af;
}
inline bool check(ll x) {
ll a = x / X, b = x % X;
if (a == n)
return ans + sf[a] >= 0;
go(i, n + 1, 1) {
ll ss = ans;
if (i <= a) {
if (b <= p[i].b)
ss = ss + sf[a + 1] - p[i].f + b * p[i].l;
else
ss = ss + sf[a + 1] - p[i].f + p[i].b * p[i].l + (b - p[i].b) * p[i].r;
} else {
if (b <= p[i].b)
ss = ss + sf[a] + b * p[i].l;
else
ss = ss + sf[a] + p[i].b * p[i].l + (b - p[i].b) * p[i].r;
}
if (ss >= 0)
return 1;
}
return 0;
}
void pre() {
go(i, n + 1, 1) p[i].f = (ll)(X - p[i].b) * p[i].r + p[i].b * p[i].l,
ans = ans - p[i].b * p[i].l;
sort(p + 1, p + n + 1);
go(i, n + 1, 1) sf[i] = sf[i - 1] + p[i].f;
}
int main() {
// freopen("1.in","r",stdin);
n = rd();
X = rd();
ll l = 0, r = 0, res = -1;
go(i, n + 1, 1) p[i].b = rd(), p[i].l = rd(), p[i].r = rd(), r = r + p[i].b;
pre();
while (l <= r) {
ll mid = l + r >> 1;
if (check(mid))
res = mid, r = mid - 1;
else
l = mid + 1;
}
printf("%lld", res);
return 0;
} | [
"variable_declaration.value.change"
] | 834,908 | 834,909 | u732254919 | cpp |
p03019 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#define ll long long
#define rg register
#define go(i, x, a) for (rg int i = a; i < x; i++)
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
using namespace std;
const int maxn = 1e5 + 5;
ll n, X;
ll sf[maxn], ans;
struct pt {
ll l, r, b, f;
friend bool operator<(pt a, pt b) { return a.f > b.f; }
} p[maxn];
inline int rd() {
int ret = 0, af = 1;
char gc = getchar();
while (gc < '0' || gc > '9') {
if (gc == '-')
af = -af;
gc = getchar();
}
while (gc >= '0' && gc <= '9')
ret = ret * 10 + gc - '0', gc = getchar();
return ret * af;
}
inline bool check(ll x) {
ll a = x / X, b = x % X;
if (b == 0)
return ans + sf[a] >= 0;
go(i, n + 1, 1) {
ll ss = ans;
if (i <= a) {
if (b <= p[i].b)
ss = ss + sf[a + 1] - p[i].f + b * p[i].l;
else
ss = ss + sf[a + 1] - p[i].f + p[i].b * p[i].l + (b - p[i].b) * p[i].r;
} else {
if (b <= p[i].b)
ss = ss + sf[a] + b * p[i].l;
else
ss = ss + sf[a] + p[i].b * p[i].l + (b - p[i].b) * p[i].r;
}
if (ss >= 0)
return 1;
}
return 0;
}
void pre() {
go(i, n + 1, 1) p[i].f = (ll)(X - p[i].b) * p[i].r + p[i].b * p[i].l,
ans = ans - p[i].b * p[i].l;
sort(p + 1, p + n + 1);
go(i, n + 1, 1) sf[i] = sf[i - 1] + p[i].f;
}
int main() {
// freopen("1.in","r",stdin);
n = rd();
X = rd();
ll l = 0, r, res = -1;
go(i, n + 1, 1) p[i].b = rd(), p[i].l = rd(), p[i].r = rd(), r = r + p[i].b;
pre();
while (l <= r) {
ll mid = l + r >> 1;
if (check(mid))
res = mid, r = mid - 1;
else
l = mid + 1;
}
printf("%lld", res);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#define ll long long
#define rg register
#define go(i, x, a) for (rg int i = a; i < x; i++)
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
using namespace std;
const int maxn = 1e5 + 5;
ll n, X;
ll sf[maxn], ans;
struct pt {
ll l, r, b, f;
friend bool operator<(pt a, pt b) { return a.f > b.f; }
} p[maxn];
inline int rd() {
int ret = 0, af = 1;
char gc = getchar();
while (gc < '0' || gc > '9') {
if (gc == '-')
af = -af;
gc = getchar();
}
while (gc >= '0' && gc <= '9')
ret = ret * 10 + gc - '0', gc = getchar();
return ret * af;
}
inline bool check(ll x) {
ll a = x / X, b = x % X;
if (a == n)
return ans + sf[a] >= 0;
go(i, n + 1, 1) {
ll ss = ans;
if (i <= a) {
if (b <= p[i].b)
ss = ss + sf[a + 1] - p[i].f + b * p[i].l;
else
ss = ss + sf[a + 1] - p[i].f + p[i].b * p[i].l + (b - p[i].b) * p[i].r;
} else {
if (b <= p[i].b)
ss = ss + sf[a] + b * p[i].l;
else
ss = ss + sf[a] + p[i].b * p[i].l + (b - p[i].b) * p[i].r;
}
if (ss >= 0)
return 1;
}
return 0;
}
void pre() {
go(i, n + 1, 1) p[i].f = (ll)(X - p[i].b) * p[i].r + p[i].b * p[i].l,
ans = ans - p[i].b * p[i].l;
sort(p + 1, p + n + 1);
go(i, n + 1, 1) sf[i] = sf[i - 1] + p[i].f;
}
int main() {
// freopen("1.in","r",stdin);
n = rd();
X = rd();
ll l = 0, r = 0, res = -1;
go(i, n + 1, 1) p[i].b = rd(), p[i].l = rd(), p[i].r = rd(), r = r + p[i].b;
pre();
while (l <= r) {
ll mid = l + r >> 1;
if (check(mid))
res = mid, r = mid - 1;
else
l = mid + 1;
}
printf("%lld", res);
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.value.change"
] | 834,910 | 834,909 | u732254919 | cpp |
p03019 | // C - Tests
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
long long x, pre = 0;
cin >> n >> x;
vector<long long> b(n), l(n), u(n);
for (int i = 0; i < n; i++) {
cin >> b[i] >> l[i] >> u[i];
pre += -l[i] * b[i];
}
vector<pair<long long, int>> o(n);
for (int i = 0; i < n; i++)
o[i] = make_pair((x - b[i]) * u[i] + l[i] * b[i], i);
sort(o.begin(), o.end(), greater<pair<long long, int>>());
vector<long long> z(n);
for (int i = 0; i < n; i++)
z[i] = (i > 0 ? z[i - 1] : 0) + o[i].first;
long long lo = 0, hi = n * x;
while (lo < hi) {
long long k = (lo + hi) / 2, q = k / x, r = k % x;
bool found = false;
for (int j = 0; j < n; j++) {
int i = o[j].second;
long long sum = pre + l[i] * b[i] + (r - b[i]) * (r < b[i] ? l[i] : u[i]);
if (j < q)
sum += z[q] - o[j].first;
else
sum += z[q - 1];
if (sum >= 0) {
found = true;
break;
}
}
if (!found)
lo = k + 1;
else
hi = k;
}
cout << lo << endl;
return 0;
}
| // C - Tests
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
long long x, pre = 0;
cin >> n >> x;
vector<long long> b(n), l(n), u(n);
for (int i = 0; i < n; i++) {
cin >> b[i] >> l[i] >> u[i];
pre += -l[i] * b[i];
}
vector<pair<long long, int>> o(n);
for (int i = 0; i < n; i++)
o[i] = make_pair((x - b[i]) * u[i] + l[i] * b[i], i);
sort(o.begin(), o.end(), greater<pair<long long, int>>());
vector<long long> z(n);
for (int i = 0; i < n; i++)
z[i] = (i > 0 ? z[i - 1] : 0) + o[i].first;
long long lo = 0, hi = n * x;
while (lo < hi) {
long long k = (lo + hi) / 2, q = k / x, r = k % x;
bool found = false;
for (int j = 0; j < n; j++) {
int i = o[j].second;
long long sum = pre + l[i] * b[i] + (r - b[i]) * (r < b[i] ? l[i] : u[i]);
if (j <= q)
sum += z[q] - o[j].first;
else
sum += z[q - 1];
if (sum >= 0) {
found = true;
break;
}
}
if (!found)
lo = k + 1;
else
hi = k;
}
cout << lo << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 834,911 | 834,912 | u839953699 | cpp |
p03019 | #include <bits/stdc++.h>
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define of(i, l, r) for (int i = l; i >= r; i--)
#define fe(i, u) for (int i = head[u]; i; i = e[i].next)
#define el putchar('\n')
#define ta putchar(' ')
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline void open(const char *s) {
#ifndef ONLINE_JUDGE
char str[20];
sprintf(str, "%s.in", s);
freopen(str, "r", stdin);
// sprintf(str,"%s.out",s);
// freopen(str,"w",stdout);
#endif
}
inline int rd() {
static int x, f;
x = 0;
f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return f > 0 ? x : -x;
}
const int N = 100010;
int n, m, a[N], ql[N], qr[N], id[N];
ll tot = 0, val[N];
bool vis[N];
int main() {
n = rd();
m = rd();
fo(i, 1, n) a[i] = rd(), ql[i] = rd(), qr[i] = rd(),
val[i] = 1ll * (m - a[i]) * qr[i] + a[i] * ql[i],
tot -= 1ll * ql[i] * a[i];
fo(i, 1, n) id[i] = i;
sort(id + 1, id + n + 1, [](int a, int b) { return val[a] > val[b]; });
ll sum = 0, ans;
int hh = 0;
fo(i, 1, n) {
sum += val[id[i]];
if (sum + tot >= 0) {
sum -= val[id[i]];
hh = i - 1;
ans = 1ll * i * m;
break;
}
vis[id[i]] = 1;
}
fo(i, 1, n) {
ll tmp = sum + tot;
if (vis[i]) {
tmp -= val[i];
tmp += val[hh + 1];
}
int l = 0, r = m;
while (l <= r) {
int mid = (l + r) >> 1;
ll hhh = tmp + 1ll * a[i] * ql[i];
if (mid < a[i])
hhh -= 1ll * (a[i] - mid) * ql[i];
else
hhh += 1ll * (mid - a[i]) * qr[i];
if (hhh >= 0)
r = mid - 1;
else
l = mid + 1;
}
++r;
if (r <= m)
ans = min(ans, 1ll * hh * m + r);
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define of(i, l, r) for (int i = l; i >= r; i--)
#define fe(i, u) for (int i = head[u]; i; i = e[i].next)
#define el putchar('\n')
#define ta putchar(' ')
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline void open(const char *s) {
#ifndef ONLINE_JUDGE
char str[20];
sprintf(str, "%s.in", s);
freopen(str, "r", stdin);
// sprintf(str,"%s.out",s);
// freopen(str,"w",stdout);
#endif
}
inline int rd() {
static int x, f;
x = 0;
f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return f > 0 ? x : -x;
}
const int N = 100010;
int n, m, a[N], ql[N], qr[N], id[N];
ll tot = 0, val[N];
bool vis[N];
int main() {
n = rd();
m = rd();
fo(i, 1, n) a[i] = rd(), ql[i] = rd(), qr[i] = rd(),
val[i] = 1ll * (m - a[i]) * qr[i] + 1ll * a[i] * ql[i],
tot -= 1ll * ql[i] * a[i];
fo(i, 1, n) id[i] = i;
sort(id + 1, id + n + 1, [](int a, int b) { return val[a] > val[b]; });
ll sum = 0, ans;
int hh = 0;
fo(i, 1, n) {
sum += val[id[i]];
if (sum + tot >= 0) {
sum -= val[id[i]];
hh = i - 1;
ans = 1ll * i * m;
break;
}
vis[id[i]] = 1;
}
fo(i, 1, n) {
ll tmp = sum + tot;
if (vis[i]) {
tmp -= val[i];
tmp += val[id[hh + 1]];
}
int l = 0, r = m;
while (l <= r) {
int mid = (l + r) >> 1;
ll hhh = tmp + 1ll * a[i] * ql[i];
if (mid < a[i])
hhh -= 1ll * (a[i] - mid) * ql[i];
else
hhh += 1ll * (mid - a[i]) * qr[i];
if (hhh >= 0)
r = mid - 1;
else
l = mid + 1;
}
++r;
if (r <= m)
ans = min(ans, 1ll * hh * m + r);
}
cout << ans;
return 0;
} | [
"assignment.change"
] | 834,937 | 834,936 | u162067352 | cpp |
p03019 | #include <bits/stdc++.h>
#define FOR0(i, n) for (i = 0; i < n; i++)
#define FOR(i, j, n) for (i = j; i < n; i++)
#define FORD(i, j, k) for (i = j; i >= k; i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define inf 1000000000
#define ninf -1000000000
#define endl '\n'
#define she_told_me_dont_worry \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
// Use cout.flush() for interactive problems.
// Use this for increased stack size: g++ -o a.exe -Wl,--stack=256000000 -O2
// source.cpp
inline long long MAX2(long long a, long long int b) {
return (a) > (b) ? (a) : (b);
}
inline long long MAX3(long long a, long long b, long long c) {
return (a) > (b) ? ((a) > (c) ? (a) : (c)) : ((b) > (c) ? (b) : (c));
}
inline long long MIN2(long long a, long long b) {
return (a) < (b) ? (a) : (b);
}
inline long long MIN3(long long a, long long b, long long c) {
return (a) < (b) ? ((a) < (c) ? (a) : (c)) : ((b) < (c) ? (b) : (c));
}
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef struct exam {
ll l, u, b;
exam(ll x, ll y, ll z) {
b = x;
l = y;
u = z;
}
} Exam;
ll n, x;
bool Compare(Exam const &ls, Exam const &rs) {
return (ls.u * (x - ls.b) + ls.l * ls.b) > (rs.u * (x - rs.b) + rs.l * ls.b);
}
ll val[100005] = {};
vector<Exam> e;
ll B = 0;
ll get_val(ll a) {
if (a != 0)
return val[a] - val[a - 1];
return val[a];
}
bool perform(ll rem) {
int i;
ll use;
ll q = (rem / x);
ll r = rem % x;
ll A = ninf;
ll temp = 0;
if (q > 0)
temp = val[q - 1];
A = temp;
if (r != 0) {
FOR0(i, n) {
ll cur = temp;
if (i <= q - 1) {
cur -= get_val(i);
cur += get_val(q);
}
if (r > e[i].b)
cur += e[i].u * (r - e[i].b) + e[i].b * e[i].l;
else
cur += r * e[i].l;
A = MAX2(A, cur);
}
}
if (A >= B)
return true;
return false;
}
int main() {
she_told_me_dont_worry cin >> n >> x;
ll i;
FOR0(i, n) {
ll b, l, u;
cin >> b >> l >> u;
e.push_back(exam(b, l, u));
}
sort(e.begin(), e.end(), Compare);
ll hi = 0;
FOR0(i, n) {
val[i] += e[i].l * e[i].b + (x - e[i].b) * e[i].u;
if (i != 0)
val[i] += val[i - 1];
B += e[i].l * e[i].b;
hi += x;
}
// FOR0(i, n) cout<<e[i].b<<" "<<e[i].l<<" "<<e[i].u<<endl;
ll lo = 0;
while (hi > lo) {
// cout<<lo<<" "<<hi<<endl;
ll mid = (hi + lo) >> 1;
if (perform(mid))
hi = mid;
else
lo = mid + 1;
}
cout << lo;
cerr << endl
<< "Time elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms"
<< '\n';
} | #include <bits/stdc++.h>
#define FOR0(i, n) for (i = 0; i < n; i++)
#define FOR(i, j, n) for (i = j; i < n; i++)
#define FORD(i, j, k) for (i = j; i >= k; i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define inf 1000000000
#define ninf -1000000000
#define endl '\n'
#define she_told_me_dont_worry \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
// Use cout.flush() for interactive problems.
// Use this for increased stack size: g++ -o a.exe -Wl,--stack=256000000 -O2
// source.cpp
inline long long MAX2(long long a, long long int b) {
return (a) > (b) ? (a) : (b);
}
inline long long MAX3(long long a, long long b, long long c) {
return (a) > (b) ? ((a) > (c) ? (a) : (c)) : ((b) > (c) ? (b) : (c));
}
inline long long MIN2(long long a, long long b) {
return (a) < (b) ? (a) : (b);
}
inline long long MIN3(long long a, long long b, long long c) {
return (a) < (b) ? ((a) < (c) ? (a) : (c)) : ((b) < (c) ? (b) : (c));
}
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef struct exam {
ll l, u, b;
exam(ll x, ll y, ll z) {
b = x;
l = y;
u = z;
}
} Exam;
ll n, x;
bool Compare(Exam const &ls, Exam const &rs) {
return (ls.u * (x - ls.b) + ls.l * ls.b) > (rs.u * (x - rs.b) + rs.l * rs.b);
}
ll val[100005] = {};
vector<Exam> e;
ll B = 0;
ll get_val(ll a) {
if (a != 0)
return val[a] - val[a - 1];
return val[a];
}
bool perform(ll rem) {
int i;
ll use;
ll q = (rem / x);
ll r = rem % x;
ll A = ninf;
ll temp = 0;
if (q > 0)
temp = val[q - 1];
A = temp;
if (r != 0) {
FOR0(i, n) {
ll cur = temp;
if (i <= q - 1) {
cur -= get_val(i);
cur += get_val(q);
}
if (r > e[i].b)
cur += e[i].u * (r - e[i].b) + e[i].b * e[i].l;
else
cur += r * e[i].l;
A = MAX2(A, cur);
}
}
if (A >= B)
return true;
return false;
}
int main() {
she_told_me_dont_worry cin >> n >> x;
ll i;
FOR0(i, n) {
ll b, l, u;
cin >> b >> l >> u;
e.push_back(exam(b, l, u));
}
sort(e.begin(), e.end(), Compare);
ll hi = 0;
FOR0(i, n) {
val[i] += e[i].l * e[i].b + (x - e[i].b) * e[i].u;
if (i != 0)
val[i] += val[i - 1];
B += e[i].l * e[i].b;
hi += x;
}
// FOR0(i, n) cout<<e[i].b<<" "<<e[i].l<<" "<<e[i].u<<endl;
ll lo = 0;
while (hi > lo) {
// cout<<lo<<" "<<hi<<endl;
ll mid = (hi + lo) >> 1;
if (perform(mid))
hi = mid;
else
lo = mid + 1;
}
cout << lo;
cerr << endl
<< "Time elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms"
<< '\n';
} | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 834,940 | 834,941 | u453412459 | cpp |
p03019 | // includes
#include <bits/stdc++.h>
// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for (int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) \
for (int i = 0; i < n; i++) \
for (int j = 0; j < m; j++) \
cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL << (n))
#define INT(n) \
int n; \
cin >> n;
#define LL(n) \
ll n; \
cin >> n;
#define DOUBLE(n) \
double n; \
cin >> n;
using namespace std;
// types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// solve
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;
}
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
INT(n);
LL(X);
vector<ll> b(n), l(n), u(n);
rep(i, n) cin >> b[i] >> l[i] >> u[i];
vector<int> c(n);
rep(i, n) c[i] = i;
sort(all(c), [&](int i, int j) {
return (X - b[i]) * u[i] + b[i] * l[i] > (X - b[j]) * u[j] + b[j] * l[j];
});
vector<ll> xs(n + 1, 0), ls(n + 1, 0);
rep(i, n) xs[i] = (i > 0 ? xs[i - 1] : 0) + (X - b[c[i]]) * u[c[i]];
rrep(i, n) ls[i] = (i < n - 1 ? ls[i + 1] : 0) + b[c[i]] * (-l[c[i]]);
ll ld = -1, rd = (ll)n * X;
while (rd - ld > 1) {
ll x = (rd + ld) / 2;
ll cnt = x / X, y = x % X;
bool ok = false;
if (y == 0) {
ll tmp = (cnt > 0 ? xs[cnt - 1] : 0) + ls[cnt];
if (tmp >= 0)
ok = true;
} else {
for (int i = 0; i < n; i++) {
if (i < cnt) {
ll tmp = xs[cnt] - (X - b[c[i]]) * u[c[i]] + ls[cnt];
if (y > b[c[i]])
tmp += u[c[i]] * (y - b[c[i]]);
else
tmp += l[c[i]] * (y - b[c[i]]);
if (tmp >= 0)
ok = true;
} else {
ll tmp = (cnt > 0 ? xs[cnt - 1] : 0) + ls[cnt] - l[c[i]] * (-b[c[i]]);
if (y > b[c[i]])
tmp += u[c[i]] * (y - b[c[i]]);
else
tmp += l[c[i]] * (y - b[c[i]]);
if (tmp >= 0)
ok = true;
}
}
}
if (ok)
rd = x;
else
ld = x;
}
cout << rd << endl;
return 0;
}
| // includes
#include <bits/stdc++.h>
// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for (int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) \
for (int i = 0; i < n; i++) \
for (int j = 0; j < m; j++) \
cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL << (n))
#define INT(n) \
int n; \
cin >> n;
#define LL(n) \
ll n; \
cin >> n;
#define DOUBLE(n) \
double n; \
cin >> n;
using namespace std;
// types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// solve
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;
}
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
INT(n);
LL(X);
vector<ll> b(n), l(n), u(n);
rep(i, n) cin >> b[i] >> l[i] >> u[i];
vector<int> c(n);
rep(i, n) c[i] = i;
sort(all(c), [&](int i, int j) {
return (X - b[i]) * u[i] + b[i] * l[i] > (X - b[j]) * u[j] + b[j] * l[j];
});
vector<ll> xs(n + 2, 0), ls(n + 2, 0);
rep(i, n) xs[i] = (i > 0 ? xs[i - 1] : 0) + (X - b[c[i]]) * u[c[i]];
rrep(i, n) ls[i] = (i < n - 1 ? ls[i + 1] : 0) + b[c[i]] * (-l[c[i]]);
ll ld = -1, rd = (ll)n * X;
while (rd - ld > 1) {
ll x = (rd + ld) / 2;
ll cnt = x / X, y = x % X;
bool ok = false;
if (y == 0) {
ll tmp = (cnt > 0 ? xs[cnt - 1] : 0) + ls[cnt];
if (tmp >= 0)
ok = true;
} else {
for (int i = 0; i < n; i++) {
if (i < cnt) {
ll tmp = xs[cnt] - (X - b[c[i]]) * u[c[i]] + ls[cnt + 1];
if (y > b[c[i]])
tmp += u[c[i]] * (y - b[c[i]]);
else
tmp += l[c[i]] * (y - b[c[i]]);
if (tmp >= 0)
ok = true;
} else {
ll tmp = (cnt > 0 ? xs[cnt - 1] : 0) + ls[cnt] - l[c[i]] * (-b[c[i]]);
if (y > b[c[i]])
tmp += u[c[i]] * (y - b[c[i]]);
else
tmp += l[c[i]] * (y - b[c[i]]);
if (tmp >= 0)
ok = true;
}
}
}
if (ok)
rd = x;
else
ld = x;
}
cout << rd << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 834,942 | 834,943 | u424110125 | cpp |
p03019 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#define _overload(a, b, c, d, ...) d
#define _rep1(X, A, Y) for (int(X) = (A); (X) <= (Y); ++(X))
#define _rep2(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define rep(...) _overload(__VA_ARGS__, _rep1, _rep2)(__VA_ARGS__)
#define rrep(X, Y) for (int(X) = Y - 1; (X) >= 0; --(X))
#define all(X) (X).begin(), (X).end()
#define len(X) ((int)(X).size())
#define mod(n, m) (((n) % (m) + (m)) % m)
#define fi first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
const int INFINT = 1 << 30; // 1.07x10^ 9
const ll INFLL = 1LL << 60; // 1.15x10^18
const double EPS = 1e-10;
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MAX_N = 100000;
ll N, X;
ll b[MAX_N], l[MAX_N], u[MAX_N];
ll sum[MAX_N];
ll accum[MAX_N];
int main() {
cin >> N >> X;
rep(i, N) cin >> b[i] >> l[i] >> u[i];
for (int i = 0; i < N; ++i) {
sum[i] = b[i] * l[i] + (X - b[i]) * u[i];
}
vector<Pll> vp;
rep(i, N) vp.push_back(Pll(sum[i], i));
sort(all(vp));
reverse(all(vp));
accum[0] = vp[0].fi;
for (int i = 1; i < N; ++i) {
accum[i] = accum[i - 1] + vp[i].fi;
}
ll D = 0;
rep(i, N) D += b[i] * l[i];
ll lb = -1, ub = X * N, mid;
while ((ub - lb) > 1) {
mid = (ub + lb) / 2;
ll q = mid / X;
ll r = mid - q * X;
ll tmp = 0;
if (r == 0 && q != 0) {
tmp = accum[q - 1];
} else if (q == 0) {
for (int i = 0; i < N; ++i) {
tmp = max(tmp, min(r, b[i]) * l[i] + max(0ll, r - b[i]) * u[i]);
}
} else {
for (int i = 0; i < N; ++i) {
ll tmp2 = 0;
ll id = vp[i].sc;
if (i < q) {
tmp2 += accum[q];
tmp2 -=
vp[i].fi - min(r, b[id]) * l[id] + max(0ll, r - b[id]) * u[id];
} else {
tmp2 += accum[q - 1];
tmp2 += min(r, b[id]) * l[id] + max(0ll, r - b[id]) * u[id];
}
tmp = max(tmp, tmp2);
}
}
if (tmp >= D) {
ub = mid;
} else {
lb = mid;
}
}
cout << ub << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#define _overload(a, b, c, d, ...) d
#define _rep1(X, A, Y) for (int(X) = (A); (X) <= (Y); ++(X))
#define _rep2(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define rep(...) _overload(__VA_ARGS__, _rep1, _rep2)(__VA_ARGS__)
#define rrep(X, Y) for (int(X) = Y - 1; (X) >= 0; --(X))
#define all(X) (X).begin(), (X).end()
#define len(X) ((int)(X).size())
#define mod(n, m) (((n) % (m) + (m)) % m)
#define fi first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
const int INFINT = 1 << 30; // 1.07x10^ 9
const ll INFLL = 1LL << 60; // 1.15x10^18
const double EPS = 1e-10;
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MAX_N = 100000;
ll N, X;
ll b[MAX_N], l[MAX_N], u[MAX_N];
ll sum[MAX_N];
ll accum[MAX_N];
int main() {
cin >> N >> X;
rep(i, N) cin >> b[i] >> l[i] >> u[i];
for (int i = 0; i < N; ++i) {
sum[i] = b[i] * l[i] + (X - b[i]) * u[i];
}
vector<Pll> vp;
rep(i, N) vp.push_back(Pll(sum[i], i));
sort(all(vp));
reverse(all(vp));
accum[0] = vp[0].fi;
for (int i = 1; i < N; ++i) {
accum[i] = accum[i - 1] + vp[i].fi;
}
ll D = 0;
rep(i, N) D += b[i] * l[i];
ll lb = -1, ub = X * N, mid;
while ((ub - lb) > 1) {
mid = (ub + lb) / 2;
ll q = mid / X;
ll r = mid - q * X;
ll tmp = 0;
if (r == 0 && q != 0) {
tmp = accum[q - 1];
} else if (q == 0) {
for (int i = 0; i < N; ++i) {
tmp = max(tmp, min(r, b[i]) * l[i] + max(0ll, r - b[i]) * u[i]);
}
} else {
for (int i = 0; i < N; ++i) {
ll tmp2 = 0;
ll id = vp[i].sc;
if (i < q) {
tmp2 += accum[q];
tmp2 +=
-vp[i].fi + min(r, b[id]) * l[id] + max(0ll, r - b[id]) * u[id];
} else {
tmp2 += accum[q - 1];
tmp2 += min(r, b[id]) * l[id] + max(0ll, r - b[id]) * u[id];
}
tmp = max(tmp, tmp2);
}
}
if (tmp >= D) {
ub = mid;
} else {
lb = mid;
}
}
cout << ub << endl;
return 0;
}
| [
"expression.operator.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 834,947 | 834,948 | u630941334 | cpp |
p03019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define rsort(v) \
sort(all(v)); \
reverse(all(v))
using namespace std;
using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() {
cout << "Yes" << '\n';
exit(0);
}
inline void no() {
cout << "No" << '\n';
exit(0);
}
inline i64 gcd(i64 a, i64 b) {
if (min(a, b) == 0)
return max(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(16);
solve();
return 0;
}
template <typename T>
class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T>
class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) {
if (x < y)
x = y;
}
template <typename T> inline void amin(T &x, T y) {
if (x > y)
x = y;
}
template <typename T> inline T power(T x, i64 n) {
T r = 1;
while (n > 0) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
rep(i, v.size()) {
if (i)
os << ' ';
os << v[i];
}
return os;
}
void solve() {
int N, X;
cin >> N >> X;
vi64 S(N);
vector<tuple<i64, i64, i64>> t;
i64 M = 0;
i64 D = 0;
i64 ok = 0, ng = -1;
rep(i, N) {
i64 b, l, u;
cin >> b >> l >> u;
t.push_back(make_tuple(b, l, u));
S[i] = b * l + (X - b) * u;
M += S[i];
ok += b;
D += -l * b;
}
vi32 ord(N);
iota(all(ord), 0);
sort(all(ord), [&](int i, int j) { return S[i] > S[j]; });
vi64 sums(N + 1);
rep(i, N) sums[i + 1] = sums[i] + S[ord[i]];
while (ok - ng > 1) {
i64 k = (ok + ng) / 2;
i64 ma = -1e18;
i64 p = k / X, q = k - p * X;
rep(i, N) {
i64 MM;
if (p > i)
MM = sums[p] - S[i];
else
MM = sums[p];
i64 b, l, u;
tie(b, l, u) = t[ord[i]];
i64 T;
if (q <= b)
T = q * l;
else
T = b * l + (q - b) * u;
amax(ma, MM + T);
}
if (ma + D >= 0)
ok = k;
else
ng = k;
}
cout << ok << '\n';
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define rsort(v) \
sort(all(v)); \
reverse(all(v))
using namespace std;
using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() {
cout << "Yes" << '\n';
exit(0);
}
inline void no() {
cout << "No" << '\n';
exit(0);
}
inline i64 gcd(i64 a, i64 b) {
if (min(a, b) == 0)
return max(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(16);
solve();
return 0;
}
template <typename T>
class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T>
class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) {
if (x < y)
x = y;
}
template <typename T> inline void amin(T &x, T y) {
if (x > y)
x = y;
}
template <typename T> inline T power(T x, i64 n) {
T r = 1;
while (n > 0) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
rep(i, v.size()) {
if (i)
os << ' ';
os << v[i];
}
return os;
}
void solve() {
int N, X;
cin >> N >> X;
vi64 S(N);
vector<tuple<i64, i64, i64>> t;
i64 M = 0;
i64 D = 0;
i64 ok = 0, ng = -1;
rep(i, N) {
i64 b, l, u;
cin >> b >> l >> u;
t.push_back(make_tuple(b, l, u));
S[i] = b * l + (X - b) * u;
M += S[i];
ok += b;
D += -l * b;
}
vi32 ord(N);
iota(all(ord), 0);
sort(all(ord), [&](int i, int j) { return S[i] > S[j]; });
vi64 sums(N + 1);
rep(i, N) sums[i + 1] = sums[i] + S[ord[i]];
while (ok - ng > 1) {
i64 k = (ok + ng) / 2;
i64 ma = -1e18;
i64 p = k / X, q = k - p * X;
rep(i, N) {
i64 MM;
if (p > i)
MM = sums[p + 1] - S[ord[i]];
else
MM = sums[p];
i64 b, l, u;
tie(b, l, u) = t[ord[i]];
i64 T;
if (q <= b)
T = q * l;
else
T = b * l + (q - b) * u;
amax(ma, MM + T);
}
if (ma + D >= 0)
ok = k;
else
ng = k;
}
cout << ok << '\n';
}
| [
"assignment.change"
] | 834,949 | 834,950 | u908318580 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << (x) << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
template <typename T> inline void CHMAX(T &a, const T b) {
if (a < b)
a = b;
}
template <typename T> inline void CHMIN(T &a, const T b) {
if (a > b)
a = b;
}
constexpr ll MOD = 1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-11;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
int n;
ll x, sum;
ll b[125252], l[125252], u[125252];
pair<ll, int> a[125252];
bool is_ok(ll mid) {
ll k = mid / x, k2 = mid % x, tmp = 0;
FORR(i, max(0ll, n - k), n) { tmp += a[i].first; }
ll ma = 0;
FORR(i, 0, max(0ll, n - k)) {
int j = a[i].second;
CHMAX(ma, u[j] * k2 - (u[j] - l[j]) * k2);
CHMAX(ma, l[j] * k2);
}
if (tmp + ma >= sum) {
return true;
}
ll mi = 1e12;
FORR(i, max(0ll, n - k), n) {
int j = a[i].second;
CHMIN(mi, u[j] * (x - k2));
CHMIN(mi, u[j] * x - l[j] * k2 - (u[j] - l[j]) * b[j]);
}
tmp -= mi;
if (n - k > 0) {
tmp += a[n - k - 1].first;
}
return tmp >= sum;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout<<setprecision(10)<<fixed;
cin >> n >> x;
REP(i, n) { cin >> b[i] >> l[i] >> u[i]; }
sum = 0;
REP(i, n) { sum += b[i] * l[i]; }
REP(i, n) { a[i] = make_pair(u[i] * x - (u[i] - l[i]) * b[i], i); }
sort(a, a + n);
ll lb = -1, ub = 1e12;
while (ub - lb > 1) {
ll mid = (lb + ub) / 2;
if (is_ok(mid)) {
ub = mid;
} else {
lb = mid;
}
}
cout << ub << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << (x) << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
template <typename T> inline void CHMAX(T &a, const T b) {
if (a < b)
a = b;
}
template <typename T> inline void CHMIN(T &a, const T b) {
if (a > b)
a = b;
}
constexpr ll MOD = 1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-11;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
int n;
ll x, sum;
ll b[125252], l[125252], u[125252];
pair<ll, int> a[125252];
bool is_ok(ll mid) {
ll k = mid / x, k2 = mid % x, tmp = 0;
FORR(i, max(0ll, n - k), n) { tmp += a[i].first; }
ll ma = 0;
FORR(i, 0, max(0ll, n - k)) {
int j = a[i].second;
CHMAX(ma, u[j] * k2 - (u[j] - l[j]) * b[j]);
CHMAX(ma, l[j] * k2);
}
if (tmp + ma >= sum) {
return true;
}
ll mi = 1e12;
FORR(i, max(0ll, n - k), n) {
int j = a[i].second;
CHMIN(mi, u[j] * (x - k2));
CHMIN(mi, u[j] * x - l[j] * k2 - (u[j] - l[j]) * b[j]);
}
tmp -= mi;
if (n - k > 0) {
tmp += a[n - k - 1].first;
}
return tmp >= sum;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout<<setprecision(10)<<fixed;
cin >> n >> x;
REP(i, n) { cin >> b[i] >> l[i] >> u[i]; }
sum = 0;
REP(i, n) { sum += b[i] * l[i]; }
REP(i, n) { a[i] = make_pair(u[i] * x - (u[i] - l[i]) * b[i], i); }
sort(a, a + n);
ll lb = -1, ub = 1e12;
while (ub - lb > 1) {
ll mid = (lb + ub) / 2;
if (is_ok(mid)) {
ub = mid;
} else {
lb = mid;
}
}
cout << ub << '\n';
return 0;
}
| [
"call.arguments.change",
"expression.operation.binary.change"
] | 834,958 | 834,959 | u833393891 | cpp |
p03019 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() { cerr << '\n'; }
template <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {
cerr << arg << " ";
Debug(rest...);
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << "[";
if (!v.empty()) {
rep(i, 0, sz(v) - 1) out << v[i] << ", ";
out << v.back();
}
out << "]";
return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &v) {
out << "(" << v.first << ", " << v.second << ")";
return out;
}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; // use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////
int N, X;
ll B[MAX_N], L[MAX_N], R[MAX_N];
int idx[MAX_N];
int fid[MAX_N];
ll RS[MAX_N], LS[MAX_N];
bool ok(ll m) {
int q = m / X;
int r = m % X;
rep(i, 0, N) {
ll tmp = 0;
if (r == 0) {
tmp += RS[q];
tmp += LS[N] - LS[q];
} else {
if (B[i] > r)
tmp += L[i] * (r - B[i]);
else
tmp += R[i] * (r - B[i]);
if (fid[i] < q) {
tmp -= R[i] * (X - B[i]);
tmp += RS[q + 1];
tmp += LS[N] - LS[q + 1];
} else {
tmp -= -L[i] * B[i];
tmp += RS[q];
tmp += LS[N] - LS[q];
}
}
if (tmp >= 0)
return true;
}
return false;
}
void solve() {
cin >> N >> X;
rep(i, 0, N) {
cin >> B[i] >> L[i] >> R[i];
idx[i] = i;
}
sort(idx, idx + N, [](int i, int j) {
return R[i] * (X - B[i]) - L[i] * B[i] > R[j] * (X - B[j]) - L[j] * B[j];
});
rep(i, 0, N) {
int at = idx[i];
fid[at] = i;
RS[i + 1] = RS[i] + R[at] * (X - B[at]);
LS[i + 1] = LS[i] - L[at] * B[at];
}
ll lv = -1, rv = 1ll * N * X;
while (rv - lv > 1) {
ll m = (lv + rv) / 2;
if (ok(m))
rv = m;
else
lv = m;
}
cout << rv << "\n";
}
uint32_t rd() {
uint32_t res;
#ifdef __MINGW32__
asm volatile("rdrand %0" : "=a"(res)::"cc");
#else
res = std::random_device()();
#endif
return res;
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0);
#endif
cout << fixed;
cout.precision(20);
cerr << fixed;
cerr.precision(6);
rng.seed(rd());
#ifdef LOCAL
// freopen("in.txt", "wt", stdout); //for tester
freopen("in.txt", "rt", stdin);
#endif
solve();
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
}
| #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() { cerr << '\n'; }
template <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {
cerr << arg << " ";
Debug(rest...);
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << "[";
if (!v.empty()) {
rep(i, 0, sz(v) - 1) out << v[i] << ", ";
out << v.back();
}
out << "]";
return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &v) {
out << "(" << v.first << ", " << v.second << ")";
return out;
}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; // use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////
int N, X;
ll B[MAX_N], L[MAX_N], R[MAX_N];
int idx[MAX_N];
int fid[MAX_N];
ll RS[MAX_N], LS[MAX_N];
bool ok(ll m) {
int q = m / X;
int r = m % X;
rep(i, 0, N) {
ll tmp = 0;
if (r == 0) {
tmp += RS[q];
tmp += LS[N] - LS[q];
} else {
if (B[i] > r)
tmp += L[i] * (r - B[i]);
else
tmp += R[i] * (r - B[i]);
if (fid[i] < q) {
tmp -= R[i] * (X - B[i]);
tmp += RS[q + 1];
tmp += LS[N] - LS[q + 1];
} else {
tmp -= -L[i] * B[i];
tmp += RS[q];
tmp += LS[N] - LS[q];
}
}
if (tmp >= 0) {
return true;
}
}
return false;
}
void solve() {
cin >> N >> X;
rep(i, 0, N) {
cin >> B[i] >> L[i] >> R[i];
idx[i] = i;
}
sort(idx, idx + N, [](int i, int j) {
return R[i] * (X - B[i]) + L[i] * B[i] > R[j] * (X - B[j]) + L[j] * B[j];
});
// rep(i, 0, N) {
// debug(R[i] * (X - B[i]) - L[i] * B[i], B[i], L[i], R[i]);
// }
// debug(vi(idx, idx + N));
rep(i, 0, N) {
int at = idx[i];
fid[at] = i;
RS[i + 1] = RS[i] + R[at] * (X - B[at]);
LS[i + 1] = LS[i] - L[at] * B[at];
}
ll lv = -1, rv = 1ll * N * X;
while (rv - lv > 1) {
ll m = (lv + rv) / 2;
if (ok(m))
rv = m;
else
lv = m;
}
cout << rv << "\n";
}
uint32_t rd() {
uint32_t res;
#ifdef __MINGW32__
asm volatile("rdrand %0" : "=a"(res)::"cc");
#else
res = std::random_device()();
#endif
return res;
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0);
#endif
cout << fixed;
cout.precision(20);
cerr << fixed;
cerr.precision(6);
rng.seed(rd());
#ifdef LOCAL
// freopen("in.txt", "wt", stdout); //for tester
freopen("in.txt", "rt", stdin);
#endif
solve();
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 834,969 | 834,970 | u491153752 | cpp |
p03019 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() { cerr << '\n'; }
template <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {
cerr << arg << " ";
Debug(rest...);
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << "[";
if (!v.empty()) {
rep(i, 0, sz(v) - 1) out << v[i] << ", ";
out << v.back();
}
out << "]";
return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &v) {
out << "(" << v.first << ", " << v.second << ")";
return out;
}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; // use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////
int N, X;
ll B[MAX_N], L[MAX_N], R[MAX_N];
int idx[MAX_N];
int fid[MAX_N];
ll RS[MAX_N], LS[MAX_N];
bool ok(ll m) {
int q = m / X;
int r = m % X;
rep(i, 0, N) {
ll tmp = 0;
if (r == 0) {
tmp += RS[q];
tmp += LS[N] - LS[q + 1];
} else {
if (B[i] > r)
tmp += L[i] * (r - B[i]);
else
tmp += R[i] * (r - B[i]);
if (fid[i] < q) {
tmp -= R[i] * (X - B[i]);
tmp += RS[q + 1];
tmp += LS[N] - LS[q + 1];
} else {
tmp -= -L[i] * B[i];
tmp += RS[q];
tmp += LS[N] - LS[q];
}
}
if (tmp >= 0)
return true;
}
return false;
}
void solve() {
cin >> N >> X;
rep(i, 0, N) {
cin >> B[i] >> L[i] >> R[i];
idx[i] = i;
}
sort(idx, idx + N, [](int i, int j) {
return R[i] * (X - B[i]) - L[i] * B[i] > R[j] * (X - B[j]) - L[j] * B[j];
});
rep(i, 0, N) {
int at = idx[i];
fid[at] = i;
RS[i + 1] = RS[i] + R[at] * (X - B[at]);
LS[i + 1] = LS[i] - L[at] * B[at];
}
ll lv = -1, rv = 1ll * N * X;
while (rv - lv > 1) {
ll m = (lv + rv) / 2;
if (ok(m))
rv = m;
else
lv = m;
}
cout << rv << "\n";
}
uint32_t rd() {
uint32_t res;
#ifdef __MINGW32__
asm volatile("rdrand %0" : "=a"(res)::"cc");
#else
res = std::random_device()();
#endif
return res;
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0);
#endif
cout << fixed;
cout.precision(20);
cerr << fixed;
cerr.precision(6);
rng.seed(rd());
#ifdef LOCAL
// freopen("in.txt", "wt", stdout); //for tester
freopen("in.txt", "rt", stdin);
#endif
solve();
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
}
| #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() { cerr << '\n'; }
template <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {
cerr << arg << " ";
Debug(rest...);
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << "[";
if (!v.empty()) {
rep(i, 0, sz(v) - 1) out << v[i] << ", ";
out << v.back();
}
out << "]";
return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &v) {
out << "(" << v.first << ", " << v.second << ")";
return out;
}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; // use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////
int N, X;
ll B[MAX_N], L[MAX_N], R[MAX_N];
int idx[MAX_N];
int fid[MAX_N];
ll RS[MAX_N], LS[MAX_N];
bool ok(ll m) {
int q = m / X;
int r = m % X;
rep(i, 0, N) {
ll tmp = 0;
if (r == 0) {
tmp += RS[q];
tmp += LS[N] - LS[q];
} else {
if (B[i] > r)
tmp += L[i] * (r - B[i]);
else
tmp += R[i] * (r - B[i]);
if (fid[i] < q) {
tmp -= R[i] * (X - B[i]);
tmp += RS[q + 1];
tmp += LS[N] - LS[q + 1];
} else {
tmp -= -L[i] * B[i];
tmp += RS[q];
tmp += LS[N] - LS[q];
}
}
if (tmp >= 0) {
return true;
}
}
return false;
}
void solve() {
cin >> N >> X;
rep(i, 0, N) {
cin >> B[i] >> L[i] >> R[i];
idx[i] = i;
}
sort(idx, idx + N, [](int i, int j) {
return R[i] * (X - B[i]) + L[i] * B[i] > R[j] * (X - B[j]) + L[j] * B[j];
});
// rep(i, 0, N) {
// debug(R[i] * (X - B[i]) - L[i] * B[i], B[i], L[i], R[i]);
// }
// debug(vi(idx, idx + N));
rep(i, 0, N) {
int at = idx[i];
fid[at] = i;
RS[i + 1] = RS[i] + R[at] * (X - B[at]);
LS[i + 1] = LS[i] - L[at] * B[at];
}
ll lv = -1, rv = 1ll * N * X;
while (rv - lv > 1) {
ll m = (lv + rv) / 2;
if (ok(m))
rv = m;
else
lv = m;
}
cout << rv << "\n";
}
uint32_t rd() {
uint32_t res;
#ifdef __MINGW32__
asm volatile("rdrand %0" : "=a"(res)::"cc");
#else
res = std::random_device()();
#endif
return res;
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0);
#endif
cout << fixed;
cout.precision(20);
cerr << fixed;
cerr.precision(6);
rng.seed(rd());
#ifdef LOCAL
// freopen("in.txt", "wt", stdout); //for tester
freopen("in.txt", "rt", stdin);
#endif
solve();
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
}
| [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 834,971 | 834,970 | u491153752 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr << #a << "=" << a << endl
#define dumparr(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define dump(a)
#define dumparr(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for (int i = b - 1; i >= a; i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
typedef long long int ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> ppll;
typedef vector<ll> vll;
const ll INF = (1LL << 50);
template <class S, class T>
std::ostream &operator<<(std::ostream &os, pair<S, T> a) {
os << "(" << a.first << "," << a.second << ")";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, vector<T> a) {
os << "[ ";
REP(a.size()) { os << a[i] << " "; }
os << " ]";
return os;
}
void solve(long long N, long long X, std::vector<long long> b,
std::vector<long long> l, std::vector<long long> u) {
ll lf = -1, rt = accumulate(b.begin(), b.end(), 0) * 10;
vector<pll> p;
REP(N) { p.push_back(pll(l[i] * b[i] + u[i] * (X - b[i]), i)); }
sort(p.begin(), p.end(), greater<pll>());
vector<ll> sump;
sump.push_back(0);
REP(N) { sump.push_back(sump.back() + p[i].first); }
dump(p);
dump(sump);
ll bsum = 0;
REP(N) { bsum += b[i] * l[i]; }
while (lf + 1 < rt) {
ll mid = (lf + rt) / 2;
ll ans = 0;
if (mid % X)
REP(N) {
ll sum = 0;
if (i < mid / X) {
sum = sump[mid / X + 1] - p[i].first;
} else {
sum = sump[mid / X];
}
ll idx = p[i].second;
if (mid % X < b[idx]) {
sum += (mid % X) * l[idx];
} else {
sum += (mid % X - b[idx]) * u[idx] + b[idx] * l[idx];
}
ans = max(ans, sum);
if (ans >= bsum)
break;
}
else {
ans = sump[mid / X];
}
if (ans >= bsum) {
rt = mid;
} else {
lf = mid;
}
}
cout << rt << endl;
}
int main() {
long long N;
scanf("%lld", &N);
long long X;
scanf("%lld", &X);
std::vector<long long> b(N);
std::vector<long long> l(N);
std::vector<long long> u(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &b[i]);
scanf("%lld", &l[i]);
scanf("%lld", &u[i]);
}
solve(N, X, std::move(b), std::move(l), std::move(u));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr << #a << "=" << a << endl
#define dumparr(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define dump(a)
#define dumparr(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for (int i = b - 1; i >= a; i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
typedef long long int ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> ppll;
typedef vector<ll> vll;
const ll INF = (1LL << 50);
template <class S, class T>
std::ostream &operator<<(std::ostream &os, pair<S, T> a) {
os << "(" << a.first << "," << a.second << ")";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, vector<T> a) {
os << "[ ";
REP(a.size()) { os << a[i] << " "; }
os << " ]";
return os;
}
void solve(long long N, long long X, std::vector<long long> b,
std::vector<long long> l, std::vector<long long> u) {
ll lf = -1, rt = accumulate(b.begin(), b.end(), 0LL);
vector<pll> p;
REP(N) { p.push_back(pll(l[i] * b[i] + u[i] * (X - b[i]), i)); }
sort(p.begin(), p.end(), greater<pll>());
vector<ll> sump;
sump.push_back(0);
REP(N) { sump.push_back(sump.back() + p[i].first); }
dump(p);
dump(sump);
ll bsum = 0;
REP(N) { bsum += b[i] * l[i]; }
while (lf + 1 < rt) {
ll mid = (lf + rt) / 2;
ll ans = 0;
if (mid % X)
REP(N) {
ll sum = 0;
if (i < mid / X) {
sum = sump[mid / X + 1] - p[i].first;
} else {
sum = sump[mid / X];
}
ll idx = p[i].second;
if (mid % X < b[idx]) {
sum += (mid % X) * l[idx];
} else {
sum += (mid % X - b[idx]) * u[idx] + b[idx] * l[idx];
}
ans = max(ans, sum);
if (ans >= bsum)
break;
}
else {
ans = sump[mid / X];
}
if (ans >= bsum) {
rt = mid;
} else {
lf = mid;
}
}
cout << rt << endl;
}
int main() {
long long N;
scanf("%lld", &N);
long long X;
scanf("%lld", &X);
std::vector<long long> b(N);
std::vector<long long> l(N);
std::vector<long long> u(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &b[i]);
scanf("%lld", &l[i]);
scanf("%lld", &u[i]);
}
solve(N, X, std::move(b), std::move(l), std::move(u));
return 0;
}
| [
"literal.number.type.widen.change",
"expression.operation.binary.remove"
] | 834,972 | 834,973 | u634743753 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repb(i, n) for (int i = (n - 1); i >= 0; i--)
#define rea(i, a, b) for (int i = (a); i < (b); i++)
#define reab(i, a, b) for (int i = (a)-1; i >= (b); i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())
#define PRINT(V) \
for (auto v : (V)) { \
cerr << v << " "; \
} \
cerr << endl
#define dump(x) cerr << #x << " : " << (x) << endl
#define dump2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
#define dump3(x, y, z) \
cerr << "(" << #x << ", " << #y << ", " << #z << ") = (" << x << ", " << y \
<< ", " << z << ")" << endl
inline ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
const ll MOD = 1000000007;
const ll INF = 100000000000000000;
/* END OF TEMPLATE */
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
vll b(n), l(n), u(n);
rep(i, n) { cin >> b[i] >> l[i] >> u[i]; }
vector<tuple<ll, ll, ll, ll>> vt;
ll val = 0;
rep(i, n) {
vt.emplace_back(b[i] * l[i] + (x - b[i]) * u[i], u[i], l[i], b[i]);
val -= l[i] * b[i];
}
sort(vt.rbegin(), vt.rend());
vll acc;
acc.emplace_back(0);
rep(i, n) { acc.emplace_back(*acc.rbegin() + get<0>(vt[i])); }
// ans : 0 ~ nx
// binary search
// https://qiita.com/drken/items/97e37dd6143e33a64c8c
ll bsl = -1;
ll bsr = n * x;
while (bsr - bsl > 1) {
// dump2(bsl, bsr);
ll mid = bsl + (bsr - bsl) / 2;
ll q = mid / x;
ll r = mid % x;
ll m = 0;
rep(i, q) {
ll mt;
if (r > get<3>(vt[i])) {
mt =
get<2>(vt[i]) * get<3>(vt[i]) + get<1>(vt[i]) * (r - get<3>(vt[i]));
} else {
mt = get<2>(vt[i]) * r;
}
// dump(mt);
m = max(m, acc[q] - get<0>(vt[i]) + mt);
}
rea(i, q, n) {
ll mt;
if (r > get<3>(vt[i])) {
mt =
get<2>(vt[i]) * get<3>(vt[i]) + get<1>(vt[i]) * (r - get<3>(vt[i]));
} else {
mt = get<2>(vt[i]) * r;
}
// dump(mt);
m = max(m, acc[q] + mt);
}
if (m + val >= 0) {
bsr = mid;
} else {
bsl = mid;
}
}
cout << bsr << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repb(i, n) for (int i = (n - 1); i >= 0; i--)
#define rea(i, a, b) for (int i = (a); i < (b); i++)
#define reab(i, a, b) for (int i = (a)-1; i >= (b); i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())
#define PRINT(V) \
for (auto v : (V)) { \
cerr << v << " "; \
} \
cerr << endl
#define dump(x) cerr << #x << " : " << (x) << endl
#define dump2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
#define dump3(x, y, z) \
cerr << "(" << #x << ", " << #y << ", " << #z << ") = (" << x << ", " << y \
<< ", " << z << ")" << endl
inline ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
const ll MOD = 1000000007;
const ll INF = 100000000000000000;
/* END OF TEMPLATE */
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
vll b(n), l(n), u(n);
rep(i, n) { cin >> b[i] >> l[i] >> u[i]; }
vector<tuple<ll, ll, ll, ll>> vt;
ll val = 0;
rep(i, n) {
vt.emplace_back(b[i] * l[i] + (x - b[i]) * u[i], u[i], l[i], b[i]);
val -= l[i] * b[i];
}
sort(vt.rbegin(), vt.rend());
vll acc;
acc.emplace_back(0);
rep(i, n) { acc.emplace_back(*acc.rbegin() + get<0>(vt[i])); }
// ans : 0 ~ nx
// binary search
// https://qiita.com/drken/items/97e37dd6143e33a64c8c
ll bsl = -1;
ll bsr = n * x;
while (bsr - bsl > 1) {
// dump2(bsl, bsr);
ll mid = bsl + (bsr - bsl) / 2;
ll q = mid / x;
ll r = mid % x;
ll m = 0;
rep(i, q) {
ll mt;
if (r > get<3>(vt[i])) {
mt =
get<2>(vt[i]) * get<3>(vt[i]) + get<1>(vt[i]) * (r - get<3>(vt[i]));
} else {
mt = get<2>(vt[i]) * r;
}
// dump(mt);
m = max(m, acc[q + 1] - get<0>(vt[i]) + mt);
}
rea(i, q, n) {
ll mt;
if (r > get<3>(vt[i])) {
mt =
get<2>(vt[i]) * get<3>(vt[i]) + get<1>(vt[i]) * (r - get<3>(vt[i]));
} else {
mt = get<2>(vt[i]) * r;
}
// dump(mt);
m = max(m, acc[q] + mt);
}
if (m + val >= 0) {
bsr = mid;
} else {
bsl = mid;
}
}
cout << bsr << endl;
} | [
"assignment.change"
] | 834,988 | 834,989 | u116670634 | cpp |
p03019 | // IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
// others
#include <cassert>
#include <ctime>
#include <functional>
#include <limits>
#include <random>
// type alias
using lint = long long;
using ldouble = long double;
template <class T>
using greater_priority_queue =
std::priority_queue<T, std::vector<T>, std::greater<T>>;
/* ----- class ----- */
template <class Cost = int> struct Edge {
int src, dst;
Cost cost;
Edge(int src = -1, int dst = -1, Cost cost = 1)
: src(src), dst(dst), cost(cost){};
bool operator<(const Edge<Cost> &e) const { return this->cost < e.cost; }
bool operator>(const Edge<Cost> &e) const { return this->cost > e.cost; }
};
template <class Cost = int> using Edges = std::vector<Edge<Cost>>;
template <class Cost = int> class Graph {
public:
int size;
std::vector<std::vector<Edge<Cost>>> path;
explicit Graph(int N = 0) : size(N), path(size) {}
void span(int src, int dst, Cost cost = 1) {
path[src].push_back(Edge<Cost>(src, dst, cost));
}
std::vector<Edge<Cost>> &operator[](int v) { return path[v]; }
};
/* ----- Output Functions for Debugging ----- */
template <class T> std::ostream &operator<<(std::ostream &os, std::vector<T> v);
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> v);
template <class L, class R>
std::ostream &operator<<(std::ostream &os, std::pair<L, R> p);
template <class K, class T>
std::ostream &operator<<(std::ostream &os, std::map<K, T> v);
template <class T> std::ostream &operator<<(std::ostream &os, std::stack<T> s);
template <class T> std::ostream &operator<<(std::ostream &os, std::queue<T> q);
template <class T>
std::ostream &operator<<(std::ostream &os, std::priority_queue<T> q);
template <class T>
std::ostream &
operator<<(std::ostream &os,
std::priority_queue<T, std::vector<T>, std::greater<T>> q);
template <class T> std::ostream &operator<<(std::ostream &os, Edge<T> e);
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> v) {
os << "{";
for (auto vv : v)
os << vv << ",";
return os << "}";
}
template <class L, class R>
std::ostream &operator<<(std::ostream &os, std::pair<L, R> p) {
return os << "(" << p.first << "," << p.second << ")";
}
template <class K, class T>
std::ostream &operator<<(std::ostream &os, std::map<K, T> v) {
os << "{";
for (auto vv : v)
os << vv << ",";
return os << "}";
}
template <class T> std::ostream &operator<<(std::ostream &os, std::stack<T> s) {
os << "[";
while (!s.empty()) {
os << s.top() << ",";
s.pop();
}
return os << "]";
}
template <class T> std::ostream &operator<<(std::ostream &os, std::queue<T> q) {
os << "[";
while (!q.empty()) {
os << q.front() << ",";
q.pop();
}
return os << "]";
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::priority_queue<T> q) {
os << "{";
while (!q.empty()) {
os << q.top() << ",";
q.pop();
}
return os << "}";
}
template <class T>
std::ostream &
operator<<(std::ostream &os,
std::priority_queue<T, std::vector<T>, std::greater<T>> q) {
os << "{";
while (!q.empty()) {
os << q.top() << ",";
q.pop();
}
return os << "}";
}
template <class T> std::ostream &operator<<(std::ostream &os, Edge<T> e) {
return os << "(" << e.src << "->" << e.dst << ":" << e.cost << ")";
}
/* ----- Short Functions ----- */
template <class T> inline T sq(T a) { return a * a; }
template <class T> inline T iceil(T n, T d) { return (n + d - 1) / d; }
template <class T> T gcd(T a, T b) {
while (b > 0) {
a %= b;
std::swap(a, b);
}
return a;
}
template <class T, class U> T ipow(T b, U n) {
T ret = 1;
while (n > 0) {
if (n & 1)
ret *= b;
n >>= 1;
b *= b;
}
return ret;
}
// 0-indexed
template <class T, class U> inline T kthbit(T a, U k) { return (a >> k) & 1; }
template <class T, class U> inline T mask(T a, U k) {
return a & ((1 << k) - 1);
}
template <class T> std::map<T, int> compress(std::vector<T> &v) {
std::sort(v.begin(), v.end());
v.erase(std::unique(v.begin(), v.end()), v.end());
std::map<T, int> rev;
for (int i = 0; i < v.size(); ++i)
rev[v[i]] = i;
return rev;
}
template <class T> T Vec(T v) { return v; }
template <class T, class... Ts> auto Vec(size_t l, Ts... ts) {
return std::vector<decltype(Vec<T>(ts...))>(l, Vec<T>(ts...));
}
/* ----- Constants ----- */
// const int INF = std::numeric_limits<int>::max() / 3;
// const lint INF = std::numeric_limits<lint>::max() / 3;
// const ldouble PI = acos(-1);
// const ldouble EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));
using namespace std;
struct Sub {
lint b, l, r;
Sub(int b = 0, int l = 0, int r = 0) : b(b), l(l), r(r) {}
};
int main() {
lint N, X;
cin >> N >> X;
vector<Sub> subs(N);
for (auto &s : subs) {
cin >> s.b >> s.l >> s.r;
}
sort(subs.begin(), subs.end(), [&](Sub a, Sub b) {
return a.r * (X - a.b) + a.l * a.b > b.r * (X - b.b) + b.l * b.b;
});
lint ok = 1LL << 40, ng = -1;
while (ok - ng > 1) {
lint mid = (ok + ng) / 2;
lint score = 0; // 先頭からmid/X科目だけX点を取り、他は0点
for (int i = 0; i < N; ++i) {
if (i < mid / X) {
score += subs[i].r * (X - subs[i].b);
} else {
score -= subs[i].l * subs[i].b;
}
}
lint R = mid % X;
bool judge = (score >= 0);
int n = mid / X;
if (R > 0 && n < N) {
for (int r = 0; r < N; ++r) {
lint nscore = score;
if (r < n) {
// r番目を消してn番目を追加
nscore -= subs[r].r * (X - subs[r].b) + subs[r].l * subs[r].b;
nscore += subs[r].l * min(subs[r].b, R) +
subs[r].r * max(0LL, R - subs[r].b);
nscore -= subs[n].r * (X - subs[n].b) + subs[n].l * subs[n].b;
} else {
// r番目を追加する
nscore += subs[r].l * min(subs[r].b, R) +
subs[r].r * max(0LL, R - subs[r].b);
}
if (nscore >= 0)
judge = true;
}
}
(judge ? ok : ng) = mid;
}
cout << ok << endl;
return 0;
}
| // IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
// others
#include <cassert>
#include <ctime>
#include <functional>
#include <limits>
#include <random>
// type alias
using lint = long long;
using ldouble = long double;
template <class T>
using greater_priority_queue =
std::priority_queue<T, std::vector<T>, std::greater<T>>;
/* ----- class ----- */
template <class Cost = int> struct Edge {
int src, dst;
Cost cost;
Edge(int src = -1, int dst = -1, Cost cost = 1)
: src(src), dst(dst), cost(cost){};
bool operator<(const Edge<Cost> &e) const { return this->cost < e.cost; }
bool operator>(const Edge<Cost> &e) const { return this->cost > e.cost; }
};
template <class Cost = int> using Edges = std::vector<Edge<Cost>>;
template <class Cost = int> class Graph {
public:
int size;
std::vector<std::vector<Edge<Cost>>> path;
explicit Graph(int N = 0) : size(N), path(size) {}
void span(int src, int dst, Cost cost = 1) {
path[src].push_back(Edge<Cost>(src, dst, cost));
}
std::vector<Edge<Cost>> &operator[](int v) { return path[v]; }
};
/* ----- Output Functions for Debugging ----- */
template <class T> std::ostream &operator<<(std::ostream &os, std::vector<T> v);
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> v);
template <class L, class R>
std::ostream &operator<<(std::ostream &os, std::pair<L, R> p);
template <class K, class T>
std::ostream &operator<<(std::ostream &os, std::map<K, T> v);
template <class T> std::ostream &operator<<(std::ostream &os, std::stack<T> s);
template <class T> std::ostream &operator<<(std::ostream &os, std::queue<T> q);
template <class T>
std::ostream &operator<<(std::ostream &os, std::priority_queue<T> q);
template <class T>
std::ostream &
operator<<(std::ostream &os,
std::priority_queue<T, std::vector<T>, std::greater<T>> q);
template <class T> std::ostream &operator<<(std::ostream &os, Edge<T> e);
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> v) {
os << "{";
for (auto vv : v)
os << vv << ",";
return os << "}";
}
template <class L, class R>
std::ostream &operator<<(std::ostream &os, std::pair<L, R> p) {
return os << "(" << p.first << "," << p.second << ")";
}
template <class K, class T>
std::ostream &operator<<(std::ostream &os, std::map<K, T> v) {
os << "{";
for (auto vv : v)
os << vv << ",";
return os << "}";
}
template <class T> std::ostream &operator<<(std::ostream &os, std::stack<T> s) {
os << "[";
while (!s.empty()) {
os << s.top() << ",";
s.pop();
}
return os << "]";
}
template <class T> std::ostream &operator<<(std::ostream &os, std::queue<T> q) {
os << "[";
while (!q.empty()) {
os << q.front() << ",";
q.pop();
}
return os << "]";
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::priority_queue<T> q) {
os << "{";
while (!q.empty()) {
os << q.top() << ",";
q.pop();
}
return os << "}";
}
template <class T>
std::ostream &
operator<<(std::ostream &os,
std::priority_queue<T, std::vector<T>, std::greater<T>> q) {
os << "{";
while (!q.empty()) {
os << q.top() << ",";
q.pop();
}
return os << "}";
}
template <class T> std::ostream &operator<<(std::ostream &os, Edge<T> e) {
return os << "(" << e.src << "->" << e.dst << ":" << e.cost << ")";
}
/* ----- Short Functions ----- */
template <class T> inline T sq(T a) { return a * a; }
template <class T> inline T iceil(T n, T d) { return (n + d - 1) / d; }
template <class T> T gcd(T a, T b) {
while (b > 0) {
a %= b;
std::swap(a, b);
}
return a;
}
template <class T, class U> T ipow(T b, U n) {
T ret = 1;
while (n > 0) {
if (n & 1)
ret *= b;
n >>= 1;
b *= b;
}
return ret;
}
// 0-indexed
template <class T, class U> inline T kthbit(T a, U k) { return (a >> k) & 1; }
template <class T, class U> inline T mask(T a, U k) {
return a & ((1 << k) - 1);
}
template <class T> std::map<T, int> compress(std::vector<T> &v) {
std::sort(v.begin(), v.end());
v.erase(std::unique(v.begin(), v.end()), v.end());
std::map<T, int> rev;
for (int i = 0; i < v.size(); ++i)
rev[v[i]] = i;
return rev;
}
template <class T> T Vec(T v) { return v; }
template <class T, class... Ts> auto Vec(size_t l, Ts... ts) {
return std::vector<decltype(Vec<T>(ts...))>(l, Vec<T>(ts...));
}
/* ----- Constants ----- */
// const int INF = std::numeric_limits<int>::max() / 3;
// const lint INF = std::numeric_limits<lint>::max() / 3;
// const ldouble PI = acos(-1);
// const ldouble EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));
using namespace std;
struct Sub {
lint b, l, r;
Sub(int b = 0, int l = 0, int r = 0) : b(b), l(l), r(r) {}
};
int main() {
lint N, X;
cin >> N >> X;
vector<Sub> subs(N);
for (auto &s : subs) {
cin >> s.b >> s.l >> s.r;
}
sort(subs.begin(), subs.end(), [&](Sub a, Sub b) {
return a.r * (X - a.b) + a.l * a.b > b.r * (X - b.b) + b.l * b.b;
});
lint ok = 1LL << 40, ng = -1;
while (ok - ng > 1) {
lint mid = (ok + ng) / 2;
lint score = 0; // 先頭からmid/X科目だけX点を取り、他は0点
for (int i = 0; i < N; ++i) {
if (i < mid / X) {
score += subs[i].r * (X - subs[i].b);
} else {
score -= subs[i].l * subs[i].b;
}
}
lint R = mid % X;
bool judge = (score >= 0);
int n = mid / X;
if (R > 0 && n < N) {
for (int r = 0; r < N; ++r) {
lint nscore = score;
if (r < n) {
// r番目を消してn番目を追加
nscore -= subs[r].r * (X - subs[r].b) + subs[r].l * subs[r].b;
nscore += subs[r].l * min(subs[r].b, R) +
subs[r].r * max(0LL, R - subs[r].b);
nscore += subs[n].r * (X - subs[n].b) + subs[n].l * subs[n].b;
} else {
// r番目を追加する
nscore += subs[r].l * min(subs[r].b, R) +
subs[r].r * max(0LL, R - subs[r].b);
}
if (nscore >= 0)
judge = true;
}
}
(judge ? ok : ng) = mid;
}
cout << ok << endl;
return 0;
}
| [
"expression.operator.change"
] | 834,992 | 834,993 | u059727354 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
#define int int_fast64_t
struct exam {
int l, u, b;
int cost(int score) const {
int c = score >= b ? u : l;
return c * (score - b);
}
int gain(int score) const { return cost(score) - cost(0); }
int score_for_mingain(int mingain, int x) const {
assert(gain(0) < mingain && gain(x) >= mingain);
// invariant: gain(l)<mingain, gain(r)>=mingain
int l = 0, r = x;
while (r - l > 1) {
int m = (l + r) / 2;
if (gain(m) < mingain)
l = m;
else
r = m;
}
assert(gain(l) < mingain);
assert(gain(r) >= mingain);
return r;
}
};
signed main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int n, x;
cin >> n >> x;
vector<exam> exams;
for (int i = 0; i < n; ++i) {
exam e;
cin >> e.b >> e.l >> e.u;
exams.push_back(e);
}
int score = 0;
for (auto &e : exams)
score += e.cost(0);
// maximize gain (more=better)
auto key = [&](exam const &e) { return e.gain(x); };
sort(exams.begin(), exams.end(),
[&](exam const &a, exam const &b) { return key(a) > key(b); });
const int INF = numeric_limits<int>::max();
int best = INF;
int max_taken = 0;
for (; score < 0 && max_taken < n; ++max_taken) {
auto const &e = exams[max_taken];
assert(score < 0);
score += e.gain(x);
}
assert(score >= 0);
if (score == 0) {
best = n * x;
} else {
assert(max_taken >= 1);
for (int i = 0; i < n; ++i) {
auto const &e = exams[i];
int base_score = score - exams[min(i, max_taken - 1)].gain(x);
assert(base_score < 0);
if (base_score + e.gain(x) < 0)
continue; // can't take it, not enough gain
best =
min(best, x * (max_taken - 1) + e.score_for_mingain(-base_score, x));
}
}
assert(best < INF);
cout << best << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
#define int int_fast64_t
struct exam {
int l, u, b;
int cost(int score) const {
int c = score >= b ? u : l;
return c * (score - b);
}
int gain(int score) const { return cost(score) - cost(0); }
int score_for_mingain(int mingain, int x) const {
assert(gain(0) < mingain && gain(x) >= mingain);
// invariant: gain(l)<mingain, gain(r)>=mingain
int l = 0, r = x;
while (r - l > 1) {
int m = (l + r) / 2;
if (gain(m) < mingain)
l = m;
else
r = m;
}
assert(gain(l) < mingain);
assert(gain(r) >= mingain);
return r;
}
};
signed main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int n, x;
cin >> n >> x;
vector<exam> exams;
for (int i = 0; i < n; ++i) {
exam e;
cin >> e.b >> e.l >> e.u;
exams.push_back(e);
}
int score = 0;
for (auto &e : exams)
score += e.cost(0);
// maximize gain (more=better)
auto key = [&](exam const &e) { return e.gain(x); };
sort(exams.begin(), exams.end(),
[&](exam const &a, exam const &b) { return key(a) > key(b); });
const int INF = numeric_limits<int>::max();
int best = INF;
int max_taken = 0;
for (; score < 0 && max_taken < n; ++max_taken) {
auto const &e = exams[max_taken];
assert(score < 0);
score += e.gain(x);
}
assert(score >= 0);
if (score == 0) {
best = max_taken * x;
} else {
assert(max_taken >= 1);
for (int i = 0; i < n; ++i) {
auto const &e = exams[i];
int base_score = score - exams[min(i, max_taken - 1)].gain(x);
assert(base_score < 0);
if (base_score + e.gain(x) < 0)
continue; // can't take it, not enough gain
best =
min(best, x * (max_taken - 1) + e.score_for_mingain(-base_score, x));
}
}
assert(best < INF);
cout << best << '\n';
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 834,998 | 834,999 | u246488512 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 1000000007ULL
#define cINF ((1ull << 62) - 1)
#define cINFINT ((1 << 30) - 1)
int main() {
ll n, x;
cin >> n >> x;
vector<ll> b(n), l(n), u(n);
REP(i, n) cin >> b[i] >> l[i] >> u[i];
vector<pair<ll, pair<ll, ll>>> k(n);
ll sum = 0;
REP(i, n) {
k[i].first = l[i] * b[i] + u[i] * (x - b[i]);
k[i].second.first = -l[i];
k[i].second.second = i;
sum += l[i] * b[i];
}
sort(ALL(k), greater<pair<ll, pair<ll, ll>>>());
ll time = 0, score = 0;
vector<bool> perfect(n, false);
ll now = 0;
REP(i, k.size()) {
ll idx = k[i].second.second;
if (score + k[i].first > sum) {
now = i;
break;
}
time += x;
score += k[i].first;
perfect[idx] = true;
}
const ll leftScore = sum - score;
ll min_time = 100000000;
if (leftScore == 0) {
min_time = 0;
} else {
REP(i, n) {
auto div = [](ll a, ll b) { return a % b == 0 ? a / b : a / b + 1; };
if (!perfect[i]) {
ll t = 0;
if (l[i] * b[i] >= leftScore) {
t = div(leftScore, l[i]);
} else {
t = b[i];
ll ss = leftScore - l[i] * b[i];
t += div(ss, u[i]);
}
min_time = min(min_time, t);
} else {
ll ss = leftScore;
ss -= k[now].first;
ss += l[i] * b[i] + u[i] * (x - b[i]);
ll t = 0;
if (l[i] * b[i] >= leftScore) {
t = div(leftScore, l[i]);
} else {
t = b[i];
ll ss = leftScore - l[i] * b[i];
t += div(ss, u[i]);
}
min_time = min(min_time, t);
}
}
}
cout << time + min_time << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 1000000007ULL
#define cINF ((1ull << 62) - 1)
#define cINFINT ((1 << 30) - 1)
int main() {
ll n, x;
cin >> n >> x;
vector<ll> b(n), l(n), u(n);
REP(i, n) cin >> b[i] >> l[i] >> u[i];
vector<pair<ll, pair<ll, ll>>> k(n);
ll sum = 0;
REP(i, n) {
k[i].first = l[i] * b[i] + u[i] * (x - b[i]);
k[i].second.first = -l[i];
k[i].second.second = i;
sum += l[i] * b[i];
}
sort(ALL(k), greater<pair<ll, pair<ll, ll>>>());
ll time = 0, score = 0;
vector<bool> perfect(n, false);
ll now = 0;
REP(i, k.size()) {
ll idx = k[i].second.second;
if (score + k[i].first > sum) {
now = i;
break;
}
time += x;
score += k[i].first;
perfect[idx] = true;
}
const ll leftScore = sum - score;
ll min_time = 100000000;
if (leftScore == 0) {
min_time = 0;
} else {
REP(i, n) {
auto div = [](ll a, ll b) { return a % b == 0 ? a / b : a / b + 1; };
if (!perfect[i]) {
ll t = 0;
if (l[i] * b[i] >= leftScore) {
t = div(leftScore, l[i]);
} else {
t = b[i];
ll ss = leftScore - l[i] * b[i];
t += div(ss, u[i]);
}
min_time = min(min_time, t);
} else {
ll ss = leftScore;
ss -= k[now].first;
ss += l[i] * b[i] + u[i] * (x - b[i]);
ll t = 0;
if (l[i] * b[i] >= ss) {
t = div(ss, l[i]);
} else {
t = b[i];
ss -= l[i] * b[i];
t += div(ss, u[i]);
}
min_time = min(min_time, t);
}
}
}
cout << time + min_time << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 835,000 | 835,001 | u627427672 | cpp |
p03019 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
struct test {
ll b, l, u;
};
ll n, X;
ll b_, l_, u_;
vector<test> T;
ll sum_b;
ll remain;
ll value(test t) { return t.b * t.l + (X - t.b) * t.u; }
ll value2(test t) {
if (t.b >= remain) {
return remain * t.l;
} else {
return t.b * t.l + (remain - t.b) * t.u;
}
}
ll value3(test t) { return value(t) - value2(t); }
bool check(ll t) {
vector<test> sort_T;
rep(i, T.size()) { sort_T.push_back(T[i]); }
sort(sort_T.begin(), sort_T.end(),
[](test tl, test tr) { return value(tl) > value(tr); });
int ti = 0;
ll sum_value = 0;
vector<test> sort_T3;
while (ti < sort_T.size()) {
if (t < X) {
break;
}
sum_value += value(sort_T[ti]);
sort_T3.push_back(sort_T[ti]);
ti++;
t -= X;
}
vector<test> sort_T2;
while (ti < sort_T.size()) {
sort_T2.push_back(sort_T[ti]);
ti++;
}
remain = t;
sort(sort_T2.begin(), sort_T2.end(),
[](test tl, test tr) { return value2(tl) > value2(tr); });
ll max_value = 0;
if (sort_T2.size() > 0)
max_value = value2(sort_T2[0]);
sort(sort_T2.begin(), sort_T2.end(),
[](test tl, test tr) { return value(tl) > value(tr); });
sort(sort_T3.begin(), sort_T3.begin(),
[](test tl, test tr) { return value3(tl) < value3(tr); });
if (sort_T2.size() > 0 && sort_T3.size() > 0)
chmax(max_value, value(sort_T2[0]) - value3(sort_T3[0]));
sum_value += max_value;
if (sum_value >= sum_b) {
return true;
} else {
return false;
}
}
int main(void) {
cin >> n >> X;
sum_b = 0;
rep(i, n) {
cin >> b_ >> l_ >> u_;
T.push_back(test{b_, l_, u_});
sum_b += b_ * l_;
}
ll begin = 0;
ll end = n * X; // end: 正解
while (end - begin >= 2) {
if (check((begin + end) / 2)) { //可能ならもっと小さく
end = (begin + end) / 2;
} else {
begin = (begin + end) / 2;
}
}
cout << end << endl;
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
struct test {
ll b, l, u;
};
ll n, X;
ll b_, l_, u_;
vector<test> T;
ll sum_b;
ll remain;
ll value(test t) { return t.b * t.l + (X - t.b) * t.u; }
ll value2(test t) {
if (t.b >= remain) {
return remain * t.l;
} else {
return t.b * t.l + (remain - t.b) * t.u;
}
}
ll value3(test t) { return value(t) - value2(t); }
bool check(ll t) {
vector<test> sort_T;
rep(i, T.size()) { sort_T.push_back(T[i]); }
sort(sort_T.begin(), sort_T.end(),
[](test tl, test tr) { return value(tl) > value(tr); });
int ti = 0;
ll sum_value = 0;
vector<test> sort_T3;
while (ti < sort_T.size()) {
if (t < X) {
break;
}
sum_value += value(sort_T[ti]);
sort_T3.push_back(sort_T[ti]);
ti++;
t -= X;
}
vector<test> sort_T2;
while (ti < sort_T.size()) {
sort_T2.push_back(sort_T[ti]);
ti++;
}
remain = t;
sort(sort_T2.begin(), sort_T2.end(),
[](test tl, test tr) { return value2(tl) > value2(tr); });
ll max_value = 0;
if (sort_T2.size() > 0)
max_value = value2(sort_T2[0]);
sort(sort_T2.begin(), sort_T2.end(),
[](test tl, test tr) { return value(tl) > value(tr); });
sort(sort_T3.begin(), sort_T3.end(),
[](test tl, test tr) { return value3(tl) < value3(tr); });
if (sort_T2.size() > 0 && sort_T3.size() > 0)
chmax(max_value, value(sort_T2[0]) - value3(sort_T3[0]));
sum_value += max_value;
if (sum_value >= sum_b) {
return true;
} else {
return false;
}
}
int main(void) {
cin >> n >> X;
sum_b = 0;
rep(i, n) {
cin >> b_ >> l_ >> u_;
T.push_back(test{b_, l_, u_});
sum_b += b_ * l_;
}
ll begin = -1;
ll end = n * X; // end: 正解
while (end - begin >= 2) {
if (check((begin + end) / 2)) { //可能ならもっと小さく
end = (begin + end) / 2;
} else {
begin = (begin + end) / 2;
}
}
cout << end << endl;
return 0;
}
| [
"call.function.change",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change"
] | 835,010 | 835,009 | u838742270 | cpp |
p03019 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
// const long long int MOD = 1000000007;
const long long int MOD = 1000003;
// const int MOD = 998244353;
// const long long int MOD = 998244353;
// long long int N, M, K, H, W, L, R;
long long int N, M, K, H, W, L, R;
struct Exam {
long long int enemy, l, r;
bool operator<(const Exam &e) const {
return r * (K - enemy) + l * enemy < e.l * e.enemy + e.r * (K - e.enemy);
}
long long int getfull() { return r * (K - enemy) + l * enemy; }
long long int get(int num) {
if (num <= enemy) {
return num * l;
} else
return enemy * l + (num - enemy) * r;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> K;
vector<Exam> exam(N);
for (auto &i : exam) {
cin >> i.enemy >> i.l >> i.r;
}
long long int ret = 0;
sort(exam.begin(), exam.end());
reverse(exam.begin(), exam.end());
long long box = 0;
for (auto i : exam) {
box -= i.l * i.enemy;
}
L = -1;
R = K * N;
while (R - L > 1) {
long long int mid = (R + L) / 2;
long long int sum = box;
for (int i = 0; i < mid / K; i++) {
sum += exam[i].getfull();
}
if (mid % K) {
long long int add = 0;
for (int i = 0; i < N; i++) {
if (i < mid / K) {
long long int tmp = exam[mid / K + 1].getfull();
tmp -= exam[i].getfull();
tmp += exam[i].get(mid % K);
add = max(add, tmp);
} else {
add = max(add, exam[i].get(mid % K));
}
}
sum += add;
}
// cout <<mid<<" "<< sum << endl;
if (sum < 0)
L = mid;
else
R = mid;
}
cout << R << endl;
} | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
// const long long int MOD = 1000000007;
const long long int MOD = 1000003;
// const int MOD = 998244353;
// const long long int MOD = 998244353;
// long long int N, M, K, H, W, L, R;
long long int N, M, K, H, W, L, R;
struct Exam {
long long int enemy, l, r;
bool operator<(const Exam &e) const {
return r * (K - enemy) + l * enemy < e.l * e.enemy + e.r * (K - e.enemy);
}
long long int getfull() { return r * (K - enemy) + l * enemy; }
long long int get(long long int num) {
if (num <= enemy) {
return num * l;
} else
return enemy * l + (num - enemy) * r;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> K;
vector<Exam> exam(N);
for (auto &i : exam) {
cin >> i.enemy >> i.l >> i.r;
}
long long int ret = 0;
sort(exam.begin(), exam.end());
reverse(exam.begin(), exam.end());
long long box = 0;
for (auto i : exam) {
box -= i.l * i.enemy;
}
L = -1;
R = K * N;
while (R - L > 1) {
long long int mid = (R + L) / 2;
long long int sum = box;
for (int i = 0; i < mid / K; i++) {
sum += exam[i].getfull();
}
if (mid % K) {
long long int add = 0;
for (int i = 0; i < N; i++) {
if (i < mid / K) {
long long int tmp = exam[mid / K].getfull();
tmp -= exam[i].getfull();
tmp += exam[i].get(mid % K);
add = max(add, tmp);
} else {
add = max(add, exam[i].get(mid % K));
}
}
sum += add;
}
// cout <<mid<<" "<< sum << endl;
if (sum < 0)
L = mid;
else
R = mid;
}
cout << R << endl;
} | [
"variable_declaration.type.widen.change"
] | 835,016 | 835,017 | u468700753 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
long long int n, x;
struct test {
long long int b, l, u;
bool operator<(const test &rhs) const {
return l * b + u * (x - b) > rhs.l * rhs.b + rhs.u * (x - rhs.b);
}
} T[100000];
int now = 0;
bool check(long long int s, long long int t) {
long long int res = 0;
for (int i = now; i < n; i++) {
long long int tmp;
if (s > T[i].b)
tmp = T[i].l * T[i].b + (s - T[i].b) * T[i].u;
else
tmp = s * T[i].l;
res = max(res, tmp);
}
return res >= t;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> T[i].b >> T[i].l >> T[i].u;
long long int target = 0;
for (int i = 0; i < n; i++)
target += T[i].l * T[i].b;
sort(T, T + n);
while (target - ((T[now].l * T[now].b) + T[now].u * (x - T[now].b)) >= 0) {
target -= ((T[now].l * T[now].b) + T[now].u * (x - T[now].b));
now++;
}
if (now == n) {
cout << n * x << endl;
return 0;
}
long long int ans = n * x;
int here = now - 1;
for (int i = n - 1; i >= 0; i--) {
long long int res = 0;
if (i <= here) {
target += ((T[i].l * T[i].b) + T[i].u * (x - T[i].b));
if (i != here)
target -= ((T[i + 1].l * T[i + 1].b) + T[i + 1].u * (x - T[i + 1].b));
}
while (target - ((T[now].l * T[now].b) + T[now].u * (x - T[now].b)) >= 0) {
target -= ((T[now].l * T[now].b) + T[now].u * (x - T[now].b));
now++;
}
if (i <= here)
res = x * (now - 1);
else
res = x * now;
long long int tmp = target;
if (target <= T[i].l * T[i].b)
res += target / T[i].l + ((target % T[i].l) ? 1 : 0);
else {
res += T[i].b;
tmp -= T[i].l * T[i].b;
res += tmp / T[i].u + ((tmp % T[i].u) ? 1 : 0);
}
ans = min(ans, res);
}
cout << ans << endl;
/*while(now>0&&!(T[now]<T[now-1])&&!(T[now-1]<T[now]))
now--;
long long int L=0,R=x;
while(L<R){
long long int mid=(L+R)/2;
if(check(mid,target))
R=mid;
else
L=mid+1;
}
cout<<ans+L<<endl;*/
}
| #include <bits/stdc++.h>
using namespace std;
long long int n, x;
struct test {
long long int b, l, u;
bool operator<(const test &rhs) const {
return l * b + u * (x - b) > rhs.l * rhs.b + rhs.u * (x - rhs.b);
}
} T[100000];
int now = 0;
bool check(long long int s, long long int t) {
long long int res = 0;
for (int i = now; i < n; i++) {
long long int tmp;
if (s > T[i].b)
tmp = T[i].l * T[i].b + (s - T[i].b) * T[i].u;
else
tmp = s * T[i].l;
res = max(res, tmp);
}
return res >= t;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> T[i].b >> T[i].l >> T[i].u;
long long int target = 0;
for (int i = 0; i < n; i++)
target += T[i].l * T[i].b;
sort(T, T + n);
while (target - ((T[now].l * T[now].b) + T[now].u * (x - T[now].b)) >= 0) {
target -= ((T[now].l * T[now].b) + T[now].u * (x - T[now].b));
now++;
}
if (now == n) {
cout << n * x << endl;
return 0;
}
long long int ans = n * x;
int here = now - 1;
for (int i = n - 1; i >= 0; i--) {
long long int res = 0;
if (i <= here) {
target += ((T[i].l * T[i].b) + T[i].u * (x - T[i].b));
if (i != here)
target -= ((T[i + 1].l * T[i + 1].b) + T[i + 1].u * (x - T[i + 1].b));
}
while (now < n &&
target - ((T[now].l * T[now].b) + T[now].u * (x - T[now].b)) >= 0) {
target -= ((T[now].l * T[now].b) + T[now].u * (x - T[now].b));
now++;
}
if (i <= here)
res = x * (now - 1);
else
res = x * now;
long long int tmp = target;
if (target <= T[i].l * T[i].b)
res += target / T[i].l + ((target % T[i].l) ? 1 : 0);
else {
res += T[i].b;
tmp -= T[i].l * T[i].b;
res += tmp / T[i].u + ((tmp % T[i].u) ? 1 : 0);
}
ans = min(ans, res);
}
cout << ans << endl;
/*while(now>0&&!(T[now]<T[now-1])&&!(T[now-1]<T[now]))
now--;
long long int L=0,R=x;
while(L<R){
long long int mid=(L+R)/2;
if(check(mid,target))
R=mid;
else
L=mid+1;
}
cout<<ans+L<<endl;*/
}
| [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 835,022 | 835,023 | u272015756 | cpp |
p03023 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
int n;
cin >> n;
cout << n * 180 << endl;
}
| #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << endl;
} | [] | 835,031 | 835,032 | u225660136 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cout << (N - 2) * 180 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180 << endl;
} | [] | 835,035 | 835,036 | u306482197 | cpp |
p03023 | #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;
signed main() {
int a;
cin >> a;
cout << 180 * (a - 1) << endl;
} | #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;
signed main() {
int a;
cin >> a;
cout << (a - 2) * 180 << endl;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 835,037 | 835,038 | u341447450 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
cout << 180 * (n - 2) / n << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
cout << 180 * (n - 2) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 835,043 | 835,044 | u729703601 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
string s;
ll n;
cin >> n;
// vector<ll> a(n); rep(i, 0, n) cin >> a[i];
cout << 180 * (n - 3) << "\n";
// cout << ( ?"Yes" :"No") << "\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
string s;
ll n;
cin >> n;
// vector<ll> a(n); rep(i, 0, n) cin >> a[i];
cout << 180 * (n - 2) << "\n";
// cout << ( ?"Yes" :"No") << "\n";
} | [
"literal.number.change",
"io.output.change"
] | 835,045 | 835,046 | u672611103 | cpp |
p03023 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
//ユークリッド互除法
template <typename T> T gcd(T x, T y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
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;
}
#define ARRAY_MAX 100005
const int INF = 1e9 + 7;
constexpr ll MOD = 1e9 + 7;
int dx4[4] = {1, 0, 0, -1};
int dy4[4] = {0, 1, -1, 0};
int dx2[2] = {1, 0};
int dy2[2] = {0, 1};
/******************************************************************************************/
typedef tuple<int, int, int> tpl;
template <typename T>
bool next_combination(const T first, const T last, int k) {
const T subset = first + k;
// empty container | k = 0 | k == n
if (first == last || first == subset || last == subset) {
return false;
}
T src = subset;
while (first != src) {
src--;
if (*src < *(last - 1)) {
T dest = subset;
while (*src >= *dest) {
dest++;
}
iter_swap(src, dest);
rotate(src + 1, dest + 1, last);
rotate(subset, subset + (last - dest) - 1, last);
return true;
}
}
// restore
rotate(first, subset, last);
return false;
}
//エラトステネスの篩
/*nまでの素数を列挙して配列に保持*/
vector<ll> Eratosthenes(ll n) {
vector<ll> arr(n + 1);
for (ll i = 0; i <= n; i++) {
arr[i] = 1;
}
arr[0] = arr[1] = 0;
for (ll i = 2; i < sqrt(n); i++) {
if (arr[i]) {
for (ll j = 0; i * (j + 2) < n; j++) {
arr[i * (j + 2)] = 0;
}
}
}
return arr;
}
struct Combination {
vector<ll> fact, rfact;
Combination(ll sz) : fact(sz + 1), rfact(sz + 1) {
fact[0] = 1;
for (ll i = 1; i < fact.size(); i++) {
fact[i] = fact[i - 1] % MOD * i % MOD;
}
//逆元
rfact[sz] = inv(fact[sz]);
for (ll i = sz - 1; i >= 0; i--) {
rfact[i] = rfact[i + 1] % MOD * (i + 1) % MOD;
}
}
ll inv(ll x) { return pow(x, MOD - 2); }
ll pow(ll x, ll n) {
ll ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= MOD;
(x *= x) %= MOD;
n >>= 1;
}
return (ret);
}
ll P(ll n, ll r) {
if (r < 0 || n < r)
return (0);
return (fact[n] * rfact[n - r] % MOD);
}
ll C(ll p, ll q) {
if (q < 0 || p < q)
return (0LL);
return (fact[p] % MOD * rfact[q] % MOD * rfact[p - q] % MOD);
}
ll H(ll n, ll r) {
if (n < 0 || r < 0)
return (0);
return (r == 0 ? 1 : C(n + r - 1, r));
}
};
template <typename T> using Matrix = vector<vector<T>>;
template <typename T> void warshall_floyd(Matrix<T> &g, T INF) {
for (int k = 0; k < g.size(); k++) {
for (int i = 0; i < g.size(); i++) {
for (int j = 0; j < g.size(); j++) {
if (g[i][k] == INF || g[k][j] == INF)
continue;
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
}
}
}
}
//繋げる方向を一方向にする
typedef struct union_find {
vector<ll> pa; //親
vector<ll> ra; //木の深さ
vector<ll> siz;
// n要素で初期化
void init(ll n) {
pa.resize(n);
ra.resize(n);
siz.resize(n);
for (ll i = 0; i < n; i++) {
pa[i] = i; /*各ノードに番号を振る,この時par[x]=xとなる時は木の根となる*/
ra[i] = 0LL; /*各ノード自体の高さは0*/
siz[i] = 1LL;
}
}
//木の根を求める
ll find(ll x) {
if (pa[x] == x) {
return x; /*根ならそのノードの番号を返す*/
} else {
return pa[x] = find(pa[x]); /*根でないならさらにノードの根を探す*/
}
}
// xとyの属する集合を併合する
void unite(ll x, ll y) {
x = find(x); // xの根の番号を探す
y = find(y); // yの根の番号を探す
if (x == y) { //一致すればつながっている
return;
}
pa[y] = x;
siz[x] += siz[y];
}
// xとyが同じ集合に属するか判定
bool same(ll x, ll y) {
return find(x) == find(y); //同じ集合なら1、違うなら0が返る
}
} UF;
int cnt[100005][5];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N;
cin >> N;
cout << 180 * (N - 1) << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
//ユークリッド互除法
template <typename T> T gcd(T x, T y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
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;
}
#define ARRAY_MAX 100005
const int INF = 1e9 + 7;
constexpr ll MOD = 1e9 + 7;
int dx4[4] = {1, 0, 0, -1};
int dy4[4] = {0, 1, -1, 0};
int dx2[2] = {1, 0};
int dy2[2] = {0, 1};
/******************************************************************************************/
typedef tuple<int, int, int> tpl;
template <typename T>
bool next_combination(const T first, const T last, int k) {
const T subset = first + k;
// empty container | k = 0 | k == n
if (first == last || first == subset || last == subset) {
return false;
}
T src = subset;
while (first != src) {
src--;
if (*src < *(last - 1)) {
T dest = subset;
while (*src >= *dest) {
dest++;
}
iter_swap(src, dest);
rotate(src + 1, dest + 1, last);
rotate(subset, subset + (last - dest) - 1, last);
return true;
}
}
// restore
rotate(first, subset, last);
return false;
}
//エラトステネスの篩
/*nまでの素数を列挙して配列に保持*/
vector<ll> Eratosthenes(ll n) {
vector<ll> arr(n + 1);
for (ll i = 0; i <= n; i++) {
arr[i] = 1;
}
arr[0] = arr[1] = 0;
for (ll i = 2; i < sqrt(n); i++) {
if (arr[i]) {
for (ll j = 0; i * (j + 2) < n; j++) {
arr[i * (j + 2)] = 0;
}
}
}
return arr;
}
struct Combination {
vector<ll> fact, rfact;
Combination(ll sz) : fact(sz + 1), rfact(sz + 1) {
fact[0] = 1;
for (ll i = 1; i < fact.size(); i++) {
fact[i] = fact[i - 1] % MOD * i % MOD;
}
//逆元
rfact[sz] = inv(fact[sz]);
for (ll i = sz - 1; i >= 0; i--) {
rfact[i] = rfact[i + 1] % MOD * (i + 1) % MOD;
}
}
ll inv(ll x) { return pow(x, MOD - 2); }
ll pow(ll x, ll n) {
ll ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= MOD;
(x *= x) %= MOD;
n >>= 1;
}
return (ret);
}
ll P(ll n, ll r) {
if (r < 0 || n < r)
return (0);
return (fact[n] * rfact[n - r] % MOD);
}
ll C(ll p, ll q) {
if (q < 0 || p < q)
return (0LL);
return (fact[p] % MOD * rfact[q] % MOD * rfact[p - q] % MOD);
}
ll H(ll n, ll r) {
if (n < 0 || r < 0)
return (0);
return (r == 0 ? 1 : C(n + r - 1, r));
}
};
template <typename T> using Matrix = vector<vector<T>>;
template <typename T> void warshall_floyd(Matrix<T> &g, T INF) {
for (int k = 0; k < g.size(); k++) {
for (int i = 0; i < g.size(); i++) {
for (int j = 0; j < g.size(); j++) {
if (g[i][k] == INF || g[k][j] == INF)
continue;
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
}
}
}
}
//繋げる方向を一方向にする
typedef struct union_find {
vector<ll> pa; //親
vector<ll> ra; //木の深さ
vector<ll> siz;
// n要素で初期化
void init(ll n) {
pa.resize(n);
ra.resize(n);
siz.resize(n);
for (ll i = 0; i < n; i++) {
pa[i] = i; /*各ノードに番号を振る,この時par[x]=xとなる時は木の根となる*/
ra[i] = 0LL; /*各ノード自体の高さは0*/
siz[i] = 1LL;
}
}
//木の根を求める
ll find(ll x) {
if (pa[x] == x) {
return x; /*根ならそのノードの番号を返す*/
} else {
return pa[x] = find(pa[x]); /*根でないならさらにノードの根を探す*/
}
}
// xとyの属する集合を併合する
void unite(ll x, ll y) {
x = find(x); // xの根の番号を探す
y = find(y); // yの根の番号を探す
if (x == y) { //一致すればつながっている
return;
}
pa[y] = x;
siz[x] += siz[y];
}
// xとyが同じ集合に属するか判定
bool same(ll x, ll y) {
return find(x) == find(y); //同じ集合なら1、違うなら0が返る
}
} UF;
int cnt[100005][5];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 835,049 | 835,050 | u504142483 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main() {
int N;
cin >> N;
cout << 60 * N << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main() {
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 835,059 | 835,060 | u031178961 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cout << 180 * (n - 2) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 180 * (n - 2) << endl;
return 0;
}
| [] | 835,063 | 835,064 | u323864528 | cpp |
p03023 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#pragma GCC optimize("Ofast")
#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 = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) // string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2) //等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg) / 360.0) * 2.0 * PI)
#define rad_to_deg(rad) (((rad) / 2.0 / PI) * 360.0)
#define Please return
#define AC 0
using ll = long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1000000007;
const double PI = acos(-1);
using namespace std;
void scans(string &str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')
scanf("%c", &c); //最初の改行対策
while (c != '\n' && c != -1) {
str += c;
scanf("%c", &c);
}
}
void scanc(char &str) {
char c;
scanf("%c", &c);
if (c == -1)
return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) { return PI / 2 - atan(x); }
/*-----------------------------------------ここからコード-----------------------------------------*/
int main() {
int a;
scanf("%d", &a);
printf("%d\n", 180 * (-2));
Please AC;
}
| /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#pragma GCC optimize("Ofast")
#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 = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) // string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2) //等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg) / 360.0) * 2.0 * PI)
#define rad_to_deg(rad) (((rad) / 2.0 / PI) * 360.0)
#define Please return
#define AC 0
using ll = long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1000000007;
const double PI = acos(-1);
using namespace std;
void scans(string &str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')
scanf("%c", &c); //最初の改行対策
while (c != '\n' && c != -1) {
str += c;
scanf("%c", &c);
}
}
void scanc(char &str) {
char c;
scanf("%c", &c);
if (c == -1)
return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) { return PI / 2 - atan(x); }
/*-----------------------------------------ここからコード-----------------------------------------*/
int main() {
int a;
scanf("%d", &a);
printf("%d\n", 180 * (a - 2));
Please AC;
}
| [
"call.arguments.change"
] | 835,067 | 835,068 | u917972976 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (2 * n - 3) * 90 << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << '\n';
} | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 835,073 | 835,074 | u208440216 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (2 * n - 3) * 180 << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << '\n';
} | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 835,075 | 835,074 | u208440216 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int num;
num = 180 * (N - 2);
cout << num << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num;
num = 180 * (N - 2);
cout << num << endl;
}
| [] | 835,080 | 835,081 | u091026689 | cpp |
p03023 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define MAX_N 10000000 // 10^7
#define ll int64_t
#define all(v) (v).begin(), (v).end()
using namespace std;
int main() {
int n;
cin >> n;
cout << 180 + (n - 2) * 180 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define MAX_N 10000000 // 10^7
#define ll int64_t
#define all(v) (v).begin(), (v).end()
using namespace std;
int main() {
int n;
cin >> n;
cout << 180 + (n - 3) * 180 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 835,082 | 835,083 | u532401120 | cpp |
p03023 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
using namespace std;
long long mod = 1000000007;
int main() {
int N;
cin >> N;
cout << 180 * (N - 3) << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
using namespace std;
long long mod = 1000000007;
int main() {
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
} | [
"literal.number.change",
"io.output.change"
] | 835,091 | 835,092 | u475843109 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cout << (n - 2) * 180 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << endl;
return 0;
}
| [] | 835,098 | 835,099 | u831873811 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cout << (n - 1) * 180 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 835,100 | 835,099 | u831873811 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.