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 |
|---|---|---|---|---|---|---|---|
p03162 | #include <bits/stdc++.h>
using namespace std;
int n, a[100007], b[100007], c[100007], dp[100007][3], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
for (int i = 1; i <= n; i++) {
dp[i][0] = max(dp[i - 1][1], dp[i - 1][2]) + a[i];
dp[i][1] = max(dp[i - 1]... | #include <bits/stdc++.h>
using namespace std;
int n, a[100007], b[100007], c[100007], dp[100007][3], k;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
for (int i = 1; i <= n; i++) {
dp[i][0] = max(dp[i - 1][1], dp[i - 1][2]) + a[i];
dp[i][1] = max(dp[i - 1][0], ... | [
"expression.operation.binary.remove"
] | 962,702 | 962,703 | u666935035 | cpp |
p03162 | #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 tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
#define int long long
#define fast ... | #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 tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
#define int long long
#define fast ... | [
"call.arguments.add"
] | 962,707 | 962,708 | u390430783 | cpp |
p03162 | #pragma region header
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip... | #pragma region header
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,709 | 962,710 | u926006934 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n, k;
cin >> n;
vector<int> dp(3, 0);
for (int i = 0; i < n; i++) {
vector<int> dpn(3, INF);
vector<int> p(3);
for (int j = 0; j < 3; j++)
cin >> p[j];
// for(int j=0; j<3; ++j) cout<<p[j]<<" ";
... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n, k;
cin >> n;
vector<int> dp(3, 0);
for (int i = 0; i < n; i++) {
vector<int> dpn(3, -1);
vector<int> p(3);
for (int j = 0; j < 3; j++)
cin >> p[j];
// for(int j=0; j<3; ++j) cout<<p[j]<<" ";
f... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 962,713 | 962,714 | u001462978 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int dp[110000][3];
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
if (i == 0) {
if (j == 0)
dp[i % 2][j] = a[... | #include <bits/stdc++.h>
using namespace std;
int dp[2][3];
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
if (i == 0) {
if (j == 0)
dp[i % 2][j] = a[i];
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"assignment.change"
] | 962,715 | 962,716 | u001462978 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int dp[2][3];
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
if (i == 0) {
if (j == 0)
dp[i % 2][j] = a[i];
... | #include <bits/stdc++.h>
using namespace std;
int dp[2][3];
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
if (i == 0) {
if (j == 0)
dp[i % 2][j] = a[i];
... | [
"call.arguments.change",
"assignment.change"
] | 962,717 | 962,716 | u001462978 | cpp |
p03162 | #include "bits/stdc++.h"
using namespace std;
void solve() {
int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
vector<vector<int>> dp(n, vector<int>(3, 0));
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (int... | #include "bits/stdc++.h"
using namespace std;
void solve() {
int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
vector<vector<int>> dp(n, vector<int>(3, 0));
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (int... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,720 | 962,721 | u965895743 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
const int N = 1e5 + 5;
int a[5][N];
int dp[5][N];
int n;
int solve(int idx, int prev) {
if (idx == n + 1) {
return 0;
}
int &ans = dp[prev][idx];
if (ans != -1) {
return ans;
}
ans = 0;
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
const int N = 1e5 + 5;
int a[5][N];
int dp[5][N];
int n;
int solve(int idx, int prev) {
if (idx == n + 1) {
return 0;
}
int &ans = dp[prev][idx];
if (ans != -1) {
return ans;
}
ans = 0;
for (int i = 1; i <... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 962,724 | 962,725 | u302685914 | cpp |
p03162 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
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... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
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... | [
"expression.operation.binary.add"
] | 962,728 | 962,729 | u005006157 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define intl long long
void fastio() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
intl n;
cin >> n;
intl a[n + 1][4];
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define intl long long
void fastio() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
intl n;
cin >> n;
intl a[n + 1][4];
... | [] | 962,730 | 962,731 | u025753638 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long int
#define fin for (i = 0; i < n; i++)
#define vec vector<ll>
#define pb push_back
#define vecit vector<ll>::iterator
#define vecp vector<pair<ll, ll>>
#define vecpit vector<pair<ll, ll>>::iterator
#define mapp map<ll, ll>
#define mapr map<ll, pair<ll, ll>>
#define maprit ... | #include <bits/stdc++.h>
#define ll long long int
#define fin for (i = 0; i < n; i++)
#define vec vector<ll>
#define pb push_back
#define vecit vector<ll>::iterator
#define vecp vector<pair<ll, ll>>
#define vecpit vector<pair<ll, ll>>::iterator
#define mapp map<ll, ll>
#define mapr map<ll, pair<ll, ll>>
#define maprit ... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 962,732 | 962,733 | u524252607 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define MOD 1000000007
#define endl "\n"
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> arr[i][j];
}
}
int dp[n][3];
for (int j = 0; j < ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define MOD 1000000007
#define endl "\n"
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> arr[i][j];
}
}
int dp[n][3];
for (int j = 0; j < ... | [
"assignment.value.change",
"call.arguments.change"
] | 962,734 | 962,735 | u213082454 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define MOD 1000000007
#define endl "\n"
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> arr[i][j];
}
}
int dp[n][3];
for (int j = 0; j < ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define MOD 1000000007
#define endl "\n"
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> arr[i][j];
}
}
int dp[n][3];
for (int j = 0; j < ... | [
"assignment.value.change",
"call.arguments.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 962,736 | 962,735 | u213082454 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int v1, v2, v3;
int arr[3][n];
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
v1 = arr[0][0];
v2 = arr[0][1];
v3 = arr[0][2];
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int v1, v2, v3;
int arr[n][3];
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
v1 = arr[0][0];
v2 = arr[0][1];
v3 = arr[0][2];
for (int ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add"
] | 962,737 | 962,738 | u484382859 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int a[100000][3];
int dp[100000][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (int day = 1; day < n; day++) {... | #include <bits/stdc++.h>
using namespace std;
int a[100000][3];
int dp[100000][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (int day = 1; day < n; day++) {... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,739 | 962,740 | u174584859 | cpp |
p03162 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define endl '\n'
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> dp(3, 0);
for (int day = 0; day < n; ++day) {
vector<int> h(3), new_dp(3, 0);
for (int &x : h)
cin >> x;
for (in... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define endl '\n'
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> dp(3, 0);
for (int day = 0; day < n; ++day) {
vector<int> h(3), new_dp(3, 0);
for (int &x : h)
cin >> x;
for (in... | [
"call.add"
] | 962,752 | 962,753 | u328888869 | cpp |
p03162 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define endl '\n'
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<vector<int>> h(n, vector<int>(3));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 3; ++j)
cin >> h[i][j];
}
vector<vec... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define endl '\n'
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<vector<int>> h(n, vector<int>(3));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 3; ++j)
cin >> h[i][j];
}
vector<vec... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 962,754 | 962,755 | u328888869 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
long long hasil[100005][5];
int main() {
int n;
scanf("%d", &n);
long long data[n + 1][5];
for (int i = 1; i <= n; i++) {
scanf("%lld %lld %lld", &data[i][1], &data[i][2], &data[i][3]);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j < 4; j++) {
... | #include <bits/stdc++.h>
using namespace std;
long long hasil[100005][5];
int main() {
int n;
scanf("%d", &n);
long long data[n + 1][5];
for (int i = 1; i <= n; i++) {
scanf("%lld %lld %lld", &data[i][1], &data[i][2], &data[i][3]);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j < 4; j++) {
... | [] | 962,778 | 962,779 | u027968711 | cpp |
p03162 | ////=====BIsmillahir Rahmanir Rahim =====////
/* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#incl... | ////=====BIsmillahir Rahmanir Rahim =====////
/* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#incl... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,783 | 962,784 | u164081575 | cpp |
p03162 | #pragma region Header
#ifdef DEBUG
#include "debug.hpp"
#else
#define NDEBUG
#define debug(...)
#define IFD(...)
#endif
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <m... | #pragma region Header
#ifdef DEBUG
#include "debug.hpp"
#else
#define NDEBUG
#define debug(...)
#define IFD(...)
#endif
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <m... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,791 | 962,792 | u869306730 | cpp |
p03162 | #include <array>
#include <iostream>
#include <limits>
#include <vector>
using namespace std;
typedef long ll;
int main() {
ll n;
cin >> n;
vector<array<ll, 3>> nums(n);
for (auto &e : nums) {
for (auto &a : e)
cin >> a;
}
// cout << "done" << endl;
vector<array<ll, 3>> dp(n);
dp[0][0] = num... | #include <array>
#include <iostream>
#include <limits>
#include <vector>
using namespace std;
typedef long ll;
int main() {
ll n;
cin >> n;
vector<array<ll, 3>> nums(n);
for (auto &e : nums) {
for (auto &a : e)
cin >> a;
}
// cout << "done" << endl;
vector<array<ll, 3>> dp(n);
dp[0][0] = num... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 962,795 | 962,796 | u121525338 | cpp |
p03162 | /*
!!~~~~~~~~~~~~~~~~~~
#include < ~_~ Ajay >
~~~~~~~~~~~~~~~~~~~~!!
*/
#include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define int long long
#define lmax LLONG_MAX
#define lmin ... | /*
!!~~~~~~~~~~~~~~~~~~
#include < ~_~ Ajay >
~~~~~~~~~~~~~~~~~~~~!!
*/
#include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define int long long
#define lmax LLONG_MAX
#define lmin ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 962,801 | 962,802 | u969690971 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++)
cin >> arr[i][j];
}
vector<vector<int>> dp(n, vector<int>(3, 0));
for (int i = 0; i < n; i++) {
dp[0][i] = arr[0][i];
}
for (int i = 1;... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++)
cin >> arr[i][j];
}
vector<vector<int>> dp(n, vector<int>(3, 0));
for (int i = 0; i < 3; i++) {
dp[0][i] = arr[0][i];
}
for (int i = 1... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,806 | 962,807 | u157659681 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int func(int arr[][3], int n) {
int dp[n][3], maxval, i;
dp[0][0] = arr[0][0], dp[0][1] = arr[0][1], dp[0][2] = arr[0][2];
for (i = 0; i < n; i++) {
dp[i][0] = arr[i][0] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = arr[i][1] + max(dp[i - 1][0], dp[i - 1][2])... | #include <bits/stdc++.h>
using namespace std;
int func(int arr[][3], int n) {
int dp[n][3], maxval, i;
dp[0][0] = arr[0][0], dp[0][1] = arr[0][1], dp[0][2] = arr[0][2];
for (i = 1; i < n; i++) {
dp[i][0] = arr[i][0] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = arr[i][1] + max(dp[i - 1][0], dp[i - 1][2])... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 962,810 | 962,811 | u557086207 | cpp |
p03162 | #include <bits/stdc++.h>
#define int long long int
int dp[100010][3], a[100010][3], n;
using namespace std;
int solve(int i, int s) {
if (i == -1)
return 0;
if (dp[i][s] != -1)
return dp[i][s];
int m = 0;
for (int j = 0; j < 3; j++) {
if (j == s)
continue;
m = max(m, a[i][j] + solve(i - 1,... | #include <bits/stdc++.h>
#define int long long int
int dp[100010][3], a[100010][3], n;
using namespace std;
int solve(int i, int s) {
if (i == -1)
return 0;
if (dp[i][s] != -1)
return dp[i][s];
int m = 0;
for (int j = 0; j < 3; j++) {
if (j == s)
continue;
m = max(m, a[i][j] + solve(i - 1,... | [
"literal.number.change",
"io.output.change"
] | 962,817 | 962,818 | u772025386 | cpp |
p03162 | #include <bits/stdc++.h>
#define int long long int
int dp[100010][3], a[100010][3], n;
using namespace std;
int solve(int i, int s) {
if (i == -1)
return 0;
if (dp[i][s] != -1)
return dp[i][s];
int m = 0;
for (int j = 0; j < 3; j++) {
if (j == s)
continue;
m = max(m, a[i][j] + solve(i - 1,... | #include <bits/stdc++.h>
#define int long long int
int dp[100010][3], a[100010][3], n;
using namespace std;
int solve(int i, int s) {
if (i == -1)
return 0;
if (dp[i][s] != -1)
return dp[i][s];
int m = 0;
for (int j = 0; j < 3; j++) {
if (j == s)
continue;
m = max(m, a[i][j] + solve(i - 1,... | [
"literal.number.change",
"io.output.change",
"call.arguments.change"
] | 962,819 | 962,820 | u772025386 | cpp |
p03162 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 962,887 | 962,890 | u820341516 | cpp |
p03162 | #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 fast \
ios_base::sync_with_stdio(0); \
ci... | #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 fast \
ios_base::sync_with_stdio(0); \
ci... | [
"call.arguments.change",
"assignment.value.change",
"identifier.change"
] | 962,892 | 962,901 | u630231163 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int a[100000][3];
int f[100000][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++)
cin >> a[i][j];
}
f[0][0] = a[0][0];
f[0][1] = a[0][1];
f[0][2] = a[0][2];
for (int i = 1; i < n; i++) {
f[i][0] = a[i][... | #include <bits/stdc++.h>
using namespace std;
int a[100000][3];
int f[100000][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++)
cin >> a[i][j];
}
f[0][0] = a[0][0];
f[0][1] = a[0][1];
f[0][2] = a[0][2];
for (int i = 1; i < n; i++) {
f[i][0] = a[i][... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,905 | 962,906 | u650458605 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int solve(int a[], int b[], int c[], int n) {
int dp[n][3];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[2];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][0], dp[i -... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int solve(int a[], int b[], int c[], int n) {
int dp[n][3];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][0], dp[i -... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 962,910 | 962,911 | u566869069 | cpp |
p03162 | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); (i) < (n); i++)
#define repe(i, f, n) for (ll i = (f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1e+18;
int iINF = 1e9;
int MAXI = 1e8 + 1;
using vec = vector<int>;
int main() {
int N;
cin >> N;
vector<vector<int>> arr(N);... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); (i) < (n); i++)
#define repe(i, f, n) for (ll i = (f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1e+18;
int iINF = 1e9;
int MAXI = 1e8 + 1;
using vec = vector<int>;
int main() {
int N;
cin >> N;
vector<vector<int>> arr(N);... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 962,912 | 962,913 | u873269440 | cpp |
p03162 | #include <iostream>
using namespace std;
long long n, f[4][100004], a[4][100005];
int main() {
cin >> n;
for (long long i = 1; i <= n; ++i) {
cin >> a[i][1] >> a[i][2] >> a[i][3];
}
f[1][1] = a[1][1];
f[1][2] = a[1][2];
f[1][3] = a[1][3];
for (long long i = 2; i <= n; ++i) {
for (long long j = 1; ... | #include <iostream>
using namespace std;
long long n, f[100005][4], a[100005][4];
int main() {
cin >> n;
for (long long i = 1; i <= n; ++i) {
cin >> a[i][1] >> a[i][2] >> a[i][3];
}
f[1][1] = a[1][1];
f[1][2] = a[1][2];
f[1][3] = a[1][3];
for (long long i = 2; i <= n; ++i) {
for (long long j = 1; ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 962,918 | 962,919 | u519309774 | cpp |
p03162 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int arr[10010][10010];
int dp[10010][10010];
signed main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
for (int i = 0; i < 3; i++) {
dp[0][i] = arr[0][i];
}
for (int i = 1; i < n;... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int arr[100100][4];
int dp[100100][4];
signed main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
for (int i = 0; i < 3; i++) {
dp[0][i] = arr[0][i];
}
for (int i = 1; i < n; i++) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 962,920 | 962,921 | u035075095 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int n;
int dp[100001][4];
int point[100001][4];
int maxP(int i, int last) {
if (i == n)
return 0;
int ret = INT_MIN;
if (dp[i][last] != -1)
return dp[i][last];
for (int j = 1; j <= 3; j++) {
if (j != last) {
ret = max(ret, point[i][j] + maxP(i +... | #include <bits/stdc++.h>
using namespace std;
int n;
int dp[100001][4];
int point[100001][4];
int maxP(int i, int last) {
if (i == n)
return 0;
int ret = INT_MIN;
if (dp[i][last] != -1)
return dp[i][last];
for (int j = 1; j <= 3; j++) {
if (j != last) {
ret = max(ret, point[i][j] + maxP(i +... | [] | 962,922 | 962,923 | u061594873 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int dp[100005][4];
int main() {
int t;
cin >> t;
int a, b, c;
for (int i = 0; i < t; i++) {
cin >> a >> b >> c;
if (i == 0) {
dp[i][0] = a;
dp[i][1] = b;
dp[i][2] = c;
} else {
dp[i][0] = max(dp[i - 1][1] + a, dp[i - 1][2] + a);
... | #include <bits/stdc++.h>
using namespace std;
int dp[100005][4];
int main() {
int t;
cin >> t;
int a, b, c;
for (int i = 0; i < t; i++) {
cin >> a >> b >> c;
if (i == 0) {
dp[i][0] = a;
dp[i][1] = b;
dp[i][2] = c;
} else {
dp[i][0] = max(dp[i - 1][1] + a, dp[i - 1][2] + a);
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,924 | 962,925 | u704227127 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
void a() {
ios::sync_with_stdio(0);
cin.tie(0);
}
int main() {
a();
int n;
cin >> n;
vector<int> dp(3);
for (int i = 0; i < n; i++) {
vector<int> aux(3, 0), c(3);
for (int j = 0; j < 3; j++)
cin >> c[j];
for (... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
void a() {
ios::sync_with_stdio(0);
cin.tie(0);
}
int main() {
a();
int n;
cin >> n;
vector<int> dp(3);
for (int i = 0; i < n; i++) {
vector<int> aux(3, 0), c(3);
for (int j = 0; j < 3; j++)
cin >> c[j];
for (... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,926 | 962,927 | u068387844 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
int dp[n][3];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
int dp[n][3];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 962,928 | 962,929 | u847935562 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
int dp[n][3];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
int dp[n][3];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"misc.opposites",
"call.function.change",
"io.output.change"
] | 962,930 | 962,929 | u847935562 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
int dp[n][3];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
int dp[n][3];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1]... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 962,934 | 962,935 | u162798110 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const long long INF = 1e15;
int main() {
int n;
cin >> n;
int dp[3][n];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < n; j++) {
dp[i][j] = 0;
}
int a;
cin >> a;
dp[i][0] = a;
}
for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const long long INF = 1e15;
int main() {
int n;
cin >> n;
int dp[3][n];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < n; j++) {
dp[i][j] = 0;
}
int a;
cin >> a;
dp[i][0] = a;
}
for (... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 962,936 | 962,937 | u191484928 | cpp |
p03162 | #include <bits/stdc++.h>
#include <sstream>
using namespace std;
#define pr(x) cout << x
#define prs cout << " "
#define prn cout << "\n"
#define sc(x) cin >> x
#define ll long long int
int arr[1000005][3];
int dp[1000005][3];
int n;
int main() {
ios ::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
for... | #include <bits/stdc++.h>
#include <sstream>
using namespace std;
#define pr(x) cout << x
#define prs cout << " "
#define prn cout << "\n"
#define sc(x) cin >> x
#define ll long long int
int arr[1000005][3];
int dp[1000005][3];
int n;
int main() {
ios ::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin >> t... | [
"expression.operation.binary.remove"
] | 962,940 | 962,941 | u833947449 | cpp |
p03162 | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <vector>
#define str string
#define dbl double
#define ll long long
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>
#define vll vector<pll>
#define sl set<ll>
#define pb push_back
#define mp mak... | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <vector>
#define str string
#define dbl double
#define ll long long
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>
#define vll vector<pll>
#define sl set<ll>
#define pb push_back
#define mp mak... | [
"literal.number.change",
"call.arguments.change"
] | 962,946 | 962,947 | u430369139 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int maxN = 100100;
int grid[maxN][4];
int input[maxN][4];
int n;
int solve(int i, int type) {
if (i > n) {
return 0;
}
if (grid[i][type] != -1) {
return grid[i][type];
}
int res = 0;
for (int j = 1; j <= 3; j++) {
if (j != type) {
res = m... | #include <bits/stdc++.h>
using namespace std;
const int maxN = 100100;
int grid[maxN][4];
int input[maxN][4];
int n;
int solve(int i, int type) {
if (i > n) {
return 0;
}
if (grid[i][type] != -1) {
return grid[i][type];
}
int res = 0;
for (int j = 1; j <= 3; j++) {
if (j != type) {
res = m... | [
"literal.number.change",
"io.output.change"
] | 962,956 | 962,957 | u763460982 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
long long arr[10001][10001] = {0};
int main() {
long long n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
int a;
cin >> a;
arr[i][j] = a;
}
}
long long dp[10001][3];
memset(dp, 0, sizeof dp);
dp[0][0] = arr[0... | #include <bits/stdc++.h>
using namespace std;
long long arr[100001][3] = {0};
int main() {
long long n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
int a;
cin >> a;
arr[i][j] = a;
}
}
long long dp[100001][3];
memset(dp, 0, sizeof dp);
dp[0][0] = arr[0][... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 962,821 | 962,822 | u004244461 | cpp |
p03162 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[100000][100000];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
int dp[100000][100000];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (int i = 1; i < n; i++) ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[100000][4];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
int dp[100000][4];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (int i = 1; i < n; i++) {
for ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,827 | 962,826 | u193104527 | cpp |
p03162 | #include <algorithm>
#include <iostream>
using namespace std;
int n, arr[100005][3], dp[100005][3];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> arr[i][j];
}
}
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][2];
dp[0][2] = arr[0][3];
for (int i = 1; i < n... | #include <algorithm>
#include <iostream>
using namespace std;
int n, arr[100005][3], dp[100005][3];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> arr[i][j];
}
}
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
for (int i = 1; i < n... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 962,828 | 962,829 | u193834181 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define dbl double
#define forn(i, n, k) for (int i = 0; i < n; i = i + k)
#define forpn(p, n, k) for (int i = p; i < n; i += k)
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define all(v) v.begin(), v.end()
using namespace ... | #include <bits/stdc++.h>
#define ll long long
#define dbl double
#define forn(i, n, k) for (int i = 0; i < n; i = i + k)
#define forpn(p, n, k) for (int i = p; i < n; i += k)
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define all(v) v.begin(), v.end()
using namespace ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 962,830 | 962,831 | u883528203 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define dbl double
#define forn(i, n, k) for (int i = 0; i < n; i = i + k)
#define forpn(p, n, k) for (int i = p; i < n; i += k)
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define all(v) v.begin(), v.end()
using namespace ... | #include <bits/stdc++.h>
#define ll long long
#define dbl double
#define forn(i, n, k) for (int i = 0; i < n; i = i + k)
#define forpn(p, n, k) for (int i = p; i < n; i += k)
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define all(v) v.begin(), v.end()
using namespace ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"call.function.change",
"io.output.change"
] | 962,832 | 962,831 | u883528203 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n][3];
int a, b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (i == 0) {
dp[i][0] = a;
dp[i][1] = b;
dp[i][2] = c;
} else {
dp[i][0] = a + max(dp[i - 1][1], dp[i - 1][2]);
dp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n][3];
int a, b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (i == 0) {
dp[0][0] = a;
dp[0][1] = b;
dp[0][2] = c;
} else {
dp[i][0] = a + max(dp[i - 1][1], dp[i - 1][2]);
dp... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,840 | 962,841 | u165182711 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(n) (n).begin(), (n).end()
#define fi first
#define se second
typedef pair<int, int> PII;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[100005][3];
memset(a... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(n) (n).begin(), (n).end()
#define fi first
#define se second
typedef pair<int, int> PII;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[100005][3];
memset(a... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 962,850 | 962,851 | u560390257 | cpp |
p03162 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
vector<vector<int>> a(n, vector<int>(3)), dp(n, vector<int>(3, INT_MIN));
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> a[i][j];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(3)), dp(n, vector<int>(3, INT_MIN));
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> a[i][j];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0... | [] | 962,852 | 962,853 | u638369926 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int dp[100005][5] = {};
signed main() {
int N;
cin >> N;
int a, b, c;
cin >> a >> b >> c;
dp[0][0] = a;
dp[0][1] = b;
dp[0][2] = c;
for (... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int dp[100005][5] = {};
signed main() {
int N;
cin >> N;
int a, b, c;
cin >> a >> b >> c;
dp[0][0] = a;
dp[0][1] = b;
dp[0][2] = c;
for (... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 962,854 | 962,855 | u237390401 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define BOLT ios_base::sync_with_stdio(0)
#define newline cout << "\n"
#define eline cerr << "\n"
#define LL_MAX 9223372036854775807
#define LL_MIN -9223372036854775808
#define IN_FILE freopen("input.txt", "r", stdin)
#define OUT_FILE freopen("output.txt", "w", stdout)
lo... | #include <bits/stdc++.h>
using namespace std;
#define BOLT ios_base::sync_with_stdio(0)
#define newline cout << "\n"
#define eline cerr << "\n"
#define LL_MAX 9223372036854775807
#define LL_MIN -9223372036854775808
#define IN_FILE freopen("input.txt", "r", stdin)
#define OUT_FILE freopen("output.txt", "w", stdout)
lo... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 962,856 | 962,857 | u084217401 | cpp |
p03162 | #include <bits/stdc++.h>
#define int long long int
#define endl '\n'
#define pb push_back
#define mod 1000000007
#define db(i) cout << i << " ";
#define db1(i) cout << "(" << i << ")";
#define db2(i) cout << "[" << i << "]";
#define db3(i) cout << "{" << i << "}";
#define ff first
#define ss second
#define vv vector
#d... | #include <bits/stdc++.h>
#define int long long int
#define endl '\n'
#define pb push_back
#define mod 1000000007
#define db(i) cout << i << " ";
#define db1(i) cout << "(" << i << ")";
#define db2(i) cout << "[" << i << "]";
#define db3(i) cout << "{" << i << "}";
#define ff first
#define ss second
#define vv vector
#d... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.condition.change"
] | 962,863 | 962,864 | u054483369 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod = 1e9 + 7;
/*"itob" int to "N"base */ template <typename TypeInt>
string itob(const TypeInt v, int base) {
static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod = 1e9 + 7;
/*"itob" int to "N"base */ template <typename TypeInt>
string itob(const TypeInt v, int base) {
static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,867 | 962,868 | u157433024 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod = 1e9 + 7;
/*"itob" int to "N"base */ template <typename TypeInt>
string itob(const TypeInt v, int base) {
static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod = 1e9 + 7;
/*"itob" int to "N"base */ template <typename TypeInt>
string itob(const TypeInt v, int base) {
static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 962,869 | 962,868 | u157433024 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod = 1e9 + 7;
/*"itob" int to "N"base */ template <typename TypeInt>
string itob(const TypeInt v, int base) {
static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod = 1e9 + 7;
/*"itob" int to "N"base */ template <typename TypeInt>
string itob(const TypeInt v, int base) {
static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 962,867 | 962,870 | u157433024 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod = 1e9 + 7;
/*"itob" int to "N"base */ template <typename TypeInt>
string itob(const TypeInt v, int base) {
static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod = 1e9 + 7;
/*"itob" int to "N"base */ template <typename TypeInt>
string itob(const TypeInt v, int base) {
static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 962,869 | 962,870 | u157433024 | cpp |
p03162 | #include <bits/stdc++.h>
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long
using namespace ... | #include <bits/stdc++.h>
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long
using namespace ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"function.return_value.change"
] | 962,873 | 962,874 | u543083821 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define rep_a(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define fast ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define rep_a(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define fast ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 962,877 | 962,878 | u296273488 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long dp[100010][3], a[100010][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long dp[100010][3];
long long a[100010][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0;... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,879 | 962,880 | u147762850 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<vector<ll>> a(n, vector<ll>(3));
for (int i = 0; i < n; i++) {
cin >> a[i][0];
cin >> a[i][1];
cin >> a[i][2];
}
vector<vector<ll>> dp(n, vector<ll>(3));
dp[0][0] = a[0][0];
dp[0][1] = a[0... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<vector<ll>> a(n, vector<ll>(3));
for (int i = 0; i < n; i++) {
cin >> a[i][0];
cin >> a[i][1];
cin >> a[i][2];
}
vector<vector<ll>> dp(n, vector<ll>(3));
dp[0][0] = a[0][0];
dp[0][1] = a[0... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 962,889 | 962,891 | u272668049 | cpp |
p03162 | #include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
std::vector<std::vector<int>> a(n, std::vector<int>(n));
for (int i = 0; i < n; ++i)
for (int j = 0; j < 3; ++j)
std::cin >> a.at(i).at(j);
std::vector<std::vector<long>> dp(n + 1, std::vector<long>(3, 0... | #include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
std::vector<std::vector<int>> a(n, std::vector<int>(3));
for (int i = 0; i < n; ++i)
for (int j = 0; j < 3; ++j)
std::cin >> a.at(i).at(j);
std::vector<std::vector<int>> dp(n + 1, std::vector<int>(3, 0))... | [
"variable_declaration.type.primitive.change"
] | 962,893 | 962,894 | u089888152 | cpp |
p03162 | #include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
std::vector<std::vector<int>> a(n, std::vector<int>(n));
for (int i = 0; i < n; ++i)
for (int j = 0; j < 3; ++j)
std::cin >> a.at(i).at(j);
std::vector<std::vector<int>> dp(n + 1, std::vector<int>(3, 0))... | #include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
std::vector<std::vector<int>> a(n, std::vector<int>(3));
for (int i = 0; i < n; ++i)
for (int j = 0; j < 3; ++j)
std::cin >> a.at(i).at(j);
std::vector<std::vector<int>> dp(n + 1, std::vector<int>(3, 0))... | [] | 962,895 | 962,894 | u089888152 | cpp |
p03162 | #include <climits>
#include <iostream>
using namespace std;
long long int points[100000][3];
long long int dp[100000][3];
long long int max_points(int p, int n) {
if (n < 0) {
return 0;
}
if (dp[n][p] != -1) {
return dp[n][p];
}
long long int current = LLONG_MIN;
for (int i = 0; i < 3; i++) {
... | #include <climits>
#include <iostream>
using namespace std;
long long int points[100000][3];
long long int dp[100000][3];
long long int max_points(int p, int n) {
if (n < 0) {
return 0;
}
if (p != -1 && dp[n][p] != -1) {
return dp[n][p];
}
long long int current = LLONG_MIN;
for (int i = 0; i < 3; ... | [
"control_flow.branch.if.condition.change"
] | 962,896 | 962,897 | u959838921 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int a[100005][4];
int dp[100005][4];
int n;
int solve(int day, int flag) {
if (day == n)
return 0;
if (dp[day][flag] != -1)
return dp[day][flag];
int maxi = 0;
if (flag == 0) {
maxi = max(maxi, a[day][1] + solve(day + 1, 1));
maxi = max(maxi, a[day]... | #include <bits/stdc++.h>
using namespace std;
int a[100005][4];
int dp[100005][4];
int n;
int solve(int day, int flag) {
if (day == n)
return 0;
if (dp[day][flag] != -1)
return dp[day][flag];
int maxi = 0;
if (flag == 0) {
maxi = max(maxi, a[day][1] + solve(day + 1, 1));
maxi = max(maxi, a[day]... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,964 | 962,965 | u552762884 | cpp |
p03162 | /* *MELLOW THE PANDA*
`||||||||||||||||||||||!!!||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
`||||||||||||||||||!''
!!||||pp@@@@@@@@@@@@@@@@@@@@@@||||||!'````````||||||||||||||||
|||||||||||||||!'` ,g@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@L `|||||||||||||||
'||||||... | /* *MELLOW THE PANDA*
`||||||||||||||||||||||!!!||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
`||||||||||||||||||!''
!!||||pp@@@@@@@@@@@@@@@@@@@@@@||||||!'````````||||||||||||||||
|||||||||||||||!'` ,g@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@L `|||||||||||||||
'||||||... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 962,971 | 962,972 | u110320209 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[n][3];
for (int i = 0; i < n; i++) {
cin >> a[i][0];
cin >> a[i][1];
cin >> a[i][2];
}
for (int i = 1; i < n; i++) {
a[i][0] += max(a[i - 1][1], a[i - 1][2]);
a[i][1] += max(a[i - 1][0], a[i - 1][2]);
a[i][2] += m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++) {
cin >> a[i][0];
cin >> a[i][1];
cin >> a[i][2];
}
for (int i = 1; i < n; i++) {
a[i][0] += max(a[i - 1][1], a[i - 1][2]);
a[i][1] += max(a[i - 1][0], a[i - 1][2]);
... | [] | 962,981 | 962,982 | u691174533 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
int A = 0, B = 0, C = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
a += max(B, C);
b += max(A, C);
c += max(A, B);
A = a;
B = b;
C = c;
}
cout << max(A, (B, C)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
int A = 0, B = 0, C = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
a += max(B, C);
b += max(A, C);
c += max(A, B);
A = a;
B = b;
C = c;
}
cout << max(A, max(B, C)) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 962,985 | 962,986 | u681283552 | cpp |
p03162 | /*
Competitive programming template
Author: Aswin Sampath
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vl, greater<ll>()> pq_ll_min;
typedef priority_queue<ll> pq_ll_... | /*
Competitive programming template
Author: Aswin Sampath
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vl, greater<ll>()> pq_ll_min;
typedef priority_queue<ll> pq_ll_... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,993 | 962,994 | u968826463 | cpp |
p03162 | /*
Competitive programming template
Author: Aswin Sampath
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vl, greater<ll>()> pq_ll_min;
typedef priority_queue<ll> pq_ll_... | /*
Competitive programming template
Author: Aswin Sampath
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vl, greater<ll>()> pq_ll_min;
typedef priority_queue<ll> pq_ll_... | [
"call.arguments.add",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 962,995 | 962,994 | u968826463 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define INF 2000000000
struct plan {
int a, b, c;
plan(int a = 0, int b = 0, int c = 0) : a(a), b(b), c(c) {}
};
int main() {
int n;
cin >> n;
vector<plan> p(n);
int a, b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
p[i].a = a;
p[i].b... | #include <bits/stdc++.h>
using namespace std;
#define INF 2000000000
struct plan {
int a, b, c;
plan(int a = 0, int b = 0, int c = 0) : a(a), b(b), c(c) {}
};
int main() {
int n;
cin >> n;
vector<plan> p(n);
int a, b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
p[i].a = a;
p[i].b... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 963,013 | 963,014 | u685233906 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp1(3);
for (int i = 0; i < n; ++i) {
vector<int> dp2(3, 0);
vector<int> c(3);
cin >> c[0] >> c[1] >> c[2];
for (int j = 0; j < 3; ++j) {
for (int k = 0; k < 3; ++k) {
if (i != j)
dp2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp1(3);
for (int i = 0; i < n; ++i) {
vector<int> dp2(3, 0);
vector<int> c(3);
cin >> c[0] >> c[1] >> c[2];
for (int j = 0; j < 3; ++j) {
for (int k = 0; k < 3; ++k) {
if (j != k)
dp2... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 963,017 | 963,018 | u473494697 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int dp[3], m[3];
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int n;
cin >> n;
cin >> dp[0] >> dp[1] >> dp[2];
for (int i = 0; i < n; i++) {
cin >> m[0] >> m[1] >> m[2];
m[0] += max(dp[1], dp[2]);
m[1] += max(dp[0], dp[2]);
... | #include <bits/stdc++.h>
using namespace std;
int dp[3], m[3];
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int n;
cin >> n;
cin >> dp[0] >> dp[1] >> dp[2];
for (int i = 1; i < n; i++) {
cin >> m[0] >> m[1] >> m[2];
m[0] += max(dp[1], dp[2]);
m[1] += max(dp[0], dp[2]);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 963,019 | 963,020 | u265356851 | cpp |
p03162 | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define pb push_back
#define S second
#define F first
#define f(i, n) for (ll i = 0; i < n; i++)
#define fast ... | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define pb push_back
#define S second
#define F first
#define f(i, n) for (ll i = 0; i < n; i++)
#define fast ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 963,027 | 963,028 | u331842396 | cpp |
p03162 | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define cases \
long long test; \
cin >> test; \
while (... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define cases \
long long test; \
cin >> test; \
while (... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,031 | 963,032 | u337755352 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
struct activity {
int A, B, C;
};
int solve(vector<activity> arr, int n) {
int dp[n][3];
dp[0][0] = arr[0].A;
dp[0][1] = arr[0].B;
dp[0][2] = arr[0].C;
for (int i = 1; i < n; i++) {
dp[i][0] = arr[i].A + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = a... | #include <bits/stdc++.h>
using namespace std;
struct activity {
int A, B, C;
};
int solve(vector<activity> arr, int n) {
int dp[n][3];
dp[0][0] = arr[0].A;
dp[0][1] = arr[0].B;
dp[0][2] = arr[0].C;
for (int i = 1; i < n; i++) {
dp[i][0] = arr[i].A + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = a... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 963,033 | 963,034 | u678649976 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
int dp[n][3] = {0};
for (int i = 0; i < 3; i++)
dp[0][i] = a[0][i];
for (int i = 1; i < n; i++) {
for (int j = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
int dp[n][3] = {0};
for (int i = 0; i < 3; i++)
dp[0][i] = a[0][i];
for (int i = 1; i < n; i++) {
for (int j = 0;... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,035 | 963,036 | u675040086 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> v(n + 1);
int x, y, z;
for (int i = 1; i <= n; i++) {
cin >> x >> y >> z;
v[i].push_back(x);
v[i].push_back(y);
v[i].push_back(z);
}
int dp[n + 1][3];
dp[0][0] = dp[0][1] = dp[0][2] = 0;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> v(n + 1);
int x, y, z;
for (int i = 1; i <= n; i++) {
cin >> x >> y >> z;
v[i].push_back(x);
v[i].push_back(y);
v[i].push_back(z);
}
int dp[n + 1][3];
dp[0][0] = dp[0][1] = dp[0][2] = 0;
fo... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 963,041 | 963,042 | u702703568 | cpp |
p03162 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef l... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef l... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,049 | 963,050 | u274420084 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
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 INF = 1145141919;
const long lo... | #include <bits/stdc++.h>
using namespace std;
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 INF = 1145141919;
const long lo... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,055 | 963,056 | u330131083 | cpp |
p03162 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef vector<ll... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef vector<ll... | [
"call.remove"
] | 963,058 | 963,059 | u381120152 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
vector<vector<int>> inp(n, vector<int>(3));
for (int t = 0; t < n; t++) {
cin >> a >> b >> c;
inp[t][0] = a;
inp[t][1] = b;
inp[t][2] = c;
}
vector<vector<int>> dp(n, vector<int>(3));
dp[0][0] = inp[0][0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
vector<vector<int>> inp(n, vector<int>(3));
for (int t = 0; t < n; t++) {
cin >> a >> b >> c;
inp[t][0] = a;
inp[t][1] = b;
inp[t][2] = c;
}
vector<vector<int>> dp(n, vector<int>(3));
dp[0][0] = inp[0][0... | [
"expression.operation.binary.add"
] | 963,064 | 963,065 | u456172074 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(3, 0);
for (int i = 0; i < n; i++) {
vector<int> d(3);
vector<int> vec(3, 0);
for (int w = 0; w < 3; w++)
cin >> d[w];
for (int i = 0; i < 0; i++) {
for (int j = 0; j < 3; j++) {
if (i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(3, 0);
for (int i = 0; i < n; i++) {
vector<int> d(3);
vector<int> vec(3, 0);
for (int w = 0; w < 3; w++)
cin >> d[w];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (i ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,066 | 963,067 | u420978656 | cpp |
p03162 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b)
a = b;
return true;
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<vector<int>> a(n, vector<in... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b)
a = b;
return true;
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<vector<int>> a(n, vector<in... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"variable_declaration.name.change",
"io.output.change"
] | 963,068 | 963,069 | u596385287 | cpp |
p03162 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b)
a = b;
return true;
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<vector<int>> a(n, vector<in... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b)
a = b;
return true;
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<vector<int>> a(n, vector<in... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 963,068 | 963,070 | u596385287 | cpp |
p03162 | // In The Name Of Allah //
#include <bits/stdc++.h>
#define pb emplace_back
#define inf (int)1e9
#define ff first
#define ss second
#define ll long long
#define sp(n) cout << setprecision(n) << fixed
#define hellcat ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define give(x) cout << #x << " " << x << endl
#define ... | // In The Name Of Allah //
#include <bits/stdc++.h>
#define pb emplace_back
#define inf (int)1e9
#define ff first
#define ss second
#define ll long long
#define sp(n) cout << setprecision(n) << fixed
#define hellcat ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define give(x) cout << #x << " " << x << endl
#define ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 963,075 | 963,076 | u857968161 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
struct action {
int a;
int b;
int c;
};
int bottom(action axn[], int n) {
int dp[n + 1][3] = {0};
dp[0][0] = axn[0].a;
dp[0][1] = axn[1].b;
dp[0][2] = axn[2].c;
for (int i = 1; i < n; i++) {
dp[i][0] = axn[i].a + max(dp[i - 1][1... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
struct action {
int a;
int b;
int c;
};
int bottom(action axn[], int n) {
int dp[n + 1][3] = {0};
dp[0][0] = axn[0].a;
dp[0][1] = axn[0].b;
dp[0][2] = axn[0].c;
for (int i = 1; i < n; i++) {
dp[i][0] = axn[i].a + max(dp[i - 1][1... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 963,077 | 963,078 | u362998653 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int a[100005][4];
int dp[100005][4];
int n;
int f(int day, int game)
{
if (day == n)
return 0;
if (dp[day][game] != -1)
return dp[day][game];
int maxi = 0;
if (game == 0) {
maxi = max(maxi, a[day][1] + f(day + 1, 1));
maxi = max(maxi, a[day][2] + f(... | #include <bits/stdc++.h>
using namespace std;
int a[100005][4];
int dp[100005][4];
int n;
int f(int day, int game)
{
if (day == n)
return 0;
if (dp[day][game] != -1)
return dp[day][game];
int maxi = 0;
if (game == 0) {
maxi = max(maxi, a[day][1] + f(day + 1, 1));
maxi = max(maxi, a[day][2] + f(... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,079 | 963,080 | u653707087 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int a[100005][4];
int dp[100005][4];
int n;
int f(int day, int game)
{
if (day == n)
return 0;
if (dp[day][game] != -1)
return dp[day][game];
int maxi = 0;
if (game == 0) {
maxi = max(maxi, a[day][1] + f(day + 1, 1));
maxi = max(maxi, a[day][2] + f(... | #include <bits/stdc++.h>
using namespace std;
int a[100005][4];
int dp[100005][4];
int n;
int f(int day, int game)
{
if (day == n)
return 0;
if (dp[day][game] != -1)
return dp[day][game];
int maxi = 0;
if (game == 0) {
maxi = max(maxi, a[day][1] + f(day + 1, 1));
maxi = max(maxi, a[day][2] + f(... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,081 | 963,080 | u653707087 | cpp |
p03162 | // A B C D H F E I G K L M N P S O Q R J U Z Y X T V W
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pq priority_queue<int>
#define pqs priorit... | // A B C D H F E I G K L M N P S O Q R J U Z Y X T V W
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pq priority_queue<int>
#define pqs priorit... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 963,082 | 963,083 | u263294006 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <vector>
const int N = 1e5 + 1;
int f[N];
using namespace std;
int main() {
ios_b... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <vector>
const int N = 1e5 + 1;
int f[N];
using namespace std;
int main() {
ios_b... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 963,097 | 963,098 | u411957533 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define inf 1e18
#define for0(i, n) for (ll i = 0; i < (ll)(n); ++i) // 0 based indexing
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i) // 1 based indexing
#define forc(i, l, r) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define inf 1e18
#define for0(i, n) for (ll i = 0; i < (ll)(n); ++i) // 0 based indexing
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i) // 1 based indexing
#define forc(i, l, r) ... | [
"identifier.change",
"io.output.change"
] | 963,101 | 963,102 | u155580903 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n][3];
int i = 0;
while (i < n) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
i++;
}
int dp1[n], dp2[n], dp3[n];
dp1[0] = a[0][0];
dp2[0] = a[0][1];
dp3[0] = a[0][2];
for (i = 1; i < n; i++) {
dp1[i] += a[i][0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n][3];
int i = 0;
while (i < n) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
i++;
}
int dp1[n], dp2[n], dp3[n];
dp1[0] = a[0][0];
dp2[0] = a[0][1];
dp3[0] = a[0][2];
for (i = 1; i < n; i++) {
dp1[i] = a[i][0]... | [
"assignment.value.change"
] | 963,103 | 963,104 | u259468819 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
for (int i = 1; i < n; i++) {
arr[i][0] = arr[i][0] + max(arr[i - 1][1], arr[i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
for (int i = 1; i < n; i++) {
arr[i][0] = arr[i][0] + max(arr[i - 1][1], arr[i -... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 963,113 | 963,114 | u988401048 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
#define pie 3.141592653589
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i, n, n2, m, t, j, l, r, pos, mpos, f = 0, k, p, n1, z, q, x, y, x1, y1,
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
#define pie 3.141592653589
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i, n, n2, m, t, j, l, r, pos, mpos, f = 0, k, p, n1, z, q, x, y, x1, y1,
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,117 | 963,118 | u427140920 | cpp |
p03162 | /*
auth - @sportykush
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node... | /*
auth - @sportykush
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node... | [
"variable_declaration.remove"
] | 963,122 | 963,123 | u897990209 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A, A0, B, B0, C, C0;
cin >> A >> B >> C;
A0 = A;
B0 = B;
C0 = C;
for (int i = 1; i < N; i++) {
cin >> A >> B >> C;
int a0, b0, c0;
a0 = A + max(B0, C0);
b0 = A + max(A0, C0);
c0 = A + max(B0, A0);
A... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A, A0, B, B0, C, C0;
cin >> A >> B >> C;
A0 = A;
B0 = B;
C0 = C;
for (int i = 1; i < N; i++) {
cin >> A >> B >> C;
int a0, b0, c0;
a0 = A + max(B0, C0);
b0 = B + max(A0, C0);
c0 = C + max(B0, A0);
A... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 963,127 | 963,128 | u608574730 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1LL << 60;
#define rep1(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, k, n) for (ll i = k; i < (n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1LL << 60;
#define rep1(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, k, n) for (ll i = k; i < (n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
re... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 963,131 | 963,132 | u913016812 | cpp |
p03162 |
#include <bits/stdc++.h>
using namespace std;
int solve(vector<int> &a, vector<int> &b, vector<int> &c) {
vector<int> dp(3);
dp[0] = a[0];
dp[1] = a[1];
dp[2] = a[2];
int x, y, z;
for (int i = 1; i < a.size(); i++) {
x = max(dp[1] + a[i], dp[2] + a[i]);
y = max(dp[0] + b[i], dp[2] + b[i]);
z =... |
#include <bits/stdc++.h>
using namespace std;
int solve(vector<int> &a, vector<int> &b, vector<int> &c) {
vector<int> dp(3);
dp[0] = a[0];
dp[1] = b[0];
dp[2] = c[0];
int x, y, z;
for (int i = 1; i < a.size(); i++) {
x = max(dp[1] + a[i], dp[2] + a[i]);
y = max(dp[0] + b[i], dp[2] + b[i]);
z =... | [
"assignment.value.change",
"identifier.change",
"literal.number.change",
"variable_access.subscript.index.change"
] | 963,135 | 963,136 | u754735988 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.