problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << first << ',' << second << ')'
ll MOD = 1000000007;
// ll INF = 21474836470000000;
ll INF = 100100100100100100;
long double EPS = 1e-11;
long double PI = 3.141592653589793238;
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<ll>>;
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N + 1);
rep(i, N) cin >> A[i + 1];
ll M = 0;
rrep(i, N + 1) {
if (i == 0)
break;
ll cnt = 0;
for (ll j = 0; j * i <= N; j++) {
cnt += B[i + i * j];
}
if (A[i] % 2 != cnt % 2) {
B[i]++;
M++;
}
}
cout << M << endl;
rep(i, N + 1) {
if (B[i] > 0)
cout << i << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << first << ',' << second << ')'
ll MOD = 1000000007;
// ll INF = 21474836470000000;
ll INF = 100100100100100100;
long double EPS = 1e-11;
long double PI = 3.141592653589793238;
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<ll>>;
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N + 1);
rep(i, N) cin >> A[i + 1];
ll M = 0;
rrep(i, N + 1) {
if (i == 0)
break;
ll cnt = 0;
for (ll j = 0; j * i <= N; j++) {
cnt += B[i * j];
}
if (A[i] % 2 != cnt % 2) {
B[i]++;
M++;
}
}
cout << M << endl;
rep(i, N + 1) {
if (B[i] > 0)
cout << i << endl;
}
}
| replace | 32 | 33 | 32 | 33 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> eeai(N, 0);
vector<int> biiai(N, 0);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> eeai.at(i);
}
for (int i = N; i > 0; i--) {
count = 0;
for (int j = 0; j < N; j++) {
if ((j + 1) % i == 0) {
count += biiai.at(j);
}
}
if (count % 2 == eeai.at(i - 1)) {
biiai.at(i - 1) = 0;
} else {
biiai.at(i - 1) = 1;
}
}
int M = 0;
for (int i = 0; i < N; i++) {
M += biiai.at(i);
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (biiai.at(i) == 1) {
cout << i + 1 << " ";
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> eeai(N, 0);
vector<int> biiai(N, 0);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> eeai.at(i);
}
for (int i = N; i > 0; i--) {
count = 0;
for (int j = i; j < N + 1; j += i) {
if (j % i == 0) {
count += biiai.at(j - 1);
}
}
if (count % 2 == eeai.at(i - 1)) {
biiai.at(i - 1) = 0;
} else {
biiai.at(i - 1) = 1;
}
}
int M = 0;
for (int i = 0; i < N; i++) {
M += biiai.at(i);
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (biiai.at(i) == 1) {
cout << i + 1 << " ";
}
}
}
| replace | 16 | 19 | 16 | 19 | TLE | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef map<int, int> MII;
typedef queue<int> QI;
typedef queue<PII> QPII;
typedef stack<int> SI;
typedef stack<PII> SPII;
typedef deque<int> DI;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQGI; // 大きい順
typedef priority_queue<int, VI, greater<int>> PQLI;
typedef priority_queue<PII> PQGP;
typedef priority_queue<PII, VPII, greater<int>> PQLP;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define PF push_front
#define POB pop_back()
#define POF pop_front()
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define LB lower_bound
#define UB upper_bound
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
#define FI first
#define SE second
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, a, b) for (int i = (b - 1); i >= a; i--)
#define REPR(i, n) FORR(i, 0, n)
#define BREP(bit, N) for (int bit = 0; bit < (1 << N); ++bit)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX / 2;
const LL LINF = LLONG_MAX / 2;
const LL MOD = 1e9 + 7;
const LL MODD = 998244353;
const int MAX = 510000;
// other
//-------------------------------------------
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;
}
#define SEP(a) cout << fixed << setprecision(a)
#define COUT(x) cout << (x) << endl
#define COUT2(x) cout << (x)
#define ENDL cout << endl
#define SPACE cout << " "
VI dx = {1, 0, -1, 0, 1, 1, -1, -1};
VI dy = {0, 1, 0, -1, 1, -1, 1, -1};
VC dc = {'R', 'D', 'L', 'U'};
VS ds = {"R", "D", "L", "U", "RD", "RU", "LD", "LU"};
LL Gcd(LL a, LL b) { return __gcd(a, b); }
LL Lcm(LL a, LL b) {
LL abd = Gcd(a, b);
LL x = a / abd, y = b;
return x * y;
}
LL ModPow(LL A, LL N, LL M) {
LL res = 1;
while (N > 0) {
if (N & 1)
res = res * A % M;
A = A * A % M;
N >>= 1;
}
return res;
}
LL fac[MAX], finv[MAX], inv[MAX];
void ConInit(LL M) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % M;
inv[i] = M - inv[M % i] * (M / i) % M;
finv[i] = finv[i - 1] * inv[i] % M;
}
}
LL COM(int n, int k, LL M) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % M) % M;
}
template <class T> void VCout(vector<T> v) {
int N = SZ(v);
REP(i, N) {
cout << v.at(i);
if (i == N - 1)
ENDL;
else
SPACE;
}
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VI a(N), b(N, 0), c;
;
REP(i, N) cin >> a.at(i);
REPR(i, N) {
int t = 0;
FORR(j, i + 1, N) {
if ((j + 1) % (i + 1) == 0)
t += b.at(j);
}
if (t % 2 != a.at(i)) {
b.at(i)++;
}
}
REP(i, N) {
if (b.at(i) == 1) {
c.PB(i + 1);
}
}
COUT(SZ(c));
VCout(c);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef map<int, int> MII;
typedef queue<int> QI;
typedef queue<PII> QPII;
typedef stack<int> SI;
typedef stack<PII> SPII;
typedef deque<int> DI;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQGI; // 大きい順
typedef priority_queue<int, VI, greater<int>> PQLI;
typedef priority_queue<PII> PQGP;
typedef priority_queue<PII, VPII, greater<int>> PQLP;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define PF push_front
#define POB pop_back()
#define POF pop_front()
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define LB lower_bound
#define UB upper_bound
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
#define FI first
#define SE second
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, a, b) for (int i = (b - 1); i >= a; i--)
#define REPR(i, n) FORR(i, 0, n)
#define BREP(bit, N) for (int bit = 0; bit < (1 << N); ++bit)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX / 2;
const LL LINF = LLONG_MAX / 2;
const LL MOD = 1e9 + 7;
const LL MODD = 998244353;
const int MAX = 510000;
// other
//-------------------------------------------
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;
}
#define SEP(a) cout << fixed << setprecision(a)
#define COUT(x) cout << (x) << endl
#define COUT2(x) cout << (x)
#define ENDL cout << endl
#define SPACE cout << " "
VI dx = {1, 0, -1, 0, 1, 1, -1, -1};
VI dy = {0, 1, 0, -1, 1, -1, 1, -1};
VC dc = {'R', 'D', 'L', 'U'};
VS ds = {"R", "D", "L", "U", "RD", "RU", "LD", "LU"};
LL Gcd(LL a, LL b) { return __gcd(a, b); }
LL Lcm(LL a, LL b) {
LL abd = Gcd(a, b);
LL x = a / abd, y = b;
return x * y;
}
LL ModPow(LL A, LL N, LL M) {
LL res = 1;
while (N > 0) {
if (N & 1)
res = res * A % M;
A = A * A % M;
N >>= 1;
}
return res;
}
LL fac[MAX], finv[MAX], inv[MAX];
void ConInit(LL M) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % M;
inv[i] = M - inv[M % i] * (M / i) % M;
finv[i] = finv[i - 1] * inv[i] % M;
}
}
LL COM(int n, int k, LL M) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % M) % M;
}
template <class T> void VCout(vector<T> v) {
int N = SZ(v);
REP(i, N) {
cout << v.at(i);
if (i == N - 1)
ENDL;
else
SPACE;
}
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VI a(N), b(N, 0), c;
;
REP(i, N) cin >> a.at(i);
REPR(i, N) {
int t = 0;
for (int j = (i + 1) * 2; j <= N; j += i + 1) {
t += b.at(j - 1);
}
if (t % 2 != a.at(i)) {
b.at(i)++;
}
}
REP(i, N) {
if (b.at(i) == 1) {
c.PB(i + 1);
}
}
COUT(SZ(c));
VCout(c);
return 0;
}
| replace | 183 | 186 | 183 | 185 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n, 0);
for (int i = n - 1; i >= 0; --i) {
int res = 0;
for (int j = i + (i + 1); j < n; j += (i + 1))
res ^= ans[j];
ans[i] = res ^ a[i];
}
int j_ans = 0;
rep(i, n) j_ans += ans[i];
dunk(j_ans);
rep(i, n) {
if (ans[i])
dunk(i + 1);
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n, 0);
for (int i = n - 1; i >= 0; --i) {
int res = 0;
for (int j = i + (i + 1); j < n; j += (i + 1))
res ^= ans[j];
ans[i] = res ^ a[i];
}
int j_ans = 0;
rep(i, n) j_ans += ans[i];
dunk(j_ans);
rep(i, n) {
if (ans[i])
dunk(i + 1);
}
return 0;
}
| delete | 1 | 4 | 1 | 1 | 0 | |
p02972 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
n++;
V<int> a(n);
int cnt = 0;
for (int i = 1; i < n; i++)
cin >> a[i];
V<int> ans(n, 0);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = 1; i * j < n; j++) {
sum ^= ans[i * j];
}
if (sum != a[i]) {
ans[i] = 1;
cnt++;
}
}
cout << cnt << "\n";
for (int i = 1; i < n; i++)
if (ans[i])
cout << i << " ";
if (cnt)
cout << "\n";
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
n++;
V<int> a(n);
int cnt = 0;
for (int i = 1; i < n; i++)
cin >> a[i];
V<int> ans(n, 0);
for (int i = n - 1; i >= 1; i--) {
int sum = 0;
for (int j = 1; i * j < n; j++) {
sum ^= ans[i * j];
}
if (sum != a[i]) {
ans[i] = 1;
cnt++;
}
}
cout << cnt << "\n";
for (int i = 1; i < n; i++)
if (ans[i])
cout << i << " ";
if (cnt)
cout << "\n";
} | replace | 44 | 45 | 44 | 45 | 0 | |
p02972 | Python | Time Limit Exceeded | from sys import stdin
def main():
N = int(stdin.readline().rstrip())
As = [int(x) for x in stdin.readline().rstrip().split()]
result = [0 for _ in range(N)]
for i, a in enumerate(As[::-1]):
num = N - i
idx = num - 1
if N // num < 2:
result[idx] = a
else:
sum_ = sum([x for i, x in enumerate(result) if idx % (i + 1) == 0])
if sum_ % 2 == 1:
result[idx] = 1 if a == 0 else 0
else:
result[idx] = 0 if a == 0 else 1
print(len([x for x in result if x == 1]))
for i, x in enumerate(result):
if x == 1:
print(i + 1, end=" ")
if __name__ == "__main__":
main()
| from sys import stdin
def main():
N = int(stdin.readline().rstrip())
As = [int(x) for x in stdin.readline().rstrip().split()]
result = [0 for _ in range(N)]
for i, a in enumerate(As[::-1]):
num = N - i
idx = num - 1
if N // num < 2:
result[idx] = a
else:
sum_ = 0
cnt = 2
while True:
if N < (num * cnt):
break
sum_ += result[(num * cnt) - 1]
cnt += 1
if sum_ % 2 == 1:
result[idx] = 1 if a == 0 else 0
else:
result[idx] = 0 if a == 0 else 1
print(len([x for x in result if x == 1]))
for i, x in enumerate(result):
if x == 1:
print(i + 1, end=" ")
if __name__ == "__main__":
main()
| replace | 13 | 14 | 13 | 20 | TLE | |
p02972 | Python | Runtime Error | N = int(input())
a = list(map(int, input().split()))
t = [0] * N
for i in range(N - 1, -1, -1):
t[i] = (sum(t[2 * (i + 1) - 1 :: i]) % 2) ^ a[i]
print(sum(t))
print(*[i + 1 for i in range(N) if t[i] == 1])
| N = int(input())
a = list(map(int, input().split()))
t = [0] * N
for i in range(N - 1, -1, -1):
t[i] = (sum(t[2 * (i + 1) - 1 :: i + 1]) % 2) ^ a[i]
print(sum(t))
print(*[i + 1 for i in range(N) if t[i] == 1])
| replace | 5 | 6 | 5 | 6 | ValueError: slice step cannot be zero | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02972/Python/s365219568.py", line 6, in <module>
t[i] = (sum(t[2 * (i + 1) - 1::i]) % 2) ^ a[i]
ValueError: slice step cannot be zero
|
p02972 | Python | Runtime Error | n = int(input())
a = [0] + list(map(int, input().split()))
for i in range(n // 2, 0, -1):
a[i] ^= a[i * 2 :: i]
s = [i for i, b in enumerate(a) if b]
print(len(s))
print(*s)
| n = int(input())
a = [0] + list(map(int, input().split()))
for i in range(n // 2, 0, -1):
a[i] = sum(a[i::i]) % 2
s = [i for i, b in enumerate(a) if b]
print(len(s))
print(*s)
| replace | 3 | 4 | 3 | 4 | TypeError: unsupported operand type(s) for ^=: 'int' and 'list' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02972/Python/s635052130.py", line 4, in <module>
a[i] ^= a[i * 2::i]
TypeError: unsupported operand type(s) for ^=: 'int' and 'list'
|
p02972 | Python | Runtime Error | n = int(input())
a = input()
r = [None] * (n + 1)
for i in range(n, 0, -1):
r[i] = (ord(a[2 * i - 1]) + sum(r[i * 2 :: i])) % 2
print(r.count(1))
print(*(i for i, x in enumerate(r) if x))
| n = int(input())
a = input()
r = [None] * (n + 1)
for i in range(n, 0, -1):
r[i] = (ord(a[2 * i - 2]) + sum(r[i * 2 :: i])) % 2
print(r.count(1))
print(*(i for i, x in enumerate(r) if x))
| replace | 4 | 5 | 4 | 5 | IndexError: string index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02972/Python/s316789031.py", line 5, in <module>
r[i] = (ord(a[2 * i - 1]) + sum(r[i * 2::i])) % 2
IndexError: string index out of range
|
p02972 | C++ | Runtime Error | #include <cstdio>
const int MAXN = 2e5 + 5;
int A[MAXN]{};
int B[MAXN]{};
int M, N;
int count_up(int i) {
int sum = 0;
for (int j = i; j * j <= N; j += i) {
if (B[j])
sum ^= 1;
}
return sum;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
}
M = 0;
for (int i = N; i >= 1; --i) {
if (count_up(i) != A[i]) {
B[i] = 1;
++M;
}
}
printf("%d\n", M);
for (int i = 1; i <= N; ++i) {
if (B[i])
printf("%d ", i);
}
putchar('\n');
return 0;
} | #include <cstdio>
const int MAXN = 2e5 + 5;
int A[MAXN]{};
int B[MAXN]{};
int M, N;
int count_up(int i) {
int sum = 0;
for (int j = i; j <= N; j += i) {
if (B[j])
sum ^= 1;
}
return sum;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
}
M = 0;
for (int i = N; i >= 1; --i) {
if (count_up(i) != A[i]) {
B[i] = 1;
++M;
}
}
printf("%d\n", M);
for (int i = 1; i <= N; ++i) {
if (B[i])
printf("%d ", i);
}
putchar('\n');
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B) {
if (B == 0)
return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
/*------------------------------------------------------------------*/
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, 0);
int count = 0;
vector<int> c;
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = n; j >= i; j--) {
if (j % i == 0)
sum += b[j - 1];
}
if (sum % 2 != a[i - 1]) {
c.push_back(i);
count++;
b[i - 1]++;
}
}
if (count != 0) {
cout << count << endl;
for (auto it : c)
cout << it << endl;
} else if (count == 0) {
if (*max_element(a.begin(), a.end()) == 0)
cout << 0 << endl;
else
cout << -1 << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B) {
if (B == 0)
return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
/*------------------------------------------------------------------*/
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, 0);
int count = 0;
vector<int> c;
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
if (j % i == 0)
sum += b[j - 1];
}
if (sum % 2 != a[i - 1]) {
c.push_back(i);
count++;
b[i - 1]++;
}
}
if (count != 0) {
cout << count << endl;
for (auto it : c)
cout << it << endl;
} else if (count == 0) {
if (*max_element(a.begin(), a.end()) == 0)
cout << 0 << endl;
else
cout << -1 << endl;
}
} | replace | 34 | 35 | 34 | 35 | TLE | |
p02972 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int aa;
vector<int> a(n + 1);
rep(i, n) {
cin >> aa;
if (aa == 0) {
a[i + 1] = -1;
} else {
a[i + 1] = 1;
}
}
vector<vector<int>> memo(n + 1);
int k, k2;
rep(i, n) {
k = 2;
while ((i + 1) * k <= n) {
memo[(i + 1) * k].push_back(i + 1);
++k;
}
}
int ka;
ka = 0;
int l;
vector<int> ans(n + 1, 0);
for (int i = n; i > 0; --i) {
if (a[i] == 1) {
++ka;
ans[i] = 1;
if (memo[i].size() != 0) {
l = memo[i].size();
rep(i, l) { ans[memo[i][l]] *= -1; }
}
}
}
cout << ka << endl;
rep(i, n) {
if (a[i + 1] == 1) {
cout << i + 1 << 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>;
int main() {
int n;
cin >> n;
int aa;
vector<int> a(n + 1);
rep(i, n) {
cin >> aa;
if (aa == 0) {
a[i + 1] = -1;
} else {
a[i + 1] = 1;
}
}
vector<vector<int>> memo(n + 1);
int k, k2;
rep(i, n) {
k = 2;
while ((i + 1) * k <= n) {
memo[(i + 1) * k].push_back(i + 1);
++k;
}
}
int ka;
ka = 0;
int l;
vector<int> ans(n + 1, 0);
for (int i = n; i > 0; --i) {
if (a[i] == 1) {
++ka;
ans[i] = 1;
if (memo[i].size() != 0) {
l = memo[i].size();
rep(j, l) { a[memo[i][j]] *= -1; }
}
}
}
cout << ka << endl;
rep(i, n) {
if (a[i + 1] == 1) {
cout << i + 1 << endl;
}
}
return 0;
} | replace | 41 | 42 | 41 | 42 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
int main() {
int N;
ll a[300001];
ll b[300001];
int cnt(0);
cin >> N;
for (int i(1); i <= N; i++)
cin >> b[i];
for (int i(N / 2 + 1); i <= N; i++) {
a[i] = b[i];
if (a[i] == 1)
cnt += 1;
}
for (int i(N / 2); i > 0; i--) {
// a[i] is needed
int sum(0);
for (int j(i); j <= N; j += i) {
cerr << j * i << " ";
sum += a[j];
}
// cout <<sum << " " << b[i] << endl;
if (sum % 2 == b[i])
a[i] = 0;
else {
a[i] = 1;
cnt += 1;
}
}
cout << cnt << endl;
for (int i(1); i <= N; i++) {
if (a[i] == 1) {
cout << i << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
int main() {
int N;
ll a[300001];
ll b[300001];
int cnt(0);
cin >> N;
for (int i(1); i <= N; i++)
cin >> b[i];
for (int i(N / 2 + 1); i <= N; i++) {
a[i] = b[i];
if (a[i] == 1)
cnt += 1;
}
for (int i(N / 2); i > 0; i--) {
// a[i] is needed
int sum(0);
for (int j(i * 2); j <= N; j += i) {
sum += a[j];
}
// cout <<sum << " " << b[i] << endl;
if (sum % 2 == b[i])
a[i] = 0;
else {
a[i] = 1;
cnt += 1;
}
}
cout << cnt << endl;
for (int i(1); i <= N; i++) {
if (a[i] == 1) {
cout << i << endl;
}
}
return 0;
}
| replace | 21 | 23 | 21 | 22 | TLE | |
p02972 | Python | Runtime Error | n = int(input())
a = list(map(int, input().split()))
with open("testcase_12.in") as f:
n = int(f.readline())
a = list(map(int, f.readline().split()))
b = [-1] * n
for i in range(n, 0, -1):
cnt = sum(b[j - 1] for j in range(i + i, n + 1, i))
b[i - 1] = int(a[i - 1] != cnt % 2)
print(sum(b))
if sum(b) > 0:
print(*[i + 1 for i in range(n) if b[i] == 1])
| n = int(input())
a = list(map(int, input().split()))
b = [-1] * n
for i in range(n, 0, -1):
cnt = sum(b[j - 1] for j in range(i + i, n + 1, i))
b[i - 1] = int(a[i - 1] != cnt % 2)
print(sum(b))
if sum(b) > 0:
print(*[i + 1 for i in range(n) if b[i] == 1])
| delete | 2 | 6 | 2 | 2 | FileNotFoundError: [Errno 2] No such file or directory: 'testcase_12.in' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02972/Python/s591544264.py", line 4, in <module>
with open('testcase_12.in') as f:
FileNotFoundError: [Errno 2] No such file or directory: 'testcase_12.in'
|
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
int N;
vector<int> a, b;
int recursive(int i) {
int x = 0;
for (int k = 2; i * k <= N; k++) {
x += recursive(i * k);
}
return b[i] = (a[i] + x) & 1;
}
int main() {
cin >> N;
a = vector<int>(N + 1);
b = vector<int>(N + 1, -1);
for (int i = 1; i <= N; i++)
cin >> a[i];
recursive(1);
vector<int> ans;
for (int i = 1; i <= N; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << (i ? " " : "") << ans[i];
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
int N;
vector<int> a, b;
int recursive(int i) {
if (b[i] >= 0)
return b[i];
int x = 0;
for (int k = 2; i * k <= N; k++) {
x += recursive(i * k);
}
return b[i] = (a[i] + x) & 1;
}
int main() {
cin >> N;
a = vector<int>(N + 1);
b = vector<int>(N + 1, -1);
for (int i = 1; i <= N; i++)
cin >> a[i];
recursive(1);
vector<int> ans;
for (int i = 1; i <= N; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << (i ? " " : "") << ans[i];
}
cout << endl;
return 0;
} | insert | 8 | 8 | 8 | 10 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[200010], c[200010];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
c[i] = 0;
}
vector<int> v;
for (int i = n; i >= 1; i++) {
for (int j = i * 2; j <= n; j += i) {
a[i] ^= c[j];
}
c[i] = a[i];
if (c[i])
v.push_back(i);
}
cout << v.size() << endl;
for (auto t : v)
cout << t << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[200010], c[200010];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
c[i] = 0;
}
vector<int> v;
for (int i = n; i >= 1; i--) {
for (int j = i * 2; j <= n; j += i) {
a[i] ^= c[j];
}
c[i] = a[i];
if (c[i])
v.push_back(i);
}
cout << v.size() << endl;
for (auto t : v)
cout << t << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | -11 | |
p02972 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
int b[N + 1];
vector<int> v;
a[0] = 0;
b[0] = 0;
int count = 0;
int tmp = 0;
for (int i = 0; i < N; i++) {
a[i + 1] = 0;
b[i + 1] = 0;
cin >> a[i + 1];
if (i >= N / 2) {
b[i + 1] = a[i + 1];
if (b[i + 1] == 1) {
count++;
v.push_back(i + 1);
}
}
}
for (int i = N / 2; i > 0; i--) {
// cout << a[i];
int total = 0;
for (int j = i + 1; j < N + 1; j++) {
if (j % i == 0)
total += b[j];
// cout << total << endl;
}
b[i] = (total + a[i]) % 2;
if (b[i] == 1) {
count++;
v.push_back(i);
}
}
cout << count << endl;
// for(int i=0;i<N;i++){
// cout << b[i+1];
// }
if (count > 0) {
for (int i = 0; i < count; i++) {
cout << v[i] << " ";
}
}
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
int b[N + 1];
vector<int> v;
a[0] = 0;
b[0] = 0;
int count = 0;
int tmp = 0;
for (int i = 0; i < N; i++) {
a[i + 1] = 0;
b[i + 1] = 0;
cin >> a[i + 1];
if (i >= N / 2) {
b[i + 1] = a[i + 1];
if (b[i + 1] == 1) {
count++;
v.push_back(i + 1);
}
}
}
for (int i = N / 2; i > 0; i--) {
// cout << a[i];
int total = 0;
int base = 1;
while (base * i <= N) {
total += b[base * i];
base++;
}
b[i] = (total + a[i]) % 2;
if (b[i] == 1) {
count++;
v.push_back(i);
}
}
cout << count << endl;
// for(int i=0;i<N;i++){
// cout << b[i+1];
// }
if (count > 0) {
for (int i = 0; i < count; i++) {
cout << v[i] << " ";
}
}
}
| replace | 35 | 39 | 35 | 39 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j * i < n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
for (int i : ans)
cout << i << 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>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
for (int i : ans)
cout << i << endl;
return 0;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int a[200005];
int b[200005];
int main() {
int n;
cin >> n;
int tmp;
int ans;
int count = 0;
for (int i = 1; i < n + 1; i++)
cin >> a[i];
for (int i = n; i >= 0; i--) {
tmp = i;
ans = 0;
while (tmp <= n) {
ans += b[tmp];
tmp += i;
}
if (ans % 2 != a[i]) {
b[i]++;
count++;
}
}
cout << count << endl;
for (int i = 1; i < n + 1; i++)
if (b[i] > 0)
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int a[200005];
int b[200005];
int main() {
int n;
cin >> n;
int tmp;
int ans;
int count = 0;
for (int i = 1; i < n + 1; i++)
cin >> a[i];
for (int i = n; i > 0; i--) {
tmp = i;
ans = 0;
while (tmp <= n) {
ans += b[tmp];
tmp += i;
}
if (ans % 2 != a[i]) {
b[i]++;
count++;
}
}
cout << count << endl;
for (int i = 1; i < n + 1; i++)
if (b[i] > 0)
cout << i << endl;
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
long long N;
cin >> N;
vector<int> a(N); // amari
REP(i, N) { cin >> a[i]; }
vector<int> b(N, 0);
// cout << N / 2 << endl;
for (int i = N - 1; i > N / 2 - 1; i--) {
b[i] = a[i];
// cout << "i+1" << i + 1 << " b;" << b[i] << endl;
}
// cout << "maji" << endl;
for (int i = N / 2 - 1; i >= 0; i--) {
int tmp = 0;
for (int j = 2 * (i + 1); j * (i + 1) <= N; j += (i + 1)) {
tmp += b[j - 1];
}
if (tmp % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
}
// cout << "maji" << endl;
cout << accumulate(b.begin(), b.end(), 0) << endl;
REP(i, N) {
if (b[i] > 0) {
cout << i + 1 << " ";
}
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
long long N;
cin >> N;
vector<int> a(N); // amari
REP(i, N) { cin >> a[i]; }
vector<int> b(N, 0);
// cout << N / 2 << endl;
for (int i = N - 1; i > N / 2 - 1; i--) {
b[i] = a[i];
// cout << "i+1" << i + 1 << " b;" << b[i] << endl;
}
// cout << "maji" << endl;
for (int i = N / 2 - 1; i >= 0; i--) {
int tmp = 0;
for (int j = 2 * (i + 1); j <= N; j += (i + 1)) {
tmp += b[j - 1];
}
if (tmp % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
}
// cout << "maji" << endl;
cout << accumulate(b.begin(), b.end(), 0) << endl;
REP(i, N) {
if (b[i] > 0) {
cout << i + 1 << " ";
}
}
cout << endl;
return 0;
} | replace | 46 | 47 | 46 | 47 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int a[200010];
int b[200010];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
b[i] = a[i];
}
for (int i = n; i >= 0; --i) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i]) {
b[i] ^= 1;
}
}
for (int i = 1; i <= n; ++i) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i]) {
cout << -1 << endl;
return 0;
}
}
int m = 0;
for (int i = 1; i <= n; ++i) {
if (b[i] == 1)
m++;
}
cout << m << endl;
for (int i = 1; i <= n; ++i) {
if (b[i] == 1)
cout << i << " ";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a[200010];
int b[200010];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
b[i] = a[i];
}
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i]) {
b[i] ^= 1;
}
}
for (int i = 1; i <= n; ++i) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i]) {
cout << -1 << endl;
return 0;
}
}
int m = 0;
for (int i = 1; i <= n; ++i) {
if (b[i] == 1)
m++;
}
cout << m << endl;
for (int i = 1; i <= n; ++i) {
if (b[i] == 1)
cout << i << " ";
}
return 0;
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979323846;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<int> b(N, 0);
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = i + 1; j < N; j++) {
if ((j + 1) % (i + 1) == 0)
sum += b[j];
}
if (sum % 2 == 0 && a[i] % 2 != 0)
b[i] = 1;
else if (sum % 2 != 0 && a[i] % 2 == 0)
b[i] = 1;
else
b[i] = 0;
}
int M = 0;
for (int i = 0; i < N; i++) {
if (b[i] == 1)
M++;
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (b[i] == 1)
cout << i + 1 << " ";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979323846;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<int> b(N, 0);
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = i; j < N; j += i + 1)
sum += b[j];
if (sum % 2 == 0 && a[i] % 2 != 0)
b[i] = 1;
else if (sum % 2 != 0 && a[i] % 2 == 0)
b[i] = 1;
else
b[i] = 0;
}
int M = 0;
for (int i = 0; i < N; i++) {
if (b[i] == 1)
M++;
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (b[i] == 1)
cout << i + 1 << " ";
}
cout << endl;
return 0;
} | replace | 19 | 23 | 19 | 21 | TLE | |
p02972 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, end) rep2(i, 0, (end))
#define rep2(i, beg, end) for (int i = (beg); i < (end); i++)
#define all(cont) begin(cont), end(cont)
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> pii;
typedef pair<ll, string> pis;
typedef pair<string, ll> psi;
string gets(bool skipnewline);
vi get_n_array(int n);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a = get_n_array(n);
vi b(n, 0);
ll cnt = 0;
for (int i = n; i >= 1; i--) {
ll s = 0;
for (int mul = 2; i * mul <= n; mul++) {
s += b[(i * mul) - 1];
}
int x;
if (s % 2 == 0) { // even
x = a[i - 1];
} else { // odd
x = 1 - a[i - 1];
}
if (x) {
b[i - 1] = x;
cnt++;
}
}
cout << cnt << endl;
if (cnt > 0) {
for (int i = 0; i < n; i++) {
if (b[i] != 0) {
cout << i + 1 + " ";
}
}
cout << endl;
}
return 0;
}
string gets(bool skipToNextline) {
if (skipToNextline)
gets(false);
const int LINE_MAX = 1024;
char buf[LINE_MAX];
cin.getline(buf, sizeof(buf));
return buf;
}
vi get_n_array(int n) {
vi v;
while (n-- > 0) {
int x;
cin >> x;
v.push_back(x);
}
return v;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, end) rep2(i, 0, (end))
#define rep2(i, beg, end) for (int i = (beg); i < (end); i++)
#define all(cont) begin(cont), end(cont)
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> pii;
typedef pair<ll, string> pis;
typedef pair<string, ll> psi;
string gets(bool skipnewline);
vi get_n_array(int n);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a = get_n_array(n);
vi b(n, 0);
ll cnt = 0;
for (int i = n; i >= 1; i--) {
ll s = 0;
for (int mul = 2; i * mul <= n; mul++) {
s += b[(i * mul) - 1];
}
int x;
if (s % 2 == 0) { // even
x = a[i - 1];
} else { // odd
x = 1 - a[i - 1];
}
if (x) {
b[i - 1] = x;
cnt++;
}
}
cout << cnt << endl;
if (cnt > 0) {
for (int i = 0; i < n; i++) {
if (b[i]) {
cout << i + 1 << " ";
}
}
cout << endl;
}
return 0;
}
string gets(bool skipToNextline) {
if (skipToNextline)
gets(false);
const int LINE_MAX = 1024;
char buf[LINE_MAX];
cin.getline(buf, sizeof(buf));
return buf;
}
vi get_n_array(int n) {
vi v;
while (n-- > 0) {
int x;
cin >> x;
v.push_back(x);
}
return v;
} | replace | 53 | 55 | 53 | 55 | 0 | |
p02973 | C++ | Runtime Error | #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;
}
| replace | 57 | 58 | 57 | 58 | 0 | |
p02973 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep0(n) for (int counter = 0; counter < (int)(n); counter++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define ALL(obj) obj.begin(), obj.end()
#define from1(obj) obj.begin() + 1, obj.end()
#define db(x) cerr << #x << ":" << (x) << " "
#define dbl(x) cerr << #x << ":" << (x) << "\n"
#define db2(x, y) cerr << #x << ":" << (x) << ", " << #y << ":" << (y) << " "
#define db2l(x, y) cerr << #x << ":" << (x) << ", " << #y << ":" << (y) << "\n"
#define dbl2(x, y) cerr << #x << ":" << (x) << "\n" << #y << ":" << (y) << "\n"
#define db3(x, y, z) \
cerr << #x << ":" << (x) << ", " << #y << ":" << (y) << " " << #z << ":" \
<< (z) << " "
#define db3l(x, y, z) \
cerr << #x << ":" << (x) << ", " << #y << ":" << (y) << ", " << #z << ":" \
<< (z) << "\n"
#define dbl3(x, y, z) \
cerr << #x << ":" << (x) << "\n" \
<< #y << ":" << (y) << "\n" \
<< #z << ":" << (z) << "\n"
#define dbp(p) cerr << #p << ":(" << p.first << ", " << p.second << ") "
#define dbpl(p) cerr << #p << ":(" << p.first << ", " << p.second << ")\n"
#define dbt3(t3) \
cerr << #t3 << ":(" << get<0>(t3) << ", " << get<1>(t3) << ", " \
<< get<2>(t3) << ") "
#define dbt3l(t3) \
cerr << #t3 << ":(" << get<0>(t3) << ", " << get<1>(t3) << ", " \
<< get<2>(t3) << ")\n"
#define dbt4(t4) \
cerr << #t4 << ":(" << get<0>(t4) << ", " << get<1>(t4) << ", " \
<< get<2>(t4) << ", " << get<3>(t4) << ") "
#define dbt4l(t4) \
cerr << #t4 << ":(" << get<0>(t4) << ", " << get<1>(t4) << ", " \
<< get<2>(t4) << ", " << get<3>(t4) << ")\n"
#define dbv(vec) \
cerr << #vec << ":{ "; \
for (auto e : vec) \
cerr << e << ", "; \
cerr << "}\n"
#define dbvp(vec) \
cerr << #vec << ":{ "; \
for (auto p : vec) \
cerr << "(" << p.first << ", " << p.second << "), "; \
cerr << "}\n"
#define dbvv(vv) \
cerr << #vv << ":{\n"; \
for (auto vec : vv) { \
cerr << "{ "; \
for (auto e : vec) \
cerr << e << ", "; \
cerr << "}\n"; \
} \
cerr << "}\n"
#define dbm(map) \
cerr << #map << ":{ "; \
for (auto p : map) \
cerr << "(" << p.first << ", " << p.second << "), "; \
cerr << "}\n"
#define YN(f) cout << (f ? "YES" : "NO") << "\n"
#define Yn(f) cout << (f ? "Yes" : "No") << "\n"
#define yn(f) cout << (f ? "yes" : "no") << "\n"
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using ti3 = tuple<int, int, int>;
using tl3 = tuple<ll, ll, ll>;
using ti4 = tuple<int, int, int, int>;
using tl4 = tuple<ll, ll, ll, ll>;
using mii = map<int, int>;
using mil = map<int, ll>;
using mli = map<ll, int>;
using mll = map<ll, ll>;
int main() {
// a[i]は0-ind, dp[j]は1-ind
const int INF = 1e9 + 7;
int N;
cin >> N;
vector<int> A(N);
rep3(i, N - 1, -1) cin >> A[i];
// dbv(A);
vi dp(N + 1, INF);
dp[0] = -INF;
rep(i, N) {
int j = upper_bound(ALL(dp), A[i]) - dp.begin();
dp[j] = A[i];
// db(i); dbv(dp);
}
cout << lower_bound(ALL(dp), INF) - dp.begin() - 1 << endl;
}
| // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep0(n) for (int counter = 0; counter < (int)(n); counter++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define ALL(obj) obj.begin(), obj.end()
#define from1(obj) obj.begin() + 1, obj.end()
#define db(x) cerr << #x << ":" << (x) << " "
#define dbl(x) cerr << #x << ":" << (x) << "\n"
#define db2(x, y) cerr << #x << ":" << (x) << ", " << #y << ":" << (y) << " "
#define db2l(x, y) cerr << #x << ":" << (x) << ", " << #y << ":" << (y) << "\n"
#define dbl2(x, y) cerr << #x << ":" << (x) << "\n" << #y << ":" << (y) << "\n"
#define db3(x, y, z) \
cerr << #x << ":" << (x) << ", " << #y << ":" << (y) << " " << #z << ":" \
<< (z) << " "
#define db3l(x, y, z) \
cerr << #x << ":" << (x) << ", " << #y << ":" << (y) << ", " << #z << ":" \
<< (z) << "\n"
#define dbl3(x, y, z) \
cerr << #x << ":" << (x) << "\n" \
<< #y << ":" << (y) << "\n" \
<< #z << ":" << (z) << "\n"
#define dbp(p) cerr << #p << ":(" << p.first << ", " << p.second << ") "
#define dbpl(p) cerr << #p << ":(" << p.first << ", " << p.second << ")\n"
#define dbt3(t3) \
cerr << #t3 << ":(" << get<0>(t3) << ", " << get<1>(t3) << ", " \
<< get<2>(t3) << ") "
#define dbt3l(t3) \
cerr << #t3 << ":(" << get<0>(t3) << ", " << get<1>(t3) << ", " \
<< get<2>(t3) << ")\n"
#define dbt4(t4) \
cerr << #t4 << ":(" << get<0>(t4) << ", " << get<1>(t4) << ", " \
<< get<2>(t4) << ", " << get<3>(t4) << ") "
#define dbt4l(t4) \
cerr << #t4 << ":(" << get<0>(t4) << ", " << get<1>(t4) << ", " \
<< get<2>(t4) << ", " << get<3>(t4) << ")\n"
#define dbv(vec) \
cerr << #vec << ":{ "; \
for (auto e : vec) \
cerr << e << ", "; \
cerr << "}\n"
#define dbvp(vec) \
cerr << #vec << ":{ "; \
for (auto p : vec) \
cerr << "(" << p.first << ", " << p.second << "), "; \
cerr << "}\n"
#define dbvv(vv) \
cerr << #vv << ":{\n"; \
for (auto vec : vv) { \
cerr << "{ "; \
for (auto e : vec) \
cerr << e << ", "; \
cerr << "}\n"; \
} \
cerr << "}\n"
#define dbm(map) \
cerr << #map << ":{ "; \
for (auto p : map) \
cerr << "(" << p.first << ", " << p.second << "), "; \
cerr << "}\n"
#define YN(f) cout << (f ? "YES" : "NO") << "\n"
#define Yn(f) cout << (f ? "Yes" : "No") << "\n"
#define yn(f) cout << (f ? "yes" : "no") << "\n"
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using ti3 = tuple<int, int, int>;
using tl3 = tuple<ll, ll, ll>;
using ti4 = tuple<int, int, int, int>;
using tl4 = tuple<ll, ll, ll, ll>;
using mii = map<int, int>;
using mil = map<int, ll>;
using mli = map<ll, int>;
using mll = map<ll, ll>;
int main() {
// a[i]は0-ind, dp[j]は1-ind
const int INF = 1e9 + 7;
int N;
cin >> N;
vector<int> A(N);
rep3(i, N - 1, -1) cin >> A[i];
// dbv(A);
vi dp(N + 1, INF);
dp[0] = -INF;
rep(i, N) {
int j = upper_bound(ALL(dp), A[i]) - dp.begin();
dp[j] = A[i];
// db(i); dbv(dp);
}
cout << lower_bound(ALL(dp), INF) - dp.begin() - 1 << endl;
}
| replace | 0 | 1 | 0 | 1 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void nibutan(vector<int> &dp, int le, int ri, int c) {
if (ri - le == 1) {
dp[ri] = c;
return;
}
if (dp[(ri * le) / 2] < c) {
nibutan(dp, le, (le + ri) / 2, c);
} else {
nibutan(dp, (le + ri) / 2, ri, c);
}
}
int main() {
int n;
cin >> n;
vector<int> da(n);
for (int i = 0; i < n; i++) {
cin >> da[i];
}
vector<int> dp(1);
dp[0] = da[0];
int ans = 1;
for (int i = 1; i < n; i++) {
if (dp[ans - 1] >= da[i]) {
dp.push_back(da[i]);
ans++;
} else {
nibutan(dp, -1, ans - 1, da[i]);
}
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void nibutan(vector<int> &dp, int le, int ri, int c) {
if (ri - le == 1) {
dp[ri] = c;
return;
}
if (dp[(ri + le) / 2] < c) {
nibutan(dp, le, (le + ri) / 2, c);
} else {
nibutan(dp, (le + ri) / 2, ri, c);
}
}
int main() {
int n;
cin >> n;
vector<int> da(n);
for (int i = 0; i < n; i++) {
cin >> da[i];
}
vector<int> dp(1);
dp[0] = da[0];
int ans = 1;
for (int i = 1; i < n; i++) {
if (dp[ans - 1] >= da[i]) {
dp.push_back(da[i]);
ans++;
} else {
nibutan(dp, -1, ans - 1, da[i]);
}
}
cout << ans << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll;
using namespace std;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
static const int MAX = 100;
static const int INF = (1 << 23);
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
vector<ll> a(n);
// priority_queue<pair<ll,int>> q;
rep(i, n) { cin >> a[i]; }
// sort(a.begin(),a.end());
multiset<ll> p;
p.insert(a[0]);
for (int i = 1; i < n; i++) {
// sort(p.begin(),p.end());
auto c = lower_bound(p.begin(), p.end(), a[i]);
// cout<< (c-p.begin())<<"c"<<endl;
if (c == p.begin()) {
p.insert(a[i]);
} else {
c--;
p.erase(c);
p.insert(a[i]);
}
// rep(i,p.size())cout<<p[i];
// cout<<endl;
}
cout << p.size() << endl;
return 0;
}
| #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll;
using namespace std;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
static const int MAX = 100;
static const int INF = (1 << 23);
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
vector<ll> a(n);
// priority_queue<pair<ll,int>> q;
rep(i, n) { cin >> a[i]; }
// sort(a.begin(),a.end());
multiset<ll> p;
p.insert(a[0]);
for (int i = 1; i < n; i++) {
// sort(p.begin(),p.end());
auto c = p.lower_bound(a[i]);
// cout<< (c-p.begin())<<"c"<<endl;
if (c == p.begin()) {
p.insert(a[i]);
} else {
c--;
p.erase(c);
p.insert(a[i]);
}
// rep(i,p.size())cout<<p[i];
// cout<<endl;
}
cout << p.size() << endl;
return 0;
}
| replace | 42 | 43 | 42 | 43 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
int N;
vector<int> A;
int main() {
cin >> N;
A.resize(N);
rep(i, N) cin >> A[i];
multiset<int> v;
v.insert(A[0]);
for (int i = 1; i < N; i++) {
if (*v.begin() < A[i]) {
auto it = lower_bound(v.begin(), v.end(), A[i]);
it--;
v.erase(it);
}
v.insert(A[i]);
}
cout << v.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
int N;
vector<int> A;
int main() {
cin >> N;
A.resize(N);
rep(i, N) cin >> A[i];
multiset<int> v;
v.insert(A[0]);
for (int i = 1; i < N; i++) {
if (*v.begin() < A[i]) {
auto it = v.lower_bound(A[i]);
it--;
v.erase(it);
}
v.insert(A[i]);
}
cout << v.size() << endl;
return 0;
}
| replace | 18 | 19 | 18 | 19 | TLE | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<int>> v;
multiset<int> s;
vector<int> id(n);
rep(i, n) {
auto it = s.lower_bound(a[i]);
if (it == s.begin()) {
id[a[i]] = v.size();
v.push_back(vector<int>{a[i]});
s.insert(a[i]);
} else {
--it;
id[a[i]] = id[*it];
v[id[a[i]]].push_back(a[i]);
s.erase(s.find(*it));
s.insert(a[i]);
}
}
int ans = v.size();
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<int>> v;
multiset<int> s;
map<int, int> id;
rep(i, n) {
auto it = s.lower_bound(a[i]);
if (it == s.begin()) {
id[a[i]] = v.size();
v.push_back(vector<int>{a[i]});
s.insert(a[i]);
} else {
--it;
id[a[i]] = id[*it];
v[id[a[i]]].push_back(a[i]);
s.erase(s.find(*it));
s.insert(a[i]);
}
}
int ans = v.size();
cout << ans << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using P = std::pair<ll, ll>;
#define rep(i, a, b) for (ll(i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(i) std::cout << i << "\n"
const int INF = 100000000;
const ll MOD = 1000000007;
ll pow_mod(ll x, ll y, ll mod) {
if (y == 0)
return 1;
if (y % 2) {
return (x * pow_mod(x, y - 1, mod)) % mod;
} else {
return pow_mod(x * x, y / 2, mod);
}
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
// 問題文中の添え字が0-indexか1-indexか確認!
ll n;
std::cin >> n;
std::vector<ll> a(n), seq;
rep(i, 0, n) { std::cin >> a[i]; }
seq.push_back(a[0]);
rep(i, 1, n) {
if (a[i] <= seq[0]) {
seq.push_back(a[i]);
std::sort(all(seq));
} else {
auto itr = std::lower_bound(all(seq), a[i]);
itr--;
*itr = a[i];
}
}
std::cout << seq.size();
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using P = std::pair<ll, ll>;
#define rep(i, a, b) for (ll(i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(i) std::cout << i << "\n"
const int INF = 100000000;
const ll MOD = 1000000007;
ll pow_mod(ll x, ll y, ll mod) {
if (y == 0)
return 1;
if (y % 2) {
return (x * pow_mod(x, y - 1, mod)) % mod;
} else {
return pow_mod(x * x, y / 2, mod);
}
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
// 問題文中の添え字が0-indexか1-indexか確認!
ll n;
std::cin >> n;
std::vector<ll> a(n), seq;
rep(i, 0, n) { std::cin >> a[i]; }
seq.push_back(a[0]);
rep(i, 1, n) {
if (a[i] <= seq[0]) {
seq.insert(seq.begin(), a[i]);
} else {
auto itr = std::lower_bound(all(seq), a[i]);
itr--;
*itr = a[i];
}
}
std::cout << seq.size();
return 0;
} | replace | 47 | 49 | 47 | 48 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
int a[200010];
multiset<int> s;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
s.insert(a[1]);
for (int i = 2; i <= n; i++) {
if (a[i] <= *s.begin())
s.insert(a[i]);
else {
auto x = s.insert(a[i]);
while (*x == a[i])
x--;
s.erase(x);
}
}
printf("%d\n", s.size());
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
int a[200010];
multiset<int> s;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
s.insert(a[1]);
for (int i = 2; i <= n; i++) {
if (a[i] <= *s.begin())
s.insert(a[i]);
else {
s.insert(a[i]);
auto x = s.lower_bound(a[i]);
while (*x == a[i])
x--;
s.erase(x);
}
}
printf("%d\n", s.size());
} | replace | 16 | 17 | 16 | 18 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
template <typename T>
typename std::vector<T>::iterator insert_sorted(std::vector<T> &vec,
T const &item) {
return vec.insert(std::upper_bound(vec.begin(), vec.end(), item), item);
}
int main() {
int n;
cin >> n;
map<int, int> maxes;
vector<int> roots;
// vector< vector<int>> g;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
v = -1 * v;
if (roots.size() <= 0) {
roots.push_back(v);
// maxes[v] = v;
continue;
}
// sort(roots.begin(), roots.end());
auto index = upper_bound(roots.begin(), roots.end(), v);
if (index != roots.end()) {
roots.erase(index - 1);
}
insert_sorted(roots, v);
// for(auto r : roots) {
// cout << r << " ";
// }
// cout << endl;
// bool f = true;
// for(int r : roots) {
// if( maxes[r] < v ) {
// maxes[r] = v;
// f = false;
// break;
// }
// }
// if(f){
// roots.push_back(v);
// maxes[v] = v;
// }
}
cout << roots.size() << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
template <typename T>
typename std::vector<T>::iterator insert_sorted(std::vector<T> &vec,
T const &item) {
return vec.insert(std::upper_bound(vec.begin(), vec.end(), item), item);
}
int main() {
int n;
cin >> n;
map<int, int> maxes;
vector<int> roots;
// vector< vector<int>> g;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
v = -1 * v;
if (roots.size() <= 0) {
roots.push_back(v);
// maxes[v] = v;
continue;
}
// sort(roots.begin(), roots.end());
auto index = upper_bound(roots.begin(), roots.end(), v);
if (index != roots.end()) {
roots.erase(index);
}
insert_sorted(roots, v);
// for(auto r : roots) {
// cout << r << " ";
// }
// cout << endl;
// bool f = true;
// for(int r : roots) {
// if( maxes[r] < v ) {
// maxes[r] = v;
// f = false;
// break;
// }
// }
// if(f){
// roots.push_back(v);
// maxes[v] = v;
// }
}
cout << roots.size() << endl;
} | replace | 37 | 38 | 37 | 38 | -6 | free(): invalid pointer
|
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
vector<int> v(n);
REP(i, n) cin >> v[i];
vector<int> w;
REP(i, n) {
int ub = lower_bound(ALL(w), v[i]) - w.begin() - 1;
if (ub < 0) {
w.insert(w.begin(), v[i]);
} else {
w[ub] = v[i];
}
sort(ALL(w));
}
int ans = w.size();
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
vector<int> v(n);
REP(i, n) cin >> v[i];
vector<int> w;
REP(i, n) {
int ub = lower_bound(ALL(w), v[i]) - w.begin() - 1;
if (ub < 0) {
w.insert(w.begin(), v[i]);
} else {
w[ub] = v[i];
}
}
int ans = w.size();
cout << ans << endl;
return 0;
}
| delete | 25 | 26 | 25 | 25 | TLE | |
p02973 | C++ | Runtime Error | #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;
} | replace | 91 | 92 | 91 | 92 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
multiset<ll> mp;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
auto itr = lower_bound(mp.begin(), mp.end(), a);
if (itr == mp.begin()) {
mp.insert(a);
} else {
itr--;
mp.erase(itr);
mp.insert(a);
}
}
cout << (ll)mp.size() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
multiset<ll> mp;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
auto itr = mp.lower_bound(a);
if (itr == mp.begin()) {
mp.insert(a);
} else {
itr--;
mp.erase(itr);
mp.insert(a);
}
}
cout << (ll)mp.size() << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int p = 1000000007;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define sor(v) sort(v.begin(), v.end())
#define mmax(a, b) a = max(a, b)
#define mmin(a, b) a = min(a, b)
#define mkp make_pair
#define pin pair<int, int>
#define qin pair<pin, int>
#define V vector
#define Endl endl
#define veb vector<bool>
#define sq(a) (a) * (a)
#define rev(s) reverse(s.begin(), s.end())
#define end_pr(s) \
cout << s << endl; \
return 0
#define itn int
#define bs bitset<5001>
int kai_size = 1000001;
vel kai(kai_size, 1);
vel ink(kai_size, 1);
vel dist;
signed main() {
int n;
cin >> n;
V<pin> a(n);
rep(i, n) {
int x;
cin >> x;
a[i] = mkp(x, -i);
}
sor(a);
vel b(n);
rep(i, n) { b[-a[i].second] = i; }
set<int> se;
se.insert(-b[0]);
for (int i = 1; i < n; i++) {
auto itr = lower_bound(se.begin(), se.end(), -b[i]);
if (itr == se.end()) {
se.insert(-b[i]);
} else {
se.erase(itr);
se.insert(-b[i]);
}
}
cout << se.size() << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int p = 1000000007;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define sor(v) sort(v.begin(), v.end())
#define mmax(a, b) a = max(a, b)
#define mmin(a, b) a = min(a, b)
#define mkp make_pair
#define pin pair<int, int>
#define qin pair<pin, int>
#define V vector
#define Endl endl
#define veb vector<bool>
#define sq(a) (a) * (a)
#define rev(s) reverse(s.begin(), s.end())
#define end_pr(s) \
cout << s << endl; \
return 0
#define itn int
#define bs bitset<5001>
int kai_size = 1000001;
vel kai(kai_size, 1);
vel ink(kai_size, 1);
vel dist;
signed main() {
int n;
cin >> n;
V<pin> a(n);
rep(i, n) {
int x;
cin >> x;
a[i] = mkp(x, -i);
}
sor(a);
vel b(n);
rep(i, n) { b[-a[i].second] = i; }
set<int> se;
se.insert(-b[0]);
for (int i = 1; i < n; i++) {
auto itr = se.lower_bound(-b[i]);
if (itr == se.end()) {
se.insert(-b[i]);
} else {
se.erase(itr);
se.insert(-b[i]);
}
}
cout << se.size() << endl;
return 0;
} | replace | 52 | 53 | 52 | 53 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> A(N);
Rep(i, N) { cin >> A[i]; }
multiset<ll> color;
Rep(i, N) {
auto itr = color.upper_bound(-A[i]);
// if (itr != color.end()) {
// color.erase(*itr);
// }
color.erase(itr);
color.insert(-A[i]);
// for (auto itr = color.begin(); itr != color.end(); itr++) {
// cout << -*itr << " ";
// }
// cout << "\n";
}
// for (auto itr = color.begin(); itr != color.end(); itr++) {
// cout << -*itr << " ";
// }
// cout << "\n";
cout << color.size() << "\n";
}
| #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> A(N);
Rep(i, N) { cin >> A[i]; }
multiset<ll> color;
Rep(i, N) {
auto itr = color.upper_bound(-A[i]);
// cout << *itr << "\n";
if (itr != color.end()) {
color.erase(itr);
}
// color.erase(*itr);
color.insert(-A[i]);
// for (auto itr = color.begin(); itr != color.end(); itr++) {
// cout << -*itr << " ";
// }
// cout << "\n";
}
// for (auto itr = color.begin(); itr != color.end(); itr++) {
// cout << -*itr << " ";
// }
// cout << "\n";
cout << color.size() << "\n";
}
| replace | 29 | 33 | 29 | 34 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2000001145
#define LINF 100000000000000007
#define MOD 1000000007
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, n) for (int i = n - 1; i >= 0; i--)
#define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define ARDEB(i, X) cout << #X << "[" << i << "]: " << X[i] << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define ARDEB(i, X) \
{}
#define END \
{}
#endif
int ceil2(int a, int b) {
if (a % b) {
return a / b + 1;
} else {
return a / b;
}
}
// typedef long long int ll;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
int ans;
int n, m;
int a[111111];
signed main() {
cin >> n;
rep(i, n) cin >> a[i];
multiset<int> s;
rep(i, n) {
auto itr = lower_bound(s.begin(), s.end(), a[i]);
if (itr == s.begin())
s.insert(a[i]);
else {
itr--;
s.erase(itr);
s.insert(a[i]);
}
}
cout << s.size() << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2000001145
#define LINF 100000000000000007
#define MOD 1000000007
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, n) for (int i = n - 1; i >= 0; i--)
#define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define ARDEB(i, X) cout << #X << "[" << i << "]: " << X[i] << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define ARDEB(i, X) \
{}
#define END \
{}
#endif
int ceil2(int a, int b) {
if (a % b) {
return a / b + 1;
} else {
return a / b;
}
}
// typedef long long int ll;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
int ans;
int n, m;
int a[111111];
signed main() {
cin >> n;
rep(i, n) cin >> a[i];
multiset<int> 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 << s.size() << endl;
}
| replace | 58 | 59 | 58 | 59 | TLE | |
p02973 | C++ | Runtime Error | /*
1. I'm the Future Red Coder :)
2. Hopefully, I'll be Yellow Soon.
*/
#include <bits/stdc++.h>
#define mod 998244353 // 1000000007
#define lim 1000000000000000007
#define lim1 18446744073709551615 // Unsigned
#define sq(a) ((a) * (a))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mms(v, i) memset(v, i, sizeof(v))
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define REPN(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> PL;
typedef pair<ll, int> PLI;
typedef pair<int, ll> PIL;
typedef pair<int, pair<int, int>> pii;
ll power(ll a, ll b, ll m = mod) {
if (b == 0)
return 1;
ll c = power(a, b >> 1, m);
c = (c * c) % m;
if (b & 1)
return (c * a) % m;
return c;
}
ll gcdll(ll a, ll b) {
if (b == 0)
return a;
return gcdll(b, a % b);
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
/*struct node {
int l,r,nq;
};
bool compare(const node& a,const node& b) {
if (a.r != b.r) return a.r<b.r;
return a.l<b.l;
}*/
/* ******* DSU START ****** */
/*
const int dsusize = (int)1e5+5;
struct node {
int data;
int rk,pn;
}dsu[dsusize];
//ll fans;
void initialize(int n) {
REP(i,1,n) {
dsu[i].data = 1;
dsu[i].rk = 0;
dsu[i].pn = i;
}
}
int fnd(int i) {
if (dsu[i].pn != i) dsu[i].pn = fnd(dsu[i].pn);
return dsu[i].pn;
}
void unn(int i,int j) {
i = fnd(i);
j = fnd(j);
if (i!=j) {
//fans -= dsu[i].data*dsu[j].data;
if (dsu[i].rk>dsu[j].rk) {
dsu[j].pn = i;
dsu[i].data += dsu[j].data;
}
else {
dsu[i].pn = j;
dsu[j].data += dsu[i].data;
if (dsu[i].rk==dsu[j].rk) {
dsu[j].rk++;
}
}
}
}
*/
/* ******* DSU END****** */
const int N = (int)2e5 + 5;
const int Q = 250;
multiset<int> s;
int a[N];
void solve() {
int n;
cin >> n;
REP(i, 1, n) { cin >> a[i]; }
s.insert(mod);
int ans = 0;
REPN(i, n, 1) {
auto it = s.upper_bound(a[i]);
if (*it == mod)
ans++;
else
s.erase(it);
s.insert(a[i]);
}
cout << ans;
}
int main() {
// freopen("class_treasurer.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T = 1;
// cin>>T;
REP(TC, 1, T) {
// cout<<"Case #"<<TC<<": ";
solve();
cout << "\n";
}
}
| /*
1. I'm the Future Red Coder :)
2. Hopefully, I'll be Yellow Soon.
*/
#include <bits/stdc++.h>
#define mod 1000000007
#define lim 1000000000000000007
#define lim1 18446744073709551615 // Unsigned
#define sq(a) ((a) * (a))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mms(v, i) memset(v, i, sizeof(v))
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define REPN(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> PL;
typedef pair<ll, int> PLI;
typedef pair<int, ll> PIL;
typedef pair<int, pair<int, int>> pii;
ll power(ll a, ll b, ll m = mod) {
if (b == 0)
return 1;
ll c = power(a, b >> 1, m);
c = (c * c) % m;
if (b & 1)
return (c * a) % m;
return c;
}
ll gcdll(ll a, ll b) {
if (b == 0)
return a;
return gcdll(b, a % b);
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
/*struct node {
int l,r,nq;
};
bool compare(const node& a,const node& b) {
if (a.r != b.r) return a.r<b.r;
return a.l<b.l;
}*/
/* ******* DSU START ****** */
/*
const int dsusize = (int)1e5+5;
struct node {
int data;
int rk,pn;
}dsu[dsusize];
//ll fans;
void initialize(int n) {
REP(i,1,n) {
dsu[i].data = 1;
dsu[i].rk = 0;
dsu[i].pn = i;
}
}
int fnd(int i) {
if (dsu[i].pn != i) dsu[i].pn = fnd(dsu[i].pn);
return dsu[i].pn;
}
void unn(int i,int j) {
i = fnd(i);
j = fnd(j);
if (i!=j) {
//fans -= dsu[i].data*dsu[j].data;
if (dsu[i].rk>dsu[j].rk) {
dsu[j].pn = i;
dsu[i].data += dsu[j].data;
}
else {
dsu[i].pn = j;
dsu[j].data += dsu[i].data;
if (dsu[i].rk==dsu[j].rk) {
dsu[j].rk++;
}
}
}
}
*/
/* ******* DSU END****** */
const int N = (int)2e5 + 5;
const int Q = 250;
multiset<int> s;
int a[N];
void solve() {
int n;
cin >> n;
REP(i, 1, n) { cin >> a[i]; }
s.insert(mod);
int ans = 0;
REPN(i, n, 1) {
auto it = s.upper_bound(a[i]);
if (*it == mod)
ans++;
else
s.erase(it);
s.insert(a[i]);
}
cout << ans;
}
int main() {
// freopen("class_treasurer.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T = 1;
// cin>>T;
REP(TC, 1, T) {
// cout<<"Case #"<<TC<<": ";
solve();
cout << "\n";
}
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 1000000007LL
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define LLINF 100000000000000005LL
#define INF (int)1e9 + 1
#define endl '\n'
#define pb push_back
// debug 도구
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N> string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}\n";
return res;
}
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:\n", debug_out(__VA_ARGS__)
// debug 도구 end
using llong = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VPII = vector<pair<int, int>>;
using VLL = vector<long long>;
using PII = pair<int, int>;
int main() {
int n;
VLL a;
cin >> n;
a = VLL(n);
rep(i, 0, n) cin >> a[i];
VLL last;
last.push_back(a[0]);
rep(i, 1, n) {
bool fail = false;
rep(j, 0, last.size()) {
if (a[i] > last[j]) {
last[j] = a[i];
fail = true;
break;
}
}
if (!fail)
last.push_back(a[i]);
sort(last.rbegin(), last.rend());
}
// debug(last);
cout << last.size();
return 0;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 1000000007LL
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define LLINF 100000000000000005LL
#define INF (int)1e9 + 1
#define endl '\n'
#define pb push_back
// debug 도구
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N> string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}\n";
return res;
}
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:\n", debug_out(__VA_ARGS__)
// debug 도구 end
using llong = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VPII = vector<pair<int, int>>;
using VLL = vector<long long>;
using PII = pair<int, int>;
int main() {
int n;
VLL a;
cin >> n;
a = VLL(n);
rep(i, 0, n) cin >> a[i];
VLL last;
last.push_back(a[0]);
rep(i, 1, n) {
bool fail = false;
rep(j, 0, last.size()) {
if (a[i] > last[j]) {
last[j] = a[i];
fail = true;
break;
}
}
if (!fail)
last.push_back(a[i]);
// debug(last);
}
// debug(last);
cout << last.size();
return 0;
} | replace | 140 | 141 | 140 | 141 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(X, S, E) for (int(X) = (S); (X) < (E); ++(X))
#define rrep(X, S, E) for (int(X) = (E)-1; (X) >= (S); --(X))
#define itrep(X, Y) for (auto(X) = (Y).begin(); (X) != (Y).end(); (X)++)
#define all(X) (X).begin(), (X).end()
#define sortDecending(X) sort(all(X), greater<ll>()) // 降順
#define sortAscending(X) sort(all(X)) // 昇順
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define print(x) cout << x << endl
#define printDouble(x) cout << fixed << setprecision(13) << x << endl
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef priority_queue<ll, vl> decendingQueue; // 降順
typedef priority_queue<ll, vl, greater<ll>> ascendingQueue; // 昇順
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll INF = 9 * 1e18;
const ll MOD = 1e9 + 7;
long long gcd(long long m, long long n) {
if (m < n)
return gcd(n, m);
if (n == 0)
return m;
return gcd(n, m % n);
}
long long lcm(long long m, long long n) {
// m * nでlong型のオーバフローを発生させないため、先に割り算から行う
return m * (n / gcd(m, n));
}
// a + b + cをprimeで割った値を返す
long long addMod(long long a, long long b) { return (a + b) % MOD; }
long long minusMod(long long a, long long b) { return (a + MOD - b) % MOD; }
long long multipleMod(long long a, long long b) { return (a * b) % MOD; }
vector<long long> SieveOfEratosthenes(int max) {
vector<long long> sieve;
vector<long long> primes;
for (int i = 1; i < max + 1; ++i) {
sieve.push_back(i);
}
sieve[0] = 0;
for (int i = 2; i < max + 1; ++i) {
if (sieve[i - 1] != 0) {
primes.push_back(sieve[i - 1]);
for (int j = 2 * sieve[i - 1]; j < max + 1; j += sieve[i - 1]) {
sieve[j - 1] = 0;
}
}
}
return primes;
}
class Combination {
private:
vector<long long> fac_;
vector<long long> finv_;
vector<long long> inv_;
long long prime_;
public:
Combination(long long n, long long prime) {
fac_ = vector<long long>(n + 1);
finv_ = vector<long long>(n + 1);
inv_ = vector<long long>(n + 1);
prime_ = prime;
fac_[0] = fac_[1] = 1;
finv_[0] = finv_[1] = 1;
inv_[1] = 1;
for (long long i = 2; i <= n; i++) {
fac_[i] = fac_[i - 1] * i % prime_;
inv_[i] = prime_ - inv_[prime_ % i] * (prime_ / i) % prime_;
finv_[i] = finv_[i - 1] * inv_[i] % prime_;
}
}
// nCk
long long getCombination(long long n, long long k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac_[n] * (finv_[k] * finv_[n - k] % prime_) % prime_;
}
};
class UnionFindTree {
private:
vector<int> par;
vector<int> rnk;
vector<int> siz;
public:
UnionFindTree(int n) {
par.assign(n, -1);
rnk.assign(n, -1);
siz.assign(n, -1);
for (int i = 0; i < n; ++i) {
par[i] = i;
rnk[i] = 0;
siz[i] = 1;
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rnk[x] < rnk[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rnk[x] == rnk[y])
++rnk[x];
}
}
int size(int x) {
x = find(x);
return siz[x];
}
};
class Edge {
public:
ll from;
ll to;
ll cost;
Edge() {}
Edge(ll from, ll to, ll cost) {
this->from = from;
this->to = to;
this->cost = cost;
}
bool operator<(const Edge &edge) const {
return cost < edge.cost; // 昇順
}
};
class Graph {
public:
ll nodes; // ノード数
vector<Edge> edges;
Graph() {}
Graph(ll nodes) { this->nodes = nodes; }
void addEdge(ll from, ll to, ll cost) {
this->edges.push_back(Edge(from, to, cost));
}
};
// クラスカル法
// 連結グラフの最小全域木を求める
class Kruskal {
private:
Graph graph;
vector<Edge> MinimumSpanningTree;
ll minimumCost;
void searchMinimumSpanningTree() {
UnionFindTree uf(graph.nodes);
sort(all(graph.edges));
itrep(edge, graph.edges) {
if (!uf.same(edge->from, edge->to)) {
uf.unite(edge->from, edge->to);
MinimumSpanningTree.push_back(*edge);
}
}
}
public:
Kruskal(Graph graph) { this->graph = graph; }
ll getMinimumSpanningTreeCost() {
searchMinimumSpanningTree();
ll cost = 0;
itrep(it, MinimumSpanningTree) { cost += it->cost; }
return cost;
}
};
// ダイクストラ法 O((E+V)logV)
// 最小経路問題を解くためのアルゴリズム。辺の重みに負数を含む場合は利用不可
class Dijkstra {
private:
Graph graph;
map<ll, vector<Edge>> fromPaths;
vl distances;
vl srcs;
public:
Dijkstra(Graph graph) {
this->graph = graph;
itrep(edge, graph.edges) {
fromPaths[edge->from].push_back(*edge);
fromPaths[edge->to].push_back(Edge(edge->to, edge->from, edge->cost));
}
}
void searchMinimumPathFrom(ll src) {
// 複数回呼ばれる度に計算する
this->distances = vl(graph.nodes + 1, INF);
this->srcs = vl(graph.nodes + 1, INF);
priority_queue<ll> pq;
distances[src] = 0;
srcs[src] = -1;
pq.push(src);
while (!pq.empty()) {
int u = pq.top();
pq.pop();
itrep(edge, fromPaths[u]) {
int v = edge->to;
int w = edge->cost;
if (distances[v] > distances[u] + w) {
distances[v] = distances[u] + w;
srcs[v] = u;
pq.push(v);
}
}
}
};
ll getDistance(ll n) { return this->distances[n]; }
ll getFrom(ll n) { return this->srcs[n]; }
};
// ベルマンフォード O(|V||E|)
// 非負コストが含まれていても最短経路問題を解くためのアルゴリズム。閉路の検出も可能
class BellmanFord {
private:
Graph graph;
// 閉路が含まれるかは個々のノードごとに管理する必要あり
vector<bool> hasNegativeCycles;
vector<ll> distances;
public:
BellmanFord(Graph graph) {
this->graph = graph;
this->distances = vector<ll>(this->graph.nodes + 1, INF);
this->hasNegativeCycles = vector<bool>(this->graph.nodes + 1, false);
}
void searchMinimumPathFrom(ll src) {
this->distances[src] = 0;
for (ll i = 0; i < graph.nodes - 1; i++) {
itrep(edge, graph.edges) {
ll u = edge->from;
ll v = edge->to;
ll w = edge->cost;
if (this->distances[u] + w < this->distances[v]) {
this->distances[v] = this->distances[u] + w;
}
}
}
itrep(edge, graph.edges) {
ll u = edge->from;
ll v = edge->to;
ll w = edge->cost;
if (this->distances[u] + w < this->distances[v]) {
this->hasNegativeCycles[v] = true;
}
if (this->hasNegativeCycles[u] == true) {
this->hasNegativeCycles[v] = true;
}
}
}
ll getDistance(ll n) { return this->distances[n]; }
bool hasNegativeCycle(ll n) { return this->hasNegativeCycles[n]; }
};
void solve(long long N, std::vector<long long> A) {
multiset<ll> colorMinNums;
rep(i, 0, N) {
auto it = lower_bound(all(colorMinNums), A[i]);
if (it == colorMinNums.begin()) {
colorMinNums.insert(A[i]);
} else {
colorMinNums.erase(--it);
colorMinNums.insert(A[i]);
}
}
print(colorMinNums.size());
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(X, S, E) for (int(X) = (S); (X) < (E); ++(X))
#define rrep(X, S, E) for (int(X) = (E)-1; (X) >= (S); --(X))
#define itrep(X, Y) for (auto(X) = (Y).begin(); (X) != (Y).end(); (X)++)
#define all(X) (X).begin(), (X).end()
#define sortDecending(X) sort(all(X), greater<ll>()) // 降順
#define sortAscending(X) sort(all(X)) // 昇順
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define print(x) cout << x << endl
#define printDouble(x) cout << fixed << setprecision(13) << x << endl
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef priority_queue<ll, vl> decendingQueue; // 降順
typedef priority_queue<ll, vl, greater<ll>> ascendingQueue; // 昇順
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll INF = 9 * 1e18;
const ll MOD = 1e9 + 7;
long long gcd(long long m, long long n) {
if (m < n)
return gcd(n, m);
if (n == 0)
return m;
return gcd(n, m % n);
}
long long lcm(long long m, long long n) {
// m * nでlong型のオーバフローを発生させないため、先に割り算から行う
return m * (n / gcd(m, n));
}
// a + b + cをprimeで割った値を返す
long long addMod(long long a, long long b) { return (a + b) % MOD; }
long long minusMod(long long a, long long b) { return (a + MOD - b) % MOD; }
long long multipleMod(long long a, long long b) { return (a * b) % MOD; }
vector<long long> SieveOfEratosthenes(int max) {
vector<long long> sieve;
vector<long long> primes;
for (int i = 1; i < max + 1; ++i) {
sieve.push_back(i);
}
sieve[0] = 0;
for (int i = 2; i < max + 1; ++i) {
if (sieve[i - 1] != 0) {
primes.push_back(sieve[i - 1]);
for (int j = 2 * sieve[i - 1]; j < max + 1; j += sieve[i - 1]) {
sieve[j - 1] = 0;
}
}
}
return primes;
}
class Combination {
private:
vector<long long> fac_;
vector<long long> finv_;
vector<long long> inv_;
long long prime_;
public:
Combination(long long n, long long prime) {
fac_ = vector<long long>(n + 1);
finv_ = vector<long long>(n + 1);
inv_ = vector<long long>(n + 1);
prime_ = prime;
fac_[0] = fac_[1] = 1;
finv_[0] = finv_[1] = 1;
inv_[1] = 1;
for (long long i = 2; i <= n; i++) {
fac_[i] = fac_[i - 1] * i % prime_;
inv_[i] = prime_ - inv_[prime_ % i] * (prime_ / i) % prime_;
finv_[i] = finv_[i - 1] * inv_[i] % prime_;
}
}
// nCk
long long getCombination(long long n, long long k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac_[n] * (finv_[k] * finv_[n - k] % prime_) % prime_;
}
};
class UnionFindTree {
private:
vector<int> par;
vector<int> rnk;
vector<int> siz;
public:
UnionFindTree(int n) {
par.assign(n, -1);
rnk.assign(n, -1);
siz.assign(n, -1);
for (int i = 0; i < n; ++i) {
par[i] = i;
rnk[i] = 0;
siz[i] = 1;
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rnk[x] < rnk[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rnk[x] == rnk[y])
++rnk[x];
}
}
int size(int x) {
x = find(x);
return siz[x];
}
};
class Edge {
public:
ll from;
ll to;
ll cost;
Edge() {}
Edge(ll from, ll to, ll cost) {
this->from = from;
this->to = to;
this->cost = cost;
}
bool operator<(const Edge &edge) const {
return cost < edge.cost; // 昇順
}
};
class Graph {
public:
ll nodes; // ノード数
vector<Edge> edges;
Graph() {}
Graph(ll nodes) { this->nodes = nodes; }
void addEdge(ll from, ll to, ll cost) {
this->edges.push_back(Edge(from, to, cost));
}
};
// クラスカル法
// 連結グラフの最小全域木を求める
class Kruskal {
private:
Graph graph;
vector<Edge> MinimumSpanningTree;
ll minimumCost;
void searchMinimumSpanningTree() {
UnionFindTree uf(graph.nodes);
sort(all(graph.edges));
itrep(edge, graph.edges) {
if (!uf.same(edge->from, edge->to)) {
uf.unite(edge->from, edge->to);
MinimumSpanningTree.push_back(*edge);
}
}
}
public:
Kruskal(Graph graph) { this->graph = graph; }
ll getMinimumSpanningTreeCost() {
searchMinimumSpanningTree();
ll cost = 0;
itrep(it, MinimumSpanningTree) { cost += it->cost; }
return cost;
}
};
// ダイクストラ法 O((E+V)logV)
// 最小経路問題を解くためのアルゴリズム。辺の重みに負数を含む場合は利用不可
class Dijkstra {
private:
Graph graph;
map<ll, vector<Edge>> fromPaths;
vl distances;
vl srcs;
public:
Dijkstra(Graph graph) {
this->graph = graph;
itrep(edge, graph.edges) {
fromPaths[edge->from].push_back(*edge);
fromPaths[edge->to].push_back(Edge(edge->to, edge->from, edge->cost));
}
}
void searchMinimumPathFrom(ll src) {
// 複数回呼ばれる度に計算する
this->distances = vl(graph.nodes + 1, INF);
this->srcs = vl(graph.nodes + 1, INF);
priority_queue<ll> pq;
distances[src] = 0;
srcs[src] = -1;
pq.push(src);
while (!pq.empty()) {
int u = pq.top();
pq.pop();
itrep(edge, fromPaths[u]) {
int v = edge->to;
int w = edge->cost;
if (distances[v] > distances[u] + w) {
distances[v] = distances[u] + w;
srcs[v] = u;
pq.push(v);
}
}
}
};
ll getDistance(ll n) { return this->distances[n]; }
ll getFrom(ll n) { return this->srcs[n]; }
};
// ベルマンフォード O(|V||E|)
// 非負コストが含まれていても最短経路問題を解くためのアルゴリズム。閉路の検出も可能
class BellmanFord {
private:
Graph graph;
// 閉路が含まれるかは個々のノードごとに管理する必要あり
vector<bool> hasNegativeCycles;
vector<ll> distances;
public:
BellmanFord(Graph graph) {
this->graph = graph;
this->distances = vector<ll>(this->graph.nodes + 1, INF);
this->hasNegativeCycles = vector<bool>(this->graph.nodes + 1, false);
}
void searchMinimumPathFrom(ll src) {
this->distances[src] = 0;
for (ll i = 0; i < graph.nodes - 1; i++) {
itrep(edge, graph.edges) {
ll u = edge->from;
ll v = edge->to;
ll w = edge->cost;
if (this->distances[u] + w < this->distances[v]) {
this->distances[v] = this->distances[u] + w;
}
}
}
itrep(edge, graph.edges) {
ll u = edge->from;
ll v = edge->to;
ll w = edge->cost;
if (this->distances[u] + w < this->distances[v]) {
this->hasNegativeCycles[v] = true;
}
if (this->hasNegativeCycles[u] == true) {
this->hasNegativeCycles[v] = true;
}
}
}
ll getDistance(ll n) { return this->distances[n]; }
bool hasNegativeCycle(ll n) { return this->hasNegativeCycles[n]; }
};
void solve(long long N, std::vector<long long> A) {
multiset<ll> colorMinNums;
rep(i, 0, N) {
auto it = colorMinNums.lower_bound(A[i]);
if (it == colorMinNums.begin()) {
colorMinNums.insert(A[i]);
} else {
colorMinNums.erase(--it);
colorMinNums.insert(A[i]);
}
}
print(colorMinNums.size());
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
| replace | 322 | 323 | 322 | 323 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, 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<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
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;
}
#define INF 1LL << 60
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
multiset<int> color_tails;
REP(i, N) {
auto itr = upper_bound(color_tails.begin(), color_tails.end(), -A[i]);
if (itr == color_tails.end()) {
color_tails.insert(-A[i]);
} else {
color_tails.erase(itr);
color_tails.insert(-A[i]);
}
}
cout << color_tails.size() << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, 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<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
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;
}
#define INF 1LL << 60
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
multiset<int> color_tails;
REP(i, N) {
auto itr = color_tails.upper_bound(-A[i]);
if (itr == color_tails.end()) {
color_tails.insert(-A[i]);
} else {
color_tails.erase(itr);
color_tails.insert(-A[i]);
}
}
cout << color_tails.size() << endl;
return 0;
}
| replace | 62 | 63 | 62 | 63 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mod 1000000007
#define fr first
#define se second
#define ll long long
#define PI 3.1415926535
#define pb push_back
#define mpr make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define senky_bansal ios_base::sync_with_stdio(false);
#define IIIT_ALLAHABAD \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
vector<ll> v[100005];
multiset<ll> st;
signed main() {
senky_bansal IIIT_ALLAHABAD
ll n;
cin >> n;
ll a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int j = 0;
for (int i = 1; i <= n; i++) {
if (i == 1) {
v[0].pb(a[i]);
j++;
st.insert(a[i]);
} else {
auto it1 = st.lower_bound(a[i]);
if (it1 == st.begin()) {
v[j].pb(a[i]);
j++;
st.insert(a[i]);
} else {
ll p = distance(st.begin(), it1);
p--;
v[p].pb(a[i]);
it1--;
st.erase(it1);
st.insert(a[i]);
}
}
}
cout << j << endl;
}
| #include <bits/stdc++.h>
#define mod 1000000007
#define fr first
#define se second
#define ll long long
#define PI 3.1415926535
#define pb push_back
#define mpr make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define senky_bansal ios_base::sync_with_stdio(false);
#define IIIT_ALLAHABAD \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
vector<ll> v[100005];
multiset<ll> st;
signed main() {
senky_bansal IIIT_ALLAHABAD
ll n;
cin >> n;
ll a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int j = 0;
for (int i = 1; i <= n; i++) {
if (i == 1) {
v[0].pb(a[i]);
j++;
st.insert(a[i]);
} else {
auto it1 = st.lower_bound(a[i]);
if (it1 == st.begin()) {
v[j].pb(a[i]);
j++;
st.insert(a[i]);
} else {
it1--;
st.erase(it1);
st.insert(a[i]);
}
}
}
cout << j << endl;
}
| delete | 39 | 42 | 39 | 39 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef priority_queue<VL> PQ_DESC_VL;
typedef priority_queue<VL, vector<VL>, greater<VL>> PQ_ASC_VL;
typedef priority_queue<PLL> PQ_DESC_PLL;
typedef priority_queue<PLL, vector<PLL>, greater<PLL>> PQ_ASC_PLL;
#define ALL(c) (c).begin(), (c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
// #define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SORT_DESC(c) sort((c).rbegin(), (c).rend())
#define REV(c) reverse((c).begin(), (c).end())
#define SIZE(a) int((a).size())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ROF(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, n)
#define PER(i, n) ROF(i, 0, n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int LARGE_INT = 1e9 + 100;
const int INF = 2e9 + 100;
const LL INF_LL = (LL)INF * (LL)INF;
const int MOD = 1e9 + 7;
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
void Main() {
int n;
cin >> n;
multiset<LL> s;
REP(i, n) {
LL a;
cin >> a;
auto itr = lower_bound(ALL(s), a);
if (itr == s.begin()) {
s.insert(a);
} else {
s.erase(--itr);
s.insert(a);
}
}
cout << s.size() << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef priority_queue<VL> PQ_DESC_VL;
typedef priority_queue<VL, vector<VL>, greater<VL>> PQ_ASC_VL;
typedef priority_queue<PLL> PQ_DESC_PLL;
typedef priority_queue<PLL, vector<PLL>, greater<PLL>> PQ_ASC_PLL;
#define ALL(c) (c).begin(), (c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
// #define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SORT_DESC(c) sort((c).rbegin(), (c).rend())
#define REV(c) reverse((c).begin(), (c).end())
#define SIZE(a) int((a).size())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ROF(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, n)
#define PER(i, n) ROF(i, 0, n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int LARGE_INT = 1e9 + 100;
const int INF = 2e9 + 100;
const LL INF_LL = (LL)INF * (LL)INF;
const int MOD = 1e9 + 7;
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
void Main() {
int n;
cin >> n;
multiset<LL> s;
REP(i, n) {
LL a;
cin >> a;
auto itr = s.lower_bound(a);
if (itr == s.begin()) {
s.insert(a);
} else {
s.erase(--itr);
s.insert(a);
}
}
cout << s.size() << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | replace | 59 | 60 | 59 | 60 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B) {
if (B == 0)
return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
using Graph = vector<vector<int>>;
Graph G;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> b;
rep(i, n) {
int a;
cin >> a;
if (b.empty()) {
b.push_back(a);
continue;
} else {
auto itr = lower_bound(b.begin(), b.end(), a);
int idx = distance(b.begin(), itr);
// cout << idx << endl;
if (idx == 0) {
b.push_back(a);
sort(b.begin(), b.end());
} else
b[idx - 1] = a;
}
}
// for(auto it : b) cout << it << endl;
cout << b.size() << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B) {
if (B == 0)
return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
using Graph = vector<vector<int>>;
Graph G;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> b;
rep(i, n) {
int a;
cin >> a;
if (b.empty()) {
b.push_back(a);
continue;
} else {
auto itr = lower_bound(b.begin(), b.end(), a);
int idx = distance(b.begin(), itr);
if (idx == 0)
b.insert(b.begin(), a);
else
b[idx - 1] = a;
}
}
// for(auto it : b) cout << it << endl;
cout << b.size() << endl;
} | replace | 36 | 41 | 36 | 39 | TLE | |
p02973 | Python | Runtime Error | from bisect import bisect
n = int(input())
ma = [-int(input()) for _ in range(n)]
ans = [ma[0]]
for ai in ma[1:]:
tmp = bisect(ans, ai)
if tmp == len(ans):
ans.append(ai)
elif tmp < len(ans):
ans[tmp] = ai
print(ans)
print(len(ans))
| from bisect import bisect
n = int(input())
ma = [-int(input()) for _ in range(n)]
ans = [ma[0]]
for ai in ma[1:]:
tmp = bisect(ans, ai)
if tmp == len(ans):
ans.append(ai)
elif tmp < len(ans):
ans[tmp] = ai
print(len(ans))
| delete | 12 | 13 | 12 | 12 | 0 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define INF 1000000000000000LL
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> results;
rep(i, n) {
auto it = lower_bound(results.begin(), results.end(), a[i]);
if (it != results.begin())
results.erase(it);
results.insert(it, a[i]);
continue;
if (it == results.end()) {
if (results.size() > 0 && a[i] > results[results.size() - 1])
results[results.size() - 1] = a[i];
else
results.insert(results.begin(), a[i]);
} else {
if (it == results.begin()) {
results.insert(results.begin(), a[i]);
} else {
*prev(it) = a[i];
}
}
// cout<<results.size()<<':';rep(i, results.size())cout<<results[i]<<'
// ';cout<<endl;
}
cout << results.size() << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define INF 1000000000000000LL
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> results;
rep(i, n) {
auto it = lower_bound(results.begin(), results.end(), a[i]);
if (it != results.begin())
*prev(it) = a[i];
else
results.insert(it, a[i]);
// cout<<results.size()<<':';rep(i, results.size())cout<<results[i]<<'
// ';cout<<endl;
}
cout << results.size() << endl;
return 0;
} | replace | 27 | 43 | 27 | 30 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, double>;
int main() {
int n;
cin >> n;
multiset<ll> ans;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll c = 1;
for (int i = n - 1; i >= 0; --i) {
if (i == n - 1) {
ans.insert(a[i]);
i--;
}
auto it = upper_bound(ans.begin(), ans.end(), a[i]);
if (it != ans.end())
ans.erase(it);
else
c++;
ans.insert(a[i]);
}
cout << c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, double>;
int main() {
int n;
cin >> n;
multiset<ll> ans;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll c = 1;
for (int i = n - 1; i >= 0; --i) {
if (i == n - 1) {
ans.insert(a[i]);
i--;
}
auto it = ans.upper_bound(a[i]);
if (it != ans.end())
ans.erase(it);
else
c++;
ans.insert(a[i]);
}
cout << c << endl;
return 0;
} | replace | 24 | 25 | 24 | 25 | TLE | |
p02973 | C++ | Time Limit Exceeded | // #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// typedef long double ld;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
constexpr ll MOD = 1e9 + 7;
// constexpr int INF = 1<<30;
// constexpr ll LINF = 1LL<<60;
#define Sort(x) sort(x.begin(), x.end())
#define Reverse(x) reverse(x.begin(), x.end())
#define ABS(a, b) ((a) < (b) ? (b) - (a) : (a) - (b))
#define nbit(n) (1ll << (n))
// sort(begin(x), end(x), greater<ll>());
// lower_bound(a.begin(), a.end(), val): a[i] ≥ valである最左の位置
// upper_bound(a.begin(), a.end(), val): a[i] > valである最左の位置
// Returns minimum of a and b.
// If a is less b, a is set to b.
template <typename T> T chmin(T &a, T b) {
if (a > b) {
a = b;
}
return a;
}
// Returns maximum of a and b.
// If a is less b, a is set to b.
template <typename T> T chmax(T &a, T b) {
if (a < b) {
a = b;
}
return a;
}
// a = (a+b)%MOD;
void addmod(ll &a, ll b) { a = (a + b) % MOD; }
template <typename T> void dumpContents(const T &v, const string &msg) {
cerr << "### " << msg << " ###\n";
for (const auto &x : v) {
cerr << x << " ";
}
cerr << endl;
}
struct before_main_function {
before_main_function() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
#define endl "\n"
}
} before_main_function;
// ========== end of template ==========
int N;
int main(int argc, char **argv) {
cin >> N;
vll A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
multiset<ll> ret;
ret.insert(A[0]);
for (int i = 1; i < N; i++) {
auto it = lower_bound(begin(ret), end(ret), A[i]);
if (it != begin(ret)) {
it--;
ret.erase(it);
}
ret.insert(A[i]);
}
cout << ret.size() << endl;
return 0;
}
| // #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// typedef long double ld;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
constexpr ll MOD = 1e9 + 7;
// constexpr int INF = 1<<30;
// constexpr ll LINF = 1LL<<60;
#define Sort(x) sort(x.begin(), x.end())
#define Reverse(x) reverse(x.begin(), x.end())
#define ABS(a, b) ((a) < (b) ? (b) - (a) : (a) - (b))
#define nbit(n) (1ll << (n))
// sort(begin(x), end(x), greater<ll>());
// lower_bound(a.begin(), a.end(), val): a[i] ≥ valである最左の位置
// upper_bound(a.begin(), a.end(), val): a[i] > valである最左の位置
// Returns minimum of a and b.
// If a is less b, a is set to b.
template <typename T> T chmin(T &a, T b) {
if (a > b) {
a = b;
}
return a;
}
// Returns maximum of a and b.
// If a is less b, a is set to b.
template <typename T> T chmax(T &a, T b) {
if (a < b) {
a = b;
}
return a;
}
// a = (a+b)%MOD;
void addmod(ll &a, ll b) { a = (a + b) % MOD; }
template <typename T> void dumpContents(const T &v, const string &msg) {
cerr << "### " << msg << " ###\n";
for (const auto &x : v) {
cerr << x << " ";
}
cerr << endl;
}
struct before_main_function {
before_main_function() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
#define endl "\n"
}
} before_main_function;
// ========== end of template ==========
int N;
int main(int argc, char **argv) {
cin >> N;
vll A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
multiset<ll> ret;
ret.insert(A[0]);
for (int i = 1; i < N; i++) {
const ll a = A[i];
auto it = ret.lower_bound(a);
if (it != begin(ret)) {
it--;
ret.erase(it);
}
ret.insert(A[i]);
}
cout << ret.size() << endl;
return 0;
}
| replace | 136 | 137 | 136 | 138 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define eb emplace_back
#define fst first
#define scd second
constexpr int mod = 1000000007;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// value
int N;
int A[100010];
int backet[100];
void solve() {
cin >> N;
multiset<int> mm;
for (int i = 0; i < N; i++) {
cin >> A[i];
auto it = lower_bound(mm.begin(), mm.end(), A[i]);
if (it != mm.begin()) {
mm.erase(--it);
}
mm.insert(A[i]);
}
cout << mm.size() << endl;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define eb emplace_back
#define fst first
#define scd second
constexpr int mod = 1000000007;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// value
int N;
int A[100010];
int backet[100];
void solve() {
cin >> N;
multiset<int> mm;
for (int i = 0; i < N; i++) {
cin >> A[i];
auto it = mm.lower_bound(A[i]);
if (it != mm.begin()) {
mm.erase(--it);
}
mm.insert(A[i]);
}
cout << mm.size() << endl;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| replace | 46 | 47 | 46 | 47 | TLE | |
p02973 | C++ | Time Limit Exceeded | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using pll = pair<ll, ll>;
using mll = map<ll, ll>;
#define EACH(x, v) for (auto &x : v)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define REFOR(i, a, b) for (ll i = (ll)b - 1; i >= (ll)a; i--)
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REREP(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mp make_pair
const ll INF = 1LL << 60;
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x <= b)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) // 被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
long double __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << endl; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
template <typename T> void in1(T &s) {
REP(i, s.size()) { in(s[i]); }
}
template <typename T> void in2(T &s, T &t) {
REP(i, s.size()) { in(s[i], t[i]); }
}
template <typename T> void in3(T &s, T &t, T &u) {
REP(i, s.size()) { in(s[i], t[i], u[i]); }
}
template <typename T> void in4(T &s, T &t, T &u, T &v) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i]); }
}
template <typename T> void in5(T &s, T &t, T &u, T &v, T &w) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i], w[i]); }
}
template <typename T> void outv(T s) {
REP(i, s.size()) { cout << s[i] << " "; }
cout << endl;
}
template <typename T> void out1(T s) {
REP(i, s.size()) { out(s[i]); }
}
template <typename T> void out2(T s, T t) {
REP(i, s.size()) { out(s[i], t[i]); }
}
template <typename T> void out3(T s, T t, T u) {
REP(i, s.size()) { out(s[i], t[i], u[i]); }
}
template <typename T> void out4(T s, T t, T u, T v) {
REP(i, s.size()) { out(s[i], t[i], u[i], v[i]); }
}
template <typename T> void out5(T s, T t, T u, T v, T w) {
REP(i, s.size()) { out(s[i], t[i], u[i], v[i], w[i]); }
}
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
template <typename T> T allSum(vector<T> a) {
T ans = T();
EACH(it, a) ans += it;
return ans;
}
ll ceilDiv(ll a, ll b) { return (a + b - 1) / b; }
ld dist(pair<ld, ld> a, pair<ld, ld> b) {
return sqrt(abs(a.fi - b.fi) * abs(a.fi - b.fi) +
abs(a.se - b.se) * abs(a.se - b.se));
} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
#define YES(n) ((n) ? "YES" : "NO")
#define Yes(n) ((n) ? "Yes" : "No")
#define yes(n) ((n) ? "yes" : "no")
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
class UnionFind {
public:
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> siz; // siz[i]:iのサイズ (例) siz[3] = 2 : 3のサイズが2
UnionFind(ll N) : par(N), siz(N, 1LL) { // 最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
bool unite(ll x, ll y) { // xとyの木を併合
x = root(x); // xの根をrx
y = root(y); // yの根をry
if (x == y)
return false; // xとyの根が同じ(=同じ木にある)時はそのまま
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] =
x; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
return true;
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
class Dag {
public:
vvl g;
vl inCnt;
vl sorted;
bool sortedF = false;
Dag(ll N) : g(N), inCnt(N) {}
void input(ll x, ll y) {
g[x].pb(y);
inCnt[y]++;
}
bool tpSort() {
vl tmp = inCnt;
deque<ll> dq;
vl ans;
REP(i, g.size()) if (tmp[i] == 0) dq.pb(i);
while (dq.size() != 0) {
ll v = dq.front();
dq.pop_front();
ans.pb(v);
EACH(it, g[v]) {
tmp[it]--;
if (tmp[it] == 0)
dq.pb(it);
}
}
sorted.swap(ans);
sortedF = true;
return sorted.size() == g.size();
}
ll longest() {
if (sortedF == false)
tpSort();
vl dp(g.size(), 0);
ll res = 0;
EACH(it1, sorted) {
EACH(it2, g[it1]) { chmax(dp[it2], dp[it1] + 1); }
chmax(res, dp[it1]);
}
return res;
}
};
bool isOK(ll d, ll key) {
if (d < key)
return true;
else
return false;
}
ll binSearch(vector<ll> a, ll key) {
ll ng = -1;
ll ok = a.size();
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
if (isOK(a[mid], key))
ok = mid;
else
ng = mid;
}
return ok;
}
int main() {
init();
inl(n);
vl a(n);
in1(a);
vl v;
v.reserve(n);
REP(i, n) {
ll j = binSearch(v, a[i]);
if (j == v.size()) {
v.pb(a[i]);
} else {
v[j] = a[i];
}
// outv(v);
}
out(v.size());
return 0;
} | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using pll = pair<ll, ll>;
using mll = map<ll, ll>;
#define EACH(x, v) for (auto &x : v)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define REFOR(i, a, b) for (ll i = (ll)b - 1; i >= (ll)a; i--)
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REREP(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mp make_pair
const ll INF = 1LL << 60;
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x <= b)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) // 被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
long double __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << endl; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
template <typename T> void in1(T &s) {
REP(i, s.size()) { in(s[i]); }
}
template <typename T> void in2(T &s, T &t) {
REP(i, s.size()) { in(s[i], t[i]); }
}
template <typename T> void in3(T &s, T &t, T &u) {
REP(i, s.size()) { in(s[i], t[i], u[i]); }
}
template <typename T> void in4(T &s, T &t, T &u, T &v) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i]); }
}
template <typename T> void in5(T &s, T &t, T &u, T &v, T &w) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i], w[i]); }
}
template <typename T> void outv(T s) {
REP(i, s.size()) { cout << s[i] << " "; }
cout << endl;
}
template <typename T> void out1(T s) {
REP(i, s.size()) { out(s[i]); }
}
template <typename T> void out2(T s, T t) {
REP(i, s.size()) { out(s[i], t[i]); }
}
template <typename T> void out3(T s, T t, T u) {
REP(i, s.size()) { out(s[i], t[i], u[i]); }
}
template <typename T> void out4(T s, T t, T u, T v) {
REP(i, s.size()) { out(s[i], t[i], u[i], v[i]); }
}
template <typename T> void out5(T s, T t, T u, T v, T w) {
REP(i, s.size()) { out(s[i], t[i], u[i], v[i], w[i]); }
}
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
template <typename T> T allSum(vector<T> a) {
T ans = T();
EACH(it, a) ans += it;
return ans;
}
ll ceilDiv(ll a, ll b) { return (a + b - 1) / b; }
ld dist(pair<ld, ld> a, pair<ld, ld> b) {
return sqrt(abs(a.fi - b.fi) * abs(a.fi - b.fi) +
abs(a.se - b.se) * abs(a.se - b.se));
} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
#define YES(n) ((n) ? "YES" : "NO")
#define Yes(n) ((n) ? "Yes" : "No")
#define yes(n) ((n) ? "yes" : "no")
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
class UnionFind {
public:
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> siz; // siz[i]:iのサイズ (例) siz[3] = 2 : 3のサイズが2
UnionFind(ll N) : par(N), siz(N, 1LL) { // 最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
bool unite(ll x, ll y) { // xとyの木を併合
x = root(x); // xの根をrx
y = root(y); // yの根をry
if (x == y)
return false; // xとyの根が同じ(=同じ木にある)時はそのまま
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] =
x; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
return true;
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
class Dag {
public:
vvl g;
vl inCnt;
vl sorted;
bool sortedF = false;
Dag(ll N) : g(N), inCnt(N) {}
void input(ll x, ll y) {
g[x].pb(y);
inCnt[y]++;
}
bool tpSort() {
vl tmp = inCnt;
deque<ll> dq;
vl ans;
REP(i, g.size()) if (tmp[i] == 0) dq.pb(i);
while (dq.size() != 0) {
ll v = dq.front();
dq.pop_front();
ans.pb(v);
EACH(it, g[v]) {
tmp[it]--;
if (tmp[it] == 0)
dq.pb(it);
}
}
sorted.swap(ans);
sortedF = true;
return sorted.size() == g.size();
}
ll longest() {
if (sortedF == false)
tpSort();
vl dp(g.size(), 0);
ll res = 0;
EACH(it1, sorted) {
EACH(it2, g[it1]) { chmax(dp[it2], dp[it1] + 1); }
chmax(res, dp[it1]);
}
return res;
}
};
bool isOK(ll d, ll key) {
if (d < key)
return true;
else
return false;
}
ll binSearch(vector<ll> &a, ll key) {
ll ng = -1;
ll ok = a.size();
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
if (isOK(a[mid], key))
ok = mid;
else
ng = mid;
}
return ok;
}
int main() {
init();
inl(n);
vl a(n);
in1(a);
vl v;
v.reserve(n);
REP(i, n) {
ll j = binSearch(v, a[i]);
if (j == v.size()) {
v.pb(a[i]);
} else {
v[j] = a[i];
}
// outv(v);
}
out(v.size());
return 0;
}
| replace | 270 | 271 | 270 | 271 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
multiset<int> mul;
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
auto indx = lower_bound(mul.begin(), mul.end(), temp);
if (indx != mul.begin()) {
indx--;
mul.erase(indx);
mul.insert(temp);
} else
mul.insert(temp);
}
cout << (int)mul.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
multiset<int> mul;
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
auto indx = mul.lower_bound(temp);
if (indx != mul.begin()) {
indx--;
mul.erase(indx);
mul.insert(temp);
} else
mul.insert(temp);
}
cout << (int)mul.size() << endl;
return 0;
}
| replace | 14 | 15 | 14 | 15 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ll long long
#define eps 1e-7
#define all(x) ((x).begin()), ((x).end())
#define usecppio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
using pii = pair<int, int>;
#define MAXN 100000
vector<int> sequence;
int n, ldslen;
multiset<int> decrease;
void find_lds() {
for (int i = 0; i < n; i++) {
auto it = lower_bound(all(decrease), sequence[i]);
if (it == decrease.begin())
decrease.insert(sequence[i]);
else {
--it;
decrease.erase(it);
decrease.insert(sequence[i]);
}
}
ldslen = decrease.size();
}
int main() {
usecppio cin >> n;
sequence.resize(n);
for (int i = 0; i < n; i++)
cin >> sequence[i];
find_lds();
cout << ldslen;
} | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ll long long
#define eps 1e-7
#define all(x) ((x).begin()), ((x).end())
#define usecppio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
using pii = pair<int, int>;
#define MAXN 100000
vector<int> sequence;
int n, ldslen;
multiset<int> decrease;
void find_lds() {
for (int i = 0; i < n; i++) {
auto it = decrease.lower_bound(sequence[i]);
if (it == decrease.begin())
decrease.insert(sequence[i]);
else {
--it;
decrease.erase(it);
decrease.insert(sequence[i]);
}
}
ldslen = decrease.size();
}
int main() {
usecppio cin >> n;
sequence.resize(n);
for (int i = 0; i < n; i++)
cin >> sequence[i];
find_lds();
cout << ldslen;
} | replace | 21 | 22 | 21 | 22 | TLE | |
p02973 | C++ | Runtime Error | #include <functional>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return 0;
}
template <typename T> class SegTree {
private:
size_t node_size_;
vector<T> node_;
T identity_; // ex) INF, 0, etc...
function<T(T, T)> operation_; // ex) min, max, sum, etc...
function<T(T, T)> update_; // ex) add, change, etc..
public:
SegTree(size_t node_size, T identity, function<T(T, T)> operation,
function<T(T, T)> update)
: identity_(identity), operation_(operation), update_(update) {
node_size_ = 1;
while (node_size_ < node_size)
node_size_ *= 2;
node_ = vector<T>(2 * node_size_ - 1, identity);
}
void change(int idx, T new_value) {
int node_idx = idx + node_size_ - 1;
node_[node_idx] = update_(node_[node_idx], new_value);
while (node_idx > 0) {
node_idx = (node_idx - 1) / 2;
node_[node_idx] =
operation_(node_[node_idx * 2 + 1], node_[node_idx * 2 + 2]);
}
}
T _query(int left, int right, int node_idx, int node_left, int node_right) {
if (node_right <= left || right <= node_left) {
return identity_;
}
if (left <= node_left && node_right <= right) {
return node_[node_idx];
} else {
T left_value = _query(left, right, node_idx * 2 + 1, node_left,
(node_left + node_right) / 2);
T right_value = _query(left, right, node_idx * 2 + 2,
(node_left + node_right) / 2, node_right);
return operation_(left_value, right_value);
}
}
T query(int left, int right) { return _query(left, right, 0, 0, node_size_); }
T operator[](int idx) { return node_[idx + node_size_ - 1]; }
// serach-method's usage is written on CF567
int _search(int kth, int node_idx, int node_left, int node_right) {
// kth >= 1
if (node_right - node_left == 1)
return node_idx - node_size_ + 1;
if (node_[node_idx * 2 + 1] < kth)
return _search(kth - node_[node_idx * 2 + 1], node_idx * 2 + 2,
(node_left + node_right) / 2, node_right);
else
return _search(kth, node_idx * 2 + 1, node_left,
(node_left + node_right) / 2);
}
int search(int kth) { return _search(kth, 0, 0, node_size_); }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
for (auto &a : A) {
cin >> a;
}
map<int, int> val_map;
set<int> S;
for (auto a : A) {
S.insert(a);
}
int now_val = 0;
for (auto s : S) {
val_map[s] = now_val++;
}
SegTree<int> seg(
now_val, 0, [](int a, int b) { return max(a, b); },
[](int a, int b) { return max(a, b); });
for (auto &a : A) {
int val = seg.query(a, now_val);
seg.change(a, val + 1);
}
int ans = 0;
rep(val, 0, now_val) { chmax(ans, seg.query(val, val + 1)); }
cout << ans << endl;
return 0;
} | #include <functional>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return 0;
}
template <typename T> class SegTree {
private:
size_t node_size_;
vector<T> node_;
T identity_; // ex) INF, 0, etc...
function<T(T, T)> operation_; // ex) min, max, sum, etc...
function<T(T, T)> update_; // ex) add, change, etc..
public:
SegTree(size_t node_size, T identity, function<T(T, T)> operation,
function<T(T, T)> update)
: identity_(identity), operation_(operation), update_(update) {
node_size_ = 1;
while (node_size_ < node_size)
node_size_ *= 2;
node_ = vector<T>(2 * node_size_ - 1, identity);
}
void change(int idx, T new_value) {
int node_idx = idx + node_size_ - 1;
node_[node_idx] = update_(node_[node_idx], new_value);
while (node_idx > 0) {
node_idx = (node_idx - 1) / 2;
node_[node_idx] =
operation_(node_[node_idx * 2 + 1], node_[node_idx * 2 + 2]);
}
}
T _query(int left, int right, int node_idx, int node_left, int node_right) {
if (node_right <= left || right <= node_left) {
return identity_;
}
if (left <= node_left && node_right <= right) {
return node_[node_idx];
} else {
T left_value = _query(left, right, node_idx * 2 + 1, node_left,
(node_left + node_right) / 2);
T right_value = _query(left, right, node_idx * 2 + 2,
(node_left + node_right) / 2, node_right);
return operation_(left_value, right_value);
}
}
T query(int left, int right) { return _query(left, right, 0, 0, node_size_); }
T operator[](int idx) { return node_[idx + node_size_ - 1]; }
// serach-method's usage is written on CF567
int _search(int kth, int node_idx, int node_left, int node_right) {
// kth >= 1
if (node_right - node_left == 1)
return node_idx - node_size_ + 1;
if (node_[node_idx * 2 + 1] < kth)
return _search(kth - node_[node_idx * 2 + 1], node_idx * 2 + 2,
(node_left + node_right) / 2, node_right);
else
return _search(kth, node_idx * 2 + 1, node_left,
(node_left + node_right) / 2);
}
int search(int kth) { return _search(kth, 0, 0, node_size_); }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
for (auto &a : A) {
cin >> a;
}
map<int, int> val_map;
set<int> S;
for (auto a : A) {
S.insert(a);
}
int now_val = 0;
for (auto s : S) {
val_map[s] = now_val++;
}
for (auto &a : A) {
a = val_map[a];
}
SegTree<int> seg(
now_val, 0, [](int a, int b) { return max(a, b); },
[](int a, int b) { return max(a, b); });
for (auto &a : A) {
int val = seg.query(a, now_val);
seg.change(a, val + 1);
}
int ans = 0;
rep(val, 0, now_val) { chmax(ans, seg.query(val, val + 1)); }
cout << ans << endl;
return 0;
} | insert | 100 | 100 | 100 | 103 | 0 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define N 100000
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) int(x.size())
#define OUT(a) cout << (a) << endl
#define VECIN(type, c, n) \
vector<type> c(n); \
for (auto &i : c) \
cin >> i;
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i, n) { cin >> a[i]; }
vector<int> b;
b.push_back(a[n - 1]);
for (int i = n - 2; i >= 0; i--) {
if (a[i] >= b[SZ(b) - 1]) {
b.push_back(a[i]);
} else {
auto x = upper_bound(ALL(b), a[i]);
b[b.begin() - x] = a[i];
}
}
OUT(SZ(b));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define N 100000
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) int(x.size())
#define OUT(a) cout << (a) << endl
#define VECIN(type, c, n) \
vector<type> c(n); \
for (auto &i : c) \
cin >> i;
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i, n) { cin >> a[i]; }
vector<int> b;
b.push_back(a[n - 1]);
for (int i = n - 2; i >= 0; i--) {
if (a[i] >= b[SZ(b) - 1]) {
b.push_back(a[i]);
} else {
auto x = upper_bound(ALL(b), a[i]);
b[x - b.begin()] = a[i];
}
}
OUT(SZ(b));
return 0;
} | replace | 25 | 26 | 25 | 26 | -6 | double free or corruption (out)
|
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
int main() {
int N;
cin >> N;
/*vl A(N);
REP(i, N){
cin >> A[i];
}*/
vl max;
int A;
cin >> A;
max.push_back(-A);
FOR(i, 1, N) {
int tmp;
cin >> tmp;
bool isIn = false;
int num = max.size();
REP(j, num) {
if (-max[j] < tmp) {
max[j] = -tmp;
isIn = true;
break;
}
}
if (!isIn)
max.push_back(-tmp);
}
cout << max.size() << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
int main() {
int N;
cin >> N;
/*vl A(N);
REP(i, N){
cin >> A[i];
}*/
vl max;
int A;
cin >> A;
max.push_back(-A);
FOR(i, 1, N) {
int tmp;
cin >> tmp;
bool isIn = false;
int num = max.size();
if (-max[num - 1] >= tmp) {
max.push_back(-tmp);
continue;
}
REP(j, num) {
if (-max[j] < tmp) {
max[j] = -tmp;
isIn = true;
break;
}
}
if (!isIn)
max.push_back(-tmp);
}
cout << max.size() << endl;
return 0;
} | insert | 36 | 36 | 36 | 40 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priority_queue
#define Spri priority_queue<P, vector<P>, greater<P>>
using namespace std;
int x[100010];
int dat[500000];
bool used[100010];
void update(int i, int a, int b, int l, int r, int z) {
if (a <= l && b >= r) {
dat[i] += z;
return;
}
if (r <= a || b <= l)
return;
update(i * 2 + 1, a, b, l, (l + r) / 2, z);
update(i * 2 + 2, a, b, (l + r) / 2, r, z);
dat[i] = max(dat[i * 2 + 1], dat[i * 2 + 2]);
}
int qe(int i, int a, int l, int r, int z) {
if (a < l && r - l == 1 && dat[i] > z && !used[l]) {
used[l] = true;
dat[i] = -1;
return l;
}
if (r - l == 1)
return INF;
if (dat[i * 2 + 1] > z) {
int bo = qe(i * 2 + 1, a, l, (l + r) / 2, z);
if (bo == INF && dat[i * 2 + 2] > z)
bo = qe(i * 2 + 2, a, (l + r) / 2, r, z);
dat[i] = max(dat[i * 2 + 1], dat[i * 2 + 2]);
return bo;
}
if (dat[i * 2 + 2] > z) {
int bo = qe(i * 2 + 2, a, (l + r) / 2, r, z);
dat[i] = max(dat[i * 2 + 1], dat[i * 2 + 2]);
return bo;
}
return INF;
}
signed main() {
int n, ans = 0;
cin >> n;
f(i, n) {
cin >> x[i];
update(0, i, i + 1, 0, n, x[i]);
}
f(i, n) {
if (!used[i]) {
used[i] = true;
int z = qe(0, i, 0, n, x[i]);
while (z != INF) {
z = qe(0, z, 0, n, x[z]);
}
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priority_queue
#define Spri priority_queue<P, vector<P>, greater<P>>
using namespace std;
int x[100010];
int dat[500000];
bool used[100010];
void update(int i, int a, int b, int l, int r, int z) {
if (a <= l && b >= r) {
dat[i] += z;
return;
}
if (r <= a || b <= l)
return;
update(i * 2 + 1, a, b, l, (l + r) / 2, z);
update(i * 2 + 2, a, b, (l + r) / 2, r, z);
dat[i] = max(dat[i * 2 + 1], dat[i * 2 + 2]);
}
int qe(int i, int a, int l, int r, int z) {
if (a < l && r - l == 1 && dat[i] > z && !used[l]) {
used[l] = true;
dat[i] = -1;
return l;
}
if (r - l == 1)
return INF;
if (dat[i * 2 + 1] > z && (r + l) / 2 > a + 1) {
int bo = qe(i * 2 + 1, a, l, (l + r) / 2, z);
if (bo == INF && dat[i * 2 + 2] > z)
bo = qe(i * 2 + 2, a, (l + r) / 2, r, z);
dat[i] = max(dat[i * 2 + 1], dat[i * 2 + 2]);
return bo;
}
if (dat[i * 2 + 2] > z) {
int bo = qe(i * 2 + 2, a, (l + r) / 2, r, z);
dat[i] = max(dat[i * 2 + 1], dat[i * 2 + 2]);
return bo;
}
return INF;
}
signed main() {
int n, ans = 0;
cin >> n;
f(i, n) {
cin >> x[i];
update(0, i, i + 1, 0, n, x[i]);
}
f(i, n) {
if (!used[i]) {
used[i] = true;
int z = qe(0, i, 0, n, x[i]);
while (z != INF) {
z = qe(0, z, 0, n, x[z]);
}
ans++;
}
}
cout << ans << endl;
}
| replace | 36 | 37 | 36 | 37 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define F first
#define S second
#define mp make_pair
#define eb emplace_back
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
typedef long long ll;
/* --- INFの値が適切か確認する --- */
// const int INF = 1 << 30;
// const ll INF = 1LL << 60;
// const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
multiset<int> ms;
rep(i, n) {
auto it = lower_bound(all(ms), a[i]);
if (it != ms.begin())
ms.erase(--it);
ms.insert(a[i]);
}
cout << sz(ms) << endl;
}
| #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define F first
#define S second
#define mp make_pair
#define eb emplace_back
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
typedef long long ll;
/* --- INFの値が適切か確認する --- */
// const int INF = 1 << 30;
// const ll INF = 1LL << 60;
// const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
multiset<int> ms;
rep(i, n) {
auto it = ms.lower_bound(a[i]);
if (it != ms.begin())
ms.erase(--it);
ms.insert(a[i]);
}
cout << sz(ms) << endl;
}
| replace | 34 | 35 | 34 | 35 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.1415926536
#define pb push_back
#define N 1000000007
#define M 998244353
#define INF 1e9
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, i, j, k, t, l;
cin >> n;
int a[n + 5];
multiset<ll> m;
multiset<ll>::iterator it;
for (i = 0; i < n; i++) {
cin >> a[i];
it = lower_bound(m.begin(), m.end(), a[i]);
if (it == m.begin()) {
m.insert(a[i]);
} else {
it--;
m.erase(it);
m.insert(a[i]);
}
}
cout << m.size() << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.1415926536
#define pb push_back
#define N 1000000007
#define M 998244353
#define INF 1e9
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, i, j, k, t, l;
cin >> n;
int a[n + 5];
multiset<ll> m;
multiset<ll>::iterator it;
for (i = 0; i < n; i++) {
cin >> a[i];
it = m.lower_bound(a[i]);
if (it == m.begin()) {
m.insert(a[i]);
} else {
it--;
m.erase(it);
m.insert(a[i]);
}
}
cout << m.size() << endl;
} | replace | 20 | 21 | 20 | 21 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#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];
}
reverse(a.begin(), a.end());
int ans = 1;
vector<int> p;
p.push_back(a[0]);
for (int i = 1; i < n; i++) {
sort(p.begin(), p.end());
int x = upper_bound(p.begin(), p.end(), a[i]) - p.begin();
if (x >= p.size()) {
p.push_back(a[i]);
ans++;
} else {
p[x] = a[i];
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#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];
}
reverse(a.begin(), a.end());
int ans = 1;
vector<int> p;
p.push_back(a[0]);
for (int i = 1; i < n; i++) {
int x = upper_bound(p.begin(), p.end(), a[i]) - p.begin();
if (x >= p.size()) {
p.push_back(a[i]);
ans++;
} else {
p[x] = a[i];
}
}
cout << ans << endl;
return 0;
} | delete | 19 | 20 | 19 | 19 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define fs first
#define sc second
#define INF 1000000000
#define MOD 1000000007
#define EPS 0.00000001
int main() {
int N;
cin >> N;
multiset<int> S;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
auto it = lower_bound(S.begin(), S.end(), a);
if (it != S.begin()) {
it--;
S.erase(it);
}
S.insert(a);
}
cout << S.size() << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define fs first
#define sc second
#define INF 1000000000
#define MOD 1000000007
#define EPS 0.00000001
int main() {
int N;
cin >> N;
multiset<int> S;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
auto it = S.lower_bound(a);
if (it != S.begin())
S.erase(--it);
S.insert(a);
}
cout << S.size() << endl;
return 0;
}
| replace | 30 | 35 | 30 | 33 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define loop(n, i, a) for (int i = a; i < n; i++)
#define all(arr, n) arr, arr + n
#define allv(v) (v).begin(), (v).end()
#define rallv(v) (v).rbegin(), (v).rend()
#define m_p make_pair
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define sz(x) (int)x.size()
#define pb push_back
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main() {
int n;
cin >> n;
multiset<int> st;
loop(n, i, 0) {
int x;
cin >> x;
if (i == 0)
st.insert(x);
else {
auto it = st.lower_bound(x);
it--;
if (x > *it) {
st.erase(it);
st.insert(x);
} else {
st.insert(x);
}
}
}
cout << sz(st) << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define loop(n, i, a) for (int i = a; i < n; i++)
#define all(arr, n) arr, arr + n
#define allv(v) (v).begin(), (v).end()
#define rallv(v) (v).rbegin(), (v).rend()
#define m_p make_pair
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define sz(x) (int)x.size()
#define pb push_back
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main() {
int n;
cin >> n;
multiset<int> st;
loop(n, i, 0) {
int x;
cin >> x;
if (i == 0)
st.insert(x);
else {
auto it = st.lower_bound(x);
if (it != st.begin())
st.erase(--it);
st.insert(x);
}
}
cout << sz(st) << endl;
}
| replace | 43 | 50 | 43 | 46 | 0 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
multiset<ll> s;
rep(i, 0, n) {
ll a;
cin >> a;
auto ite = s.lower_bound(a);
if (ite != s.begin())
s.erase(ite--);
s.insert(a);
}
cout << s.size() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
multiset<ll> s;
rep(i, 0, n) {
ll a;
cin >> a;
auto ite = s.lower_bound(a);
if (ite != s.begin()) {
ite--;
s.erase(ite);
}
s.insert(a);
}
cout << s.size() << endl;
}
| replace | 13 | 15 | 13 | 17 | -6 | free(): invalid pointer
|
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N, 0);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> min_color(N, 1);
vector<ll> color_min_val;
color_min_val.push_back(A[0]);
for (int i = 1; i < N; i++) {
auto Iter = lower_bound(color_min_val.begin(), color_min_val.end(), A[i]);
// int dist = distance(color_min_val.begin(), Iter);
if (Iter == color_min_val.begin()) { //) {
color_min_val.push_back(A[i]);
sort(color_min_val.begin(), color_min_val.end());
min_color[i] = min_color[i - 1] + 1;
} else {
*(Iter - 1) = A[i];
min_color[i] = min_color[i - 1];
}
}
cout << min_color[N - 1] << endl;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N, 0);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> min_color(N, 1);
vector<ll> color_min_val;
color_min_val.push_back(A[0]);
for (int i = 1; i < N; i++) {
auto Iter = lower_bound(color_min_val.begin(), color_min_val.end(), A[i]);
// int dist = distance(color_min_val.begin(), Iter);
if (Iter == color_min_val.begin()) { //) {
color_min_val.insert(color_min_val.begin(), A[i]);
min_color[i] = min_color[i - 1] + 1;
} else {
*(Iter - 1) = A[i];
min_color[i] = min_color[i - 1];
}
}
cout << min_color[N - 1] << endl;
} | replace | 25 | 27 | 25 | 26 | TLE | |
p02973 | C++ | Time Limit Exceeded | // ヘッダー
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
// 定数
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2(i, a, b) for (ll i = a; i > (ll)(b); i--)
// vectorの扱い
#define ALL(x) (x).begin(), (x).end() // sortなどの引数省略
#define SIZE(x) ((ll)(x).size()) // size
#define MAX(x) *max_element(ALL(x)) // 最大値
#define MIN(x) *min_element(ALL(x)) // 最小値
// グローバル変数
// ライブラリ挿入
int main() {
int N;
cin >> N;
vector<ll> A(N);
REP(i, N) cin >> A[i];
multiset<int> st;
st.insert(A[0]);
REP2(i, 1, N) {
auto itr = lower_bound(st.begin(), st.end(), A[i]);
if (itr == st.begin()) {
st.insert(A[i]);
} else {
itr--;
st.erase(itr);
st.insert(A[i]);
}
}
cout << st.size() << endl;
} | // ヘッダー
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
// 定数
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2(i, a, b) for (ll i = a; i > (ll)(b); i--)
// vectorの扱い
#define ALL(x) (x).begin(), (x).end() // sortなどの引数省略
#define SIZE(x) ((ll)(x).size()) // size
#define MAX(x) *max_element(ALL(x)) // 最大値
#define MIN(x) *min_element(ALL(x)) // 最小値
// グローバル変数
// ライブラリ挿入
int main() {
int N;
cin >> N;
vector<ll> A(N);
REP(i, N) cin >> A[i];
multiset<int> st;
st.insert(A[0]);
REP2(i, 1, N) {
auto itr = st.lower_bound(A[i]);
if (itr == st.begin()) {
st.insert(A[i]);
} else {
itr--;
st.erase(itr);
st.insert(A[i]);
}
}
cout << st.size() << endl;
} | replace | 35 | 36 | 35 | 36 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define pp pair<int, int>
#define ll long long
#define ld long double
int inf = 100000000;
ll INF = 4000000000000000000;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n), b(0);
int ans = 1;
rep(i, n) cin >> a.at(i);
reverse(a.begin(), a.end());
b.push_back(a.at(0));
int ma = a.at(0);
for (int i = 1; i < n; i++) {
int k = a.at(i);
// cout << k << ma << endl;
if (k >= ma) {
ans++;
ma = k;
b.push_back(k);
continue;
}
auto it = upper_bound(b.begin(), b.end(), k);
b.at(it - b.begin()) = k;
sort(b.begin(), b.end());
if (it - b.begin() == b.size() - 1) {
ma = b.at(b.size() - 1);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define pp pair<int, int>
#define ll long long
#define ld long double
int inf = 100000000;
ll INF = 4000000000000000000;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n), b(0);
int ans = 1;
rep(i, n) cin >> a.at(i);
reverse(a.begin(), a.end());
b.push_back(a.at(0));
int ma = a.at(0);
for (int i = 1; i < n; i++) {
int k = a.at(i);
// cout << k << ma << endl;
if (k >= ma) {
ans++;
ma = k;
b.push_back(k);
continue;
}
auto it = upper_bound(b.begin(), b.end(), k);
b.at(it - b.begin()) = k;
if (it - b.begin() == b.size() - 1) {
ma = b.at(b.size() - 1);
}
}
cout << ans << endl;
} | delete | 31 | 32 | 31 | 31 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef unsigned long long int ulint;
typedef long long int lint;
int main() {
ulint N;
cin >> N;
vector<ulint> A;
for (int i = 0; i < N; ++i) {
ulint a;
cin >> a;
A.push_back(a);
}
vector<ulint> C(N, (ulint)-1);
for (int i = N - 1; i >= 0; --i) {
int j = 0;
while (A[i] >= C[j]) {
++j;
}
C[j] = A[i];
}
// cout << "C= " << endl;
// for (int i = 0; i < N; ++i) {
// cout << C[i] << " ";
// }
// cout << endl;
auto it = find(C.begin(), C.end(), (ulint)-1);
ulint val = it - C.begin();
cout << val << endl;
}
| #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef unsigned long long int ulint;
typedef long long int lint;
int main() {
ulint N;
cin >> N;
vector<ulint> A;
for (int i = 0; i < N; ++i) {
ulint a;
cin >> a;
A.push_back(a);
}
vector<ulint> C(N, (ulint)-1);
for (int i = N - 1; i >= 0; --i) {
// TODO: binary search here.
auto it = upper_bound(C.begin(), C.end(), A[i]);
// int j = 0;
// while (A[i] >= C[j]) {
// ++j;
// }
*it = A[i];
// C[j] = A[i];
}
// cout << "C= " << endl;
// for (int i = 0; i < N; ++i) {
// cout << C[i] << " ";
// }
// cout << endl;
auto it = find(C.begin(), C.end(), (ulint)-1);
ulint val = it - C.begin();
cout << val << endl;
}
| replace | 24 | 29 | 24 | 32 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) { cin >> A.at(i); }
// やり方
// (i) ((1, 4), (2), (0)) みたいに単調増加する数列の入れ物を持つ,
// 最大値だけ簡単に取り出せるようにしておくことが大事
// - どの最大値よりも低いものが来た場合は，新しい組が生成
// - そうじゃない場合は，ぎりぎり大きいものを使う
// (上の例では，3が来たら(0)側ではなく(2)側に) あ，完全に二分探索やん,,
vector<ll> x;
rep(i, N) {
if (x.size() == 0) {
x.push_back(A.at(i));
} else {
if (A.at(i) <= *min_element(x.begin(), x.end())) {
// 最小なので先頭に入れる
x.insert(x.begin(), A.at(i));
} else {
// 二分探索で座標を得て入れ替え
// (2, 4) に3を入れるなら 2 -> 3
auto pos = lower_bound(x.begin(), x.end(), A.at(i));
x[distance(x.begin(), pos) - 1] = A.at(i);
}
}
}
cout << x.size() << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) { cin >> A.at(i); }
// やり方
// (i) ((1, 4), (2), (0)) みたいに単調増加する数列の入れ物を持つ,
// 最大値だけ簡単に取り出せるようにしておくことが大事
// - どの最大値よりも低いものが来た場合は，新しい組が生成
// - そうじゃない場合は，ぎりぎり大きいものを使う
// (上の例では，3が来たら(0)側ではなく(2)側に) あ，完全に二分探索やん,,
vector<ll> x;
rep(i, N) {
if (x.size() == 0) {
x.push_back(A.at(i));
} else {
if (A.at(i) <= x.at(0)) {
// 最小なので先頭に入れる
x.insert(x.begin(), A.at(i));
} else {
// 二分探索で座標を得て入れ替え
// (2, 4) に3を入れるなら 2 -> 3
auto pos = lower_bound(x.begin(), x.end(), A.at(i));
x[distance(x.begin(), pos) - 1] = A.at(i);
}
}
}
cout << x.size() << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| replace | 43 | 44 | 43 | 44 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 100001;
int main() {
int N;
int A[MAX];
deque<int> color;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
int index = lower_bound(color.begin(), color.end(), A[i]) - color.begin();
if (index == 0) {
color.push_front(A[i]);
} else {
color[i - 1] = A[i];
}
}
cout << color.size() << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 100001;
int main() {
int N;
int A[MAX];
deque<int> color;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
int index = lower_bound(color.begin(), color.end(), A[i]) - color.begin();
if (index == 0) {
color.push_front(A[i]);
} else {
color[index - 1] = A[i];
}
}
cout << color.size() << endl;
return 0;
} | replace | 31 | 32 | 31 | 32 | 0 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, a, b[100005];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; n++) {
scanf("%d", &a);
a++;
*(lower_bound(b, b + n, a) - 1) = a;
}
printf("%d\n", n - (lower_bound(b, b + n, 1) - b));
} | #include <bits/stdc++.h>
using namespace std;
int n, a, b[100005];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
a++;
*(lower_bound(b, b + n, a) - 1) = a;
}
printf("%d\n", n - (lower_bound(b, b + n, 1) - b));
} | replace | 5 | 6 | 5 | 6 | -11 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
signed main() {
ll n;
cin >> n;
multiset<ll, greater<ll>> t; // 見たならtrue
rep(i, n) {
ll a;
cin >> a;
auto itr = upper_bound(all(t), a);
if (t.begin() != itr)
t.erase(itr);
t.insert(a);
}
cout << siz(t) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
signed main() {
ll n;
cin >> n;
multiset<ll, greater<ll>> t; // 見たならtrue
rep(i, n) {
ll a;
cin >> a;
auto itr = t.upper_bound(a);
if (t.end() != itr)
t.erase(itr);
t.insert(a);
}
cout << siz(t) << endl;
} | replace | 14 | 16 | 14 | 16 | -6 | free(): invalid pointer
|
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define all(a) (a).begin(), (a).end()
#define Pi P<int, int>
#define elif else if
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
int lcm(int a, int b) { return a / gcm(a, b) * b; }
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
int c = 1;
for (int i = a; i >= b; i--)
c *= i;
return c;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
// 先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
signed main() {
int a;
cin >> a;
V<int> b(a);
fo(i, a) cin >> b[i];
rev(b);
V<int> dp(a, INF);
fo(i, a) { dp[upp(dp, b[i])] = b[i]; }
cout << low(dp, INF) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define all(a) (a).begin(), (a).end()
#define Pi P<int, int>
#define elif else if
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
int lcm(int a, int b) { return a / gcm(a, b) * b; }
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
int c = 1;
for (int i = a; i >= b; i--)
c *= i;
return c;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
// 先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
signed main() {
int a;
cin >> a;
V<int> b(a);
fo(i, a) cin >> b[i];
rev(b);
V<int> dp(a, INF);
int c;
fo(i, a) { *upper_bound(all(dp), b[i]) = b[i]; }
cout << low(dp, INF) << endl;
} | replace | 239 | 240 | 239 | 241 | TLE | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
using ll = long long;
using ull = unsigned long long;
int main(void) {
IOS int n;
cin >> n;
vector<int> v;
int a;
cin >> a;
v.emplace_back(a);
REP(i, n - 1) {
int x;
cin >> x;
if (v.back() >= x) {
v.emplace_back(x);
} else {
auto it = lower_bound(RALL(v), x);
*it = x;
}
}
cout << v.size() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
using ll = long long;
using ull = unsigned long long;
int main(void) {
IOS int n;
cin >> n;
vector<int> v;
int a;
cin >> a;
v.emplace_back(a);
REP(i, n - 1) {
int x;
cin >> x;
if (v.back() >= x) {
v.emplace_back(x);
} else {
auto it = upper_bound(ALL(v), x, greater<int>());
*it = x;
}
}
cout << v.size() << endl;
return 0;
} | replace | 25 | 26 | 25 | 26 | -6 | double free or corruption (out)
|
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[100005];
int main() {
ll N;
cin >> N;
REP(i, N) { cin >> A[i]; }
std::multiset<ll> st;
ll ans = 0;
REP(i, N) {
int n = N - i - 1;
ll m = A[n];
auto it = lower_bound(st.begin(), st.end(), m + 1);
if (it == st.end())
ans++;
else
st.erase(it);
st.insert(m);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[100005];
int main() {
ll N;
cin >> N;
REP(i, N) { cin >> A[i]; }
std::multiset<ll> st;
ll ans = 0;
REP(i, N) {
int n = N - i - 1;
ll m = A[n];
auto it = st.lower_bound(m + 1);
if (it == st.end())
ans++;
else
st.erase(it);
st.insert(m);
}
cout << ans << endl;
return 0;
} | replace | 24 | 25 | 24 | 25 | TLE | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FASTIO \
ios::sync_with_stdio(0); \
cin.tie(0);
#define show(x) cerr << #x << " = " << x << "\n"
#define mem(a, b) memset(a, b, sizeof a)
#define popcnt(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define mod(x, m) ((x % m + m) % m)
#define SZ(a) (int)a.size()
#define ll long long
#define ld long double
#define vii vector<ll>
#define dqi deque<ll>
#define sii set<ll>
#define vpi vector<pii>
#define mii map<ll, ll>
#define pii pair<ll, ll>
#define pi pair<int, int>
#define pb push_back
#define F first
#define S second
#define L length()
#define OO (ll)1e18
#define EPS 1e-9
using namespace std;
using namespace __gnu_pbds;
void ONLINE__JUDGE();
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
pii swapii(pii pr) { return {pr.S, pr.F}; }
ll binEXP(ll x, ll pw, ll MOD = LLONG_MAX);
int dx[] = {0, 0, -1, +1, -1, +1, -1, +1};
int dy[] = {-1, +1, 0, 0, -1, +1, +1, -1};
const ll MOD = 1e9 + 7;
const ll MAX = 1e2 + 9;
ll x;
multiset<ll> s;
vii vec;
int main() {
// FASTIO ONLINE__JUDGE();
cin >> x;
vec.resize(x);
for (ll &i : vec)
cin >> i;
s.insert(vec.front());
for (int i = 1; i < x; ++i) {
auto it = s.upper_bound(vec[i]);
it--;
if (*it < vec[i]) {
s.erase(it);
s.insert(vec[i]);
} else {
s.insert(vec[i]);
}
}
cout << SZ(s);
return 0;
}
void ONLINE__JUDGE() {
#ifndef ONLINE_JUDGE
freopen("inp.c", "r", stdin);
// freopen( "OutPut.txt" , "w" , stdout );
#endif // ONLINE_JUDGE
}
ll binEXP(ll x, ll pw, ll MOD) {
ll res = 1;
while (pw > 0) {
pw % 2 ? res *= x : 0;
x *= x;
x %= MOD;
pw /= 2;
res %= MOD;
}
return res %= MOD;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FASTIO \
ios::sync_with_stdio(0); \
cin.tie(0);
#define show(x) cerr << #x << " = " << x << "\n"
#define mem(a, b) memset(a, b, sizeof a)
#define popcnt(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define mod(x, m) ((x % m + m) % m)
#define SZ(a) (int)a.size()
#define ll long long
#define ld long double
#define vii vector<ll>
#define dqi deque<ll>
#define sii set<ll>
#define vpi vector<pii>
#define mii map<ll, ll>
#define pii pair<ll, ll>
#define pi pair<int, int>
#define pb push_back
#define F first
#define S second
#define L length()
#define OO (ll)1e18
#define EPS 1e-9
using namespace std;
using namespace __gnu_pbds;
void ONLINE__JUDGE();
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
pii swapii(pii pr) { return {pr.S, pr.F}; }
ll binEXP(ll x, ll pw, ll MOD = LLONG_MAX);
int dx[] = {0, 0, -1, +1, -1, +1, -1, +1};
int dy[] = {-1, +1, 0, 0, -1, +1, +1, -1};
const ll MOD = 1e9 + 7;
const ll MAX = 1e2 + 9;
ll x;
multiset<ll> s;
vii vec;
int main() {
// FASTIO ONLINE__JUDGE();
cin >> x;
vec.resize(x);
for (ll &i : vec)
cin >> i;
s.insert(vec.front());
for (int i = 1; i < x; ++i) {
auto it = s.lower_bound(vec[i]);
if (it == s.begin()) {
s.insert(vec[i]);
continue;
}
it--;
if (*it < vec[i]) {
s.erase(it);
s.insert(vec[i]);
} else {
s.insert(vec[i]);
}
}
cout << SZ(s);
return 0;
}
void ONLINE__JUDGE() {
#ifndef ONLINE_JUDGE
freopen("inp.c", "r", stdin);
// freopen( "OutPut.txt" , "w" , stdout );
#endif // ONLINE_JUDGE
}
ll binEXP(ll x, ll pw, ll MOD) {
ll res = 1;
while (pw > 0) {
pw % 2 ? res *= x : 0;
x *= x;
x %= MOD;
pw /= 2;
res %= MOD;
}
return res %= MOD;
}
| replace | 63 | 64 | 63 | 69 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
vector<int> vec;
rep(i, N) {
if (i == 0)
vec.push_back(A[i]);
else {
auto it = lower_bound(vec.begin(), vec.end(), A[i]);
if (it == vec.begin()) {
reverse(vec.begin(), vec.end());
vec.push_back(A[i]);
reverse(vec.begin(), vec.end());
} else {
it--;
*it = A[i];
}
}
}
// rep(i, vec.size()) cout << vec[i] << " "; cout << endl;
cout << vec.size() << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
vector<int> vec;
rep(i, N) {
if (i == 0)
vec.push_back(A[i]);
else {
auto it = lower_bound(vec.begin(), vec.end(), A[i]);
if (it == vec.begin()) {
vec.insert(it, A[i]);
} else {
it--;
*it = A[i];
}
}
}
// rep(i, vec.size()) cout << vec[i] << " "; cout << endl;
cout << vec.size() << endl;
return 0;
} | replace | 26 | 29 | 26 | 27 | TLE | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
reverse(vec.begin(), vec.end());
int INF = 100000000;
vector<int> dp(N, INF);
vector<int>::iterator pos;
int idx;
for (int i = 0; i < N; i++) {
pos = upper_bound(dp.begin(), dp.end(), vec.at(i));
idx = distance(dp.begin(), pos);
dp.at(idx) = vec.at(i);
}
int ans = 0;
for (int i = 0; i < N; i++) {
// cout << dp.at(i) << " ";
if (dp.at(i) != INF) {
ans = i;
}
}
cout << ans + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
reverse(vec.begin(), vec.end());
int INF = 1e9 + 10;
vector<int> dp(N, INF);
vector<int>::iterator pos;
int idx;
for (int i = 0; i < N; i++) {
pos = upper_bound(dp.begin(), dp.end(), vec.at(i));
idx = distance(dp.begin(), pos);
dp.at(idx) = vec.at(i);
}
int ans = 0;
for (int i = 0; i < N; i++) {
// cout << dp.at(i) << " ";
if (dp.at(i) != INF) {
ans = i;
}
}
cout << ans + 1 << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const ll MOD = 1000000007;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int &i : a)
scanf("%d", &i);
multiset<int, greater<int>> ans;
for (int i : a) {
multiset<int>::iterator it = ans.lower_bound(i);
if (it != ans.end()) {
while (*it == i)
++it;
if (it != ans.end())
ans.erase(it);
}
ans.insert(i);
}
printf("%d ", ans.size());
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const ll MOD = 1000000007;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int &i : a)
scanf("%d", &i);
multiset<int, greater<int>> ans;
for (int i : a) {
multiset<int>::iterator it = ans.upper_bound(i);
if (it != ans.end())
ans.erase(it);
ans.insert(i);
}
printf("%d ", ans.size());
return 0;
} | replace | 20 | 27 | 20 | 23 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) (bit & (1 << i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))
typedef long long LL;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
} // C++14
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t,
const V &v) {
t = v;
}
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t,
const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
std::cout << head;
if (sizeof...(tail) != 0) {
std::cout << " ";
}
print(std::forward<Tail>(tail)...);
}
template <class T> void print(std::vector<T> &v) {
for (auto &a : v) {
std::cout << a;
if (&a != &v.back()) {
std::cout << " ";
}
}
std::cout << std::endl;
}
template <class T> void print(std::vector<std::vector<T>> &vv) {
for (auto &v : vv) {
print(v);
}
}
inline bool inside(long long y, long long x, long long H, long long W) {
return 0 <= y and y < H and 0 <= x and x < W;
}
template <class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) {
return abs(x1 - x2) + abs(y1 - y2);
}
template <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
template <class T> inline std::vector<T> unique(std::vector<T> v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
return n * (2 * s + (n - 1) * d) / 2;
}
// 2のべき乗数かどうか
bool is_power_of_two(long long x) { return !(x & (x - 1)); }
// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
long long ans = v[0];
for (int i = 1; i < (int)v.size(); ++i) {
ans = gcd(ans, v[i]);
}
return ans;
}
// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0}; // 右，下
const std::vector<int> dy4 = {0, 1, 0, -1},
dx4 = {1, 0, -1, 0}; // 右，下，左，上
const std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1},
dx8 = {1, 0, -1, 0, 1, 1, -1, -1};
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL N;
cin >> N;
auto A = make_v<LL>(N);
FOR(i, 0, N) { cin >> A[i]; }
multiset<LL> s;
int ans = 0;
FOR(i, 0, N) {
LL a = A[i];
auto it = lower_bound(ALL(s), a);
if (it == s.begin()) {
ans++;
} else {
it--;
s.erase(it);
}
s.insert(a);
}
print(ans);
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) (bit & (1 << i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))
typedef long long LL;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
} // C++14
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t,
const V &v) {
t = v;
}
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t,
const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
std::cout << head;
if (sizeof...(tail) != 0) {
std::cout << " ";
}
print(std::forward<Tail>(tail)...);
}
template <class T> void print(std::vector<T> &v) {
for (auto &a : v) {
std::cout << a;
if (&a != &v.back()) {
std::cout << " ";
}
}
std::cout << std::endl;
}
template <class T> void print(std::vector<std::vector<T>> &vv) {
for (auto &v : vv) {
print(v);
}
}
inline bool inside(long long y, long long x, long long H, long long W) {
return 0 <= y and y < H and 0 <= x and x < W;
}
template <class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) {
return abs(x1 - x2) + abs(y1 - y2);
}
template <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
template <class T> inline std::vector<T> unique(std::vector<T> v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
return n * (2 * s + (n - 1) * d) / 2;
}
// 2のべき乗数かどうか
bool is_power_of_two(long long x) { return !(x & (x - 1)); }
// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
long long ans = v[0];
for (int i = 1; i < (int)v.size(); ++i) {
ans = gcd(ans, v[i]);
}
return ans;
}
// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0}; // 右，下
const std::vector<int> dy4 = {0, 1, 0, -1},
dx4 = {1, 0, -1, 0}; // 右，下，左，上
const std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1},
dx8 = {1, 0, -1, 0, 1, 1, -1, -1};
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL N;
cin >> N;
auto A = make_v<LL>(N);
FOR(i, 0, N) { cin >> A[i]; }
multiset<LL> s;
int ans = 0;
FOR(i, 0, N) {
LL a = A[i];
auto it = s.lower_bound(a);
if (it == s.begin()) {
ans++;
} else {
it--;
s.erase(it);
}
s.insert(a);
}
print(ans);
return 0;
} | replace | 146 | 147 | 146 | 147 | TLE | |
p02973 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998244353;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, 0, n) cin >> a[i], a[i] *= (-1);
vector<int> nib;
rep(i, 0, n) {
auto j = upper_bound(nib.begin(), nib.end(), a[i]);
if (j == nib.end()) {
nib.push_back(a[i]);
} else {
*j = a[i];
}
}
cout << nib.size() << endl;
} | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998244353;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, 0, n) cin >> a[i], a[i] *= (-1);
vector<int> nib;
rep(i, 0, n) {
auto j = upper_bound(nib.begin(), nib.end(), a[i]);
if (j == nib.end()) {
nib.push_back(a[i]);
} else {
*j = a[i];
}
}
cout << nib.size() << endl;
} | replace | 0 | 1 | 0 | 1 | TLE | |
p02973 | C++ | Runtime Error | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
int N;
cin >> N;
vector<int> Ais;
for (int i = 0; i < N; i++) {
int Ai;
cin >> Ai;
Ais.push_back(Ai);
}
vector<int> vals;
for (int ai : Ais) {
if (vals.empty()) {
vals.push_back(ai);
continue;
}
auto it = partition_point(vals.begin(), vals.end(),
[ai](int val) { return val >= ai; });
if (it == vals.end()) {
vals.push_back(ai);
} else {
it = prev(it);
*it = ai;
}
}
cout << vals.size() << endl;
}
| //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
int N;
cin >> N;
vector<int> Ais;
for (int i = 0; i < N; i++) {
int Ai;
cin >> Ai;
Ais.push_back(Ai);
}
vector<int> vals;
for (int ai : Ais) {
if (vals.empty()) {
vals.push_back(ai);
continue;
}
auto it = partition_point(vals.begin(), vals.end(),
[ai](int val) { return val >= ai; });
if (it == vals.end()) {
vals.push_back(ai);
} else {
*it = ai;
}
}
cout << vals.size() << endl;
}
| delete | 48 | 49 | 48 | 48 | -6 | double free or corruption (out)
|
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll INF = 9223372036854775807;
// AtCoder Beginner Contest 134-E
int main() {
ll N;
scanf("%lld", &N);
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
// priority_queue<ll, vector<ll>, greater<ll>> pq;
multiset<ll> ms;
ll result = 0;
for (ll i = 0; i < N; i++) {
// for (auto it = ms.begin(); it != ms.end(); it++) {
// printf("%lld ", *it);
// }
// printf("\n");
if (ms.empty()) {
// printf("empty\n");
result++;
ms.insert(A[i]);
} else {
auto it = lower_bound(ms.begin(), ms.end(), A[i]);
if (it == ms.begin()) {
// �����̐��l�͂Ȃ�
// printf("found: begin - 1\n");
ms.insert(A[i]);
result++;
} else {
it--;
// printf("found: %lld\n", *it);
ms.erase(it);
ms.insert(A[i]);
}
}
}
printf("%lld\n", result);
}
// AtCoder Beginner Contest 136-E
/*
vector<ll> Divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i);
}
}
}
std::sort(ret.begin(), ret.end());
return (ret);
}
int main() {
ll N;
scanf("%lld", &N);
ll K;
scanf("%lld", &K);
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
ll sumAll = 0;
for (ll i = 0; i < N; i++) {
sumAll += A[i];
}
auto list = Divisor(sumAll);
ll result = 1;
for (auto val : list) {
ll sum = 0;
vector<ll> mod;
for (ll i = 0; i < N; i++) {
ll m = A[i] % val;
if(m > 0)
if (m <= val / 2) {
mod.push_back(m);
sum += m;
}
else {
mod.push_back(m - val);
sum += m - val;
}
}
if (sum < 0) {
std::sort(mod.begin(), mod.end());
for (ll i = 0; i < mod.size(); i++) {
mod[i] += val;
sum += val;
if (sum == 0) {
break;
}
}
}
else if(sum > 0){
std::sort(mod.begin(), mod.end(), std::greater<ll>());
for (ll i = 0; i < mod.size(); i++) {
mod[i] -= val;
sum -= val;
if (sum == 0) {
break;
}
}
}
ll dbl = 0;
for (auto m : mod) {
dbl += abs(m);
}
if (dbl / 2 <= K) {
result = val;
}
}
printf("%lld\n", result);
}
*/
// AtCoder Grand Contest 024-C
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
ll height = 0;
ll last = 0;
ll result = 0;
queue<LLPair> lastQ;
for (ll i = N - 1; i >= 0; i--) {
height--;
if (height < 0) {
height = 0;
}
//last�̍X�V
if (lastQ.empty() == false) {
LLPair p = lastQ.front();
if (p.a - i == p.b) {
lastQ.pop();
last--;
}
}
result += last;
if (A[i] < height) {
result = -1;
break;
}
if (A[i] > height) {
result++;
height = A[i];
//last�̍X�V
lastQ.push(LLPair(i, height));
last++;
}
}
if (height > 0) {
result = -1;
}
printf("%lld\n", result);
}
*/
// AtCoder Regular Contest 092-C
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
vector<LLPair> red(N);
for (ll i = 0; i < N; i++) {
scanf("%lld %lld", &red[i].a, &red[i].b);
}
vector<LLPair> blue(N);
for (ll i = 0; i < N; i++) {
scanf("%lld %lld", &blue[i].a, &blue[i].b);
}
std::sort(blue.begin(), blue.end(), [](const LLPair &a, const LLPair &b)
{ return a.a < b.a;
});
ll result = 0;
vector<bool> redFinish(N, false);
for (auto item : blue) {
ll maxY = -1;
ll hold = -1;
for (ll i = 0; i < N; i++) {
if (redFinish[i] == true) {
continue;
}
if (red[i].a >= item.a) {
continue;
}
if (red[i].b >= item.b) {
continue;
}
if (red[i].b > maxY) {
maxY = red[i].b;
hold = i;
}
}
if (hold >= 0) {
redFinish[hold] = true;
result++;
}
}
printf("%lld\n", result);
}
*/
// AtCoder Beginner Contest 106-D
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
ll M;
scanf("%lld", &M);
ll Q;
scanf("%lld", &Q);
vector<LLPair> lr(M);
for (ll i = 0; i < M; i++) {
scanf("%lld %lld", &lr[i].a, &lr[i].b);
}
vector<LLPair> query(Q);
for (ll i = 0; i < Q; i++) {
scanf("%lld %lld", &query[i].a, &query[i].b);
}
vector<vector<ll>> arr(N + 1, vector<ll>(0));
for (ll i = 0; i < M; i++) {
arr[lr[i].a].push_back(lr[i].b - lr[i].a);
}
for (ll i = 1; i <= N; i++) {
std::sort(arr[i].begin(), arr[i].end());
}
for (ll i = 0; i < Q; i++) {
ll result = 0;
for (ll j = query[i].a; j <= query[i].b; j++) {
ll len = query[i].b - j;
auto it = std::upper_bound(arr[j].begin(), arr[j].end(),
len); result += it - arr[j].begin();
}
printf("%lld\n", result);
}
}
*/
// AtCoder Regular Contest 092-C
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
vector<LLPair> red(N);
for (ll i = 0; i < N; i++) {
scanf("%lld %lld", &red[i].a, &red[i].b);
}
vector<LLPair> blue(N);
for (ll i = 0; i < N; i++) {
scanf("%lld %lld", &blue[i].a, &blue[i].b);
}
vector<vector<ll>> r2b(N, vector<ll>(0));
vector<vector<ll>> b2r(N, vector<ll>(0));
for (ll i = 0; i < N; i++) {
for (ll j = 0; j < N; j++) {
if (red[i].a < blue[j].a && red[i].b < blue[j].b)
{
r2b[i].push_back(j);
b2r[j].push_back(i);
}
}
}
ll result = 0;
while (true) {
ll minCount = INF;
bool redSelect = true;
ll hold = -1;
for (ll i = 0; i < N; i++) {
if (r2b[i].size() > 0) {
if ((ll)r2b[i].size() < minCount)
{
minCount = (ll)r2b[i].size();
hold = i;
if (minCount == 1) {
break;
}
}
}
}
if (minCount > 1ll) {
for (ll i = 0; i < N; i++) {
if (b2r[i].size() > 0) {
if ((ll)b2r[i].size() < minCount)
{
minCount = (ll)b2r[i].size();
redSelect = false;
hold = i;
if (minCount == 1) {
break;
}
}
}
}
}
if (hold < 0) {
break;
}
if (redSelect) {
ll blueIndex = -1;
ll maxReverse = 0;
for (auto index : r2b[hold]) {
if ((ll)b2r[index].size() > maxReverse) {
maxReverse = (ll)b2r[index].size();
blueIndex = index;
}
}
r2b[hold].clear();
for (ll i = 0; i < N; i++) {
auto f = find(r2b[i].begin(), r2b[i].end(),
blueIndex); if (f != r2b[i].end()) { r2b[i].erase(f);
}
}
b2r[blueIndex].clear();
for (ll i = 0; i < N; i++) {
auto f = find(b2r[i].begin(), b2r[i].end(),
hold); if (f != b2r[i].end()) { b2r[i].erase(f);
}
}
result++;
}
else {
ll redIndex = -1;
ll maxReverse = 0;
for (auto index : b2r[hold]) {
if ((ll)r2b[index].size() > maxReverse) {
maxReverse = (ll)r2b[index].size();
redIndex = index;
}
}
b2r[hold].clear();
for (ll i = 0; i < N; i++) {
auto f = find(b2r[i].begin(), b2r[i].end(),
redIndex); if (f != b2r[i].end()) { b2r[i].erase(f);
}
}
r2b[redIndex].clear();
for (ll i = 0; i < N; i++) {
auto f = find(r2b[i].begin(), r2b[i].end(),
hold); if (f != r2b[i].end()) { r2b[i].erase(f);
}
}
result++;
}
}
printf("%lld\n", result);
}
*/
// AtCoder Beginner Contest 096-D
/*
bool Prime(ll x) {
if (x == 1 || x == 2) {
return true;
}
if (x % 2 == 0) {
return false;
}
for (ll i = 3; i <= (ll)std::sqrt(x); i += 2) {
if (x % i == 0) {
return false;
}
}
return true;
}
int main() {
ll N;
scanf("%lld", &N);
ll count = 0;
ll num = 6;
while (true)
{
if (Prime(num)) {
printf("%lld ", num);
count++;
}
if (count == N) {
break;
}
num += 5;
}
printf("\n");
}
*/
// AtCoder Grand Contest 024-B
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
vector<ll> P(N);
for (ll i = 0; i < N; i++) {
scanf("%lld", &P[i]);
}
vector<LLPair> pair;
for (ll i = 0; i < N; i++) {
pair.push_back(LLPair(P[i], i));
}
std::sort(pair.begin(), pair.end(), [](const LLPair &a, const LLPair &b)
{ return a.a < b.a;
});
ll cont = 0;
ll longest = 0;
ll prevIndex = -1;
for (ll i = 0; i < N; i++) {
if (pair[i].b > prevIndex) {
cont++;
}
else {
longest = max(cont, longest);
cont = 1;
}
prevIndex = pair[i].b;
}
longest = max(cont, longest);
printf("%lld\n", N - longest);
}
*/
// AtCoder Grand Contest 032-B
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
ll group = N % 2 == 0 ? N / 2 : (N + 1) / 2;
vector<LLPair> pair;
if (N % 2 == 0) {
for (ll i = 1; i <= N / 2; i++) {
pair.push_back(LLPair(i, N - i + 1));
}
}
else {
pair.push_back(LLPair(N, -1));
for (ll i = 1; i <= N / 2; i++) {
pair.push_back(LLPair(i, N - i));
}
}
vector<LLPair> result;
for (ll i = 0; i < pair.size(); i++) {
for (ll j = i + 1; j < pair.size(); j++) {
result.push_back(LLPair(pair[i].a, pair[j].a));
if (pair[j].b >= 0) {
result.push_back(LLPair(pair[i].a, pair[j].b));
}
if (pair[i].b >= 0) {
result.push_back(LLPair(pair[i].b, pair[j].a));
if (pair[j].b >= 0) {
result.push_back(LLPair(pair[i].b,
pair[j].b));
}
}
}
}
printf("%d\n", (int)result.size());
for (auto p : result) {
printf("%lld %lld\n", p.a, p.b);
}
}
*/
// AtCoder Beginner Contest 054-C
/*
// nPn�̏���ɑ��ď��������s����
void foreach_permutation(int n, std::function<void(int *)> f) {
int *indexes = new int[n];
for (int i = 0; i < n; i++) indexes[i] = i;
do {
f(indexes);
} while (std::next_permutation(indexes, indexes + n));
delete[] indexes;
}
ll N;
vector<vector<ll>> graph;
ll result;
int main() {
scanf("%lld", &N);
ll M;
scanf("%lld", &M);
graph.resize(N);
for (ll i = 0; i < M; i++) {
ll a;
scanf("%lld", &a);
ll b;
scanf("%lld", &b);
graph[a - 1].push_back(b - 1);
graph[b - 1].push_back(a - 1);
}
result = 0;
foreach_permutation(N - 1, [](int *indexes) {
//indexes[0] ~ indexes[N - 2]
ll prev = 0;
bool ok = true;
for (ll i = 0; i < N - 1; i++) {
ll next = indexes[i] + 1;
auto it = find(graph[prev].begin(), graph[prev].end(),
next); if (it == graph[prev].end()) {
//no path
ok = false;
break;
}
prev = next;
}
if (ok) {
result++;
}
});
printf("%lld\n", result);
}
*/
// AtCoder Beginner Contest 126
/*
struct UnionFindTree {
ll num_node = 0;
ll num_root = 0;
vector<ll> parent;
vector<ll> count;
UnionFindTree(ll num_node) {
this->num_node = num_node;
this->num_root = num_node;
parent.clear();
parent.resize(num_node);
count.clear();
count.resize(num_node);
for (ll i = 0; i < num_node; i++) {
parent[i] = i;
count[i] = 1;
}
}
ll FindRoot(ll node) {
vector<ll> found_node;
while (true) {
if (parent[node] == node) {
for (auto index : found_node) {
parent[index] = node;
}
break;
}
else {
found_node.push_back(node);
node = parent[node];
}
}
return node;
}
bool Unite(ll node1, ll node2) {
ll node1root = FindRoot(node1);
ll node2root = FindRoot(node2);
if (node1root == node2root) {
return false;
}
count[node1root] += count[node2root];
count[node2root] = 0;
parent[node2root] = node1root;
this->num_root--;
return true;
}
ll CountNode(ll node) {
return count[FindRoot(node)];
}
ll CountRoot() {
return this->num_root;
}
};
int main() {
ll N;
scanf("%lld", &N);
ll M;
scanf("%lld", &M);
UnionFindTree uf(N);
for (ll i = 0; i < M; i++) {
ll X;
scanf("%lld", &X);
ll Y;
scanf("%lld", &Y);
ll Z;
scanf("%lld", &Z);
uf.Unite(X - 1, Y - 1);
}
printf("%lld\n", uf.CountRoot());
}
*/
// AtCoder Beginner Contest 096-D
/*
void recursive_comb(int *indexes, int s, int rest, std::function<void(int *)> f)
{ if (rest == 0) { f(indexes);
}
else {
if (s < 0) return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCk�̑g�ݍ��킹�ɑ��ď��������s����
void foreach_comb(int n, int k, std::function<void(int *)> f) {
int *indexes = new int[k];
recursive_comb(indexes, n - 1, k, f);
delete[] indexes;
}
bool Prime(ll x) {
if (x == 1 || x == 2) {
return true;
}
if (x % 2 == 0) {
return false;
}
for (ll i = 3; i <= (ll)std::sqrt(x); i += 2) {
if (x % i == 0) {
return false;
}
}
return true;
}
ll A[8] = {
2, 5, 7, 13, 19, 37, 67, 79
};
bool success;
int main() {
success = true;
foreach_comb(8, 5, [](int *indexes) {
//std::cout << indexes[0] << ',' << indexes[1] << ',' <<
indexes[2] << ',' << indexes[3] << ',' << indexes[4] << std::endl; ll sum =
A[indexes[0]] + A[indexes[1]] + A[indexes[2]] + A[indexes[3]] + A[indexes[4]];
if (Prime(sum) == true) {
success = false;
}
});
printf("%d", success ? 1 : 0);
}
*/
// AtCoder Regular Contest 062
/*
int main() {
char s[101010];
scanf("%s", s);
ll len = strlen(s);
ll result = 0;
for (ll i = 0; i < len; i++) {
if (i % 2 == 0) {
//g
if (s[i] == 'p') {
result--;
}
}
else {
//p
if (s[i] == 'g') {
result++;
}
}
}
printf("%lld\n", result);
}
*/
// diverta 2019 Programming Contest 2 - C
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
std::sort(A.begin(), A.end(), std::greater<ll>());
if (A.size() == 2) {
printf("%lld\n", A[0] - A[1]);
printf("%lld %lld\n", A[0], A[1]);
return 0;
}
vector<LLPair> result;
ll hold = A[N - 1];
bool sw = false;
for (ll i = 1; i < N - 1; i++) {
if (A[i] >= 0) {
result.push_back(LLPair(hold, A[i]));
hold = hold - A[i];
}
else {
if (sw == false) {
result.push_back(LLPair(A[0], hold));
hold = A[0] - hold;
sw = true;
}
result.push_back(LLPair(hold, A[i]));
hold = hold - A[i];
}
}
if (sw == false) {
result.push_back(LLPair(A[0], hold));
hold = A[0] - hold;
}
printf("%lld\n", hold);
for (auto item : result) {
printf("%lld %lld\n", item.a, item.b);
}
}
*/
// SoundHound Inc. Programming Contest 2018 -Masters Tournament- C
/*
int main() {
ll n;
scanf("%lld", &n);
ll m;
scanf("%lld", &m);
ll d;
scanf("%lld", &d);
ll x = d == 0 ? n : 2 * (n - d);
printf("%0.10f\n", (double)x * (double)(m - 1) / (double)n / (double)n);
}
*/
// AtCoder Beginner Contest 089-D
/*
struct LLPair {
ll L = 0;
ll R = 0;
};
struct LLPoint {
ll x = 0;
ll y = 0;
LLPoint() {}
LLPoint(ll x, ll y) {
this->x = x;
this->y = y;
}
};
int main() {
ll H;
scanf("%lld", &H);
ll W;
scanf("%lld", &W);
ll D;
scanf("%lld", &D);
vector<vector<ll>> A(H, vector<ll>(W, 0));
for (ll j = 0; j < H; j++) {
for (ll i = 0; i < W; i++) {
scanf("%lld", &A[j][i]);
}
}
ll Q;
scanf("%lld", &Q);
vector<LLPair> query(Q);
for (ll i = 0; i < Q; i++) {
scanf("%lld %lld", &query[i].L, &query[i].R);
}
vector<LLPoint> point(H * W);
for (ll j = 0; j < H; j++) {
for (ll i = 0; i < W; i++) {
point[A[j][i] - 1] = LLPoint(i, j);
}
}
vector<ll> integral(H * W, 0);
for (ll i = 0; i < D; i++) {
for (ll j = i; j < H * W; j += D) {
ll next = j + D;
if (next >= H * W) {
break;
}
integral[next] = integral[j] + abs(point[j].x -
point[next].x) + abs(point[j].y - point[next].y);
}
}
for (auto item : query) {
printf("%lld\n", integral[item.R - 1] - integral[item.L - 1]);
}
}
*/
// AtCoder Regular Contest 097-D
/*
struct LLPair {
ll a = 0;
ll b = 0;
};
struct UnionFindTree {
ll num_node = 0;
vector<ll> parent;
vector<ll> count;
UnionFindTree(ll num_node) {
this->num_node = num_node;
parent.clear();
parent.resize(num_node);
count.clear();
count.resize(num_node);
for (ll i = 0; i < num_node; i++) {
parent[i] = i;
count[i] = 1;
}
}
ll FindRoot(ll node) {
vector<ll> found_node;
while (true) {
if (parent[node] == node) {
for (auto index : found_node) {
parent[index] = node;
}
break;
}
else {
found_node.push_back(node);
node = parent[node];
}
}
return node;
}
bool Unite(ll node1, ll node2) {
ll node1root = FindRoot(node1);
ll node2root = FindRoot(node2);
if (node1root == node2root) {
return false;
}
count[node1root] += count[node2root];
count[node2root] = 0;
parent[node2root] = node1root;
return true;
}
ll Count(ll node) {
return count[FindRoot(node)];
}
};
int main() {
ll N;
scanf("%lld", &N);
ll M;
scanf("%lld", &M);
vector<ll> p(N);
for (ll i = 0; i < N; i++) {
scanf("%lld", &p[i]);
}
vector<LLPair> sw(M);
for (ll i = 0; i < M; i++) {
scanf("%lld %lld", &sw[i].a, &sw[i].b);
}
UnionFindTree uf(N);
for (ll i = 0; i < M; i++) {
uf.Unite(sw[i].a - 1, sw[i].b - 1);
}
ll result = 0;
for (ll i = 0; i < N; i++) {
if (uf.FindRoot(p[i] - 1) == uf.FindRoot(i)) {
result++;
}
}
printf("%lld\n", result);
}
*/
// AtCoder Grand Contest 019-B
/*
//TLE
int main() {
char A[202020];
scanf("%s", A);
ll len = strlen(A);
ll result = 1;
for (ll i = 0; i < len * 2ll - 1ll; i++) { //0:0������
1:0�����ڂ�1�����ڂ̊� 2:1������ if (i % 2 == 0) { ll index = i / 2; ll searchMax =
min(index, len - 1 - index);
//i/2�����ڂ𒆐S
ll count = 0;
for (ll j = 1; j <= searchMax; j++) {
if (A[index - j] != A[index + j]) {
count++;
}
}
result += count;
}
else {
ll index = i / 2;
ll searchMax = min(index + 1, len - 1 - index);
//i/2�����ڂ̉E�𒆐S
ll count = 0;
for (ll j = 0; j < searchMax; j++) {
if (A[index - j] != A[index + j + 1]) {
count++;
}
}
result += count;
}
}
printf("%lld\n", result);
}
*/ | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll INF = 9223372036854775807;
// AtCoder Beginner Contest 134-E
int main() {
ll N;
scanf("%lld", &N);
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
// priority_queue<ll, vector<ll>, greater<ll>> pq;
multiset<ll> ms;
ll result = 0;
for (ll i = 0; i < N; i++) {
// for (auto it = ms.begin(); it != ms.end(); it++) {
// printf("%lld ", *it);
// }
// printf("\n");
if (ms.empty()) {
// printf("empty\n");
result++;
ms.insert(A[i]);
} else {
auto it = ms.lower_bound(A[i]);
if (it == ms.begin()) {
// �����̐��l�͂Ȃ�
// printf("found: begin - 1\n");
ms.insert(A[i]);
result++;
} else {
it--;
// printf("found: %lld\n", *it);
ms.erase(it);
ms.insert(A[i]);
}
}
}
printf("%lld\n", result);
}
// AtCoder Beginner Contest 136-E
/*
vector<ll> Divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i);
}
}
}
std::sort(ret.begin(), ret.end());
return (ret);
}
int main() {
ll N;
scanf("%lld", &N);
ll K;
scanf("%lld", &K);
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
ll sumAll = 0;
for (ll i = 0; i < N; i++) {
sumAll += A[i];
}
auto list = Divisor(sumAll);
ll result = 1;
for (auto val : list) {
ll sum = 0;
vector<ll> mod;
for (ll i = 0; i < N; i++) {
ll m = A[i] % val;
if(m > 0)
if (m <= val / 2) {
mod.push_back(m);
sum += m;
}
else {
mod.push_back(m - val);
sum += m - val;
}
}
if (sum < 0) {
std::sort(mod.begin(), mod.end());
for (ll i = 0; i < mod.size(); i++) {
mod[i] += val;
sum += val;
if (sum == 0) {
break;
}
}
}
else if(sum > 0){
std::sort(mod.begin(), mod.end(), std::greater<ll>());
for (ll i = 0; i < mod.size(); i++) {
mod[i] -= val;
sum -= val;
if (sum == 0) {
break;
}
}
}
ll dbl = 0;
for (auto m : mod) {
dbl += abs(m);
}
if (dbl / 2 <= K) {
result = val;
}
}
printf("%lld\n", result);
}
*/
// AtCoder Grand Contest 024-C
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
ll height = 0;
ll last = 0;
ll result = 0;
queue<LLPair> lastQ;
for (ll i = N - 1; i >= 0; i--) {
height--;
if (height < 0) {
height = 0;
}
//last�̍X�V
if (lastQ.empty() == false) {
LLPair p = lastQ.front();
if (p.a - i == p.b) {
lastQ.pop();
last--;
}
}
result += last;
if (A[i] < height) {
result = -1;
break;
}
if (A[i] > height) {
result++;
height = A[i];
//last�̍X�V
lastQ.push(LLPair(i, height));
last++;
}
}
if (height > 0) {
result = -1;
}
printf("%lld\n", result);
}
*/
// AtCoder Regular Contest 092-C
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
vector<LLPair> red(N);
for (ll i = 0; i < N; i++) {
scanf("%lld %lld", &red[i].a, &red[i].b);
}
vector<LLPair> blue(N);
for (ll i = 0; i < N; i++) {
scanf("%lld %lld", &blue[i].a, &blue[i].b);
}
std::sort(blue.begin(), blue.end(), [](const LLPair &a, const LLPair &b)
{ return a.a < b.a;
});
ll result = 0;
vector<bool> redFinish(N, false);
for (auto item : blue) {
ll maxY = -1;
ll hold = -1;
for (ll i = 0; i < N; i++) {
if (redFinish[i] == true) {
continue;
}
if (red[i].a >= item.a) {
continue;
}
if (red[i].b >= item.b) {
continue;
}
if (red[i].b > maxY) {
maxY = red[i].b;
hold = i;
}
}
if (hold >= 0) {
redFinish[hold] = true;
result++;
}
}
printf("%lld\n", result);
}
*/
// AtCoder Beginner Contest 106-D
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
ll M;
scanf("%lld", &M);
ll Q;
scanf("%lld", &Q);
vector<LLPair> lr(M);
for (ll i = 0; i < M; i++) {
scanf("%lld %lld", &lr[i].a, &lr[i].b);
}
vector<LLPair> query(Q);
for (ll i = 0; i < Q; i++) {
scanf("%lld %lld", &query[i].a, &query[i].b);
}
vector<vector<ll>> arr(N + 1, vector<ll>(0));
for (ll i = 0; i < M; i++) {
arr[lr[i].a].push_back(lr[i].b - lr[i].a);
}
for (ll i = 1; i <= N; i++) {
std::sort(arr[i].begin(), arr[i].end());
}
for (ll i = 0; i < Q; i++) {
ll result = 0;
for (ll j = query[i].a; j <= query[i].b; j++) {
ll len = query[i].b - j;
auto it = std::upper_bound(arr[j].begin(), arr[j].end(),
len); result += it - arr[j].begin();
}
printf("%lld\n", result);
}
}
*/
// AtCoder Regular Contest 092-C
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
vector<LLPair> red(N);
for (ll i = 0; i < N; i++) {
scanf("%lld %lld", &red[i].a, &red[i].b);
}
vector<LLPair> blue(N);
for (ll i = 0; i < N; i++) {
scanf("%lld %lld", &blue[i].a, &blue[i].b);
}
vector<vector<ll>> r2b(N, vector<ll>(0));
vector<vector<ll>> b2r(N, vector<ll>(0));
for (ll i = 0; i < N; i++) {
for (ll j = 0; j < N; j++) {
if (red[i].a < blue[j].a && red[i].b < blue[j].b)
{
r2b[i].push_back(j);
b2r[j].push_back(i);
}
}
}
ll result = 0;
while (true) {
ll minCount = INF;
bool redSelect = true;
ll hold = -1;
for (ll i = 0; i < N; i++) {
if (r2b[i].size() > 0) {
if ((ll)r2b[i].size() < minCount)
{
minCount = (ll)r2b[i].size();
hold = i;
if (minCount == 1) {
break;
}
}
}
}
if (minCount > 1ll) {
for (ll i = 0; i < N; i++) {
if (b2r[i].size() > 0) {
if ((ll)b2r[i].size() < minCount)
{
minCount = (ll)b2r[i].size();
redSelect = false;
hold = i;
if (minCount == 1) {
break;
}
}
}
}
}
if (hold < 0) {
break;
}
if (redSelect) {
ll blueIndex = -1;
ll maxReverse = 0;
for (auto index : r2b[hold]) {
if ((ll)b2r[index].size() > maxReverse) {
maxReverse = (ll)b2r[index].size();
blueIndex = index;
}
}
r2b[hold].clear();
for (ll i = 0; i < N; i++) {
auto f = find(r2b[i].begin(), r2b[i].end(),
blueIndex); if (f != r2b[i].end()) { r2b[i].erase(f);
}
}
b2r[blueIndex].clear();
for (ll i = 0; i < N; i++) {
auto f = find(b2r[i].begin(), b2r[i].end(),
hold); if (f != b2r[i].end()) { b2r[i].erase(f);
}
}
result++;
}
else {
ll redIndex = -1;
ll maxReverse = 0;
for (auto index : b2r[hold]) {
if ((ll)r2b[index].size() > maxReverse) {
maxReverse = (ll)r2b[index].size();
redIndex = index;
}
}
b2r[hold].clear();
for (ll i = 0; i < N; i++) {
auto f = find(b2r[i].begin(), b2r[i].end(),
redIndex); if (f != b2r[i].end()) { b2r[i].erase(f);
}
}
r2b[redIndex].clear();
for (ll i = 0; i < N; i++) {
auto f = find(r2b[i].begin(), r2b[i].end(),
hold); if (f != r2b[i].end()) { r2b[i].erase(f);
}
}
result++;
}
}
printf("%lld\n", result);
}
*/
// AtCoder Beginner Contest 096-D
/*
bool Prime(ll x) {
if (x == 1 || x == 2) {
return true;
}
if (x % 2 == 0) {
return false;
}
for (ll i = 3; i <= (ll)std::sqrt(x); i += 2) {
if (x % i == 0) {
return false;
}
}
return true;
}
int main() {
ll N;
scanf("%lld", &N);
ll count = 0;
ll num = 6;
while (true)
{
if (Prime(num)) {
printf("%lld ", num);
count++;
}
if (count == N) {
break;
}
num += 5;
}
printf("\n");
}
*/
// AtCoder Grand Contest 024-B
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
vector<ll> P(N);
for (ll i = 0; i < N; i++) {
scanf("%lld", &P[i]);
}
vector<LLPair> pair;
for (ll i = 0; i < N; i++) {
pair.push_back(LLPair(P[i], i));
}
std::sort(pair.begin(), pair.end(), [](const LLPair &a, const LLPair &b)
{ return a.a < b.a;
});
ll cont = 0;
ll longest = 0;
ll prevIndex = -1;
for (ll i = 0; i < N; i++) {
if (pair[i].b > prevIndex) {
cont++;
}
else {
longest = max(cont, longest);
cont = 1;
}
prevIndex = pair[i].b;
}
longest = max(cont, longest);
printf("%lld\n", N - longest);
}
*/
// AtCoder Grand Contest 032-B
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
ll group = N % 2 == 0 ? N / 2 : (N + 1) / 2;
vector<LLPair> pair;
if (N % 2 == 0) {
for (ll i = 1; i <= N / 2; i++) {
pair.push_back(LLPair(i, N - i + 1));
}
}
else {
pair.push_back(LLPair(N, -1));
for (ll i = 1; i <= N / 2; i++) {
pair.push_back(LLPair(i, N - i));
}
}
vector<LLPair> result;
for (ll i = 0; i < pair.size(); i++) {
for (ll j = i + 1; j < pair.size(); j++) {
result.push_back(LLPair(pair[i].a, pair[j].a));
if (pair[j].b >= 0) {
result.push_back(LLPair(pair[i].a, pair[j].b));
}
if (pair[i].b >= 0) {
result.push_back(LLPair(pair[i].b, pair[j].a));
if (pair[j].b >= 0) {
result.push_back(LLPair(pair[i].b,
pair[j].b));
}
}
}
}
printf("%d\n", (int)result.size());
for (auto p : result) {
printf("%lld %lld\n", p.a, p.b);
}
}
*/
// AtCoder Beginner Contest 054-C
/*
// nPn�̏���ɑ��ď��������s����
void foreach_permutation(int n, std::function<void(int *)> f) {
int *indexes = new int[n];
for (int i = 0; i < n; i++) indexes[i] = i;
do {
f(indexes);
} while (std::next_permutation(indexes, indexes + n));
delete[] indexes;
}
ll N;
vector<vector<ll>> graph;
ll result;
int main() {
scanf("%lld", &N);
ll M;
scanf("%lld", &M);
graph.resize(N);
for (ll i = 0; i < M; i++) {
ll a;
scanf("%lld", &a);
ll b;
scanf("%lld", &b);
graph[a - 1].push_back(b - 1);
graph[b - 1].push_back(a - 1);
}
result = 0;
foreach_permutation(N - 1, [](int *indexes) {
//indexes[0] ~ indexes[N - 2]
ll prev = 0;
bool ok = true;
for (ll i = 0; i < N - 1; i++) {
ll next = indexes[i] + 1;
auto it = find(graph[prev].begin(), graph[prev].end(),
next); if (it == graph[prev].end()) {
//no path
ok = false;
break;
}
prev = next;
}
if (ok) {
result++;
}
});
printf("%lld\n", result);
}
*/
// AtCoder Beginner Contest 126
/*
struct UnionFindTree {
ll num_node = 0;
ll num_root = 0;
vector<ll> parent;
vector<ll> count;
UnionFindTree(ll num_node) {
this->num_node = num_node;
this->num_root = num_node;
parent.clear();
parent.resize(num_node);
count.clear();
count.resize(num_node);
for (ll i = 0; i < num_node; i++) {
parent[i] = i;
count[i] = 1;
}
}
ll FindRoot(ll node) {
vector<ll> found_node;
while (true) {
if (parent[node] == node) {
for (auto index : found_node) {
parent[index] = node;
}
break;
}
else {
found_node.push_back(node);
node = parent[node];
}
}
return node;
}
bool Unite(ll node1, ll node2) {
ll node1root = FindRoot(node1);
ll node2root = FindRoot(node2);
if (node1root == node2root) {
return false;
}
count[node1root] += count[node2root];
count[node2root] = 0;
parent[node2root] = node1root;
this->num_root--;
return true;
}
ll CountNode(ll node) {
return count[FindRoot(node)];
}
ll CountRoot() {
return this->num_root;
}
};
int main() {
ll N;
scanf("%lld", &N);
ll M;
scanf("%lld", &M);
UnionFindTree uf(N);
for (ll i = 0; i < M; i++) {
ll X;
scanf("%lld", &X);
ll Y;
scanf("%lld", &Y);
ll Z;
scanf("%lld", &Z);
uf.Unite(X - 1, Y - 1);
}
printf("%lld\n", uf.CountRoot());
}
*/
// AtCoder Beginner Contest 096-D
/*
void recursive_comb(int *indexes, int s, int rest, std::function<void(int *)> f)
{ if (rest == 0) { f(indexes);
}
else {
if (s < 0) return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCk�̑g�ݍ��킹�ɑ��ď��������s����
void foreach_comb(int n, int k, std::function<void(int *)> f) {
int *indexes = new int[k];
recursive_comb(indexes, n - 1, k, f);
delete[] indexes;
}
bool Prime(ll x) {
if (x == 1 || x == 2) {
return true;
}
if (x % 2 == 0) {
return false;
}
for (ll i = 3; i <= (ll)std::sqrt(x); i += 2) {
if (x % i == 0) {
return false;
}
}
return true;
}
ll A[8] = {
2, 5, 7, 13, 19, 37, 67, 79
};
bool success;
int main() {
success = true;
foreach_comb(8, 5, [](int *indexes) {
//std::cout << indexes[0] << ',' << indexes[1] << ',' <<
indexes[2] << ',' << indexes[3] << ',' << indexes[4] << std::endl; ll sum =
A[indexes[0]] + A[indexes[1]] + A[indexes[2]] + A[indexes[3]] + A[indexes[4]];
if (Prime(sum) == true) {
success = false;
}
});
printf("%d", success ? 1 : 0);
}
*/
// AtCoder Regular Contest 062
/*
int main() {
char s[101010];
scanf("%s", s);
ll len = strlen(s);
ll result = 0;
for (ll i = 0; i < len; i++) {
if (i % 2 == 0) {
//g
if (s[i] == 'p') {
result--;
}
}
else {
//p
if (s[i] == 'g') {
result++;
}
}
}
printf("%lld\n", result);
}
*/
// diverta 2019 Programming Contest 2 - C
/*
struct LLPair {
ll a = 0;
ll b = 0;
LLPair() {}
LLPair(ll a, ll b) {
this->a = a;
this->b = b;
}
};
int main() {
ll N;
scanf("%lld", &N);
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
std::sort(A.begin(), A.end(), std::greater<ll>());
if (A.size() == 2) {
printf("%lld\n", A[0] - A[1]);
printf("%lld %lld\n", A[0], A[1]);
return 0;
}
vector<LLPair> result;
ll hold = A[N - 1];
bool sw = false;
for (ll i = 1; i < N - 1; i++) {
if (A[i] >= 0) {
result.push_back(LLPair(hold, A[i]));
hold = hold - A[i];
}
else {
if (sw == false) {
result.push_back(LLPair(A[0], hold));
hold = A[0] - hold;
sw = true;
}
result.push_back(LLPair(hold, A[i]));
hold = hold - A[i];
}
}
if (sw == false) {
result.push_back(LLPair(A[0], hold));
hold = A[0] - hold;
}
printf("%lld\n", hold);
for (auto item : result) {
printf("%lld %lld\n", item.a, item.b);
}
}
*/
// SoundHound Inc. Programming Contest 2018 -Masters Tournament- C
/*
int main() {
ll n;
scanf("%lld", &n);
ll m;
scanf("%lld", &m);
ll d;
scanf("%lld", &d);
ll x = d == 0 ? n : 2 * (n - d);
printf("%0.10f\n", (double)x * (double)(m - 1) / (double)n / (double)n);
}
*/
// AtCoder Beginner Contest 089-D
/*
struct LLPair {
ll L = 0;
ll R = 0;
};
struct LLPoint {
ll x = 0;
ll y = 0;
LLPoint() {}
LLPoint(ll x, ll y) {
this->x = x;
this->y = y;
}
};
int main() {
ll H;
scanf("%lld", &H);
ll W;
scanf("%lld", &W);
ll D;
scanf("%lld", &D);
vector<vector<ll>> A(H, vector<ll>(W, 0));
for (ll j = 0; j < H; j++) {
for (ll i = 0; i < W; i++) {
scanf("%lld", &A[j][i]);
}
}
ll Q;
scanf("%lld", &Q);
vector<LLPair> query(Q);
for (ll i = 0; i < Q; i++) {
scanf("%lld %lld", &query[i].L, &query[i].R);
}
vector<LLPoint> point(H * W);
for (ll j = 0; j < H; j++) {
for (ll i = 0; i < W; i++) {
point[A[j][i] - 1] = LLPoint(i, j);
}
}
vector<ll> integral(H * W, 0);
for (ll i = 0; i < D; i++) {
for (ll j = i; j < H * W; j += D) {
ll next = j + D;
if (next >= H * W) {
break;
}
integral[next] = integral[j] + abs(point[j].x -
point[next].x) + abs(point[j].y - point[next].y);
}
}
for (auto item : query) {
printf("%lld\n", integral[item.R - 1] - integral[item.L - 1]);
}
}
*/
// AtCoder Regular Contest 097-D
/*
struct LLPair {
ll a = 0;
ll b = 0;
};
struct UnionFindTree {
ll num_node = 0;
vector<ll> parent;
vector<ll> count;
UnionFindTree(ll num_node) {
this->num_node = num_node;
parent.clear();
parent.resize(num_node);
count.clear();
count.resize(num_node);
for (ll i = 0; i < num_node; i++) {
parent[i] = i;
count[i] = 1;
}
}
ll FindRoot(ll node) {
vector<ll> found_node;
while (true) {
if (parent[node] == node) {
for (auto index : found_node) {
parent[index] = node;
}
break;
}
else {
found_node.push_back(node);
node = parent[node];
}
}
return node;
}
bool Unite(ll node1, ll node2) {
ll node1root = FindRoot(node1);
ll node2root = FindRoot(node2);
if (node1root == node2root) {
return false;
}
count[node1root] += count[node2root];
count[node2root] = 0;
parent[node2root] = node1root;
return true;
}
ll Count(ll node) {
return count[FindRoot(node)];
}
};
int main() {
ll N;
scanf("%lld", &N);
ll M;
scanf("%lld", &M);
vector<ll> p(N);
for (ll i = 0; i < N; i++) {
scanf("%lld", &p[i]);
}
vector<LLPair> sw(M);
for (ll i = 0; i < M; i++) {
scanf("%lld %lld", &sw[i].a, &sw[i].b);
}
UnionFindTree uf(N);
for (ll i = 0; i < M; i++) {
uf.Unite(sw[i].a - 1, sw[i].b - 1);
}
ll result = 0;
for (ll i = 0; i < N; i++) {
if (uf.FindRoot(p[i] - 1) == uf.FindRoot(i)) {
result++;
}
}
printf("%lld\n", result);
}
*/
// AtCoder Grand Contest 019-B
/*
//TLE
int main() {
char A[202020];
scanf("%s", A);
ll len = strlen(A);
ll result = 1;
for (ll i = 0; i < len * 2ll - 1ll; i++) { //0:0������
1:0�����ڂ�1�����ڂ̊� 2:1������ if (i % 2 == 0) { ll index = i / 2; ll searchMax =
min(index, len - 1 - index);
//i/2�����ڂ𒆐S
ll count = 0;
for (ll j = 1; j <= searchMax; j++) {
if (A[index - j] != A[index + j]) {
count++;
}
}
result += count;
}
else {
ll index = i / 2;
ll searchMax = min(index + 1, len - 1 - index);
//i/2�����ڂ̉E�𒆐S
ll count = 0;
for (ll j = 0; j < searchMax; j++) {
if (A[index - j] != A[index + j + 1]) {
count++;
}
}
result += count;
}
}
printf("%lld\n", result);
}
*/ | replace | 45 | 46 | 45 | 46 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
const int INF = (int)1e9;
const LL INFL = (LL)1e18;
const int MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) { cin >> a[i]; }
multiset<int> que;
que.insert(a[0]);
FOR(i, 1, n) {
auto itr = lower_bound(all(que), a[i]);
if (itr == que.begin()) {
que.insert(a[i]);
} else {
itr--;
que.erase(itr);
que.insert(a[i]);
}
}
cout << que.size() << endl;
} | #include <bits/stdc++.h>
// #define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
const int INF = (int)1e9;
const LL INFL = (LL)1e18;
const int MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) { cin >> a[i]; }
multiset<int> que;
que.insert(a[0]);
FOR(i, 1, n) {
auto itr = que.lower_bound(a[i]);
if (itr == que.begin()) {
que.insert(a[i]);
} else {
itr--;
que.erase(itr);
que.insert(a[i]);
}
}
cout << que.size() << endl;
} | replace | 45 | 46 | 45 | 46 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
// #include<unordered_set>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
st;*/
#pragma GCC optimize("Ofast")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#define pb push_back
#define ld long double
mt19937 rnd(51);
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (a.size() == 0) {
a.pb(p);
} else {
if (a.back() >= p) {
a.pb(p);
} else {
int l = -1, r = n;
while (r - l > 1) {
int mid = (r + l) / 2;
if (a[mid] < p) {
r = mid;
} else {
l = mid;
}
}
a[r] = p;
}
}
}
cout << a.size() << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
// #include<unordered_set>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
st;*/
#pragma GCC optimize("Ofast")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#define pb push_back
#define ld long double
mt19937 rnd(51);
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (a.size() == 0) {
a.pb(p);
} else {
if (a.back() >= p) {
a.pb(p);
} else {
int l = -1, r = a.size();
while (r - l > 1) {
int mid = (r + l) / 2;
if (a[mid] < p) {
r = mid;
} else {
l = mid;
}
}
a[r] = p;
}
}
}
cout << a.size() << endl;
return 0;
}
| replace | 47 | 48 | 47 | 48 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N;
int main() {
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
// 各部分増加列の最大値を格納
vector<int> l;
l.push_back(A[N - 1]);
for (int i = N - 2; i >= 0; i--) {
sort(l.begin(), l.end());
// 一番でかいやつ以上なら、新たに部分草加列を作成
if (A[i] >= l[l.size() - 1]) {
l.push_back(A[i]);
continue;
} else if (A[i] < l[0]) {
l[0] = A[i];
continue;
}
// 追加可能な中で一番最小値の小さい部分増加列に追加
auto it = upper_bound(l.begin(), l.end(), A[i]);
*it = A[i];
}
cout << l.size();
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N;
int main() {
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
// 各部分増加列の最大値を格納
vector<int> l;
l.push_back(A[N - 1]);
for (int i = N - 2; i >= 0; i--) {
// 一番でかいやつ以上なら、新たに部分草加列を作成
if (A[i] >= l[l.size() - 1]) {
l.push_back(A[i]);
continue;
} else if (A[i] < l[0]) {
l[0] = A[i];
continue;
}
// 追加可能な中で一番最小値の小さい部分増加列に追加
auto it = upper_bound(l.begin(), l.end(), A[i]);
*it = A[i];
}
cout << l.size();
return 0;
} | delete | 21 | 22 | 21 | 21 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
ll bin(vector<ll> vec, ll s, ll e, ll v) {
if (e - s > 1) {
ll mid = ((s + e) / 2);
if (vec[mid] >= v) {
return bin(vec, mid, e, v);
} else {
return bin(vec, s, mid, v);
}
} else {
return e;
}
}
int main(int argc, const char *argv[]) {
ll N;
cin >> N;
vector<ll> maximums = vector<ll>();
ll count = 0;
for (ll i = 0; i < N; i++) {
ll data;
cin >> data;
if (count == 0 || maximums[count - 1] >= data) {
maximums.push_back(data);
count++;
continue;
} else if (maximums[0] < data) {
maximums[0] = data;
continue;
}
ll index = bin(maximums, 0, count - 1, data);
maximums[index] = data;
}
cout << count;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
ll bin(vector<ll> &vec, ll s, ll e, ll v) {
if (e - s > 1) {
ll mid = ((s + e) / 2);
if (vec[mid] >= v) {
return bin(vec, mid, e, v);
} else {
return bin(vec, s, mid, v);
}
} else {
return e;
}
}
int main(int argc, const char *argv[]) {
ll N;
cin >> N;
vector<ll> maximums = vector<ll>();
ll count = 0;
for (ll i = 0; i < N; i++) {
ll data;
cin >> data;
if (count == 0 || maximums[count - 1] >= data) {
maximums.push_back(data);
count++;
continue;
} else if (maximums[0] < data) {
maximums[0] = data;
continue;
}
ll index = bin(maximums, 0, count - 1, data);
maximums[index] = data;
}
cout << count;
return 0;
}
| replace | 9 | 10 | 9 | 10 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
ll a[MAX_N];
multiset<ll> mst;
int main(void) {
// Here your code !
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%lld", &(a[i]));
}
mst.insert(INF);
for (int i = 0; i < n; ++i) {
// printf("mst: ");
// for (auto &e : mst) {
// printf("%lld ", e);
// }
// printf("\n");
if (*mst.begin() >= a[i] || mst.empty()) {
mst.insert(a[i]);
continue;
}
auto ptr = upper_bound(mst.begin(), mst.end(), a[i] - 1);
auto prv = prev(ptr);
if (prv == mst.end()) {
mst.insert(a[i]);
continue;
}
mst.erase(prv);
mst.insert(a[i]);
}
printf("%d\n", mst.size() - 1);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
ll a[MAX_N];
multiset<ll> mst;
int main(void) {
// Here your code !
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%lld", &(a[i]));
}
mst.insert(INF);
for (int i = 0; i < n; ++i) {
// printf("mst: ");
// for (auto &e : mst) {
// printf("%lld ", e);
// }
// printf("\n");
if (*mst.begin() >= a[i] || mst.empty()) {
mst.insert(a[i]);
continue;
}
auto ptr = mst.upper_bound(a[i] - 1);
auto prv = prev(ptr);
if (prv == mst.end()) {
mst.insert(a[i]);
continue;
}
mst.erase(prv);
mst.insert(a[i]);
}
printf("%d\n", mst.size() - 1);
return 0;
}
| replace | 37 | 38 | 37 | 38 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
int A[100010] = {};
for (int i = 0; i < N; i++)
cin >> A[i];
multiset<int> S;
S.insert(-1145141919);
S.insert(1145141919);
S.insert(A[0]);
for (int i = 1; i < N; i++) {
auto it = S.lower_bound(A[i]);
it--;
if (*it == -1145141919)
S.insert(A[i]);
else {
S.erase(S.lower_bound(A[i])--);
S.insert(A[i]);
}
}
cout << (int)S.size() - 2 << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
int A[100010] = {};
for (int i = 0; i < N; i++)
cin >> A[i];
multiset<int> S;
S.insert(-1145141919);
S.insert(1145141919);
S.insert(A[0]);
for (int i = 1; i < N; i++) {
auto it = S.lower_bound(A[i]);
it--;
if (*it == -1145141919)
S.insert(A[i]);
else {
it = S.erase(it);
S.insert(A[i]);
}
}
cout << (int)S.size() - 2 << endl;
} | replace | 20 | 21 | 20 | 21 | -6 | free(): invalid pointer
|
p02973 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> A(n), B;
for (auto &a : A)
cin >> a;
for (auto i = A.rbegin(); i != A.rend(); i++) {
auto a = (*i);
auto j = upper_bound(B.begin(), B.end(), a);
if (j == B.end())
B.push_back(a);
else
(*j) = a;
sort(B.begin(), B.end());
}
cout << B.size() << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> A(n), B;
for (auto &a : A)
cin >> a;
for (auto i = A.rbegin(); i != A.rend(); i++) {
auto a = (*i);
auto j = upper_bound(B.begin(), B.end(), a);
if (j == B.end())
B.push_back(a);
else
(*j) = a;
}
cout << B.size() << endl;
return 0;
} | delete | 20 | 21 | 20 | 20 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); \
i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) for (i64 i = 1; i <= n; ++i)
#define RREP(i, n) for (i64 i = n - 1; i >= 0; --i)
#define RREPS(i, n) for (i64 i = n; i >= 1; --i)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define pb push_back
#define mp make_pair
#define F first
#define S second
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 C> i64 SIZE(const C &c) {
return static_cast<i64>(c.size());
}
template <typename T, size_t N> i64 SIZE(const T (&)[N]) {
return static_cast<i64>(N);
}
struct ProconInit {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
ProconInit() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} PROCON_INIT;
int main() {
i64 N;
cin >> N;
vector<i64> A(N);
REP(i, N) cin >> A[i];
i64 cnt = 0;
multiset<i64> ms;
REP(i, N) {
if (ms.empty()) {
ms.insert(A[i]);
cnt++;
continue;
}
auto lb = lower_bound(ms.begin(), ms.end(), A[i]);
if (lb == ms.begin()) {
ms.insert(A[i]);
cnt++;
} else {
lb--;
ms.erase(lb);
ms.insert(A[i]);
}
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); \
i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) for (i64 i = 1; i <= n; ++i)
#define RREP(i, n) for (i64 i = n - 1; i >= 0; --i)
#define RREPS(i, n) for (i64 i = n; i >= 1; --i)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define pb push_back
#define mp make_pair
#define F first
#define S second
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 C> i64 SIZE(const C &c) {
return static_cast<i64>(c.size());
}
template <typename T, size_t N> i64 SIZE(const T (&)[N]) {
return static_cast<i64>(N);
}
struct ProconInit {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
ProconInit() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} PROCON_INIT;
int main() {
i64 N;
cin >> N;
vector<i64> A(N);
REP(i, N) cin >> A[i];
i64 cnt = 0;
multiset<i64> ms;
REP(i, N) {
if (ms.empty()) {
ms.insert(A[i]);
cnt++;
continue;
}
auto lb = ms.lower_bound(A[i]);
if (lb == ms.begin()) {
ms.insert(A[i]);
cnt++;
} else {
lb--;
ms.erase(lb);
ms.insert(A[i]);
}
}
cout << cnt << endl;
return 0;
} | replace | 91 | 92 | 91 | 92 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
multiset<ll> x;
for (int i = 0; i < n; ++i) {
ll a;
cin >> a;
auto it = lower_bound(x.begin(), x.end(), a);
if (it == x.begin()) {
x.insert(it, a);
} else {
x.erase(--it);
x.insert(++it, a);
}
}
cout << x.size() << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
multiset<ll> x;
for (int i = 0; i < n; ++i) {
ll a;
cin >> a;
auto it = x.lower_bound(a);
if (it == x.begin()) {
x.insert(it, a);
} else {
x.erase(--it);
x.insert(++it, a);
}
}
cout << x.size() << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> A;
int main() {
cin >> N;
A.resize(N);
rep(i, N) { cin >> A[i]; }
multiset<ll> st;
rep(i, N) {
auto iter = lower_bound(st.begin(), st.end(), A[i]);
if (iter == st.begin()) {
st.insert(A[i]);
} else {
// 置き換え
iter--;
st.erase(iter);
st.insert(A[i]);
}
}
cout << st.size() << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> A;
int main() {
cin >> N;
A.resize(N);
rep(i, N) { cin >> A[i]; }
multiset<ll> st;
rep(i, N) {
// auto iter = lower_bound(st.begin(), st.end(), A[i]);
auto iter = st.lower_bound(A[i]);
if (iter == st.begin()) {
st.insert(A[i]);
} else {
// 置き換え
iter--;
st.erase(iter);
st.insert(A[i]);
}
}
cout << st.size() << endl;
} | replace | 18 | 19 | 18 | 20 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#ifdef LOCAL
#include <contest/local.hpp>
#else
#define LOG(...) \
do { \
} while (false)
#endif
#define REP(i, n) \
for (decay_t<decltype(n)> i = 0, i##__len = (n); i < i##__len; ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
auto main() -> int {
cin.tie(nullptr);
ios::sync_with_stdio(false);
unsigned n;
cin >> n;
multiset<int> group;
vector<int> a;
REP(i, n) {
int value;
cin >> value;
a.emplace_back(value);
}
auto i = a.begin();
group.insert(*i);
for (++i; i != a.end(); ++i) {
auto &&elem = *i;
auto ite = lower_bound(group.begin(), group.end(), elem);
if (ite != group.begin()) {
--ite;
group.erase(ite);
}
group.insert(elem);
#ifdef LOCAL
cerr << "dump: ";
for (auto &&eeeeee : group) {
cerr << eeeeee << " ";
}
cerr << endl;
#endif
}
cout << group.size() << endl;
}
| #include <bits/stdc++.h>
#ifdef LOCAL
#include <contest/local.hpp>
#else
#define LOG(...) \
do { \
} while (false)
#endif
#define REP(i, n) \
for (decay_t<decltype(n)> i = 0, i##__len = (n); i < i##__len; ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
auto main() -> int {
cin.tie(nullptr);
ios::sync_with_stdio(false);
unsigned n;
cin >> n;
multiset<int> group;
vector<int> a;
REP(i, n) {
int value;
cin >> value;
a.emplace_back(value);
}
auto i = a.begin();
group.insert(*i);
for (++i; i != a.end(); ++i) {
auto &&elem = *i;
auto ite = group.lower_bound(elem);
if (ite != group.begin()) {
--ite;
group.erase(ite);
}
group.insert(elem);
#ifdef LOCAL
cerr << "dump: ";
for (auto &&eeeeee : group) {
cerr << eeeeee << " ";
}
cerr << endl;
#endif
}
cout << group.size() << endl;
}
| replace | 37 | 38 | 37 | 38 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int M = 100001;
int n, A[M], ans;
multiset<int> s;
multiset<int>::iterator it;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (int i = 1; i <= n; i++) {
if (!s.size()) {
s.insert(A[i]);
ans++;
continue;
}
it = lower_bound(s.begin(), s.end(), A[i]);
if (it == s.begin()) {
s.insert(A[i]);
ans++;
} else {
it--;
s.erase(it);
s.insert(A[i]);
}
}
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
const int M = 100001;
int n, A[M], ans;
multiset<int> s;
multiset<int>::iterator it;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (int i = 1; i <= n; i++) {
if (!s.size()) {
s.insert(A[i]);
ans++;
continue;
}
it = s.lower_bound(A[i]);
if (it == s.begin()) {
s.insert(A[i]);
ans++;
} else {
it--;
s.erase(it);
s.insert(A[i]);
}
}
printf("%d\n", ans);
} | replace | 16 | 17 | 16 | 17 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++)
cin >> a[i];
multiset<long long> T;
for (long long i = 0; i < n; i++) {
auto it = lower_bound(T.begin(), T.end(), a[i]);
if (it != T.begin())
T.erase(--it);
T.insert(a[i]);
}
cout << T.size() << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++)
cin >> a[i];
multiset<long long> T;
for (long long i = 0; i < n; i++) {
auto it = T.lower_bound(a[i]);
if (it != T.begin())
T.erase(--it);
T.insert(a[i]);
}
cout << T.size() << endl;
return 0;
} | replace | 18 | 19 | 18 | 19 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1000000007;
deque<int> col;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
col.push_front(a[0]);
for (int i = 1; i < n; i++) {
int idx = col.begin() - lower_bound(col.begin(), col.end(), a[i]);
if (idx == 0) {
col.push_front(a[i]);
} else {
col[idx - 1] = a[i];
}
}
int ans = col.size();
cout << ans << endl;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1000000007;
deque<int> col;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
col.push_front(a[0]);
for (int i = 1; i < n; i++) {
int idx = lower_bound(col.begin(), col.end(), a[i]) - col.begin();
if (idx == 0) {
col.push_front(a[i]);
} else {
col[idx - 1] = a[i];
}
}
int ans = col.size();
cout << ans << endl;
} | replace | 29 | 30 | 29 | 30 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n), v;
rep(i, n) cin >> a[i];
v.push_back(a[n - 1]);
for (int i = n - 2; i >= 0; i--) {
auto it = lower_bound(v.begin(), v.end(), a[i]);
while (*it == a[i] && it != v.end()) {
it++;
}
if (it == v.end())
v.push_back(a[i]);
else
*it = a[i];
}
cout << v.size() << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n), v;
rep(i, n) cin >> a[i];
v.push_back(a[n - 1]);
for (int i = n - 2; i >= 0; i--) {
auto it = upper_bound(v.begin(), v.end(), a[i]);
while (*it == a[i] && it != v.end()) {
it++;
}
if (it == v.end())
v.push_back(a[i]);
else
*it = a[i];
}
cout << v.size() << endl;
return 0;
} | replace | 29 | 30 | 29 | 30 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
reverse(v.begin(), v.end());
multiset<int> se;
for (int i = 0; i < n; i++) {
auto p = upper_bound(se.begin(), se.end(), v[i]);
if (p != se.end())
se.erase(p);
se.insert(v[i]);
}
cout << se.size() << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
reverse(v.begin(), v.end());
multiset<int> se;
for (int i = 0; i < n; i++) {
auto p = se.upper_bound(v[i]);
if (p != se.end())
se.erase(p);
se.insert(v[i]);
}
cout << se.size() << endl;
return 0;
} | replace | 17 | 18 | 17 | 18 | TLE | |
p02973 | C++ | Time Limit Exceeded | // https://atcoder.jp/contests/abc134/tasks/abc134_e
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define FOR(i, a, b) for (int64_t i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
struct Dat {
ll v;
ll pos;
};
int main() {
#if LOCAL & 01
std::ifstream in("./test/sample-1.in"); // input.txt
std::cin.rdbuf(in.rdbuf());
#endif
ll N;
cin >> N;
vector<Dat> an(N);
for (ll i = 0; i < N; ++i) {
cin >> an[i].v;
an[i].pos = i;
}
#if 1
multiset<ll> tbl;
for (auto &a : an) {
multiset<ll>::iterator it = lower_bound(tbl.begin(), tbl.end(), a.v);
if (it == tbl.begin()) {
} else {
--it;
tbl.erase(it);
}
tbl.insert(a.v);
}
#else
vector<Dat> tbl;
tbl.reserve(N);
for (auto &a : an) {
// いれるところ探索
ll pt = -1;
ll df = INT64_MAX;
for (ll i = 0; i < tbl.size(); ++i) {
auto &&t = tbl[i];
if (t.v < a.v) {
ll dff = a.v - t.v;
if (df > dff) {
df = dff;
pt = i;
}
}
}
if (pt < 0) {
tbl.push_back(a);
} else {
tbl[pt] = a;
}
}
#endif
cout << tbl.size() << endl;
return 0;
} | // https://atcoder.jp/contests/abc134/tasks/abc134_e
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define FOR(i, a, b) for (int64_t i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
struct Dat {
ll v;
ll pos;
};
int main() {
#if LOCAL & 01
std::ifstream in("./test/sample-1.in"); // input.txt
std::cin.rdbuf(in.rdbuf());
#endif
ll N;
cin >> N;
vector<Dat> an(N);
for (ll i = 0; i < N; ++i) {
cin >> an[i].v;
an[i].pos = i;
}
#if 1
multiset<ll> tbl;
for (auto &a : an) {
// multiset<ll>::iterator it=lower_bound(tbl.begin(),tbl.end(),a.v);
auto it = tbl.lower_bound(a.v);
if (it == tbl.begin()) {
} else {
--it;
tbl.erase(it);
}
tbl.insert(a.v);
}
#else
vector<Dat> tbl;
tbl.reserve(N);
for (auto &a : an) {
// いれるところ探索
ll pt = -1;
ll df = INT64_MAX;
for (ll i = 0; i < tbl.size(); ++i) {
auto &&t = tbl[i];
if (t.v < a.v) {
ll dff = a.v - t.v;
if (df > dff) {
df = dff;
pt = i;
}
}
}
if (pt < 0) {
tbl.push_back(a);
} else {
tbl[pt] = a;
}
}
#endif
cout << tbl.size() << endl;
return 0;
} | replace | 25 | 26 | 25 | 27 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define invrep(i, n) for (int64_t i = n - 1; i >= 0; i--)
using namespace std;
//////全探索したいときに開けよ////////
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor, int number, int degree) {
if (floor == degree) {
fspattern.at(fspcnt) = fspattern_draft;
fspcnt++;
} else {
rep(i, number) {
fspattern_draft.at(floor) = i;
setfspattern_core(floor + 1, number, degree);
}
}
}
void setfspattern(int number, int degree) {
fspcnt = 0;
int64_t array_num = 1;
rep(i, degree) { array_num *= number; }
fspattern = vector<vector<int>>(array_num, vector<int>(degree));
fspattern_draft = vector<int>(degree);
setfspattern_core(0, number, degree);
}
//////nCrのmodを求めたいときに開けよ/////////
// int64_t univMod = 1000000007;
// int64_t factnum = 100000
// vector<int64_t> modfact(factnum);
// vector<int64_t> modinvfact(factnum);
/*void setmodfact(){
for(int i=0;i<factnum;i++){
if(i == 0){
modfact.at(i) = 1;
}else{
modfact.at(i) = (modfact.at(i-1)*i)%univMod;
}
}
}
int64_t calcmodpower(int64_t a,int64_t n){
int64_t res = 1;
while(n != 0){
if(n & 1){
res = (res * a) % univMod;
}
a = (a*a) % univMod;
n = n >> 1;
}
return res;
}
int64_t calcinverse(int64_t n){
return calcmodpower(n,univMod-2);
}
void setmodinvfact(){
for(int i=0;i<factnum;i++){
if(i==0){
modinvfact.at(i) = 1;
}else{
modinvfact.at(i) = calcmodpower(modfact.at(i),univMod-2);
}
}
}*/
/*
int64_t calcGCD(int64_t a,int64_t b){
int64_t p = a;
int64_t q = b;
int64_t c = a%b;
while(c != 0){
p = q;
q = c;
c = p%q;
}
return q;
}
*/
int main() {
int64_t n;
cin >> n;
vector<int64_t> a(n);
rep(i, n) { cin >> a.at(i); }
multiset<int64_t> ms;
rep(i, n) {
auto itr = lower_bound(ms.begin(), ms.end(), a.at(i)); // logn
if (itr == ms.begin()) {
ms.insert(a.at(i));
// printf("+%ld",a.at(i));
} else {
--itr;
ms.erase(itr);
ms.insert(a.at(i));
}
}
cout << ms.size() << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define invrep(i, n) for (int64_t i = n - 1; i >= 0; i--)
using namespace std;
//////全探索したいときに開けよ////////
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor, int number, int degree) {
if (floor == degree) {
fspattern.at(fspcnt) = fspattern_draft;
fspcnt++;
} else {
rep(i, number) {
fspattern_draft.at(floor) = i;
setfspattern_core(floor + 1, number, degree);
}
}
}
void setfspattern(int number, int degree) {
fspcnt = 0;
int64_t array_num = 1;
rep(i, degree) { array_num *= number; }
fspattern = vector<vector<int>>(array_num, vector<int>(degree));
fspattern_draft = vector<int>(degree);
setfspattern_core(0, number, degree);
}
//////nCrのmodを求めたいときに開けよ/////////
// int64_t univMod = 1000000007;
// int64_t factnum = 100000
// vector<int64_t> modfact(factnum);
// vector<int64_t> modinvfact(factnum);
/*void setmodfact(){
for(int i=0;i<factnum;i++){
if(i == 0){
modfact.at(i) = 1;
}else{
modfact.at(i) = (modfact.at(i-1)*i)%univMod;
}
}
}
int64_t calcmodpower(int64_t a,int64_t n){
int64_t res = 1;
while(n != 0){
if(n & 1){
res = (res * a) % univMod;
}
a = (a*a) % univMod;
n = n >> 1;
}
return res;
}
int64_t calcinverse(int64_t n){
return calcmodpower(n,univMod-2);
}
void setmodinvfact(){
for(int i=0;i<factnum;i++){
if(i==0){
modinvfact.at(i) = 1;
}else{
modinvfact.at(i) = calcmodpower(modfact.at(i),univMod-2);
}
}
}*/
/*
int64_t calcGCD(int64_t a,int64_t b){
int64_t p = a;
int64_t q = b;
int64_t c = a%b;
while(c != 0){
p = q;
q = c;
c = p%q;
}
return q;
}
*/
int main() {
int64_t n;
cin >> n;
vector<int64_t> a(n);
rep(i, n) { cin >> a.at(i); }
multiset<int64_t> ms;
rep(i, n) {
auto itr = ms.lower_bound(a.at(i)); // logn
if (itr == ms.begin()) {
ms.insert(a.at(i));
// printf("+%ld",a.at(i));
} else {
--itr;
ms.erase(itr);
ms.insert(a.at(i));
}
}
cout << ms.size() << endl;
} | replace | 94 | 95 | 94 | 95 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.