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 8
values |
|---|---|---|---|---|---|---|---|
p03173 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sp ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define cps CLOCKS_PER_SEC
#define mod (ll)1000000007
#define f first
#define s second
#define debug1(x) cerr << x << "\n"
#define debug2(x, y) cerr << x << " " << y << "\n"
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sp ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define cps CLOCKS_PER_SEC
#define mod (ll)1000000007
#define f first
#define s second
#define debug1(x) cerr << x << "\n"
#define debug2(x, y) cerr << x << " " << y << "\n"
#de... | [
"assignment.value.change",
"identifier.change"
] | 982,576 | 982,577 | u450036612 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sp ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define cps CLOCKS_PER_SEC
#define mod (ll)1000000007
#define f first
#define s second
#define debug1(x) cerr << x << "\n"
#define debug2(x, y) cerr << x << " " << y << "\n"
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sp ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define cps CLOCKS_PER_SEC
#define mod (ll)1000000007
#define f first
#define s second
#define debug1(x) cerr << x << "\n"
#define debug2(x, y) cerr << x << " " << y << "\n"
#de... | [
"assignment.value.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 982,578 | 982,577 | u450036612 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sp ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define cps CLOCKS_PER_SEC
#define mod (ll)1000000007
#define f first
#define s second
#define debug1(x) cerr << x << "\n"
#define debug2(x, y) cerr << x << " " << y << "\n"
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sp ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define cps CLOCKS_PER_SEC
#define mod (ll)1000000007
#define f first
#define s second
#define debug1(x) cerr << x << "\n"
#define debug2(x, y) cerr << x << " " << y << "\n"
#de... | [
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 982,579 | 982,577 | u450036612 | cpp |
p03173 | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
#define reps(i, N) for (int i = 1; i <= (N); i++)
#define repr(i, N) for (int i = (N)-1; i >= 0; i--)
#define pub push_back
template <typename T> void chmax(T &a, T b) { a = max(a, b... | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
#define reps(i, N) for (int i = 1; i <= (N); i++)
#define repr(i, N) for (int i = (N)-1; i >= 0; i--)
#define pub push_back
template <typename T> void chmax(T &a, T b) { a = max(a, b... | [
"assignment.value.change",
"identifier.change"
] | 982,580 | 982,581 | u073946233 | cpp |
p03173 | #include <bits/stdc++.h>
#define Nmax 405
using namespace std;
const long long INF = 1e18l + 2;
ifstream f("1.in");
int n;
int v[Nmax], sp[Nmax];
long long dp[Nmax][Nmax]; // dp[i][j]=minimum sum combining slimes from i to j
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
sp[i] = sp[... | #include <bits/stdc++.h>
#define Nmax 405
using namespace std;
const long long INF = 1e18l + 2;
ifstream f("1.in");
int n;
int v[Nmax];
long long sp[Nmax];
long long dp[Nmax][Nmax]; // dp[i][j]=minimum sum combining slimes from i to j
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
s... | [
"variable_declaration.type.widen.change"
] | 982,582 | 982,583 | u275238097 | cpp |
p03173 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define PB push_back
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define REPI(i, a, b) for (int i = a; i >= b; i--)
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define PB push_back
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define REPI(i, a, b) for (int i = a; i >= b; i--)
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typ... | [
"variable_declaration.type.change"
] | 982,588 | 982,589 | u216673135 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll arr[100005];
ll memo[4005][4005];
ll prefix[100005];
ll getcost(int left, int right) { return prefix[right + 1] - prefix[left]; }
ll solve(int left, int right) {
if (left >= right)
return 0;
if (memo[left][right] != -1)
return memo[left... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll arr[100005];
ll memo[4005][4005];
ll prefix[100005];
ll getcost(int left, int right) { return prefix[right + 1] - prefix[left]; }
ll solve(int left, int right) {
if (left >= right)
return 0;
if (memo[left][right] != -1)
return memo[left... | [
"literal.number.change",
"variable_declaration.value.change"
] | 982,595 | 982,596 | u202601655 | cpp |
p03173 | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int n;
ll a[401], dp[401][402];
ll dfs(int left, int right) {
if (left + 1 == right)
return 0LL;
if (dp[left][right] != INF)
return dp[left][right];
for (int k = left + 1; k <... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int n;
ll a[401], dp[401][402];
ll dfs(int left, int right) {
if (left + 1 == right)
return 0LL;
if (dp[left][right] != INF)
return dp[left][right];
for (int k = left + 1; k <... | [
"identifier.change",
"io.output.change"
] | 982,599 | 982,600 | u986399983 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define pb push_back
#define mp make_pair
#define MAX 1000000
#define mod 1000000007
#define all(_) _.begin(), _.end()
#define F first
#define S second
int main() {
ios_base ::sync... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define pb push_back
#define mp make_pair
#define MAX 1000000
#define mod 1000000007
#define all(_) _.begin(), _.end()
#define F first
#define S second
int main() {
ios_base ::sync... | [
"assignment.value.change",
"identifier.change"
] | 982,612 | 982,613 | u924895886 | cpp |
p03173 | #include <cstdio>
#include <cstring>
const int MAXN = 410;
int n, a[MAXN];
long long f[MAXN][MAXN];
inline long long min(long long x, long long y) { return x < y ? x : y; }
int main() {
memset(f, 0x3f, sizeof(f));
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
a[i] += a[i - 1];
... | #include <cstdio>
#include <cstring>
const int MAXN = 410;
int n;
long long a[MAXN];
long long f[MAXN][MAXN];
inline long long min(long long x, long long y) { return x < y ? x : y; }
int main() {
memset(f, 0x3f, sizeof(f));
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
a[i] += ... | [
"literal.string.change",
"call.arguments.change"
] | 982,616 | 982,617 | u828727453 | cpp |
p03173 | // Created by sz
#include <bits/stdc++.h>
using namespace std;
const int maxn = 405, INF = 1e9;
int N, a[maxn];
long long s[maxn], dp[maxn][maxn];
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N;
for (int i = 0; i < N; i++) {
c... | // Created by sz
#include <bits/stdc++.h>
using namespace std;
const int maxn = 405;
const long long INF = 1e18;
int N, a[maxn];
long long s[maxn], dp[maxn][maxn];
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N;
for (int i = 0; i ... | [
"variable_declaration.add",
"literal.number.change",
"variable_declaration.value.change"
] | 982,620 | 982,619 | u041075929 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
long long dp[405][405];
int a[405];
int n;
long long MAX = 1e18 + 5;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
for (int i = 1; i <= n; i++)
dp[i][i] = 0;
for (int l = 2; l <= n; l++) {
for (int i = 1;... | #include <bits/stdc++.h>
using namespace std;
long long dp[405][405];
long long a[405];
int n;
long long MAX = 1e18 + 5;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
for (int i = 1; i <= n; i++)
dp[i][i] = 0;
for (int l = 2; l <= n; l++) {
for (int ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 982,625 | 982,626 | u573738515 | cpp |
p03173 | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
#define MOD 1000000007
typedef long long ll;
vector<vector<ll>> dp_arr;
int main() {
int n;
cin >> n;
vector<ll> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<ll> cum_sum(n + 1, 0);
for (int i = 1; i <= n; i++) {
c... | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
#define MOD 1000000007
typedef long long ll;
vector<vector<ll>> dp_arr;
int main() {
int n;
cin >> n;
vector<ll> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<ll> cum_sum(n + 1, 0);
for (int i = 1; i <= n; i++) {
c... | [
"variable_declaration.value.change",
"identifier.change"
] | 982,627 | 982,628 | u032940964 | cpp |
p03173 | #include <iostream>
#define int long long
using namespace std;
const int inf = 1e18 + 1;
int dp[405][405], ar[405], sum[405];
signed main() {
int n, i, j, k;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> ar[i];
sum[i] = sum[i - 1] + ar[i];
dp[i][i] = 0;
}
for (i = 1; i <= n; i++) {
for (j = i + ... | #include <iostream>
#define int long long
using namespace std;
const int inf = 1e18 + 1;
int dp[405][405], ar[405], sum[405];
signed main() {
int n, i, j, k;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> ar[i];
sum[i] = sum[i - 1] + ar[i];
dp[i][i] = 0;
}
for (i = 1; i <= n; i++) {
for (j = i + ... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 982,637 | 982,638 | u639335047 | cpp |
p03174 | #include <bits/stdc++.h>
typedef long long ll;
const int MN = 24, MOD = 1e9 + 7;
int N, A[MN][MN], dp[MN][1 << MN];
inline int cb(int msk, int b) { return msk & ~(1 << b); }
inline int sb(int msk, int b) { return msk | (1 << b); }
inline int tb(int msk, int b) { return msk ^ (1 << b); }
inline bool ib(int msk, int b) {... | #include <bits/stdc++.h>
typedef long long ll;
const int MN = 21, MOD = 1e9 + 7;
int N, A[MN][MN], dp[MN][1 << MN];
inline int cb(int msk, int b) { return msk & ~(1 << b); }
inline int sb(int msk, int b) { return msk | (1 << b); }
inline int tb(int msk, int b) { return msk ^ (1 << b); }
inline bool ib(int msk, int b) {... | [
"literal.number.change",
"variable_declaration.value.change"
] | 982,644 | 982,645 | u596743351 | cpp |
p03174 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp make_pair
#define pr(num) cout << num << "\n"
#define max(a, b) ((a) > (b) ? (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp make_pair
#define pr(num) cout << num << "\n"
#define max(a, b) ((a) > (b) ? (... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 982,648 | 982,649 | u768152935 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int lon... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int lon... | [
"assignment.change"
] | 982,650 | 982,651 | u791542693 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define debug(x) cerr << #x << " = " << (x) << endl;
template <typename T> ostream &operator<<(ostream &o, vector<T> &v) {
for (auto &x : v... | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define debug(x) cerr << #x << " = " << (x) << endl;
template <typename T> ostream &operator<<(ostream &o, vector<T> &v) {
for (auto &x : v... | [] | 982,652 | 982,653 | u115464345 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define MAXN 2097153
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FAIL0 \
{ ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define MAXN 2097154
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FAIL0 \
{ ... | [
"preprocessor.define.value.change",
"literal.integer.change",
"control_flow.branch.if.condition.change"
] | 982,660 | 982,659 | u066478371 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
// using lint = long long;
struct P {
int x, y;
bool operator<(const P &a) const {
if (x != a.x)
return x > a.x;
return y > a.y;
}
};
vector<int> v[1], v1;
// bitset<4001000> b;
int i, n, d, m, k, a, b, c, h;
int o[1111][33];
long long l[33][4000511... | #include <bits/stdc++.h>
using namespace std;
// using lint = long long;
struct P {
int x, y;
bool operator<(const P &a) const {
if (x != a.x)
return x > a.x;
return y > a.y;
}
};
vector<int> v[1], v1;
// bitset<4001000> b;
int i, n, d, m, k, a, b, c, h;
int o[1111][33];
long long l[23][2500511... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 982,663 | 982,664 | u428070871 | cpp |
p03174 | #include <bits/stdc++.h>
using vll = std::vector<long long>;
constexpr long long mod{1000000007};
int n;
bool edge[21][21]{};
std::vector<vll> mf;
long long rc(int, int);
int main() {
scanf("%d", &n);
for (int i{}; i < n; i++)
for (int j{}; j < n; j++) {
int a;
scanf("%d", &a);
edge[i][j] ... | #include <bits/stdc++.h>
using vll = std::vector<long long>;
constexpr long long mod{1000000007};
int n;
bool edge[21][21]{};
std::vector<vll> mf;
long long rc(int, int);
int main() {
scanf("%d", &n);
for (int i{}; i < n; i++)
for (int j{}; j < n; j++) {
int a;
scanf("%d", &a);
edge[i][j] ... | [
"expression.operation.binary.remove"
] | 982,689 | 982,690 | u086849314 | cpp |
p03175 | #include <cstring>
#include <iostream>
#include <vector>
#define ll long long int
#define MOD 1000000007
using namespace std;
vector<int> tree[100001];
ll dp[100001][2];
ll independentSets(int u, bool constraint, int pr) {
if (dp[u][constraint] != -1)
return dp[u][constraint]; // Look Up
ll ans = 0;
ll w1 =... | #include <cstring>
#include <iostream>
#include <vector>
#define ll long long int
#define MOD 1000000007
using namespace std;
vector<int> tree[100001];
ll dp[100001][2];
ll independentSets(int u, bool constraint, int pr) {
if (dp[u][constraint] != -1)
return dp[u][constraint]; // Look Up
ll ans = 0;
ll w1 =... | [
"literal.number.change",
"variable_declaration.value.change"
] | 982,829 | 982,830 | u148301183 | cpp |
p03175 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = ve... | [
"control_flow.branch.if.condition.change"
] | 982,928 | 982,929 | u518042385 | cpp |
p03175 | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type,... | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type,... | [
"control_flow.branch.if.condition.change"
] | 982,953 | 982,954 | u878615689 | cpp |
p03175 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.14159265358979323846
const ll MAX = 1e5 + 10;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
vector<ll> a[MAX];
ll dp[MAX][2];
ll visited[MAX];
void dfs(int node) {
visited[node] = 1;
for (int i = 0; i < a[node].size(); i++) {
if (v... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.14159265358979323846
const ll MAX = 1e5 + 10;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
vector<ll> a[MAX];
ll dp[MAX][2];
ll visited[MAX];
void dfs(int node) {
visited[node] = 1;
for (int i = 0; i < a[node].size(); i++) {
if (v... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 983,139 | 983,140 | u184898414 | cpp |
p03175 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 983,165 | 983,166 | u408028331 | cpp |
p03175 | #include <bits/stdc++.h>
#define ll long long
#define pb emplace_back
using namespace std;
const int MAXN = 1e5 + 10, MD = 1e9 + 7;
int n;
ll dp[MAXN][2];
vector<int> g[MAXN];
void Dfs(int v = 1, int p = -1) {
dp[v][0] = 1;
dp[v][1] = 1;
for (auto i : g[v]) {
if (p == i)
continue;
Dfs(i, v);
... | #include <bits/stdc++.h>
#define ll long long
#define pb emplace_back
using namespace std;
const int MAXN = 1e5 + 10, MD = 1e9 + 7;
int n;
ll dp[MAXN][2];
vector<int> g[MAXN];
void Dfs(int v = 1, int p = -1) {
dp[v][0] = 1;
dp[v][1] = 1;
for (auto i : g[v]) {
if (p == i)
continue;
Dfs(i, v);
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 983,194 | 983,195 | u857968161 | cpp |
p03175 | #include <bits/stdc++.h>
using namespace std;
#include <unordered_map>
#define inputarr(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define prllarr(a, n) ... | #include <bits/stdc++.h>
using namespace std;
#include <unordered_map>
#define inputarr(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define prllarr(a, n) ... | [
"call.remove"
] | 983,211 | 983,212 | u818356308 | cpp |
p03175 | #include <bits/stdc++.h>
using namespace std;
long long DP[100100];
vector<int> G[100100];
const long long Mod = 1000000007;
long long DFS(int X, int L) {
if (DP[X] != -1)
return DP[X];
long long ret1 = 1, ret2 = 1;
for (int i = 0; i < G[X].size(); i++)
if (G[X][i] != L)
ret1 = ret1 * DFS(G[X][i], X... | #include <bits/stdc++.h>
using namespace std;
long long DP[100100];
vector<int> G[100100];
const long long Mod = 1000000007;
long long DFS(int X, int L) {
if (DP[X])
return DP[X];
long long ret1 = 1, ret2 = 1;
for (int i = 0; i < G[X].size(); i++)
if (G[X][i] != L)
ret1 = ret1 * DFS(G[X][i], X) % Mo... | [
"expression.operation.binary.remove"
] | 983,303 | 983,304 | u538921909 | cpp |
p03175 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
ll num = pow(10, 9) + 7;
ll n, dp[2][100010];
vector<int> g[100010];
void dfs(int node, int p = 0) {
dp[0][node] = dp[1][node] = 1;
rep(i, g[node].size()) {
if (g[node][i] == p)
continue;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
ll num = pow(10, 9) + 7;
ll n, dp[2][100010];
vector<int> g[100010];
void dfs(int node, int p = -1) {
dp[0][node] = dp[1][node] = 1;
rep(i, g[node].size()) {
if (g[node][i] == p)
continue... | [
"literal.number.change",
"call.arguments.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 983,385 | 983,386 | u244832678 | cpp |
p03175 | // KiSmAt
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll inf = 1e18;
const int mod = 1e9 + 7;
const int N = 2 * 1e5 + 10;
ll res;
ll a[N], dp[N][2];
vector<ll> v[N];
inline ll add(ll x, ll y) { return (x % mod + y % mod) % mod; }
inline ll sub(ll x... | // KiSmAt
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll inf = 1e18;
const int mod = 1e9 + 7;
const int N = 2 * 1e5 + 10;
ll res;
ll a[N], dp[N][2];
vector<ll> v[N];
inline ll add(ll x, ll y) { return (x % mod + y % mod) % mod; }
inline ll sub(ll x... | [
"identifier.change",
"call.arguments.change"
] | 983,509 | 983,510 | u353940238 | cpp |
p03175 | /************************Code by Hardik
* Aggarwal!!!!***********************************/
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
... | /************************Code by Hardik
* Aggarwal!!!!***********************************/
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 983,536 | 983,535 | u859541564 | cpp |
p03175 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define DIM (long long)1000007
#define INF (long long)100000007
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pairll;
ll n, m, i, j, sum, f1, ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define DIM (long long)1000007
#define INF (long long)100000007
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pairll;
ll n, m, i, j, sum, f1, ... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 983,584 | 983,585 | u576645478 | cpp |
p03175 | #include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; a++)
#define rl(a, b, c) for (int a = b; a >= c; a--)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
using namespace std;
const int INF ... | #include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; a++)
#define rl(a, b, c) for (int a = b; a >= c; a--)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
using namespace std;
const int INF ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"function.return_value.change",
"assignment.variable.change"
] | 983,590 | 983,591 | u751730221 | cpp |
p03175 | #include <bits/stdc++.h>
#define N_MAX 100002
#define ll long long
using namespace std;
const ll MOD = 1e9 + 7;
int n;
vector<int> edges[N_MAX];
ll dp[N_MAX][2];
bool visited[N_MAX];
void dfs(int node) {
visited[node] = true;
dp[node][0] = dp[node][1] = 1;
for (int u : edges[node])
if (visited[u] == f... | #include <bits/stdc++.h>
#define N_MAX 100002
#define ll long long
using namespace std;
const ll MOD = 1e9 + 7;
int n;
vector<int> edges[N_MAX];
ll dp[N_MAX][2];
bool visited[N_MAX];
void dfs(int node) {
visited[node] = true;
dp[node][0] = dp[node][1] = 1;
for (int u : edges[node])
if (visited[u] == f... | [
"identifier.change",
"call.arguments.change"
] | 983,605 | 983,606 | u138301572 | cpp |
p03175 | #include <bits/stdc++.h>
#define N_MAX 100002
#define ll long long
using namespace std;
const ll MOD = 1e9 + 1;
int n;
vector<int> edges[N_MAX];
ll dp[N_MAX][2];
bool visited[N_MAX];
void dfs(int node) {
visited[node] = true;
dp[node][0] = dp[node][1] = 1;
for (int u : edges[node])
if (visited[u] == f... | #include <bits/stdc++.h>
#define N_MAX 100002
#define ll long long
using namespace std;
const ll MOD = 1e9 + 7;
int n;
vector<int> edges[N_MAX];
ll dp[N_MAX][2];
bool visited[N_MAX];
void dfs(int node) {
visited[node] = true;
dp[node][0] = dp[node][1] = 1;
for (int u : edges[node])
if (visited[u] == f... | [
"literal.number.change",
"expression.operation.binary.change",
"identifier.change",
"call.arguments.change"
] | 983,607 | 983,606 | u138301572 | cpp |
p03175 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> adj[100005];
ll visited[100005];
pair<ll, ll> dfs(ll pa) {
visited[pa] = 1;
ll i, w, b;
w = 1;
b = 1;
for (i = 0; i < adj[pa].size(); i++) {
if (!visited[adj[pa][i]]) {
pair<ll, ll> p = dfs(adj[pa][i]);
w = (w * ((... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> adj[100005];
ll visited[100005];
pair<ll, ll> dfs(ll pa) {
visited[pa] = 1;
ll i, w, b;
w = 1;
b = 1;
for (i = 0; i < adj[pa].size(); i++) {
if (!visited[adj[pa][i]]) {
pair<ll, ll> p = dfs(adj[pa][i]);
w = (w * ((... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 983,667 | 983,668 | u388528458 | cpp |
p03175 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1000000007, dp[100010][2] = {};
vector<int> G[100010];
void dfs(int s, int p) {
ll x = 1, y = 1;
for (int v : G[s]) {
if (v != p) {
dfs(v, s);
(x *= dp[v][0]) %= mod;
(y *= (dp[v][0] + dp[v][1]) % mod) %=... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1000000007, dp[100010][2] = {};
vector<int> G[100010];
void dfs(int s, int p) {
ll x = 1, y = 1;
for (int v : G[s]) {
if (v != p) {
dfs(v, s);
(x *= dp[v][0]) %= mod;
(y *= (dp[v][0] + dp[v][1]) % mod) %=... | [] | 983,690 | 983,691 | u621509943 | cpp |
p03175 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1000000007, dp[100010][2] = {};
vector<int> G[100010];
void dfs(int s, int p) {
ll x = 1, y = 1;
for (int v : G[s]) {
if (v != p) {
dfs(v, s);
(x *= dp[v][0]) %= mod;
(y *= dp[v][0] + dp[v][1]) %= mod;
... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1000000007, dp[100010][2] = {};
vector<int> G[100010];
void dfs(int s, int p) {
ll x = 1, y = 1;
for (int v : G[s]) {
if (v != p) {
dfs(v, s);
(x *= dp[v][0]) %= mod;
(y *= (dp[v][0] + dp[v][1]) % mod) %=... | [] | 983,692 | 983,691 | u621509943 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
struct flower {
long long int hi, bty;
};
long long int solve(vector<flower> &v, long long int n) {
vector<long long int> dp(n + 1);
dp[1] = v[1].bty;
map<long long int, long long int> meaningfull;
meaningfull[v[1].hi] = v[1].bty;
long long int ans = dp[0];
fo... | #include <bits/stdc++.h>
using namespace std;
struct flower {
long long int hi, bty;
};
long long int solve(vector<flower> &v, long long int n) {
vector<long long int> dp(n + 1);
dp[1] = v[1].bty;
map<long long int, long long int> meaningfull;
meaningfull[v[1].hi] = v[1].bty;
long long int ans = dp[1];
fo... | [
"literal.number.change",
"variable_access.subscript.index.change"
] | 983,742 | 983,743 | u003189384 | cpp |
p03176 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define size 200010
ll dp[4 * size];
ll query(int s, int e, int qs, int qe, int idx) {
if (qs > e || qe < s)
return 0;
if (qs <= s && qe >= e)
return dp[idx];
int mid = (s + e) / 2;
ll a = query(s, mid, qs, qe, 2 * id... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define size 200010
ll dp[4 * size];
ll query(int s, int e, int qs, int qe, int idx) {
if (qs > e || qe < s)
return 0;
if (qs <= s && qe >= e)
return dp[idx];
int mid = (s + e) / 2;
ll a = query(s, mid, qs, qe, 2 * id... | [
"variable_declaration.value.change"
] | 983,762 | 983,763 | u411269021 | cpp |
p03176 | #include <bits/stdc++.h>
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#define file(s) \
freopen(s ".in", "r", stdin); ... | #include <bits/stdc++.h>
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#define file(s) \
freopen(s ".in", "r", stdin); ... | [] | 983,764 | 983,765 | u089230684 | cpp |
p03176 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <utility>
#include <vector>
using namespace std;
int N;
vector<int> h;
vector<int> a;
vector<size_t> dp;
void update_max(int i, size_t val) {
for (; i < N; i = (i | (i + 1)))
dp[i] = max(dp[i], val);
}
size... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <utility>
#include <vector>
using namespace std;
int N;
vector<int> h;
vector<int> a;
vector<size_t> dp;
void update_max(int i, size_t val) {
for (; i < N; i = (i | (i + 1)))
dp[i] = max(dp[i], val);
}
size... | [
"assignment.change"
] | 983,768 | 983,769 | u395287489 | cpp |
p03176 | #pragma comment(linker, "/stack:16777216")
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <functional>
#include <iomanip>
#include <iost... | #pragma comment(linker, "/stack:16777216")
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <functional>
#include <iomanip>
#include <iost... | [
"io.output.change"
] | 983,770 | 983,771 | u963646695 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less_equal<ll>, rb_tree_tag, \
... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less_equal<ll>, rb_tree_tag, \
... | [
"call.arguments.change"
] | 983,779 | 983,780 | u206663422 | cpp |
p03176 | // #pragma GCC optimize "trapv"
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vll vector<ll>
#define vpll vector<pair<ll, ll>>
#define vvi vector<vector<int>>
#define vvll vector<vector<ll>>
#define MAP map<ll, ll>
#define UMAP unordered_map<ll, ll>
#define endl "\n"
#define SET set<ll>
... | // #pragma GCC optimize "trapv"
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vll vector<ll>
#define vpll vector<pair<ll, ll>>
#define vvi vector<vector<int>>
#define vvll vector<vector<ll>>
#define MAP map<ll, ll>
#define UMAP unordered_map<ll, ll>
#define endl "\n"
#define SET set<ll>
... | [
"identifier.replace.add",
"literal.replace.remove"
] | 983,787 | 983,788 | u703699388 | cpp |
p03176 | //#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <deque>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
using namespace __gnu_pbds; // required
#define ll long long
#define ull unsigned ll
#d... | //#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <deque>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
using namespace __gnu_pbds; // required
#define ll long long
#define ull unsigned ll
#d... | [
"literal.number.change",
"variable_declaration.value.change"
] | 983,791 | 983,792 | u164083094 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(... | #include <bits/stdc++.h>
using namespace std;
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 983,793 | 983,794 | u143055906 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
vector<long long> tree(1e6, 0);
long long getit(int ss, int se, int p, int l, int r) {
if (ss > se || ss > r || se < l)
return (long long)0;
if (l <= ss && se <= r)
return tree[p];
int mid = (ss + se) / 2;
return max(getit(ss, mid, 2 * p, l, r), getit(mid +... | #include <bits/stdc++.h>
using namespace std;
vector<long long> tree(1e6, 0);
long long getit(int ss, int se, int p, int l, int r) {
if (ss > se || ss > r || se < l)
return (long long)0;
if (l <= ss && se <= r)
return tree[p];
int mid = (ss + se) / 2;
return max(getit(ss, mid, 2 * p, l, r), getit(mid +... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 983,799 | 983,800 | u501893076 | cpp |
p03176 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec) { // for debug
ll n = vec.size();
co... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec) { // for debug
ll n = vec.size();
co... | [] | 983,808 | 983,809 | u628597699 | cpp |
p03176 | #include <bits/stdc++.h>
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
#ifdef __LOCAL
#include <filesystem>
namespace fs = std::filesystem;
#endif
using namespace std;
using ll = long long int;
inline void fast_io() {
... | #include <bits/stdc++.h>
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
#ifdef __LOCAL
#include <filesystem>
namespace fs = std::filesystem;
#endif
using namespace std;
using ll = long long int;
inline void fast_io() {
... | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 983,810 | 983,811 | u858670323 | cpp |
p03176 | #include <bits/stdc++.h>
#define fin \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
#define ll long long
const int N = 200005;
ll dp[N], bit[N];
ll h[N];
ll mx(int i) {
ll ans =... | #include <bits/stdc++.h>
#define fin \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
#define ll long long
const int N = 200005;
ll dp[N], bit[N];
ll h[N];
ll mx(int i) {
ll ans =... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 983,816 | 983,817 | u559274475 | cpp |
p03176 | /*
author: kartik8800
*/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fr(a, b) for (ll i = a; i < b; i++)
#define mod 1000000007
#define inf (1LL << 60)
#define all(x) (x).begin(), (x).end()
#define prDouble(x) cout << fixed << setprecision(10) << x
#define triplet pair<ll, pair<ll, ll... | /*
author: kartik8800
*/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fr(a, b) for (ll i = a; i < b; i++)
#define mod 1000000007
#define inf (1LL << 60)
#define all(x) (x).begin(), (x).end()
#define prDouble(x) cout << fixed << setprecision(10) << x
#define triplet pair<ll, pair<ll, ll... | [] | 983,822 | 983,823 | u212789054 | cpp |
p03176 | #include "bits/stdc++.h"
// region Template
#include "ext/pb_ds/assoc_container.hpp"
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int MOD2 = 99... | #include "bits/stdc++.h"
// region Template
#include "ext/pb_ds/assoc_container.hpp"
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int MOD2 = 99... | [
"literal.number.change",
"expression.operation.binary.change"
] | 983,826 | 983,827 | u557558723 | cpp |
p03176 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<int> H(N), A(N);
vector<long long> dp(N, 0);
int base = 1;
while (base <= N) {
base <<= 1;
}
vector<long long> tree(2 * base, 0);
for (int i = 0; i < N; +... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<int> H(N), A(N);
vector<long long> dp(2 * N, 0);
int base = 1;
while (base <= N) {
base <<= 1;
}
vector<long long> tree(2 * base, 0);
for (int i = 0; i < ... | [
"assignment.change"
] | 983,840 | 983,841 | u645134771 | cpp |
p03176 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200001;
#define ll long long
ll tree[4 * N];
void upd(int in, int l, int r, int idx, ll v) {
if (l > idx || r < idx)
return;
if (l == r) {
tree[in] = v;
return;
}
int m = (l + r) / 2;
upd(2 * in, l, m, idx, v);
upd(2 * in + 1, m + 1, ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 200001;
#define ll long long
ll tree[4 * N];
void upd(int in, int l, int r, int idx, ll v) {
if (l > idx || r < idx)
return;
if (l == r) {
tree[in] = v;
return;
}
int m = (l + r) / 2;
upd(2 * in, l, m, idx, v);
upd(2 * in + 1, m + 1, ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 983,842 | 983,843 | u945097761 | cpp |
p03176 | #include <algorithm>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>... | #include <algorithm>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>... | [
"variable_declaration.type.change"
] | 983,852 | 983,853 | u878735274 | cpp |
p03176 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"literal.number.change",
"function.return_value.change"
] | 983,873 | 983,874 | u136342563 | cpp |
p03176 | #include <algorithm>
#include <cstdint>
#include <iostream>
int const MAXN = 200000;
int const MAXBIT = 1 << 18;
int N, NN, h[MAXN];
uint64_t a[MAXN];
uint64_t dp[MAXBIT + 1];
int pw2(int n) {
int ret = 1;
while (ret < n)
ret <<= 1;
return ret;
}
uint64_t bit_max(int i) {
++i;
uint64_t ret = 0;
whil... | #include <algorithm>
#include <cstdint>
#include <iostream>
int const MAXN = 200000;
int const MAXBIT = 1 << 18;
int N, NN, h[MAXN];
uint64_t a[MAXN];
uint64_t dp[MAXBIT + 1];
inline int pw2(int n) {
int ret = 1;
while (ret < n)
ret <<= 1;
return ret;
}
uint64_t bit_max(int i) {
++i;
uint64_t ret = 0;... | [
"assignment.change"
] | 983,879 | 983,880 | u294638337 | cpp |
p03176 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"expression.operation.binary.add"
] | 983,883 | 983,884 | u043443359 | cpp |
p03176 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | [
"literal.number.change"
] | 983,893 | 983,888 | u850516963 | cpp |
p03176 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | [
"literal.number.change"
] | 983,893 | 983,895 | u850516963 | cpp |
p03176 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | [
"literal.number.change"
] | 983,893 | 983,896 | u850516963 | cpp |
p03176 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | [
"literal.number.change",
"variable_declaration.value.change"
] | 983,893 | 983,897 | u850516963 | cpp |
p03176 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 983,898 | 983,897 | u850516963 | cpp |
p03176 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | [
"literal.number.change",
"variable_declaration.value.change"
] | 983,893 | 983,899 | u850516963 | cpp |
p03176 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 983,898 | 983,899 | u850516963 | cpp |
p03176 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | [
"literal.number.change",
"variable_declaration.value.change"
] | 983,893 | 983,900 | u850516963 | cpp |
p03176 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 983,898 | 983,900 | u850516963 | cpp |
p03176 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | [
"literal.number.change",
"variable_declaration.value.change"
] | 983,893 | 983,901 | u850516963 | cpp |
p03176 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x)... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 983,898 | 983,901 | u850516963 | cpp |
p03176 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
t... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
t... | [
"assignment.change"
] | 983,905 | 983,906 | u355335354 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)((x).size())
#define int long long
#define M 1000000007
#define MM 998244353
#define fr first
#define sc second
#define pii pair<in... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)((x).size())
#define int long long
#define M 1000000007
#define MM 998244353
#define fr first
#define sc second
#define pii pair<in... | [
"io.output.change"
] | 983,911 | 983,912 | u593540285 | cpp |
p03176 | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long, long>
#define REP(i, a,... | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long, long>
#define REP(i, a,... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 983,933 | 983,934 | u065898443 | cpp |
p03176 | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cer... | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cer... | [
"variable_declaration.type.change"
] | 983,948 | 983,949 | u379382721 | cpp |
p03176 | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cer... | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cer... | [
"variable_declaration.type.change"
] | 983,950 | 983,949 | u379382721 | cpp |
p03176 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int N;
int dat[2000000];
void init(int n) {
N = 1;
while (N < n)
N *= 2;
for (int i = 0; i < 2 * N; i++)
dat[i] = 0;
}
void update(int i, int x) {
i += N - 1;
dat[i] = max(dat[i], x);
while (i > 0) {
i = (i - 1) / 2;
dat[i... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int N;
ll dat[2000000];
void init(int n) {
N = 1;
while (N < n)
N *= 2;
for (int i = 0; i < 2 * N; i++)
dat[i] = 0;
}
void update(int i, ll x) {
i += N - 1;
dat[i] = max(dat[i], x);
while (i > 0) {
i = (i - 1) / 2;
dat[i] ... | [
"variable_declaration.type.change"
] | 983,966 | 983,967 | u676029460 | cpp |
p03176 | //#include <tourist>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | //#include <tourist>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 983,968 | 983,969 | u155416173 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | [] | 983,984 | 983,985 | u052332717 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | [
"variable_declaration.type.change"
] | 983,986 | 983,985 | u052332717 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | [
"variable_declaration.type.change"
] | 983,987 | 983,985 | u052332717 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | [
"variable_declaration.type.change"
] | 983,988 | 983,989 | u052332717 | cpp |
p03176 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | [
"expression.operation.binary.add"
] | 984,005 | 984,006 | u508571192 | cpp |
p03176 | #include <bits/stdc++.h>
// range maximum query segment tree;
#define ll long long int
using namespace std;
ll tree[800001] = {0};
ll query(int tidx, int lo, int hi, int i, int j) {
if (lo > j || hi < i)
return 0;
if (i <= lo && hi <= j)
return tree[tidx];
int mid = (lo + hi) / 2;
// if(i > mid){
/... | #include <bits/stdc++.h>
// range maximum query segment tree;
#define ll long long int
using namespace std;
ll tree[800005] = {0};
ll query(int tidx, int lo, int hi, int i, int j) {
if (lo > j || hi < i)
return 0;
if (i <= lo && hi <= j)
return tree[tidx];
int mid = (lo + hi) / 2;
// if(i > mid){
/... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 984,024 | 984,025 | u984659580 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
long long t[900000];
long long maxa = 0;
void update(int x, long long val, int tl, int tr, int v) {
if (tl == tr) {
t[v] = max(t[v], val);
return;
}
int g = tl + (tr - tl) / 2;
if (g >= x) {
update(x, val, tl, g, 2 * v);
} else {
... | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
long long t[900000];
long long maxa = 0;
void update(int x, long long val, int tl, int tr, int v) {
if (tl == tr) {
t[v] = max(t[v], val);
return;
}
int g = tl + (tr - tl) / 2;
if (g >= x) {
update(x, val, tl, g, 2 * v);
} else {
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 984,034 | 984,035 | u203719754 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mod 1000000007
int main() {
int n;
cin >> n;
lli h[n], cost[n];
for (int i = 0; i < n; i++)
cin >> h[i];
for (int j = 0; j < n; j++)
cin >> cost[j];
vector<lli> dp(n + 1);
int base = 1;
while (base <= n)
base *= ... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mod 1000000007
int main() {
int n;
cin >> n;
lli h[n], cost[n];
for (int i = 0; i < n; i++)
cin >> h[i];
for (int j = 0; j < n; j++)
cin >> cost[j];
vector<lli> dp(n + 1);
int base = 1;
while (base <= n)
base *= ... | [] | 984,046 | 984,047 | u194359166 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
int maximum = 0;
struct flower {
long long int height;
long long int beauty;
int pos;
};
bool compare(flower a, flower b) { return a.height > b.height; }
void update_element(long long int *seg_tree, int start, int end, int node,
int pos, long long ... | #include <bits/stdc++.h>
using namespace std;
long long int maximum = 0;
struct flower {
long long int height;
long long int beauty;
int pos;
};
bool compare(flower a, flower b) { return a.height > b.height; }
void update_element(long long int *seg_tree, int start, int end, int node,
int pos, ... | [
"variable_declaration.type.widen.change"
] | 984,048 | 984,049 | u395033868 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
namespace FastRead {
const int Dim(5000);
char ibuf[Dim];
int ipos, ilen;
char nc() {
if (ipos == ilen) {
ipos = 0;
ilen = fread(ibuf, 1, Dim, stdin);
if (!ilen)
return EOF;
}
return ibuf[ipos++];
}
template <class T> void read(T &x) {
char ch;
... | #include <bits/stdc++.h>
using namespace std;
namespace FastRead {
const int Dim(5000);
char ibuf[Dim];
int ipos, ilen;
char nc() {
if (ipos == ilen) {
ipos = 0;
ilen = fread(ibuf, 1, Dim, stdin);
if (!ilen)
return EOF;
}
return ibuf[ipos++];
}
template <class T> void read(T &x) {
char ch;
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 984,055 | 984,056 | u934482833 | cpp |
p03176 | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | [
"expression.operation.binary.change"
] | 984,062 | 984,063 | u064438560 | cpp |
p03176 | #include <bits/stdc++.h>
#define ll long long
#define MAX 200005
using namespace std;
int n;
ll dp[MAX * 4];
ll height[MAX];
ll beauty[MAX];
void build(int idx, int left, int right) {
if (left == right) {
dp[idx] = beauty[left];
return;
}
int mid = (left + right) / 2;
build(idx * 2, left, mid);
bui... | #include <bits/stdc++.h>
#define ll long long
#define MAX 200005
using namespace std;
int n;
ll dp[MAX * 4];
ll height[MAX];
ll beauty[MAX];
void build(int idx, int left, int right) {
if (left == right) {
dp[idx] = beauty[left];
return;
}
int mid = (left + right) / 2;
build(idx * 2, left, mid);
bui... | [
"variable_declaration.type.change"
] | 984,066 | 984,067 | u787597250 | cpp |
p03176 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define INF 0x3f3f3f3f
#define pii pair<int, int>
#define mem(x, a) memset(x, a, sizeof(x))
#define AC ios_base::sync_with_stdio(0), cin.tie(0)
using namespace std;
const int maxn = 2e5 + 50;
int n;
int bit[maxn], a[maxn], h[maxn];
int lowbit(int x) {... | #include <bits/stdc++.h>
#define int long long
#define pb push_back
#define INF 0x3f3f3f3f
#define pii pair<int, int>
#define mem(x, a) memset(x, a, sizeof(x))
#define AC ios_base::sync_with_stdio(0), cin.tie(0)
using namespace std;
const int maxn = 2e5 + 50;
int n;
int bit[maxn], a[maxn], h[maxn];
int lowbit(int x) ... | [
"identifier.change",
"function.return_value.remove"
] | 984,074 | 984,075 | u091757191 | cpp |
p03176 | /*
minh(v) 表示达到价值 v 的最低高度，则显然 h 单调递增
minh(0) = 0
遍历完第一个元素 a[i], h[i] 后，minh[1] = (h[i], a[i])
依次遍历下一个元素 k，在 minh 中找到小于 h[k] 的最近 minh[j].h，新组成 (h[k],
minh[j].a + a[k]) 已知 h[k] <= minh[j+1].h， 如果 minh[j].a + a[k] >
minh[j+1].a，则删掉 j+1
需要线段树？红黑树就可以搞定，可以尝试 c++
*/
#include <iostream>
#include <set>
using namespace std;
t... | /*
minh(v) 表示达到价值 v 的最低高度，则显然 h 单调递增
minh(0) = 0
遍历完第一个元素 a[i], h[i] 后，minh[1] = (h[i], a[i])
依次遍历下一个元素 k，在 minh 中找到小于 h[k] 的最近 minh[j].h，新组成 (h[k],
minh[j].a + a[k]) 已知 h[k] <= minh[j+1].h， 如果 minh[j].a + a[k] >
minh[j+1].a，则删掉 j+1
需要线段树？红黑树就可以搞定，可以尝试 c++
*/
#include <iostream>
#include <set>
using namespace std;
t... | [
"variable_declaration.remove",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 984,076 | 984,077 | u028014484 | cpp |
p03176 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e18;
vector<ll> value;
ll N;
void update(ll i, ll x) {
// i 番目の葉の値を x に変える
i += N - 1; // i 番目の葉のノード番号
value[i] = x;
while (i > 0) {
i = (i - 1) / 2; /... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e18;
vector<ll> value;
ll N;
void update(ll i, ll x) {
// i 番目の葉の値を x に変える
i += N - 1; // i 番目の葉のノード番号
value[i] = x;
while (i > 0) {
i = (i - 1) / 2; /... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 984,082 | 984,083 | u289381123 | cpp |
p03176 | #include <bits/stdc++.h>
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define int long long
#define endl ... | #include <bits/stdc++.h>
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define int long long
#define endl ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 984,086 | 984,087 | u702037060 | cpp |
p03176 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll int solve(ll int h[], ll int a[], int n) {
ll dp[n];
map<ll, ll> meaningful;
dp[0] = a[0];
meaningful[h[0]] = dp[0];
ll ans = 0;
for (int i = 1; i < n; i++) {
dp[i] = a[i];
auto it = meaningful.lower_bound(h[i] + 1);
i... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll int solve(ll int h[], ll int a[], int n) {
ll dp[n];
map<ll, ll> meaningful;
dp[0] = a[0];
meaningful[h[0]] = dp[0];
ll ans = a[0];
for (int i = 1; i < n; i++) {
dp[i] = a[i];
auto it = meaningful.lower_bound(h[i] + 1);
... | [] | 984,096 | 984,097 | u348267046 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, h[200005], b[200005], dp[200005];
int main() {
cin >> n;
int base = 1;
while (base <= n)
base *= 2;
vector<ll> tree(n * 2, 0);
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, h[200005], b[200005], dp[200005];
int main() {
cin >> n;
int base = 1;
while (base <= n)
base *= 2;
vector<ll> tree(base * 2, 0);
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 984,109 | 984,110 | u681396939 | cpp |
p03176 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long lu;
typedef long double ld;
typedef pair<ll, ll> pr;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
typedef vecto... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long lu;
typedef long double ld;
typedef pair<ll, ll> pr;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
typedef vecto... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 984,116 | 984,117 | u332525750 | cpp |
p03176 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | [
"call.arguments.change"
] | 984,120 | 984,121 | u697968316 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define int ll
struct flower {
int h;
int b;
};
signed main(void) {
int n;
cin >> n;
vector<flower> v(n + 1);
vector<int> dp(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i].h;
for (int i = 1; i <= n; i++)
cin >> v[i].b;
m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define int ll
struct flower {
int h;
int b;
};
signed main(void) {
int n;
cin >> n;
vector<flower> v(n + 1);
vector<int> dp(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i].h;
for (int i = 1; i <= n; i++)
cin >> v[i].b;
ma... | [
"assignment.value.change"
] | 984,124 | 984,125 | u043140820 | cpp |
p03176 | #include <algorithm>
#include <iostream>
#include <vector>
#define pb push_back
#define mp make_pair
using namespace std;
struct T {
vector<long long> t;
void init(int n) { t.resize(4 * n); }
void pull(int v) { t[v] = max(t[2 * v], t[2 * v + 1]); }
void build(int v, int tl, int tr) {
if (tl == tr) {
... | #include <algorithm>
#include <iostream>
#include <vector>
#define pb push_back
#define mp make_pair
using namespace std;
struct T {
vector<long long> t;
void init(int n) { t.resize(4 * n); }
void pull(int v) { t[v] = max(t[2 * v], t[2 * v + 1]); }
void build(int v, int tl, int tr) {
if (tl == tr) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 984,126 | 984,127 | u183606119 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.