problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02973 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pii pair<int, int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sy... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pii pair<int, int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sy... | [
"call.add",
"call.arguments.change"
] | 780,858 | 780,859 | u882039496 | cpp |
p02973 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repo(i, n) for (int i = 1; i <= n; i++)
#define INF 1001001001
#define INFll 100100100100100
// debug用
#define PrintVec(x) \
for (auto elementPrintVec : x) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repo(i, n) for (int i = 1; i <= n; i++)
#define INF 1001001001
#define INFll 100100100100100
// debug用
#define PrintVec(x) \
for (auto elementPrintVec : x) { ... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,863 | 780,864 | u930997891 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
/***** type *****/
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
template <class T> using uset = unordered_set<T>;
template... | #include <bits/stdc++.h>
using namespace std;
/***** type *****/
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
template <class T> using uset = unordered_set<T>;
template... | [
"misc.opposites",
"call.arguments.change"
] | 780,867 | 780,868 | u153390822 | cpp |
p02973 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <se... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <se... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,876 | 780,877 | u118225776 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto it... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto it... | [
"call.function.change"
] | 780,888 | 780,889 | u340010271 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? ... | [
"call.arguments.change"
] | 780,890 | 780,891 | u824905100 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, (n)-1, 0)
#define all(v) v.begin(), v.end()
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, (n)-1, 0)
#define all(v) v.begin(), v.end()
... | [
"call.arguments.change"
] | 780,892 | 780,893 | u137747137 | cpp |
p02973 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,894 | 780,895 | u614128939 | cpp |
p02973 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,894 | 780,896 | u614128939 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
// cout << fixed << setprecision(10) << flush;
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] *= -1;
}
int INF = (1 << 30);
// A についての広義単調減少列の最大の長さを求めればよい
// A * (-1) について... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
// cout << fixed << setprecision(10) << flush;
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] *= -1;
}
int INF = (1 << 30);
// A についての広義単調減少列の最大の長さを求めればよい
// A * (-1) について... | [
"call.arguments.change",
"identifier.change",
"call.function.change",
"identifier.replace.add",
"literal.replace.remove"
] | 780,915 | 780,916 | u658401995 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,926 | 780,927 | u603234915 | cpp |
p02973 | #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 main() {
int n;
cin >> n;
deque<int> q;
rep(i, n) {
int a;
cin >> a;
int x = lower_bound(q.begin(), q.end(), a) - q.begin();
if (x == 0)
q.push... | #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 main() {
int n;
cin >> n;
deque<int> q;
rep(i, n) {
int a;
cin >> a;
int x = lower_bound(q.begin(), q.end(), a) - q.begin();
if (x == 0)
q.push... | [
"assignment.change"
] | 780,928 | 780,929 | u754114382 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
multiset<int> ms;
for (auto a : A) {
if (ms.empty() || *ms.begin() >= a)
ms.insert(a);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
multiset<int> ms;
for (auto a : A) {
if (ms.empty() || *ms.begin() >= a)
ms.insert(a);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,940 | 780,941 | u175426149 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n, k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
const int MOD = int(... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n, k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
const int MOD = int(... | [
"identifier.change",
"misc.opposites",
"call.function.change",
"function.return_value.change",
"call.arguments.change"
] | 780,944 | 780,945 | u192061265 | cpp |
p02973 | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define all(x) x.begin(), x.end()
#define trav(i, a) for (auto &i : a)
inline int in() {
int x;
scanf("%lld", &x);
return x;
}
int32_t main(... | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define all(x) x.begin(), x.end()
#define trav(i, a) for (auto &i : a)
inline int in() {
int x;
scanf("%lld", &x);
return x;
}
int32_t main(... | [
"call.arguments.change"
] | 780,946 | 780,947 | u875407613 | cpp |
p02973 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
// ■■■■■■■■■■■■■■■■headerここまで■■■■■■■■■■■■■■■■
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> arr(n);
int length = 0;
arr[0] = a[0];
for (int i ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
// ■■■■■■■■■■■■■■■■headerここまで■■■■■■■■■■■■■■■■
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> arr(n);
int length = 0;
arr[0] = a[0];
for (int i ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,952 | 780,953 | u268551819 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push... | [
"call.function.change",
"expression.unary.arithmetic.add"
] | 780,954 | 780,955 | u722640678 | cpp |
p02973 | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
#ifdef _MSC_VER
#include <intrin... | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
#ifdef _MSC_VER
#include <intrin... | [
"call.arguments.change"
] | 780,958 | 780,959 | u243196226 | cpp |
p02973 | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
#ifdef _MSC_VER
#include <intrin... | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
#ifdef _MSC_VER
#include <intrin... | [
"call.arguments.change"
] | 780,960 | 780,961 | u243196226 | cpp |
p02973 | #include <iostream>
#include <set>
#include <vector>
signed main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (auto &ai : a)
std::cin >> ai;
std::multiset<int> s;
for (auto ai : a) {
auto itr = s.upper_bound(ai);
if (itr == std::begin(s)) {
s.emplace(ai);
continue;
}
... | #include <iostream>
#include <set>
#include <vector>
signed main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (auto &ai : a)
std::cin >> ai;
std::multiset<int> s;
for (auto ai : a) {
auto itr = s.lower_bound(ai);
if (itr == std::begin(s)) {
s.emplace(ai);
continue;
}
... | [
"call.function.change"
] | 780,962 | 780,963 | u423624748 | cpp |
p02973 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v;
rep(i, n) {
int x;
cin >> x;
auto it = lower_bound(v.begin(), v.end(), x);
if (it == v.begin()) {
v.insert(v.begin(), x);
} ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v;
rep(i, n) {
int x;
cin >> x;
auto it = lower_bound(v.begin(), v.end(), x);
if (it == v.begin()) {
v.insert(v.begin(), x);
} ... | [
"expression.unary.arithmetic.add"
] | 780,964 | 780,965 | u489302942 | cpp |
p02973 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,966 | 780,967 | u264265458 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
deque<int> r;
rep(i, n) {
int idx = lower_bound(r.begin(), r.end(), a[i]) - r.begin();
if (idx == 0) {
r.p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
deque<int> r;
rep(i, n) {
int idx = lower_bound(r.begin(), r.end(), a[i]) - r.begin();
--idx;
if (idx < 0) {... | [
"expression.unary.arithmetic.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,972 | 780,973 | u075775814 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<int>> v;
multiset<int> s;
vector<int> id(n);
rep(i, n) {
auto it = s.lower_bound(a[i]);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<int>> v;
multiset<int> s;
map<int, int> id;
rep(i, n) {
auto it = s.lower_bound(a[i]);
... | [
"variable_declaration.type.change"
] | 780,974 | 780,975 | u075775814 | cpp |
p02973 | ///////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <typeinfo>
#... | ///////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <typeinfo>
#... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 780,983 | 780,984 | u167931717 | cpp |
p02973 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,985 | 780,986 | u596311864 | cpp |
p02973 | #include <bits/stdc++.h>
#include <cstdint>
#include <vector>
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (l); i >= (int)(r); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n - 1, 0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf... | #include <bits/stdc++.h>
#include <cstdint>
#include <vector>
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (l); i >= (int)(r); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n - 1, 0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf... | [
"assignment.change"
] | 780,987 | 780,988 | u762160119 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 5;
multiset<int> st;
multiset<int>::iterator it;
int n, A[M];
int main() {
scanf("%d", &n);
for (int i = 1, res; i <= n; i++) {
scanf("%d", &A[i]);
}
for (int i = n; i >= 1; i--) {
it = st.upper_bound(A[i]);
if (it != st.end())
... | #include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 5;
multiset<int> st;
multiset<int>::iterator it;
int n, A[M];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
for (int i = n; i >= 1; i--) {
it = st.upper_bound(A[i]);
if (it != st.end())
st.e... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.remove",
"call.arguments.change"
] | 780,993 | 780,994 | u941446746 | cpp |
p02973 | #include <bits/stdc++.h>
#define ll long long
#define INF 1999122700
using namespace std;
int n;
int a[200004], f[200004];
map<int, int> mert;
bool check(int len, int x) { return (mert[len - 1] >= x); }
int main() {
mert.clear();
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
f[1] = 1;
... | #include <bits/stdc++.h>
#define ll long long
#define INF 1999122700
using namespace std;
int n;
int a[200004], f[200004];
map<int, int> mert;
bool check(int len, int x) { return (mert[len - 1] >= x); }
int main() {
mert.clear();
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
f[1] = 1;
... | [
"assignment.change"
] | 780,999 | 781,000 | u628253919 | cpp |
p02973 | #include <bits/stdc++.h>
#define ll long long
#define INF 1999122700
using namespace std;
int n;
int a[200004], f[200004];
map<int, int> mert;
bool check(int len, int x) { return (mert[len - 1] >= x); }
int main() {
mert.clear();
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
f[1] = 1;
... | #include <bits/stdc++.h>
#define ll long long
#define INF 1999122700
using namespace std;
int n;
int a[200004], f[200004];
map<int, int> mert;
bool check(int len, int x) { return (mert[len - 1] >= x); }
int main() {
mert.clear();
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
f[1] = 1;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 781,001 | 781,000 | u628253919 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
mul... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
mul... | [
"call.function.change"
] | 781,002 | 781,003 | u506112954 | cpp |
p02973 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, a[(int)1e5 + 10];
int cnt, que[(int)1e5 + 10];
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int i, j, num[2] = {0, 0};
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cnt = 0, que[0] = -100000;
for (i = ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, a[(int)1e5 + 10];
int cnt, que[(int)1e5 + 10];
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int i, j, num[2] = {0, 0};
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cnt = 0, que[0] = -100000;
for (i = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 781,004 | 781,005 | u006421797 | cpp |
p02973 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, a[(int)1e5 + 10];
int cnt, que[(int)1e5 + 10];
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int i, j, num[2] = {0, 0};
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cnt = 0, que[0] = -100000;
for (i = ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, a[(int)1e5 + 10];
int cnt, que[(int)1e5 + 10];
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int i, j, num[2] = {0, 0};
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cnt = 0, que[0] = -100000;
for (i = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 781,006 | 781,005 | u006421797 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using lli = long long int;
int inf = 1000000007;
using namespace std;
int N;
int main() {
cin >> N;
vector<int> A(N);
for (int i = 0... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using lli = long long int;
int inf = 1000000007;
using namespace std;
int N;
int main() {
cin >> N;
vector<int> A(N);
for (int i = 0... | [] | 781,010 | 781,011 | u134381136 | cpp |
p02973 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> group;
for (int i = 0; i < n; i++) {
long a;
cin >> a;
if (group.size() == 0 || group[0] > a) {
// cout << "Insert top " << a << endl;
group.insert(group.begin(),... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> group;
for (int i = 0; i < n; i++) {
long a;
cin >> a;
if (group.size() == 0 || group[0] >= a) {
// cout << "Insert top " << a << endl;
group.insert(group.begin()... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 781,012 | 781,013 | u199912250 | cpp |
p02973 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> group;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (group.size() == 0 || group[0] > a) {
// cout << "Insert top " << a << endl;
group.insert(group.begin(), a... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> group;
for (int i = 0; i < n; i++) {
long a;
cin >> a;
if (group.size() == 0 || group[0] >= a) {
// cout << "Insert top " << a << endl;
group.insert(group.begin()... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 781,014 | 781,013 | u199912250 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// #include "prettyprint.hpp"
int main() {
int N;
cin >> N;
long A[N];
for (int i = 0; i < N; i++) {
cin >> A... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// #include "prettyprint.hpp"
int main() {
int N;
cin >> N;
long A[N];
for (int i = 0; i < N; i++) {
cin >> A... | [
"call.arguments.change"
] | 781,021 | 781,022 | u439911726 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
multiset<int> S;
int res = 0;
for (int i = 0; i < N; ++i) {
auto itr = S.lower_bound(A[i]);
if (S.empty() || itr == S.begin()) {
++res;
S.insert(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
multiset<int> S;
int res = 0;
for (int i = 0; i < N; ++i) {
auto itr = S.lower_bound(A[i]);
if (S.empty() || itr == S.begin()) {
++res;
S.insert(... | [
"call.arguments.change"
] | 781,023 | 781,024 | u645369394 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define bFOR(i, n1, n2) for (ll i = n1; i >= n2; i--)
#define speed_up ... | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define bFOR(i, n1, n2) for (ll i = n1; i >= n2; i--)
#define speed_up ... | [
"call.arguments.change"
] | 781,025 | 781,026 | u055303078 | cpp |
p02973 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
scanf("%d", &n);
set<int> st;
int result = 0;
for (int i = 0; i < n; ++i) {
int x;
scanf("%d", &x);
auto it = st.lower_bound(x);
if (it == st.begin()) {
result++;
} else {
it--;
st.erase(it);
}
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
scanf("%d", &n);
multiset<int> st;
int result = 0;
for (int i = 0; i < n; ++i) {
int x;
scanf("%d", &x);
auto it = st.lower_bound(x);
if (it == st.begin()) {
result++;
} else {
it--;
st.erase(it);
}... | [
"variable_declaration.type.change"
] | 781,027 | 781,028 | u753391427 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
const int maxn = (1e5 + 10);
int n, a[maxn];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> v;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (v.size() == 0) {
++cnt;
v.push_back(a[i]);
continue;
}
if (... | #include <bits/stdc++.h>
using namespace std;
const int maxn = (1e5 + 10);
int n, a[maxn];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> v;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (v.size() == 0) {
++cnt;
v.push_back(a[i]);
continue;
}
if (... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 781,029 | 781,030 | u954081460 | cpp |
p02973 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1000000007;
const ll inf = 1e18;
#define REP(i, n) for (ll i = 0; i < (n);... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1000000007;
const ll inf = 1e18;
#define REP(i, n) for (ll i = 0; i < (n);... | [
"control_flow.loop.for.initializer.change"
] | 781,040 | 781,041 | u702582248 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr long double EPS = 1e-15;
const long double PI = acos(-1);
constexpr int inf = 2e9;
constexpr ll INF = 2e18;
constexpr ll MOD = 1e9 + 7;
constexpr ll MOD1 = 998244353;
typedef pair<ll, ll> P;
//#define all(v) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr long double EPS = 1e-15;
const long double PI = acos(-1);
constexpr int inf = 2e9;
constexpr ll INF = 2e18;
constexpr ll MOD = 1e9 + 7;
constexpr ll MOD1 = 998244353;
typedef pair<ll, ll> P;
//#define all(v) ... | [
"expression.unary.arithmetic.add"
] | 781,042 | 781,043 | u891178744 | cpp |
p02973 | //
// Created by Tetsuya Shiota on 2019-04-13.
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unord... | //
// Created by Tetsuya Shiota on 2019-04-13.
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unord... | [
"variable_declaration.type.change"
] | 781,044 | 781,045 | u996171098 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n;
int a[maxn];
int f[maxn];
int tot;
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; i++)
scanf("%d", &a[i]);
tot++;
f[tot] = a[1];
for (register int i = 2; i <= n; i++) {
if (a[i] <= f[tot])
f[++tot... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n;
int a[maxn];
int f[maxn];
int tot;
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; i++)
scanf("%d", &a[i]);
tot++;
f[tot] = a[1];
for (register int i = 2; i <= n; i++) {
if (a[i] <= f[tot])
f[++tot... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 781,046 | 781,047 | u088044957 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 50;
const int inf = 0x3f3f3f3f;
int v[maxn], dp[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &v[i]);
}
dp[1] = v[1];
int len = 1;
for (int i = 2; i <= n; i++) {
if (dp[len] >= v[i]) {... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 50;
const int inf = 0x3f3f3f3f;
int v[maxn], dp[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &v[i]);
}
dp[1] = v[1];
int len = 1;
for (int i = 2; i <= n; i++) {
if (dp[len] >= v[i]) {... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 781,048 | 781,049 | u251789483 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int... | [
"identifier.change",
"call.function.change"
] | 781,054 | 781,055 | u352200121 | cpp |
p02973 | #include <stdio.h>
#define fo(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i >= b; i--)
#include <set>
using namespace std;
int n, a[110000], ans;
multiset<int> q;
int main() {
scanf("%d", &n);
fo(i, 1, n) scanf("%d", &a[i]);
fo(i, 1, n) {
auto it = q.lower_bound(a[i]);
if (it... | #include <stdio.h>
#define fo(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i >= b; i--)
#include <set>
using namespace std;
int n, a[110000], ans;
multiset<int> q;
int main() {
scanf("%d", &n);
fo(i, 1, n) scanf("%d", &a[i]);
fo(i, 1, n) {
auto it = q.lower_bound(a[i]);
if (it... | [
"call.arguments.change"
] | 781,056 | 781,057 | u651274386 | cpp |
p02973 | #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;
#define ll long long
#define ull unsigned long long
#define f(a, b) for (ll i = a; i < b; i++)
#define mod 1000000007
#define mp make_pair
#define pb pu... | #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;
#define ll long long
#define ull unsigned long long
#define f(a, b) for (ll i = a; i < b; i++)
#define mod 1000000007
#define mp make_pair
#define pb pu... | [
"variable_declaration.type.change"
] | 781,058 | 781,059 | u875459711 | cpp |
p02973 | #include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
int n;
cin >> n;
vector<int64_t> a(n);
for (auto &r : a) {
cin >> r;
}
multiset<int64_t> ss;
for (auto &r : a) {
// cout << "* " << ss.size() << endl;
// for (auto &s: ss) {
// cout... | #include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
int n;
cin >> n;
vector<int64_t> a(n);
for (auto &r : a) {
cin >> r;
}
multiset<int64_t> ss;
for (auto &r : a) {
// cout << "* " << ss.size() << endl;
// for (auto &s: ss) {
// cout... | [
"call.arguments.change"
] | 781,060 | 781,061 | u932038818 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
set<int> S;
int main() {
int N, A, cnt = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
auto it = S.upper_bound(A);
if (it == S.begin()) {
cnt++;
S.insert(A);
} else {
it--;
S.erase(it);
S.insert(A);
}
}
co... | #include <bits/stdc++.h>
using namespace std;
multiset<int> S;
int main() {
int N, A, cnt = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
auto it = S.lower_bound(A);
if (it == S.begin()) {
cnt++;
S.insert(A);
} else {
it--;
S.erase(it);
S.insert(A);
}
}... | [
"variable_declaration.type.change",
"call.function.change"
] | 781,062 | 781,063 | u045811375 | cpp |
p02973 | #include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
#define MP make_pair
#define PB push_back
#define ll long long
#define int long long
#define f(i, x, n) for (int i = x; i < n; i++)
#define ld long double
#define mod 1000000007
int n;
int a[100005];
multiset<int> se;
int32_t main() {
io... | #include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
#define MP make_pair
#define PB push_back
#define ll long long
#define int long long
#define f(i, x, n) for (int i = x; i < n; i++)
#define ld long double
#define mod 1000000007
int n;
int a[100005];
multiset<int> se;
int32_t main() {
io... | [
"call.function.change"
] | 781,066 | 781,067 | u054388349 | cpp |
p02973 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = numeric_limits<int>::max();
const ll MOD = 1000000007;
template <class T> bool chmax(T ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = numeric_limits<int>::max();
const ll MOD = 1000000007;
template <class T> bool chmax(T ... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.condition.change"
] | 781,068 | 781,069 | u756088996 | cpp |
p02973 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <s... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <s... | [
"identifier.change",
"call.function.change"
] | 781,070 | 781,071 | u307578234 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
set<int> st;
int t;
int ans = 0;
for (int i = 0; i < n; ++i) {
cin >> t;
auto it = st.lower_bound(t);
if (it == st.begin()) {
st.insert(t);
++ans;
} else {
--it;
st.erase(it);
st.inser... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
multiset<int> st;
int t;
int ans = 0;
for (int i = 0; i < n; ++i) {
cin >> t;
auto it = st.lower_bound(t);
if (it == st.begin()) {
st.insert(t);
++ans;
} else {
--it;
st.erase(it);
st.... | [
"variable_declaration.type.change"
] | 781,076 | 781,077 | u604693716 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int a[maxn];
int d[maxn];
int main() {
int i, j, k, m, n;
cin >> n;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int top = 0;
for (i = n; i >= 1; i--) {
if (a[i] >= d[top])
d[++top] = a[i];
int x = upper_bound(d + ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int a[maxn];
int d[maxn];
int main() {
int i, j, k, m, n;
cin >> n;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int top = 0;
for (i = n; i >= 1; i--) {
if (a[i] >= d[top])
d[++top] = a[i];
else {
int x = upp... | [
"control_flow.branch.else.add",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 781,078 | 781,079 | u478540642 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
int a[100020];
int f[100020];
signed main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
reverse(a, a + n);
memset(f, 0x3f, sizeof f);
for (int i = 0; i < n; i++) {
int p = upper_bound(f, f + n, a[i]) - f;
f[... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
int a[100020];
int f[100020];
signed main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
reverse(a, a + n);
memset(f, 0x3f, sizeof f);
for (int i = 0; i < n; i++) {
int p = upper_bound(f, f + n, a[i]) - f;
f[p... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 781,088 | 781,089 | u453809729 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
int a[100020];
int f[100020];
signed main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
reverse(a, a + n);
memset(f, 0x3f, sizeof f);
for (int i = 0; i < n; i++) {
int p = upper_bound(f, f + n, a[i]) - f;
f[... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
int a[100020];
int f[100020];
signed main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
reverse(a, a + n);
memset(f, 0x3f, sizeof f);
for (int i = 0; i < n; i++) {
int p = upper_bound(f, f + n, a[i]) - f;
f[p... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change",
"call.function.change"
] | 781,090 | 781,089 | u453809729 | cpp |
p02973 | //==========================Head files==========================
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define db double
#define mp make_pair
#define pr pair<int, int>
#define f... | //==========================Head files==========================
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define db double
#define mp make_pair
#define pr pair<int, int>
#define f... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 781,091 | 781,092 | u774596402 | cpp |
p02973 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | [
"call.arguments.change"
] | 781,095 | 781,096 | u051493691 | cpp |
p02973 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define int long long
#define mod 1000000007
using namespace std;
vector<int> v;
int n, a[123456];
signed main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
v.push_back(a[n - 1]);
for (int i = n - 2; i >= 0; i--) {
if ... | #include <algorithm>
#include <iostream>
#include <vector>
#define int long long
#define mod 1000000007
using namespace std;
vector<int> v;
int n, a[123456];
signed main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
v.push_back(a[n - 1]);
for (int i = n - 2; i >= 0; i--) {
if (v[v.size() - 1] <... | [
"identifier.change",
"call.function.change"
] | 781,097 | 781,098 | u141968173 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod ... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod ... | [
"control_flow.loop.for.initializer.change",
"call.function.change",
"call.arguments.change"
] | 781,099 | 781,100 | u002419600 | cpp |
p02973 | #pragma GCC optimize("O2")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
... | #pragma GCC optimize("O2")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
... | [
"identifier.change",
"call.function.change",
"call.add"
] | 781,101 | 781,102 | u168578024 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int lis(vector<int> &A) {
int N = A.size();
vector<int> L(N);
L[0] = A[0];
int len = 1;
for (int i = 1; i < N; i++) {
if (L[len - 1] <= A[i]) {
L[len++] = A[i];
} else {
*l... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int lis(vector<int> &A) {
int N = A.size();
vector<int> L(N);
L[0] = A[0];
int len = 1;
for (int i = 1; i < N; i++) {
if (L[len - 1] <= A[i]) {
L[len++] = A[i];
} else {
*u... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 781,103 | 781,104 | u265881782 | cpp |
p02973 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int a[100000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; ++i)
... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int a[100000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; ++i)
... | [
"variable_declaration.type.change"
] | 781,105 | 781,106 | u562319622 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (auto &a : A)
cin >> a;
set<int> S;
int ans = 0;
for (int i = 0; i < N; i++) {
auto it = S.lower_bound(A[i]);
if (it == S.begin()) {
S.insert(A[i]);
ans++;
}... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (auto &a : A)
cin >> a;
multiset<int> S;
int ans = 0;
for (int i = 0; i < N; i++) {
auto it = S.lower_bound(A[i]);
if (it == S.begin()) {
S.insert(A[i]);
ans++;
... | [
"variable_declaration.type.change"
] | 781,109 | 781,110 | u449722246 | cpp |
p02973 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#includ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#includ... | [
"call.arguments.change"
] | 781,113 | 781,114 | u711985352 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ft first
#define sd second
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define Fr(i, n) for (int i = 1; i <= (n); ++i)
#define ifr(i, n) for (int i = (n)-1; i >= 0; --i)
#define iFr(i, n) for (int i = (n); i > 0; --i)
int main() {
cin.tie... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ft first
#define sd second
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define Fr(i, n) for (int i = 1; i <= (n); ++i)
#define ifr(i, n) for (int i = (n)-1; i >= 0; --i)
#define iFr(i, n) for (int i = (n); i > 0; --i)
int main() {
cin.tie... | [
"identifier.change",
"call.arguments.change"
] | 781,119 | 781,120 | u434208140 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000009
const long long INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
deque<ll> dq;
rep(i, n) {
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000009
const long long INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
deque<ll> dq;
rep(i, n) {
i... | [
"assignment.change"
] | 781,121 | 781,122 | u633967774 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | [
"call.arguments.change"
] | 781,123 | 781,124 | u628332144 | cpp |
p02973 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int... | [
"call.arguments.change"
] | 781,129 | 781,130 | u715366261 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 10e17
#define rep(i, n) for (long long i = 0; i < n; i++)
#define repr(i, n, m) for (long long i = m; i < n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 10e17
#define rep(i, n) for (long long i = 0; i < n; i++)
#define repr(i, n, m) for (long long i = m; i < n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long l... | [
"call.arguments.change"
] | 781,131 | 781,132 | u898749314 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define INF ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define INF ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 781,133 | 781,134 | u898749314 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x <<... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x <<... | [
"assignment.change"
] | 781,150 | 781,151 | u929582923 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
deque<ll> list;
ll top;
cin >> top;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
deque<ll> list;
ll top;
cin >> top;
... | [
"call.function.change",
"call.arguments.change"
] | 781,165 | 781,166 | u459930111 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
vector<ll> list;
ll top;
cin >> top;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
deque<ll> list;
ll top;
cin >> top;
... | [
"variable_declaration.type.change",
"call.function.change",
"call.arguments.change"
] | 781,167 | 781,166 | u459930111 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
vector<ll> list;
ll top;
cin >> top;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
deque<ll> list;
ll top;
cin >> top;
... | [
"variable_declaration.type.change",
"call.function.change"
] | 781,168 | 781,166 | u459930111 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++)
cin >> a[n - 1 - i];
vector<long long> dp(n, 10000000007);
dp[0] = a[0];
for (int i = 1; i < n; i++) {
i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++)
cin >> a[n - 1 - i];
vector<long long> dp(n, 10000000007);
dp[0] = a[0];
for (int i = 1; i < n; i++) {
i... | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 781,177 | 781,178 | u016987091 | cpp |
p02973 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
multiset<int> st;... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
multiset<int> st;... | [
"call.arguments.change"
] | 781,183 | 781,184 | u003026289 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i =... | [
"control_flow.branch.else.remove"
] | 781,187 | 781,188 | u050087249 | cpp |
p02973 | #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 main() {
int n;
cin >> n;
vector<int> c;
rep(i, n) {
int a;
cin >> a;
int sz = c.size();
if (!sz) {
c.push_back(a);
continue;
}
i... | #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 main() {
int n;
cin >> n;
vector<int> c;
rep(i, n) {
int a;
cin >> a;
int sz = c.size();
if (!sz) {
c.push_back(a);
continue;
}
i... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 781,193 | 781,194 | u894496005 | cpp |
p02973 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
//#include<unordered_set>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
tree<int, null_typ... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
//#include<unordered_set>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
tree<int, null_typ... | [
"call.add"
] | 781,195 | 781,196 | u533463334 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
void solve(long long N, std::vector<long long> A) {
multiset<ll> s;
for (int i = 0; i < N; i++) {
auto itr = s.lower_bound(A[i]);
if (itr == s.begin()) {
s.insert(A[i]);
} else {
--itr;
s.erase... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
void solve(long long N, std::vector<long long> A) {
multiset<ll> s;
for (int i = 0; i < N; i++) {
auto itr = s.lower_bound(A[i]);
if (itr == s.begin()) {
// cerr <<"*itr=" << *itr<< endl;
s.insert(A[i]);... | [
"call.arguments.change"
] | 781,197 | 781,198 | u943966256 | cpp |
p02973 | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>... | // g++ -std=c++14 test.cpp -o test.out
//問題URL
// https://atcoder.jp/contests/abc134/tasks/abc134_e
// multisetの注意点：
//ある値iをmultisetから削除したい時、erase(i)をすると
// multisetにiが複数入っている時これが全部削除対象になる
//一個だけ削除したい時は
//削除したい要素のイテレータをeraseの引数にしておく必要がある
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
... | [
"call.arguments.change"
] | 781,199 | 781,200 | u302000346 | cpp |
p02973 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
... | [
"identifier.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 781,208 | 781,209 | u374051158 | cpp |
p02973 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
... | [
"identifier.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.function.change",
"expression.operation.binary.change"
] | 781,210 | 781,209 | u374051158 | cpp |
p02973 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 781,211 | 781,209 | u374051158 | cpp |
p02973 | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (long long i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FORR(i, m, n) for (long long i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.en... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (long long i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FORR(i, m, n) for (long long i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.en... | [
"call.arguments.change"
] | 781,216 | 781,217 | u557565572 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i)... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i)... | [
"call.add",
"call.arguments.change"
] | 781,218 | 781,219 | u917282863 | cpp |
p02973 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> P1;
typedef pair<P, P> P2;
#define pu ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> P1;
typedef pair<P, P> P2;
#define pu ... | [
"identifier.change",
"call.function.change"
] | 781,220 | 781,221 | u284045566 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | [] | 781,231 | 781,232 | u530107518 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define ir... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define ir... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 781,233 | 781,234 | u530107518 | cpp |
p02973 | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 998244353, MAX = 1e18, larg = 1e5, INF = -1e18;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W,
x, y, z;
long long max_value = INF, max_inde... | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 998244353, MAX = 1e18, larg = 1e5, INF = -1e18;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W,
x, y, z;
long long max_value = INF, max_inde... | [
"variable_declaration.type.change"
] | 781,235 | 781,236 | u554988565 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> L;
L.push_back(A[0]);
for (int i = 0; i < N; i++) {
auto itr = lower_bound(L.begin(), L.end(), A[i]);
int k = distance(L.begin(), itr);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int64_t> L;
L.push_back(A[0]);
for (int i = 1; i < N; i++) {
auto itr = lower_bound(L.begin(), L.end(), A[i]);
int k = distance(L.begin(), itr);
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 781,241 | 781,242 | u101018317 | cpp |
p02973 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>... | [
"expression.unary.arithmetic.add"
] | 781,243 | 781,244 | u455266724 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 10000000000
#define MOD 998244353
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 10000000000
#define MOD 998244353
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) c... | [
"identifier.change",
"call.function.change"
] | 781,245 | 781,246 | u779216084 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip> //cout << fixed << setprecision(15) << x << endl;
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 6;
const int MOD = 1e9 + 7;
const ll LLIN... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip> //cout << fixed << setprecision(15) << x << endl;
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 6;
const int MOD = 1e9 + 7;
const ll LLIN... | [
"assignment.variable.change",
"identifier.change"
] | 781,251 | 781,252 | u275488634 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | [
"variable_declaration.type.change",
"call.function.change",
"expression.unary.arithmetic.add"
] | 781,253 | 781,254 | u427344224 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int N;
int big_n = 2000000000;
int main() {
cin >> N;
vector<int> A(N);
vector<int> B(N + 1);
B.at(0) = -1;
vector<vector<int>> C(N);
for (int i = 1; i <= N; i++) {
cin >> A.at(i - 1);
B.at(i) = big_n;
}
for (int i = N - 1; i >= 0; i--) {
auto ... | #include <bits/stdc++.h>
using namespace std;
int N;
int big_n = 2000000000;
int main() {
cin >> N;
vector<int> A(N);
vector<int> B(N + 1);
B.at(0) = -1;
vector<vector<int>> C(N);
for (int i = 1; i <= N; i++) {
cin >> A.at(i - 1);
B.at(i) = big_n;
}
for (int i = N - 1; i >= 0; i--) {
auto ... | [
"identifier.change",
"call.function.change"
] | 781,255 | 781,256 | u844382784 | cpp |
p02973 | #include <algorithm>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int... | #include <algorithm>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 781,260 | 781,261 | u376082984 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.