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 | #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];
}
vector<int> Color(N);
for (int i = 0; i < N; i++) {
Color[i] = -1;
}
int cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
Color[cnt] = A[i];
cnt++;
} else {
// Color の中で最大なのは常に Color[cnt-1]
// A[i] がどのColor よりも大きかったら
if (A[i] >= Color[cnt - 1]) {
Color[cnt] = A[i];
cnt++;
} else {
// A[i]より大きい最小のColor を A[i]と置き換える そうするとColor
// の大小関係が変わらない
for (int j = 0; j < cnt; j++) {
if (A[i] > Color[j]) {
Color[j] = A[i];
}
}
}
}
}
printf("%d\n", cnt);
return 0;
}
| #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];
}
vector<int> Color(N);
for (int i = 0; i < N; i++) {
Color[i] = -1;
}
int cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
Color[cnt] = A[i];
cnt++;
} else {
// Color の中で最大なのは常に Color[cnt-1]
// A[i] がどのColor よりも大きかったら(同じ値でも)
if (A[i] >= Color[cnt - 1]) {
Color[cnt] = A[i];
cnt++;
} else {
// A[i]より大きい最小のColor を A[i]と置き換える そうするとColor
// の大小関係が変わらない
for (int j = 0; j < cnt; j++) {
if (A[i] < Color[j]) {
Color[j] = A[i];
break;
}
}
}
}
}
printf("%d\n", cnt);
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,468 | 780,465 | u883982500 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()
#define BiSearchRangeNum(x, y, z) \
lower_bound(x.begin(), x.end(), z) - lower_bound(x.begin(), x.end(), y) \
turn idx;
static const int INF = 1e9 + 7;
// 対象のvectorの [s, e)の範囲でのLIS
int solve(vector<int> &x, int s, int e) {
int INFTY = 1e9 + 7;
vector<int> ret(e - s, INFTY);
ret[0] = x[s];
int size = 1;
for (int i = s + 1; i < e; i++) {
int tmp = -x[i];
if (ret[size - 1] <= tmp) {
ret[size++] = tmp;
} else {
*upper_bound(ret.begin(), ret.end(), tmp) = tmp;
}
}
return size;
};
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, 0, N) { cin >> A[i]; }
int ans = solve(A, 0, A.size());
cout << ans << endl;
};
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()
#define BiSearchRangeNum(x, y, z) \
lower_bound(x.begin(), x.end(), z) - lower_bound(x.begin(), x.end(), y) \
turn idx;
static const int INF = 1e9 + 7;
// 対象のvectorの [s, e)の範囲でのLIS
int solve(vector<int> &x, int s, int e) {
int INFTY = 1e9 + 7;
vector<int> ret(e - s, INFTY);
ret[0] = -x[s];
int size = 1;
for (int i = s + 1; i < e; i++) {
int tmp = -x[i];
if (ret[size - 1] <= tmp) {
ret[size++] = tmp;
} else {
*upper_bound(ret.begin(), ret.end(), tmp) = tmp;
}
}
return size;
};
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, 0, N) { cin >> A[i]; }
int ans = solve(A, 0, A.size());
cout << ans << endl;
};
| [
"expression.operation.unary.add"
] | 780,473 | 780,474 | u987594251 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()
#define BiSearchRangeNum(x, y, z) \
lower_bound(x.begin(), x.end(), z) - lower_bound(x.begin(), x.end(), y) \
turn idx;
static const int INF = 1e9 + 7;
// 対象のvectorの [s, e)の範囲でのLIS
int solve(vector<int> &x, int s, int e) {
int INFTY = 1e9 + 7;
vector<int> ret(e - s, INFTY);
ret[0] = x[s];
int size = 1;
for (int i = s + 1; i < e; i++) {
int tmp = -x[i];
if (ret[size - 1] <= tmp) {
ret[size++] = tmp;
} else {
*lower_bound(ret.begin(), ret.end(), tmp) = tmp;
}
}
return size;
};
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, 0, N) { cin >> A[i]; }
int ans = solve(A, 0, A.size());
cout << ans << endl;
};
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()
#define BiSearchRangeNum(x, y, z) \
lower_bound(x.begin(), x.end(), z) - lower_bound(x.begin(), x.end(), y) \
turn idx;
static const int INF = 1e9 + 7;
// 対象のvectorの [s, e)の範囲でのLIS
int solve(vector<int> &x, int s, int e) {
int INFTY = 1e9 + 7;
vector<int> ret(e - s, INFTY);
ret[0] = -x[s];
int size = 1;
for (int i = s + 1; i < e; i++) {
int tmp = -x[i];
if (ret[size - 1] <= tmp) {
ret[size++] = tmp;
} else {
*upper_bound(ret.begin(), ret.end(), tmp) = tmp;
}
}
return size;
};
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, 0, N) { cin >> A[i]; }
int ans = solve(A, 0, A.size());
cout << ans << endl;
};
| [
"expression.operation.unary.add",
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,475 | 780,474 | u987594251 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int64_t i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define ALL(a) begin(a), end(a)
#define sz(s) (s).size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
void solve() {
int n;
cin >> n;
vector<int> m;
REP(i, n) {
int a;
cin >> a;
auto it = upper_bound(m.begin(), m.end(), a, greater<>());
if (it == m.end())
m.pb(a);
}
cout << m.size() << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int64_t i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define ALL(a) begin(a), end(a)
#define sz(s) (s).size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
void solve() {
int n;
cin >> n;
vector<int> m;
REP(i, n) {
int a;
cin >> a;
auto it = upper_bound(m.begin(), m.end(), a, greater<>());
if (it == m.end())
m.pb(a);
else
*it = a;
}
cout << m.size() << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 780,476 | 780,477 | u973991908 | cpp |
p02973 | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int64_t rll() {
long long n;
scanf("%lld", &n);
return n;
}
struct SegTree {
std::vector<int> data;
int n;
SegTree(int n_) {
for (n = 1; n < n_; n *= 2)
;
data.resize(2 * n);
}
void set(int i, int val) {
for (data[i += n] = val; i >>= 1;)
data[i] = std::max(data[i << 1], data[i << 1 | 1]);
}
int max(int l, int r) {
int res = 0;
for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
if (r & 1) {
r--;
res = std::max(res, data[r]);
}
if (l & 1) {
res = std::max(res, data[l]);
l++;
}
}
return res;
}
};
int main() {
int n = ri();
int a[n];
for (int i = 0; i < n; i++)
a[i] = ri();
std::set<int> all;
for (int i = 0; i < n; i++)
all.insert(a[i]);
std::map<int, int> comp;
std::vector<int> decomp;
int cnt = 0;
for (auto i : all)
comp[i] = cnt++, decomp.push_back(i);
SegTree tree(all.size());
for (int i = 0; i < n; i++) {
tree.set(comp[a[i]], std::max(tree.data[tree.n + comp[a[i]]],
tree.max(comp[a[i]], n) + 1));
}
std::cout << tree.max(0, tree.n) << std::endl;
return 0;
}
| #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int64_t rll() {
long long n;
scanf("%lld", &n);
return n;
}
struct SegTree {
std::vector<int> data;
int n;
SegTree(int n_) {
for (n = 1; n < n_; n *= 2)
;
data.resize(2 * n);
}
void set(int i, int val) {
for (data[i += n] = val; i >>= 1;)
data[i] = std::max(data[i << 1], data[i << 1 | 1]);
}
int max(int l, int r) {
int res = 0;
for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
if (r & 1) {
r--;
res = std::max(res, data[r]);
}
if (l & 1) {
res = std::max(res, data[l]);
l++;
}
}
return res;
}
};
int main() {
int n = ri();
int a[n];
for (int i = 0; i < n; i++)
a[i] = ri();
std::set<int> all;
for (int i = 0; i < n; i++)
all.insert(a[i]);
std::map<int, int> comp;
std::vector<int> decomp;
int cnt = 0;
for (auto i : all)
comp[i] = cnt++, decomp.push_back(i);
SegTree tree(all.size());
for (int i = 0; i < n; i++) {
tree.set(comp[a[i]], std::max(tree.data[tree.n + comp[a[i]]],
tree.max(comp[a[i]], tree.n) + 1));
}
std::cout << tree.max(0, tree.n) << std::endl;
return 0;
}
| [] | 780,478 | 780,479 | u040490988 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define SORT(x) sort(x.begin(), x.end())
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
#define No cout << "No" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) { cin >> a[i]; }
vector<ll> c;
c.push_back(a[0]);
ll num = 0;
for (ll i = 1; i < n; i++) {
if (c[num] <= (-a[i])) {
c.push_back(-a[i]);
num++;
} else {
// binsearch
ll k = (upper_bound(ALL(c), -a[i]) - c.begin());
c[k] = (-a[i]);
}
}
/* rep(i,c.size()){
cout<<c[i]<<' ';
}cout<<endl;*/
cout << c.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define SORT(x) sort(x.begin(), x.end())
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
#define No cout << "No" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) { cin >> a[i]; }
vector<ll> c;
c.push_back(-a[0]);
ll num = 0;
for (ll i = 1; i < n; i++) {
if (c[num] <= (-a[i])) {
c.push_back(-a[i]);
num++;
} else {
// binsearch
ll k = (upper_bound(ALL(c), -a[i]) - c.begin());
c[k] = (-a[i]);
}
}
cout << c.size() << endl;
return 0;
}
| [
"expression.operation.unary.add",
"call.arguments.change"
] | 780,484 | 780,485 | u022832318 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int n, a[200010], ans[200010], la;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n / 2; i++)
swap(a[i], a[n - i + 1]);
for (int i = 1; i <= n; i++) {
if (ans[la] <= a[i])
ans[++la] = a[i];
else {
int p = lower_bound(ans + 1, ans + la + 1, a[i]) - ans;
ans[p] = a[i];
}
}
cout << la << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, a[200010], ans[200010], la;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n / 2; i++)
swap(a[i], a[n - i + 1]);
for (int i = 1; i <= n; i++) {
if (ans[la] <= a[i])
ans[++la] = a[i];
else {
int p = upper_bound(ans + 1, ans + la + 1, a[i]) - ans;
ans[p] = a[i];
}
}
cout << la << endl;
return 0;
} | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,488 | 780,489 | u727652622 | cpp |
p02973 | #include <iostream>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
set<int> seta;
int res = 0;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
if (seta.empty()) {
seta.insert(A);
res++;
} else {
set<int>::iterator itr = seta.lower_bound(A);
if (itr == seta.begin()) {
seta.insert(A);
res++;
} else {
itr--;
seta.erase(itr);
seta.insert(A);
}
}
}
cout << res << endl;
return 0;
} | #include <iostream>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
multiset<int> seta;
int res = 0;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
if (seta.empty()) {
seta.insert(A);
res++;
} else {
multiset<int>::iterator itr = seta.lower_bound(A);
if (itr == seta.begin()) {
seta.insert(A);
res++;
} else {
itr--;
seta.erase(itr);
seta.insert(A);
}
}
}
cout << res << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 780,490 | 780,491 | u755090102 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int arr[N], n, val[N];
multiset<int> myset;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
myset.insert(-arr[0]);
for (int i = 1; i < n; i++) {
int val = (*myset.rbegin());
if (-val >= arr[i])
myset.insert(-arr[i]);
else {
myset.erase(myset.lower_bound(-arr[i]));
myset.insert(-arr[i]);
}
}
cout << myset.size();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int arr[N], n, val[N];
multiset<int> myset;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
myset.insert(-arr[0]);
for (int i = 1; i < n; i++) {
int val = (*myset.rbegin());
if (-val >= arr[i])
myset.insert(-arr[i]);
else {
myset.erase(myset.upper_bound(-arr[i]));
myset.insert(-arr[i]);
}
}
cout << myset.size();
return 0;
} | [
"call.function.change",
"call.arguments.change"
] | 780,506 | 780,507 | u221592478 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
template <typename T> class tRMQ {
vector<T> data;
T unit;
public:
static const long long INF = 100000000000;
int n;
function<T(const T &, const T &)> f;
tRMQ(int _, T u, function<T(T, T)> bi) {
unit = u;
f = bi;
n = 1;
while (n < _) {
n <<= 1;
}
data.resize(n * 4);
for (int i = 0; i < n * 4; i++)
data[i] = unit;
}
void update(int index, T val) {
int i = index + n - 1;
data[i] = val;
while (i > 0) {
i = (i - 1) / 2;
data[i] = f(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)
T query(int a, int b, int k, int l, int r) {
if (a < 0 || r <= a || b <= l)
return unit;
if (a <= l && r <= b)
return data[k];
else
return f(query(a, b, k * 2 + 1, l, (l + r) / 2),
query(a, b, k * 2 + 2, (r + l) / 2, r));
}
T query(int a, int b) { return query(a, b, 0, 0, n); }
};
tRMQ<ll> minrmq(int n) {
return tRMQ<ll>(n, 10000000000000000LL, [](ll r, ll l) { return min(l, r); });
}
tRMQ<ll> maxrmq(int n) {
return tRMQ<ll>(n, -10000000000000000LL,
[](ll r, ll l) { return max(l, r); });
}
tRMQ<ll> sumrmq(int n) {
return tRMQ<ll>(n, 0, [](ll l, ll r) { return l + r; });
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
map<ll, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]] = 0;
}
int c = 1;
for (auto &v : mp) {
v.second = c++;
}
auto r = maxrmq(n + 3);
r.update(0, 0);
ll ans = 0;
for (int i = n - 1; i >= 0; i--) {
ll b = r.query(0, mp[a[i]]) + 1;
r.update(mp[a[i]], b);
ans = max(ans, b);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
template <typename T> class tRMQ {
vector<T> data;
T unit;
public:
static const long long INF = 100000000000;
int n;
function<T(const T &, const T &)> f;
tRMQ(int _, T u, function<T(T, T)> bi) {
unit = u;
f = bi;
n = 1;
while (n < _) {
n <<= 1;
}
data.resize(n * 4);
for (int i = 0; i < n * 4; i++)
data[i] = unit;
}
void update(int index, T val) {
int i = index + n - 1;
data[i] = val;
while (i > 0) {
i = (i - 1) / 2;
data[i] = f(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)
T query(int a, int b, int k, int l, int r) {
if (a < 0 || r <= a || b <= l)
return unit;
if (a <= l && r <= b)
return data[k];
else
return f(query(a, b, k * 2 + 1, l, (l + r) / 2),
query(a, b, k * 2 + 2, (r + l) / 2, r));
}
T query(int a, int b) { return query(a, b, 0, 0, n); }
};
tRMQ<ll> minrmq(int n) {
return tRMQ<ll>(n, 10000000000000000LL, [](ll r, ll l) { return min(l, r); });
}
tRMQ<ll> maxrmq(int n) {
return tRMQ<ll>(n, -10000000000000000LL,
[](ll r, ll l) { return max(l, r); });
}
tRMQ<ll> sumrmq(int n) {
return tRMQ<ll>(n, 0, [](ll l, ll r) { return l + r; });
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
map<ll, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]] = 0;
}
int c = 1;
for (auto &v : mp) {
v.second = c++;
}
auto r = maxrmq(n + 3);
r.update(0, 0);
ll ans = 0;
for (int i = n - 1; i >= 0; i--) {
ll b = r.query(0, mp[a[i]]) + 1;
r.update(mp[a[i]] - 1, b);
ans = max(ans, b);
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 780,513 | 780,514 | u656572785 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
template <typename T> class tRMQ {
vector<T> data;
T unit;
public:
static const long long INF = 100000000000;
int n;
function<T(const T &, const T &)> f;
tRMQ(int _, T u, function<T(T, T)> bi) {
unit = u;
f = bi;
n = 1;
while (n < _) {
n <<= 1;
}
data.resize(n * 4);
for (int i = 0; i < n * 4; i++)
data[i] = unit;
}
void update(int index, T val) {
int i = index + n - 1;
data[i] = val;
while (i > 0) {
i = (i - 1) / 2;
data[i] = f(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)
T query(int a, int b, int k, int l, int r) {
if (a < 0 || r <= a || b <= l)
return unit;
if (a <= l && r <= b)
return data[k];
else
return f(query(a, b, k * 2 + 1, l, (l + r) / 2),
query(a, b, k * 2 + 2, (r + l) / 2, r));
}
T query(int a, int b) { return query(a, b, 0, 0, n); }
};
tRMQ<ll> minrmq(int n) {
return tRMQ<ll>(n, 10000000000000000LL, [](ll r, ll l) { return min(l, r); });
}
tRMQ<ll> maxrmq(int n) {
return tRMQ<ll>(n, -10000000000000000LL,
[](ll r, ll l) { return max(l, r); });
}
tRMQ<ll> sumrmq(int n) {
return tRMQ<ll>(n, 0, [](ll l, ll r) { return l + r; });
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
map<ll, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]] = 0;
}
int c = 1;
for (auto &v : mp) {
v.second = c++;
}
auto r = maxrmq(n + 3);
r.update(0, 0);
ll ans = 0;
for (int i = n - 1; i >= 0; i--) {
ll b = r.query(0, mp[a[i]]) + 1;
r.update(a[i], b);
ans = max(ans, b);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
template <typename T> class tRMQ {
vector<T> data;
T unit;
public:
static const long long INF = 100000000000;
int n;
function<T(const T &, const T &)> f;
tRMQ(int _, T u, function<T(T, T)> bi) {
unit = u;
f = bi;
n = 1;
while (n < _) {
n <<= 1;
}
data.resize(n * 4);
for (int i = 0; i < n * 4; i++)
data[i] = unit;
}
void update(int index, T val) {
int i = index + n - 1;
data[i] = val;
while (i > 0) {
i = (i - 1) / 2;
data[i] = f(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)
T query(int a, int b, int k, int l, int r) {
if (a < 0 || r <= a || b <= l)
return unit;
if (a <= l && r <= b)
return data[k];
else
return f(query(a, b, k * 2 + 1, l, (l + r) / 2),
query(a, b, k * 2 + 2, (r + l) / 2, r));
}
T query(int a, int b) { return query(a, b, 0, 0, n); }
};
tRMQ<ll> minrmq(int n) {
return tRMQ<ll>(n, 10000000000000000LL, [](ll r, ll l) { return min(l, r); });
}
tRMQ<ll> maxrmq(int n) {
return tRMQ<ll>(n, -10000000000000000LL,
[](ll r, ll l) { return max(l, r); });
}
tRMQ<ll> sumrmq(int n) {
return tRMQ<ll>(n, 0, [](ll l, ll r) { return l + r; });
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
map<ll, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]] = 0;
}
int c = 1;
for (auto &v : mp) {
v.second = c++;
}
auto r = maxrmq(n + 3);
r.update(0, 0);
ll ans = 0;
for (int i = n - 1; i >= 0; i--) {
ll b = r.query(0, mp[a[i]]) + 1;
r.update(mp[a[i]] - 1, b);
ans = max(ans, b);
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 780,515 | 780,514 | u656572785 | cpp |
p02973 | #include <algorithm>
#include <climits>
#include <cstdio>
int n;
int a[100005];
int d[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
d[i] = INT_MIN;
}
d[1] = a[1];
int ans = 1;
for (int i = 2; i <= n; i++) {
if (a[i] <= d[ans])
d[++ans] = a[i];
else {
int pos;
int l = 1, r = ans, mid;
while (l <= r) {
mid = (l + r) / 2;
if (d[mid] >= a[i])
l = mid + 1;
else
r = mid - 1;
}
pos = r;
d[pos] = a[i];
}
}
printf("%d\n", ans);
return 0;
} | #include <algorithm>
#include <climits>
#include <cstdio>
int n;
int a[100005];
int d[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
d[i] = INT_MIN;
}
d[1] = a[1];
int ans = 1;
for (int i = 2; i <= n; i++) {
if (a[i] <= d[ans])
d[++ans] = a[i];
else {
int l = 1, r = ans, mid;
while (l <= r) {
mid = (l + r) / 2;
if (d[mid] >= a[i])
l = mid + 1;
else
r = mid - 1;
}
int pos = l;
d[pos] = a[i];
}
}
printf("%d\n", ans);
return 0;
} | [
"variable_declaration.remove",
"variable_declaration.value.change"
] | 780,518 | 780,519 | u358689692 | cpp |
p02973 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
a.push_back(tmp);
}
vector<int> ans;
// ans.push_back(a[0]);
for (int i = 0; i < n; i++) {
auto it = upper_bound(ans.begin(), ans.end(), -a[i]);
if (it == ans.end()) {
ans.push_back(-a[i]);
} else {
*it = a[i];
}
// sort(ans.begin(), ans.end());
}
cout << ans.size() << endl;
return 0;
} | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
a.push_back(tmp);
}
vector<int> ans;
// ans.push_back(a[0]);
for (int i = 0; i < n; i++) {
auto it = upper_bound(ans.begin(), ans.end(), -a[i]);
if (it == ans.end()) {
ans.push_back(-a[i]);
} else {
*it = -a[i];
}
// sort(ans.begin(), ans.end());
}
cout << ans.size() << endl;
return 0;
} | [
"expression.operation.unary.add"
] | 780,522 | 780,523 | u269476572 | cpp |
p02973 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), l(n);
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
a[i] = -tmp;
}
l[0] = a[0];
int length = 1;
for (int i = 1; i < n; ++i) {
if (l[length - 1] <= a[i])
l[length++] = a[i];
else
*lower_bound(l.begin(), l.begin() + length, a[i]) = a[i];
}
cout << length << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), l(n);
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
a[i] = -tmp;
}
l[0] = a[0];
int length = 1;
for (int i = 1; i < n; ++i) {
if (l[length - 1] <= a[i])
l[length++] = a[i];
else
*upper_bound(l.begin(), l.begin() + length, a[i]) = a[i];
}
cout << length << endl;
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,526 | 780,527 | u848359007 | cpp |
p02973 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), l(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
l[0] = a[0];
int length = 1;
for (int i = 1; i < n; ++i) {
if (l[length - 1] >= a[i])
l[length++] = a[i];
else
*lower_bound(l.begin(), l.begin() + length, a[i], greater<int>()) = a[i];
}
cout << length << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), l(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
l[0] = a[0];
int length = 1;
for (int i = 1; i < n; ++i) {
if (l[length - 1] >= a[i])
l[length++] = a[i];
else
*lower_bound(l.begin(), l.begin() + length, a[i], greater_equal<int>()) =
a[i];
}
cout << length << endl;
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change"
] | 780,528 | 780,529 | u848359007 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
ll lis(vector<ll> a) {
int n = a.size();
const ll INF = 1e10;
vector<ll> d((n + 1), INF);
d[0] = -1 * INF;
for (int i = 0; i < n; i++) {
ll j = upper_bound(d.begin(), d.end(), a[i]) - d.begin();
if (d[j - 1] < a[i] && a[i] < d[j])
d[j] = a[i];
}
ll ans = 0;
for (int i = 0; i <= n; i++) {
if (d[i] < INF)
ans = i;
}
return ans;
}
int main() {
int n;
cin >> n;
vector<ll> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
v[i] *= -1;
}
cout << lis(v) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
ll lis(vector<ll> a) {
int n = a.size();
const ll INF = 1e10;
vector<ll> d((n + 1), INF);
d[0] = -1 * INF;
for (int i = 0; i < n; i++) {
ll j = upper_bound(d.begin(), d.end(), a[i]) - d.begin();
if (d[j - 1] <= a[i] && a[i] <= d[j])
d[j] = a[i];
}
ll ans = 0;
for (int i = 0; i <= n; i++) {
if (d[i] < INF)
ans = i;
}
return ans;
}
int main() {
int n;
cin >> n;
vector<ll> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
v[i] *= -1;
}
cout << lis(v) << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,530 | 780,531 | u673058289 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
// const value
// const ll MOD = 1e9 + 7;
// const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
// const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
inline ll toLL(string s) {
ll v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
const ll INF = 1e15;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
VLL a(n);
rep(i, n) cin >> a[i];
deque<ll> maxArray;
maxArray.push_back(a[0]);
FOR(i, 1, n) {
if (*lower_bound(all(maxArray), a[i]) == maxArray.front()) {
maxArray.push_front(a[i]);
// cout << "hi"<< a[i] << endl;
} else {
*(upper_bound(all(maxArray), a[i]) - 1) = a[i];
// cout << a[i] << endl;
}
}
cout << maxArray.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
// const value
// const ll MOD = 1e9 + 7;
// const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
// const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
inline ll toLL(string s) {
ll v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
const ll INF = 1e15;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
VLL a(n);
rep(i, n) cin >> a[i];
deque<ll> maxArray;
maxArray.push_back(a[0]);
FOR(i, 1, n) {
if (lower_bound(all(maxArray), a[i]) == maxArray.begin()) {
maxArray.push_front(a[i]);
// cout << "hi"<< a[i] << endl;
} else {
*(lower_bound(all(maxArray), a[i]) - 1) = a[i];
// cout << a[i] << endl;
}
}
cout << maxArray.size() << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"call.function.change",
"assignment.variable.change",
"identifier.change",
"expression.operation.binary.change"
] | 780,538 | 780,539 | u336011173 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
// const value
// const ll MOD = 1e9 + 7;
// const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
// const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
inline ll toLL(string s) {
ll v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
const ll INF = 1e15;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
VLL a(n);
rep(i, n) cin >> a[i];
deque<ll> maxArray;
maxArray.push_back(a[0]);
FOR(i, 1, n) {
if (*lower_bound(all(maxArray), a[i]) == maxArray.front()) {
maxArray.push_front(a[i]);
// cout << "hi"<< a[i] << endl;
} else {
*(lower_bound(all(maxArray), a[i]) - 1) = a[i];
// cout << a[i] << endl;
}
}
cout << maxArray.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
// const value
// const ll MOD = 1e9 + 7;
// const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
// const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
inline ll toLL(string s) {
ll v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
const ll INF = 1e15;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
VLL a(n);
rep(i, n) cin >> a[i];
deque<ll> maxArray;
maxArray.push_back(a[0]);
FOR(i, 1, n) {
if (lower_bound(all(maxArray), a[i]) == maxArray.begin()) {
maxArray.push_front(a[i]);
// cout << "hi"<< a[i] << endl;
} else {
*(lower_bound(all(maxArray), a[i]) - 1) = a[i];
// cout << a[i] << endl;
}
}
cout << maxArray.size() << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"call.function.change"
] | 780,540 | 780,539 | u336011173 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = lower_bound(L.begin(), L.begin() + length, A[i]);
// L[L.end() - iter] = A[i];
L[iter - L.begin()] = A[i];
}
}
return length;
}
int main() {
cin >> N;
A.resize(N);
L.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] = -A[i];
}
cout << solve() << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
// 広義単調減少部分列の長さ
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = upper_bound(L.begin(), L.begin() + length, A[i]);
L[iter - L.begin()] = A[i];
}
}
return length;
}
int main() {
cin >> N;
A.resize(N);
L.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] = -A[i];
}
cout << solve() << "\n";
return 0;
} | [
"identifier.change",
"call.function.change"
] | 780,543 | 780,544 | u634209474 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = lower_bound(L.begin(), L.begin() + length, A[i]);
// L[L.end() - iter] = A[i];
L[iter - L.begin()] = A[i];
}
}
return length;
}
int main() {
cin >> N;
A.resize(N);
L.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] = -A[i];
}
cout << solve() << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
// 広義最長減少部分列の長さ
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = upper_bound(L.begin(), L.begin() + length, A[i]);
L[iter - L.begin()] = A[i];
}
}
return length;
}
int main() {
cin >> N;
A.resize(N);
L.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] = -A[i];
}
cout << solve() << "\n";
return 0;
} | [
"identifier.change",
"call.function.change"
] | 780,543 | 780,545 | u634209474 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = lower_bound(L.begin(), L.end(), A[i]);
// L[L.end() - iter] = A[i];
L[iter - L.begin()] = A[i];
}
}
// for (int i = 0; i < length; i++) {
// cout << L[i] << " ";
// }
// cout << "\n";
return length;
}
int main() {
cin >> N;
A.resize(N);
L.resize(N, INT_MAX);
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] = -A[i];
}
cout << solve() << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = upper_bound(L.begin(), L.begin() + length, A[i]);
// L[L.end() - iter] = A[i];
L[iter - L.begin()] = A[i];
}
// for (int i = 0; i < length; i++) {
// cout << L[i] << " ";
// }
// cout << "\n";
}
return length;
}
int main() {
cin >> N;
A.resize(N);
L.resize(N, INT_MAX);
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] = -A[i];
}
cout << solve() << "\n";
return 0;
} | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 780,546 | 780,547 | u634209474 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = lower_bound(L.begin(), L.begin() + length, A[i]);
// L[L.end() - iter] = A[i];
L[iter - L.begin()] = A[i];
}
}
return length;
}
int main() {
cin >> N;
A.resize(N);
L.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] = -A[i];
}
cout << solve() << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = upper_bound(L.begin(), L.begin() + length, A[i]);
// L[L.end() - iter] = A[i];
L[iter - L.begin()] = A[i];
}
// for (int i = 0; i < length; i++) {
// cout << L[i] << " ";
// }
// cout << "\n";
}
return length;
}
int main() {
cin >> N;
A.resize(N);
L.resize(N, INT_MAX);
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] = -A[i];
}
cout << solve() << "\n";
return 0;
} | [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 780,543 | 780,547 | u634209474 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//===
int bs(Vi &vec, int x) {
int left = 0, right = static_cast<int>(vec.size());
while (right - left > 1) {
int mid = (right + left) / 2;
if (x < vec[mid]) {
right = mid;
} else {
left = mid;
}
}
return right;
}
int main() {
int N;
cin >> N;
Vi a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
int ans = 1;
Vi c_min;
c_min.push_back(a[N - 1]);
for (int i = N - 2; i >= 0; --i) {
int pos = bs(c_min, a[i]);
if (pos == ans) {
c_min.push_back(a[i]);
++ans;
} else {
c_min[pos] = a[i];
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//===
int bs(Vi &vec, int x) {
int left = -1, right = static_cast<int>(vec.size());
while (right - left > 1) {
int mid = (right + left) / 2;
if (x < vec[mid]) {
right = mid;
} else {
left = mid;
}
}
return right;
}
int main() {
int N;
cin >> N;
Vi a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
int ans = 1;
Vi c_min;
c_min.push_back(a[N - 1]);
for (int i = N - 2; i >= 0; --i) {
int pos = bs(c_min, a[i]);
if (pos == ans) {
c_min.push_back(a[i]);
++ans;
} else {
c_min[pos] = a[i];
}
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 780,548 | 780,549 | u067237725 | cpp |
p02973 | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#define rep(i, m, n) for (int i = int(m); i < int(n); i++)
#define all(c) begin(c), end(c)
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
//改造
typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
//ここから編集する
class Solve {
public:
void solve() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
multiset<int> ms;
for (int i = 0; i < N; ++i) {
auto it = ms.lower_bound(A[i]);
if (it == ms.begin()) {
ms.insert(A[i]);
} else {
it--;
ms.erase(*it);
ms.insert(A[i]);
}
}
cout << ms.size() << endl;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
Solve().solve();
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#define rep(i, m, n) for (int i = int(m); i < int(n); i++)
#define all(c) begin(c), end(c)
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
//改造
typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
//ここから編集する
class Solve {
public:
void solve() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
multiset<int> ms;
for (int i = 0; i < N; ++i) {
auto it = ms.lower_bound(A[i]);
if (it == ms.begin()) {
ms.insert(A[i]);
} else {
it--;
// cerr << "delete " << *it << endl;
ms.erase(it);
ms.insert(A[i]);
}
// cerr << "size" << ms.size() << endl;
}
cout << ms.size() << endl;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
Solve().solve();
return 0;
}
| [
"call.arguments.change"
] | 780,554 | 780,555 | u003873207 | cpp |
p02973 | #include <bits/stdc++.h>
#define INF 1000010000
#define nl '\n'
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
#define pdd pair<double, double>
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define sz(c) (c).size()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repi(i, n) for (int i = 1; i <= n; ++i)
#define repn(i, n) for (int i = n - 1; i >= 0; --i)
#define repf(j, i, n) for (int j = i; j < n; ++j)
#define die(s) \
{ std::cout << s << nl; }
#define dier(s) \
{ \
std::cout << s; \
return 0; \
}
#define dbg(var) \
{ std::cout << #var << " = " << var << nl; }
#define vi vector<int>
typedef long long ll;
#define MAXN 1E5 + 10
using namespace std;
int n;
vector<pii> t(2 * MAXN, {-1, INF});
auto f(const pii &a, const pii &b) {
return a.fi > b.fi || (a.fi == b.fi && a.se < b.se) ? a : b;
}
void build() {
for (int i = n - 1; i > 0; --i) {
t[i] = f(t[2 * i], t[2 * i + 1]);
}
}
void modify(int p, int val) {
for (t[p += n] = {val, p}; p > 1; p /= 2) {
t[p / 2] = f(t[p], t[p ^ 1]);
}
}
pii query(int l, int r) { //[l , r)
pii res = {-1, INF};
for (l += n, r += n; l < r; l /= 2, r /= 2) {
if (l % 2) {
res = f(res, t[l]);
++l;
}
if (r % 2) {
--r;
res = f(res, t[r]);
}
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(0);
cin >> n;
rep(i, n) {
cin >> t[n + i].fi;
t[n + i].se = i;
}
build();
int ans = 0;
while (query(0, n).fi != -1) {
int r = n;
for (;;) {
auto cur = query(0, r);
if (cur.fi == -1)
break;
modify(cur.se, -1);
r = cur.fi;
}
++ans;
}
cout << ans << nl;
return 0;
} | #include <bits/stdc++.h>
#define INF 1000010000
#define nl '\n'
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
#define pdd pair<double, double>
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define sz(c) (c).size()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repi(i, n) for (int i = 1; i <= n; ++i)
#define repn(i, n) for (int i = n - 1; i >= 0; --i)
#define repf(j, i, n) for (int j = i; j < n; ++j)
#define die(s) \
{ std::cout << s << nl; }
#define dier(s) \
{ \
std::cout << s; \
return 0; \
}
#define dbg(var) \
{ std::cout << #var << " = " << var << nl; }
#define vi vector<int>
typedef long long ll;
#define MAXN 1E5 + 10
using namespace std;
int n;
vector<pii> t(2 * MAXN, {-1, INF});
auto f(const pii &a, const pii &b) {
return a.fi > b.fi || (a.fi == b.fi && a.se < b.se) ? a : b;
}
void build() {
for (int i = n - 1; i > 0; --i) {
t[i] = f(t[2 * i], t[2 * i + 1]);
}
}
void modify(int p, int val) {
for (t[p += n] = {val, p}; p > 1; p /= 2) {
t[p / 2] = f(t[p], t[p ^ 1]);
}
}
pii query(int l, int r) { //[l , r)
pii res = {-1, INF};
for (l += n, r += n; l < r; l /= 2, r /= 2) {
if (l % 2) {
res = f(res, t[l]);
++l;
}
if (r % 2) {
--r;
res = f(res, t[r]);
}
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(0);
cin >> n;
rep(i, n) {
cin >> t[n + i].fi;
t[n + i].se = i;
}
build();
int ans = 0;
while (query(0, n).fi != -1) {
int r = n;
for (;;) {
auto cur = query(0, r);
if (cur.fi == -1)
break;
modify(cur.se, -1);
r = cur.se;
}
++ans;
}
cout << ans << nl;
return 0;
} | [
"assignment.value.change"
] | 780,556 | 780,557 | u029888376 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) {
is >> x;
}
return is;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
vi a(n);
cin >> a;
multiset<int> s;
int ans = 0;
for (int x : a) {
// for(int ss : s) {
// cout << ss << " ";
// }
// cout << endl;
auto it = s.upper_bound(-x);
if (it == s.end()) {
s.insert(-x);
ans++;
} else {
int n = *it;
int num = s.erase(*it);
REP(i, num) { s.insert(n); }
s.insert(-x);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) {
is >> x;
}
return is;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
vi a(n);
cin >> a;
multiset<int> s;
int ans = 0;
for (int x : a) {
// for(int ss : s) {
// cout << ss << " ";
// }
// cout << endl;
auto it = s.upper_bound(-x);
if (it == s.end()) {
s.insert(-x);
ans++;
} else {
int n = *it;
int num = s.erase(*it);
REP(i, num - 1) { s.insert(n); }
s.insert(-x);
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 780,560 | 780,561 | u463697306 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7;
string yn(bool f) { return f ? "Yes" : "No"; }
string YN(bool f) { return f ? "YES" : "NO"; }
#define MAX
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int ans = 1;
int N;
vector<int> l, A, B;
cin >> N;
A.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
reverse(A.begin(), A.end());
for (int i = 0; i < N; i++) {
if (l.size() == 0 || l.back() <= A[i]) {
l.push_back(A[i]);
} else {
int it = lower_bound(l.begin(), l.end(), A[i]) - l.begin();
l[it] = A[i];
}
}
cout << l.size() << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7;
string yn(bool f) { return f ? "Yes" : "No"; }
string YN(bool f) { return f ? "YES" : "NO"; }
#define MAX
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int ans = 1;
int N;
vector<int> l, A, B;
cin >> N;
A.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
reverse(A.begin(), A.end());
for (int i = 0; i < N; i++) {
if (l.size() == 0 || l.back() <= A[i]) {
l.push_back(A[i]);
} else {
int it = upper_bound(l.begin(), l.end(), A[i]) - l.begin();
l[it] = A[i];
}
}
cout << l.size() << endl;
return 0;
} | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,562 | 780,563 | u233393801 | cpp |
p02973 | #pragma region include
#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = (int)(n); i < int(m); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LLINF = 4e18;
void input() {}
template <typename... R> void input(int &f, R &...r) {
scanf("%d", &f);
input(r...);
}
template <typename... R> void input(double &f, R &...r) {
scanf("%lf", &f);
input(r...);
}
template <typename... R> void input(ll &f, R &...r) {
scanf("%lld", &f);
input(r...);
}
template <typename... R> void input(char &f, R &...r) {
scanf("%c", &f);
input(r...);
}
template <typename T, typename... R> void input(vector<T> &f, R &...r) {
REP(i, f.size()) input(f[i]);
input(r...);
}
#pragma endregion
// LIS 最長増加部分列(非減少)
int LIS(const vector<int> &A) {
vector<int> lis(A.size(), INF);
for (int i = 0; i < A.size(); i++) {
lis[upper_bound(ALL(lis), A[i]) - lis.begin()] = A[i];
}
return lower_bound(ALL(lis), INF) - lis.begin();
}
int main() {
int n;
input(n);
vector<int> a(n), b(n);
input(a);
int k = a[0];
int cnt = 0;
REP(i, n) {
if (k == a[0])
cnt++;
b[n - 1 - i] = a[i];
}
if (cnt == a.size()) {
cout << cnt << endl;
} else {
cout << LIS(b) << endl;
}
getchar();
getchar();
} | #pragma region include
#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = (int)(n); i < int(m); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LLINF = 4e18;
void input() {}
template <typename... R> void input(int &f, R &...r) {
scanf("%d", &f);
input(r...);
}
template <typename... R> void input(double &f, R &...r) {
scanf("%lf", &f);
input(r...);
}
template <typename... R> void input(ll &f, R &...r) {
scanf("%lld", &f);
input(r...);
}
template <typename... R> void input(char &f, R &...r) {
scanf("%c", &f);
input(r...);
}
template <typename T, typename... R> void input(vector<T> &f, R &...r) {
REP(i, f.size()) input(f[i]);
input(r...);
}
#pragma endregion
// LIS 最長増加部分列(非減少)
int LIS(const vector<int> &A) {
vector<int> lis(A.size(), INF);
for (int i = 0; i < A.size(); i++) {
lis[upper_bound(ALL(lis), A[i]) - lis.begin()] = A[i];
}
return lower_bound(ALL(lis), INF) - lis.begin();
}
int main() {
int n;
input(n);
vector<int> a(n), b(n);
input(a);
int k = a[0];
int cnt = 0;
REP(i, n) {
if (k == a[i])
cnt++;
b[n - 1 - i] = a[i];
}
if (cnt == n) {
cout << cnt << endl;
} else {
cout << LIS(b) << endl;
}
getchar();
getchar();
} | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.remove"
] | 780,568 | 780,569 | u165374901 | cpp |
p02973 | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1),
make_pair(0, -1)};
vector<int> init(int size) {
vector<int> par(size, -1);
return par;
}
int root(int x, vector<int> &par) {
if (par[x] < 0) {
return x;
} else {
return par[x] = root(par[x], par);
}
}
bool same(int x, int y, vector<int> &par) {
return root(x, par) == root(y, par);
}
void unite(int x, int y, vector<int> &par) {
x = root(x, par), y = root(y, par);
if (same(x, y, par))
return;
par[x] += par[y];
par[y] = x;
}
int size(int x, vector<int> &par) { return -par[root(x, par)]; }
int pow(int x, int n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return pow(x * x % MOD, n / 2);
else
return x * pow(x, n - 1) % MOD;
}
int n;
int a[210000];
signed main() {
cin >> n;
rep(i, n) {
cin >> a[i];
a[i] *= -1;
}
set<int> st;
rep(i, n) {
auto itr = st.upper_bound(a[i]);
if (itr != st.end())
st.erase(itr);
st.insert(a[i]);
}
cout << st.size() << endl;
}
| #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define int long long
#define set multiset
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1),
make_pair(0, -1)};
vector<int> init(int size) {
vector<int> par(size, -1);
return par;
}
int root(int x, vector<int> &par) {
if (par[x] < 0) {
return x;
} else {
return par[x] = root(par[x], par);
}
}
bool same(int x, int y, vector<int> &par) {
return root(x, par) == root(y, par);
}
void unite(int x, int y, vector<int> &par) {
x = root(x, par), y = root(y, par);
if (same(x, y, par))
return;
par[x] += par[y];
par[y] = x;
}
int size(int x, vector<int> &par) { return -par[root(x, par)]; }
int pow(int x, int n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return pow(x * x % MOD, n / 2);
else
return x * pow(x, n - 1) % MOD;
}
int n;
int a[210000];
signed main() {
cin >> n;
rep(i, n) {
cin >> a[i];
a[i] *= -1;
}
set<int> st;
rep(i, n) {
auto itr = st.upper_bound(a[i]);
if (itr != st.end())
st.erase(itr);
st.insert(a[i]);
}
cout << st.size() << endl;
}
| [] | 780,579 | 780,580 | u317754719 | cpp |
p02973 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repi(i, a, b) for (int i = a; i <= (b); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define mp make_pair
#define to_s to_string
#define sz(v) (int)v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define pr(x) cout << (x) << '\n'
#define debug(x) cout << #x << ": " << (x) << '\n'
#define yes "Yes"
#define no "No"
using namespace std;
using ll = long long;
using Edge = pair<int, long long>;
using Graph = vector<vector<Edge>>;
typedef pair<int, int> P;
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
int MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
ll devc(ll x, ll y) { return 1 + (x - 1) / y; }
ll LIS(vector<ll> &sequence) {
multiset<ll> s;
s.insert(sequence[0]);
for (ll i = 1; i < sequence.size(); i++) {
ll now = sequence[i];
//広義単調増加列の場合、以下を now >= *--s.end()にする
if (now >= *--s.end())
s.insert(now);
else {
auto itr = s.lower_bound(now);
s.erase(itr);
s.insert(now);
}
}
return s.size();
}
int main() {
ll N;
cin >> N;
vector<ll> A(N);
ll tp;
rep(i, N) cin >> tp, A[i] = -tp;
pr(LIS(A));
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repi(i, a, b) for (int i = a; i <= (b); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define mp make_pair
#define to_s to_string
#define sz(v) (int)v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define pr(x) cout << (x) << '\n'
#define debug(x) cout << #x << ": " << (x) << '\n'
#define yes "Yes"
#define no "No"
using namespace std;
using ll = long long;
using Edge = pair<int, long long>;
using Graph = vector<vector<Edge>>;
typedef pair<int, int> P;
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
int MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
ll devc(ll x, ll y) { return 1 + (x - 1) / y; }
ll LIS(vector<ll> &sequence) {
multiset<ll> s;
s.insert(sequence[0]);
for (ll i = 1; i < sequence.size(); i++) {
ll now = sequence[i];
//広義単調増加列の場合、以下を now >= *--s.end()にする
if (now >= *--s.end())
s.insert(now);
else {
auto itr = s.upper_bound(now);
s.erase(itr);
s.insert(now);
}
}
return s.size();
}
int main() {
ll N;
cin >> N;
vector<ll> A(N);
ll tp;
rep(i, N) cin >> tp, A[i] = -tp;
pr(LIS(A));
return 0;
} | [
"call.function.change"
] | 780,581 | 780,582 | u281168735 | cpp |
p02973 | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int INF = 99999999999999, inf = 199999;
const long long int mod = 1000000007;
long long int n, dp[200000] = {}, a[200000], mymax = 1;
string str[2000];
int main() {
int count = 0;
map<long long int, long long int> mp;
cout << fixed << setprecision(10);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[n] == a[1];
for (int i = 1; i <= n - 1; i++) {
dp[i] = -INF;
}
dp[n + 1] = INF;
for (int i = 2; i <= n; i++) {
long long int ng = n - mymax, ok = n + 1, mid;
while (ok - ng > 1) {
mid = (ok + ng) / 2;
if (dp[mid] < a[i]) {
ng = mid;
} else {
ok = mid;
}
}
if (ng == n - mymax) {
dp[n - mymax] = a[i];
mymax++;
} else {
dp[ng] = a[i];
}
}
cout << mymax;
}
| #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int INF = 99999999999999, inf = 199999;
const long long int mod = 1000000007;
long long int n, dp[200000] = {}, a[200000], mymax = 1;
string str[2000];
int main() {
int count = 0;
map<long long int, long long int> mp;
cout << fixed << setprecision(10);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[n] = a[1];
for (int i = 1; i <= n - 1; i++) {
dp[i] = INF;
}
dp[n + 1] = INF;
for (int i = 2; i <= n; i++) {
long long int ng = n - mymax, ok = n + 1, mid;
while (ok - ng > 1) {
mid = (ok + ng) / 2;
if (dp[mid] < a[i]) {
ng = mid;
} else {
ok = mid;
}
// cout<<i<<" "<<ok<<" "<<ng<<endl;;
}
if (ng == n - mymax) {
// cout<<i;
dp[n - mymax] = a[i];
mymax++;
} else {
dp[ng] = a[i];
}
}
cout << mymax;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"expression.operation.unary.arithmetic.remove"
] | 780,583 | 780,584 | u018872912 | 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>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int solve(int n, vector<ll> a) {
set<ll> s;
rep(i, n) {
auto it = s.lower_bound(a[i]);
if (it != s.begin())
s.erase(--it);
s.insert(a[i]);
}
return s.size();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
cout << solve(n, a) << endl;
return 0;
} | #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>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int solve(int n, vector<ll> a) {
multiset<ll> s;
rep(i, n) {
auto it = s.lower_bound(a[i]);
if (it != s.begin())
s.erase(--it);
s.insert(a[i]);
}
return s.size();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
cout << solve(n, a) << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 780,589 | 780,590 | u766280310 | cpp |
p02973 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
const int inf = 1001001001;
int main() {
int n;
cin >> n;
vint a(n);
rep(i, n) cin >> a[i];
deque<int> d;
rep(i, n) {
int p = lower_bound(d.begin(), d.end(), a[i]) - d.begin();
if (p == 0)
d.push_front(a[i]);
else
d[p] = a[i];
}
cout << d.size() << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
const int inf = 1001001001;
int main() {
int n;
cin >> n;
vint a(n);
rep(i, n) cin >> a[i];
deque<int> d;
rep(i, n) {
int p = lower_bound(d.begin(), d.end(), a[i]) - d.begin();
if (p == 0)
d.push_front(a[i]);
else
d[p - 1] = a[i];
}
cout << d.size() << endl;
} | [
"assignment.change"
] | 780,591 | 780,592 | u697968316 | cpp |
p02973 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define all(x) (x).begin(), (x).end()
#define P pair<int, int>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
rep(i, n) {
int num;
cin >> num;
if (a.empty()) {
a.push_back(num);
continue;
}
if (num <= a[a.size() - 1]) {
a.push_back(num);
continue;
}
int l = 0;
int r = a.size() - 1;
while (r != l) {
int next = (r + l) / 2;
if (a[next] <= num)
r = next;
else
l = next + 1;
}
a[r] = num;
}
cout << a.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define all(x) (x).begin(), (x).end()
#define P pair<int, int>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
rep(i, n) {
int num;
cin >> num;
if (a.empty()) {
a.push_back(num);
continue;
}
if (num <= a[a.size() - 1]) {
a.push_back(num);
continue;
}
int l = 0;
int r = a.size() - 1;
while (r != l) {
int next = (r + l) / 2;
if (a[next] < num)
r = next;
else
l = next + 1;
}
a[r] = num;
}
cout << a.size() << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,595 | 780,596 | u437779154 | cpp |
p02973 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
sort(begin(v), end(v), f);
v.resize(unique(begin(v), end(v)) - begin(v));
}
VI a, v;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
a.resize(n);
REP(i, n) cin >> a[i];
reverse(ALL(a));
// lis
REP(i, n) {
if (v.size() == 0)
v.push_back(a[i]);
else {
if (v.back() <= a[i])
v.push_back(a[i]);
else {
*lower_bound(ALL(v), a[i]) = a[i];
}
}
}
cout << v.size() << '\n';
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
sort(begin(v), end(v), f);
v.resize(unique(begin(v), end(v)) - begin(v));
}
VI a, v;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
a.resize(n);
REP(i, n) cin >> a[i];
reverse(ALL(a));
// lis
REP(i, n) {
if (v.size() == 0)
v.push_back(a[i]);
else {
if (v.back() <= a[i])
v.push_back(a[i]);
else {
*upper_bound(ALL(v), a[i]) = a[i];
}
}
}
cout << v.size() << '\n';
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,601 | 780,602 | u385825353 | cpp |
p02973 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
sort(begin(v), end(v), f);
v.resize(unique(begin(v), end(v)) - begin(v));
}
VI a, v;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
a.resize(n);
REP(i, n) cin >> a[i];
reverse(ALL(a));
// lis
REP(i, n) {
if (v.size() == 0)
v.push_back(a[i]);
else {
if (v.back() >= a[i])
v.push_back(a[i]);
else {
*lower_bound(ALL(v), a[i]) = a[i];
}
}
}
cout << v.size() << '\n';
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
sort(begin(v), end(v), f);
v.resize(unique(begin(v), end(v)) - begin(v));
}
VI a, v;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
a.resize(n);
REP(i, n) cin >> a[i];
reverse(ALL(a));
// lis
REP(i, n) {
if (v.size() == 0)
v.push_back(a[i]);
else {
if (v.back() <= a[i])
v.push_back(a[i]);
else {
*upper_bound(ALL(v), a[i]) = a[i];
}
}
}
cout << v.size() << '\n';
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,603 | 780,602 | u385825353 | cpp |
p02973 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
sort(begin(v), end(v), f);
v.resize(unique(begin(v), end(v)) - begin(v));
}
VI a, v;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
a.resize(n);
REP(i, n) cin >> a[i];
reverse(ALL(a));
// lis
REP(i, n) {
if (v.size() == 0)
v.push_back(a[i]);
else {
if (v.back() <= a[i])
v.push_back(a[i]);
else {
*lower_bound(ALL(a), a[i]) = a[i];
}
}
}
cout << v.size() << '\n';
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
sort(begin(v), end(v), f);
v.resize(unique(begin(v), end(v)) - begin(v));
}
VI a, v;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
a.resize(n);
REP(i, n) cin >> a[i];
reverse(ALL(a));
// lis
REP(i, n) {
if (v.size() == 0)
v.push_back(a[i]);
else {
if (v.back() <= a[i])
v.push_back(a[i]);
else {
*upper_bound(ALL(v), a[i]) = a[i];
}
}
}
cout << v.size() << '\n';
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 780,604 | 780,602 | u385825353 | cpp |
p02973 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
template <class T> T gcd(T a, T b) { return ((b == 0) ? a : gcd(b, a % b)); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// freopen("input.in", "r", stdin);
// freopen("output.out", "w", stdout);
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
multiset<int> pos;
pos.insert(a[0]);
repn(i, 1, n) {
if (*pos.begin() >= a[i])
pos.insert(a[i]);
else {
auto ps = pos.ub(a[i] - 1);
ps--;
int cur = a[i];
pos.erase(*ps);
pos.insert(cur);
}
}
cout << pos.size() << endl;
return 0;
}
/*
Things to look out for:
- Integer overflows
- Array bounds
- Special cases
Be careful!
*/
| #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
template <class T> T gcd(T a, T b) { return ((b == 0) ? a : gcd(b, a % b)); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// freopen("input.in", "r", stdin);
// freopen("output.out", "w", stdout);
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
multiset<int> pos;
pos.insert(a[0]);
repn(i, 1, n) {
if (*pos.begin() >= a[i])
pos.insert(a[i]);
else {
auto ps = pos.ub(a[i] - 1);
ps--;
int cur = a[i];
pos.erase(pos.find(*ps));
pos.insert(cur);
}
}
cout << pos.size() << endl;
return 0;
}
/*
Things to look out for:
- Integer overflows
- Array bounds
- Special cases
Be careful!
*/
| [
"call.add",
"call.arguments.change"
] | 780,609 | 780,610 | u626595726 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int main() {
int n;
cin >> n;
int ans = 1;
vector<int> b;
int f;
cin >> f;
b.push_back(f);
rep(i, 1, n - 1) {
int a;
cin >> a;
if (b[0] >= a)
b.insert(b.begin(), a);
else {
int pos = upper_bound(all(b), a) - b.begin();
b[pos - 1] = a;
}
}
cout << b.size() << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int main() {
int n;
cin >> n;
int ans = 1;
vector<int> b;
int f;
cin >> f;
b.push_back(f);
rep(i, 1, n - 1) {
int a;
cin >> a;
if (b[0] >= a)
b.insert(b.begin(), a);
else {
int pos = upper_bound(all(b), a - 1) - b.begin();
b[pos - 1] = a;
}
}
cout << b.size() << endl;
} | [
"assignment.change"
] | 780,611 | 780,612 | u521389909 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A(100001);
void solve() {
map<int, int> mp;
int ans = 1;
mp[A[1]] = 1;
for (int i = 2; i <= N; ++i) {
if (A[i] > mp.begin()->first) {
auto itr = mp.lower_bound(A[i]);
itr--;
itr->second--;
if (itr->second <= 0)
mp.erase(itr);
} else
ans++;
mp[A[i]] = 1;
}
cout << ans;
}
int main() {
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> A[i];
}
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A(100001);
void solve() {
map<int, int> mp;
int ans = 1;
mp[A[1]] = 1;
for (int i = 2; i <= N; ++i) {
if (A[i] > mp.begin()->first) {
auto itr = mp.lower_bound(A[i]);
itr--;
itr->second--;
if (itr->second <= 0)
mp.erase(itr);
} else
ans++;
mp[A[i]] += 1;
}
cout << ans;
}
int main() {
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> A[i];
}
solve();
return 0;
} | [
"assignment.value.change"
] | 780,613 | 780,614 | u269291896 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define pb push_back
#define sz(x) (int)(x).size()
#define PQ(T) priority_queue<T, v(T), greater<T>>
using namespace std;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using P = pair<int, int>;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
deque<ll> deq;
deq.push_front(a[0]);
for (int i = 1; i < n; ++i) {
if (a[i] <= deq.front())
deq.push_front(a[i]);
else {
auto iter = lower_bound(all(deq), a[i] - 1);
*iter = a[i];
}
}
cout << deq.size() << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define pb push_back
#define sz(x) (int)(x).size()
#define PQ(T) priority_queue<T, v(T), greater<T>>
using namespace std;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using P = pair<int, int>;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
deque<ll> deq;
deq.push_front(a[0]);
for (int i = 1; i < n; ++i) {
if (a[i] <= deq.front())
deq.push_front(a[i]);
else {
auto iter = lower_bound(all(deq), a[i]);
--iter;
*iter = a[i];
}
}
cout << deq.size() << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"expression.unary.arithmetic.add"
] | 780,617 | 780,618 | u655777757 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> v;
int ans = 200000;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
auto j = upper_bound(v.begin(), v.end(), a, greater<int>());
if (j == v.end())
v.push_back(a);
else
v[j - v.begin() - 1] = a;
}
cout << v.size();
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> v;
int ans = 200000;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
auto j = upper_bound(v.begin(), v.end(), a, greater<int>());
if (j == v.end())
v.push_back(a);
else
v[j - v.begin()] = a;
}
cout << v.size();
}
| [
"expression.operation.binary.remove"
] | 780,619 | 780,620 | u724012411 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T> void printlnVector(T v) {
rep(i, v.size()) { cout << v[i] << endl; }
}
template <typename T> void printVector(T v) {
rep(i, v.size()) { cout << v[i] << " "; }
cout << endl;
}
int main() {
int N;
cin >> N;
multiset<int> ans;
rep(i, N) {
int A;
cin >> A;
if (i == 0)
ans.insert(A);
else if (*ans.begin() >= A)
ans.insert(A);
else {
auto it = ans.lower_bound(A);
it--;
ans.erase(*it);
ans.insert(A);
}
}
cout << ans.size() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T> void printlnVector(T v) {
rep(i, v.size()) { cout << v[i] << endl; }
}
template <typename T> void printVector(T v) {
rep(i, v.size()) { cout << v[i] << " "; }
cout << endl;
}
int main() {
int N;
cin >> N;
multiset<int> ans;
rep(i, N) {
int A;
cin >> A;
if (i == 0)
ans.insert(A);
else if (*ans.begin() >= A)
ans.insert(A);
else {
auto it = ans.lower_bound(A);
it--;
ans.erase(it);
ans.insert(A);
}
}
cout << ans.size() << endl;
return 0;
} | [
"call.arguments.change"
] | 780,621 | 780,622 | u063131621 | cpp |
p02973 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
int n, a;
cin >> n;
multiset<int> t;
cin >> a;
t.insert(a);
for (int i = 1; i < n; i++) {
cin >> a;
if (*t.begin() >= a) {
t.insert(a);
} else {
auto e = t.lower_bound(a);
e--;
t.erase(*e);
t.insert(a);
}
}
cout << t.size() << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
int n, a;
cin >> n;
multiset<int> t;
cin >> a;
t.insert(a);
for (int i = 1; i < n; i++) {
cin >> a;
if (*t.begin() >= a) {
t.insert(a);
} else {
auto e = t.lower_bound(a);
e--;
t.erase(e);
t.insert(a);
}
}
cout << t.size() << endl;
} | [
"call.arguments.change"
] | 780,628 | 780,629 | u880221923 | cpp |
p02973 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
vector<int> as;
int solve(const int N) {
// {value, count}
multiset<pair<int, int>> ms;
for (auto &a : as) {
auto it = ms.upper_bound({a, 0});
pair<int, int> item;
if (it == ms.begin()) {
item = {a, 1};
ms.insert(item);
// } else if (it == ms.end()) {
// item = {a, 1};
// ms.insert(item);
} else {
it--;
item = *it;
ms.erase(*it);
item.first = a;
item.second++;
ms.insert(item);
}
// printf("added: {%d, %d}\n", item.first, item.second);
}
return (int)ms.size();
}
int main(void) {
int N;
cin >> N;
as.resize(N);
for (int i = 0; i < N; i++) {
cin >> as[i];
}
cout << solve(N) << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
vector<int> as;
int solve(const int N) {
// {value, count}
multiset<pair<int, int>> ms;
for (auto &a : as) {
auto it = ms.upper_bound({a, 0});
pair<int, int> item;
if (it == ms.begin()) {
item = {a, 1};
ms.insert(item);
// } else if (it == ms.end()) {
// item = {a, 1};
// ms.insert(item);
} else {
it--;
item = *it;
ms.erase(it);
item.first = a;
item.second++;
ms.insert(item);
}
// printf("added: {%d, %d}\n", item.first, item.second);
}
return (int)ms.size();
}
int main(void) {
int N;
cin >> N;
as.resize(N);
for (int i = 0; i < N; i++) {
cin >> as[i];
}
cout << solve(N) << endl;
return 0;
}
| [
"call.arguments.change"
] | 780,630 | 780,631 | u644332191 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
#define mod 1e9 + 7
vector<int> A, color(1, 0);
int binary(int key) {
int left = -1;
int right = (int)color.size();
while (right - left > 1) {
int mid = left + (right - left) / 2;
if (A[mid] < key) {
right = mid;
} else {
left = mid;
}
}
return right;
}
int main() {
int N;
cin >> N;
A.resize(N);
REP(i, N) { cin >> A[i]; }
color[0] = A[0];
FOR(i, 1, N) {
auto it = lower_bound(color.begin(), color.end(), A[i]);
if (it == color.end()) {
color[0] = A[i];
} else if (it == color.begin()) {
color.insert(color.begin(), (A[i]));
} else {
it--;
*it = A[i];
}
}
cout << color.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
#define mod 1e9 + 7
vector<int> A, color(1, 0);
int binary(int key) {
int left = -1;
int right = (int)color.size();
while (right - left > 1) {
int mid = left + (right - left) / 2;
if (A[mid] < key) {
right = mid;
} else {
left = mid;
}
}
return right;
}
int main() {
int N;
cin >> N;
A.resize(N);
REP(i, N) { cin >> A[i]; }
color[0] = A[0];
FOR(i, 1, N) {
auto it = lower_bound(color.begin(), color.end(), A[i]);
if (it == color.end()) {
color.back() = A[i];
} else if (it == color.begin()) {
color.insert(color.begin(), (A[i]));
} else {
it--;
*it = A[i];
}
}
cout << color.size() << endl;
return 0;
}
| [
"call.arguments.change"
] | 780,636 | 780,637 | u174434198 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
const int INF = 1 << 30;
const ll INFll = 1ll << 62;
const ld EPS = 1e-10;
const int MOD = int(1e9) + 7;
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> vector<int> compress(vector<T> &v) {
vector<T> t = v;
sort(t.begin(), t.end());
t.erase(unique(t.begin(), t.end()), t.end());
vector<int> r(v.size());
for (int i = 0; i < v.size(); i++) {
r[i] = lower_bound(t.begin(), t.end(), v[i]) - t.begin();
}
return r;
}
int main() {
int n;
cin >> n;
V a(n);
rep(i, n) cin >> a[i];
V b = compress(a);
deque<int> dq;
rep(i, n) {
int j = lower_bound(ALL(dq), b[i]) - dq.begin();
if (j == 0) {
dq.push_front(b[i]);
} else {
dq[j] = b[i];
}
}
cout << dq.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
const int INF = 1 << 30;
const ll INFll = 1ll << 62;
const ld EPS = 1e-10;
const int MOD = int(1e9) + 7;
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> vector<int> compress(vector<T> &v) {
vector<T> t = v;
sort(t.begin(), t.end());
t.erase(unique(t.begin(), t.end()), t.end());
vector<int> r(v.size());
for (int i = 0; i < v.size(); i++) {
r[i] = lower_bound(t.begin(), t.end(), v[i]) - t.begin();
}
return r;
}
int main() {
int n;
cin >> n;
V a(n);
rep(i, n) cin >> a[i];
V b = compress(a);
deque<int> dq;
rep(i, n) {
int j = lower_bound(ALL(dq), b[i]) - dq.begin();
if (j == 0) {
dq.push_front(b[i]);
} else {
dq[j - 1] = b[i];
}
}
cout << dq.size() << endl;
return 0;
}
| [
"assignment.change"
] | 780,638 | 780,639 | u366381207 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define revrepeat(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define revrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define CYES cout << "Yes" << endl
#define CNO cout << "No" << endl
#define SPC(x) cout << fixed << setprecision(x)
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<ll> vl;
typedef vector<vector<ll>> vll;
typedef pair<int, int> P;
typedef complex<ld> Point;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int MAX_V = 1e5 + 5;
const int MAX_N = 1e5 + 5;
const double PI = acos(-1);
// LIS(longest increasing subsequence)
// http://even-eko.hatenablog.com/entry/2013/09/05/215236
int dp[100005];
int lis(vector<ll> &a) {
int n = a.size();
fill(dp, dp + n, INF);
for (int i = 0; i < n; ++i) {
*lower_bound(dp, dp + n, a[i]) = a[i];
}
return lower_bound(dp, dp + n, INF) - dp;
}
int main() {
int n;
cin >> n;
vl a(n);
rep(i, n) cin >> a[i];
reverse(all(a));
int ans = lis(a);
out(ans);
}
| #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define revrepeat(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define revrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define CYES cout << "Yes" << endl
#define CNO cout << "No" << endl
#define SPC(x) cout << fixed << setprecision(x)
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<ll> vl;
typedef vector<vector<ll>> vll;
typedef pair<int, int> P;
typedef complex<ld> Point;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAX_V = 1e5 + 5;
const int MAX_N = 1e5 + 5;
const double PI = acos(-1);
// LIS(longest increasing subsequence)
// http://even-eko.hatenablog.com/entry/2013/09/05/215236
int dp[100005];
int lis(vector<ll> &a) {
int n = a.size();
fill(dp, dp + n, INF);
for (int i = 0; i < n; ++i) {
*upper_bound(dp, dp + n, a[i]) = a[i];
}
return lower_bound(dp, dp + n, INF) - dp;
}
int main() {
int n;
cin >> n;
vl a(n);
rep(i, n) cin >> a[i];
reverse(all(a));
int ans = lis(a);
out(ans);
}
| [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,659 | 780,658 | u765690804 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-8;
template <typename T> T chmax(T &a, const T &b) { return a = (a > b ? a : b); }
template <typename T> T chmin(T &a, const T &b) { return a = (a < b ? a : b); }
int main() {
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
set<int> st;
int ans = 0;
rep(i, n) {
auto it = st.lower_bound(a[i]);
if (it == st.begin())
++ans;
else {
--it;
st.erase(it);
}
st.insert(a[i]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-8;
template <typename T> T chmax(T &a, const T &b) { return a = (a > b ? a : b); }
template <typename T> T chmin(T &a, const T &b) { return a = (a < b ? a : b); }
int main() {
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
multiset<int> st;
int ans = 0;
rep(i, n) {
auto it = st.lower_bound(a[i]);
if (it == st.begin())
++ans;
else {
--it;
st.erase(it);
}
st.insert(a[i]);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 780,660 | 780,661 | u912359563 | cpp |
p02973 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define mod 1000000007
int N;
int A[100005];
//最長部分広義減少列を求めます
//はめんどくさいので、Aの中身の符号を逆にして最長部分広義増加列を求めます
int LIS(int *A, const int A_len) {
int dp[A_len + 5];
rep(i, A_len + 3) dp[i] = LLINF;
dp[0] = -A[0];
// dpは広義単調増加
for (int i = 1; i < A_len; i++) {
//二分探索で更新箇所を求める
//(更新場所は、追加した文字より大きいのところで一番小さいの)
int p = upper_bound(dp, dp + A_len, -A[i]) - dp;
//大きいところがあればそこを更新する
if (p > 0)
dp[p] = -A[p];
else if (dp[0] > -A[0])
dp[0] = -A[0];
}
//一番最後の更新されたところを探す
// rep(i,A_len)printf("%lld/",dp[i]);
int p = lower_bound(dp, dp + A_len, LLINF) - dp;
return p;
}
signed main() {
scanf("%lld", &N);
rep(i, N) scanf("%lld\n", &A[i]);
int ans = LIS(A, N);
printf("%lld\n", ans);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define mod 1000000007
int N;
int A[100005];
//最長部分広義減少列を求めます
//はめんどくさいので、Aの中身の符号を逆にして最長部分広義増加列を求めます
int LIS(int *A, const int A_len) {
int dp[A_len + 5];
rep(i, A_len + 3) dp[i] = LLINF;
dp[0] = -A[0];
// dpは広義単調増加、出来るだけ小さく更新したい
for (int i = 1; i < A_len; i++) {
//二分探索で更新箇所を求める
//追加した文字がdp[i]以上ならばもっと伸ばせる
//(更新場所は、追加した文字より大きいところで一番小さいの)
int p = upper_bound(dp, dp + A_len, -A[i]) - dp;
//大きいところがあればそこを更新する
if (p > 0)
dp[p] = -A[i];
else if (dp[p] > -A[i])
dp[p] = -A[i];
}
//一番最後の更新されたところを探す
// rep(i,A_len)printf("%lld/",dp[i]);
int p = lower_bound(dp, dp + A_len, LLINF) - dp;
return p;
}
signed main() {
scanf("%lld", &N);
rep(i, N) scanf("%lld\n", &A[i]);
int ans = LIS(A, N);
printf("%lld\n", ans);
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 780,670 | 780,671 | u857644621 | cpp |
p02973 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 101010;
static const ll MOD = 1e9 + 7;
int main(void) {
ll N;
cin >> N;
ll a[MAX];
ll i;
for (i = 0; i < N; i++) {
cin >> a[i];
}
deque<ll> q;
q.push_front(INF);
for (i = 0; i < N; i++) {
if (a[i] <= q[0]) {
q.push_front(a[i]);
} else {
*lower_bound(q.begin(), q.end(), a[i]) = a[i];
}
}
pt(q.size() - 1);
}
| #include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 101010;
static const ll MOD = 1e9 + 7;
int main(void) {
ll N;
cin >> N;
ll a[MAX];
ll i;
for (i = 0; i < N; i++) {
cin >> a[i];
}
deque<ll> q;
q.push_front(INF);
for (i = 0; i < N; i++) {
if (a[i] <= q[0]) {
q.push_front(a[i]);
} else {
*(lower_bound(q.begin(), q.end(), a[i]) - 1) = a[i];
}
}
pt(q.size() - 1);
}
| [] | 780,672 | 780,673 | u768152935 | cpp |
p02973 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 101010;
static const ll MOD = 1e9 + 7;
int main(void) {
ll N;
cin >> N;
ll a[MAX];
ll i;
for (i = 0; i < N; i++) {
cin >> a[i];
}
deque<ll> q;
q.push_front(INF);
for (i = 0; i < N; i++) {
if (a[i] <= q[0]) {
q.push_front(a[i]);
} else {
ll itr = lower_bound(q.begin(), q.end(), a[i]) - q.begin();
q[itr] = a[i];
}
}
pt(q.size() - 1);
}
| #include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 101010;
static const ll MOD = 1e9 + 7;
int main(void) {
ll N;
cin >> N;
ll a[MAX];
ll i;
for (i = 0; i < N; i++) {
cin >> a[i];
}
deque<ll> q;
q.push_front(INF);
for (i = 0; i < N; i++) {
if (a[i] <= q[0]) {
q.push_front(a[i]);
} else {
ll itr = lower_bound(q.begin(), q.end(), a[i]) - q.begin() - 1;
q[itr] = a[i];
}
}
pt(q.size() - 1);
}
| [
"assignment.change"
] | 780,674 | 780,675 | u768152935 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const double PI = 3.14159265358979323846;
const int waru = 1000000007;
const int INF = 2000000000;
#define vec2(a, y, x) vector<vector<int>> a(y, vector<int>(x, INF))
#define vec1(a, n) \
vector<int> a(n); \
rep(i, n) cin >> a[i]
int main() {
int n;
cin >> n;
vec1(a, n);
reverse(all(a));
vector<int> dp(n, INF); // dp[i]:=i+1文字の部分列の最後の文字の最小値
rep(i, n) * lower_bound(all(dp), a[i]) = a[i];
cout << lower_bound(all(dp), INF) - dp.begin() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const double PI = 3.14159265358979323846;
const int waru = 1000000007;
const int INF = 2000000000;
#define vec2(a, y, x) vector<vector<int>> a(y, vector<int>(x, INF))
#define vec1(a, n) \
vector<int> a(n); \
rep(i, n) cin >> a[i]
int main() {
int n;
cin >> n;
vec1(a, n);
reverse(all(a));
vector<int> dp(n, INF); // dp[i]:=i+1文字の部分列の最後の文字の最小値
rep(i, n) * upper_bound(all(dp), a[i]) = a[i];
cout << lower_bound(all(dp), INF) - dp.begin() << endl;
} | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,676 | 780,677 | u424602097 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
int a;
multiset<int> s;
int cnt = 1;
int temp = INF;
cin >> a;
s.insert(a);
for (int i = 1; i < N; i++) {
cin >> a;
// cout << *(s.begin()) << endl;
if (a <= *(s.begin())) {
s.insert(a);
cnt++;
} else {
s.erase((--s.upper_bound(a)));
s.insert(a);
}
// for(auto ite = s.begin(); ite != s.end(); ite++) {
// cout << *ite << ' ';
// }
// cout << endl;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
int a;
multiset<int> s;
int cnt = 1;
int temp = INF;
cin >> a;
s.insert(a);
for (int i = 1; i < N; i++) {
cin >> a;
// cout << *(s.begin()) << endl;
if (a <= *(s.begin())) {
s.insert(a);
cnt++;
} else {
// cout << *(--s.upper_bound(a)) << endl;
s.erase(--s.lower_bound(a));
// for(auto ite = s.begin(); ite != s.end(); ite++) {
// cout << *ite << ' ';
// }
// cout << endl;
s.insert(a);
}
// for(auto ite = s.begin(); ite != s.end(); ite++) {
// cout << *ite << ' ';
// }
// cout << endl;
}
cout << cnt << endl;
}
| [
"call.arguments.change",
"call.function.change"
] | 780,678 | 780,679 | u035009844 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
int a;
multiset<int> s;
ll cnt = 1;
int temp = INF;
cin >> a;
s.insert(a);
for (int i = 1; i < N; i++) {
cin >> a;
// cout << *(s.begin()) << endl;
if (a <= *(s.begin())) {
s.insert(a);
cnt++;
} else {
s.erase(*(--s.upper_bound(a)));
s.insert(a);
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
int a;
multiset<int> s;
int cnt = 1;
int temp = INF;
cin >> a;
s.insert(a);
for (int i = 1; i < N; i++) {
cin >> a;
// cout << *(s.begin()) << endl;
if (a <= *(s.begin())) {
s.insert(a);
cnt++;
} else {
// cout << *(--s.upper_bound(a)) << endl;
s.erase(--s.lower_bound(a));
// for(auto ite = s.begin(); ite != s.end(); ite++) {
// cout << *ite << ' ';
// }
// cout << endl;
s.insert(a);
}
// for(auto ite = s.begin(); ite != s.end(); ite++) {
// cout << *ite << ' ';
// }
// cout << endl;
}
cout << cnt << endl;
}
| [
"variable_declaration.type.change",
"call.function.change",
"call.arguments.change"
] | 780,680 | 780,679 | u035009844 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
int a;
multiset<int> s;
int cnt = 1;
int temp = INF;
cin >> a;
s.insert(a);
for (int i = 1; i < N; i++) {
cin >> a;
// cout << *(s.begin()) << endl;
if (a <= *(s.begin())) {
s.insert(a);
cnt++;
} else {
s.erase(*(--s.upper_bound(a)));
s.insert(a);
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
int a;
multiset<int> s;
int cnt = 1;
int temp = INF;
cin >> a;
s.insert(a);
for (int i = 1; i < N; i++) {
cin >> a;
// cout << *(s.begin()) << endl;
if (a <= *(s.begin())) {
s.insert(a);
cnt++;
} else {
// cout << *(--s.upper_bound(a)) << endl;
s.erase(--s.lower_bound(a));
// for(auto ite = s.begin(); ite != s.end(); ite++) {
// cout << *ite << ' ';
// }
// cout << endl;
s.insert(a);
}
// for(auto ite = s.begin(); ite != s.end(); ite++) {
// cout << *ite << ' ';
// }
// cout << endl;
}
cout << cnt << endl;
}
| [
"call.function.change",
"call.arguments.change"
] | 780,681 | 780,679 | u035009844 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long long
#define all(v) v.begin(), v.end()
#define sortAl(v) sort(all(v))
#define sortAlr(v) \
sort(v.begin(), v.end()); \
reverse(v.begin(), v.end())
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
template <class T> inline void chmax(T &a, T b) { a = std::max(a, b); }
template <class T> inline void chmin(T &a, T b) { a = std::min(a, b); }
#define mod (ll)(1e9 + 7)
#define INF LLONG_MAX
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vll a(n);
rep(i, n) {
cin >> a[i];
a[i] = mod - a[i];
}
vll v;
v.reserve(n);
v.push_back(a[n - 1]);
REP(i, n) {
auto itr = upper_bound(all(v), a[i]);
if (itr == v.end()) {
v.push_back(a[i]);
} else {
*itr = a[i];
// sort(v.begin(), itr + 1);
}
}
cout << v.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long long
#define all(v) v.begin(), v.end()
#define sortAl(v) sort(all(v))
#define sortAlr(v) \
sort(v.begin(), v.end()); \
reverse(v.begin(), v.end())
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
template <class T> inline void chmax(T &a, T b) { a = std::max(a, b); }
template <class T> inline void chmin(T &a, T b) { a = std::min(a, b); }
#define mod (ll)(1e9 + 7)
#define INF LLONG_MAX
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vll a(n);
rep(i, n) {
cin >> a[i];
a[i] = mod - a[i];
}
vll v;
v.reserve(n);
v.push_back(a[0]);
REP(i, n) {
auto itr = upper_bound(all(v), a[i]);
if (itr == v.end()) {
v.push_back(a[i]);
} else {
*itr = a[i];
// sort(v.begin(), itr + 1);
}
}
cout << v.size() << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 780,684 | 780,685 | u324825702 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5;
int arr[N + 100];
multiset<int> st;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
}
for (int i = 1; i <= n; i++) {
auto it = st.lower_bound(arr[i]);
if (it == st.begin())
st.insert(arr[i]);
else {
it--;
st.erase(*it);
st.insert(arr[i]);
}
}
printf("%d\n", (int)st.size());
}
| #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5;
int arr[N + 100];
multiset<int> st;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
}
for (int i = 1; i <= n; i++) {
auto it = st.lower_bound(arr[i]);
if (it == st.begin())
st.insert(arr[i]);
else {
it--;
st.erase(it);
st.insert(arr[i]);
}
}
printf("%d\n", (int)st.size());
}
| [
"call.arguments.change"
] | 780,686 | 780,687 | u116018262 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int, int>
#define priq priority_queue<int>
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
#define tii tuple<int, int, int>
signed main() {
int N;
cin >> N;
deque<int> P;
P.push_back(MOD);
rep(i, 0, N) {
int A;
int K = dislow(P, A);
if (K == 0)
P.push_front(A);
else
P[K - 1] = A;
}
cout << P.size() - 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int, int>
#define priq priority_queue<int>
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
#define tii tuple<int, int, int>
signed main() {
int N;
cin >> N;
deque<int> P;
P.push_back(MOD);
rep(i, 0, N) {
int A;
cin >> A;
int K = dislow(P, A);
if (K == 0)
P.push_front(A);
else
P[K - 1] = A;
}
cout << P.size() - 1 << endl;
}
| [] | 780,690 | 780,691 | u347057617 | cpp |
p02973 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
#define rep(X, N) for (ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(), (V).end()
#define CERR \
if (false) \
cerr
#define INT_MAX_HALF (INT_MAX / 2)
typedef long long ll;
using namespace std;
// using namespace boost::multiprec
int main() {
int n;
cin >> n;
vector<int> a;
rep(i, n) {
int tmp;
cin >> tmp;
a.pback(tmp);
}
deque<int> each_color_min;
each_color_min.pback(a[0]);
for (int i = 1; i < n; i++) {
if (a[i] <= each_color_min[0]) {
each_color_min.push_front(a[i]);
} else {
auto itr = lower_bound(ALL(each_color_min), a[i] + 1);
if (itr == each_color_min.begin()) {
assert(false);
} else {
itr--;
int idx = itr - each_color_min.begin();
each_color_min[idx] = a[i];
}
}
}
cout << each_color_min.size() << endl;
return 0;
} | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
#define rep(X, N) for (ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(), (V).end()
#define CERR \
if (false) \
cerr
#define INT_MAX_HALF (INT_MAX / 2)
typedef long long ll;
using namespace std;
// using namespace boost::multiprec
int main() {
int n;
cin >> n;
vector<int> a;
rep(i, n) {
int tmp;
cin >> tmp;
a.pback(tmp);
}
deque<int> each_color_min;
each_color_min.pback(a[0]);
for (int i = 1; i < n; i++) {
if (a[i] <= each_color_min[0]) {
each_color_min.push_front(a[i]);
} else {
auto itr = lower_bound(ALL(each_color_min), a[i]);
if (itr == each_color_min.begin()) {
assert(false);
} else {
itr--;
int idx = itr - each_color_min.begin();
each_color_min[idx] = a[i];
}
}
}
cout << each_color_min.size() << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 780,692 | 780,693 | u145078501 | cpp |
p02973 | #include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
deque<int> d;
for (int i = 0; i < N; i++) {
int p = lower_bound(d.begin(), d.end(), A[i]) - d.begin();
if (p == 0) {
d.push_back(A[i]);
} else {
d[p - 1] = A[i];
}
}
cout << d.size() << endl;
return 0;
} | #include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
deque<int> d;
for (int i = 0; i < N; i++) {
int p = lower_bound(d.begin(), d.end(), A[i]) - d.begin();
if (p == 0) {
d.push_front(A[i]);
} else {
d[p - 1] = A[i];
}
}
cout << d.size() << endl;
return 0;
} | [
"call.function.change"
] | 780,696 | 780,697 | u188117876 | cpp |
p02973 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
template <typename F, typename S>
std::ostream &operator<<(ostream &os, const pair<F, S> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (const T &a : v) {
os << a << ", ";
}
os << "]";
return os;
}
template <typename K, typename V>
ostream &operator<<(ostream &os, const map<K, V> &m) {
os << "{";
for (const auto &p : m) {
os << p.first << ":" << p.second << ", ";
}
os << "}";
return os;
}
int main() {
LL n;
cin >> n;
set<LL> a;
for (LL i = 0; i < n; ++i) {
LL v;
cin >> v;
auto it = a.lower_bound(v);
if (it != a.begin() && *(--it) < v) {
a.erase(it);
}
a.insert(v);
}
cout << a.size() << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
template <typename F, typename S>
std::ostream &operator<<(ostream &os, const pair<F, S> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (const T &a : v) {
os << a << ", ";
}
os << "]";
return os;
}
template <typename K, typename V>
ostream &operator<<(ostream &os, const map<K, V> &m) {
os << "{";
for (const auto &p : m) {
os << p.first << ":" << p.second << ", ";
}
os << "}";
return os;
}
int main() {
LL n;
cin >> n;
multiset<LL> a;
for (LL i = 0; i < n; ++i) {
LL v;
cin >> v;
auto it = a.lower_bound(v);
if (it != a.begin() && *(--it) < v) {
a.erase(it);
}
a.insert(v);
// cerr << v << ", " << a.size() << endl;
}
cout << a.size() << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 780,698 | 780,699 | u176354582 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
#define bit(k) (1LL << (k))
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1e9;
const ll INFLL = 1e18;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
/*------------------------------------/
for library*/
/*------------------------------------*/
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
multiset<ll> s;
rep(i, N) {
auto itr = s.lower_bound(A[i]);
//自分以下の値がないとき
if (itr == s.begin()) {
s.insert(A[i]);
}
//あるとき
else {
itr--;
// cerr<<"erase "<<*itr<<" and add "<<A[i]<<endl;
s.erase(*itr);
s.insert(A[i]);
}
}
cout << (int)s.size() << endl;
}
/*
sの中からA[i]未満の最大値を探し、
それを除いて、A[i]を突っ込む
なかったら普通に突っ込む
2 1 4 5 3
[2]
[1,2]
[1,4]
[1,5]
[3,5]
*/ | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
#define bit(k) (1LL << (k))
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1e9;
const ll INFLL = 1e18;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
/*------------------------------------/
for library*/
/*------------------------------------*/
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
multiset<ll> s;
rep(i, N) {
auto itr = s.lower_bound(A[i]);
//自分以下の値がないとき
if (itr == s.begin()) {
s.insert(A[i]);
}
//あるとき
else {
--itr;
s.erase(itr);
s.insert(A[i]);
}
}
cout << (int)s.size() << endl;
}
/*
sの中からA[i]未満の最大値を探し、
それを除いて、A[i]を突っ込む
なかったら普通に突っ込む
2 1 4 5 3
[2]
[1,2]
[1,4]
[1,5]
[3,5]
*/ | [
"call.arguments.change"
] | 780,702 | 780,703 | u106297876 | cpp |
p02973 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define pb(n) push_back(n)
#define endl '\n'
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define VIN(V) \
for (int ii = 0; ii < (V).size(); ii++) { \
cin >> (V).at(ii); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(ii, (V).size()) { cout << (V)[ii] << " "; } \
cout << endl;
#define VOUT2(V) \
REP(jj, (V).size()) { VOUT(V[jj]) }
#define debug(x) cout << #x << " = " << (x) << endl
#define debugv(x) \
cout << #x << " = "; \
VOUT(x);
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pair<ll, ll>> vp;
typedef vector<string> vs;
typedef vector<char> vc;
typedef list<ll> lst;
typedef pair<ll, ll> P;
const long long INF = numeric_limits<ll>::max();
const long long MOD = 1000000007;
const long double PI = 3.1415926;
template <class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
ll n, m, k, ans, sum, cnt = 0;
string s;
char c;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n);
vi a(n);
VIN(a);
vi ansv;
ansv.pb(a[0]);
FOR(i, 1, n) {
ll now = a[i];
if (now <= ansv[0]) {
ansv.insert(ansv.begin(), a[i]);
} else {
ll index = upper_bound(ALL(ansv), now) - ansv.begin();
ansv[index - 1] = a[i];
}
debugv(ansv);
}
OUT(ansv.size());
}
| #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define pb(n) push_back(n)
#define endl '\n'
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define VIN(V) \
for (int ii = 0; ii < (V).size(); ii++) { \
cin >> (V).at(ii); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(ii, (V).size()) { cout << (V)[ii] << " "; } \
cout << endl;
#define VOUT2(V) \
REP(jj, (V).size()) { VOUT(V[jj]) }
#define debug(x) cout << #x << " = " << (x) << endl
#define debugv(x) \
cout << #x << " = "; \
VOUT(x);
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pair<ll, ll>> vp;
typedef vector<string> vs;
typedef vector<char> vc;
typedef list<ll> lst;
typedef pair<ll, ll> P;
const long long INF = numeric_limits<ll>::max();
const long long MOD = 1000000007;
const long double PI = 3.1415926;
template <class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
ll n, m, k, ans, sum, cnt = 0;
string s;
char c;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n);
vi a(n);
VIN(a);
vi ansv;
ansv.pb(a[0]);
FOR(i, 1, n) {
ll now = a[i];
if (now <= ansv[0]) {
ansv.insert(ansv.begin(), a[i]);
} else {
ll index = lower_bound(ALL(ansv), now) - ansv.begin();
// debug(index);
ansv[index - 1] = a[i];
}
// debugv(ansv);
}
OUT(ansv.size());
}
| [
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"call.remove"
] | 780,708 | 780,709 | u524019694 | cpp |
p02973 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define pb(n) push_back(n)
#define endl '\n'
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define VIN(V) \
for (int ii = 0; ii < (V).size(); ii++) { \
cin >> (V).at(ii); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(ii, (V).size()) { cout << (V)[ii] << " "; } \
cout << endl;
#define VOUT2(V) \
REP(jj, (V).size()) { VOUT(V[jj]) }
#define debug(x) cout << #x << " = " << (x) << endl
#define debugv(x) \
cout << #x << " = "; \
VOUT(x);
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pair<ll, ll>> vp;
typedef vector<string> vs;
typedef vector<char> vc;
typedef list<ll> lst;
typedef pair<ll, ll> P;
const long long INF = numeric_limits<ll>::max();
const long long MOD = 1000000007;
const long double PI = 3.1415926;
template <class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
ll n, m, k, ans, sum, cnt = 0;
string s;
char c;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n);
vi a(n);
VIN(a);
vi ansv;
ansv.pb(a[0]);
FOR(i, 1, n) {
ll now = a[i];
if (now <= ansv[0]) {
ansv.insert(ansv.begin(), a[i]);
} else {
ll index = upper_bound(ALL(ansv), now) - ansv.begin();
ansv[index - 1] = a[i];
}
// debugv(ansv);
}
OUT(ansv.size());
}
| #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define pb(n) push_back(n)
#define endl '\n'
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define VIN(V) \
for (int ii = 0; ii < (V).size(); ii++) { \
cin >> (V).at(ii); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(ii, (V).size()) { cout << (V)[ii] << " "; } \
cout << endl;
#define VOUT2(V) \
REP(jj, (V).size()) { VOUT(V[jj]) }
#define debug(x) cout << #x << " = " << (x) << endl
#define debugv(x) \
cout << #x << " = "; \
VOUT(x);
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pair<ll, ll>> vp;
typedef vector<string> vs;
typedef vector<char> vc;
typedef list<ll> lst;
typedef pair<ll, ll> P;
const long long INF = numeric_limits<ll>::max();
const long long MOD = 1000000007;
const long double PI = 3.1415926;
template <class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
ll n, m, k, ans, sum, cnt = 0;
string s;
char c;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n);
vi a(n);
VIN(a);
vi ansv;
ansv.pb(a[0]);
FOR(i, 1, n) {
ll now = a[i];
if (now <= ansv[0]) {
ansv.insert(ansv.begin(), a[i]);
} else {
ll index = lower_bound(ALL(ansv), now) - ansv.begin();
// debug(index);
ansv[index - 1] = a[i];
}
// debugv(ansv);
}
OUT(ansv.size());
}
| [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,710 | 780,709 | u524019694 | cpp |
p02973 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, end) for (int i = begin; i > end; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
const int inf = 1000000007;
const int MOD = 1000000007;
const long long INF = 1000000000000000007;
int N;
int A[101010];
vector<int> b;
int main() {
cin >> N;
rep(i, 0, N) { cin >> A[i]; }
b.push_back(A[N - 1]);
repre(i, N - 2, 0) {
if (b[b.size() - 1] <= A[i]) {
b.push_back(A[i]);
}
auto lb = lower_bound(b.begin(), b.end(), A[i]);
*lb = A[i];
}
cout << b.size() << endl;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, end) for (int i = begin; i > end; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
const int inf = 1000000007;
const int MOD = 1000000007;
const long long INF = 1000000000000000007;
int N;
int A[101010];
vector<int> b;
int main() {
cin >> N;
rep(i, 0, N) { cin >> A[i]; }
b.push_back(A[N - 1]);
repre(i, N - 2, 0) {
if (b[b.size() - 1] <= A[i]) {
b.push_back(A[i]);
}
auto ub = upper_bound(b.begin(), b.end(), A[i]);
*ub = A[i];
}
cout << b.size() << endl;
}
| [
"variable_declaration.name.change",
"identifier.change",
"call.function.change",
"assignment.variable.change"
] | 780,715 | 780,716 | u372177994 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll n;
cin >> n;
vl a(n);
multiset<ll> se;
rep(i, n) {
cin >> a[i];
a[i] = -a[i];
if (se.upper_bound(a[i]) == se.end()) {
se.insert(a[i]);
} else {
auto it = se.upper_bound(a[i]);
se.erase((*it));
// cout << ((*it));
se.insert(a[i]);
}
}
cout << se.size() << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll n;
cin >> n;
vl a(n);
multiset<ll> se;
rep(i, n) {
cin >> a[i];
a[i] = -a[i];
if (se.upper_bound(a[i]) == se.end()) {
se.insert(a[i]);
// cout << "#" << endl;
} else {
auto it = se.upper_bound(a[i]);
se.erase(it);
// cout << ((*it));
se.insert(a[i]);
/*for(auto it = se.begin(); it != se.end(); it++){
cout << (*it) << " ";
}
cout << endl;*/
}
}
cout << se.size() << endl;
} | [
"call.arguments.change"
] | 780,717 | 780,718 | u242679311 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll INF = 100000000000000000;
double PI = 3.1415926535;
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<int>>;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll dp[100010];
fill(dp, dp + 100010, 0);
for (int i = 0; i < N; i++) {
*lower_bound(dp, dp + N, -A[i]) = -A[i];
}
cout << lower_bound(dp, dp + N, 0) - dp << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll INF = 100000000000000000;
double PI = 3.1415926535;
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<int>>;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll dp[100010];
fill(dp, dp + 100010, INF);
for (int i = 0; i < N; i++) {
*upper_bound(dp, dp + N, -A[i]) = -A[i];
}
cout << lower_bound(dp, dp + N, INF) - dp << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.variable.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 780,719 | 780,720 | u393754572 | cpp |
p02973 | #include <bits/stdc++.h>
#include <bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for (ll i = st; i < ed; i++)
#define repn(i, st, ed) for (ll i = st; i <= ed; i++)
#define repb(i, ed, st) for (ll i = ed; i >= st; i--)
#define all(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
typedef long long ll;
typedef unsigned long long int llt;
typedef long double ld;
const long double PI = 3.141592653589793238463;
const int N = 1e5 + 10;
const ll INF = 1LL << 60;
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
// Main Code
vector<ll> v;
multiset<ll> s;
int main() {
int n;
cin >> n;
ll x;
cin >> x;
s.insert(x);
s.insert(M);
ll ans = 1;
rep(i, 1, n) {
cin >> x;
auto itr = s.lower_bound(x);
if (itr == s.begin()) {
ans++;
s.insert(x);
} else {
itr--;
s.erase(*itr);
s.insert(x);
}
}
// for(int x: s) cout<<x<<" ";
// cout<<endl;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for (ll i = st; i < ed; i++)
#define repn(i, st, ed) for (ll i = st; i <= ed; i++)
#define repb(i, ed, st) for (ll i = ed; i >= st; i--)
#define all(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
typedef long long ll;
typedef unsigned long long int llt;
typedef long double ld;
const long double PI = 3.141592653589793238463;
const int N = 1e5 + 10;
const ll INF = 1LL << 60;
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
// Main Code
vector<ll> v;
multiset<ll> s;
int main() {
int n;
cin >> n;
ll x;
cin >> x;
s.insert(x);
s.insert(M);
ll ans = 1;
rep(i, 1, n) {
cin >> x;
auto itr = s.lower_bound(x);
if (itr == s.begin()) {
ans++;
s.insert(x);
} else {
itr--;
s.erase(itr);
s.insert(x);
}
// for(int x: s) cout<<x<<" ";
// cout<<endl;
}
cout << ans << endl;
}
| [
"call.arguments.change"
] | 780,721 | 780,722 | u230147738 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
arr[i] = -arr[i];
}
vector<int> val(n + 1, 1e9 + 7);
val[0] = arr[0];
int mx = 1;
for (int i = 1; i < n; i++) {
auto lb = lower_bound(val.begin(), val.begin() + mx, arr[i]);
val[(lb - val.begin())] = arr[i];
if ((lb - val.begin()) == mx)
mx++;
}
cout << mx << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
arr[i] = -arr[i];
}
vector<int> val(n + 1, 1e9 + 7);
val[0] = arr[0];
int mx = 1;
for (int i = 1; i < n; i++) {
auto lb = upper_bound(val.begin(), val.begin() + mx, arr[i]);
val[(lb - val.begin())] = arr[i];
if ((lb - val.begin()) == mx)
mx++;
}
cout << mx << endl;
return 0;
} | [
"identifier.change",
"call.function.change"
] | 780,729 | 780,730 | u024496314 | cpp |
p02973 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long A[100000];
long long bins[100000];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
bins[0] = -A[0];
int bin_no = 1;
for (int i = 1; i < N; i++) {
auto it = upper_bound(A, A + bin_no, -A[i]);
*it = -A[i];
if (it == A + bin_no) {
bin_no++;
}
}
cout << bin_no << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long A[100000];
long long bins[100000];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
bins[0] = -A[0];
int bin_no = 1;
for (int i = 1; i < N; i++) {
auto it = upper_bound(bins, bins + bin_no, -A[i]);
*it = -A[i];
if (it == bins + bin_no) {
bin_no++;
}
}
cout << bin_no << endl;
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 780,731 | 780,732 | u623349537 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
/*
vector.push_back()
vector<int> hoge(3,-1); {-1,-1,-1}
vector<vector<int>> hogehoge(2,vector<int>(2,-1)); {{-1,-1},{-1,-1}}
cin >>temp;
scanf("%d %d %d",&A,&B,&Q);
sort(a.begin(),a.end());
a.push_back(4000000000000);
a.insert(a.begin(),-1000000000000);
upper_bound(a.begin(),a.end(),x); // list[i] > x のイテレータ取得. *itrで数値化
*/
int checkpoint_num = 0;
void pcheck() {
cout << "----------------" << endl
<< checkpoint_num << endl
<< "----------------" << endl;
checkpoint_num += 1;
}
template <typename T> void debug(T arr) {
for (auto col : arr) {
cout << col << " ";
}
cout << endl;
}
template <typename T> void debug(T arr, int dim) {
for (auto raw : arr) {
for (auto col : raw) {
cout << col << " ";
}
cout << endl;
}
}
class UnionFind {
public:
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N + 1) { //最初は全てが根であるとして初期化
for (int i = 0; i < N + 1; i++)
par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main(void) {
int n, a;
scanf("%lld", &n);
vector<long long> arr(n, 0);
vector<long long> buf(n, -1);
long long col = 0;
for (int i = 0; i < n; ++i) {
cin >> a;
arr[i] = a;
}
for (int i = 0; i < n; ++i) {
long long temp = arr[i];
if (buf[n - 1] < temp) {
buf[n - 1] = temp;
} else {
auto key = lower_bound(buf.begin(), buf.end(), temp);
--key;
*key = temp;
}
}
int c = 0;
for (int i = 0; i < n; ++i) {
if (buf[i] != -1) {
c += 1;
}
}
debug(buf);
cout << c << endl;
};
| #include <bits/stdc++.h>
using namespace std;
/*
vector.push_back()
vector<int> hoge(3,-1); {-1,-1,-1}
vector<vector<int>> hogehoge(2,vector<int>(2,-1)); {{-1,-1},{-1,-1}}
cin >>temp;
scanf("%d %d %d",&A,&B,&Q);
sort(a.begin(),a.end());
a.push_back(4000000000000);
a.insert(a.begin(),-1000000000000);
upper_bound(a.begin(),a.end(),x); // list[i] > x のイテレータ取得. *itrで数値化
*/
int checkpoint_num = 0;
void pcheck() {
cout << "----------------" << endl
<< checkpoint_num << endl
<< "----------------" << endl;
checkpoint_num += 1;
}
template <typename T> void debug(T arr) {
for (auto col : arr) {
cout << col << " ";
}
cout << endl;
}
template <typename T> void debug(T arr, int dim) {
for (auto raw : arr) {
for (auto col : raw) {
cout << col << " ";
}
cout << endl;
}
}
class UnionFind {
public:
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N + 1) { //最初は全てが根であるとして初期化
for (int i = 0; i < N + 1; i++)
par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main(void) {
int n, a;
scanf("%lld", &n);
vector<long long> arr(n, 0);
vector<long long> buf(n, -1);
long long col = 0;
for (int i = 0; i < n; ++i) {
cin >> a;
arr[i] = a;
}
for (int i = 0; i < n; ++i) {
long long temp = arr[i];
if (buf[n - 1] < temp) {
buf[n - 1] = temp;
} else {
auto key = lower_bound(buf.begin(), buf.end(), temp);
--key;
*key = temp;
}
}
int c = 0;
for (int i = 0; i < n; ++i) {
if (buf[i] != -1) {
c += 1;
}
}
cout << c << endl;
};
| [
"call.remove"
] | 780,737 | 780,738 | u231685196 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b.push_back(-a[0]);
for (int i = 1; i < n; i++) {
auto iter = upper_bound(b.begin(), b.end(), -a[i]);
// cout << *iter << endl;
if (iter == b.end()) {
b.push_back(-a[i]);
continue;
}
*(++iter) = -a[i];
}
/*
for(ll bi: b){
cout << bi << endl;
}
*/
cout << b.size() << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b.push_back(-a[0]);
for (int i = 1; i < n; i++) {
auto iter = upper_bound(b.begin(), b.end(), -a[i]);
// cout << *iter << endl;
if (iter == b.end()) {
b.push_back(-a[i]);
continue;
}
*(iter) = -a[i];
}
/*
for(ll bi: b){
cout << bi << endl;
}
*/
cout << b.size() << endl;
} | [] | 780,741 | 780,742 | u637771514 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b.push_back(-a[0]);
for (int i = 1; i < n; i++) {
auto iter = upper_bound(b.begin(), b.end(), -a[i]);
// cout << *iter << endl;
if (iter == b.end()) {
b.push_back(-a[i]);
continue;
}
*(--iter) = -a[i];
}
/*
for(ll bi: b){
cout << bi << endl;
}
*/
cout << b.size() << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b.push_back(-a[0]);
for (int i = 1; i < n; i++) {
auto iter = upper_bound(b.begin(), b.end(), -a[i]);
// cout << *iter << endl;
if (iter == b.end()) {
b.push_back(-a[i]);
continue;
}
*(iter) = -a[i];
}
/*
for(ll bi: b){
cout << bi << endl;
}
*/
cout << b.size() << endl;
} | [] | 780,743 | 780,742 | u637771514 | cpp |
p02973 | // finish date: 2019/07/20
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<double> vd;
typedef vector<vector<double>> vvd;
typedef vector<vector<vector<double>>> vvvd;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, pair<int, int>> plii;
const int bigmod = 1000000007;
const int INF = 1050000000;
const long long INFll = 100000000000000000;
int main() {
int N;
cin >> N;
vi A(N);
rep(i, N) { cin >> A[i]; }
// int med = N / 2;
// int st = 1;
// int en = N + 1;
// while (st <= en) {
// med = (en - st) / 2;
vi seq(2 * N + 1, INF);
// FOR(i, N, 2 * N + 1) seq[i] = INF;
int cnt = 0;
rep(i, N) {
auto Iter = upper_bound(seq.begin(), seq.end(), -A[i]);
if (*Iter == INF) {
cnt++;
*Iter = -A[i];
}
}
cout << cnt << endl;
return 0;
}
| // finish date: 2019/07/20
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<double> vd;
typedef vector<vector<double>> vvd;
typedef vector<vector<vector<double>>> vvvd;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, pair<int, int>> plii;
const int bigmod = 1000000007;
const int INF = 1050000000;
const long long INFll = 100000000000000000;
int main() {
int N;
cin >> N;
vi A(N);
rep(i, N) { cin >> A[i]; }
// int med = N / 2;
// int st = 1;
// int en = N + 1;
// while (st <= en) {
// med = (en - st) / 2;
vi seq(2 * N + 1, INF);
// FOR(i, N, 2 * N + 1) seq[i] = INF;
int cnt = 0;
rep(i, N) {
auto Iter = upper_bound(seq.begin(), seq.end(), -A[i]);
if (*Iter == INF) {
cnt++;
}
*Iter = -A[i];
}
cout << cnt << endl;
return 0;
}
| [] | 780,744 | 780,745 | u285660186 | cpp |
p02973 | //* AuThOr GaRyMr *//
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
using namespace std;
const int INF = 0x3f3f3f3f;
typedef pair<int, int> mp;
typedef pair<mp, mp> superpair;
int a[100000 + 10];
int _next[100000 + 10], before[100000 + 10];
int flag[100000 + 10];
int res = 0;
int main() {
int n;
scanf("%d", &n);
rb(i, 1, n) { scanf("%d", &a[i]); }
set<int> last;
set<int>::IT ite;
rb(i, 1, n) {
if (!last.empty()) {
ite = last.lower_bound(a[i]);
if (ite != last.begin()) {
ite--;
last.erase(ite);
last.insert(a[i]);
} else {
res++;
last.insert(a[i]);
}
} else {
res++;
last.insert(a[i]);
}
}
cout << res << endl;
return 0;
} | //* AuThOr GaRyMr *//
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
using namespace std;
const int INF = 0x3f3f3f3f;
typedef pair<int, int> mp;
typedef pair<mp, mp> superpair;
int a[100000 + 10];
int _next[100000 + 10], before[100000 + 10];
int flag[100000 + 10];
int res = 0;
int main() {
int n;
scanf("%d", &n);
rb(i, 1, n) { scanf("%d", &a[i]); }
multiset<int> last;
multiset<int>::IT ite;
rb(i, 1, n) {
if (!last.empty()) {
ite = last.lower_bound(a[i]);
if (ite != last.begin()) {
ite--;
last.erase(ite);
last.insert(a[i]);
} else {
res++;
last.insert(a[i]);
}
} else {
res++;
last.insert(a[i]);
}
}
cout << res << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 780,752 | 780,753 | u751730221 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#define REPIT_R(it, container) \
for (auto it = container.rbegin(); it != container.rend(); it++)
// input
#define cin1(x) cin >> x
#define cin2(x, y) cin >> x >> y
#define cin3(x, y, z) cin >> x >> y >> z
#define ncin1(n, x) \
REP(i, 0, n) { cin1(x[i]); }
#define ncin2(n, x, y) \
REP(i, 0, n) { cin2(x[i], y[i]); }
#define ncin3(n, x, y, z) \
REP(i, 0, n) { cin3(x[i], y[i], z[i]); }
// output
#define cout1(x) cout << #x << ": " << x << endl;
#define ncout1(n, x) \
REP(i, 0, n) { cout << #x << "[" << i << "]: " << x[i] << endl; }
// sort
#define sort_r(x, y) sort(x, y, greater<lli>()); // 降順(5,4,3,,,)
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
typedef long long int lli;
typedef pair<lli, lli> P;
int main() {
lli n;
cin1(n);
lli a[n];
ncin1(n, a);
REPE(i, 1, n) { a[i] = -a[i]; }
multiset<lli> s;
s.insert(a[0]);
lli ax = 1;
REP(i, 1, n) {
lli num = a[i];
// key 未満のやつのイテレータを返してくれる
auto it = s.upper_bound(num);
if (it == s.end()) {
s.insert(num);
// cout << "add" << endl;
// cout <<"i: " << i << ", num: " << num << endl;
ax++;
} else {
s.erase(it);
s.insert(num);
// cout << "erase" << endl;
// cout <<"i: " << i << ", num: " << num << endl;
}
}
// cout << "a: " << ax << endl;
cout << s.size() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#define REPIT_R(it, container) \
for (auto it = container.rbegin(); it != container.rend(); it++)
// input
#define cin1(x) cin >> x
#define cin2(x, y) cin >> x >> y
#define cin3(x, y, z) cin >> x >> y >> z
#define ncin1(n, x) \
REP(i, 0, n) { cin1(x[i]); }
#define ncin2(n, x, y) \
REP(i, 0, n) { cin2(x[i], y[i]); }
#define ncin3(n, x, y, z) \
REP(i, 0, n) { cin3(x[i], y[i], z[i]); }
// output
#define cout1(x) cout << #x << ": " << x << endl;
#define ncout1(n, x) \
REP(i, 0, n) { cout << #x << "[" << i << "]: " << x[i] << endl; }
// sort
#define sort_r(x, y) sort(x, y, greater<lli>()); // 降順(5,4,3,,,)
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
typedef long long int lli;
typedef pair<lli, lli> P;
int main() {
lli n;
cin1(n);
lli a[n];
ncin1(n, a);
REP(i, 0, n) { a[i] = -a[i]; }
multiset<lli> s;
s.insert(a[0]);
lli ax = 1;
REP(i, 1, n) {
lli num = a[i];
// key 未満のやつのイテレータを返してくれる
auto it = s.upper_bound(num);
if (it == s.end()) {
s.insert(num);
// cout << "add" << endl;
// cout <<"i: " << i << ", num: " << num << endl;
ax++;
} else {
s.erase(it);
s.insert(num);
// cout << "erase" << endl;
// cout <<"i: " << i << ", num: " << num << endl;
}
}
// cout << "a: " << ax << endl;
cout << s.size() << endl;
}
| [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change"
] | 780,754 | 780,755 | u058297300 | cpp |
p02973 | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
vector<int> color_max;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
if (color_max.empty() || color_max[0] >= A[i]) {
color_max.insert(color_max.begin(), A[i]);
} else {
auto pos = upper_bound(color_max.begin(), color_max.end(), A[i]);
// cout<<"distance:"<<distance(color_max.begin(),pos)<<endl;
color_max[distance(color_max.begin(), pos)] = A[i];
}
/*
for(int i=0; i<color_max.size(); i++)
{
cout<<color_max[i]<<endl;
}
cout<<endl;
*/
}
cout << color_max.size() << endl;
return 0;
} | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
vector<int> color_max;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
if (color_max.empty() || color_max[0] >= A[i]) {
color_max.insert(color_max.begin(), A[i]);
} else {
auto pos = lower_bound(color_max.begin(), color_max.end(), A[i]);
// cout<<"distance:"<<distance(color_max.begin(),pos)<<endl;
color_max[distance(color_max.begin(), pos) - 1] = A[i];
}
/*
for(int i=0; i<color_max.size(); i++)
{
cout<<color_max[i]<<endl;
}
cout<<endl;
*/
}
cout << color_max.size() << endl;
return 0;
} | [
"identifier.change",
"call.function.change",
"assignment.change"
] | 780,756 | 780,757 | u545206239 | cpp |
p02973 | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
vector<int> color_max;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
if (color_max.empty() || color_max[0] >= A[i]) {
color_max.insert(color_max.begin(), A[i]);
} else {
auto pos = upper_bound(color_max.begin(), color_max.end(), A[i]);
// cout<<"distance:"<<distance(color_max.begin(),pos)<<endl;
color_max[distance(color_max.begin(), pos) - 1] = A[i];
}
/*
for(int i=0; i<color_max.size(); i++)
{
cout<<color_max[i]<<endl;
}
cout<<endl;
*/
}
cout << color_max.size() << endl;
return 0;
} | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
vector<int> color_max;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
if (color_max.empty() || color_max[0] >= A[i]) {
color_max.insert(color_max.begin(), A[i]);
} else {
auto pos = lower_bound(color_max.begin(), color_max.end(), A[i]);
// cout<<"distance:"<<distance(color_max.begin(),pos)<<endl;
color_max[distance(color_max.begin(), pos) - 1] = A[i];
}
/*
for(int i=0; i<color_max.size(); i++)
{
cout<<color_max[i]<<endl;
}
cout<<endl;
*/
}
cout << color_max.size() << endl;
return 0;
} | [
"identifier.change",
"call.function.change"
] | 780,758 | 780,757 | u545206239 | cpp |
p02973 | /*==============================================*\
ID: shahidul_brur
Name: Md. Shahidul Islam
Study: CSE, BRUR
Address: Rangpur, Bangladesh
mail: shahidul.cse.brur@gmail.com
FB : fb.com/shahidul.brur
Blog: shahidul-brur.blogspot.com(in Bengali),
shahidul-brur-en.blogspot.com(in English)
\*===============================================*/
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including
//tree_order_statistics_node_update using namespace __gnu_pbds;
using namespace std;
// typedef
// tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
// ordered_set;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz size()
#define all(a) a.begin(), a.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i, b) for (int i = 0; i < (b); i++)
#define f1(i, b) for (int i = 1; i <= (b); i++)
#define f2(i, a, b) for (int i = (a); i <= (b); i++)
#define fr(i, b, a) for (int i = (b); i >= (a); i--)
#define rep(i, a, b, c) for (int i = (a); i != (b); i += (c))
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
const double pi = acos(-1.0);
const double eps = 1e-6;
const int mod = (int)1e9 + 7;
const int maxn = (int)2e5 + 5;
const int logn = 20;
int n, a[maxn];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n;
f1(i, n) cin >> a[i];
multiset<int> seq;
f1(i, n) {
if (seq.size() == 0 || *seq.begin() >= a[i]) {
seq.insert(a[i]);
continue;
}
auto it = seq.lower_bound(a[i]);
--it;
int les = *it;
seq.erase(les);
seq.insert(a[i]);
}
cout << seq.size() << "\n";
return 0;
}
| /*==============================================*\
ID: shahidul_brur
Name: Md. Shahidul Islam
Study: CSE, BRUR
Address: Rangpur, Bangladesh
mail: shahidul.cse.brur@gmail.com
FB : fb.com/shahidul.brur
Blog: shahidul-brur.blogspot.com(in Bengali),
shahidul-brur-en.blogspot.com(in English)
\*===============================================*/
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including
//tree_order_statistics_node_update using namespace __gnu_pbds;
using namespace std;
// typedef
// tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
// ordered_set;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz size()
#define all(a) a.begin(), a.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i, b) for (int i = 0; i < (b); i++)
#define f1(i, b) for (int i = 1; i <= (b); i++)
#define f2(i, a, b) for (int i = (a); i <= (b); i++)
#define fr(i, b, a) for (int i = (b); i >= (a); i--)
#define rep(i, a, b, c) for (int i = (a); i != (b); i += (c))
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
const double pi = acos(-1.0);
const double eps = 1e-6;
const int mod = (int)1e9 + 7;
const int maxn = (int)2e5 + 5;
const int logn = 20;
int n, a[maxn];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n;
f1(i, n) cin >> a[i];
multiset<int> seq;
f1(i, n) {
if (seq.size() == 0 || *seq.begin() >= a[i]) {
seq.insert(a[i]);
continue;
}
auto it = seq.lower_bound(a[i]);
--it;
int les = *it;
seq.erase(it);
seq.insert(a[i]);
}
cout << seq.size() << "\n";
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 780,763 | 780,764 | u094186324 | cpp |
p02973 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
constexpr ll mod = 1000000007;
void pPRINTl(ostream &ost) { ost << endl; }
template <class T> void pPRINTL(ostream &ost, T t) { ost << t << endl; }
template <class T, class... U> void pPRINTl(ostream &ost, T t, U... u) {
ost << t << " ";
pPRINTl(ost, u...);
}
template <class... T> void PRINTl(T... t) { pPRINTl(cout, t...); }
//#define PRINTl //
void pPRINT(ostream &ost) {}
template <class T> void pPRINT(ostream &ost, T t) { ost << t; }
template <class T, class... U> void pPRINT(ostream &ost, T t, U... u) {
ost << t << " ";
pPRINT(ost, u...);
}
template <class... T> void PRINT(T... t) { pPRINT(cout, t...); }
#define DEBUG PRINTl("DEBUG line:", __LINE__)
//#define DEBUG
int main() {
ll n;
cin >> n;
ll a[n];
REP(i, n) cin >> a[i];
vector<int> l;
l.push_back(-1);
ll min = a[0];
FOR(i, 1, n) {
if (min > a[i]) {
l.push_back(a[i]);
min = a[i];
break;
}
REP(j, l.size()) {
if (l[j] < a[i]) {
l[j] = a[i];
if (j == l.size() - 1) {
min = a[i];
}
break;
}
}
}
PRINT(l.size());
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
constexpr ll mod = 1000000007;
void pPRINTl(ostream &ost) { ost << endl; }
template <class T> void pPRINTL(ostream &ost, T t) { ost << t << endl; }
template <class T, class... U> void pPRINTl(ostream &ost, T t, U... u) {
ost << t << " ";
pPRINTl(ost, u...);
}
template <class... T> void PRINTl(T... t) { pPRINTl(cout, t...); }
//#define PRINTl //
void pPRINT(ostream &ost) {}
template <class T> void pPRINT(ostream &ost, T t) { ost << t; }
template <class T, class... U> void pPRINT(ostream &ost, T t, U... u) {
ost << t << " ";
pPRINT(ost, u...);
}
template <class... T> void PRINT(T... t) { pPRINT(cout, t...); }
#define DEBUG PRINTl("DEBUG line:", __LINE__)
//#define DEBUG
int main() {
ll n;
cin >> n;
ll a[n];
REP(i, n) cin >> a[i];
vector<int> l;
l.push_back(a[0]);
ll min = a[0];
FOR(i, 1, n) {
if (min >= a[i]) {
l.push_back(a[i]);
min = a[i];
continue;
}
REP(j, l.size()) {
if (l[j] < a[i]) {
l[j] = a[i];
if (j == l.size() - 1) {
min = a[i];
}
break;
}
}
}
PRINT(l.size());
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 780,769 | 780,770 | u752288070 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define SORT(v, n) sort(v, v + n)
#define rep(i, n) FOR(i, 0, n)
#define EPS (1e-7)
#define INF (1e9)
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
typedef priority_queue<int> PQI;
typedef priority_queue<int, vector<int>, greater<int>> PQSI;
typedef priority_queue<ll> PQL;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQSL;
const int MOD = 1000000007;
struct mint {
int n;
mint(int n_ = 0) : n(n_) {}
};
mint operator-(mint a) { return -a.n + MOD * (a.n != 0); }
mint operator+(mint a, mint b) {
int x = a.n + b.n;
return x - (x >= MOD) * MOD;
}
mint operator-(mint a, mint b) {
int x = a.n - b.n;
return x + (x < 0) * MOD;
}
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }
istream &operator>>(istream &i, mint &a) { return i >> a.n; }
ostream &operator<<(ostream &o, mint a) { return o << a.n; }
vector<mint> F_{1, 1}, R_{1, 1}, I_{0, 1};
void check_fact(int n) {
for (int i = I_.size(); i <= n; i++) {
I_.push_back(I_[MOD % i] * (MOD - MOD / i));
F_.push_back(F_[i - 1] * i);
R_.push_back(R_[i - 1] * I_[i]);
}
}
mint I(int n) {
check_fact(abs(n));
return n >= 0 ? I_[n] : -I_[n];
}
mint F(int n) {
check_fact(n);
return n < 0 ? 0 : F_[n];
}
mint R(int n) {
check_fact(n);
return n < 0 ? 0 : R_[n];
}
mint C(int n, int r) { return F(n) * R(n - r) * R(r); }
mint P(int n, int r) { return F(n) * R(n - r); }
mint H(int n, int r) { return n == 0 ? (r == 0) : C(n + r - 1, r); }
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
template <typename T> T lcm(T x, T y) { return (x / gcd(x, y)) * y; }
template <typename T> T ceil(T x, T y) { return (x + (y - 1)) / y; }
int N;
int A[100000];
int main(void) {
cin >> N;
rep(i, N) scanf("%d", &A[i]);
vector<int> v;
v.push_back(A[0]);
for (int i = 1; i < N; i++) {
int index = upper_bound(v.begin(), v.end(), A[i]) - v.begin() - 1;
if (index == -1) {
v.insert(v.begin(), A[i]);
} else if (index == v.size() - 1 and A[i] == v[index]) {
v.push_back(A[i]);
} else {
v[index] = A[i];
}
/*
int tmp = 0;
while(true){
if(tmp >= v.size()){
v.push_back(A[i]);
break;
}
if(v[tmp] < A[i]){
v[tmp] = A[i];
break;
}
tmp++;
}
*/
}
cout << v.size() << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define SORT(v, n) sort(v, v + n)
#define rep(i, n) FOR(i, 0, n)
#define EPS (1e-7)
#define INF (1e9)
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
typedef priority_queue<int> PQI;
typedef priority_queue<int, vector<int>, greater<int>> PQSI;
typedef priority_queue<ll> PQL;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQSL;
const int MOD = 1000000007;
struct mint {
int n;
mint(int n_ = 0) : n(n_) {}
};
mint operator-(mint a) { return -a.n + MOD * (a.n != 0); }
mint operator+(mint a, mint b) {
int x = a.n + b.n;
return x - (x >= MOD) * MOD;
}
mint operator-(mint a, mint b) {
int x = a.n - b.n;
return x + (x < 0) * MOD;
}
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }
istream &operator>>(istream &i, mint &a) { return i >> a.n; }
ostream &operator<<(ostream &o, mint a) { return o << a.n; }
vector<mint> F_{1, 1}, R_{1, 1}, I_{0, 1};
void check_fact(int n) {
for (int i = I_.size(); i <= n; i++) {
I_.push_back(I_[MOD % i] * (MOD - MOD / i));
F_.push_back(F_[i - 1] * i);
R_.push_back(R_[i - 1] * I_[i]);
}
}
mint I(int n) {
check_fact(abs(n));
return n >= 0 ? I_[n] : -I_[n];
}
mint F(int n) {
check_fact(n);
return n < 0 ? 0 : F_[n];
}
mint R(int n) {
check_fact(n);
return n < 0 ? 0 : R_[n];
}
mint C(int n, int r) { return F(n) * R(n - r) * R(r); }
mint P(int n, int r) { return F(n) * R(n - r); }
mint H(int n, int r) { return n == 0 ? (r == 0) : C(n + r - 1, r); }
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
template <typename T> T lcm(T x, T y) { return (x / gcd(x, y)) * y; }
template <typename T> T ceil(T x, T y) { return (x + (y - 1)) / y; }
int N;
int A[100000];
int main(void) {
cin >> N;
rep(i, N) scanf("%d", &A[i]);
vector<int> v;
v.push_back(A[0]);
for (int i = 1; i < N; i++) {
int index = lower_bound(v.begin(), v.end(), A[i]) - v.begin() - 1;
if (index == -1) {
v.insert(v.begin(), A[i]);
} else if (index == v.size() - 1 and A[i] == v[index]) {
v.push_back(A[i]);
} else {
v[index] = A[i];
}
/*
int tmp = 0;
while(true){
if(tmp >= v.size()){
v.push_back(A[i]);
break;
}
if(v[tmp] < A[i]){
v[tmp] = A[i];
break;
}
tmp++;
}
*/
}
cout << v.size() << endl;
return 0;
}
| [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,774 | 780,775 | u097408484 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int n, a[100010];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> b;
b.push_back(a[0]);
for (int i = 1; i < n; i++) {
if (a[i] <= *b.begin()) {
b.insert(b.begin(), a[i]);
} else {
*(upper_bound(b.begin(), b.end(), a[i]) - 1) = a[i];
}
}
cout << b.size() << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n, a[100010];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> b;
b.push_back(a[0]);
for (int i = 1; i < n; i++) {
if (a[i] <= *b.begin()) {
b.insert(b.begin(), a[i]);
} else {
*(lower_bound(b.begin(), b.end(), a[i]) - 1) = a[i];
}
}
cout << b.size() << endl;
} | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,787 | 780,788 | u576357314 | cpp |
p02973 | #include "bits/stdc++.h"
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a), i##_len = (b); i < i##_len; ++i)
#define MSVC_UNKO(x) x
#define rep(...) \
MSVC_UNKO(_overload3(__VA_ARGS__, repi, _rep, _rep)(__VA_ARGS__))
#define all(c) c.begin(), c.end()
#define mp make_pair
#define write(x) cout << (x) << "\n"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
template <class T> using vv = vector<vector<T>>;
template <class T> auto vvec(int n, int m, T v) {
return vv<T>(n, vector<T>(m, v));
}
template <class T1, class T2> bool chmax(T1 &a, const T2 &b) {
return a < b ? a = b, 1 : 0;
}
template <class T1, class T2> bool chmin(T1 &a, const T2 &b) {
return b < a ? a = b, 1 : 0;
}
constexpr int INF = 1 << 29, MOD = int(1e9) + 7;
constexpr ll LINF = 1LL << 60;
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(10);
};
} aaaa;
int main() {
int N;
cin >> N;
vi A(N);
rep(i, N) cin >> A[i];
// vv<ll> dp = vvec(N + 1, 2, LINF);
// int l = 0, h = N;
// while (h - l > 1) {
// int mid = (l + h) / 2;
// rep(i, N + 1) dp[i][0] = dp[i][1] = LINF;
//
//}
// write(h);
vll B = {A[0]};
int ans = 0;
rep(i, N) {
auto lb = lower_bound(B.rbegin(), B.rend(), A[i]);
auto ub = upper_bound(B.rbegin(), B.rend(), A[i]);
if (lb == B.rbegin()) {
B.push_back(A[i]);
ans++;
} else {
*(lb - 1) = A[i];
}
}
write(ans);
} | #include "bits/stdc++.h"
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a), i##_len = (b); i < i##_len; ++i)
#define MSVC_UNKO(x) x
#define rep(...) \
MSVC_UNKO(_overload3(__VA_ARGS__, repi, _rep, _rep)(__VA_ARGS__))
#define all(c) c.begin(), c.end()
#define mp make_pair
#define write(x) cout << (x) << "\n"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
template <class T> using vv = vector<vector<T>>;
template <class T> auto vvec(int n, int m, T v) {
return vv<T>(n, vector<T>(m, v));
}
template <class T1, class T2> bool chmax(T1 &a, const T2 &b) {
return a < b ? a = b, 1 : 0;
}
template <class T1, class T2> bool chmin(T1 &a, const T2 &b) {
return b < a ? a = b, 1 : 0;
}
constexpr int INF = 1 << 29, MOD = int(1e9) + 7;
constexpr ll LINF = 1LL << 60;
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(10);
};
} aaaa;
int main() {
int N;
cin >> N;
vi A(N);
rep(i, N) cin >> A[i];
// vv<ll> dp = vvec(N + 1, 2, LINF);
// int l = 0, h = N;
// while (h - l > 1) {
// int mid = (l + h) / 2;
// rep(i, N + 1) dp[i][0] = dp[i][1] = LINF;
//
//}
// write(h);
vll B = {A[0]};
int ans = 1;
rep(i, 1, N) {
auto lb = lower_bound(B.rbegin(), B.rend(), A[i]);
auto ub = upper_bound(B.rbegin(), B.rend(), A[i]);
if (lb == B.rbegin()) {
B.push_back(A[i]);
ans++;
} else {
*(lb - 1) = A[i];
}
}
write(ans);
} | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.add"
] | 780,789 | 780,790 | u751488284 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define MMOD(i) ((i % MOD) + MOD) % MOD;
#define all(v) v.begin(), v.end()
#define vec(i, j) vector<vector<ll>>(i, vector<ll>(j, 0))
#define input(v, n) \
rep(i, n) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
const ll INF = 99999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 100010;
ll a, b, c, d, e, f, x, y, z, k, m, n, l, h, w, t, p, q, ans = 0;
vl v, vv;
string s1, s2;
ll solve() {
vv.push_back(-v[0]);
for (ll i = 1; i < n; i++) {
a = lower_bound(all(vv), -v[i]) - vv.begin();
if (a == vv.size()) {
vv.push_back(-v[i]);
} else {
vv[a] = -v[i];
}
/*cout<<vv.size()<<endl;
rep(k,vv.size()){
cout<<vv[k]<<" ";
}
cout<<endl;*/
}
return vv.size();
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
input(v, n);
cout << solve() << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define MMOD(i) ((i % MOD) + MOD) % MOD;
#define all(v) v.begin(), v.end()
#define vec(i, j) vector<vector<ll>>(i, vector<ll>(j, 0))
#define input(v, n) \
rep(i, n) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
const ll INF = 99999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 100010;
ll a, b, c, d, e, f, x, y, z, k, m, n, l, h, w, t, p, q, ans = 0;
vl v, vv;
string s1, s2;
ll solve() {
vv.push_back(-v[0]);
for (ll i = 1; i < n; i++) {
a = upper_bound(all(vv), -v[i]) - vv.begin();
if (a == vv.size()) {
vv.push_back(-v[i]);
} else {
vv[a] = -v[i];
}
/*cout<<vv.size()<<endl;
rep(k,vv.size()){
cout<<vv[k]<<" ";
}
cout<<endl;*/
}
return vv.size();
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
input(v, n);
cout << solve() << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,791 | 780,792 | u268571052 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a;
cin >> n;
vector<int> vec(200000, 0);
auto ibegin = vec.end();
for (int i = 0; i < n; i++) {
cin >> a;
auto itr = lower_bound(ibegin, vec.end(), a);
if (itr == ibegin) {
ibegin--;
*ibegin = a;
} else {
*itr = a;
}
}
// for (int i=l; i<=r; i++) cout << vec[i] << endl;
cout << vec.end() - ibegin << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a;
cin >> n;
vector<int> vec(200000, 0);
auto ibegin = vec.end();
for (int i = 0; i < n; i++) {
cin >> a;
auto itr = lower_bound(ibegin, vec.end(), a);
// cout << " " << itr-ibegin << endl;
if (itr == ibegin) {
// cout << "begin" << endl;
ibegin--;
*ibegin = a;
} else {
itr--;
*itr = a;
}
}
// for (int i=l; i<=r; i++) cout << vec[i] << endl;
cout << vec.end() - ibegin << endl;
return 0;
}
| [
"expression.unary.arithmetic.add"
] | 780,793 | 780,794 | u905270643 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define initdp(a, b) \
for (int i = 0; i <= a; i++) \
for (int j = 0; j <= b; j++) \
dp[i][j] = -1;
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repd(i, n) for (int i = n - 1; i >= 0; i--)
#define waste \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define inf 1e9 + 1
#define inf1 1e18 + 1
#define mod 1000000007
#define pie 3.14159265358979323846
#define N 1000005
#define mid(l, r) l + (r - l) / 2
using namespace std;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
void mad(ll &a, ll b) {
a = (a + b) % mod;
if (a < 0)
a += mod;
}
ll gcd(ll a, ll b) {
if (a > b)
swap(a, b);
if (!a)
return b;
return gcd(b % a, a);
}
void solve() {
int n;
cin >> n;
int a[n + 1];
rep(i, n) cin >> a[i + 1];
vector<int> res;
int b[n + 1];
b[0] = 0;
rep(i, n) b[i + 1] = 0;
for (int i = n; i > 0; i--) {
b[i] = a[i];
for (int j = i * 2; j <= n; j += i) {
b[i] ^= a[j];
}
}
rep(i, n) if (b[i + 1]) res.pb(i + 1);
cout << res.size() << "\n";
for (int i : res)
cout << i << " ";
}
int main() {
waste;
int t;
// cin>>t;
t = 1;
while (t--) {
solve();
}
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define initdp(a, b) \
for (int i = 0; i <= a; i++) \
for (int j = 0; j <= b; j++) \
dp[i][j] = -1;
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repd(i, n) for (int i = n - 1; i >= 0; i--)
#define waste \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define inf 1e9 + 1
#define inf1 1e18 + 1
#define mod 1000000007
#define pie 3.14159265358979323846
#define N 1000005
#define mid(l, r) l + (r - l) / 2
using namespace std;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
void mad(ll &a, ll b) {
a = (a + b) % mod;
if (a < 0)
a += mod;
}
ll gcd(ll a, ll b) {
if (a > b)
swap(a, b);
if (!a)
return b;
return gcd(b % a, a);
}
void solve() {
int n;
cin >> n;
int a[n + 1];
rep(i, n) cin >> a[i + 1];
vector<int> res;
int b[n + 1];
b[0] = 0;
rep(i, n) b[i + 1] = 0;
for (int i = n; i > 0; i--) {
b[i] = a[i];
for (int j = i * 2; j <= n; j += i) {
b[i] ^= b[j];
}
}
rep(i, n) if (b[i + 1]) res.pb(i + 1);
cout << res.size() << "\n";
for (int i : res)
cout << i << " ";
}
int main() {
waste;
int t;
// cin>>t;
t = 1;
while (t--) {
solve();
}
} | [
"assignment.value.change",
"identifier.change"
] | 780,797 | 780,798 | u133630059 | cpp |
p02972 | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> a(N);
copy_n(istream_iterator<unsigned long>(cin), N, a.begin());
vector<vector<unsigned long>> factor(N + 1);
for (unsigned long i = 1; i < N; ++i)
for (unsigned long j = 2 * i; j < N; j += i)
factor[j].push_back(i);
for (unsigned long j = N; j > 0; --j)
if (a[j - 1])
for (const auto &i : factor[j])
a[i - 1] ^= 1;
cout << accumulate(a.begin(), a.end(), 0UL) << endl;
for (unsigned long i = 0; i < N; ++i)
if (a[i])
cout << i + 1 << endl;
} | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> a(N);
copy_n(istream_iterator<unsigned long>(cin), N, a.begin());
vector<vector<unsigned long>> factor(N + 1);
for (unsigned long i = 1; i <= N; ++i)
for (unsigned long j = 2 * i; j <= N; j += i)
factor[j].push_back(i);
for (unsigned long j = N; j > 0; --j)
if (a[j - 1])
for (const auto &i : factor[j])
a[i - 1] ^= 1;
cout << accumulate(a.begin(), a.end(), 0UL) << endl;
for (unsigned long i = 0; i < N; ++i)
if (a[i])
cout << i + 1 << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 780,799 | 780,800 | u462437857 | cpp |
p02972 | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> a(N);
copy_n(istream_iterator<unsigned long>(cin), N, a.begin());
vector<vector<unsigned long>> factor(N + 1);
for (unsigned long i = 1; i < N; ++i)
for (unsigned long j = i; j < N; j += i)
factor[j].push_back(i);
for (unsigned long j = N; j > 0; --j)
if (a[j - 1])
for (const auto &i : factor[j])
a[i - 1] ^= 1;
cout << accumulate(a.begin(), a.end(), 0UL) << endl;
for (unsigned long i = 0; i < N; ++i)
if (a[i])
cout << i + 1 << endl;
} | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> a(N);
copy_n(istream_iterator<unsigned long>(cin), N, a.begin());
vector<vector<unsigned long>> factor(N + 1);
for (unsigned long i = 1; i <= N; ++i)
for (unsigned long j = 2 * i; j <= N; j += i)
factor[j].push_back(i);
for (unsigned long j = N; j > 0; --j)
if (a[j - 1])
for (const auto &i : factor[j])
a[i - 1] ^= 1;
cout << accumulate(a.begin(), a.end(), 0UL) << endl;
for (unsigned long i = 0; i < N; ++i)
if (a[i])
cout << i + 1 << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 780,801 | 780,800 | u462437857 | cpp |
p02972 | #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 _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); i++)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); i--)
#define CHMIN(a, b) (a) = min((a), (b))
#define CHMAX(a, b) (a) = max((a), (b))
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
REP(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
const ll MOD = 1000000007ll;
int n;
int a[252521];
int u[252521];
int main() {
scanf("%d", &n);
REP(i, n) scanf("%d", a + i);
FORR(i, 0, n) {
int v = i + 1;
int sm = 0;
int it = v + v;
while (it <= n) {
sm += a[it - 1];
it += v;
}
u[i] = (sm + a[i]) % 2;
}
vi v;
REP(i, n) if (u[i]) v.push_back(i + 1);
printf("%d\n", (int)v.size());
int m = v.size();
REP(i, m) printf("%d%c", v[i], " \n"[i == m - 1]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); i++)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); i--)
#define CHMIN(a, b) (a) = min((a), (b))
#define CHMAX(a, b) (a) = max((a), (b))
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
REP(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
const ll MOD = 1000000007ll;
int n;
int a[252521];
int u[252521];
int main() {
scanf("%d", &n);
REP(i, n) scanf("%d", a + i);
FORR(i, 0, n) {
int v = i + 1;
int sm = 0;
int it = v + v;
while (it <= n) {
sm += u[it - 1];
it += v;
}
u[i] = (sm + a[i]) % 2;
}
vi v;
REP(i, n) if (u[i]) v.push_back(i + 1);
printf("%d\n", (int)v.size());
int m = v.size();
REP(i, m) printf("%d%c", v[i], " \n"[i == m - 1]);
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 780,804 | 780,805 | u462560753 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
V<> a(n);
for (auto &&e : a)
cin >> e;
a.insert(begin(a), -1);
V<> b(n + 1);
for (int i = n; i; --i) {
int s = 0;
for (int j = 2 * i; j <= n; j += i) {
s += b[j];
}
s &= 1;
if (a[i] != s)
b[i] = 1;
}
cout << accumulate(begin(b), end(b), 0) << '\n';
for (int i = 1; i <= n; ++i)
if (a[i]) {
cout << i << ' ';
}
cout << '\n';
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
V<> a(n);
for (auto &&e : a)
cin >> e;
a.insert(begin(a), -1);
V<> b(n + 1);
for (int i = n; i; --i) {
int s = 0;
for (int j = 2 * i; j <= n; j += i) {
s += b[j];
}
s &= 1;
if (a[i] != s)
b[i] = 1;
}
cout << accumulate(begin(b), end(b), 0) << '\n';
for (int i = 1; i <= n; ++i)
if (b[i]) {
cout << i << ' ';
}
cout << '\n';
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 780,806 | 780,807 | u536580583 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef long double D;
typedef complex<D> P;
#define F first
#define S second
const ll E = 1e18 + 7;
const ll MOD = 1000000007;
template <typename T, typename U>
istream &operator>>(istream &i, pair<T, U> &A) {
i >> A.F >> A.S;
return i;
}
template <typename T> istream &operator>>(istream &i, vector<T> &A) {
for (auto &I : A) {
i >> I;
}
return i;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &A) {
o << A.F << " " << A.S;
return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &A) {
ll i = A.size();
for (auto &I : A) {
o << I << (--i ? " " : "");
}
return o;
}
template <typename T> vector<T> &cset(vector<T> &A, T e = T()) {
for (auto &I : A) {
I = e;
}
return A;
}
int main() {
ll n;
cin >> n;
vector<ll> A(n + 1);
for (int i = 1; i <= n; i++) {
cin >> A[i];
}
vector<ll> ans(n + 1);
vector<ll> B;
for (ll i = n; i > 0; i--) {
ll cnt = 0;
for (ll j = 2; i * j <= n; j++) {
cnt += A[i * j];
}
if ((cnt + A[i]) % 2) {
ans[i] = 1;
B.push_back(i);
}
}
reverse(B.begin(), B.end());
cout << B.size() << endl;
cout << B << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef long double D;
typedef complex<D> P;
#define F first
#define S second
const ll E = 1e18 + 7;
const ll MOD = 1000000007;
template <typename T, typename U>
istream &operator>>(istream &i, pair<T, U> &A) {
i >> A.F >> A.S;
return i;
}
template <typename T> istream &operator>>(istream &i, vector<T> &A) {
for (auto &I : A) {
i >> I;
}
return i;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &A) {
o << A.F << " " << A.S;
return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &A) {
ll i = A.size();
for (auto &I : A) {
o << I << (--i ? " " : "");
}
return o;
}
template <typename T> vector<T> &cset(vector<T> &A, T e = T()) {
for (auto &I : A) {
I = e;
}
return A;
}
int main() {
ll n;
cin >> n;
vector<ll> A(n + 1);
for (int i = 1; i <= n; i++) {
cin >> A[i];
}
vector<ll> ans(n + 1);
vector<ll> B;
for (ll i = n; i > 0; i--) {
ll cnt = 0;
for (ll j = 2; i * j <= n; j++) {
cnt += ans[i * j];
}
if ((cnt + A[i]) % 2) {
ans[i] = 1;
B.push_back(i);
}
}
reverse(B.begin(), B.end());
cout << B.size() << endl;
cout << B << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 780,808 | 780,809 | u899635344 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
cout << #v << "=" << endl; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << endl;
#define mdebug(m) \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod
signed main() {
int N;
cin >> N;
vec a(N);
cin >> a;
vec ans(N + 1, 0);
int sz = 0;
IFOR(i, 1, N + 1) {
int a0 = a[i - 1];
int tmp = 0;
for (int j = 2 * i; j <= N; j += i)
tmp += ans[j];
if (tmp % 2 != a0) {
ans[i] = 1;
sz++;
}
}
Out(sz);
FOR(i, 1, N + 1) if (a[i]) cout << i << " ";
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
cout << #v << "=" << endl; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << endl;
#define mdebug(m) \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod
signed main() {
int N;
cin >> N;
vec a(N);
cin >> a;
vec ans(N + 1, 0);
int sz = 0;
IFOR(i, 1, N + 1) {
int a0 = a[i - 1];
int tmp = 0;
for (int j = 2 * i; j <= N; j += i)
tmp += ans[j];
if (tmp % 2 != a0) {
ans[i] = 1;
sz++;
}
}
Out(sz);
FOR(i, 1, N + 1) if (ans[i]) cout << i << " ";
cout << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 780,810 | 780,811 | u434231045 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
cout << #v << "=" << endl; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << endl;
#define mdebug(m) \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod
signed main() {
int N;
cin >> N;
vec a(N);
cin >> a;
vec ans(N + 1, 0);
int sz = 0;
IFOR(i, 1, N + 1) {
int a0 = a[i - 1];
int tmp = 0;
for (int j = 2 * i; j <= N; j += i)
tmp += ans[j];
if (tmp % 2 != a[i]) {
ans[i] = 1;
sz++;
}
}
Out(sz);
FOR(i, 1, N + 1) if (a[i]) cout << i << " ";
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
cout << #v << "=" << endl; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << endl;
#define mdebug(m) \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod
signed main() {
int N;
cin >> N;
vec a(N);
cin >> a;
vec ans(N + 1, 0);
int sz = 0;
IFOR(i, 1, N + 1) {
int a0 = a[i - 1];
int tmp = 0;
for (int j = 2 * i; j <= N; j += i)
tmp += ans[j];
if (tmp % 2 != a0) {
ans[i] = 1;
sz++;
}
}
Out(sz);
FOR(i, 1, N + 1) if (ans[i]) cout << i << " ";
cout << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 780,812 | 780,811 | u434231045 | cpp |
p02972 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#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, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
typedef vector<double> VD;
typedef vector<VD> VVD;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
int main() {
int n;
cin >> n;
VI b(n);
REP(i, n) b[i] = in();
VI ans(n);
FORR(x, n - 1, 1) {
int c = 0;
for (int y = 2 * x; y <= n; y += x) {
c ^= ans[y - 1];
}
ans[x - 1] = (c ^ b[x - 1]);
}
VI v;
REP(i, n) if (ans[i]) v.push_back(i + 1);
cout << v.size() << endl;
for (int x : v)
cout << x << " ";
cout << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#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, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
typedef vector<double> VD;
typedef vector<VD> VVD;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
int main() {
int n;
cin >> n;
VI b(n);
REP(i, n) b[i] = in();
VI ans(n);
FORR(x, n, 1) {
int c = 0;
for (int y = 2 * x; y <= n; y += x) {
c ^= ans[y - 1];
}
ans[x - 1] = (c ^ b[x - 1]);
}
VI v;
REP(i, n) if (ans[i]) v.push_back(i + 1);
cout << v.size() << endl;
for (int x : v)
cout << x << " ";
cout << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 780,819 | 780,820 | u016572066 | cpp |
p02973 | #include <bits/stdc++.h>
// g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 // 10^9+7
int main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
map<ll, ll> M;
rep(i, N) {
map<ll, ll>::iterator it = M.lower_bound(A[i]);
if (M.size() == 0 || it == M.begin()) {
M[A[i]]++;
} else {
it--;
(*it).second--;
if ((*it).second) {
M.erase(it);
}
M[A[i]]++;
}
}
ll ans = 0;
for (pair<ll, ll> item : M) {
ans += item.second;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
// g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 // 10^9+7
int main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
map<ll, ll> M;
rep(i, N) {
map<ll, ll>::iterator it = M.lower_bound(A[i]);
if (M.size() == 0 || it == M.begin()) {
M[A[i]]++;
} else {
it--;
(*it).second--;
if ((*it).second == 0) {
M.erase(it);
}
M[A[i]]++;
}
}
ll ans = 0;
for (pair<ll, ll> item : M) {
ans += item.second;
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 780,829 | 780,830 | u805616568 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI = acos(-1);
int main() {
int N;
cin >> N;
vector<int> A;
rep(i, N) {
int a;
cin >> a;
if (A.size() == 0) {
A.push_back(a);
} else {
auto idx = lower_bound(A.rbegin(), A.rend(), a) - A.rbegin();
if (idx == 0) {
A.push_back(a);
} else {
A[idx - 1] = a;
}
}
// sort(A.begin(),A.end());
}
int ans = A.size();
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI = acos(-1);
int main() {
int N;
cin >> N;
vector<int> A;
rep(i, N) {
int a;
cin >> a;
if (A.size() == 0) {
A.push_back(a);
} else {
auto idx = lower_bound(A.rbegin(), A.rend(), a) - A.rbegin();
// cout << "input:" << a << " idx:" << idx << endl;
if (idx == 0) {
A.push_back(a);
} else {
// cout << "input:" << a << " idx:" << A.size()-idx << endl;
A[A.size() - idx] = a;
}
}
// sort(A.begin(),A.end());
}
int ans = A.size();
cout << ans << endl;
// rep(i,A.size()) {
// cout << A[i] << " ";
//}
// cout << endl;
}
| [
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 780,838 | 780,839 | u663191260 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI = acos(-1);
int main() {
int N;
cin >> N;
vector<int> A;
rep(i, N) {
int a;
cin >> a;
if (A.size() == 0) {
A.push_back(a);
} else {
auto idx = lower_bound(A.begin(), A.end(), a) - A.begin();
if (idx == 0) {
A.push_back(a);
} else {
A[idx - 1] = a;
}
}
// sort(A.begin(),A.end());
}
int ans = A.size();
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI = acos(-1);
int main() {
int N;
cin >> N;
deque<int> A;
rep(i, N) {
int a;
cin >> a;
if (A.size() == 0) {
A.push_back(a);
} else {
auto idx = lower_bound(A.begin(), A.end(), a) - A.begin();
if (idx == 0) {
A.push_front(a);
} else {
A[idx - 1] = a;
}
}
// sort(A.begin(),A.end());
}
int ans = A.size();
cout << ans << endl;
}
| [
"variable_declaration.type.change",
"call.function.change"
] | 780,840 | 780,841 | u663191260 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
vector<int> u;
for (int i = 0; i < n; i++) {
int x = v[i];
int p = lower_bound(ALL(u), x) - u.begin() - 1;
if (p < 0)
u.push_back(x);
else
v[p] = x;
}
cout << u.size() << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
deque<int> u;
for (int i = 0; i < n; i++) {
int x = v[i];
int p = lower_bound(ALL(u), x) - u.begin() - 1;
if (p < 0)
u.push_front(x);
else
u[p] = x;
}
cout << u.size() << endl;
} | [
"variable_declaration.type.change",
"call.function.change",
"assignment.variable.change",
"identifier.change"
] | 780,851 | 780,852 | u280175105 | cpp |
p02973 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
const int N = 100001;
int f[N];
int f1[N];
int d[N];
int n, ans, ans1;
int main() {
scanf("%d", &n);
for (int i = n; i >= 1; i--)
scanf("%d", &d[i]);
int len = 1, len1 = 1;
f[1] = f1[1] = d[1];
for (int i = 2; i <= n; i++) {
if (f[len] >= d[i])
f[++len] = d[i];
else {
int wz = upper_bound(f + 1, f + 1 + len, d[i], greater<int>()) - f;
f[wz] = d[i];
}
if (f1[len1] <= d[i])
f1[++len1] = d[i];
else {
int wz = lower_bound(f1 + 1, f1 + 1 + len1, d[i]) - f1;
f1[wz] = d[i];
}
}
printf("%d\n", len1);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
const int N = 100001;
int f[N];
int f1[N];
int d[N];
int n, ans, ans1;
int main() {
scanf("%d", &n);
for (int i = n; i >= 1; i--)
scanf("%d", &d[i]);
int len = 1, len1 = 1;
f[1] = f1[1] = d[1];
for (int i = 2; i <= n; i++) {
if (f[len] >= d[i])
f[++len] = d[i];
else {
int wz = upper_bound(f + 1, f + 1 + len, d[i], greater<int>()) - f;
f[wz] = d[i];
}
if (f1[len1] <= d[i])
f1[++len1] = d[i];
else {
int wz = upper_bound(f1 + 1, f1 + 1 + len1, d[i]) - f1;
f1[wz] = d[i];
}
}
printf("%d\n", len1);
return 0;
} | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,856 | 780,857 | u863370423 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.