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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
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;
}
const ll MOD = 1e9 + 7;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> M;
vector<ll> P;
bool zero = false;
REP(i, N) {
ll a;
cin >> a;
if (a == 0)
zero = true;
if (a < 0)
M.push_back(-a);
else
P.push_back(a);
}
ll MS = M.size();
ll PS = P.size();
ll ans = 1;
if (N == K) {
for (auto &&x : M)
ans = (ans * x) % MOD;
for (auto &&x : P)
ans = (ans * x) % MOD;
if (MS % 2)
ans = MOD - ans;
ans %= MOD;
}
// positive
else if (!(MS == N && K % 2)) {
if (K == 2 && MS == 1 && PS == 1) {
ans *= P[0];
ans %= MOD;
ans *= M[0];
ans %= MOD;
} else {
sort(M.rbegin(), M.rend());
sort(P.rbegin(), P.rend());
int num = K;
int pidx = 0;
int midx = 0;
while (num > 0) {
if (num == 1 || (MS - midx) < 2) {
ans *= P[pidx];
ans %= MOD;
pidx++;
num--;
} else {
ll mmul = M[midx] * M[midx + 1];
ll pmul = P[pidx] * P[pidx + 1];
if (mmul >= pmul) {
ans *= (mmul % MOD);
ans %= MOD;
midx += 2;
num -= 2;
} else {
ans *= P[pidx];
ans %= MOD;
pidx++;
num--;
}
}
}
}
}
// negative
else {
if (zero)
ans = 0;
else {
priority_queue<ll, vector<ll>, greater<ll>> que;
for (auto &&x : M)
que.push(x);
for (auto &&x : P)
que.push(x);
REP(i, K) {
auto x = que.top();
que.pop();
ans *= x;
ans %= MOD;
}
ans = MOD - ans;
ans %= MOD;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
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;
}
const ll MOD = 1e9 + 7;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> M;
vector<ll> P;
bool zero = false;
REP(i, N) {
ll a;
cin >> a;
if (a == 0)
zero = true;
if (a < 0)
M.push_back(-a);
else
P.push_back(a);
}
ll MS = M.size();
ll PS = P.size();
ll ans = 1;
if (N == K) {
for (auto &&x : M)
ans = (ans * x) % MOD;
for (auto &&x : P)
ans = (ans * x) % MOD;
if (MS % 2)
ans = MOD - ans;
ans %= MOD;
}
// positive
else if (!(MS == N && K % 2)) {
if (K == 2 && MS == 1 && PS == 1) {
ans *= P[0];
ans %= MOD;
ans *= M[0];
ans %= MOD;
} else {
sort(M.rbegin(), M.rend());
sort(P.rbegin(), P.rend());
P.push_back(-1);
int num = K;
int pidx = 0;
int midx = 0;
while (num > 0) {
if (num == 1 || (MS - midx) < 2) {
ans *= P[pidx];
ans %= MOD;
pidx++;
num--;
} else {
ll mmul = M[midx] * M[midx + 1];
ll pmul = P[pidx] * P[pidx + 1];
if (mmul >= pmul) {
ans *= (mmul % MOD);
ans %= MOD;
midx += 2;
num -= 2;
} else {
ans *= P[pidx];
ans %= MOD;
pidx++;
num--;
}
}
}
}
}
// negative
else {
if (zero)
ans = 0;
else {
priority_queue<ll, vector<ll>, greater<ll>> que;
for (auto &&x : M)
que.push(x);
for (auto &&x : P)
que.push(x);
REP(i, K) {
auto x = que.top();
que.pop();
ans *= x;
ans %= MOD;
}
ans = MOD - ans;
ans %= MOD;
}
}
cout << ans << endl;
return 0;
}
| insert | 67 | 67 | 67 | 68 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long int ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define ALL(obj) (obj).begin(), (obj).end()
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;
}
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<(int)(1e9 + 7)>;
template <typename T> struct Combination {
vector<T> _fact, _rfact, _inv;
Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
_fact[0] = _rfact[sz] = _inv[0] = 1;
for (int i = 1; i <= sz; i++)
_fact[i] = _fact[i - 1] * i;
_rfact[sz] /= _fact[sz];
for (int i = sz - 1; i >= 0; i--)
_rfact[i] = _rfact[i + 1] * (i + 1);
for (int i = 1; i <= sz; i++)
_inv[i] = _rfact[i] * _fact[i - 1];
}
inline T fact(int k) const { return _fact[k]; }
inline T rfact(int k) const { return _rfact[k]; }
inline T inv(int k) const { return _inv[k]; }
T P(int n, int r) const {
if (r < 0 || n < r)
return 0;
return fact(n) * rfact(n - r);
}
T C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return fact(p) * rfact(q) * rfact(p - q);
}
T H(int n, int r) const {
if (n < 0 || r < 0)
return (0);
return r == 0 ? 1 : C(n + r - 1, r);
}
};
template <class Int> struct Fraction { //{{{
Int num, den;
private:
static Int gcd(Int a, Int b) {
while (b)
swap(a %= b, b);
return a;
}
void normalize() {
Int g = gcd(num, den);
num /= g;
den /= g;
if (den < 0) {
num = -num;
den = -den;
}
}
public:
Fraction(Int num) : num(num), den(1) {}
Fraction(Int num, Int den, bool need_normalize = true) : num(num), den(den) {
if (need_normalize)
normalize();
}
Fraction operator-() const { return Fraction(-num, den, false); }
}; //}}}
using Z = int64_t;
using Q = Fraction<Z>;
// int sgn(const Z a){
// return (a > 0) - (a < 0);
// }
int sgn(const Z a, const Z b) {
return (a > b) - (a < b); // sgn(a-b) にするとオーバーフローしやすい.
}
// int sgn(const Q &a){
// return sgn(a.num);
// }
// int sgn(const Q &a, const Q &b){
// return sgn(a.num * b.den, b.num * a.den); // オーバーフローしやすい.
// }
int sgn(Q a, Q b) {
if (a.num <= 0 or b.num <= 0) {
if (a.num == 0 or b.num == 0)
return sgn(a.num, b.num);
if ((a.num < 0) xor (b.num < 0))
return sgn(a.num, b.num);
return sgn(-b, -a);
}
int flip = 1;
while (a.den != 0 and b.den != 0) {
if (int s = sgn(a.num / a.den, b.num / b.den))
return s * flip;
swap(a.num %= a.den, a.den);
swap(b.num %= b.den, b.den);
flip = -flip;
}
return flip * sgn(a.num * b.den, a.den * b.num);
}
int main() {
cout << fixed << setprecision(10);
// auto a = Fraction<ll>(4, 5);
// auto b = Fraction<ll>(5,6);
// cout<<sgn(a,b)<<endl; //
// cout<<sgn(b,a)<<endl;
ll n, k;
cin >> n >> k;
vint a(n);
rep(i, n) cin >> a[i];
using P = pair<ll, ll>;
vector<P> vp;
for (auto e : a) {
if (e < 0) {
vp.emplace_back(-e, 1);
} else {
vp.emplace_back(e, 0);
}
}
sort(ALL(vp), greater<P>());
ll posi, negi;
posi = -1;
negi = -1;
ll negcnt = 0;
rep(i, k) {
ll e, t;
tie(e, t) = vp[i];
if (t == 1) {
negcnt++;
negi = i;
} else {
posi = i;
}
}
if (vp[k - 1].first == 0) {
cout << 0 << endl;
return 0;
}
if (k == n) {
modint ans = 1;
rep(i, k) ans *= a[i];
cout << ans << endl;
}
if (negcnt % 2 == 0) {
modint ans = 1;
rep(i, k) ans *= vp[i].first;
cout << ans << endl;
return 0;
} else {
if (posi == -1) {
ll num = -1;
repf(i, k, n) {
ll e, t;
tie(e, t) = vp[i];
if (t == 1)
continue;
num = 1;
swap(vp[negi], vp[i]);
break;
}
if (num == -1) {
// 負の数だけで
modint ans = 1;
rep(i, k) { ans *= vp[n - 1 - i].first; }
ans *= -1;
cout << ans << endl;
return 0;
} else {
// auto x = Fraction<ll>(num, vp[negi].first);
modint ans = 1;
rep(i, k) ans *= vp[i].first;
cout << ans << endl;
return 0;
}
} else {
// auto x = Fraction<ll>(1);
// auto y = Fraction<ll>(1);
using D = long double;
D x, y;
x = y = 0;
bool nf, pf;
nf = false;
pf = false;
ll nposi, nnegi;
nposi = nnegi = -1;
repf(i, k, n) {
ll e, t;
tie(e, t) = vp[i];
if (t == 1) {
if (nf == false) {
// x = Fraction<ll>(e, vp[posi].first);
x = D(e) / vp[posi].first;
nnegi = i;
nf = true;
}
} else {
if (pf == false) {
// y = Fraction<ll>(e, vp[negi].first);
y = D(e) / vp[negi].first;
nposi = i;
pf = true;
}
}
if (nf and pf)
break;
}
modint ans = 1;
// if(sgn(x,y) < 0){
if (x < y) {
// yがおおきい
swap(vp[negi], vp[nposi]);
rep(i, k) { ans *= vp[i].first; }
} else {
// xがおおきい
swap(vp[posi], vp[nnegi]);
rep(i, k) { ans *= vp[i].first; }
}
cout << ans << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long int ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define ALL(obj) (obj).begin(), (obj).end()
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;
}
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<(int)(1e9 + 7)>;
template <typename T> struct Combination {
vector<T> _fact, _rfact, _inv;
Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
_fact[0] = _rfact[sz] = _inv[0] = 1;
for (int i = 1; i <= sz; i++)
_fact[i] = _fact[i - 1] * i;
_rfact[sz] /= _fact[sz];
for (int i = sz - 1; i >= 0; i--)
_rfact[i] = _rfact[i + 1] * (i + 1);
for (int i = 1; i <= sz; i++)
_inv[i] = _rfact[i] * _fact[i - 1];
}
inline T fact(int k) const { return _fact[k]; }
inline T rfact(int k) const { return _rfact[k]; }
inline T inv(int k) const { return _inv[k]; }
T P(int n, int r) const {
if (r < 0 || n < r)
return 0;
return fact(n) * rfact(n - r);
}
T C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return fact(p) * rfact(q) * rfact(p - q);
}
T H(int n, int r) const {
if (n < 0 || r < 0)
return (0);
return r == 0 ? 1 : C(n + r - 1, r);
}
};
template <class Int> struct Fraction { //{{{
Int num, den;
private:
static Int gcd(Int a, Int b) {
while (b)
swap(a %= b, b);
return a;
}
void normalize() {
Int g = gcd(num, den);
num /= g;
den /= g;
if (den < 0) {
num = -num;
den = -den;
}
}
public:
Fraction(Int num) : num(num), den(1) {}
Fraction(Int num, Int den, bool need_normalize = true) : num(num), den(den) {
if (need_normalize)
normalize();
}
Fraction operator-() const { return Fraction(-num, den, false); }
}; //}}}
using Z = int64_t;
using Q = Fraction<Z>;
// int sgn(const Z a){
// return (a > 0) - (a < 0);
// }
int sgn(const Z a, const Z b) {
return (a > b) - (a < b); // sgn(a-b) にするとオーバーフローしやすい.
}
// int sgn(const Q &a){
// return sgn(a.num);
// }
// int sgn(const Q &a, const Q &b){
// return sgn(a.num * b.den, b.num * a.den); // オーバーフローしやすい.
// }
int sgn(Q a, Q b) {
if (a.num <= 0 or b.num <= 0) {
if (a.num == 0 or b.num == 0)
return sgn(a.num, b.num);
if ((a.num < 0) xor (b.num < 0))
return sgn(a.num, b.num);
return sgn(-b, -a);
}
int flip = 1;
while (a.den != 0 and b.den != 0) {
if (int s = sgn(a.num / a.den, b.num / b.den))
return s * flip;
swap(a.num %= a.den, a.den);
swap(b.num %= b.den, b.den);
flip = -flip;
}
return flip * sgn(a.num * b.den, a.den * b.num);
}
int main() {
cout << fixed << setprecision(10);
// auto a = Fraction<ll>(4, 5);
// auto b = Fraction<ll>(5,6);
// cout<<sgn(a,b)<<endl; //
// cout<<sgn(b,a)<<endl;
ll n, k;
cin >> n >> k;
vint a(n);
rep(i, n) cin >> a[i];
using P = pair<ll, ll>;
vector<P> vp;
for (auto e : a) {
if (e < 0) {
vp.emplace_back(-e, 1);
} else {
vp.emplace_back(e, 0);
}
}
sort(ALL(vp), greater<P>());
ll posi, negi;
posi = -1;
negi = -1;
ll negcnt = 0;
rep(i, k) {
ll e, t;
tie(e, t) = vp[i];
if (t == 1) {
negcnt++;
negi = i;
} else {
posi = i;
}
}
if (vp[k - 1].first == 0) {
cout << 0 << endl;
return 0;
}
if (k == n) {
modint ans = 1;
rep(i, k) ans *= a[i];
cout << ans << endl;
return 0;
}
if (negcnt % 2 == 0) {
modint ans = 1;
rep(i, k) ans *= vp[i].first;
cout << ans << endl;
return 0;
} else {
if (posi == -1) {
ll num = -1;
repf(i, k, n) {
ll e, t;
tie(e, t) = vp[i];
if (t == 1)
continue;
num = 1;
swap(vp[negi], vp[i]);
break;
}
if (num == -1) {
// 負の数だけで
modint ans = 1;
rep(i, k) { ans *= vp[n - 1 - i].first; }
ans *= -1;
cout << ans << endl;
return 0;
} else {
// auto x = Fraction<ll>(num, vp[negi].first);
modint ans = 1;
rep(i, k) ans *= vp[i].first;
cout << ans << endl;
return 0;
}
} else {
// auto x = Fraction<ll>(1);
// auto y = Fraction<ll>(1);
using D = long double;
D x, y;
x = y = 0;
bool nf, pf;
nf = false;
pf = false;
ll nposi, nnegi;
nposi = nnegi = -1;
repf(i, k, n) {
ll e, t;
tie(e, t) = vp[i];
if (t == 1) {
if (nf == false) {
// x = Fraction<ll>(e, vp[posi].first);
x = D(e) / vp[posi].first;
nnegi = i;
nf = true;
}
} else {
if (pf == false) {
// y = Fraction<ll>(e, vp[negi].first);
y = D(e) / vp[negi].first;
nposi = i;
pf = true;
}
}
if (nf and pf)
break;
}
modint ans = 1;
// if(sgn(x,y) < 0){
if (x < y) {
// yがおおきい
swap(vp[negi], vp[nposi]);
rep(i, k) { ans *= vp[i].first; }
} else {
// xがおおきい
swap(vp[posi], vp[nnegi]);
rep(i, k) { ans *= vp[i].first; }
}
cout << ans << endl;
}
}
return 0;
} | insert | 260 | 260 | 260 | 261 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
static const long long mod = 1000000007;
struct mint {
long long x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
(x += a.x) %= mod;
return *this;
}
mint &operator-=(const mint a) {
(x += mod - a.x) %= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint ret(*this);
return ret += a;
}
mint operator-(const mint a) const {
mint ret(*this);
return ret -= a;
}
mint operator*(const mint a) const {
mint ret(*this);
return ret *= a;
}
mint pow(ll t) const {
if (t == 0)
return mint(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 ret(*this);
return ret /= a;
}
};
ostream &operator<<(ostream &os, const mint &x) {
os << x.x;
return os;
}
class modutils {
vector<mint> fact, invfact;
public:
modutils(int n = 2000005) : fact(n + 1), invfact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i;
invfact[n] = fact[n].inv();
for (int i = n; i >= 1; i--)
invfact[i - 1] = invfact[i] * i;
}
mint pow(mint x, ll n) { return x.pow(n); }
mint comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[k] * invfact[n - k];
}
mint perm(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[n - k];
}
mint fac(ll n) { return fact[n]; }
};
modutils mutil;
struct ST {
ll eval;
bool flg;
vector<ll> v;
};
bool operator<(const ST &a, const ST &b) {
if (a.eval == b.eval)
return a.v.size() > b.v.size();
return a.eval > b.eval;
}
int main() {
int N, K;
cin >> N >> K;
vector<ll> v_n, v_z, v_p;
rep(i, N) {
ll a;
cin >> a;
if (a < 0)
v_n.push_back(a);
if (a == 0)
v_z.push_back(a);
if (a > 0)
v_p.push_back(a);
}
if (v_z.size() > 0) {
if (v_n.size() + v_p.size() < K) {
cout << 0 << endl;
return 0;
}
}
sort(ALLOF(v_p));
reverse(ALLOF(v_p));
sort(ALLOF(v_n));
if (K == 1) {
if (v_p.size() > 0) {
cout << v_p[0] << endl;
} else if (v_z.size() > 0) {
cout << 0 << endl;
} else {
cout << v_n[v_n.size() - 1] << endl;
}
return 0;
}
vector<ST> v;
for (int i = 0; i < v_n.size(); i += 2) {
if (i + 1 >= v_n.size())
continue;
ST tmp;
tmp.eval = v_n[i] * v_n[i + 1];
tmp.flg = true;
tmp.v.push_back(-v_n[i]);
tmp.v.push_back(-v_n[i + 1]);
v.push_back(tmp);
}
sort(ALLOF(v));
mint ret(1);
int k = 0;
if (K % 2 == 1) {
ret *= v_p[0];
k++;
for (int i = 1; i < v_p.size(); i += 2) {
if (i + 1 < v_p.size()) {
ST tmp;
tmp.eval = v_p[i] * v_p[i + 1];
tmp.flg = false;
tmp.v.push_back(v_p[i]);
tmp.v.push_back(v_p[i + 1]);
v.push_back(tmp);
} else {
ST tmp;
tmp.eval = v_p[i];
tmp.flg = false;
tmp.v.push_back(v_p[i]);
v.push_back(tmp);
}
}
} else {
for (int i = 0; i < v_p.size(); i += 2) {
if (i + 1 < v_p.size()) {
ST tmp;
tmp.eval = v_p[i] * v_p[i + 1];
tmp.flg = false;
tmp.v.push_back(v_p[i]);
tmp.v.push_back(v_p[i + 1]);
v.push_back(tmp);
} else {
ST tmp;
tmp.eval = v_p[i];
tmp.flg = false;
tmp.v.push_back(v_p[i]);
v.push_back(tmp);
}
}
}
sort(ALLOF(v));
rep(i, v.size()) {
if (k + v[i].v.size() <= K) {
ret *= v[i].eval;
k += v[i].v.size();
}
}
if (k != K) {
if (v_z.size() > 0) {
cout << 0 << endl;
} else {
vector<ll> v;
rep(i, v_n.size()) { v.push_back(-v_n[i]); }
rep(i, v_p.size()) { v.push_back(v_p[i]); }
sort(ALLOF(v));
mint tmp(1);
tmp *= mod - 1;
rep(i, K) { tmp *= v[i]; }
cout << tmp << endl;
}
return 0;
}
cout << ret << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
static const long long mod = 1000000007;
struct mint {
long long x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
(x += a.x) %= mod;
return *this;
}
mint &operator-=(const mint a) {
(x += mod - a.x) %= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint ret(*this);
return ret += a;
}
mint operator-(const mint a) const {
mint ret(*this);
return ret -= a;
}
mint operator*(const mint a) const {
mint ret(*this);
return ret *= a;
}
mint pow(ll t) const {
if (t == 0)
return mint(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 ret(*this);
return ret /= a;
}
};
ostream &operator<<(ostream &os, const mint &x) {
os << x.x;
return os;
}
class modutils {
vector<mint> fact, invfact;
public:
modutils(int n = 2000005) : fact(n + 1), invfact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i;
invfact[n] = fact[n].inv();
for (int i = n; i >= 1; i--)
invfact[i - 1] = invfact[i] * i;
}
mint pow(mint x, ll n) { return x.pow(n); }
mint comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[k] * invfact[n - k];
}
mint perm(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[n - k];
}
mint fac(ll n) { return fact[n]; }
};
modutils mutil;
struct ST {
ll eval;
bool flg;
vector<ll> v;
};
bool operator<(const ST &a, const ST &b) {
if (a.eval == b.eval)
return a.v.size() > b.v.size();
return a.eval > b.eval;
}
int main() {
int N, K;
cin >> N >> K;
vector<ll> v_n, v_z, v_p;
rep(i, N) {
ll a;
cin >> a;
if (a < 0)
v_n.push_back(a);
if (a == 0)
v_z.push_back(a);
if (a > 0)
v_p.push_back(a);
}
if (v_z.size() > 0) {
if (v_n.size() + v_p.size() < K) {
cout << 0 << endl;
return 0;
}
}
sort(ALLOF(v_p));
reverse(ALLOF(v_p));
sort(ALLOF(v_n));
if (K == 1) {
if (v_p.size() > 0) {
cout << v_p[0] << endl;
} else if (v_z.size() > 0) {
cout << 0 << endl;
} else {
cout << v_n[v_n.size() - 1] << endl;
}
return 0;
}
vector<ST> v;
for (int i = 0; i < v_n.size(); i += 2) {
if (i + 1 >= v_n.size())
continue;
ST tmp;
tmp.eval = v_n[i] * v_n[i + 1];
tmp.flg = true;
tmp.v.push_back(-v_n[i]);
tmp.v.push_back(-v_n[i + 1]);
v.push_back(tmp);
}
sort(ALLOF(v));
mint ret(1);
int k = 0;
if (K % 2 == 1 && v_p.size() > 0) {
ret *= v_p[0];
k++;
for (int i = 1; i < v_p.size(); i += 2) {
if (i + 1 < v_p.size()) {
ST tmp;
tmp.eval = v_p[i] * v_p[i + 1];
tmp.flg = false;
tmp.v.push_back(v_p[i]);
tmp.v.push_back(v_p[i + 1]);
v.push_back(tmp);
} else {
ST tmp;
tmp.eval = v_p[i];
tmp.flg = false;
tmp.v.push_back(v_p[i]);
v.push_back(tmp);
}
}
} else {
for (int i = 0; i < v_p.size(); i += 2) {
if (i + 1 < v_p.size()) {
ST tmp;
tmp.eval = v_p[i] * v_p[i + 1];
tmp.flg = false;
tmp.v.push_back(v_p[i]);
tmp.v.push_back(v_p[i + 1]);
v.push_back(tmp);
} else {
ST tmp;
tmp.eval = v_p[i];
tmp.flg = false;
tmp.v.push_back(v_p[i]);
v.push_back(tmp);
}
}
}
sort(ALLOF(v));
rep(i, v.size()) {
if (k + v[i].v.size() <= K) {
ret *= v[i].eval;
k += v[i].v.size();
}
}
if (k != K) {
if (v_z.size() > 0) {
cout << 0 << endl;
} else {
vector<ll> v;
rep(i, v_n.size()) { v.push_back(-v_n[i]); }
rep(i, v_p.size()) { v.push_back(v_p[i]); }
sort(ALLOF(v));
mint tmp(1);
tmp *= mod - 1;
rep(i, K) { tmp *= v[i]; }
cout << tmp << endl;
}
return 0;
}
cout << ret << endl;
return 0;
}
| replace | 150 | 151 | 150 | 151 | 0 | |
p02616 | C++ | Runtime Error | /**
* created: 06.07.2020 17:35:12
**/
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
using namespace std;
#define int long long
#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 all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pcnt(bit) __builtin_popcountll(bit)
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;
}
const long double pi = acos(-1.0);
const int INF = 1LL << 60;
const int MOD = 1000000007;
// const int MOD = 998244353;
// Template for ModInt
template <typename T> T pow(T a, long long n, T e = 1) {
T ret = e;
while (n) {
if (n & 1)
ret *= a;
a *= a;
n >>= 1;
}
return ret;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long x_) {
if ((x = x_ % mod + mod) >= mod)
x -= mod;
}
ModInt &operator+=(ModInt rhs) {
if ((x += rhs.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(ModInt rhs) {
if ((x -= rhs.x) < 0)
x += mod;
return *this;
}
ModInt &operator*=(ModInt rhs) {
x = (unsigned long long)x * rhs.x % mod;
return *this;
}
ModInt &operator/=(ModInt rhs) {
x = (unsigned long long)x * rhs.inv().x % mod;
return *this;
}
ModInt operator-() const { return -x < 0 ? mod - x : -x; }
ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }
ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }
ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }
ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }
bool operator==(ModInt rhs) const { return x == rhs.x; }
bool operator!=(ModInt rhs) const { return x != rhs.x; }
ModInt inv() const { return pow(*this, mod - 2); }
friend ostream &operator<<(ostream &s, ModInt<mod> a) {
s << a.x;
return s;
}
friend istream &operator>>(istream &s, ModInt<mod> &a) {
s >> a.x;
return s;
}
};
using mint = ModInt<MOD>;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<int> s, t;
rep(i, n) {
cin >> a[i];
if (a[i] < 0)
t.push_back(a[i]);
else
s.push_back(a[i]);
}
int S = s.size();
int T = t.size();
bool ok = false;
if (S > 0) {
if (n == k)
ok = (T % 2 == 0);
else
ok = true;
} else {
ok = (k % 2 == 0);
}
mint ans = 1;
if (!ok) {
// 絶対値順でソート
sort(all(a), [](int x, int y) { return abs(x) < abs(y); });
rep(i, k) ans *= a[i];
} else {
sort(all(s));
sort(rall(t));
if (k % 2 == 0) {
ans *= s.back();
s.pop_back();
}
vector<int> p;
while (s.size() >= 2) {
int x = s.back();
s.pop_back();
x *= s.back();
s.pop_back();
p.push_back(x);
}
while (t.size() >= 2) {
int x = t.back();
t.pop_back();
x *= t.back();
t.pop_back();
p.push_back(x);
}
sort(rall(p));
rep(i, k / 2) ans *= p[i];
}
cout << ans << endl;
return 0;
} | /**
* created: 06.07.2020 17:35:12
**/
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
using namespace std;
#define int long long
#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 all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pcnt(bit) __builtin_popcountll(bit)
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;
}
const long double pi = acos(-1.0);
const int INF = 1LL << 60;
const int MOD = 1000000007;
// const int MOD = 998244353;
// Template for ModInt
template <typename T> T pow(T a, long long n, T e = 1) {
T ret = e;
while (n) {
if (n & 1)
ret *= a;
a *= a;
n >>= 1;
}
return ret;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long x_) {
if ((x = x_ % mod + mod) >= mod)
x -= mod;
}
ModInt &operator+=(ModInt rhs) {
if ((x += rhs.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(ModInt rhs) {
if ((x -= rhs.x) < 0)
x += mod;
return *this;
}
ModInt &operator*=(ModInt rhs) {
x = (unsigned long long)x * rhs.x % mod;
return *this;
}
ModInt &operator/=(ModInt rhs) {
x = (unsigned long long)x * rhs.inv().x % mod;
return *this;
}
ModInt operator-() const { return -x < 0 ? mod - x : -x; }
ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }
ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }
ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }
ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }
bool operator==(ModInt rhs) const { return x == rhs.x; }
bool operator!=(ModInt rhs) const { return x != rhs.x; }
ModInt inv() const { return pow(*this, mod - 2); }
friend ostream &operator<<(ostream &s, ModInt<mod> a) {
s << a.x;
return s;
}
friend istream &operator>>(istream &s, ModInt<mod> &a) {
s >> a.x;
return s;
}
};
using mint = ModInt<MOD>;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<int> s, t;
rep(i, n) {
cin >> a[i];
if (a[i] < 0)
t.push_back(a[i]);
else
s.push_back(a[i]);
}
int S = s.size();
int T = t.size();
bool ok = false;
if (S > 0) {
if (n == k)
ok = (T % 2 == 0);
else
ok = true;
} else {
ok = (k % 2 == 0);
}
mint ans = 1;
if (!ok) {
// 絶対値順でソート
sort(all(a), [](int x, int y) { return abs(x) < abs(y); });
rep(i, k) ans *= a[i];
} else {
sort(all(s));
sort(rall(t));
if (k % 2 == 1) {
ans *= s.back();
s.pop_back();
}
vector<int> p;
while (s.size() >= 2) {
int x = s.back();
s.pop_back();
x *= s.back();
s.pop_back();
p.push_back(x);
}
while (t.size() >= 2) {
int x = t.back();
t.pop_back();
x *= t.back();
t.pop_back();
p.push_back(x);
}
sort(rall(p));
rep(i, k / 2) ans *= p[i];
}
cout << ans << endl;
return 0;
} | replace | 128 | 129 | 128 | 129 | 0 | |
p02616 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define all_acc(x) (x).begin(), (x).end(), 0LL
#define int long long
#define absSort(v) \
sort(a.begin(), a.end(), \
[](int i, int j) -> bool { return abs(i) < abs(j); });
using namespace std;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
using ll = long long;
// 出力するよ
void output(vector<int> s) {
int n = s.size();
for (int i = 0; i < n; i++) {
if (i != 0)
cout << " ";
cout << s[i]; //<<endl;
}
cout << endl;
}
int MOD = pow(10, 9) + 7;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
absSort(a);
reverse(all(a));
int ans = 1;
// int key = k-1;
vector<int> plus;
vector<int> minus;
// 正ならプラスに追加、負ならマイナスに追加するよ
for (int i = 0; i < n; i++) {
if (a[i] > 0)
plus.push_back(a[i]);
else
minus.push_back(a[i]);
}
if (plus.size() > 0) { // 正値が存在する
if (n ==
k) { // このときは、負の数が偶数個だったらいいよ。でも、n=kなら全部選ぶじゃん
for (int i = 0; i < k; i++) {
ans = (ans * (a[i]) % MOD) % MOD;
}
} else { // このときは、常に正。負の数もうまいこと選んでいく必要あり。
// 負の数を二個ずつ選ぶ。正の数は1つずつ選ぶ。
// checkは選んだ値の数
int check = 0;
// この2つはそれぞれ今見るインデックス
int plus_point = 0;
int minus_point = 0;
// k個選ぶまで続けるよ
while (check < k) {
// 残り一個のときは正の値を加えるよ
if (check == (k - 1)) {
ans = (ans * (plus[plus_point]) % MOD) % MOD;
} else {
// 残り1個ではないときは、負の値の上位2つと正の値の上位2つを比べる。
// ここで、全て使い切った場合や、正の値が残り1つしかない場合に注意しよう。
int minus_score = -1;
int plus_score = -1;
// マイナスから2つ選べる場合
if ((minus.size() - minus_point) > 1) {
minus_score = minus[minus_point] * minus[minus_point + 1];
}
// プラスから2つ選べる場合
if ((plus.size() - plus_point) > 1) {
plus_score = plus[plus_point] * plus[plus_point + 1];
}
// プラスの方がいいなら、そちらを選ぶ
if (plus_score > minus_score) {
ans = (ans * (plus[plus_point]) % MOD) % MOD;
k--;
plus_point++;
} else {
ans = (ans * (minus_score % MOD)) % MOD;
k -= 2;
minus_point += 2;
}
}
}
}
} else { // 正が1つもない
if (k % 2 == 0) { // 負の数を偶数個選ぶ。このときは、答えは正になるよ。
// minusの前からk個選べばヨシ
for (int i = 0; i < k; i++) {
ans = (ans * (minus[i]) % MOD) % MOD;
}
} else { // kが奇数。つまり、負の数を奇数個選ぶ。答えは負になるよ。
// minusの後ろからk個選べばヨシ
for (int i = 1; i <= k; i++) {
ans = (ans * (minus[minus.size() - i]) % MOD) % MOD;
}
}
}
/*
for (int i = 0; i < k; i++)
{
int ai = a[i];
if (ai > 0)
{
plus.push_back(ai);
}
else
{
minus.push_back(ai);
}
}
//答えが正になる
if ((minus.size() % 2 == 0))
{
for (int i = 0; i < (plus.size()); i++)
{
ans = (ans * (plus[i] % MOD)) % MOD;
}
for (int i = 0; i < (minus.size()); i++)
{
ans = (ans * (minus[i] % MOD)) % MOD;
}
}
//現状答えは負です
else
{
//kは全部です
if (k == (n)){
for (int i = 0; i < (plus.size()); i++){
ans = (ans * (plus[i] % MOD)) % MOD;
}
for (int i = 0; i < (minus.size()); i++){
ans = (ans * (minus[i] % MOD)) % MOD;
}
}
//まだ残っています
else
{
vector<int> plus_other;
vector<int> minus_other;
//残りの奴らを格納する
for(int i=k;i<n;i++){
if(a[i]>0) plus_other.push_back(a[i]);
else minus_other.push_back(a[i]);
}
if(minus_other.size()==0){//マイナスの残りは無いが、プラスの残りはいる＝正にできる
minus.pop_back();
plus.push_back(plus_other[0]);
for (int i = 0; i < (plus.size()); i++){
ans = (ans * (plus[i] % MOD)) % MOD;
}
for (int i = 0; i < (minus.size()); i++){
ans = (ans * (minus[i] % MOD)) % MOD;
}
}else if(plus_other.size()==0){//プラスの残りはいない＝正にできない
for(int i=1;i<=k;i++){
ans=(ans*(a[n-i]%MOD))%MOD;
}
}
else{//プラスもマイナスも残りがいる＝正にできる
int pl=plus_other[0];
int mi=minus_other[0];
if(plus.size()==0){//今のプラスの値が何にもない可能性はある
minus.pop_back();
plus.push_back(plus_other[0]);
for (int i = 0; i < (plus.size()); i++){
ans = (ans * (plus[i] % MOD)) % MOD;
}
for (int i = 0; i < (minus.size()); i++){
ans = (ans * (minus[i] % MOD)) % MOD;
}
}else{//マイナスが0はありえないよん
int plast=plus[plus.size()-1];
int mlast=minus[minus.size()-1];
if(abs(mlast*mi)<=abs(plast*pl)){
plus.pop_back();
minus.push_back(mi);
}else{
minus.pop_back();
plus.push_back(pl);
}
for (int i = 0; i < (plus.size()); i++){
ans = (ans * (plus[i] % MOD)) % MOD;
}
for (int i = 0; i < (minus.size()); i++){
ans = (ans * (minus[i] % MOD)) % MOD;
}
}
}
}
}*/
if (ans < 0)
ans += MOD;
cout << ans << endl;
// output(a);
} | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define all_acc(x) (x).begin(), (x).end(), 0LL
#define int long long
#define absSort(v) \
sort(a.begin(), a.end(), \
[](int i, int j) -> bool { return abs(i) < abs(j); });
using namespace std;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
using ll = long long;
// 出力するよ
void output(vector<int> s) {
int n = s.size();
for (int i = 0; i < n; i++) {
if (i != 0)
cout << " ";
cout << s[i]; //<<endl;
}
cout << endl;
}
int MOD = pow(10, 9) + 7;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
absSort(a);
reverse(all(a));
int ans = 1;
// int key = k-1;
vector<int> plus;
vector<int> minus;
// 正ならプラスに追加、負ならマイナスに追加するよ
for (int i = 0; i < n; i++) {
if (a[i] > 0)
plus.push_back(a[i]);
else
minus.push_back(a[i]);
}
if (plus.size() > 0) { // 正値が存在する
if (n ==
k) { // このときは、負の数が偶数個だったらいいよ。でも、n=kなら全部選ぶじゃん
for (int i = 0; i < k; i++) {
ans = (ans * (a[i]) % MOD) % MOD;
}
} else { // このときは、常に正。負の数もうまいこと選んでいく必要あり。
// 負の数を二個ずつ選ぶ。正の数は1つずつ選ぶ。
// checkは選んだ値の数
int check = 0;
// この2つはそれぞれ今見るインデックス
int plus_point = 0;
int minus_point = 0;
// k個選ぶまで続けるよ
while (check < k) {
// 残り一個のときは正の値を加えるよ
if (check == (k - 1)) {
ans = (ans * (plus[plus_point]) % MOD) % MOD;
k--;
} else {
// 残り1個ではないときは、負の値の上位2つと正の値の上位2つを比べる。
// ここで、全て使い切った場合や、正の値が残り1つしかない場合に注意しよう。
int minus_score = -1;
int plus_score = -1;
// マイナスから2つ選べる場合
if ((minus.size() - minus_point) > 1) {
minus_score = minus[minus_point] * minus[minus_point + 1];
}
// プラスから2つ選べる場合
if ((plus.size() - plus_point) > 1) {
plus_score = plus[plus_point] * plus[plus_point + 1];
}
// プラスの方がいいなら、そちらを選ぶ
if (plus_score > minus_score) {
ans = (ans * (plus[plus_point]) % MOD) % MOD;
k--;
plus_point++;
} else {
ans = (ans * (minus_score % MOD)) % MOD;
k -= 2;
minus_point += 2;
}
}
}
}
} else { // 正が1つもない
if (k % 2 == 0) { // 負の数を偶数個選ぶ。このときは、答えは正になるよ。
// minusの前からk個選べばヨシ
for (int i = 0; i < k; i++) {
ans = (ans * (minus[i]) % MOD) % MOD;
}
} else { // kが奇数。つまり、負の数を奇数個選ぶ。答えは負になるよ。
// minusの後ろからk個選べばヨシ
for (int i = 1; i <= k; i++) {
ans = (ans * (minus[minus.size() - i]) % MOD) % MOD;
}
}
}
/*
for (int i = 0; i < k; i++)
{
int ai = a[i];
if (ai > 0)
{
plus.push_back(ai);
}
else
{
minus.push_back(ai);
}
}
//答えが正になる
if ((minus.size() % 2 == 0))
{
for (int i = 0; i < (plus.size()); i++)
{
ans = (ans * (plus[i] % MOD)) % MOD;
}
for (int i = 0; i < (minus.size()); i++)
{
ans = (ans * (minus[i] % MOD)) % MOD;
}
}
//現状答えは負です
else
{
//kは全部です
if (k == (n)){
for (int i = 0; i < (plus.size()); i++){
ans = (ans * (plus[i] % MOD)) % MOD;
}
for (int i = 0; i < (minus.size()); i++){
ans = (ans * (minus[i] % MOD)) % MOD;
}
}
//まだ残っています
else
{
vector<int> plus_other;
vector<int> minus_other;
//残りの奴らを格納する
for(int i=k;i<n;i++){
if(a[i]>0) plus_other.push_back(a[i]);
else minus_other.push_back(a[i]);
}
if(minus_other.size()==0){//マイナスの残りは無いが、プラスの残りはいる＝正にできる
minus.pop_back();
plus.push_back(plus_other[0]);
for (int i = 0; i < (plus.size()); i++){
ans = (ans * (plus[i] % MOD)) % MOD;
}
for (int i = 0; i < (minus.size()); i++){
ans = (ans * (minus[i] % MOD)) % MOD;
}
}else if(plus_other.size()==0){//プラスの残りはいない＝正にできない
for(int i=1;i<=k;i++){
ans=(ans*(a[n-i]%MOD))%MOD;
}
}
else{//プラスもマイナスも残りがいる＝正にできる
int pl=plus_other[0];
int mi=minus_other[0];
if(plus.size()==0){//今のプラスの値が何にもない可能性はある
minus.pop_back();
plus.push_back(plus_other[0]);
for (int i = 0; i < (plus.size()); i++){
ans = (ans * (plus[i] % MOD)) % MOD;
}
for (int i = 0; i < (minus.size()); i++){
ans = (ans * (minus[i] % MOD)) % MOD;
}
}else{//マイナスが0はありえないよん
int plast=plus[plus.size()-1];
int mlast=minus[minus.size()-1];
if(abs(mlast*mi)<=abs(plast*pl)){
plus.pop_back();
minus.push_back(mi);
}else{
minus.pop_back();
plus.push_back(pl);
}
for (int i = 0; i < (plus.size()); i++){
ans = (ans * (plus[i] % MOD)) % MOD;
}
for (int i = 0; i < (minus.size()); i++){
ans = (ans * (minus[i] % MOD)) % MOD;
}
}
}
}
}*/
if (ans < 0)
ans += MOD;
cout << ans << endl;
// output(a);
} | insert | 70 | 70 | 70 | 71 | TLE | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int lli;
typedef vector<lli> vlli;
typedef vector<vlli> vvlli;
typedef vector<string> vs;
typedef vector<bool> vb;
#define rep(i, n) for (i = 0; i < (n); ++i)
#define repA(i, a, n) for (i = a; i <= (n); ++i)
#define repD(i, a, n) for (i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sortr(x) sort(x.begin(), x.end(), greater<int>())
#define mod 1000000007
#define ff first
#define ss second
#define fill(a, c) memset(a, c, sizeof(a))
#define formap(i, v) for (auto &i : v)
#define dbg(x) cout << #x << " = " << x << '\n'
#define dbg2(x, y) \
cout << #x << " = " << x << " & " << #y << " = " << y << endl;
#define dbgstl(v) \
cout << #v << " = \n"; \
{ \
int c = 0; \
formap(it, v) cout << " " << #v << "[" << ++c << "] = " << it << endl; \
} \
cerr << endl
#define dbgstlp(v) \
cout << #v << " = \n"; \
{ \
int c = 0; \
formap(it, v) cout << " " << #v << "[" << ++c << "] = " << it.first \
<< " , " << it.second << endl; \
} \
cerr << endl
#define PI 3.14159265358979323846
#define pb push_back
bool comp(const long long int &a, const long long int &b) {
return abs(a) >= abs(b);
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
lli i, j, k, n, ans = 1, cnt = 0;
cin >> n >> k;
vlli a(n);
rep(i, n) cin >> a[i];
sort(all(a), comp);
for (i = 0; i < k; i++) {
if (a[i] < 0)
cnt++;
ans *= a[i];
ans = ans % mod;
}
if (cnt % 2 != 0) {
lli np, sp, nn, sn;
np = sp = nn = sn = -1;
for (i = k; i < n; i++) {
if (a[i] >= 0 && np == -1)
np = a[i];
if (a[i] <= 0 && nn == -1)
nn = abs(a[i]);
}
for (i = k - 1; i >= 0; i--) {
if (a[i] >= 0 && sp == -1)
sp = a[i];
if (a[i] <= 0 && sn == -1)
sn = abs(a[i]);
}
if ((np == -1 || sn == -1) && (nn == -1 || sp == -1)) {
ans = 1;
for (i = n - 1; i >= n - k; i--) {
ans *= a[i];
ans = ans % mod;
}
if (ans < 0)
ans = (ans + mod) % mod;
} else if (np == -1 || sn == -1) {
int f = 0;
ans = -nn;
for (i = 0; i < k; i++) {
if (f == 0 && a[i] == sp) {
f = 1;
continue;
}
ans *= a[i];
ans = ans % mod;
}
} else if (nn == -1 || sp == -1) {
int f = 0;
ans = np;
for (i = 0; i < k; i++) {
if (f == 0 && a[i] == -sn) {
f = 1;
continue;
}
ans *= a[i];
ans = ans % mod;
}
} else {
if (np * sp >= nn * sn) {
int f = 0;
ans = np;
for (i = 0; i < k; i++) {
if (f == 0 && a[i] == -sn) {
f = 1;
continue;
}
ans *= a[i];
ans = ans % mod;
}
} else {
int f = 0;
ans = -nn;
for (i = 0; i < k; i++) {
if (f == 0 && a[i] == sp) {
f = 1;
continue;
}
ans *= a[i];
ans = ans % mod;
}
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int lli;
typedef vector<lli> vlli;
typedef vector<vlli> vvlli;
typedef vector<string> vs;
typedef vector<bool> vb;
#define rep(i, n) for (i = 0; i < (n); ++i)
#define repA(i, a, n) for (i = a; i <= (n); ++i)
#define repD(i, a, n) for (i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sortr(x) sort(x.begin(), x.end(), greater<int>())
#define mod 1000000007
#define ff first
#define ss second
#define fill(a, c) memset(a, c, sizeof(a))
#define formap(i, v) for (auto &i : v)
#define dbg(x) cout << #x << " = " << x << '\n'
#define dbg2(x, y) \
cout << #x << " = " << x << " & " << #y << " = " << y << endl;
#define dbgstl(v) \
cout << #v << " = \n"; \
{ \
int c = 0; \
formap(it, v) cout << " " << #v << "[" << ++c << "] = " << it << endl; \
} \
cerr << endl
#define dbgstlp(v) \
cout << #v << " = \n"; \
{ \
int c = 0; \
formap(it, v) cout << " " << #v << "[" << ++c << "] = " << it.first \
<< " , " << it.second << endl; \
} \
cerr << endl
#define PI 3.14159265358979323846
#define pb push_back
bool comp(const long long int &a, const long long int &b) {
return abs(a) > abs(b);
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
lli i, j, k, n, ans = 1, cnt = 0;
cin >> n >> k;
vlli a(n);
rep(i, n) cin >> a[i];
sort(all(a), comp);
for (i = 0; i < k; i++) {
if (a[i] < 0)
cnt++;
ans *= a[i];
ans = ans % mod;
}
if (cnt % 2 != 0) {
lli np, sp, nn, sn;
np = sp = nn = sn = -1;
for (i = k; i < n; i++) {
if (a[i] >= 0 && np == -1)
np = a[i];
if (a[i] <= 0 && nn == -1)
nn = abs(a[i]);
}
for (i = k - 1; i >= 0; i--) {
if (a[i] >= 0 && sp == -1)
sp = a[i];
if (a[i] <= 0 && sn == -1)
sn = abs(a[i]);
}
if ((np == -1 || sn == -1) && (nn == -1 || sp == -1)) {
ans = 1;
for (i = n - 1; i >= n - k; i--) {
ans *= a[i];
ans = ans % mod;
}
if (ans < 0)
ans = (ans + mod) % mod;
} else if (np == -1 || sn == -1) {
int f = 0;
ans = -nn;
for (i = 0; i < k; i++) {
if (f == 0 && a[i] == sp) {
f = 1;
continue;
}
ans *= a[i];
ans = ans % mod;
}
} else if (nn == -1 || sp == -1) {
int f = 0;
ans = np;
for (i = 0; i < k; i++) {
if (f == 0 && a[i] == -sn) {
f = 1;
continue;
}
ans *= a[i];
ans = ans % mod;
}
} else {
if (np * sp >= nn * sn) {
int f = 0;
ans = np;
for (i = 0; i < k; i++) {
if (f == 0 && a[i] == -sn) {
f = 1;
continue;
}
ans *= a[i];
ans = ans % mod;
}
} else {
int f = 0;
ans = -nn;
for (i = 0; i < k; i++) {
if (f == 0 && a[i] == sp) {
f = 1;
continue;
}
ans *= a[i];
ans = ans % mod;
}
}
}
}
cout << ans << endl;
return 0;
}
| replace | 49 | 50 | 49 | 50 | 0 | |
p02616 | C++ | Runtime Error | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18 + 18;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) \
cerr << #mp << ":" << endl; \
for (auto i = mp.begin(); i != mp.end(); ++i) { \
cerr << i->first << ":" << i->second << endl; \
}
#define dbgset(st) \
cerr << #st << ":" << endl; \
for (auto i = st.begin(); i != st.end(); ++i) { \
cerr << *i << " "; \
} \
cerr << endl;
#define dbgarr(n, m, arr) \
rep(i, n) { \
rep(j, m) { cerr << arr[i][j] << " "; } \
cerr << endl; \
}
#define dbgdp(n, arr) \
rep(i, n) { cerr << arr[i] << " "; } \
cerr << endl;
#define dbgmint(n, arr) \
rep(i, n) { cerr << arr[i].x << " "; } \
cerr << endl;
#define dbgarrmint(n, m, arr) \
rep(i, n) { \
rep(j, m) { cerr << arr[i][j].x << " "; } \
cerr << endl; \
}
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#define dbgmint(...)
#define dbgarrmint(...)
#endif
#define out(a) cout << a << endl
#define out2(a, b) cout << a << " " << b << endl
#define vout(v) \
rep(i, v.size()) { cout << v[i] << " "; } \
cout << endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> istream &operator>>(istream &i, vector<T> &v) {
rep(j, v.size()) i >> v[j];
return i;
}
// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " ";
}
return s;
}
// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
// mint
struct mint {
ll x; // typedef long long ll;
mint(ll 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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= 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 { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
typedef vector<mint> Vmint;
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
int solve() {
ll n, k;
cin >> n >> k;
Vec a(n);
cin >> a;
Vec plus;
Vec minus;
ll zero = 0;
if (k == n) {
mint ans = 1;
rep(i, n) { ans *= a[i]; }
out(ans);
return 0;
}
if (k == 1) {
ll ans = -INF;
rep(i, n) { chmax(ans, a[i]); }
out(ans);
return 0;
}
deque<ll> pq;
deque<ll> mq;
rep(i, n) {
if (a[i] > 0) {
plus.pb(a[i]);
} else if (a[i] == 0) {
zero++;
} else {
minus.pb(-a[i]);
}
}
sort(rALL(plus));
sort(rALL(minus));
dbg(plus);
dbg(minus);
// 絶望ストップロス
if (zero == 0 && plus.empty() && k % 2 == 1) {
sort(ALL(minus));
mint ans = 1;
rep(i, k) { ans *= -minus[i]; }
out(ans);
return 0;
}
if (plus.empty() && k % 2 == 1) {
if (zero > 0) {
out(0);
return 0;
}
}
ll plable = plus.size();
ll miable = minus.size() / 2 * 2;
// 不等号変更した
if (k % 2 == 1 && k - (plable + miable) <= 2) {
mint ans = 1;
rep(i, miable) { ans *= minus[i]; }
k -= miable;
if (plus.size() >= k) {
rep(i, k) { ans *= plus[i]; }
out(ans);
} else {
if (zero > 0) {
out(0);
} else {
ll x = 3LL / 0;
exit(15);
}
}
return 0;
}
mint ans = 1;
rep(i, plus.size()) { pq.push_back(plus[i]); }
rep(i, minus.size()) { mq.push_back(minus[i]); }
while (k) {
dbg(k);
if (k == 1) {
// 場合分け
if (!pq.empty()) {
ans *= pq[0];
k--;
break;
} else {
if (zero > 0) {
out(0);
exit(0);
} else {
ans *= mq[0];
k--;
break;
}
}
} else {
ll pp = -INF;
ll mm = -INF;
if (pq.size() >= 2) {
pp = pq[0] * pq[1];
}
if (mq.size() >= 2) {
mm = mq[0] * mq[1];
}
if (pp == -INF && mm == -INF) {
out(0);
exit(0);
}
dbg(mp(pq.size(), mq.size()));
if (pp > mm) {
ans *= pq[0] * pq[1];
pq.pop_front();
pq.pop_front();
} else {
ans *= mq[0] * mq[1];
mq.pop_front();
mq.pop_front();
}
dbg(mp(pp, mm));
k -= 2;
}
}
out(ans);
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
solve();
}
| #ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18 + 18;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) \
cerr << #mp << ":" << endl; \
for (auto i = mp.begin(); i != mp.end(); ++i) { \
cerr << i->first << ":" << i->second << endl; \
}
#define dbgset(st) \
cerr << #st << ":" << endl; \
for (auto i = st.begin(); i != st.end(); ++i) { \
cerr << *i << " "; \
} \
cerr << endl;
#define dbgarr(n, m, arr) \
rep(i, n) { \
rep(j, m) { cerr << arr[i][j] << " "; } \
cerr << endl; \
}
#define dbgdp(n, arr) \
rep(i, n) { cerr << arr[i] << " "; } \
cerr << endl;
#define dbgmint(n, arr) \
rep(i, n) { cerr << arr[i].x << " "; } \
cerr << endl;
#define dbgarrmint(n, m, arr) \
rep(i, n) { \
rep(j, m) { cerr << arr[i][j].x << " "; } \
cerr << endl; \
}
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#define dbgmint(...)
#define dbgarrmint(...)
#endif
#define out(a) cout << a << endl
#define out2(a, b) cout << a << " " << b << endl
#define vout(v) \
rep(i, v.size()) { cout << v[i] << " "; } \
cout << endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> istream &operator>>(istream &i, vector<T> &v) {
rep(j, v.size()) i >> v[j];
return i;
}
// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " ";
}
return s;
}
// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
// mint
struct mint {
ll x; // typedef long long ll;
mint(ll 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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= 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 { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
typedef vector<mint> Vmint;
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
int solve() {
ll n, k;
cin >> n >> k;
Vec a(n);
cin >> a;
Vec plus;
Vec minus;
ll zero = 0;
if (k == n) {
mint ans = 1;
rep(i, n) { ans *= a[i]; }
out(ans);
return 0;
}
if (k == 1) {
ll ans = -INF;
rep(i, n) { chmax(ans, a[i]); }
out(ans);
return 0;
}
deque<ll> pq;
deque<ll> mq;
rep(i, n) {
if (a[i] > 0) {
plus.pb(a[i]);
} else if (a[i] == 0) {
zero++;
} else {
minus.pb(-a[i]);
}
}
sort(rALL(plus));
sort(rALL(minus));
dbg(plus);
dbg(minus);
// 絶望ストップロス
if (zero == 0 && plus.empty() && k % 2 == 1) {
sort(ALL(minus));
mint ans = 1;
rep(i, k) { ans *= -minus[i]; }
out(ans);
return 0;
}
if (plus.empty() && k % 2 == 1) {
if (zero > 0) {
out(0);
return 0;
}
}
ll plable = plus.size();
ll miable = minus.size() / 2 * 2;
// 不等号変更した
if (k % 2 == 1 && (plable + miable) - k < 2) {
mint ans = 1;
rep(i, miable) { ans *= minus[i]; }
k -= miable;
if (plus.size() >= k) {
rep(i, k) { ans *= plus[i]; }
out(ans);
} else {
if (zero > 0) {
out(0);
} else {
ll x = 3LL / 0;
exit(15);
}
}
return 0;
}
mint ans = 1;
rep(i, plus.size()) { pq.push_back(plus[i]); }
rep(i, minus.size()) { mq.push_back(minus[i]); }
while (k) {
dbg(k);
if (k == 1) {
// 場合分け
if (!pq.empty()) {
ans *= pq[0];
k--;
break;
} else {
if (zero > 0) {
out(0);
exit(0);
} else {
ans *= mq[0];
k--;
break;
}
}
} else {
ll pp = -INF;
ll mm = -INF;
if (pq.size() >= 2) {
pp = pq[0] * pq[1];
}
if (mq.size() >= 2) {
mm = mq[0] * mq[1];
}
if (pp == -INF && mm == -INF) {
out(0);
exit(0);
}
dbg(mp(pq.size(), mq.size()));
if (pp > mm) {
ans *= pq[0] * pq[1];
pq.pop_front();
pq.pop_front();
} else {
ans *= mq[0] * mq[1];
mq.pop_front();
mq.pop_front();
}
dbg(mp(pp, mm));
k -= 2;
}
}
out(ans);
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
solve();
}
| replace | 248 | 249 | 248 | 249 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> a(n);
vector<long long> pos; // 0以上の数を受け取る
vector<long long> neg; // 負の値を受け取る
for (long long i = 0; i < n; i++) {
long long x;
cin >> x;
a[i] = x;
if (x >= 0)
pos.push_back(x);
else
neg.push_back(x);
}
sort(pos.begin(), pos.end());
sort(neg.begin(), neg.end()); // 絶対値が大きい順
reverse(pos.begin(), pos.end()); // 大きい順にする
long long ans = 1;
// k=nの時
if (k == n) {
for (long long i = 0; i < n; i++) {
ans *= (a[i] + MOD);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
// 正の数がないとき
if (pos.empty()) {
// 答えが負になるとき絶対値の小さい順
if (k % 2) {
reverse(neg.begin(), neg.end());
for (long long i = 0; i < k; i++) {
ans *= (MOD + neg[i]);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
// 答えが正になるとき大きい順でとる
else {
for (long long i = 0; i < k; i++) {
ans *= (MOD + neg[i]);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
}
// kが奇数の時正の数の最大値をあらかじめ取っておく
if (k % 2) {
ans *= pos[0];
pos.erase(pos.begin());
}
long long p = pos.size();
long long ne = neg.size();
vector<long long> pos_pair;
vector<long long> neg_pair;
for (long long i = 0; i < p / 2; i++) {
pos_pair[i] = (pos[i * 2] * pos[i * 2 + 1]);
}
for (long long i = 0; i < ne / 2; i++) {
neg_pair[i] = (neg[i * 2] * neg[i * 2 + 1]);
}
long long pk = 0, nk = 0;
for (long long i = 0; i < k / 2; i++) {
if (pk == p / 2) {
neg_pair[nk] %= MOD;
ans *= neg_pair[nk];
ans %= MOD;
nk++;
} else if (nk == ne / 2) {
pos_pair[pk] %= MOD;
ans *= pos_pair[pk];
ans %= MOD;
pk++;
} else {
if (pos_pair[pk] > neg_pair[nk]) {
pos_pair[pk] %= MOD;
ans *= pos_pair[pk];
ans %= MOD;
pk++;
} else {
neg_pair[nk] %= MOD;
ans *= neg_pair[nk];
ans %= MOD;
nk++;
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> a(n);
vector<long long> pos; // 0以上の数を受け取る
vector<long long> neg; // 負の値を受け取る
for (long long i = 0; i < n; i++) {
long long x;
cin >> x;
a[i] = x;
if (x >= 0)
pos.push_back(x);
else
neg.push_back(x);
}
sort(pos.begin(), pos.end());
sort(neg.begin(), neg.end()); // 絶対値が大きい順
reverse(pos.begin(), pos.end()); // 大きい順にする
long long ans = 1;
// k=nの時
if (k == n) {
for (long long i = 0; i < n; i++) {
ans *= (a[i] + MOD);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
// 正の数がないとき
if (pos.empty()) {
// 答えが負になるとき絶対値の小さい順
if (k % 2) {
reverse(neg.begin(), neg.end());
for (long long i = 0; i < k; i++) {
ans *= (MOD + neg[i]);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
// 答えが正になるとき大きい順でとる
else {
for (long long i = 0; i < k; i++) {
ans *= (MOD + neg[i]);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
}
// kが奇数の時正の数の最大値をあらかじめ取っておく
if (k % 2) {
ans *= pos[0];
pos.erase(pos.begin());
}
long long p = pos.size();
long long ne = neg.size();
vector<long long> pos_pair(p / 2);
vector<long long> neg_pair(ne / 2);
for (long long i = 0; i < p / 2; i++) {
pos_pair[i] = (pos[i * 2] * pos[i * 2 + 1]);
}
for (long long i = 0; i < ne / 2; i++) {
neg_pair[i] = (neg[i * 2] * neg[i * 2 + 1]);
}
long long pk = 0, nk = 0;
for (long long i = 0; i < k / 2; i++) {
if (pk == p / 2) {
neg_pair[nk] %= MOD;
ans *= neg_pair[nk];
ans %= MOD;
nk++;
} else if (nk == ne / 2) {
pos_pair[pk] %= MOD;
ans *= pos_pair[pk];
ans %= MOD;
pk++;
} else {
if (pos_pair[pk] > neg_pair[nk]) {
pos_pair[pk] %= MOD;
ans *= pos_pair[pk];
ans %= MOD;
pk++;
} else {
neg_pair[nk] %= MOD;
ans *= neg_pair[nk];
ans %= MOD;
nk++;
}
}
}
cout << ans << endl;
}
| replace | 62 | 64 | 62 | 64 | -11 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F_OR(i, a, b, s) \
for (int i = (a); ((s) > 0 ? i < (b) : i > (b)); i += (s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, (b) < (e) ? 1 : -1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define FOR(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)(__VA_ARGS__)
#ifdef LOCAL
#define dbg(x) cerr << '[' << #x << ":" << (x) << "]\n"
#else
#define dbg(x)
#endif
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
int npos = 0, nneg = 0;
vector<int> pos, neg;
FOR(n) {
int a;
cin >> a;
if (a < 0)
neg.pb(a), nneg++;
else
pos.pb(a), npos++;
}
sort(rall(pos));
sort(all(neg));
auto mul = [&](vector<int> &v, int x) {
ll ans = 1;
FOR(x)(ans *= v[i]) %= MOD;
if (ans < 0)
ans += MOD;
return ans;
};
if (npos == 0) {
if (k & 1)
reverse(all(neg));
cout << mul(neg, k);
return 0;
}
int i = 0, j = 0;
vector<int> chp, chn;
FOR(z, k) {
if (j == nneg || (i < npos && pos[i] > -neg[j]))
chp.pb(pos[i]), i++;
else
chn.pb(neg[j]), j++;
}
if ((j & 1) ^ 1) {
// dbg(i),dbg(j);
cout << mul(chp, chp.size()) * mul(chn, chn.size()) % MOD;
return 0;
}
if (i < npos &&
(j == nneg || (ll)chp.back() * pos[i] > (ll)chn.back() * neg[j])) {
chp.pb(pos[i]);
chn.pop_back();
cout << mul(chp, chp.size()) * mul(chn, chn.size()) % MOD;
} else if (j < nneg) {
chn.pb(neg[j]);
chp.pop_back();
cout << mul(chp, chp.size()) * mul(chn, chn.size()) % MOD;
} else {
cout << mul(chp, chp.size()) * mul(chn, chn.size()) % MOD;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F_OR(i, a, b, s) \
for (int i = (a); ((s) > 0 ? i < (b) : i > (b)); i += (s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, (b) < (e) ? 1 : -1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define FOR(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)(__VA_ARGS__)
#ifdef LOCAL
#define dbg(x) cerr << '[' << #x << ":" << (x) << "]\n"
#else
#define dbg(x)
#endif
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
int npos = 0, nneg = 0;
vector<int> pos, neg;
FOR(n) {
int a;
cin >> a;
if (a < 0)
neg.pb(a), nneg++;
else
pos.pb(a), npos++;
}
sort(rall(pos));
sort(all(neg));
auto mul = [&](vector<int> &v, int x) {
ll ans = 1;
FOR(x)(ans *= v[i]) %= MOD;
if (ans < 0)
ans += MOD;
return ans;
};
if (npos == 0) {
if (k & 1)
reverse(all(neg));
cout << mul(neg, k);
return 0;
}
int i = 0, j = 0;
vector<int> chp, chn;
FOR(z, k) {
if (j == nneg || (i < npos && pos[i] > -neg[j]))
chp.pb(pos[i]), i++;
else
chn.pb(neg[j]), j++;
}
if ((j & 1) ^ 1) {
// dbg(i),dbg(j);
cout << mul(chp, chp.size()) * mul(chn, chn.size()) % MOD;
return 0;
}
if (i == 0 || i < npos && (j == nneg || (ll)chp.back() * pos[i] >
(ll)chn.back() * neg[j])) {
chp.pb(pos[i]);
chn.pop_back();
cout << mul(chp, chp.size()) * mul(chn, chn.size()) % MOD;
} else if (j < nneg) {
chn.pb(neg[j]);
chp.pop_back();
cout << mul(chp, chp.size()) * mul(chn, chn.size()) % MOD;
} else {
cout << mul(chp, chp.size()) * mul(chn, chn.size()) % MOD;
}
} | replace | 63 | 65 | 63 | 65 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 200010;
ll a[N];
int n, m;
int main() {
int t;
// while(){
int k;
scanf("%d%d", &n, &k);
vector<ll> v, v1;
ll mod = 1e9 + 7;
for (int i = 0; i < n; ++i) {
scanf("%lld", a + i);
if (a[i] >= 0) {
v.push_back(a[i]);
} else {
v1.push_back(-a[i]);
}
}
sort(v.begin(), v.end());
sort(v1.begin(), v1.end());
ll ans = 1;
if (k % 2) {
if (v.size() == 0) {
for (int i = 0; i < k; ++i) {
ans *= -v1[i];
ans %= mod;
}
if (ans < 0)
ans += mod;
cout << ans << endl;
return 0;
}
--k;
ans = v.back();
v.pop_back();
}
while (k > 0) {
ll tmp1 = -1, tmp2 = -1;
if (v.size() >= 2) {
tmp1 = v.back() * v[((int)v.size()) - 2];
}
if (v1.size() >= 2) {
tmp2 = v1.back() * v1[((int)v1.size()) - 2];
}
assert(tmp1 >= 0 || tmp2 >= 0);
if (tmp1 > tmp2) {
tmp1 %= mod;
ans *= tmp1;
ans %= mod;
v.pop_back();
v.pop_back();
} else {
tmp2 %= mod;
ans *= tmp2;
ans %= mod;
v1.pop_back();
v1.pop_back();
}
k -= 2;
}
ans %= mod;
if (ans < 0)
ans += mod;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 200010;
ll a[N];
int n, m;
int main() {
int t;
// while(){
int k;
scanf("%d%d", &n, &k);
vector<ll> v, v1;
ll mod = 1e9 + 7;
for (int i = 0; i < n; ++i) {
scanf("%lld", a + i);
if (a[i] >= 0) {
v.push_back(a[i]);
} else {
v1.push_back(-a[i]);
}
}
sort(v.begin(), v.end());
sort(v1.begin(), v1.end());
ll ans = 1;
if (n == k) {
for (int i = 0; i < n; ++i) {
ans *= a[i];
ans %= mod;
}
if (ans < 0)
ans += mod;
cout << ans << endl;
return 0;
}
if (k % 2) {
if (v.size() == 0) {
for (int i = 0; i < k; ++i) {
ans *= -v1[i];
ans %= mod;
}
if (ans < 0)
ans += mod;
cout << ans << endl;
return 0;
}
--k;
ans = v.back();
v.pop_back();
}
while (k > 0) {
ll tmp1 = -1, tmp2 = -1;
if (v.size() >= 2) {
tmp1 = v.back() * v[((int)v.size()) - 2];
}
if (v1.size() >= 2) {
tmp2 = v1.back() * v1[((int)v1.size()) - 2];
}
assert(tmp1 >= 0 || tmp2 >= 0);
if (tmp1 > tmp2) {
tmp1 %= mod;
ans *= tmp1;
ans %= mod;
v.pop_back();
v.pop_back();
} else {
tmp2 %= mod;
ans *= tmp2;
ans %= mod;
v1.pop_back();
v1.pop_back();
}
k -= 2;
}
ans %= mod;
if (ans < 0)
ans += mod;
cout << ans << endl;
return 0;
} | insert | 25 | 25 | 25 | 35 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldouble = long double;
// BDD,ZDD,kdtree, bdtree,bicalc, bolonoy, doloney, tree,
// chinesemod,segmenttree,daikusutora, saidairyuu, 2bugurahu, heirokenshutu,
// topologicalsort, kyourenketuseibun
#define REP(i, a, b) for (int i = a; i < b; ++i)
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
ll N, K;
vector<ll> a;
vector<ll> ap;
vector<ll> am;
ll MOD = 1000000007;
ll mod(ll x) { return (x % MOD + MOD) % MOD; }
int main() {
cin >> N >> K;
a.resize(N);
REP(i, 0, N) {
cin >> a[i];
if (a[i] >= 0)
ap.push_back(a[i]);
else
am.push_back(a[i]);
}
bool minus = false;
int ccc = 0;
while (ccc + 2 <= K && ccc + 2 <= am.size())
ccc += 2;
if (ccc + ap.size() < K)
minus = true;
if (minus) {
sort(a.begin(), a.end(), [](ll x, ll y) { return abs(x) < abs(y); });
ll ret = 1;
REP(i, 0, K) ret = mod(ret * a[i]);
PRI(ret);
return 0;
}
sort(ap.begin(), ap.end(), greater<ll>());
sort(am.begin(), am.end(), less<ll>());
vector<ll> pick(K);
REP(i, 0, K) pick[i] = i < a.size() ? ap[i] : 0;
sort(pick.begin(), pick.end(), less<ll>());
for (int i = 0; i + 1 < K && i + 1 < am.size(); i += 2) {
if (pick[i] * pick[i + 1] < am[i] * am[i + 1]) {
pick[i] = am[i];
pick[i + 1] = am[i + 1];
} else
break;
}
ll ret = 1;
REP(i, 0, K) ret = mod(ret * pick[i]);
PRI(ret);
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldouble = long double;
// BDD,ZDD,kdtree, bdtree,bicalc, bolonoy, doloney, tree,
// chinesemod,segmenttree,daikusutora, saidairyuu, 2bugurahu, heirokenshutu,
// topologicalsort, kyourenketuseibun
#define REP(i, a, b) for (int i = a; i < b; ++i)
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
ll N, K;
vector<ll> a;
vector<ll> ap;
vector<ll> am;
ll MOD = 1000000007;
ll mod(ll x) { return (x % MOD + MOD) % MOD; }
int main() {
cin >> N >> K;
a.resize(N);
REP(i, 0, N) {
cin >> a[i];
if (a[i] >= 0)
ap.push_back(a[i]);
else
am.push_back(a[i]);
}
bool minus = false;
int ccc = 0;
while (ccc + 2 <= K && ccc + 2 <= am.size())
ccc += 2;
if (ccc + ap.size() < K)
minus = true;
if (minus) {
sort(a.begin(), a.end(), [](ll x, ll y) { return abs(x) < abs(y); });
ll ret = 1;
REP(i, 0, K) ret = mod(ret * a[i]);
PRI(ret);
return 0;
}
sort(ap.begin(), ap.end(), greater<ll>());
sort(am.begin(), am.end(), less<ll>());
vector<ll> pick(K);
REP(i, 0, K) pick[i] = i < ap.size() ? ap[i] : 0;
sort(pick.begin(), pick.end(), less<ll>());
for (int i = 0; i + 1 < K && i + 1 < am.size(); i += 2) {
if (pick[i] * pick[i + 1] < am[i] * am[i + 1]) {
pick[i] = am[i];
pick[i + 1] = am[i + 1];
} else
break;
}
ll ret = 1;
REP(i, 0, K) ret = mod(ret * pick[i]);
PRI(ret);
return 0;
}
| replace | 71 | 72 | 71 | 72 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
int a[111111];
int cmp(int a, int b) { return abs(b) > abs(a); }
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t, sn = 0;
int n, k;
cin >> n >> k;
sn += n;
bool zero = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
zero |= (a[i] == 0);
}
sort(a, a + n, cmp);
sn = 1;
vector<int> nums;
int gneg = -1e9 - 1, gpos = 1e9 + 1;
for (int i = 0, id = n - 1; i < k; ++i, id--) {
if (a[id] < 0)
sn *= -1;
nums.push_back(a[id]);
if (a[id] < 0)
gneg = max(gneg, a[id]);
else
gpos = min(gpos, a[id]);
}
if (sn > 0) {
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else {
int mn = 1, mx = -1;
for (int i = 0; i < n - k; ++i) {
mn = min(mn, a[i]);
mx = max(mx, a[i]);
}
bool g1 = gneg != -1e-9 - 1 && mx != -1;
bool g2 = gpos != 1e9 + 1 && mn != 1;
if (g1 && g2) {
int val, repl;
if (mx * 1ll * gpos > mn * 1ll * gneg)
val = gneg, repl = mx;
else
val = gpos, repl = mn;
for (int i = 0; i < k; ++i)
if (nums[i] == val) {
nums[i] = repl;
break;
}
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else if (g1) {
for (int i = 0; i < k; ++i)
if (nums[i] == gneg) {
nums[i] = mx;
break;
}
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else if (g2) {
for (int i = 0; i < k; ++i)
if (nums[i] == gpos) {
nums[i] = mn;
break;
}
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else {
if (zero)
cout << "0\n";
else {
int ans = 1;
for (int i = 0; i < k; ++i)
ans = (ans * 1ll * a[i]) % mod;
cout << (ans + mod) % mod << "\n";
}
}
}
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
int a[3 * 100000];
int cmp(int a, int b) { return abs(b) > abs(a); }
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t, sn = 0;
int n, k;
cin >> n >> k;
sn += n;
bool zero = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
zero |= (a[i] == 0);
}
sort(a, a + n, cmp);
sn = 1;
vector<int> nums;
int gneg = -1e9 - 1, gpos = 1e9 + 1;
for (int i = 0, id = n - 1; i < k; ++i, id--) {
if (a[id] < 0)
sn *= -1;
nums.push_back(a[id]);
if (a[id] < 0)
gneg = max(gneg, a[id]);
else
gpos = min(gpos, a[id]);
}
if (sn > 0) {
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else {
int mn = 1, mx = -1;
for (int i = 0; i < n - k; ++i) {
mn = min(mn, a[i]);
mx = max(mx, a[i]);
}
bool g1 = gneg != -1e-9 - 1 && mx != -1;
bool g2 = gpos != 1e9 + 1 && mn != 1;
if (g1 && g2) {
int val, repl;
if (mx * 1ll * gpos > mn * 1ll * gneg)
val = gneg, repl = mx;
else
val = gpos, repl = mn;
for (int i = 0; i < k; ++i)
if (nums[i] == val) {
nums[i] = repl;
break;
}
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else if (g1) {
for (int i = 0; i < k; ++i)
if (nums[i] == gneg) {
nums[i] = mx;
break;
}
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else if (g2) {
for (int i = 0; i < k; ++i)
if (nums[i] == gpos) {
nums[i] = mn;
break;
}
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else {
if (zero)
cout << "0\n";
else {
int ans = 1;
for (int i = 0; i < k; ++i)
ans = (ans * 1ll * a[i]) % mod;
cout << (ans + mod) % mod << "\n";
}
}
}
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() \
std::ios::sync_with_stdio(false); \
std::cin.tie(0); \
std::cout << fixed << setprecision(15);
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;
}
using namespace std;
ll modval(ll num) { return (num % MODV + MODV) % MODV; }
int main() {
Init();
ll n, k, ans = 1, zcnt = 0;
cin >> n >> k;
vector<ll> a(n), pos, neg, zero;
rep(i, n) {
cin >> a[i];
if (a[i] >= 0)
pos.push_back(a[i]);
else if (a[i] < 0)
neg.push_back(a[i]);
if (a[i] == 0)
zcnt++;
}
ll pcnt = pos.size() - zcnt;
ll ncnt = neg.size();
// nとkが同じなら全部掛け合わせるしか無い
if (n == k)
rep(i, n) ans = (ans * a[i]) % MODV;
// k個抜き出すと絶対0を含んでしまう場合
else if (pcnt + ncnt < k)
ans = 0;
// kが1なら最大値を抜き出すだけ
else if (k == 1) {
sort(all(a), greater<ll>());
ans = a[0];
}
// kが奇数で、正の値が1つも無い場合は負の値（or 0）となる
else if (k % 2 == 1 && pcnt == 0) {
sort(all(a), greater<ll>());
rep(i, k) ans = (ans * a[i]) % MODV;
}
// それ以外は絶対正にできる
else {
sort(all(pos), greater<ll>());
sort(all(neg));
ll ppos = 0, npos = 0;
// 奇数だったら正の数の最大値を1個かけておく
if (k % 2 == 1) {
ans *= pos[ppos];
ppos++;
k--;
}
vector<ll> mulpair;
for (ppos; ppos < pos.size() - 1; ppos += 2)
mulpair.push_back(pos[ppos] * pos[ppos + 1]);
for (npos; npos < neg.size() - 1; npos += 2)
mulpair.push_back(neg[npos] * neg[npos + 1]);
sort(all(mulpair), greater<ll>());
k /= 2;
rep(i, k) { ans = ans * (mulpair[i] % MODV) % MODV; }
}
cout << modval(ans) << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() \
std::ios::sync_with_stdio(false); \
std::cin.tie(0); \
std::cout << fixed << setprecision(15);
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;
}
using namespace std;
ll modval(ll num) { return (num % MODV + MODV) % MODV; }
int main() {
Init();
ll n, k, ans = 1, zcnt = 0;
cin >> n >> k;
vector<ll> a(n), pos, neg, zero;
rep(i, n) {
cin >> a[i];
if (a[i] >= 0)
pos.push_back(a[i]);
else if (a[i] < 0)
neg.push_back(a[i]);
if (a[i] == 0)
zcnt++;
}
ll pcnt = pos.size() - zcnt;
ll ncnt = neg.size();
// nとkが同じなら全部掛け合わせるしか無い
if (n == k)
rep(i, n) ans = (ans * a[i]) % MODV;
// k個抜き出すと絶対0を含んでしまう場合
else if (pcnt + ncnt < k)
ans = 0;
// kが1なら最大値を抜き出すだけ
else if (k == 1) {
sort(all(a), greater<ll>());
ans = a[0];
}
// kが奇数で、正の値が1つも無い場合は負の値（or 0）となる
else if (k % 2 == 1 && pcnt == 0) {
sort(all(a), greater<ll>());
rep(i, k) ans = (ans * a[i]) % MODV;
}
// それ以外は絶対正にできる
else {
sort(all(pos), greater<ll>());
sort(all(neg));
ll ppos = 0, npos = 0;
// 奇数だったら正の数の最大値を1個かけておく
if (k % 2 == 1) {
ans *= pos[ppos];
ppos++;
k--;
}
vector<ll> mulpair;
if (pos.size() - ppos >= 2)
for (ppos; ppos < pos.size() - 1; ppos += 2)
mulpair.push_back(pos[ppos] * pos[ppos + 1]);
if (neg.size() >= 2)
for (npos; npos < neg.size() - 1; npos += 2)
mulpair.push_back(neg[npos] * neg[npos + 1]);
sort(all(mulpair), greater<ll>());
k /= 2;
rep(i, k) { ans = ans * (mulpair[i] % MODV) % MODV; }
}
cout << modval(ans) << endl;
} | replace | 83 | 87 | 83 | 89 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(k) rep(author_is_masa, k)
#define chmin(a, b) \
if ((a) > (b)) \
(a) = (b);
#define chmax(a, b) \
if ((a) < (b)) \
(a) = (b);
#define vi vector<int>
#define pii pair<int, int>
#define all(v) (v).begin(), (v).end()
#define allr(v) (v).rbegin(), (v).rend()
#define pb push_back
#define pf push_front
int gcd(int a, int b) { /*a>=0,b>=0,￢(a=b=0)*/
while (min(a, b) > 0) {
if (a < b)
swap(a, b);
a %= b;
}
return max(a, b);
}
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int MOD = 1e9 + 7;
const long long INF = 1e18;
/*--------------------------------------------------------------------*/
signed main() {
int n, k;
cin >> n >> k;
vi po, ne;
int zero = 0, pos, neg;
rep(i, n) {
int a;
cin >> a;
if (a >= 0)
po.pb(a);
else
ne.pb(a);
}
pos = po.size();
neg = ne.size();
sort(all(po));
sort(all(ne));
reverse(all(po));
int pro;
if (n == k) {
pro = 1;
rep(i, pos) {
pro *= po[i];
pro %= MOD;
}
rep(i, neg) {
pro *= ne[i];
pro = (pro + MOD * MOD) % MOD;
}
cout << pro << endl;
return 0;
}
if (pos == 0 && k % 2 == 1) {
pro = 1;
rep(i, k) {
pro *= ne[neg - i - 1];
pro = (pro + MOD * MOD) % MOD;
}
cout << pro << endl;
return 0;
}
int ip = 0, in = 0;
pro = 1;
while (in + ip < k) {
if (k - ip - in >= 2 && in + 1 < neg && ip + 1 < pos &&
ne[in] * ne[in + 1] >= po[ip] * po[ip + 1]) {
pro *= ne[in];
pro = (pro + MOD * MOD) % MOD;
pro *= ne[in + 1];
pro = (pro + MOD * MOD) % MOD;
in += 2;
} else if (k - ip - in >= 2 && in + 1 < neg && ip == pos) {
pro *= ne[in];
pro = (pro + MOD * MOD) % MOD;
pro *= ne[in + 1];
pro = (pro + MOD * MOD) % MOD;
in += 2;
} else if (ip < pos) {
pro *= po[ip];
pro %= MOD;
ip++;
} else {
assert(0);
}
}
cout << pro << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(k) rep(author_is_masa, k)
#define chmin(a, b) \
if ((a) > (b)) \
(a) = (b);
#define chmax(a, b) \
if ((a) < (b)) \
(a) = (b);
#define vi vector<int>
#define pii pair<int, int>
#define all(v) (v).begin(), (v).end()
#define allr(v) (v).rbegin(), (v).rend()
#define pb push_back
#define pf push_front
int gcd(int a, int b) { /*a>=0,b>=0,￢(a=b=0)*/
while (min(a, b) > 0) {
if (a < b)
swap(a, b);
a %= b;
}
return max(a, b);
}
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int MOD = 1e9 + 7;
const long long INF = 1e18;
/*--------------------------------------------------------------------*/
signed main() {
int n, k;
cin >> n >> k;
vi po, ne;
int zero = 0, pos, neg;
rep(i, n) {
int a;
cin >> a;
if (a >= 0)
po.pb(a);
else
ne.pb(a);
}
pos = po.size();
neg = ne.size();
sort(all(po));
sort(all(ne));
reverse(all(po));
int pro;
if (n == k) {
pro = 1;
rep(i, pos) {
pro *= po[i];
pro %= MOD;
}
rep(i, neg) {
pro *= ne[i];
pro = (pro + MOD * MOD) % MOD;
}
cout << pro << endl;
return 0;
}
if (pos == 0 && k % 2 == 1) {
pro = 1;
rep(i, k) {
pro *= ne[neg - i - 1];
pro = (pro + MOD * MOD) % MOD;
}
cout << pro << endl;
return 0;
}
int ip = 0, in = 0;
pro = 1;
while (in + ip < k) {
if (k - ip - in >= 2 && in + 1 < neg && ip + 1 < pos &&
ne[in] * ne[in + 1] >= po[ip] * po[ip + 1]) {
pro *= ne[in];
pro = (pro + MOD * MOD) % MOD;
pro *= ne[in + 1];
pro = (pro + MOD * MOD) % MOD;
in += 2;
} else if (k - ip - in >= 2 && in + 1 < neg && ip + 1 >= pos) {
pro *= ne[in];
pro = (pro + MOD * MOD) % MOD;
pro *= ne[in + 1];
pro = (pro + MOD * MOD) % MOD;
in += 2;
} else if (ip < pos) {
pro *= po[ip];
pro %= MOD;
ip++;
} else {
assert(0);
}
}
cout << pro << endl;
return 0;
}
| replace | 91 | 92 | 91 | 92 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) { return fabs(a - b) < DBL_EPSILON; }
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
// ofstream outfile("log.txt");
// outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0')
// << rank << endl;
// std::cout << std::bitset<8>(9);
// const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQ_ASK;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
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 std::istream &operator>>(std::istream &in, mint &o) {
ll a;
in >> a;
o = a;
return in;
}
friend std::ostream &operator<<(std::ostream &out, const mint &o) {
out << o.x;
return out;
}
};
int main() {
ifstream cin("C:\\Users\\riku\\Downloads\\random_pm00.txt");
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
vector<ll> plus, minus;
int zero = 0;
for (ll l : v) {
if (l > 0)
plus.push_back(l);
else if (l < 0)
minus.push_back(l);
else
zero++;
}
sort(plus.rbegin(), plus.rend());
sort(minus.rbegin(), minus.rend());
if ((n - zero) < k) {
cout << 0 << endl;
ret();
}
// 必ずプラス
int mim = max<ll>(k - plus.size(), 0);
if (mim % 2 == 0 || (plus.size() > 0 && minus.size() - mim > 0)) {
vector<ll> abs_sort = v;
sort(abs_sort.rbegin(), abs_sort.rend(),
[](ll a, ll b) { return abs(a) < abs(b); });
assert(count(abs_sort.begin(), abs_sort.begin() + k, 0) == 0);
int m = 0;
rep(i, k) if (abs_sort[i] < 0) m++;
if (m % 2 == 0) {
mint ans = 1;
rep(i, k) ans *= abs_sort[i];
cout << ans << endl;
ret();
}
int first_m_i = [&] {
rep(i, n) {
if (i < k)
continue;
if (abs_sort[i] < 0)
return i;
}
return -1;
}();
int last_m_i = [&] {
int ans = -1;
rep(i, k) {
if (abs_sort[i] < 0)
ans = i;
}
assert(ans > -1);
return ans;
}();
int first_p_i = [&] {
rep(i, n) {
if (i < k)
continue;
if (abs_sort[i] > 0)
return i;
}
return -1;
}();
int last_p_i = [&] {
int ans = -1;
rep(i, k) {
if (abs_sort[i] > 0)
ans = i;
}
return ans;
}();
if (first_p_i == -1) {
mint ans = 1;
rep(i, k) if (i != last_p_i) ans *= abs_sort[i];
ans *= abs_sort[first_m_i];
cout << ans << endl;
ret();
}
if (first_m_i == -1 || last_p_i == -1) {
mint ans = 1;
rep(i, k) if (i != last_m_i) ans *= abs_sort[i];
ans *= abs_sort[first_p_i];
cout << ans << endl;
ret();
}
if (abs(abs_sort[first_p_i] * abs_sort[last_p_i]) >
abs(abs_sort[first_m_i] * abs_sort[last_m_i])) {
mint ans = 1;
rep(i, k) if (i != last_m_i) ans *= abs_sort[i];
ans *= abs_sort[first_p_i];
cout << ans << endl;
} else {
mint ans = 1;
rep(i, k) if (i != last_p_i) ans *= abs_sort[i];
ans *= abs_sort[first_m_i];
cout << ans << endl;
}
ret();
}
if (zero > 0) {
cout << 0 << endl;
ret();
}
vector<ll> abs_sort = v;
sort(abs_sort.begin(), abs_sort.end(),
[](ll a, ll b) { return abs(a) < abs(b); });
mint ans = 1;
rep(i, k) ans *= abs_sort[i];
cout << ans << endl;
}
| #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) { return fabs(a - b) < DBL_EPSILON; }
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
// ofstream outfile("log.txt");
// outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0')
// << rank << endl;
// std::cout << std::bitset<8>(9);
// const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQ_ASK;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
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 std::istream &operator>>(std::istream &in, mint &o) {
ll a;
in >> a;
o = a;
return in;
}
friend std::ostream &operator<<(std::ostream &out, const mint &o) {
out << o.x;
return out;
}
};
int main() {
// ifstream cin("C:\\Users\\riku\\Downloads\\random_pm00.txt");
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
vector<ll> plus, minus;
int zero = 0;
for (ll l : v) {
if (l > 0)
plus.push_back(l);
else if (l < 0)
minus.push_back(l);
else
zero++;
}
sort(plus.rbegin(), plus.rend());
sort(minus.rbegin(), minus.rend());
if ((n - zero) < k) {
cout << 0 << endl;
ret();
}
// 必ずプラス
int mim = max<ll>(k - plus.size(), 0);
if (mim % 2 == 0 || (plus.size() > 0 && minus.size() - mim > 0)) {
vector<ll> abs_sort = v;
sort(abs_sort.rbegin(), abs_sort.rend(),
[](ll a, ll b) { return abs(a) < abs(b); });
assert(count(abs_sort.begin(), abs_sort.begin() + k, 0) == 0);
int m = 0;
rep(i, k) if (abs_sort[i] < 0) m++;
if (m % 2 == 0) {
mint ans = 1;
rep(i, k) ans *= abs_sort[i];
cout << ans << endl;
ret();
}
int first_m_i = [&] {
rep(i, n) {
if (i < k)
continue;
if (abs_sort[i] < 0)
return i;
}
return -1;
}();
int last_m_i = [&] {
int ans = -1;
rep(i, k) {
if (abs_sort[i] < 0)
ans = i;
}
assert(ans > -1);
return ans;
}();
int first_p_i = [&] {
rep(i, n) {
if (i < k)
continue;
if (abs_sort[i] > 0)
return i;
}
return -1;
}();
int last_p_i = [&] {
int ans = -1;
rep(i, k) {
if (abs_sort[i] > 0)
ans = i;
}
return ans;
}();
if (first_p_i == -1) {
mint ans = 1;
rep(i, k) if (i != last_p_i) ans *= abs_sort[i];
ans *= abs_sort[first_m_i];
cout << ans << endl;
ret();
}
if (first_m_i == -1 || last_p_i == -1) {
mint ans = 1;
rep(i, k) if (i != last_m_i) ans *= abs_sort[i];
ans *= abs_sort[first_p_i];
cout << ans << endl;
ret();
}
if (abs(abs_sort[first_p_i] * abs_sort[last_p_i]) >
abs(abs_sort[first_m_i] * abs_sort[last_m_i])) {
mint ans = 1;
rep(i, k) if (i != last_m_i) ans *= abs_sort[i];
ans *= abs_sort[first_p_i];
cout << ans << endl;
} else {
mint ans = 1;
rep(i, k) if (i != last_p_i) ans *= abs_sort[i];
ans *= abs_sort[first_m_i];
cout << ans << endl;
}
ret();
}
if (zero > 0) {
cout << 0 << endl;
ret();
}
vector<ll> abs_sort = v;
sort(abs_sort.begin(), abs_sort.end(),
[](ll a, ll b) { return abs(a) < abs(b); });
mint ans = 1;
rep(i, k) ans *= abs_sort[i];
cout << ans << endl;
}
| replace | 116 | 117 | 116 | 117 | -11 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri, x, n) for (int ri = (int)(n - 1); ri >= (int)(x); ri--)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
const ll mod = 1000000007;
ll fc(vector<pair<ll, bool>> &all, int k, int nouseindex, int add) {
int n = all.size();
ll ret = 1;
rrep2(i, n - k, n) {
if (i == nouseindex)
continue;
ret *= all.at(i).first;
ret %= mod;
}
ret *= add;
ret %= mod;
return ret;
}
int main() {
int n, k;
cin >> n >> k;
vector<ll> plv, miv;
vector<pair<ll, bool>> all;
int pl = 0, mi = 0;
rep(i, n) {
ll in;
cin >> in;
if (in >= 0) {
all.push_back({in, true});
pl++;
} else {
miv.push_back(in * -1);
all.push_back({in * -1, false});
mi++;
}
}
sort(miv.begin(), miv.end());
sort(all.begin(), all.end());
if (k % 2 == 1 && pl == 0) { // 必ず負
ll ans = 1;
rep(i, k) {
ans *= miv.at(i);
ans %= mod;
}
ans = mod - ans;
ans %= mod;
cout << ans << endl;
return 0;
}
ll ans = 1;
pl = 0, mi = 0;
int mindex = -1, pindex = -1;
rrep2(i, n - k, n) {
ans *= all.at(i).first;
ans %= mod;
if (all.at(i).second == true) {
pl++;
pindex = i;
} else {
mi++;
mindex = i;
}
}
if (mi % 2 == 0 || n == k) {
if (mi % 2 == 1) {
ans = mod - ans;
ans %= mod;
}
cout << ans << endl;
return 0;
}
int smindex = -1, spindex = -1;
rrep(i, n - k) {
if (smindex == -1 && all.at(i).second == false)
smindex = i;
if (spindex == -1 && all.at(i).second == true)
spindex = i;
}
if ((smindex == -1) ||
(spindex != -1 && all.at(pindex).first * all.at(spindex).first >
all.at(mindex).first * all.at(smindex).first)) {
ans = fc(all, k, mindex, all.at(spindex).first);
} else {
ans = fc(all, k, pindex, all.at(smindex).first);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri, x, n) for (int ri = (int)(n - 1); ri >= (int)(x); ri--)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
const ll mod = 1000000007;
ll fc(vector<pair<ll, bool>> &all, int k, int nouseindex, int add) {
int n = all.size();
ll ret = 1;
rrep2(i, n - k, n) {
if (i == nouseindex)
continue;
ret *= all.at(i).first;
ret %= mod;
}
ret *= add;
ret %= mod;
return ret;
}
int main() {
int n, k;
cin >> n >> k;
vector<ll> plv, miv;
vector<pair<ll, bool>> all;
int pl = 0, mi = 0;
rep(i, n) {
ll in;
cin >> in;
if (in >= 0) {
all.push_back({in, true});
pl++;
} else {
miv.push_back(in * -1);
all.push_back({in * -1, false});
mi++;
}
}
sort(miv.begin(), miv.end());
sort(all.begin(), all.end());
if (k % 2 == 1 && pl == 0) { // 必ず負
ll ans = 1;
rep(i, k) {
ans *= miv.at(i);
ans %= mod;
}
ans = mod - ans;
ans %= mod;
cout << ans << endl;
return 0;
}
ll ans = 1;
pl = 0, mi = 0;
int mindex = -1, pindex = -1;
rrep2(i, n - k, n) {
ans *= all.at(i).first;
ans %= mod;
if (all.at(i).second == true) {
pl++;
pindex = i;
} else {
mi++;
mindex = i;
}
}
if (mi % 2 == 0 || n == k) {
if (mi % 2 == 1) {
ans = mod - ans;
ans %= mod;
}
cout << ans << endl;
return 0;
}
int smindex = -1, spindex = -1;
rrep(i, n - k) {
if (smindex == -1 && all.at(i).second == false)
smindex = i;
if (spindex == -1 && all.at(i).second == true)
spindex = i;
}
if ((smindex == -1) || (pindex == -1) ||
(spindex != -1 && all.at(pindex).first * all.at(spindex).first >
all.at(mindex).first * all.at(smindex).first)) {
ans = fc(all, k, mindex, all.at(spindex).first);
} else {
ans = fc(all, k, pindex, all.at(smindex).first);
}
cout << ans << endl;
return 0;
} | replace | 87 | 88 | 87 | 88 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#include <cstring>
#include <iostream>
#define pie acos(-1)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d %d", &a, &b)
#define siii(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sl(a) scanf("%lld", &a)
#define sll(a, b) scanf("%lld %lld", &a, &b)
#define slll(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define ss(st) scanf("%s", st)
#define sch(ch) scanf("%ch", &ch)
#define ps(a) printf("%s", a)
#define newLine() printf("\n")
#define pi(a) printf("%d", a)
#define pii(a, b) printf("%d %d", a, b)
#define piii(a, b, c) printf("%d %d %d", a, b, c)
#define pl(a) printf("%lld", a)
#define pll(a, b) printf("%lld %lld", a, b)
#define plll(a, b, c) printf("%lld %lld %lld", a, b, c)
#define pd(a) printf("%lf", a)
#define pdd(a, b) printf("%lf %lf", a, b)
#define pddd(a, b, c) printf("%lf %lf %lf", a, b, c)
#define pch(c) printf("%ch", c)
#define debug1(str, a) printf("%s=%d\n", str, a)
#define debug2(str1, str2, a, b) printf("%s=%d %s=%d\n", str1, a, str2, b)
#define debug3(str1, str2, str3, a, b, c) \
printf("%s=%d %s=%d %s=%d\n", str1, a, str2, b, str3, c)
#define debug4(str1, str2, str3, str4, a, b, c, d) \
printf("%s=%d %s=%d %s=%d %s=%d\n", str1, a, str2, b, str3, c, str4, d)
#define for0(i, n) for (i = 0; i < n; i++)
#define for1(i, n) for (i = 1; i <= n; i++)
#define forab(i, a, b) for (i = a; i <= b; i++)
#define forstl(i, s) \
for (__typeof((s).end()) i = (s).begin(); i != (s).end(); ++i)
#define nl puts("")
#define sd(a) scanf("%lf", &a)
#define sdd(a, b) scanf("%lf %lf", &a, &b)
#define sddd(a, b, c) scanf("%lf %lf %lf", &a, &b, &c)
#define sp printf(" ")
#define ll long long int
#define ull unsigned long long int
#define MOD 1000000007
#define mpr make_pair
#define pub(x) push_back(x)
#define pob(x) pop_back(x)
#define mem(ara, value) memset(ara, value, sizeof(ara))
#define INF INT_MAX
#define eps 1e-9
#define checkbit(n, pos) (n & (1 << pos))
#define setbit(n, pos) (n(1 << pos))
#define para(i, a, b, ara) \
for (i = a; i <= b; i++) { \
if (i != 0) { \
printf(" "); \
} \
cout << ara[i]; \
} \
printf("\n");
#define pvec(i, vec) \
for (i = 0; i < vec.size(); i++) { \
if (i != 0) { \
printf(" "); \
} \
cout << vec[i]; \
} \
printf("\n");
#define ppara(i, j, n, m, ara) \
for (i = 0; i < n; i++) { \
for (j = 0; j < m; j++) { \
if (j != 0) { \
printf(" "); \
} \
cout << ara[i][j]; \
} \
printf("\n"); \
}
#define ppstructara(i, j, n, m, ara) \
for (i = 0; i < n; i++) { \
printf("%d:\n", i); \
for (j = 0; j < m; j++) { \
cout << ara[i][j]; \
printf("\n"); \
} \
}
#define ppvec(i, j, n, vec) \
for (i = 0; i < n; i++) { \
printf("%d:", i); \
for (j = 0; j < vec[i].size(); j++) { \
if (j != 0) { \
printf(" "); \
} \
cout << vec[i][j]; \
} \
printf("\n"); \
}
#define ppstructvec(i, j, n, vec) \
for (i = 0; i < n; i++) { \
printf("%d:", i); \
for (j = 0; j < vec[i].size(); j++) { \
cout << vec[i][j]; \
printf("\n"); \
} \
}
#define sara(i, a, b, ara) \
for (i = a; i <= b; i++) { \
scanf("%d", &ara[i]); \
}
#define pstructara(i, a, b, ara) \
for (i = a; i <= b; i++) { \
cout << ara[i]; \
nl; \
}
#define pstructvec(i, vec) \
for (i = 0; i < vec.size(); i++) { \
cout << vec[i]; \
nl; \
}
#define pstructstl(stl, x) \
for (__typeof(stl.begin()) it = stl.begin(); it != stl.end(); ++it) { \
x = *it; \
cout << x; \
nl; \
} \
nl;
#define pstl(stl) \
for (__typeof(stl.begin()) it = stl.begin(); it != stl.end(); ++it) { \
if (it != stl.begin()) { \
sp; \
} \
pi(*it); \
} \
nl;
#define ppairvec(i, vec) \
for (i = 0; i < vec.size(); i++) { \
cout << vec[i].first; \
sp; \
cout << vec[i].second; \
printf("\n"); \
}
#define ppairara(i, a, b, ara) \
for (i = a; i <= b; i++) { \
cout << ara[i].first; \
sp; \
cout << ara[i].second; \
printf("\n"); \
}
#define pppairvec(i, j, n, vec) \
for (i = 0; i < n; i++) { \
printf("%d:\n", i); \
for (j = 0; j < vec[i].size(); j++) { \
cout << vec[i][j].first; \
sp; \
cout << vec[i][j].second; \
nl; \
} \
}
#define pppairara(i, j, n, m, ara) \
for (i = 0; i < n; i++) { \
printf("%d:\n", i); \
for (j = 0; j < m; j++) { \
cout << ara[i][j].first; \
printf(" "); \
cout << ara[i][j].second; \
nl; \
} \
}
#define SZ 2 * 100010
#define xx first
#define yy second
using namespace std;
// using namespace __gnu_pbds;
// bool status[100010];
// vector <int> prime;
// void siv(){
// int N = 100005, i, j; prime.clear();
// int sq = sqrt(N);
// for(i = 4; i <= N; i += 2){ status[i] = true; }
// for(i = 3; i <= sq; i+= 2){
// if(status[i] == false){
// for(j = i * i; j <= N; j += i){ status[j] = true; }
// }
// }
// status[1] = true;
// for1(i, N){ if(!status[i]){ prime.pub(i); } }
// }
// mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
// auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
// std::mt19937 mt(seed);
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int add(int _a, int _b) {
if (_a < 0) {
_a += MOD;
}
if (_b < 0) {
_b += MOD;
}
if (_a + _b >= MOD) {
return _a + _b - MOD;
}
return _a + _b;
}
inline int mul(int _a, int _b) {
if (_a < 0) {
_a += MOD;
}
if (_b < 0) {
_b += MOD;
}
return ((ll)((ll)_a * (ll)_b)) % MOD;
}
const int N = 2e5;
int n, ara[N + 5], k;
void solve() {
int i, j, ans = 1;
vector<pair<int, int>> vec;
for (i = 0; i < n; ++i) {
if (ara[i] > 0)
vec.push_back(mpr(ara[i], +1));
else
vec.push_back(mpr(-ara[i], -1));
}
sort(vec.begin(), vec.end());
if (vec.size() >= k) {
reverse(vec.begin(), vec.end());
int neg = 0;
for (i = 0; i < k; ++i)
neg += (vec[i].yy == -1);
if (neg % 2 == 0) {
ans = 1;
for (i = 0; i < k; ++i)
ans = mul(ans, vec[i].xx);
pi(ans), nl;
return;
} else {
int a = -1, b = -1;
for (i = 0; i < k; ++i) {
if (vec[i].yy == +1)
a = i;
if (vec[i].yy == -1)
b = i;
}
int c = -1, d = -1;
for (i = (int)vec.size() - 1; i >= k; ++i) {
if (vec[i].yy == +1)
c = i;
if (vec[i].yy == -1)
d = i;
}
if (a >= 0 && b >= 0 && c >= 0 && d >= 0) {
// d / a >= c / b
if ((ll)vec[b].xx * vec[d].xx >= (ll)vec[a].xx * vec[c].xx) {
ans = 1;
for (i = 0; i < k; ++i) {
if (i == a)
continue;
ans = mul(ans, vec[i].xx);
}
ans = mul(ans, vec[d].xx);
pi(ans), nl;
return;
} else {
ans = 1;
for (i = 0; i < k; ++i) {
if (i == b)
continue;
ans = mul(ans, vec[i].xx);
}
ans = mul(ans, vec[c].xx);
pi(ans), nl;
return;
}
} else if (a >= 0 && d >= 0) {
ans = 1;
for (i = 0; i < k; ++i) {
if (i == a)
continue;
ans = mul(ans, vec[i].xx);
}
ans = mul(ans, vec[d].xx);
pi(ans), nl;
return;
} else if (b >= 0 && c >= 0) {
ans = 1;
for (i = 0; i < k; ++i) {
if (i == b)
continue;
ans = mul(ans, vec[i].xx);
}
ans = mul(ans, vec[c].xx);
pi(ans), nl;
return;
} else {
for (i = 0; i < n; ++i) {
if (ara[i] == 0) {
pi(0), nl;
return;
}
}
reverse(vec.begin(), vec.end());
ans = 1;
for (i = 0; i < k; ++i) {
ans = mul(ans, mul(vec[i].xx, vec[i].yy));
}
pi(ans), nl;
return;
}
}
}
pi(0), nl;
return;
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt", "w", stdout);
int i, j;
sii(n, k);
for0(i, n) si(ara[i]);
solve();
}
| #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#include <cstring>
#include <iostream>
#define pie acos(-1)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d %d", &a, &b)
#define siii(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sl(a) scanf("%lld", &a)
#define sll(a, b) scanf("%lld %lld", &a, &b)
#define slll(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define ss(st) scanf("%s", st)
#define sch(ch) scanf("%ch", &ch)
#define ps(a) printf("%s", a)
#define newLine() printf("\n")
#define pi(a) printf("%d", a)
#define pii(a, b) printf("%d %d", a, b)
#define piii(a, b, c) printf("%d %d %d", a, b, c)
#define pl(a) printf("%lld", a)
#define pll(a, b) printf("%lld %lld", a, b)
#define plll(a, b, c) printf("%lld %lld %lld", a, b, c)
#define pd(a) printf("%lf", a)
#define pdd(a, b) printf("%lf %lf", a, b)
#define pddd(a, b, c) printf("%lf %lf %lf", a, b, c)
#define pch(c) printf("%ch", c)
#define debug1(str, a) printf("%s=%d\n", str, a)
#define debug2(str1, str2, a, b) printf("%s=%d %s=%d\n", str1, a, str2, b)
#define debug3(str1, str2, str3, a, b, c) \
printf("%s=%d %s=%d %s=%d\n", str1, a, str2, b, str3, c)
#define debug4(str1, str2, str3, str4, a, b, c, d) \
printf("%s=%d %s=%d %s=%d %s=%d\n", str1, a, str2, b, str3, c, str4, d)
#define for0(i, n) for (i = 0; i < n; i++)
#define for1(i, n) for (i = 1; i <= n; i++)
#define forab(i, a, b) for (i = a; i <= b; i++)
#define forstl(i, s) \
for (__typeof((s).end()) i = (s).begin(); i != (s).end(); ++i)
#define nl puts("")
#define sd(a) scanf("%lf", &a)
#define sdd(a, b) scanf("%lf %lf", &a, &b)
#define sddd(a, b, c) scanf("%lf %lf %lf", &a, &b, &c)
#define sp printf(" ")
#define ll long long int
#define ull unsigned long long int
#define MOD 1000000007
#define mpr make_pair
#define pub(x) push_back(x)
#define pob(x) pop_back(x)
#define mem(ara, value) memset(ara, value, sizeof(ara))
#define INF INT_MAX
#define eps 1e-9
#define checkbit(n, pos) (n & (1 << pos))
#define setbit(n, pos) (n(1 << pos))
#define para(i, a, b, ara) \
for (i = a; i <= b; i++) { \
if (i != 0) { \
printf(" "); \
} \
cout << ara[i]; \
} \
printf("\n");
#define pvec(i, vec) \
for (i = 0; i < vec.size(); i++) { \
if (i != 0) { \
printf(" "); \
} \
cout << vec[i]; \
} \
printf("\n");
#define ppara(i, j, n, m, ara) \
for (i = 0; i < n; i++) { \
for (j = 0; j < m; j++) { \
if (j != 0) { \
printf(" "); \
} \
cout << ara[i][j]; \
} \
printf("\n"); \
}
#define ppstructara(i, j, n, m, ara) \
for (i = 0; i < n; i++) { \
printf("%d:\n", i); \
for (j = 0; j < m; j++) { \
cout << ara[i][j]; \
printf("\n"); \
} \
}
#define ppvec(i, j, n, vec) \
for (i = 0; i < n; i++) { \
printf("%d:", i); \
for (j = 0; j < vec[i].size(); j++) { \
if (j != 0) { \
printf(" "); \
} \
cout << vec[i][j]; \
} \
printf("\n"); \
}
#define ppstructvec(i, j, n, vec) \
for (i = 0; i < n; i++) { \
printf("%d:", i); \
for (j = 0; j < vec[i].size(); j++) { \
cout << vec[i][j]; \
printf("\n"); \
} \
}
#define sara(i, a, b, ara) \
for (i = a; i <= b; i++) { \
scanf("%d", &ara[i]); \
}
#define pstructara(i, a, b, ara) \
for (i = a; i <= b; i++) { \
cout << ara[i]; \
nl; \
}
#define pstructvec(i, vec) \
for (i = 0; i < vec.size(); i++) { \
cout << vec[i]; \
nl; \
}
#define pstructstl(stl, x) \
for (__typeof(stl.begin()) it = stl.begin(); it != stl.end(); ++it) { \
x = *it; \
cout << x; \
nl; \
} \
nl;
#define pstl(stl) \
for (__typeof(stl.begin()) it = stl.begin(); it != stl.end(); ++it) { \
if (it != stl.begin()) { \
sp; \
} \
pi(*it); \
} \
nl;
#define ppairvec(i, vec) \
for (i = 0; i < vec.size(); i++) { \
cout << vec[i].first; \
sp; \
cout << vec[i].second; \
printf("\n"); \
}
#define ppairara(i, a, b, ara) \
for (i = a; i <= b; i++) { \
cout << ara[i].first; \
sp; \
cout << ara[i].second; \
printf("\n"); \
}
#define pppairvec(i, j, n, vec) \
for (i = 0; i < n; i++) { \
printf("%d:\n", i); \
for (j = 0; j < vec[i].size(); j++) { \
cout << vec[i][j].first; \
sp; \
cout << vec[i][j].second; \
nl; \
} \
}
#define pppairara(i, j, n, m, ara) \
for (i = 0; i < n; i++) { \
printf("%d:\n", i); \
for (j = 0; j < m; j++) { \
cout << ara[i][j].first; \
printf(" "); \
cout << ara[i][j].second; \
nl; \
} \
}
#define SZ 2 * 100010
#define xx first
#define yy second
using namespace std;
// using namespace __gnu_pbds;
// bool status[100010];
// vector <int> prime;
// void siv(){
// int N = 100005, i, j; prime.clear();
// int sq = sqrt(N);
// for(i = 4; i <= N; i += 2){ status[i] = true; }
// for(i = 3; i <= sq; i+= 2){
// if(status[i] == false){
// for(j = i * i; j <= N; j += i){ status[j] = true; }
// }
// }
// status[1] = true;
// for1(i, N){ if(!status[i]){ prime.pub(i); } }
// }
// mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
// auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
// std::mt19937 mt(seed);
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int add(int _a, int _b) {
if (_a < 0) {
_a += MOD;
}
if (_b < 0) {
_b += MOD;
}
if (_a + _b >= MOD) {
return _a + _b - MOD;
}
return _a + _b;
}
inline int mul(int _a, int _b) {
if (_a < 0) {
_a += MOD;
}
if (_b < 0) {
_b += MOD;
}
return ((ll)((ll)_a * (ll)_b)) % MOD;
}
const int N = 2e5;
int n, ara[N + 5], k;
void solve() {
int i, j, ans = 1;
vector<pair<int, int>> vec;
for (i = 0; i < n; ++i) {
if (ara[i] > 0)
vec.push_back(mpr(ara[i], +1));
else
vec.push_back(mpr(-ara[i], -1));
}
sort(vec.begin(), vec.end());
if (vec.size() >= k) {
reverse(vec.begin(), vec.end());
int neg = 0;
for (i = 0; i < k; ++i)
neg += (vec[i].yy == -1);
if (neg % 2 == 0) {
ans = 1;
for (i = 0; i < k; ++i)
ans = mul(ans, vec[i].xx);
pi(ans), nl;
return;
} else {
int a = -1, b = -1;
for (i = 0; i < k; ++i) {
if (vec[i].yy == +1)
a = i;
if (vec[i].yy == -1)
b = i;
}
int c = -1, d = -1;
for (i = (int)vec.size() - 1; i >= k; --i) {
if (vec[i].yy == +1)
c = i;
if (vec[i].yy == -1)
d = i;
}
if (a >= 0 && b >= 0 && c >= 0 && d >= 0) {
// d / a >= c / b
if ((ll)vec[b].xx * vec[d].xx >= (ll)vec[a].xx * vec[c].xx) {
ans = 1;
for (i = 0; i < k; ++i) {
if (i == a)
continue;
ans = mul(ans, vec[i].xx);
}
ans = mul(ans, vec[d].xx);
pi(ans), nl;
return;
} else {
ans = 1;
for (i = 0; i < k; ++i) {
if (i == b)
continue;
ans = mul(ans, vec[i].xx);
}
ans = mul(ans, vec[c].xx);
pi(ans), nl;
return;
}
} else if (a >= 0 && d >= 0) {
ans = 1;
for (i = 0; i < k; ++i) {
if (i == a)
continue;
ans = mul(ans, vec[i].xx);
}
ans = mul(ans, vec[d].xx);
pi(ans), nl;
return;
} else if (b >= 0 && c >= 0) {
ans = 1;
for (i = 0; i < k; ++i) {
if (i == b)
continue;
ans = mul(ans, vec[i].xx);
}
ans = mul(ans, vec[c].xx);
pi(ans), nl;
return;
} else {
for (i = 0; i < n; ++i) {
if (ara[i] == 0) {
pi(0), nl;
return;
}
}
reverse(vec.begin(), vec.end());
ans = 1;
for (i = 0; i < k; ++i) {
ans = mul(ans, mul(vec[i].xx, vec[i].yy));
}
pi(ans), nl;
return;
}
}
}
pi(0), nl;
return;
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt", "w", stdout);
int i, j;
sii(n, k);
for0(i, n) si(ara[i]);
solve();
}
| replace | 245 | 246 | 245 | 246 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
#define rep(i, n) \
for (int_fast32_t i = 0; i < ((int_fast32_t)(n)); i++) // 0-indexed up
#define rep1(i, n) \
for (int_fast32_t i = 1; i <= ((int_fast32_t)(n)); i++) // 1-indexed up
#define rrep(i, n) \
for (int_fast32_t i = ((int_fast32_t)(n)-1); i >= 0; i--) // 0-indexed down
#define rrep1(i, n) \
for (int_fast32_t i = ((int_fast32_t)(n)); i >= 1; i--) // 1-indexed down
#define all(x) (x).begin(), (x).end()
using namespace std;
template <typename T> using vec = vector<T>;
using i32 = int_fast32_t;
using i64 = int_fast64_t;
using u32 = uint_fast32_t;
using u64 = uint_fast64_t;
using ll = long long;
using ld = long double;
using vi = vec<int_fast32_t>;
using vl = vec<int_fast64_t>;
using vld = vec<ld>;
using vii = vec<vi>;
using PII = pair<int_fast32_t, int_fast32_t>;
template <class T> using maxheap = std::priority_queue<T>;
template <class T>
using minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T, class U> inline bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ld Pi = std::acos(-1.0L);
constexpr ll infll = (1LL << 62) - 1;
constexpr int inf = (1 << 30) - 1;
const int mod = 1000000007;
// const int mod = 998244353;
/*MOD int=============================*/
template <std::int_fast64_t Mod> class modint {
public:
using i64 = std::int_fast64_t;
i64 val;
// constructor
constexpr modint(const i64 p = 0) noexcept
: val(p >= 0 ? p % Mod : (Mod + (p % Mod)) % Mod) {}
// std::cin, std::cout
friend std::ostream &operator<<(std::ostream &os, const modint &x) {
return os << x.val;
}
friend std::istream &operator>>(std::istream &is, modint &x) {
is >> x.val;
x.val %= Mod;
if (x.val < 0)
x.val += Mod; // <- 負数対応
return is;
}
// operator
constexpr modint operator+(const modint b) const noexcept {
return modint(*this) += b;
}
constexpr modint operator-(const modint b) const noexcept {
return modint(*this) -= b;
}
constexpr modint operator*(const modint b) const noexcept {
return modint(*this) *= b;
}
constexpr modint operator/(const modint b) const noexcept {
return modint(*this) /= b;
}
constexpr modint operator-() const noexcept { return modint() - *this; }
constexpr bool operator==(const modint &b) const noexcept {
return this->val == b.val;
}
constexpr bool operator!=(const modint &b) const noexcept {
return this->val != b.val;
}
constexpr modint &operator=(const modint b) noexcept {
val = b.val;
return *this;
}
constexpr modint &operator=(const i64 b) noexcept {
val = modint<Mod>(b).val;
return *this;
}
constexpr modint &operator+=(const modint b) noexcept {
if ((val += b.val) >= Mod)
val -= Mod;
return *this;
}
constexpr modint &operator-=(const modint b) noexcept {
if (val < b.val)
val += Mod;
val -= b.val;
return *this;
}
constexpr modint &operator*=(const modint b) noexcept {
val = val * b.val % Mod;
return *this;
}
constexpr modint &operator/=(modint b) noexcept {
val *= b.inverse().val;
val %= Mod;
return *this;
}
constexpr modint inverse() noexcept {
i64 m = Mod, u = 1, v = 0, t = 1;
while (m) {
t = val / m;
val -= t * m;
std::swap(val, m);
u -= t * v;
std::swap(u, v);
}
return modint(u);
}
// calc val^n
constexpr modint pow(i64 n) noexcept {
modint res = 1, a = val;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
};
using mint = modint<mod>;
/*Binomial=============================================*/
class Binomial {
private:
const int MAX;
const int MOD;
std::vector<long long> fac, finv, inv;
public:
Binomial(int MAX = 510000, int MOD = 1000000007) : MAX(MAX), MOD(MOD) {
fac.resize(MAX);
finv.resize(MAX);
inv.resize(MAX);
// Build'Binomial-table'
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 % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long calc(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;
}
};
/*FUNCs=================================================*/
/*MAIN==================================================*/
signed main() {
double START_TIME = clock();
cin.tie(nullptr);
ios::sync_with_stdio(false);
// cout << fixed << setprecision(15);
// n == k => 全部選ぶ
// all Ai < 0 => 小さい方から選ぶ
// その他
// 非負整数p1をいれるか負数m1, m2を入れるかを
// p1*p2 m1*m2を比較して決める
// ...fin
i32 n, k;
cin >> n >> k;
if (n == k) {
mint ans = 1, tmp;
rep(i, n) {
cin >> tmp;
ans *= tmp;
}
cout << ans << '\n';
return 0;
}
maxheap<i64> p;
minheap<i64> m;
rep(i, n) {
i32 tmp;
cin >> tmp;
if (tmp >= 0)
p.push(tmp);
else
m.push(tmp);
}
if (p.empty() && k & 1) {
mint ans = 1;
while (m.size() > k)
m.pop();
while (k--) {
ans *= m.top();
m.pop();
}
cout << ans << '\n';
return 0;
}
mint ans = 1;
while (k > 0) {
if (k == 1) {
ans *= p.top();
--k;
} else if (m.size() > 1) {
i64 mi_1 = m.top();
m.pop();
i64 mi_2 = m.top();
m.pop();
i64 pl = p.top();
p.pop();
if (mi_1 * mi_2 > pl * (p.empty() ? 1 : p.top())) {
ans *= mi_1 * mi_2;
k -= 2;
p.push(pl);
} else {
ans *= pl;
--k;
m.push(mi_1);
m.push(mi_2);
}
} else {
ans *= p.top();
p.pop();
--k;
}
}
cout << ans << '\n';
// printf("ElapsedTime: %5.3f
// ms\n",1000*((clock()-START_TIME)/CLOCKS_PER_SEC));
}
| #include <bits/stdc++.h>
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
#define rep(i, n) \
for (int_fast32_t i = 0; i < ((int_fast32_t)(n)); i++) // 0-indexed up
#define rep1(i, n) \
for (int_fast32_t i = 1; i <= ((int_fast32_t)(n)); i++) // 1-indexed up
#define rrep(i, n) \
for (int_fast32_t i = ((int_fast32_t)(n)-1); i >= 0; i--) // 0-indexed down
#define rrep1(i, n) \
for (int_fast32_t i = ((int_fast32_t)(n)); i >= 1; i--) // 1-indexed down
#define all(x) (x).begin(), (x).end()
using namespace std;
template <typename T> using vec = vector<T>;
using i32 = int_fast32_t;
using i64 = int_fast64_t;
using u32 = uint_fast32_t;
using u64 = uint_fast64_t;
using ll = long long;
using ld = long double;
using vi = vec<int_fast32_t>;
using vl = vec<int_fast64_t>;
using vld = vec<ld>;
using vii = vec<vi>;
using PII = pair<int_fast32_t, int_fast32_t>;
template <class T> using maxheap = std::priority_queue<T>;
template <class T>
using minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T, class U> inline bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ld Pi = std::acos(-1.0L);
constexpr ll infll = (1LL << 62) - 1;
constexpr int inf = (1 << 30) - 1;
const int mod = 1000000007;
// const int mod = 998244353;
/*MOD int=============================*/
template <std::int_fast64_t Mod> class modint {
public:
using i64 = std::int_fast64_t;
i64 val;
// constructor
constexpr modint(const i64 p = 0) noexcept
: val(p >= 0 ? p % Mod : (Mod + (p % Mod)) % Mod) {}
// std::cin, std::cout
friend std::ostream &operator<<(std::ostream &os, const modint &x) {
return os << x.val;
}
friend std::istream &operator>>(std::istream &is, modint &x) {
is >> x.val;
x.val %= Mod;
if (x.val < 0)
x.val += Mod; // <- 負数対応
return is;
}
// operator
constexpr modint operator+(const modint b) const noexcept {
return modint(*this) += b;
}
constexpr modint operator-(const modint b) const noexcept {
return modint(*this) -= b;
}
constexpr modint operator*(const modint b) const noexcept {
return modint(*this) *= b;
}
constexpr modint operator/(const modint b) const noexcept {
return modint(*this) /= b;
}
constexpr modint operator-() const noexcept { return modint() - *this; }
constexpr bool operator==(const modint &b) const noexcept {
return this->val == b.val;
}
constexpr bool operator!=(const modint &b) const noexcept {
return this->val != b.val;
}
constexpr modint &operator=(const modint b) noexcept {
val = b.val;
return *this;
}
constexpr modint &operator=(const i64 b) noexcept {
val = modint<Mod>(b).val;
return *this;
}
constexpr modint &operator+=(const modint b) noexcept {
if ((val += b.val) >= Mod)
val -= Mod;
return *this;
}
constexpr modint &operator-=(const modint b) noexcept {
if (val < b.val)
val += Mod;
val -= b.val;
return *this;
}
constexpr modint &operator*=(const modint b) noexcept {
val = val * b.val % Mod;
return *this;
}
constexpr modint &operator/=(modint b) noexcept {
val *= b.inverse().val;
val %= Mod;
return *this;
}
constexpr modint inverse() noexcept {
i64 m = Mod, u = 1, v = 0, t = 1;
while (m) {
t = val / m;
val -= t * m;
std::swap(val, m);
u -= t * v;
std::swap(u, v);
}
return modint(u);
}
// calc val^n
constexpr modint pow(i64 n) noexcept {
modint res = 1, a = val;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
};
using mint = modint<mod>;
/*Binomial=============================================*/
class Binomial {
private:
const int MAX;
const int MOD;
std::vector<long long> fac, finv, inv;
public:
Binomial(int MAX = 510000, int MOD = 1000000007) : MAX(MAX), MOD(MOD) {
fac.resize(MAX);
finv.resize(MAX);
inv.resize(MAX);
// Build'Binomial-table'
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 % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long calc(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;
}
};
/*FUNCs=================================================*/
/*MAIN==================================================*/
signed main() {
double START_TIME = clock();
cin.tie(nullptr);
ios::sync_with_stdio(false);
// cout << fixed << setprecision(15);
// n == k => 全部選ぶ
// all Ai < 0 => 小さい方から選ぶ
// その他
// 非負整数p1をいれるか負数m1, m2を入れるかを
// p1*p2 m1*m2を比較して決める
// ...fin
i32 n, k;
cin >> n >> k;
if (n == k) {
mint ans = 1, tmp;
rep(i, n) {
cin >> tmp;
ans *= tmp;
}
cout << ans << '\n';
return 0;
}
maxheap<i64> p;
minheap<i64> m;
rep(i, n) {
i32 tmp;
cin >> tmp;
if (tmp >= 0)
p.push(tmp);
else
m.push(tmp);
}
if (p.empty() && k & 1) {
mint ans = 1;
while (m.size() > k)
m.pop();
while (k--) {
ans *= m.top();
m.pop();
}
cout << ans << '\n';
return 0;
} else if (p.empty()) {
mint ans = 1;
while (k--) {
ans *= m.top();
m.pop();
}
cout << ans << '\n';
return 0;
}
mint ans = 1;
while (k > 0) {
if (k == 1) {
ans *= p.top();
--k;
} else if (m.size() > 1) {
i64 mi_1 = m.top();
m.pop();
i64 mi_2 = m.top();
m.pop();
i64 pl = p.top();
p.pop();
if (mi_1 * mi_2 > pl * (p.empty() ? 1 : p.top())) {
ans *= mi_1 * mi_2;
k -= 2;
p.push(pl);
} else {
ans *= pl;
--k;
m.push(mi_1);
m.push(mi_2);
}
} else {
ans *= p.top();
p.pop();
--k;
}
}
cout << ans << '\n';
// printf("ElapsedTime: %5.3f
// ms\n",1000*((clock()-START_TIME)/CLOCKS_PER_SEC));
}
| insert | 232 | 232 | 232 | 240 | 0 | |
p02616 | C++ | Runtime Error | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
static const long long mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
(x += a.x) %= mod;
return *this;
}
mint &operator-=(const mint a) {
(x += mod - a.x) %= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint ret(*this);
return ret += a;
}
mint operator-(const mint a) const {
mint ret(*this);
return ret -= a;
}
mint operator*(const mint a) const {
mint ret(*this);
return ret *= a;
}
mint pow(ll t) const {
if (t == 0)
return mint(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 ret(*this);
return ret /= a;
}
};
int main() {
cout << fixed << setprecision(15);
vll ps, ns;
ll n, k;
cin >> n >> k;
rep(i, n) {
ll a;
cin >> a;
if (a < 0)
ns.push_back(-a);
else
ps.push_back(a);
}
rSort(ns), rSort(ps);
ll np = ps.size(), nn = ns.size();
mint ans = 1;
if (n == k) {
rep(i, np) ans *= ps[i];
rep(i, nn) ans *= mod - ns[i];
cout << ans.x << endl;
return 0;
}
bool minus = np == 0 && (k % 2) == 1;
if (minus) {
rep(i, k) { ans *= mod - ns[nn - 1 - i]; }
cout << ans.x << endl;
return 0;
}
ll kn = (k / 2) * 2;
rep(i, kn) { ans *= ns[i]; }
ll kp = k - kn;
rep(i, kp) { ans *= ps[i]; }
while (true) {
kn -= 2;
kp += 2;
bool br = kn < 0 || kp > np;
if (br)
break;
bool change = ps[kp - 1] * ps[kp - 2] > ns[kn + 1] * ns[kn];
if (change) {
ans /= ns[kn + 1] * ns[kn];
ans *= ps[kp - 1] * ps[kp - 2];
} else {
break;
}
}
cout << ans.x << endl;
return 0;
}
| #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
static const long long mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
(x += a.x) %= mod;
return *this;
}
mint &operator-=(const mint a) {
(x += mod - a.x) %= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint ret(*this);
return ret += a;
}
mint operator-(const mint a) const {
mint ret(*this);
return ret -= a;
}
mint operator*(const mint a) const {
mint ret(*this);
return ret *= a;
}
mint pow(ll t) const {
if (t == 0)
return mint(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 ret(*this);
return ret /= a;
}
};
int main() {
cout << fixed << setprecision(15);
vll ps, ns;
ll n, k;
cin >> n >> k;
rep(i, n) {
ll a;
cin >> a;
if (a < 0)
ns.push_back(-a);
else
ps.push_back(a);
}
rSort(ns), rSort(ps);
ll np = ps.size(), nn = ns.size();
mint ans = 1;
if (n == k) {
rep(i, np) ans *= ps[i];
rep(i, nn) ans *= mod - ns[i];
cout << ans.x << endl;
return 0;
}
bool minus = np == 0 && (k % 2) == 1;
if (minus) {
rep(i, k) { ans *= mod - ns[nn - 1 - i]; }
cout << ans.x << endl;
return 0;
}
ll kn = min((k / 2) * 2, (nn / 2) * 2);
rep(i, kn) { ans *= ns[i]; }
ll kp = k - kn;
rep(i, kp) { ans *= ps[i]; }
while (true) {
kn -= 2;
kp += 2;
bool br = kn < 0 || kp > np;
if (br)
break;
bool change = ps[kp - 1] * ps[kp - 2] > ns[kn + 1] * ns[kn];
if (change) {
ans /= ns[kn + 1] * ns[kn];
ans *= ps[kp - 1] * ps[kp - 2];
} else {
break;
}
}
cout << ans.x << endl;
return 0;
}
| replace | 135 | 136 | 135 | 136 | 0 | |
p02616 | Python | Runtime Error | n, k = map(int, input().split())
a = list(map(int, input().split()))
MOD = 10**9 + 7
plus = []
minus = []
zero = []
for i in range(n):
if a[i] < 0:
minus.append(abs(a[i]))
elif a[i] > 0:
plus.append(a[i])
else:
zero.append(0)
len_p = len(plus)
len_m = len(minus)
len_z = len(zero)
is_z = False
is_p = False
if len_z != 0:
is_z = True
cnt = 2 * (len_m // 2) + len_p
if cnt >= k:
is_p = True
if len_p == 0 and k % 2 == 1:
is_p = False
if is_p:
minus = sorted(minus, reverse=True)
plus = sorted(plus, reverse=True)
ans = 1
if k % 2 == 1:
k -= 1
ans = plus[0]
del plus[0]
tmp = []
for i in range(len(minus) // 2):
tmp.append(minus[2 * i] * minus[2 * i + 1])
for i in range(len(plus) // 2):
tmp.append(plus[2 * i] * plus[2 * i + 1])
tmp = sorted(tmp, reverse=True)
for i in range(k // 2):
ans *= tmp[i]
ans %= MOD
print(ans)
exit()
elif is_z:
print(0)
exit()
else:
minus = sorted(minus)
ans = -1
for i in range(k):
ans *= minus[i]
ans %= MOD
print(ans)
exit()
| n, k = map(int, input().split())
a = list(map(int, input().split()))
MOD = 10**9 + 7
plus = []
minus = []
zero = []
for i in range(n):
if a[i] < 0:
minus.append(abs(a[i]))
elif a[i] > 0:
plus.append(a[i])
else:
zero.append(0)
len_p = len(plus)
len_m = len(minus)
len_z = len(zero)
is_z = False
is_p = False
if len_z != 0:
is_z = True
cnt = 2 * (len_m // 2) + len_p
if cnt >= k:
is_p = True
if len_p == 0 and k % 2 == 1:
is_p = False
if is_p:
minus = sorted(minus, reverse=True)
plus = sorted(plus, reverse=True)
ans = 1
if k % 2 == 1:
k -= 1
ans = plus[0]
del plus[0]
tmp = []
for i in range(len(minus) // 2):
tmp.append(minus[2 * i] * minus[2 * i + 1])
for i in range(len(plus) // 2):
tmp.append(plus[2 * i] * plus[2 * i + 1])
tmp = sorted(tmp, reverse=True)
for i in range(k // 2):
ans *= tmp[i]
ans %= MOD
print(ans)
exit()
elif is_z:
print(0)
exit()
else:
for i in plus:
minus.append(i)
minus = sorted(minus)
ans = -1
for i in range(k):
ans *= minus[i]
ans %= MOD
print(ans)
exit()
| insert | 56 | 56 | 56 | 58 | 0 | |
p02616 | Python | Runtime Error | N, K = map(int, input().split())
A = tuple(map(int, input().split()))
MOD = 10**9 + 7
if K == N:
ans = 1
for x in A:
ans = (ans * x) % MOD
print(ans)
exit()
plus, minus = [], []
for a in A:
if a >= 0:
plus.append(a)
else:
minus.append(a)
plus.sort(reverse=True)
minus.sort()
if not plus:
ans = 1
if K % 2:
# 答えは負値になるので絶対値小さいのを取る
for x in minus[-K:]:
ans = (ans * x) % MOD
else:
# 答えは非負値になるので絶対値大きいのを取る
for x in minus[:K]:
ans = (ans * x) % MOD
print(ans)
exit()
idx = 0
for i in range(2, N, 2):
if not len(plus) >= K - i + 2:
idx += 2
continue
if len(minus) >= i:
if minus[i - 2] * minus[i - 1] < plus[K - i + 1] * plus[K - i]:
break
else:
idx += 2
ans = 1
for x in minus[:idx] + plus[: K - idx]:
ans = (ans * x) % MOD
print(ans)
| N, K = map(int, input().split())
A = tuple(map(int, input().split()))
MOD = 10**9 + 7
if K == N:
ans = 1
for x in A:
ans = (ans * x) % MOD
print(ans)
exit()
plus, minus = [], []
for a in A:
if a >= 0:
plus.append(a)
else:
minus.append(a)
plus.sort(reverse=True)
minus.sort()
if not plus:
ans = 1
if K % 2:
# 答えは負値になるので絶対値小さいのを取る
for x in minus[-K:]:
ans = (ans * x) % MOD
else:
# 答えは非負値になるので絶対値大きいのを取る
for x in minus[:K]:
ans = (ans * x) % MOD
print(ans)
exit()
idx = 0
for i in range(2, N, 2):
if K - i < 0:
break
if not len(plus) >= K - i + 2:
idx += 2
continue
if len(minus) >= i:
if minus[i - 2] * minus[i - 1] < plus[K - i + 1] * plus[K - i]:
break
else:
idx += 2
ans = 1
for x in minus[:idx] + plus[: K - idx]:
ans = (ans * x) % MOD
print(ans)
| insert | 36 | 36 | 36 | 38 | 0 | |
p02616 | Python | Runtime Error | # AFTER EDITORIAL, WIP
def solve(ls, k, debug=0):
modulo = 10**9 + 7
n = len(ls)
n_neg = 0
for i in range(n):
n_neg += ls[i] < 0
n_pos = n - n_neg
# Sort by abs
ls_abs = [abs(x) for x in ls]
ls_abs_argsort = sorted(list(range(n)), key=lambda i: -ls_abs[i])
# Check if positive result is impossible
if n_neg >= k:
positive = (k % 2 == 0) or (n_pos > 0)
else:
positive = (n_neg % 2 == 0) or (n > k)
# If positive is impossible, pick "abs" small ones
if not positive:
p = 1
for i in range(k):
x = ls[ls_abs_argsort[-1 - i]]
p *= x
p %= modulo
return p
#
# If positive is possible, ...
#
# PROP.
# At most one swap is needed for making product non-negative.
# PROOF. TODO
#
# Check sign when we pick "abs" large ones
s = 1
for i in range(k):
x = ls[ls_abs_argsort[i]]
s *= -1 if x < 0 else 1
# If non-negative, we take as it is
if s > 0:
p = 1
for i in range(k):
x = ls[ls_abs_argsort[i]]
p *= x
p %= modulo
return p
# If negative, ...
# 1. replace small negative with large positive, or
# 2. replace small positive with large negative
opt1 = None
opt2 = None
neg1, pos1 = None
pos2, neg2 = None
# Check if "1" is possible
swap_pos = None
for i in range(k, n):
if ls[ls_abs_argsort[i]] >= 0:
swap_pos = i
pos1 = ls[ls_abs_argsort[i]]
break
swap_neg = None
for i in range(k)[::-1]:
if ls[ls_abs_argsort[i]] < 0:
swap_neg = i
neg1 = ls[ls_abs_argsort[i]]
break
if swap_pos is not None and swap_neg is not None:
p = 1
p *= ls[ls_abs_argsort[swap_pos]]
p %= modulo
for i in range(k):
if i == swap_neg:
continue
x = ls[ls_abs_argsort[i]]
p *= x
p %= modulo
opt1 = p
# Check if "2" is possible
swap_pos = None
for i in range(k)[::-1]:
if ls[ls_abs_argsort[i]] >= 0:
swap_pos = i
pos2 = ls[ls_abs_argsort[i]]
break
swap_neg = None
for i in range(k, n):
if ls[ls_abs_argsort[i]] < 0:
swap_neg = i
neg2 = ls[ls_abs_argsort[i]]
break
if swap_pos is not None and swap_neg is not None:
p = 1
p *= ls[ls_abs_argsort[swap_neg]]
p %= modulo
for i in range(k):
if i == swap_pos:
continue
x = ls[ls_abs_argsort[i]]
p *= x
p %= modulo
opt2 = p
# Pick opt1 or opt2
if opt1 is None:
return opt2
if opt2 is None:
return opt1
if pos1 * pos2 > neg1 * neg2:
return opt1
return opt2
def main(istr, ostr):
n, k = list(map(int, istr.readline().strip().split()))
ls = list(map(int, istr.readline().strip().split()))
result = solve(ls, k)
print(result, file=ostr)
if __name__ == "__main__":
import sys
main(sys.stdin, sys.stdout)
| # AFTER EDITORIAL, WIP
def solve(ls, k, debug=0):
modulo = 10**9 + 7
n = len(ls)
n_neg = 0
for i in range(n):
n_neg += ls[i] < 0
n_pos = n - n_neg
# Sort by abs
ls_abs = [abs(x) for x in ls]
ls_abs_argsort = sorted(list(range(n)), key=lambda i: -ls_abs[i])
# Check if positive result is impossible
if n_neg >= k:
positive = (k % 2 == 0) or (n_pos > 0)
else:
positive = (n_neg % 2 == 0) or (n > k)
# If positive is impossible, pick "abs" small ones
if not positive:
p = 1
for i in range(k):
x = ls[ls_abs_argsort[-1 - i]]
p *= x
p %= modulo
return p
#
# If positive is possible, ...
#
# PROP.
# At most one swap is needed for making product non-negative.
# PROOF. TODO
#
# Check sign when we pick "abs" large ones
s = 1
for i in range(k):
x = ls[ls_abs_argsort[i]]
s *= -1 if x < 0 else 1
# If non-negative, we take as it is
if s > 0:
p = 1
for i in range(k):
x = ls[ls_abs_argsort[i]]
p *= x
p %= modulo
return p
# If negative, ...
# 1. replace small negative with large positive, or
# 2. replace small positive with large negative
opt1 = None
opt2 = None
neg1 = pos1 = None
pos2 = neg2 = None
# Check if "1" is possible
swap_pos = None
for i in range(k, n):
if ls[ls_abs_argsort[i]] >= 0:
swap_pos = i
pos1 = ls[ls_abs_argsort[i]]
break
swap_neg = None
for i in range(k)[::-1]:
if ls[ls_abs_argsort[i]] < 0:
swap_neg = i
neg1 = ls[ls_abs_argsort[i]]
break
if swap_pos is not None and swap_neg is not None:
p = 1
p *= ls[ls_abs_argsort[swap_pos]]
p %= modulo
for i in range(k):
if i == swap_neg:
continue
x = ls[ls_abs_argsort[i]]
p *= x
p %= modulo
opt1 = p
# Check if "2" is possible
swap_pos = None
for i in range(k)[::-1]:
if ls[ls_abs_argsort[i]] >= 0:
swap_pos = i
pos2 = ls[ls_abs_argsort[i]]
break
swap_neg = None
for i in range(k, n):
if ls[ls_abs_argsort[i]] < 0:
swap_neg = i
neg2 = ls[ls_abs_argsort[i]]
break
if swap_pos is not None and swap_neg is not None:
p = 1
p *= ls[ls_abs_argsort[swap_neg]]
p %= modulo
for i in range(k):
if i == swap_pos:
continue
x = ls[ls_abs_argsort[i]]
p *= x
p %= modulo
opt2 = p
# Pick opt1 or opt2
if opt1 is None:
return opt2
if opt2 is None:
return opt1
if pos1 * pos2 > neg1 * neg2:
return opt1
return opt2
def main(istr, ostr):
n, k = list(map(int, istr.readline().strip().split()))
ls = list(map(int, istr.readline().strip().split()))
result = solve(ls, k)
print(result, file=ostr)
if __name__ == "__main__":
import sys
main(sys.stdin, sys.stdout)
| replace | 58 | 60 | 58 | 60 | 0 | |
p02616 | Python | Time Limit Exceeded | import sys
import heapq
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10**9 + 7
pos = []
neg = []
for a in A:
if a >= 0:
pos.append(a)
else:
neg.append(a)
flag = False # 積を正にできるか
if N == K:
ans = 1
for a in A:
ans *= a % MOD
print(ans % MOD)
exit()
if len(pos) > 0:
flag = True
else:
if K % 2 == 0:
flag = True
ans = 1
if not flag:
# 積を正にできないとき
# 絶対値の小さい方からK個とる
h = [abs(x) for x in A]
heapq.heapify(h)
for i in range(K):
ans *= heapq.heappop(h)
ans %= MOD
ans *= -1
else:
hpos = [-x for x in pos]
heapq.heapify(hpos)
hneg = neg[:]
heapq.heapify(hneg)
if K % 2 == 1:
# Kが奇数の時
# 一番大きい偶数を1つとる。
ans *= -heapq.heappop(hpos)
ans %= MOD
# pos, neg sort -> 2個ずつペア -> 降順sort -> 上から K//2 個とる
pairs = []
while len(hpos) >= 2:
x = -heapq.heappop(hpos)
x *= -heapq.heappop(hpos)
heapq.heappush(pairs, -x)
while len(hneg) >= 2:
x = heapq.heappop(hneg)
x *= heapq.heappop(hneg)
heapq.heappush(pairs, -x)
if len(pairs):
for i in range(K // 2):
ans *= -heapq.heappop(pairs)
ans %= MOD
print(ans % MOD)
if __name__ == "__main__":
main()
| import sys
import heapq
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10**9 + 7
pos = []
neg = []
for a in A:
if a >= 0:
pos.append(a)
else:
neg.append(a)
flag = False # 積を正にできるか
if N == K:
ans = 1
for a in A:
ans *= a
ans %= MOD
print(ans % MOD)
exit()
if len(pos) > 0:
flag = True
else:
if K % 2 == 0:
flag = True
ans = 1
if not flag:
# 積を正にできないとき
# 絶対値の小さい方からK個とる
h = [abs(x) for x in A]
heapq.heapify(h)
for i in range(K):
ans *= heapq.heappop(h)
ans %= MOD
ans *= -1
else:
hpos = [-x for x in pos]
heapq.heapify(hpos)
hneg = neg[:]
heapq.heapify(hneg)
if K % 2 == 1:
# Kが奇数の時
# 一番大きい偶数を1つとる。
ans *= -heapq.heappop(hpos)
ans %= MOD
# pos, neg sort -> 2個ずつペア -> 降順sort -> 上から K//2 個とる
pairs = []
while len(hpos) >= 2:
x = -heapq.heappop(hpos)
x *= -heapq.heappop(hpos)
heapq.heappush(pairs, -x)
while len(hneg) >= 2:
x = heapq.heappop(hneg)
x *= heapq.heappop(hneg)
heapq.heappush(pairs, -x)
if len(pairs):
for i in range(K // 2):
ans *= -heapq.heappop(pairs)
ans %= MOD
print(ans % MOD)
if __name__ == "__main__":
main()
| replace | 26 | 27 | 26 | 28 | TLE | |
p02616 | Python | Runtime Error | n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
ans = 1
mod = 10**9 + 7
c = 0
z = 0
for i in a:
if i < 0:
c += 1
elif i == 0:
z += 1
if c == n and k & 1:
a.reverse()
for i in range(k):
ans *= -a[i]
ans %= mod
print(-ans % mod)
elif c == n:
for i in range(k):
ans *= -a[i]
ans %= mod
print(ans)
else:
plus = [i for i in a if i > 0]
minus = [i for i in a if i <= 0]
plus.sort(reverse=1)
minus.sort()
x = len(plus)
y = len(minus)
plus += [0] * z
p, m = 0, 0
for i in range(k // 2):
if x - 1 <= p:
ans *= minus[m] * minus[m + 1]
m += 2
elif y - 1 <= m:
ans *= plus[p] * plus[p + 1]
p += 2
else:
if minus[m] * minus[m + 1] >= plus[p] * plus[p + 1]:
ans *= minus[m] * minus[m + 1]
m += 2
else:
ans *= plus[p] * plus[p + 1]
p += 2
ans %= mod
if k & 1:
if p < x:
ans *= plus[p]
else:
ans *= minus[-1]
ans %= mod
print(ans % mod)
| n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
ans = 1
mod = 10**9 + 7
c = 0
z = 0
for i in a:
if i < 0:
c += 1
elif i == 0:
z += 1
if c == n and k & 1:
a.reverse()
for i in range(k):
ans *= -a[i]
ans %= mod
print(-ans % mod)
elif c == n:
for i in range(k):
ans *= -a[i]
ans %= mod
print(ans)
elif k == n:
for i in a:
ans *= abs(i)
ans %= mod
print(((-1) ** c * ans) % mod)
else:
plus = [i for i in a if i > 0]
minus = [i for i in a if i <= 0]
plus.sort(reverse=1)
minus.sort()
x = len(plus)
y = len(minus)
plus += [0] * z
p, m = 0, 0
for i in range(k // 2):
if x - 1 <= p:
ans *= minus[m] * minus[m + 1]
m += 2
elif y - 1 <= m:
ans *= plus[p] * plus[p + 1]
p += 2
else:
if minus[m] * minus[m + 1] >= plus[p] * plus[p + 1]:
ans *= minus[m] * minus[m + 1]
m += 2
else:
ans *= plus[p] * plus[p + 1]
p += 2
ans %= mod
if k & 1:
if p < x:
ans *= plus[p]
else:
ans *= minus[-1]
ans %= mod
print(ans % mod)
| insert | 23 | 23 | 23 | 28 | 0 | |
p02616 | Python | Runtime Error | MOD = 10**9 + 7
def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort(key=lambda x: abs(x), reverse=True)
res = 1
if max(a) < 0:
if k % 2 == 1:
for i in range(n - k, n):
res *= a[i]
res %= MOD
else:
for i in range(k):
res *= a[i]
res %= MOD
else:
plus_a = [e for e in a if e >= 0]
minus_a = [e for e in a if e < 0]
minus_cnt = min(k, len(minus_a))
minus_cnt -= minus_cnt % 2
plus_cnt = k - minus_cnt
minus_a = minus_a[:minus_cnt]
minus_a.reverse()
max_change_cnt = min(minus_cnt, len(plus_a) - plus_cnt)
max_change_cnt -= max_change_cnt % 2
change_cnt = 0
while change_cnt < max_change_cnt:
if (
plus_a[plus_cnt + change_cnt] * plus_a[plus_cnt + change_cnt + 1]
<= minus_a[change_cnt] * minus_a[change_cnt + 1]
):
break
change_cnt += 2
for i in range(change_cnt, minus_cnt):
res *= minus_a[i]
res %= MOD
for i in range(plus_cnt + change_cnt):
res *= plus_a[i]
res %= MOD
print(res)
main()
| MOD = 10**9 + 7
def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort(key=lambda x: abs(x), reverse=True)
res = 1
if k == n:
for e in a:
res *= e
res %= MOD
elif max(a) < 0:
if k % 2 == 1:
for i in range(n - k, n):
res *= a[i]
res %= MOD
else:
for i in range(k):
res *= a[i]
res %= MOD
else:
plus_a = [e for e in a if e >= 0]
minus_a = [e for e in a if e < 0]
minus_cnt = min(k, len(minus_a))
minus_cnt -= minus_cnt % 2
plus_cnt = k - minus_cnt
minus_a = minus_a[:minus_cnt]
minus_a.reverse()
max_change_cnt = min(minus_cnt, len(plus_a) - plus_cnt)
max_change_cnt -= max_change_cnt % 2
change_cnt = 0
while change_cnt < max_change_cnt:
if (
plus_a[plus_cnt + change_cnt] * plus_a[plus_cnt + change_cnt + 1]
<= minus_a[change_cnt] * minus_a[change_cnt + 1]
):
break
change_cnt += 2
for i in range(change_cnt, minus_cnt):
res *= minus_a[i]
res %= MOD
for i in range(plus_cnt + change_cnt):
res *= plus_a[i]
res %= MOD
print(res)
main()
| replace | 10 | 11 | 10 | 15 | 0 | |
p02616 | Python | Runtime Error | N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10**9 + 7
X = sorted([a for a in A if a > 0])
Y = sorted([a for a in A if a < 0], key=lambda x: abs(x))
if 2 * (min(K, len(Y)) // 2) + len(X) >= K:
ans = 1
if K % 2 == 1:
ans *= X.pop()
K -= 1
XX = [(x1 * x2) for x1, x2 in zip(*[iter(X[::-1])] * 2)]
YY = [(y1 * y2) for y1, y2 in zip(*[iter(Y[::-1])] * 2)]
ZZ = sorted(XX + YY)
for i in range(K // 2):
ans *= ZZ.pop()
ans %= MOD
print(ans)
else:
ans = 1
Z = sorted(X + Y, key=lambda x: abs(x), reverse=True)
for i in range(K):
ans *= Z.pop()
ans %= MOD
print(ans)
| N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10**9 + 7
X = sorted([a for a in A if a >= 0])
Y = sorted([a for a in A if a < 0], key=lambda x: abs(x))
if 2 * (min(K, len(Y)) // 2) + len(X) >= K:
ans = 1
if K % 2 == 1:
ans *= X.pop()
K -= 1
XX = [(x1 * x2) for x1, x2 in zip(*[iter(X[::-1])] * 2)]
YY = [(y1 * y2) for y1, y2 in zip(*[iter(Y[::-1])] * 2)]
ZZ = sorted(XX + YY)
for i in range(K // 2):
ans *= ZZ.pop()
ans %= MOD
print(ans)
else:
ans = 1
Z = sorted(X + Y, key=lambda x: abs(x), reverse=True)
for i in range(K):
ans *= Z.pop()
ans %= MOD
print(ans)
| replace | 4 | 5 | 4 | 5 | 0 | |
p02616 | Python | Runtime Error | N, K = map(int, input().split())
X = list(map(int, input().split()))
MOD = 10**9 + 7
if K % 2 == 1 and all(v < 0 for v in X):
# Minimize abs
X.sort(key=lambda x: -x)
ans = 1
for i in range(K):
ans = ans * X[i] % MOD
print(ans)
else:
pos = sorted(v for v in X if v >= 0)
neg = sorted(-v for v in X if v < 0)
ans = 1
if K % 2 == 1:
ans *= pos.pop()
cand = []
while len(pos) >= 2:
tmp = pos.pop() * pos.pop()
cand.append(tmp)
while len(neg) >= 2:
tmp = neg.pop() * neg.pop()
cand.append(tmp)
cand.sort(reverse=True)
for i in range(K // 2):
ans = ans * cand[i] % MOD
print(ans)
| N, K = map(int, input().split())
X = list(map(int, input().split()))
MOD = 10**9 + 7
if K % 2 == 1 and all(v < 0 for v in X):
# Minimize abs
X.sort(key=lambda x: -x)
ans = 1
for i in range(K):
ans = ans * X[i] % MOD
print(ans)
elif K == N:
ans = 1
for i in range(K):
ans = ans * X[i] % MOD
print(ans)
else:
pos = sorted(v for v in X if v >= 0)
neg = sorted(-v for v in X if v < 0)
ans = 1
if K % 2 == 1:
ans *= pos.pop()
cand = []
while len(pos) >= 2:
tmp = pos.pop() * pos.pop()
cand.append(tmp)
while len(neg) >= 2:
tmp = neg.pop() * neg.pop()
cand.append(tmp)
cand.sort(reverse=True)
for i in range(K // 2):
ans = ans * cand[i] % MOD
print(ans)
| insert | 8 | 8 | 8 | 13 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#define int long long
using namespace std;
typedef long long LL;
const int N = 100010, mod = 1000000007;
int a[N];
signed main() {
int n, k;
scanf("%lld%lld", &n, &k);
for (int i = 0; i < n; i++)
scanf("%lld", &a[i]);
sort(a, a + n);
LL res = 1;
int l = 0, r = n - 1;
int sign = 1;
if (k % 2) {
res = a[r];
r--;
k--;
if (res < 0)
sign = -1;
}
while (k) {
LL x = (LL)a[l] * a[l + 1], y = (LL)a[r] * a[r - 1];
if (x * sign > y * sign) {
res = x % mod * res % mod;
l += 2;
} else {
res = y % mod * res % mod;
r -= 2;
}
k -= 2;
}
printf("%lld", (res % mod + mod) % mod);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#define int long long
using namespace std;
typedef long long LL;
const int N = 200010, mod = 1000000007;
int a[N];
signed main() {
int n, k;
scanf("%lld%lld", &n, &k);
for (int i = 0; i < n; i++)
scanf("%lld", &a[i]);
sort(a, a + n);
LL res = 1;
int l = 0, r = n - 1;
int sign = 1;
if (k % 2) {
res = a[r];
r--;
k--;
if (res < 0)
sign = -1;
}
while (k) {
LL x = (LL)a[l] * a[l + 1], y = (LL)a[r] * a[r - 1];
if (x * sign > y * sign) {
res = x % mod * res % mod;
l += 2;
} else {
res = y % mod * res % mod;
r -= 2;
}
k -= 2;
}
printf("%lld", (res % mod + mod) % mod);
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02616 | C++ | Runtime Error | #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<LL> PQ_DESC;
typedef priority_queue<LL, VL, greater<LL>> 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;
LL modpow(LL a, LL n) {
LL res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
void Main() {
int n, k;
cin >> n >> k;
VL p, m, z;
REP(i, n) {
LL a;
cin >> a;
if (a == 0) {
z.PB(a);
}
if (a > 0) {
p.PB(a);
}
if (a < 0) {
m.PB(a);
}
}
int np = SIZE(p);
int nm = SIZE(m);
int nz = SIZE(z);
if (k > np + nm) {
std::cout << 0 << endl;
return;
}
LL fugo = 1;
if (k == np + nm) {
if (nm % 2 == 1) {
fugo = -1;
}
}
if (np == 0) {
if (k % 2 == 1) {
fugo = -1;
}
}
if (fugo == -1) {
if (nz != 0) {
std::cout << 0 << endl;
return;
}
}
if (fugo == 1) {
SORT_DESC(p);
SORT_ASC(m);
int i = 0;
int j = 0;
LL result = 1;
REP(kk, k) {
bool f;
if (kk == k - 1) {
f = true;
} else if (j >= nm - 1) {
f = true;
} else if (i <= np - 1) {
if (p[i] > m[j] * m[j + 1]) {
f = true;
} else {
f = false;
}
} else if (p[i] * p[i + 1] > m[j] * m[j + 1]) {
f = true;
} else {
f = false;
}
if (f) {
result *= p[i];
i++;
} else {
LL x = m[j] * m[j + 1];
x %= MOD;
result *= x;
j += 2;
kk++;
}
result %= MOD;
}
std::cout << result << endl;
} else {
SORT_ASC(p);
SORT_DESC(m);
int i = 0;
int j = 0;
LL result = 1;
// dump(result)
REP(kk, k) {
bool f;
if (i >= np) {
f = false;
} else if (j >= nm) {
f = true;
} else if (p[i] < -m[j]) {
f = true;
} else {
f = false;
}
if (f) {
result *= p[i];
i++;
} else {
result *= m[j];
result %= MOD;
result += MOD;
j++;
}
result %= MOD;
}
std::cout << result << endl;
}
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
std::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<LL> PQ_DESC;
typedef priority_queue<LL, VL, greater<LL>> 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;
LL modpow(LL a, LL n) {
LL res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
void Main() {
int n, k;
cin >> n >> k;
VL p, m, z;
REP(i, n) {
LL a;
cin >> a;
if (a == 0) {
z.PB(a);
}
if (a > 0) {
p.PB(a);
}
if (a < 0) {
m.PB(a);
}
}
int np = SIZE(p);
int nm = SIZE(m);
int nz = SIZE(z);
if (k > np + nm) {
std::cout << 0 << endl;
return;
}
LL fugo = 1;
if (k == np + nm) {
if (nm % 2 == 1) {
fugo = -1;
}
}
if (np == 0) {
if (k % 2 == 1) {
fugo = -1;
}
}
if (fugo == -1) {
if (nz != 0) {
std::cout << 0 << endl;
return;
}
}
if (fugo == 1) {
SORT_DESC(p);
SORT_ASC(m);
int i = 0;
int j = 0;
LL result = 1;
REP(kk, k) {
bool f;
if (kk == k - 1) {
f = true;
} else if (j >= nm - 1) {
f = true;
} else if (i >= np) {
f = false;
} else if (i >= np - 1) {
if (p[i] > m[j] * m[j + 1]) {
f = true;
} else {
f = false;
}
} else if (p[i] * p[i + 1] > m[j] * m[j + 1]) {
f = true;
} else {
f = false;
}
if (f) {
result *= p[i];
i++;
} else {
LL x = m[j] * m[j + 1];
x %= MOD;
result *= x;
j += 2;
kk++;
}
result %= MOD;
}
std::cout << result << endl;
} else {
SORT_ASC(p);
SORT_DESC(m);
int i = 0;
int j = 0;
LL result = 1;
// dump(result)
REP(kk, k) {
bool f;
if (i >= np) {
f = false;
} else if (j >= nm) {
f = true;
} else if (p[i] < -m[j]) {
f = true;
} else {
f = false;
}
if (f) {
result *= p[i];
i++;
} else {
result *= m[j];
result %= MOD;
result += MOD;
j++;
}
result %= MOD;
}
std::cout << result << endl;
}
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
std::cout << fixed << setprecision(15);
Main();
return 0;
} | replace | 121 | 122 | 121 | 124 | 0 | |
p02616 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define SZ(a) (int)((a).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> Pii;
typedef pair<ll, int> Pli;
typedef unsigned long long ull;
const double eps = 1e-8;
const ll infll = 0x7fffffffffffffff;
const int mod = (int)(1e9) + 7;
const int inf = 0x7fffffff;
const int maxn = (int)(2e5) + 7;
const int maxm = 300;
int n, k, l1, l2, l3, z;
ll a[maxn], b[maxn], c[maxn];
int main() {
// freopen("in.in", "r", stdin);
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
ll x;
scanf("%lld", &x);
if (x > 0)
a[++l1] = x;
if (x < 0)
b[++l2] = x;
if (x == 0)
z++;
c[++l3] = abs(x);
}
sort(a + 1, a + 1 + l1);
sort(b + 1, b + 1 + l2, greater<ll>());
ll res = 1;
if (l1 + l2 / 2 * 2 >= k && (k % 2 == 0 || l1)) { // 正数
if (k % 2) {
res = res * a[l1] % mod;
l1--;
}
while (k) {
ll v1 = (l1 > 1 ? a[l1] * a[l1 - 1] : 0);
ll v2 = (l2 > 1 ? b[l2] * b[l2 - 1] : 0);
if (v2 >= v1) {
res = v2 % mod * res % mod;
l2 -= 2;
} else {
res = v1 % mod * res % mod;
l1 -= 2;
}
k -= 2;
}
} else if (z)
res = 0; // 零
else { // 负数
sort(c + 1, c + 1 + n);
for (int i = 1; i <= k; i++)
res = res * c[i] % mod;
res = (-res + mod) % mod;
}
printf("%lld\n", res);
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define SZ(a) (int)((a).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> Pii;
typedef pair<ll, int> Pli;
typedef unsigned long long ull;
const double eps = 1e-8;
const ll infll = 0x7fffffffffffffff;
const int mod = (int)(1e9) + 7;
const int inf = 0x7fffffff;
const int maxn = (int)(2e5) + 7;
const int maxm = 300;
int n, k, l1, l2, l3, z;
ll a[maxn], b[maxn], c[maxn];
int main() {
// freopen("in.in", "r", stdin);
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
ll x;
scanf("%lld", &x);
if (x > 0)
a[++l1] = x;
if (x < 0)
b[++l2] = x;
if (x == 0)
z++;
c[++l3] = abs(x);
}
sort(a + 1, a + 1 + l1);
sort(b + 1, b + 1 + l2, greater<ll>());
ll res = 1;
if (l1 + l2 / 2 * 2 >= k && (k % 2 == 0 || l1)) { // 正数
if (k % 2) {
res = res * a[l1] % mod;
l1--;
k--;
}
while (k) {
ll v1 = (l1 > 1 ? a[l1] * a[l1 - 1] : 0);
ll v2 = (l2 > 1 ? b[l2] * b[l2 - 1] : 0);
if (v2 >= v1) {
res = v2 % mod * res % mod;
l2 -= 2;
} else {
res = v1 % mod * res % mod;
l1 -= 2;
}
k -= 2;
}
} else if (z)
res = 0; // 零
else { // 负数
sort(c + 1, c + 1 + n);
for (int i = 1; i <= k; i++)
res = res * c[i] % mod;
res = (-res + mod) % mod;
}
printf("%lld\n", res);
return 0;
} | insert | 45 | 45 | 45 | 46 | TLE | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdarg>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
using namespace std;
#define INF 2e9 + 9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define Int int64_t
#define pll pair<Int, Int>
template <class T> using pql = priority_queue<T, vector<T>>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define ll(n) \
Int n; \
cin >> n;
#define LL(...) \
Int __VA_ARGS___; \
cin >> __VA_ARGS___;
#define OUT(...) cout << __VA_ARGS___;
#define RP(n, i, s) for (Int i = s; i < n; i++)
#define REP(n, i) for (Int i = 0; i < n; i++)
#define REPe(n, i) for (Int i = 1; i <= n; i++)
#define RPe(n, i, s) for (Int i = s; i <= n; i++)
#define upd_max(maxer, updater) \
if (maxer < updater) \
maxer = updater;
#define upd_min(miner, updater) \
if (miner > updater) \
miner = updater;
#ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
void ansYes(bool flag) {
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ansYES(bool flag) {
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
struct node {
Int to;
Int length;
};
vector<Int> divisor(Int n) {
vector<Int> ret;
for (Int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
return (ret);
}
int dx8[8] = {0, -1, -1, -1, 0, 1, 1, 1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int nanko(string s, Int n, Int i) {
Int length = min(n - i - 1, i);
Int ans = 0;
for (int k = i - length; k < i; k++) {
if (s.at(k) == 'R' && s.at(i + (i - k) == 'B'))
ans++;
}
return ans;
}
struct datas {
Int x;
};
// UnionFind群
/*
class UnionFind {
protected:
vector<int> par;
vector<int> data;
int cnt;
public:
UnionFind() : par(1), data(1), cnt(1) {};
UnionFind(int N);
int root(int x);
int marge(int x, int y);
bool same(int x, int y);
int add();
int add(int x);
int solve();
inline int getSize(int x) { return data.at(root(x)); };
};
UnionFind::UnionFind(int N) : par(N), data(N), cnt(N) {
for (int i = 0; i < N; i++) {
par.at(i) = -1;
data.at(i) = 1;
}
}
int UnionFind::root(int x) {
if (par.at(x) == -1) return x;
return par.at(x) = root(par.at(x)); // 経路圧縮
}
int UnionFind::marge(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return rx;
else { // ノード数の少ない方に接続
if (data.at(rx) < data.at(ry)) swap(rx, ry);
par.at(ry) = rx;
data.at(rx) += data.at(ry);
return rx;
}
return rx;
}
bool UnionFind::same(int x, int y) {
return root(x) == root(y);
}
int UnionFind::add() {
par.push_back(cnt);
cnt++;
return cnt - 1;
}
int UnionFind::add(int x) {
par.push_back(cnt);
cnt++;
return marge(x, cnt);
}
int UnionFind::solve() {
for (int i = 0; i < cnt;i++) {
if (par.at(i) == -1) {
}
}
}*/
/*
int dfs(Int par, Int maxs, bool ans) {
if (mita.at(par) == 1) return 0;
if (maxs > h.at(par)) {
maxs = h.at(par);
ans = true;
}else if (maxs == h.at(par)){
ans = false;
}
Int maxer = 0;
for (auto z : to[par]){
mita.at(par) = 1;
maxer = dfs(z,maxs,ans);
}
}*/
int main() {
Int n, k;
cin >> n >> k;
vector<Int> a(n);
vector<Int> po;
vector<Int> ne;
Int zero = 0, plus = 0, minus = 0;
REP(n, i) {
cin >> a.at(i);
if (a.at(i) < 0) {
minus++;
ne.push_back(a.at(i));
}
if (a.at(i) > 0) {
plus++;
po.push_back(a.at(i));
}
if (a.at(i) == 0) {
zero++;
po.push_back(a.at(i));
}
}
sort(a.begin(), a.end());
sort(po.begin(), po.end());
sort(ne.begin(), ne.end(), greater<>());
if (k == 1) {
cout << a.at(n - 1) << endl;
return 0;
}
bool flag = true;
Int podex = zero + plus - 1;
Int nedex = minus - 1;
if (k == n && plus % 2 != k % 2)
flag = false;
if (plus == 0 && k % 2 == 1)
flag = false;
Int ans = 1;
if (flag) {
Int cnt = k - plus;
cnt = cnt - cnt % 2;
if (k % 2 == 1) {
ans = ans * po.at(podex) % MOD;
podex--;
k--;
}
// cout << cnt << endl;
for (; k > 0;) {
if (nedex < 1) {
ans = ans * po.at(podex) % MOD;
podex--;
ans = ans * po.at(podex) % MOD;
podex--;
k -= 2;
// cout << "A" << endl;
} else if (podex < 1) {
ans = ans * (ne.at(nedex) * -1) % MOD;
nedex--;
ans = ans * (ne.at(nedex) * -1) % MOD;
nedex--;
cnt -= 2;
k -= 2;
// cout << "B" << endl;
} else {
if (-ne.at(nedex) * -ne.at(nedex - 1) >
po.at(podex) * po.at(podex - 1)) {
ans = ans * (ne.at(nedex) * -1) % MOD;
nedex--;
ans = ans * (ne.at(nedex) * -1) % MOD;
nedex--;
cnt -= 2;
k -= 2;
// cout << "AA" << endl;
} else {
ans = ans * po.at(podex) % MOD;
podex--;
ans = ans * po.at(podex) % MOD;
podex--;
k -= 2;
// cout << "BB" << endl;
}
}
}
cout << ans << endl;
return 0;
} else {
if (zero > 0) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < k; i++) {
ans = ans * ne.at(i) % MOD;
}
if (ans < 0) {
cout << ans + MOD << endl;
} else {
cout << ans << endl;
}
}
} | #include <algorithm>
#include <cmath>
#include <cstdarg>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
using namespace std;
#define INF 2e9 + 9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define Int int64_t
#define pll pair<Int, Int>
template <class T> using pql = priority_queue<T, vector<T>>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define ll(n) \
Int n; \
cin >> n;
#define LL(...) \
Int __VA_ARGS___; \
cin >> __VA_ARGS___;
#define OUT(...) cout << __VA_ARGS___;
#define RP(n, i, s) for (Int i = s; i < n; i++)
#define REP(n, i) for (Int i = 0; i < n; i++)
#define REPe(n, i) for (Int i = 1; i <= n; i++)
#define RPe(n, i, s) for (Int i = s; i <= n; i++)
#define upd_max(maxer, updater) \
if (maxer < updater) \
maxer = updater;
#define upd_min(miner, updater) \
if (miner > updater) \
miner = updater;
#ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
void ansYes(bool flag) {
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ansYES(bool flag) {
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
struct node {
Int to;
Int length;
};
vector<Int> divisor(Int n) {
vector<Int> ret;
for (Int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
return (ret);
}
int dx8[8] = {0, -1, -1, -1, 0, 1, 1, 1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int nanko(string s, Int n, Int i) {
Int length = min(n - i - 1, i);
Int ans = 0;
for (int k = i - length; k < i; k++) {
if (s.at(k) == 'R' && s.at(i + (i - k) == 'B'))
ans++;
}
return ans;
}
struct datas {
Int x;
};
// UnionFind群
/*
class UnionFind {
protected:
vector<int> par;
vector<int> data;
int cnt;
public:
UnionFind() : par(1), data(1), cnt(1) {};
UnionFind(int N);
int root(int x);
int marge(int x, int y);
bool same(int x, int y);
int add();
int add(int x);
int solve();
inline int getSize(int x) { return data.at(root(x)); };
};
UnionFind::UnionFind(int N) : par(N), data(N), cnt(N) {
for (int i = 0; i < N; i++) {
par.at(i) = -1;
data.at(i) = 1;
}
}
int UnionFind::root(int x) {
if (par.at(x) == -1) return x;
return par.at(x) = root(par.at(x)); // 経路圧縮
}
int UnionFind::marge(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return rx;
else { // ノード数の少ない方に接続
if (data.at(rx) < data.at(ry)) swap(rx, ry);
par.at(ry) = rx;
data.at(rx) += data.at(ry);
return rx;
}
return rx;
}
bool UnionFind::same(int x, int y) {
return root(x) == root(y);
}
int UnionFind::add() {
par.push_back(cnt);
cnt++;
return cnt - 1;
}
int UnionFind::add(int x) {
par.push_back(cnt);
cnt++;
return marge(x, cnt);
}
int UnionFind::solve() {
for (int i = 0; i < cnt;i++) {
if (par.at(i) == -1) {
}
}
}*/
/*
int dfs(Int par, Int maxs, bool ans) {
if (mita.at(par) == 1) return 0;
if (maxs > h.at(par)) {
maxs = h.at(par);
ans = true;
}else if (maxs == h.at(par)){
ans = false;
}
Int maxer = 0;
for (auto z : to[par]){
mita.at(par) = 1;
maxer = dfs(z,maxs,ans);
}
}*/
int main() {
Int n, k;
cin >> n >> k;
vector<Int> a(n);
vector<Int> po;
vector<Int> ne;
Int zero = 0, plus = 0, minus = 0;
REP(n, i) {
cin >> a.at(i);
if (a.at(i) < 0) {
minus++;
ne.push_back(a.at(i));
}
if (a.at(i) > 0) {
plus++;
po.push_back(a.at(i));
}
if (a.at(i) == 0) {
zero++;
po.push_back(a.at(i));
}
}
sort(a.begin(), a.end());
sort(po.begin(), po.end());
sort(ne.begin(), ne.end(), greater<>());
if (k == 1) {
cout << a.at(n - 1) << endl;
return 0;
}
bool flag = true;
Int podex = zero + plus - 1;
Int nedex = minus - 1;
if (k == n && plus % 2 != k % 2)
flag = false;
if (plus == 0 && k % 2 == 1)
flag = false;
Int ans = 1;
if (flag) {
Int cnt = k - plus;
cnt = cnt - cnt % 2;
if (k % 2 == 1) {
ans = ans * po.at(podex) % MOD;
podex--;
k--;
}
// cout << cnt << endl;
for (; k > 0;) {
if (nedex < 1) {
ans = ans * po.at(podex) % MOD;
podex--;
ans = ans * po.at(podex) % MOD;
podex--;
k -= 2;
// cout << "A" << endl;
} else if (podex < 1) {
ans = ans * (ne.at(nedex) * -1) % MOD;
nedex--;
ans = ans * (ne.at(nedex) * -1) % MOD;
nedex--;
cnt -= 2;
k -= 2;
// cout << "B" << endl;
} else {
if (-ne.at(nedex) * -ne.at(nedex - 1) >
po.at(podex) * po.at(podex - 1)) {
ans = ans * (ne.at(nedex) * -1) % MOD;
nedex--;
ans = ans * (ne.at(nedex) * -1) % MOD;
nedex--;
cnt -= 2;
k -= 2;
// cout << "AA" << endl;
} else {
ans = ans * po.at(podex) % MOD;
podex--;
ans = ans * po.at(podex) % MOD;
podex--;
k -= 2;
// cout << "BB" << endl;
}
}
}
cout << ans << endl;
return 0;
} else {
if (zero > 0) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < k; i++) {
ans = ans * a.at(n - 1 - i) % MOD;
}
if (ans < 0) {
cout << ans + MOD << endl;
} else {
cout << ans << endl;
}
}
} | replace | 275 | 276 | 275 | 276 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long ll;
vector<ll> v[3];
ll ans = 1;
int K;
ll solve() {
reverse(v[2].begin(), v[2].end());
int cnt1 = 0, cnt2 = 0;
while (cnt1 + 1 < (int)(v[0].size()) && cnt2 + 1 < (int)(v[2].size()) &&
cnt1 + cnt2 + 2 <= K) {
if (1ll * v[2][cnt2] * v[2][cnt2 + 1] > 1ll * v[0][cnt1] * v[0][cnt1 + 1])
ans = (1ll * v[0][cnt2] * v[0][cnt2 + 1]) % MOD * ans % MOD, cnt2 += 2;
else
ans = (1ll * v[0][cnt1] * v[0][cnt1 + 1]) % MOD * ans % MOD, cnt1 += 2;
}
while (cnt2 + 1 < (int)(v[2].size()) && cnt2 + cnt1 + 2 <= K) {
ans = ans * v[2][cnt2] % MOD * v[2][cnt2 + 1] % MOD;
cnt2 += 2;
}
while (cnt1 + 1 < (int)(v[0].size()) && cnt2 + cnt1 + 2 <= K) {
ans = ans * v[0][cnt1] % MOD * v[0][cnt1 + 1] % MOD;
cnt1 += 2;
}
if (cnt2 + cnt1 < K)
ans = ans * v[2][cnt2] % MOD;
return (ans + MOD) % MOD;
}
bool can1() {
int num = (int)(v[0].size()) / 2;
for (int i = 0; i <= num; i++)
if (i * 2 <= K && K - 2 * i <= (int)(v[2].size()))
return 1;
return 0;
}
bool can0() { return v[1].size() > 0; }
bool cmp(int x, int y) { return abs(x) < abs(y); }
int main() {
int n;
cin >> n >> K;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x < 0)
v[0].push_back(x);
if (x > 0)
v[2].push_back(x);
if (x == 0)
v[1].push_back(x);
}
sort(v[0].begin(), v[0].end());
sort(v[2].begin(), v[2].end());
if (can1()) {
cout << solve();
} else if (can0()) {
puts("0");
} else {
for (int i = 0; i < v[0].size(); i++)
v[1].push_back(v[0][i]);
for (int i = 0; i < v[2].size(); i++)
v[1].push_back(v[2][i]);
sort(v[1].begin(), v[1].end(), cmp);
for (int i = 0; i < K; i++)
ans = ans * v[1][i] % MOD;
cout << (ans + MOD) % MOD;
}
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long ll;
vector<ll> v[3];
ll ans = 1;
int K;
ll solve() {
reverse(v[2].begin(), v[2].end());
int cnt1 = 0, cnt2 = 0;
while (cnt1 + 1 < (int)(v[0].size()) && cnt2 + 1 < (int)(v[2].size()) &&
cnt1 + cnt2 + 2 <= K) {
if (1ll * v[2][cnt2] * v[2][cnt2 + 1] > 1ll * v[0][cnt1] * v[0][cnt1 + 1])
ans = (1ll * v[2][cnt2] * v[2][cnt2 + 1]) % MOD * ans % MOD, cnt2 += 2;
else
ans = (1ll * v[0][cnt1] * v[0][cnt1 + 1]) % MOD * ans % MOD, cnt1 += 2;
}
while (cnt2 + 1 < (int)(v[2].size()) && cnt2 + cnt1 + 2 <= K) {
ans = ans * v[2][cnt2] % MOD * v[2][cnt2 + 1] % MOD;
cnt2 += 2;
}
while (cnt1 + 1 < (int)(v[0].size()) && cnt2 + cnt1 + 2 <= K) {
ans = ans * v[0][cnt1] % MOD * v[0][cnt1 + 1] % MOD;
cnt1 += 2;
}
if (cnt2 + cnt1 < K)
ans = ans * v[2][cnt2] % MOD;
return (ans + MOD) % MOD;
}
bool can1() {
int num = (int)(v[0].size()) / 2;
for (int i = 0; i <= num; i++)
if (i * 2 <= K && K - 2 * i <= (int)(v[2].size()))
return 1;
return 0;
}
bool can0() { return v[1].size() > 0; }
bool cmp(int x, int y) { return abs(x) < abs(y); }
int main() {
int n;
cin >> n >> K;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x < 0)
v[0].push_back(x);
if (x > 0)
v[2].push_back(x);
if (x == 0)
v[1].push_back(x);
}
sort(v[0].begin(), v[0].end());
sort(v[2].begin(), v[2].end());
if (can1()) {
cout << solve();
} else if (can0()) {
puts("0");
} else {
for (int i = 0; i < v[0].size(); i++)
v[1].push_back(v[0][i]);
for (int i = 0; i < v[2].size(); i++)
v[1].push_back(v[2][i]);
sort(v[1].begin(), v[1].end(), cmp);
for (int i = 0; i < K; i++)
ans = ans * v[1][i] % MOD;
cout << (ans + MOD) % MOD;
}
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02616 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (lint)(n); i++)
#define REP(i, n) for (int i = 1; i <= (lint)(n); i++)
#define all(V) V.begin(), V.end()
#define stackReplaceBegin(size) \
void *p = malloc(size); \
esp_new = (lint)p + size - 1; \
void *stack_extend_memory_ = malloc(size); \
void *stack_extend_origin_memory_; \
char *stack_extend_dummy_memory_ = (char *)alloca( \
(1 + (int)(((long long)stack_extend_memory_) & 127)) * 16); \
*stack_extend_dummy_memory_ = 0; \
asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp" \
: "=b"(stack_extend_origin_memory_) \
: "a"((char *)stack_extend_memory_ + (size)-1024));
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;
lint esp_new;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
inline lint gcd(lint a, lint b) {
while (b) {
lint c = a;
a = b;
b = c % b;
}
return a;
}
inline lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool isprime(lint n) {
if (n == 1)
return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
template <typename T> T mypow(T a, unsigned int b) {
T res(1), now(a);
while (b) {
if (b & 1)
res *= now;
b >>= 1;
now *= now;
}
return res;
}
template <typename T> void printArray(std::vector<T> &vec) {
rep(i, (int)vec.size() - 1) std::cout << vec[i] << " ";
if (!vec.empty())
std::cout << vec.back() << std::endl;
}
template <typename T> void printArray(T l, T r) {
T rprev = r;
rprev--;
for (T i = l; i != rprev; i++) {
std::cout << *i << " ";
}
std::cout << *rprev << std::endl;
}
class ModInt {
lint value;
public:
static const unsigned int modulo;
ModInt() : value(0) {}
template <typename T> ModInt(T value = 0) : value(value) {
if (value < 0)
value = -(lint)(-value % modulo) + modulo;
this->value = value % modulo;
}
inline operator int() const { return value; }
inline ModInt &operator+=(const ModInt &x) {
value += x.value;
if (value >= modulo)
value -= modulo;
return *this;
}
inline ModInt &operator++() {
if (value == modulo - 1)
value = 0;
else
value++;
return *this;
}
inline ModInt operator-() const { return ModInt(0) -= *this; }
inline ModInt &operator-=(const ModInt &x) {
value -= x.value;
if (value < 0)
value += modulo;
return *this;
}
inline ModInt &operator--() {
if (value == 0)
value = modulo - 1;
else
value--;
return *this;
}
inline ModInt &operator*=(const ModInt &x) {
value = value * x.value % modulo;
return *this;
}
inline ModInt &operator/=(ModInt rhs) {
int exp = modulo - 2;
while (exp) {
if (exp & 1)
*this *= rhs;
rhs *= rhs;
exp >>= 1;
}
return *this;
}
template <typename T> ModInt operator+(const T &rhs) const {
return ModInt(*this) += rhs;
}
template <typename T> ModInt &operator+=(const T &rhs) {
return operator+=(ModInt(rhs));
}
template <typename T> ModInt operator-(const T &rhs) const {
return ModInt(*this) -= rhs;
}
template <typename T> ModInt &operator-=(const T &rhs) {
return operator-=(ModInt(rhs));
}
template <typename T> ModInt operator*(const T &rhs) const {
return ModInt(*this) *= rhs;
}
template <typename T> ModInt &operator*=(const T &rhs) {
return operator*=(ModInt(rhs));
}
template <typename T> ModInt operator/(const T &rhs) const {
return ModInt(*this) /= rhs;
}
template <typename T> ModInt &operator/=(const T &rhs) {
return operator/=(ModInt(rhs));
}
};
std::istream &operator>>(std::istream &ist, ModInt &x) {
lint a;
ist >> a;
x = a;
return ist;
}
const unsigned int ModInt::modulo = 1000000007;
lint n, k, a[200010], zero;
std::vector<lint> vec[2];
int main() {
std::cin >> n >> k;
rep(i, n) {
std::cin >> a[i];
if (a[i] < 0)
vec[0].push_back(-a[i]);
else if (a[i] > 0)
vec[1].push_back(a[i]);
else
zero++;
}
std::sort(all(vec[0]), std::greater<lint>());
std::sort(all(vec[1]), std::greater<lint>());
if (zero == 0) {
ModInt ans = 1;
if (vec[1].empty() && k % 2) {
std::reverse(all(vec[0]));
ans = -1;
rep(i, k) ans *= vec[0][i];
} else if (k == n && vec[0].size() % 2) {
rep(i, n) ans *= a[i];
} else {
int x = std::min(k, (lint)vec[0].size()) / 2 * 2;
rep(i, x) ans *= vec[0][i];
rep(i, k - x) ans *= vec[1][i];
while (x && k - x + 1 < vec[1].size()) {
if (vec[0][x - 1] * vec[0][x - 2] > vec[1][k - x] * vec[1][k - x + 1])
break;
ans /= vec[0][x - 1];
ans /= vec[0][x - 2];
ans *= vec[1][k - x];
ans *= vec[1][k - x + 1];
x -= 2;
}
}
std::cout << ans << std::endl;
} else {
if (vec[0].size() + vec[1].size() < k)
std::cout << 0 << std::endl;
else if (vec[0].size() + vec[1].size() == k && vec[0].size() % 2)
std::cout << 0 << std::endl;
else {
ModInt ans = 1;
int x = std::min(k, (lint)vec[0].size()) / 2 * 2;
rep(i, x) ans *= vec[0][i];
rep(i, k - x) ans *= vec[1][i];
while (x && k - x + 1 < vec[1].size()) {
if (vec[0][x - 1] * vec[0][x - 2] > vec[1][k - x] * vec[1][k - x + 1])
break;
ans /= vec[0][x - 1];
ans /= vec[0][x - 2];
ans *= vec[1][k - x];
ans *= vec[1][k - x + 1];
x -= 2;
}
std::cout << ans << std::endl;
}
}
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (lint)(n); i++)
#define REP(i, n) for (int i = 1; i <= (lint)(n); i++)
#define all(V) V.begin(), V.end()
#define stackReplaceBegin(size) \
void *p = malloc(size); \
esp_new = (lint)p + size - 1; \
void *stack_extend_memory_ = malloc(size); \
void *stack_extend_origin_memory_; \
char *stack_extend_dummy_memory_ = (char *)alloca( \
(1 + (int)(((long long)stack_extend_memory_) & 127)) * 16); \
*stack_extend_dummy_memory_ = 0; \
asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp" \
: "=b"(stack_extend_origin_memory_) \
: "a"((char *)stack_extend_memory_ + (size)-1024));
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;
lint esp_new;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
inline lint gcd(lint a, lint b) {
while (b) {
lint c = a;
a = b;
b = c % b;
}
return a;
}
inline lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool isprime(lint n) {
if (n == 1)
return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
template <typename T> T mypow(T a, unsigned int b) {
T res(1), now(a);
while (b) {
if (b & 1)
res *= now;
b >>= 1;
now *= now;
}
return res;
}
template <typename T> void printArray(std::vector<T> &vec) {
rep(i, (int)vec.size() - 1) std::cout << vec[i] << " ";
if (!vec.empty())
std::cout << vec.back() << std::endl;
}
template <typename T> void printArray(T l, T r) {
T rprev = r;
rprev--;
for (T i = l; i != rprev; i++) {
std::cout << *i << " ";
}
std::cout << *rprev << std::endl;
}
class ModInt {
lint value;
public:
static const unsigned int modulo;
ModInt() : value(0) {}
template <typename T> ModInt(T value = 0) : value(value) {
if (value < 0)
value = -(lint)(-value % modulo) + modulo;
this->value = value % modulo;
}
inline operator int() const { return value; }
inline ModInt &operator+=(const ModInt &x) {
value += x.value;
if (value >= modulo)
value -= modulo;
return *this;
}
inline ModInt &operator++() {
if (value == modulo - 1)
value = 0;
else
value++;
return *this;
}
inline ModInt operator-() const { return ModInt(0) -= *this; }
inline ModInt &operator-=(const ModInt &x) {
value -= x.value;
if (value < 0)
value += modulo;
return *this;
}
inline ModInt &operator--() {
if (value == 0)
value = modulo - 1;
else
value--;
return *this;
}
inline ModInt &operator*=(const ModInt &x) {
value = value * x.value % modulo;
return *this;
}
inline ModInt &operator/=(ModInt rhs) {
int exp = modulo - 2;
while (exp) {
if (exp & 1)
*this *= rhs;
rhs *= rhs;
exp >>= 1;
}
return *this;
}
template <typename T> ModInt operator+(const T &rhs) const {
return ModInt(*this) += rhs;
}
template <typename T> ModInt &operator+=(const T &rhs) {
return operator+=(ModInt(rhs));
}
template <typename T> ModInt operator-(const T &rhs) const {
return ModInt(*this) -= rhs;
}
template <typename T> ModInt &operator-=(const T &rhs) {
return operator-=(ModInt(rhs));
}
template <typename T> ModInt operator*(const T &rhs) const {
return ModInt(*this) *= rhs;
}
template <typename T> ModInt &operator*=(const T &rhs) {
return operator*=(ModInt(rhs));
}
template <typename T> ModInt operator/(const T &rhs) const {
return ModInt(*this) /= rhs;
}
template <typename T> ModInt &operator/=(const T &rhs) {
return operator/=(ModInt(rhs));
}
};
std::istream &operator>>(std::istream &ist, ModInt &x) {
lint a;
ist >> a;
x = a;
return ist;
}
const unsigned int ModInt::modulo = 1000000007;
lint n, k, a[200010], zero;
std::vector<lint> vec[2];
int main() {
std::cin >> n >> k;
rep(i, n) {
std::cin >> a[i];
if (a[i] < 0)
vec[0].push_back(-a[i]);
else if (a[i] > 0)
vec[1].push_back(a[i]);
else
zero++;
}
std::sort(all(vec[0]), std::greater<lint>());
std::sort(all(vec[1]), std::greater<lint>());
if (zero == 0) {
ModInt ans = 1;
if (vec[1].empty() && k % 2) {
std::reverse(all(vec[0]));
ans = -1;
rep(i, k) ans *= vec[0][i];
} else if (k == n && vec[0].size() % 2) {
rep(i, n) ans *= a[i];
} else {
int x = std::min(k, (lint)vec[0].size()) / 2 * 2;
rep(i, x) ans *= vec[0][i];
rep(i, k - x) ans *= vec[1][i];
while (x && k - x + 1 < vec[1].size()) {
if (vec[0][x - 1] * vec[0][x - 2] > vec[1][k - x] * vec[1][k - x + 1])
break;
ans /= vec[0][x - 1];
ans /= vec[0][x - 2];
ans *= vec[1][k - x];
ans *= vec[1][k - x + 1];
x -= 2;
}
}
std::cout << ans << std::endl;
} else {
if (vec[0].size() + vec[1].size() < k)
std::cout << 0 << std::endl;
else if (vec[0].size() + vec[1].size() == k && vec[0].size() % 2)
std::cout << 0 << std::endl;
else if (vec[1].empty() && k % 2)
std::cout << 0 << std::endl;
else {
ModInt ans = 1;
int x = std::min(k, (lint)vec[0].size()) / 2 * 2;
rep(i, x) ans *= vec[0][i];
rep(i, k - x) ans *= vec[1][i];
while (x && k - x + 1 < vec[1].size()) {
if (vec[0][x - 1] * vec[0][x - 2] > vec[1][k - x] * vec[1][k - x + 1])
break;
ans /= vec[0][x - 1];
ans /= vec[0][x - 2];
ans *= vec[1][k - x];
ans *= vec[1][k - x + 1];
x -= 2;
}
std::cout << ans << std::endl;
}
}
return 0;
} | insert | 238 | 238 | 238 | 240 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<pair<int, int>> v;
bool ok = false;
int cnt_zero = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
ok |= (a > 0);
if (a > 0)
v.push_back({a, 1});
else if (a < 0)
v.push_back({-a, -1});
else
cnt_zero++;
}
if (n - cnt_zero < k) {
cout << 0 << '\n';
return 0;
}
sort(v.begin(), v.end(), greater<pair<int, int>>());
int cnt = 0;
for (int i = 0; i < k; i++) {
cnt += (v[i].second == -1);
}
if (!ok && k & 1) {
// number is -ve.
if (cnt_zero)
cout << 0 << '\n';
else {
reverse(v.begin(), v.end());
ll ans = 1;
for (int i = 0; i < k; i++)
ans = (ans * v[i].first) % mod;
ans = mod - ans;
cout << ans << '\n';
}
} else {
// number is +ve.
if (cnt & 1) {
int idx_last_neg = -1, idx_last_pos = -1;
for (int i = 0; i < k; i++) {
if (v[i].second == 1)
idx_last_pos = i;
else
idx_last_neg = i;
}
if (idx_last_pos == -1) {
// k is odd, and +ve number is ahead.
for (int i = k; i < n; i++) {
if (v[i].second == 1) {
swap(v[i], v[idx_last_neg]);
ok = false;
break;
}
}
} else {
int i = -1, j = -1;
for (int p = k; p < n; p++) {
if (v[p].second == -1 && j == -1)
j = p;
if (v[p].second == 1 && i == -1)
i = p;
}
if (i == -1)
swap(v[j], v[idx_last_pos]);
else if (j == -1)
swap(v[i], v[idx_last_neg]);
else {
if ((ll)v[i].first * v[idx_last_pos].first >
(ll)v[j].first * v[idx_last_neg].first)
swap(v[i], v[idx_last_neg]);
else
swap(v[j], v[idx_last_pos]);
}
}
}
ll ans = 1;
for (int i = 0; i < k; i++)
ans = (ans * v[i].first) % mod;
cout << ans << '\n';
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<pair<int, int>> v;
bool ok = false;
int cnt_zero = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
ok |= (a > 0);
if (a > 0)
v.push_back({a, 1});
else if (a < 0)
v.push_back({-a, -1});
else
cnt_zero++;
}
if (n - cnt_zero < k) {
cout << 0 << '\n';
return 0;
}
sort(v.begin(), v.end(), greater<pair<int, int>>());
int cnt = 0;
for (int i = 0; i < k; i++) {
cnt += (v[i].second == -1);
}
if (!ok && k & 1) {
// number is -ve.
if (cnt_zero)
cout << 0 << '\n';
else {
reverse(v.begin(), v.end());
ll ans = 1;
for (int i = 0; i < k; i++)
ans = (ans * v[i].first) % mod;
ans = mod - ans;
cout << ans << '\n';
}
} else {
// number is +ve.
if (cnt & 1) {
int idx_last_neg = -1, idx_last_pos = -1;
for (int i = 0; i < k; i++) {
if (v[i].second == 1)
idx_last_pos = i;
else
idx_last_neg = i;
}
if (idx_last_pos == -1) {
// k is odd, and +ve number is ahead.
for (int i = k; i < n; i++) {
if (v[i].second == 1) {
swap(v[i], v[idx_last_neg]);
ok = false;
break;
}
}
} else if (k == n) {
ll ans = 1;
for (int i = 0; i < k; i++)
ans = (ans * v[i].first) % mod;
ans = mod - ans;
cout << ans << '\n';
return 0;
} else {
int i = -1, j = -1;
for (int p = k; p < n; p++) {
if (v[p].second == -1 && j == -1)
j = p;
if (v[p].second == 1 && i == -1)
i = p;
}
if (i == -1)
swap(v[j], v[idx_last_pos]);
else if (j == -1)
swap(v[i], v[idx_last_neg]);
else {
if ((ll)v[i].first * v[idx_last_pos].first >
(ll)v[j].first * v[idx_last_neg].first)
swap(v[i], v[idx_last_neg]);
else
swap(v[j], v[idx_last_pos]);
}
}
}
ll ans = 1;
for (int i = 0; i < k; i++)
ans = (ans * v[i].first) % mod;
cout << ans << '\n';
}
}
| insert | 75 | 75 | 75 | 82 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
vector<ll> a, b, c;
bool cmp(ll a, ll b) { return a > b; }
int main() {
int n, k;
ll x, ans = 1;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> x;
if (x > 0)
a.push_back(x);
if (x < 0)
c.push_back(x);
if (x == 0)
b.push_back(x);
}
sort(a.begin(), a.end(), cmp);
sort(c.begin(), c.end());
if (k == n) {
if (b.size() != 0) {
ans = 0;
cout << ans << endl;
return 0;
} else {
for (int i = 0; i < a.size(); ++i) {
ans *= a[i], ans %= mod;
}
for (int i = 0; i < c.size(); ++i) {
ans *= c[i], ans %= mod;
}
ans = (ans + mod) % mod;
cout << ans << endl;
return 0;
}
} else {
if (a.size() + c.size() < k) {
ans = 0;
cout << ans << endl;
return 0;
}
if (a.size() == 0) {
if (c.size() >= k) {
if (k & 1) {
if (b.size() == 0) {
for (int i = 1; i <= k; ++i) {
ans *= c[c.size() - i], ans += mod, ans %= mod;
}
cout << ans << endl;
return 0;
} else {
cout << 0 << endl;
return 0;
}
} else {
for (int i = 0; i < k; ++i) {
ans *= c[i], ans %= mod;
}
cout << ans << endl;
return 0;
}
}
} else {
int al = 0, cl = 0;
ll ans = 1;
if (k & 1) {
ans *= a[al++];
k--;
while (k > 1) {
if (cl + 2 > c.size() || a[al] * a[al + 1] > c[cl] * c[cl + 1])
ans *= a[al] % mod * a[al + 1] % mod, ans %= mod, al += 2;
else
ans *= c[cl] % mod * c[cl + 1] % mod, ans += mod, ans %= mod,
cl += 2;
k -= 2;
}
ans *= a[cl];
} else {
while (k) {
if (cl + 2 > c.size() || a[al] * a[al + 1] > c[cl] * c[cl + 1])
ans *= a[al] % mod * a[al + 1] % mod, ans %= mod, al += 2;
else
ans *= c[cl] % mod * c[cl + 1] % mod, ans += mod, ans %= mod,
cl += 2;
k -= 2;
}
}
cout << ans << endl;
return 0;
}
}
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
vector<ll> a, b, c;
bool cmp(ll a, ll b) { return a > b; }
int main() {
int n, k;
ll x, ans = 1;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> x;
if (x > 0)
a.push_back(x);
if (x < 0)
c.push_back(x);
if (x == 0)
b.push_back(x);
}
sort(a.begin(), a.end(), cmp);
sort(c.begin(), c.end());
if (k == n) {
if (b.size() != 0) {
ans = 0;
cout << ans << endl;
return 0;
} else {
for (int i = 0; i < a.size(); ++i) {
ans *= a[i], ans %= mod;
}
for (int i = 0; i < c.size(); ++i) {
ans *= c[i], ans %= mod;
}
ans = (ans + mod) % mod;
cout << ans << endl;
return 0;
}
} else {
if (a.size() + c.size() < k) {
ans = 0;
cout << ans << endl;
return 0;
}
if (a.size() == 0) {
if (c.size() >= k) {
if (k & 1) {
if (b.size() == 0) {
for (int i = 1; i <= k; ++i) {
ans *= c[c.size() - i], ans += mod, ans %= mod;
}
cout << ans << endl;
return 0;
} else {
cout << 0 << endl;
return 0;
}
} else {
for (int i = 0; i < k; ++i) {
ans *= c[i], ans %= mod;
}
cout << ans << endl;
return 0;
}
}
} else {
int al = 0, cl = 0;
ll ans = 1;
if (k & 1) {
ans *= a[al++];
k--;
while (k > 1) {
if (cl + 2 > c.size() || a[al] * a[al + 1] > c[cl] * c[cl + 1])
ans *= a[al] % mod * a[al + 1] % mod, ans %= mod, al += 2;
else
ans *= c[cl] % mod * c[cl + 1] % mod, ans += mod, ans %= mod,
cl += 2;
k -= 2;
}
} else {
while (k) {
if (cl + 2 > c.size() || a[al] * a[al + 1] > c[cl] * c[cl + 1])
ans *= a[al] % mod * a[al + 1] % mod, ans %= mod, al += 2;
else
ans *= c[cl] % mod * c[cl + 1] % mod, ans += mod, ans %= mod,
cl += 2;
k -= 2;
}
}
cout << ans << endl;
return 0;
}
}
}
| delete | 81 | 82 | 81 | 81 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll, ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll, ll>>>
#define PL pair<ll, ll>
#define ALL(v) (v).begin(), (v).end()
ll d1[4] = {1, -1, 0, 0};
ll d2[4] = {0, 0, 1, -1};
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n), neg, pos;
rep(i, 0, n) {
cin >> a[i];
if (a[i] <= 0)
neg.push_back(a[i]);
else
pos.push_back(a[i]);
}
sort(ALL(neg));
sort(ALL(pos));
constexpr ll mod = 1000000000 + 7;
// n == k
if (n == k) {
ll ans = 1;
rep(i, 0, k) ans = (ans * a[i]) % mod;
ans = (ans + mod) % mod;
cout << ans << endl;
return 0;
}
// all negative or zero
if (pos.empty()) {
ll ans = 1;
if (k % 2 == 1)
reverse(neg.begin(), neg.end());
rep(i, 0, k) ans = (ans * neg[i]) % mod;
ans = (ans + mod) % mod;
cout << ans << endl;
return 0;
}
cerr << "exp" << endl;
// こんときは必ず正の値にすることができる気がする？
ll pi = pos.size() - 1, ni = 0;
ll ans = 1;
if (k % 2 == 1) {
ans *= pos[pos.size() - 1];
ans %= mod;
k--;
pi -= 1;
}
rep(i, 0, k / 2) {
ll tp = -1, tn = -1;
if (pi > 0)
tp = pos[pi] * pos[pi - 1];
if (ni < neg.size() - 1)
tn = neg[ni] * neg[ni + 1];
if (tp > tn) {
ans *= tp % mod;
pi -= 2;
} else {
ans *= tn % mod;
ni += 2;
}
ans %= mod;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll, ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll, ll>>>
#define PL pair<ll, ll>
#define ALL(v) (v).begin(), (v).end()
ll d1[4] = {1, -1, 0, 0};
ll d2[4] = {0, 0, 1, -1};
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n), neg, pos;
rep(i, 0, n) {
cin >> a[i];
if (a[i] <= 0)
neg.push_back(a[i]);
else
pos.push_back(a[i]);
}
sort(ALL(neg));
sort(ALL(pos));
constexpr ll mod = 1000000000 + 7;
// n == k
if (n == k) {
ll ans = 1;
rep(i, 0, k) ans = (ans * a[i]) % mod;
ans = (ans + mod) % mod;
cout << ans << endl;
return 0;
}
// all negative or zero
if (pos.empty()) {
ll ans = 1;
if (k % 2 == 1)
reverse(neg.begin(), neg.end());
rep(i, 0, k) ans = (ans * neg[i]) % mod;
ans = (ans + mod) % mod;
cout << ans << endl;
return 0;
}
if (neg.empty()) {
ll ans = 1;
reverse(pos.begin(), pos.end());
rep(i, 0, k) ans = (ans * pos[i]) % mod;
ans = (ans + mod) % mod;
cout << ans << endl;
return 0;
}
cerr << "exp" << endl;
// こんときは必ず正の値にすることができる気がする？
ll pi = pos.size() - 1, ni = 0;
ll ans = 1;
if (k % 2 == 1) {
ans *= pos[pos.size() - 1];
ans %= mod;
k--;
pi -= 1;
}
rep(i, 0, k / 2) {
ll tp = -1, tn = -1;
if (pi > 0)
tp = pos[pi] * pos[pi - 1];
if (ni < neg.size() - 1)
tn = neg[ni] * neg[ni + 1];
if (tp > tn) {
ans *= tp % mod;
pi -= 2;
} else {
ans *= tn % mod;
ni += 2;
}
ans %= mod;
}
cout << ans << endl;
return 0;
} | insert | 47 | 47 | 47 | 55 | 0 | exp
|
p02616 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &V) {
for (int i = 0; i < V.size(); i++) {
out << V[i];
if (i != V.size() - 1)
out << " ";
}
return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<vector<T>> &Mat) {
for (int i = 0; i < Mat.size(); i++) {
if (i != 0)
out << endl;
out << Mat[i];
}
return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &mp) {
out << "{ ";
for (auto it = mp.begin(); it != mp.end(); it++) {
out << it->first << ":" << it->second;
if (mp.size() - 1 != distance(mp.begin(), it))
out << ", ";
}
out << " }";
return out;
}
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);
}
/*
<url:>
問題文============================================================
=================================================================
解説=============================================================
================================================================
*/
const ll MOD = 1e9 + 7;
// a^b % MOD;
ll powmod(ll a, ll b) {
ll res = 1;
a %= MOD;
for (; b; b >>= 1) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
}
return res;
}
// 逆元 1/a % MOD
ll inversemod(ll a) { return powmod(a, MOD - 2); }
template <class Type> Type solve(Type res = Type()) {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (auto &in : A)
cin >> in;
res = 1;
if (N == K) {
// 全部取る
for (int i = 0; i < N; i++) {
res *= A[i];
res = (res % MOD + MOD) % MOD;
}
return res;
}
if (A.back() < 0) {
// 全部負となる場合
if (K % 2 == 0) {
// 偶数なら絶対値が大きい順 := 正
sort(A.begin(), A.end());
for (int i = 0; i < K; i++) {
res *= A[i];
res = (res % MOD + MOD) % MOD;
}
} else {
// 奇数なら絶対値が小さい順 := 負
sort(A.rbegin(), A.rend());
for (int i = 0; i < K; i++) {
res *= A[i];
res = (res % MOD + MOD) % MOD;
}
}
return res;
}
// 正が少なくとも1個あるので、必ず正にできる
vector<ll> pos, neg;
for (int i = 0; i < N; i++) {
if (A[i] >= 0)
pos.emplace_back(A[i]);
else
neg.emplace_back(-A[i]);
}
auto mul_val = [&](ll &T, ll V) {
T *= V;
T = (T % MOD + MOD) % MOD;
};
pos.emplace_back(-INF);
pos.emplace_back(-INF);
neg.emplace_back(-INF);
neg.emplace_back(-INF);
sort(pos.begin(), pos.end());
sort(neg.begin(), neg.end());
for (int k = 0; k < K;) {
ll x1 = pos.back();
pos.pop_back();
ll x2 = pos.back();
pos.pop_back();
ll y1 = neg.back();
neg.pop_back();
ll y2 = neg.back();
neg.pop_back();
if (k == K - 1) {
mul_val(res, x1);
k++;
} else {
if (x2 == -INF) {
mul_val(res, -y1);
mul_val(res, -y2);
k += 2;
} else if (y2 == -INF) {
mul_val(res, x1);
k++;
} else {
if (x1 * x2 >= y1 * y2) {
mul_val(res, x1);
k++;
} else {
mul_val(res, -y1);
mul_val(res, -y2);
k += 2;
}
}
}
}
return res;
}
int main(void) {
cin.tie(0);
ios_base::sync_with_stdio(false);
// solve(0);
cout << fixed << setprecision(15) << solve<ll>() << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &V) {
for (int i = 0; i < V.size(); i++) {
out << V[i];
if (i != V.size() - 1)
out << " ";
}
return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<vector<T>> &Mat) {
for (int i = 0; i < Mat.size(); i++) {
if (i != 0)
out << endl;
out << Mat[i];
}
return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &mp) {
out << "{ ";
for (auto it = mp.begin(); it != mp.end(); it++) {
out << it->first << ":" << it->second;
if (mp.size() - 1 != distance(mp.begin(), it))
out << ", ";
}
out << " }";
return out;
}
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);
}
/*
<url:>
問題文============================================================
=================================================================
解説=============================================================
================================================================
*/
const ll MOD = 1e9 + 7;
// a^b % MOD;
ll powmod(ll a, ll b) {
ll res = 1;
a %= MOD;
for (; b; b >>= 1) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
}
return res;
}
// 逆元 1/a % MOD
ll inversemod(ll a) { return powmod(a, MOD - 2); }
template <class Type> Type solve(Type res = Type()) {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (auto &in : A)
cin >> in;
sort(A.begin(), A.end(),
[](const ll a, const ll b) { return abs(a) > abs(b); });
ll mul = 1, plus = 0, minus = 0;
for (int i = 0; i < K; i++) {
if (A[i] < 0)
minus++;
if (A[i] > 0)
plus++;
if (A[i] == 0) {
return 0;
}
mul *= A[i];
mul = (mul % MOD + MOD) % MOD;
}
if (minus % 2 == 0 or N == K) {
return mul;
}
int neg = 0;
for (auto e : A)
if (e < 0)
neg++;
if (neg == N) {
sort(A.rbegin(), A.rend());
mul = 1;
for (int i = 0; i < K; i++) {
mul *= A[i];
mul = (mul % MOD + MOD) % MOD;
}
return mul;
}
// plus の中で最も小さいものを、K 個範囲外の minus と交換
// minus の中で最も小さいものを、K 個範囲外の plus と交換
ll ans = mul;
ll a1 = -1, b1 = -1;
if (plus > 0) {
ll min_v = LINF;
for (int i = 0; i < K; i++) {
if (A[i] <= 0)
continue;
min_v = min(min_v, abs(A[i]));
}
a1 = min_v;
ll max_v = -LINF;
for (ll i = K; i < N; i++) {
if (A[i] > 0)
continue;
max_v = max(max_v, abs(A[i]));
}
b1 = max_v;
}
ll a2 = -1, b2 = -1;
if (minus > 0) {
ll min_v = LINF;
for (int i = 0; i < K; i++) {
if (A[i] >= 0)
continue;
min_v = min(min_v, abs(A[i]));
}
a2 = min_v;
ll max_v = -LINF;
for (ll i = K; i < N; i++) {
if (A[i] < 0)
continue;
max_v = max(max_v, abs(A[i]));
}
b2 = max_v;
}
if (a1 >= 0 and a2 >= 0 and b1 >= 0 and b2 >= 0) {
ans = MOD - ans;
ans %= MOD;
// a1, b1
if (b1 * a2 > b2 * a1) {
ans *= inversemod(a1);
ans %= MOD;
ans *= b1;
ans %= MOD;
}
// a2, b2
else {
ans *= inversemod(a2);
ans %= MOD;
ans *= b2;
ans %= MOD;
}
} else if (a1 >= 0 and b1 >= 0) {
ans = MOD - ans;
ans %= MOD;
ans *= inversemod(a1);
ans %= MOD;
ans *= b1;
ans %= MOD;
} else if (a2 >= 0 and b2 >= 0) {
ans = MOD - ans;
ans %= MOD;
ans *= inversemod(a2);
ans %= MOD;
ans *= b2;
ans %= MOD;
}
res = ans;
return res;
}
int main(void) {
cin.tie(0);
ios_base::sync_with_stdio(false);
// solve(0);
cout << fixed << setprecision(15) << solve<ll>() << endl;
return 0;
}
| replace | 84 | 168 | 84 | 194 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#define drep(i, cc, n) for (int i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define drrep(i, cc, n) for (int i = (cc); i >= (n); --i)
#define rrep(i, n) drrep(i, 0, n - 1)
#define sz(s) (int)(s.size())
#define vecprint(v) \
rep(i, v.size()) if (i == 0) cout << v[i]; \
else cout << " " << v[i]; \
cout << endl;
#define arrprint(v, n) \
rep(i, n) if (i == 0) cout << v[i]; \
else cout << " " << v[i]; \
cout << endl;
#define matprint(v, n, m) \
rep(i, n) { \
rep(j, m) { cout << v[i][j] << " "; } \
cout << endl; \
}
#define SORT(v) sort(v.begin(), v.end())
#define REV(v) reverse(v.begin(), v.end())
using namespace std;
const int mod = 1000000007;
const int INF = 1001001001;
using ll = long long;
using P = pair<int, int>;
template <typename T>
using priority_queue_rev =
priority_queue<T, vector<T>, greater<T>>; // 小さいものから取り出す
//*---mint---*/
struct mint {
ll x;
mint() : x(0) {}
mint(ll x) : x((x % mod + mod) % mod) {}
// mint(ll x):x(x){}
mint &fix() {
x = (x % mod + mod) % mod;
return *this;
}
mint operator-() const { return mint(0) - *this; }
mint operator~() const { return mint(1) / *this; }
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) {
(x *= a.pow(mod - 2).x) %= mod;
return *this;
}
mint operator+(const mint &a) const { return mint(*this) += a; }
mint operator-(const mint &a) const { return mint(*this) -= a; }
mint operator*(const mint &a) const { return mint(*this) *= a; }
mint operator/(const mint &a) const { return mint(*this) /= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint res = pow(t / 2);
res *= res;
return (t & 1) ? res * x : res;
}
bool operator<(const mint &a) const { return x < a.x; }
bool operator==(const mint &a) const { return x == a.x; }
};
mint ex(mint x, ll t) { return x.pow(t); }
istream &operator>>(istream &i, mint &a) {
i >> a.x;
return i;
}
ostream &operator<<(ostream &o, const mint &a) {
o << a.x;
return o;
}
typedef vector<mint> vm;
struct comb {
vm f, g;
comb() {}
comb(int mx) : f(mx + 1), g(mx + 1) {
f[0] = 1;
drep(i, 1, mx) f[i] = f[i - 1] * i;
g[mx] = f[mx].pow(mod - 2);
for (int i = mx; i > 0; i--)
g[i - 1] = g[i] * i;
}
mint c(int a, int b) {
if (a < b)
return 0;
return f[a] * g[b] * g[a - b];
}
} c(3e6);
// c.c(a,b)=>aCb mod
int main() {
int n, k;
cin >> n >> k;
mint ans = 1;
vector<ll> a(n), ap, am, az;
rep(i, n) cin >> a[i];
int apn = 0, amn = 0, azn = 0;
rep(i, n) {
if (a[i] > 0) {
ap.push_back(a[i]);
apn++;
}
if (a[i] < 0) {
am.push_back(a[i]);
amn++;
}
if (a[i] == 0) {
az.push_back(a[i]);
azn++;
}
}
SORT(ap);
REV(ap);
SORT(am);
int pi = 0, mi = 0;
if (k > 2 * (apn / 2 + amn / 2)) {
if (k - 2 * (apn / 2 + amn / 2) == 1 && apn % 2 == 1) {
ans = ap[0];
k--;
pi++;
} else if (azn > 0) {
cout << 0 << endl;
return 0;
} else {
REV(am);
REV(ap);
ans = ap[0] * am[0];
k -= 2;
pi++;
mi++;
}
} else if (k % 2 == 1) {
if (apn > 0) {
ans = ap[0];
k--;
pi++;
} else if (azn > 0) {
ans = 0;
k--;
} else {
REV(am);
ans = am[0];
k--;
mi++;
}
}
while (k) {
ll p2, m2;
if (pi + 1 > apn - 1)
p2 = -1;
else
p2 = ap[pi] * ap[pi + 1];
if (mi + 1 > amn - 1)
m2 = -1;
else
m2 = am[mi] * am[mi + 1];
// cout << p2 << " " << m2 << endl;
if (p2 > m2) {
ans *= p2;
pi += 2;
} else {
ans *= m2;
mi += 2;
}
k -= 2;
}
cout << ans << endl;
// printf("%.10f\n",ans);
return 0;
} | #include <bits/stdc++.h>
#define drep(i, cc, n) for (int i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define drrep(i, cc, n) for (int i = (cc); i >= (n); --i)
#define rrep(i, n) drrep(i, 0, n - 1)
#define sz(s) (int)(s.size())
#define vecprint(v) \
rep(i, v.size()) if (i == 0) cout << v[i]; \
else cout << " " << v[i]; \
cout << endl;
#define arrprint(v, n) \
rep(i, n) if (i == 0) cout << v[i]; \
else cout << " " << v[i]; \
cout << endl;
#define matprint(v, n, m) \
rep(i, n) { \
rep(j, m) { cout << v[i][j] << " "; } \
cout << endl; \
}
#define SORT(v) sort(v.begin(), v.end())
#define REV(v) reverse(v.begin(), v.end())
using namespace std;
const int mod = 1000000007;
const int INF = 1001001001;
using ll = long long;
using P = pair<int, int>;
template <typename T>
using priority_queue_rev =
priority_queue<T, vector<T>, greater<T>>; // 小さいものから取り出す
//*---mint---*/
struct mint {
ll x;
mint() : x(0) {}
mint(ll x) : x((x % mod + mod) % mod) {}
// mint(ll x):x(x){}
mint &fix() {
x = (x % mod + mod) % mod;
return *this;
}
mint operator-() const { return mint(0) - *this; }
mint operator~() const { return mint(1) / *this; }
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) {
(x *= a.pow(mod - 2).x) %= mod;
return *this;
}
mint operator+(const mint &a) const { return mint(*this) += a; }
mint operator-(const mint &a) const { return mint(*this) -= a; }
mint operator*(const mint &a) const { return mint(*this) *= a; }
mint operator/(const mint &a) const { return mint(*this) /= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint res = pow(t / 2);
res *= res;
return (t & 1) ? res * x : res;
}
bool operator<(const mint &a) const { return x < a.x; }
bool operator==(const mint &a) const { return x == a.x; }
};
mint ex(mint x, ll t) { return x.pow(t); }
istream &operator>>(istream &i, mint &a) {
i >> a.x;
return i;
}
ostream &operator<<(ostream &o, const mint &a) {
o << a.x;
return o;
}
typedef vector<mint> vm;
struct comb {
vm f, g;
comb() {}
comb(int mx) : f(mx + 1), g(mx + 1) {
f[0] = 1;
drep(i, 1, mx) f[i] = f[i - 1] * i;
g[mx] = f[mx].pow(mod - 2);
for (int i = mx; i > 0; i--)
g[i - 1] = g[i] * i;
}
mint c(int a, int b) {
if (a < b)
return 0;
return f[a] * g[b] * g[a - b];
}
} c(3e6);
// c.c(a,b)=>aCb mod
int main() {
int n, k;
cin >> n >> k;
mint ans = 1;
vector<ll> a(n), ap, am, az;
rep(i, n) cin >> a[i];
int apn = 0, amn = 0, azn = 0;
rep(i, n) {
if (a[i] > 0) {
ap.push_back(a[i]);
apn++;
}
if (a[i] < 0) {
am.push_back(a[i]);
amn++;
}
if (a[i] == 0) {
az.push_back(a[i]);
azn++;
}
}
SORT(ap);
REV(ap);
SORT(am);
int pi = 0, mi = 0;
if (k > 2 * (apn / 2 + amn / 2)) {
if (k - 2 * (apn / 2 + amn / 2) == 1 && apn % 2 == 1) {
ans = ap[0];
k--;
pi++;
} else if (k - 2 * (apn / 2 + amn / 2) == 1 && amn % 2 == 1) {
REV(am);
REV(ap);
ans = am[0];
k--;
mi++;
} else if (azn > 0) {
cout << 0 << endl;
return 0;
} else {
REV(am);
REV(ap);
ans = ap[0] * am[0];
k -= 2;
pi++;
mi++;
}
} else if (k % 2 == 1) {
if (apn > 0) {
ans = ap[0];
k--;
pi++;
} else if (azn > 0) {
ans = 0;
k--;
} else {
REV(am);
ans = am[0];
k--;
mi++;
}
}
while (k) {
ll p2, m2;
if (pi + 1 > apn - 1)
p2 = -1;
else
p2 = ap[pi] * ap[pi + 1];
if (mi + 1 > amn - 1)
m2 = -1;
else
m2 = am[mi] * am[mi + 1];
// cout << p2 << " " << m2 << endl;
if (p2 > m2) {
ans *= p2;
pi += 2;
} else {
ans *= m2;
mi += 2;
}
k -= 2;
}
cout << ans << endl;
// printf("%.10f\n",ans);
return 0;
} | insert | 132 | 132 | 132 | 138 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
#define REP(k, n) for (ll k = 0; k < (ll)(n); ++k)
#define REPREV(k, n) for (ll k = (ll)(n)-1; k >= 0; --k)
#define FOR(k, a, b) for (ll k = (ll)(a); k < (ll)(b); ++k)
#define FORREV(k, a, b) for (ll k = (ll)(b)-1; k >= (ll)(a); --k)
#define FOREACH(e, v) for (auto &e : v)
#define TGET(t, i) get<i>(t)
#define TSET(t, i, a) get<i>(t) = a
// MinHeap - priority_queue<ll, vll, greater<ll>> pq;
#define EVEN(n) ((n)&1) == 0
#define ODD(n) ((n)&1) == 1
#define SORT(v) sort(v.begin(), v.end())
#define SORTREV(v) sort(v.rbegin(), v.rend())
#define SHUFFLE(v) random_shuffle(v.begin(), v.end())
// srand(unsigned(time(0)));
#define REMOVEAT(v, i) v.erase(v.begin() + i)
#define REVERSE(v) reverse(v.begin(), v.end())
ll MOD(ll x, ll m) {
ll r = x % m;
if (r < 0) {
r += m;
}
return r;
}
ostream &operator<<(ostream &str, const pll &p) {
str << p.first << " " << p.second;
return str;
}
template <typename T> void join(T &arr, string sep) {
bool first = true;
for (auto t : arr) {
if (first) {
first = false;
cout << t;
} else {
cout << sep << t;
}
}
cout << "\n";
}
#define POS "POSSIBLE"
#define IMPOS "IMPOSSIBLE"
// #define INF LLONG_MAX
// #define MINF LLONG_MIN
#define INF 9e18
#define MINF -INF
const ll md = 1e9 + 7;
void add_self(ll &a, ll b) { a = MOD((a + b), md); }
void sub_self(ll &a, ll b) { a = MOD((a - b), md); }
void mul_self(ll &a, ll b) { a = MOD((a * MOD(b, md)), md); }
void solve() {
ll n, k;
cin >> n >> k;
vll a(n);
vll pos;
vll neg;
vll zeros;
REP(i, n) {
cin >> a[i];
if (a[i] > 0) {
pos.push_back(a[i]);
} else if (a[i] < 0) {
neg.push_back(a[i]);
} else {
zeros.push_back(a[i]);
}
}
ll negSize = neg.size();
ll posSize = pos.size();
if (k > posSize + negSize) {
cout << "0\n";
return;
}
SORTREV(pos);
SORT(neg);
if (k > posSize && (((k - posSize) % 2) == 1)) {
if (!pos.empty()) {
pos.pop_back();
posSize--;
} else {
if (!zeros.empty()) {
cout << "0\n";
return;
}
ll res = 1;
REP(i, k) { mul_self(res, neg.end()[-(i + 1)]); }
cout << res << "\n";
return;
}
}
vll posNeg;
for (ll i = 0; i < negSize - 1; i += 2) {
posNeg.push_back(neg[i] * neg[i + 1]);
}
ll posNegSize = posNeg.size();
ll res = 1;
ll i = 0;
ll j = 0;
while (k > 0) {
if (k == 1) {
assert(i < posSize);
mul_self(res, pos[i++]);
k--;
continue;
}
if (j >= posNegSize) {
assert(i < posSize);
mul_self(res, pos[i++]);
k--;
continue;
}
if (i >= posSize) {
assert(j < posNegSize);
mul_self(res, posNeg[j++]);
k -= 2;
continue;
}
if (i < posSize - 1) {
ll t = pos[i] * pos[i + 1];
if (t < posNeg[j]) {
mul_self(res, posNeg[j++]);
k -= 2;
continue;
}
mul_self(res, t);
k -= 2;
i += 2;
continue;
}
if (pos[i] < posNeg[j]) {
mul_self(res, posNeg[j++]);
k -= 2;
continue;
}
mul_self(res, a[i++]);
k--;
}
assert(k == 0);
// cout << fixed << setprecision(6);
cout << res << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt = 1;
// cin >> tt;
for (int t = 1; t <= tt; t++) {
// cout << "Case #" << t << ": ";
solve();
}
// cin.rdbuf()->in_avail()
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
#define REP(k, n) for (ll k = 0; k < (ll)(n); ++k)
#define REPREV(k, n) for (ll k = (ll)(n)-1; k >= 0; --k)
#define FOR(k, a, b) for (ll k = (ll)(a); k < (ll)(b); ++k)
#define FORREV(k, a, b) for (ll k = (ll)(b)-1; k >= (ll)(a); --k)
#define FOREACH(e, v) for (auto &e : v)
#define TGET(t, i) get<i>(t)
#define TSET(t, i, a) get<i>(t) = a
// MinHeap - priority_queue<ll, vll, greater<ll>> pq;
#define EVEN(n) ((n)&1) == 0
#define ODD(n) ((n)&1) == 1
#define SORT(v) sort(v.begin(), v.end())
#define SORTREV(v) sort(v.rbegin(), v.rend())
#define SHUFFLE(v) random_shuffle(v.begin(), v.end())
// srand(unsigned(time(0)));
#define REMOVEAT(v, i) v.erase(v.begin() + i)
#define REVERSE(v) reverse(v.begin(), v.end())
ll MOD(ll x, ll m) {
ll r = x % m;
if (r < 0) {
r += m;
}
return r;
}
ostream &operator<<(ostream &str, const pll &p) {
str << p.first << " " << p.second;
return str;
}
template <typename T> void join(T &arr, string sep) {
bool first = true;
for (auto t : arr) {
if (first) {
first = false;
cout << t;
} else {
cout << sep << t;
}
}
cout << "\n";
}
#define POS "POSSIBLE"
#define IMPOS "IMPOSSIBLE"
// #define INF LLONG_MAX
// #define MINF LLONG_MIN
#define INF 9e18
#define MINF -INF
const ll md = 1e9 + 7;
void add_self(ll &a, ll b) { a = MOD((a + b), md); }
void sub_self(ll &a, ll b) { a = MOD((a - b), md); }
void mul_self(ll &a, ll b) { a = MOD((a * MOD(b, md)), md); }
void solve() {
ll n, k;
cin >> n >> k;
vll a(n);
vll pos;
vll neg;
vll zeros;
REP(i, n) {
cin >> a[i];
if (a[i] > 0) {
pos.push_back(a[i]);
} else if (a[i] < 0) {
neg.push_back(a[i]);
} else {
zeros.push_back(a[i]);
}
}
ll negSize = neg.size();
ll posSize = pos.size();
if (k > posSize + negSize) {
cout << "0\n";
return;
}
if (k == n) {
ll res = 1;
REP(i, n) { mul_self(res, a[i]); }
cout << res << "\n";
return;
}
if (k == posSize + negSize) {
if (negSize % 2 == 1) {
cout << "0\n";
return;
}
ll res = 1;
REP(i, posSize) { mul_self(res, pos[i]); }
REP(i, negSize) { mul_self(res, neg[i]); }
cout << res << "\n";
return;
}
SORTREV(pos);
SORT(neg);
if (k > posSize && (((k - posSize) % 2) == 1)) {
if (!pos.empty()) {
pos.pop_back();
posSize--;
} else {
if (!zeros.empty()) {
cout << "0\n";
return;
}
ll res = 1;
REP(i, k) { mul_self(res, neg.end()[-(i + 1)]); }
cout << res << "\n";
return;
}
}
vll posNeg;
for (ll i = 0; i < negSize - 1; i += 2) {
posNeg.push_back(neg[i] * neg[i + 1]);
}
ll posNegSize = posNeg.size();
ll res = 1;
ll i = 0;
ll j = 0;
while (k > 0) {
if (k == 1) {
assert(i < posSize);
mul_self(res, pos[i++]);
k--;
continue;
}
if (j >= posNegSize) {
assert(i < posSize);
mul_self(res, pos[i++]);
k--;
continue;
}
if (i >= posSize) {
assert(j < posNegSize);
mul_self(res, posNeg[j++]);
k -= 2;
continue;
}
if (i < posSize - 1) {
ll t = pos[i] * pos[i + 1];
if (t < posNeg[j]) {
mul_self(res, posNeg[j++]);
k -= 2;
continue;
}
mul_self(res, t);
k -= 2;
i += 2;
continue;
}
if (pos[i] < posNeg[j]) {
mul_self(res, posNeg[j++]);
k -= 2;
continue;
}
mul_self(res, a[i++]);
k--;
}
assert(k == 0);
// cout << fixed << setprecision(6);
cout << res << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt = 1;
// cin >> tt;
for (int t = 1; t <= tt; t++) {
// cout << "Case #" << t << ": ";
solve();
}
// cin.rdbuf()->in_avail()
return 0;
} | insert | 99 | 99 | 99 | 118 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-12;
struct mint {
ll x;
mint(ll 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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct edge {
ll to, cost;
tuple<ll, ll> get_value() { return make_tuple(to, cost); }
};
struct BigInt {
string num;
ll mod(ll _mod) {
ll l = num.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = num[l - 1 - idx] - '0';
val += (m * tenth) % _mod;
val %= _mod;
tenth *= 10;
tenth %= _mod;
idx++;
}
return val;
}
ll digits() { return num.length(); }
bool operator<(BigInt &n2) const {
if (num.length() < n2.digits())
return true;
else if (num.length() > n2.digits())
return false;
return num < n2.num;
}
bool operator>(BigInt &n2) const {
if (num.length() > n2.digits())
return true;
else if (num.length() < n2.digits())
return false;
return num > n2.num;
}
};
struct fpoint {
ld x = 0;
ld y = 0;
bool operator<(const fpoint &p) const {
if (x == p.x)
return y < p.y;
return x < p.x;
}
bool operator==(const fpoint &p) const {
if (p.x - EPS < x && x < p.x + EPS && p.y - EPS < y && y < p.y + EPS)
return true;
return false;
}
bool operator!=(const fpoint &p) const {
if (p.x - EPS > x || x > p.x + EPS || p.y - EPS > y || y > p.y + EPS)
return true;
return false;
}
fpoint &operator+=(const ld a) {
x += a, y += a;
return *this;
}
fpoint &operator-=(const ld a) {
x -= a, y -= a;
return *this;
}
fpoint &operator*=(const ld a) {
x *= a, y *= a;
return *this;
}
fpoint &operator/=(const ld a) {
x /= a, y /= a;
return *this;
}
fpoint &operator+=(const fpoint p) {
x += p.x, y += p.y;
return *this;
}
fpoint &operator-=(const fpoint p) {
x -= p.x, y -= p.y;
return *this;
}
fpoint &operator*=(const fpoint p) {
x *= p.x, y *= p.y;
return *this;
}
fpoint &operator/=(const fpoint p) {
x /= p.x, y /= p.y;
return *this;
}
fpoint operator+(const fpoint p) const { return fpoint(*this) += p; }
fpoint operator-(const fpoint p) const { return fpoint(*this) -= p; }
fpoint operator*(const fpoint p) const { return fpoint(*this) *= p; }
fpoint operator/(const fpoint p) const { return fpoint(*this) /= p; }
fpoint operator+(const ld a) const { return fpoint(*this) += a; }
fpoint operator-(const ld a) const { return fpoint(*this) -= a; }
fpoint operator*(const ld a) const { return fpoint(*this) *= a; }
fpoint operator/(const ld a) const { return fpoint(*this) /= a; }
ld dot(const fpoint &p) const { return x * p.x + y * p.y; }
ll cross(const fpoint &p) const { return x * p.y - y * p.x; }
ld squared_norm() const { return x * x + y * y; }
ld norm() const { return sqrt(x * x + y * y); }
tuple<ld, ld> get_value() { return make_tuple(x, y); }
ll which_quadrant() const {
if (abs(x) < EPS && abs(y) < EPS)
return 0;
if (y > 0)
return x > 0 ? 1 : 2;
return x < 0 ? 3 : 4;
}
bool is_zero() {
fpoint z = {0, 0};
return z == *this;
}
};
struct point {
ll x = 0;
ll y = 0;
bool operator<(const point &p) const {
if (x == p.x)
return y < p.y;
return x < p.x;
}
bool operator==(const point &p) const {
if (x == p.x && y == p.y)
return true;
return false;
}
bool operator!=(const point &p) const {
if (x != p.x || y != p.y)
return true;
return false;
}
point &operator+=(const ll a) {
x += a, y += a;
return *this;
}
point &operator-=(const ll a) {
x -= a, y -= a;
return *this;
}
point &operator*=(const ll a) {
x *= a, y *= a;
return *this;
}
point &operator+=(const point p) {
x += p.x, y += p.y;
return *this;
}
point &operator-=(const point p) {
x -= p.x, y -= p.y;
return *this;
}
point &operator*=(const point p) {
x *= p.x, y *= p.y;
return *this;
}
void operator++(int) { x++, y++; }
void operator++() { x++, y++; }
void operator--(int) { x--, y--; }
void operator--() { x--, y--; }
point operator+(const point p) const { return point(*this) += p; }
point operator-(const point p) const { return point(*this) -= p; }
point operator*(const point p) const { return point(*this) *= p; }
point operator+(const ll a) const { return point(*this) += a; }
point operator-(const ll a) const { return point(*this) -= a; }
point operator*(const ll a) const { return point(*this) *= a; }
ll dot(const point &p) const { return x * p.x + y * p.y; }
ll cross(const point &p) const { return x * p.y - y * p.x; }
ll squared_norm() const { return x * x + y * y; }
tuple<ll, ll> get_value() { return make_tuple(x, y); }
ll which_quadrant() const {
if (x == 0 && y == 0)
return 0;
if (x >= 0 && y >= 0)
return 1;
else if (x <= 0 && y >= 0)
return 2;
else if (x <= 0 && y <= 0)
return 3;
else
return 4;
}
bool is_zero() {
point z = {0, 0};
return z == *this;
}
fpoint to_fpoint() {
fpoint ret = {ld(x), ld(y)};
return ret;
}
};
struct {
template <typename T> bool operator()(const T p1, const T p2) const {
ll q1 = p1.which_quadrant();
ll q2 = p2.which_quadrant();
if (q1 != q2)
return q1 < q2;
// judge for parallel lines
// if p1 cross p2 > 0 -> sin arg(p1 -> o -> p2) > 0
return p1.cross(p2) > 0;
}
} angle_comparator;
struct undirected_edge {
ll from;
ll to;
ll cost;
bool operator<(const undirected_edge &ue) const { return cost < ue.cost; }
tuple<ll, ll, ll> get_value() { return make_tuple(from, to, cost); }
};
struct event {
ll loc, val, sgn;
bool operator<(const event &e) const {
if (loc == e.loc)
return sgn == 1;
return loc < e.loc;
}
bool operator>(const event &e) const {
if (loc == e.loc)
return sgn == -1;
return loc > e.loc;
}
tuple<ll, ll, ll> get_value() { return make_tuple(loc, val, sgn); }
};
typedef std::pair<ll, ll> pl;
typedef std::tuple<ll, ll, ll> tp3;
typedef std::tuple<ll, ll, ll, ll> tp4;
typedef std::vector<ll> vl;
typedef std::vector<vl> vl2;
typedef std::vector<vl2> vl3;
typedef std::vector<vl3> vl4;
typedef std::vector<mint> vmi;
typedef std::vector<vmi> vmi2;
typedef std::vector<vmi2> vmi3;
typedef std::vector<vmi3> vmi4;
typedef std::vector<bool> vb;
typedef std::vector<vb> vb2;
typedef std::vector<vb2> vb3;
typedef std::vector<vb3> vb4;
typedef std::vector<pl> vpl;
typedef std::vector<tp3> vtp3;
typedef std::vector<tp4> vtp4;
typedef std::vector<point> points;
typedef std::vector<fpoint> fpoints;
// priority queue. Taking from the higher value. Don't forget calling !q.empty()
typedef std::priority_queue<ll> pq;
// priority queue. Taking from the lower value
typedef std::priority_queue<ll, vl, greater<ll>> pql;
typedef std::vector<vector<edge>> Graph;
const ll N_DIGITS = 60;
const long double PI = 3.14159265358979323846;
const points dirs = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}, // four directions
{1, 1}, {-1, 1}, {-1, -1}, {1, -1}, // diagonal
{0, 0}}; // self
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(char c) { return string(1, c); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(mint a) { return to_string(a.x); }
string to_string(point p) {
return "{" + to_string(p.x) + ", " + to_string(p.y) + "}";
}
string to_string(fpoint p) {
return "{" + to_string(p.x) + ", " + to_string(p.y) + "}";
}
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)) + ")";
}
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 += "}";
return res;
}
template <typename T> string to_string(priority_queue<T> &q) {
priority_queue<T> copy;
bool first = true;
string res = "{";
while (!q.empty()) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(q.top());
copy.push(q.top());
q.pop();
}
swap(q, copy);
res += "}";
return res;
}
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 rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define revrep(i, n) for (ll(i) = n - 1; (i) >= 0; (i)--)
#define For(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define revFor(i, b, a) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define isNum(c) (0 <= (c) - '0' && (c) - '0' <= 9)
#define toLower(c) char((c) + 0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pr(a) std::cout << (a)
#define prl(a) std::cout << (a) << endl
#define prl2(a, b) std::cout << (a) << " " << (b) << endl
#define prl3(a, b, c) std::cout << (a) << " " << (b) << " " << (c) << endl
#define prl4(a, b, c, d) \
std::cout << (a) << " " << (b) << " " << (c) << " " << (d) << endl
#define prs(a) std::cout << (a) << " "
#define prs2(a, b) std::cout << (a) << " " << (b) << " "
#define prs3(a, b, c) std::cout << (a) << " " << (b) << " " << (c) << " "
#define prs4(a, b, c, d) \
std::cout << (a) << " " << (b) << " " << (c) << " " << (d) << " "
#define yn(condition) \
if ((condition)) \
prl("Yes"); \
else \
prl("No");
#define YN(condition) \
if ((condition)) \
prl("YES"); \
else \
prl("NO");
#define in1(a) cin >> (a)
#define in2(a, b) cin >> (a) >> (b)
#define in3(a, b, c) cin >> (a) >> (b) >> (c)
#define in4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define in5(a, b, c, d, e) cin >> (a) >> (b) >> (c) >> (d) >> (e)
#define in6(a, b, c, d, e, f) cin >> (a) >> (b) >> (c) >> (d) >> (e) >> (f)
#define in7(a, b, c, d, e, f, g) \
cin >> (a) >> (b) >> (c) >> (d) >> (e) >> (f) >> (g)
#define e1 first
#define e2 second
#define Forchar(c, a, z) for (char(c) = (a); (c) <= (z); (c)++)
#define cntchar(s, c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) \
std::cout << fixed << setprecision(digits) << (num) << endl;
#define prl_time(s) \
prl3("Elapsed Time:", 1000.0 * (clock() - s) / CLOCKS_PER_SEC, "[ms]");
#define char_to_str(c) string(1, (c))
#ifdef _LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
struct MaxFlow {
struct F_edge {
ll to, rev, capacity;
F_edge(ll to, ll rev, ll capacity) : to(to), rev(rev), capacity(capacity) {}
};
typedef vector<F_edge> F_edges;
vector<F_edges> graph;
ll n_vertex;
// level is the shortest path to get a given node from the source node.
vl level, iter;
MaxFlow(ll n_vertex) : n_vertex(n_vertex) { graph.resize(n_vertex); }
void add_edge(ll from, ll to, ll capacity) {
graph[from].pb({to, ll(graph[to].size()), capacity});
graph[to].pb({from, ll(graph[from].size()) - 1, 0});
}
void bfs(ll source) {
level = vl(n_vertex, -1);
level[source] = 0;
queue<ll> q;
q.push(source);
while (!q.empty()) {
ll vertex = q.front();
q.pop();
rep(i, graph[vertex].size()) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
// if the flow can be into the target node, implement below.
if (cap_target > 0 && level[target] < 0) {
level[target] = level[vertex] + 1;
q.push(target);
}
}
}
}
ll dfs(ll vertex, ll sink, ll flow) {
if (vertex == sink)
return flow;
for (ll &i = iter[vertex]; i < graph[vertex].size(); i++) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
ll rev_target = graph[vertex][i].rev;
// if capasitiy is not full yet and target is farther,
// then assign current flow.
if (cap_target > 0 && level[vertex] < level[target]) {
ll d = dfs(target, sink, min(cap_target, flow));
if (d > 0) { // if the flow successfully reaches the sink, reduce the
// flow from the capacity
graph[vertex][i].capacity -= d;
graph[target][rev_target].capacity += d;
return d;
}
}
}
return 0;
}
ll dinic(ll source, ll sink) {
// complexity O(EV^2)
ll flow = 0;
while (true) {
bfs(source);
// if there is no path leading to the sink, the maximum flow is 0.
if (level[sink] < 0)
return flow;
iter = vl(n_vertex, 0);
ll f;
while ((f = dfs(source, sink, INF)) > 0)
flow += f;
}
}
};
struct UnionFind {
vl parents, set_size;
set<ll> root_idx;
ll n_groups;
UnionFind(ll n) {
parents = set_size = vl(n);
n_groups = n;
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
root_idx.insert(i);
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
return parents[x] = root_find(parents[x]);
}
void unite(ll x, ll y) {
// priority for x is larger than that of y
x = root_find(x);
y = root_find(y);
if (x == y)
return;
parents[y] = x, set_size[x] += set_size[y];
root_idx.erase(y);
n_groups--;
}
bool is_same(ll x, ll y) { // connected or not
return root_find(x) == root_find(y);
}
ll size(ll x) { return set_size[root_find(x)]; }
ll num_union() const { return n_groups; }
};
struct Doubling { // ABC167D
ll n;
ll sz;
vl2 next;
/*
next[k + 1][i] := next[k][next[k][i]]
next[0][i] := edge[i]
e.g. a0, a1, ..., an-1 / 0 <= ai <= n - 1
a0 -> a[a0] -> a[a[a0]] -> ... -> a[a[...[a[0]]]] (m times)
Let the function repeatedly input a[i] m times be f[m](a[i])
- get(i, x) returns f[x](a[i])
- lower_bound(i, j) returns minimum x which satisfies f[x](a[i]) >= j.
if not possible returns n.
*/
// edge[i]: the step size for one iteration
Doubling(vl &edge) : n(edge.size()), sz(62) {
next.resize(sz, vl(n, -1));
rep(i, n) next[0][i] = edge[i];
rep(k, sz - 1) rep(i, n) next[k + 1][i] = next[k][next[k][i]];
}
ll get(ll i, ll x) {
ll ret = i;
rep(bit, sz) {
if (!(x >> bit & 1))
continue;
ret = next[bit][ret];
}
return ret;
}
ll lower_bound(ll i, ll j) {
ll cur = i, acc = 0;
revrep(wid, sz) {
if (next[wid][cur] < j) {
acc += 1LL << wid;
cur = next[wid][cur];
}
}
return min(n, acc + 1);
}
};
class LowestCommonAncestor {
public:
ll N, logN;
vl depth, len;
Graph tree;
vl2 parents;
LowestCommonAncestor(ll n, ll offset = -1, bool is_weighted = true) {
N = n;
logN = 0;
while (N > (1LL << logN))
logN++;
depth = len = vl(N);
parents = vl2(logN, vl(N));
tree = Graph(N);
input(N, offset, is_weighted);
init(0, -1, 0, 0);
build();
}
void add_edge(ll from, ll to, ll dist) {
tree[from].pb({to, dist});
tree[to].pb({from, dist});
}
void input(ll n, ll offset = -1, bool is_weighted = true) {
rep(i, n - 1) {
ll a, b, d = 1;
in2(a, b);
a += offset, b += offset;
if (is_weighted)
in1(d);
add_edge(a, b, d);
}
}
void init(ll source, ll parent, ll d, ll l) {
depth[source] = d;
parents[0][source] = parent;
len[source] = l;
rep(i, tree[source].size()) {
ll target = tree[source][i].to;
ll cost = tree[source][i].cost;
if (target == parent)
continue;
init(target, source, d + 1, cost + l);
}
}
void build() {
rep(k, logN - 1) rep(n, N) {
// if there is no parent, -1.
// otherwise, the parent of the parent is the parent.
if (parents[k][n] < 0)
parents[k + 1][n] = -1;
else
parents[k + 1][n] = parents[k][parents[k][n]];
}
}
ll query(ll u, ll v) {
if (depth[u] > depth[v])
swap(u, v);
rep(k, logN) if ((depth[v] - depth[u]) >> k & 1) v = parents[k][v];
if (u == v)
return u;
revrep(k, logN) {
if (parents[k][u] != parents[k][v]) {
u = parents[k][u];
v = parents[k][v];
}
}
return parents[0][u];
}
ll distance(ll u, ll v) {
ll w = query(u, v);
return len[u] + len[v] - 2 * len[w];
}
};
struct BinaryIndexedTree {
ll n, ini;
vl dat;
BinaryIndexedTree(ll n, ll ini = 0) : dat(n + 1, ini), n(n), ini(ini){};
// x: 1001 1010 1100 1011 1101 1111
// x & - x: 0001 0010 0100 0001 0001 0001
// ->: 1010 1100 10000 1100 1100 10000
ll update_func(ll val, ll d) {
// if maximum -> max(val, dat)
// return max(val, d);
// if cumulative sum
return val + d;
}
ll query(ll i) {
/*
v[0] + v[1] + ... + v[i]
e.g.) i = 10101
itr1. 10101 -> 10100
itr2. 10100 -> 10000
itr3. 10000 -> 00000 (break)
*/
if (i < 0)
return ini;
ll ret = 0;
for (ll j = i; j >= 0; j = (j & (j + 1)) - 1) {
ret = update_func(ret, dat[j]);
}
return ret;
}
ll query(ll l, ll r) {
// a[l] + a[l + 1] + ... + a[r - 1] + a[r]
return query(r) - query(l - 1);
}
ll lower_bound(ll key) {
// v[0] + v[1] + ... + v[left - 1] < key <= v[0] + v[1] + ... + v[left]
if (key <= 0)
return 0;
ll left = 0, right = 1;
while (right <= n)
right *= 2;
for (ll i = right; i > 0; i /= 2) {
if (left + i <= n && dat[left + i - 1] < key) {
key -= dat[left + i - 1];
left += i;
}
}
return left;
}
void update(ll i, ll val) {
/*
e.g.) i = 10101, n = 11111
itr1. i: 10101, i+1: 10110 -> 10111
itr2. i: 10111, i+1: 11000 -> 11111 (break)
*/
if (i < 0)
return;
for (ll j = i; j < n; j |= j + 1) {
dat[j] = update_func(val, dat[j]);
}
}
};
struct SegmentTree {
ll n, ini, minimize;
vl dat;
// when seeking minimum
// ini = INF
// when seeking maximum
// ini = -INF
SegmentTree(ll n_, bool minimize_ = true) {
n = 1;
minimize = minimize_;
if (minimize)
ini = INF;
else
ini = -INF;
while (n < n_)
n *= 2;
dat.resize(2 * n - 1);
rep(i, 2 * n - 1) dat[i] = ini;
};
void update(ll idx, ll val) {
idx += n - 1;
if (minimize && dat[idx] <= val)
return;
if (!minimize && dat[idx] >= val)
return;
dat[idx] = val;
while (idx > 0) {
idx = (idx - 1) / 2;
// when seeking minimum
if (minimize)
dat[idx] = min(dat[idx * 2 + 1], dat[idx * 2 + 2]);
// when seeking maximum
else
dat[idx] = max(dat[idx * 2 + 1], dat[idx * 2 + 2]);
}
}
ll query(ll l, ll r) {
// ### NOTE ###
// the range is [l, r]
// l, l + 1, ..., r
r++; // to adjust to this method
return query_segment(l, r, 0, 0, n);
}
ll query_segment(ll a, ll b, ll idx, ll l, ll r) {
assert(a < b);
if (r <= a || b <= l)
return ini;
if (a <= l && r <= b)
return dat[idx];
else {
ll seg1 = query_segment(a, b, idx * 2 + 1, l, (l + r) / 2);
ll seg2 = query_segment(a, b, idx * 2 + 2, (l + r) / 2, r);
// when seeking minimum
if (minimize)
return min(seg1, seg2);
// when seeking maximum
else
return max(seg1, seg2);
}
}
};
template <class Target> class RerootingTreeDP {
public:
using T = typename Target::type;
struct DP_edge {
ll to, rev; // rev is the index to trace the source node.
T value; // objective value
};
private:
ll n;
void dfs_fwd(ll source, ll parent) {
ll par_idx = -1;
vector<T> values;
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent) {
par_idx = i;
continue;
}
dfs_fwd(e.to, source);
values.pb(e.value);
}
// If the parent != -1, update the value on edge from parent to source
if (par_idx != -1) {
ll src_idx = tree[source][par_idx].rev;
// update values on the edge from parent to source
tree[parent][src_idx].value = Target::merge(values);
}
}
void dfs_bwd(ll source, ll parent) {
vector<T> values;
for (auto &&e : tree[source])
values.pb(e.value);
values = Target::evaluate(values);
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent)
continue;
// tree[e.to][e.rev]: e.to -> source
tree[e.to][e.rev].value = values[i];
dfs_bwd(e.to, source);
}
}
public:
UnionFind uf;
vector<vector<DP_edge>> tree;
RerootingTreeDP(ll n) : n(n), uf(n), tree(n) {}
void add_edge(ll u, ll v, T val) {
assert(!uf.is_same(u, v));
tree[u].pb({v, ll(tree[v].size()), val});
tree[v].pb({u, ll(tree[u].size()) - 1, val});
uf.unite(u, v);
}
void dp() {
vb visited(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_fwd(i, -1);
visited[uf.root_find(i)] = true;
}
visited.assign(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_bwd(i, -1);
visited[uf.root_find(i)] = true;
}
}
ll size() const { return tree.size(); }
};
// ABC160F is one example
// Modify the functions evaluate and merge based on given problems
struct Merger {
using type = ll;
// This is the exaple of the number of children
static type merge(const vector<type> &value) {
// merge the result below the source node
// each value is from each child node of the source node
// value[i] := f(child i)
// Here, we would like to obtain f(source) using f(child i) (i = 0, 1, ...,
// n_children)
ll ret = 1;
for (auto &&v : value)
ret += v;
return ret;
}
static vector<type> evaluate(const vector<type> &value) {
// value[i] := f(source -> child i)
// we would like to obtain f(child i -> source)
// child j (j != i) is the grandchildren of child i
// represent f(child i -> source) using f(source -> j) (j != i)
// L[i + 1] := the result using f(source -> k) (k = 0, 1, ..., i)
// R[i] := the result using f(source -> k) (k = i, i + 1, ..., n_children)
const ll n_children = value.size();
vl L(n_children + 1, 0), R(n_children + 1, 0);
rep(i, n_children) L[i + 1] = L[i] + value[i];
revrep(i, n_children) R[i] = R[i + 1] + value[i];
vl ret(n_children);
rep(i, n_children) ret[i] = L[i] + R[i + 1] + 1;
return ret;
}
};
struct StronglyConnectedComponents {
ll n, n_cmp;
vl2 graph, graph_rev, dag, cmp;
vl order, visited, cmp_idx;
StronglyConnectedComponents() {}
StronglyConnectedComponents(ll sz)
: n(sz), graph(sz), graph_rev(sz), visited(sz), cmp_idx(sz) {}
void add_edge(ll from, ll to) {
graph[from].pb(to);
graph_rev[to].pb(from);
}
void input(ll m, ll offset = -1) {
ll a, b;
rep(i, m) {
in2(a, b);
add_edge(a + offset, b + offset);
}
}
ll operator[](ll k) { return cmp_idx[k]; }
void dfs_fwd(ll source) {
visited[source] = 1;
rep(i, graph[source].size()) {
ll target = graph[source][i];
if (!visited[target])
dfs_fwd(target);
}
order.pb(source);
}
void dfs_bwd(ll source, ll num) {
visited[source] = 1, cmp_idx[source] = num;
cmp[num].pb(source);
rep(i, graph_rev[source].size()) {
ll target = graph_rev[source][i];
if (!visited[target])
dfs_bwd(target, num);
}
}
ll build() {
fill(all(visited), 0);
order.clear();
rep(i, n) if (!visited[i]) dfs_fwd(i);
fill(all(visited), 0);
ll num = 0;
revrep(i, order.size()) {
if (!visited[order[i]]) {
dag.pb(vl());
cmp.pb(vl());
dfs_bwd(order[i], num++);
}
}
rep(i, n) for (ll to : graph[i]) if (cmp_idx[i] != cmp_idx[to])
dag[cmp_idx[i]]
.pb(cmp_idx[to]);
rep(i, num) {
sort(all(dag[i]));
dag[i].erase(unique(all(dag[i])), dag[i].end());
}
return n_cmp = num;
}
};
struct CombinationMemo {
ll sz, mod;
vl facts, facts_inv, minv;
CombinationMemo(ll sz, ll _mod) : sz(sz), mod(_mod) {
facts.resize(sz + 5);
facts_inv.resize(sz + 5);
minv.resize(sz + 5);
init();
}
void init() {
facts[0] = facts[1] = 1;
minv[1] = 1;
facts_inv[0] = facts_inv[1] = 1;
For(i, 2, sz + 3) {
facts[i] = (i * facts[i - 1]) % mod;
minv[i] = mod - minv[mod % i] * (mod / i) % mod;
facts_inv[i] = facts_inv[i - 1] * minv[i] % mod;
}
}
ll nCk(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll val = (facts[n] * facts_inv[n - r]) % mod;
val *= facts_inv[r];
return val % mod;
}
ll nPk(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll val = (facts[n] * facts_inv[n - r]) % mod;
return val % mod;
}
};
struct PowerMemo {
ll sz, mod, base;
vl powB;
PowerMemo(ll sz, ll base, ll _mod) : sz(sz), base(base), mod(_mod) {
powB.resize(sz + 5);
init();
}
void init() {
powB[0] = 1;
rep(i, sz + 3) powB[i + 1] = (powB[i] * base) % mod;
}
ll operator[](ll k) { return powB[k]; }
};
struct Grid2D {
Graph graph;
ll Width, Height;
Grid2D(ll w, ll h) : Width(w), Height(h) { graph.resize(w * h); }
ll pos_to_idx(point p) { return p.y * Width + p.x; }
point idx_to_pos(ll idx) { return {idx % Width, idx / Width}; }
bool undefined_region(point p, vb2 &block) {
if (p.x < 0 || p.x > Width - 1)
return true;
if (p.y < 0 || p.y > Height - 1)
return true;
if (block[p.x][p.y])
return true;
return false;
}
void build(vb2 &block, ll val = 1) {
rep(x, Width) rep(y, Height) {
point p = {x, y};
ll idx1 = pos_to_idx(p);
ll idx2;
if (block[x][y])
continue;
rep(i, 4) {
point nxt = p + dirs[i];
idx2 = pos_to_idx(nxt);
if (!undefined_region(nxt, block))
graph[idx1].pb(
{idx2, val}); // dist[idx1][idx2] = val; (warshall-floyd)
}
}
}
};
struct Cumulative2D {
vl2 cum;
ll w, h;
Cumulative2D(ll w, ll h) : w(w), h(h) { cum = vl2(w + 1, vl(h + 1, 0)); }
template <typename T> void build(vector<T> &vec) {
// never forget building
rep(x, w + 1) cum[x][0] = 0;
rep(y, h + 1) cum[0][y] = 0;
rep(y, h) rep(x, w) cum[x + 1][y + 1] = cum[x][y + 1] + vec[x][y];
rep(x, w + 1) rep(y, h) cum[x][y + 1] += cum[x][y];
}
ll func(ll x, ll y, ll dx, ll dy) {
// 1-indexed
// the rectangle of (x, y), (x + dx, y), (x, y + dy) and (x + dx, y + dy)
// think about the case of (1, 1, 1, 1).
if (x + dx > w || y + dy > h)
return -INF;
ll val = cum[x + dx][y + dy];
val += cum[x][y];
val -= cum[x][y + dy];
val -= cum[x + dx][y];
return val;
}
};
ll gcd(ll m, ll n) {
ll a = max(m, n);
ll b = min(m, n);
while (b != 1 && b != 0) {
a %= b;
swap(a, b);
}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
ll power_normal(ll a, ll power) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll power_mod(ll a, ll power, ll mod) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod) { return power_mod(a, mod - 2, mod); }
ll combination(ll n, ll r, ll mod) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
ll num = (n - i) % mod, den = (i + 1) % mod;
(numerator *= num) %= mod;
(denomenator *= modinv(den, mod)) %= mod;
}
return (numerator * denomenator) % mod;
}
vl2 pascal_triangle(ll n) {
/*
Complexity: O(n^2)
The upper bound of n is nearly 50.
Parameters
----------
n; the size of returned vector
Returns
-------
comb[i][j]: combination(i, j). 0 <= i <= n, 0 <= j <= i
*/
vl2 comb(n + 1, vl(n + 1));
comb[0][0] = 1;
For(i, 1, n + 1) rep(j, i + 1) {
comb[i][j] += comb[i - 1][j];
if (j > 0)
comb[i][j] += comb[i - 1][j - 1];
}
return comb;
}
ld log_combination(ll n, ll r) {
if (n == r && n == 0)
return 0;
else if (n <= 0 || r < 0 || r > n)
return -INF;
ld val = 0;
for (ll i = 0; i < r; i++) {
val += log(n - i);
val -= log(i + 1);
}
return val;
}
string bin_expression(ll n, ll dig) {
string s = "";
rep(i, dig) {
s += to_string(n % 2);
n /= 2;
}
reverse(all(s));
return s;
}
bool is_prime(ll n) {
if (n <= 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
map<ll, ll> prime_factorization(ll n) {
ll i = 2;
map<ll, ll> table;
while (i * i <= n) {
while (n % i == 0) {
table[i]++;
n /= i;
}
i++;
}
if (n > 1)
table[n] = 1;
return table;
}
vl divisor_table(ll n) {
vl table;
ll i = 1;
while (i * i <= n) {
if (n % i == 0) {
table.pb(i);
if (i * i != n)
table.pb(n / i);
}
i++;
}
sort(all(table));
return table;
}
ll next_combination(ll sub) {
/*
nCk
ll bit = (1 << k) - 1;
for (; bit < (1 << n); bit = next_combination(bit)){
bool ith = bit & (1 << i);
procedures...
}
sub & -sub: the binary which shares the last digit whose value is 1 in sub
sub + x : carry up the last digit
~y : the binary whose digits are 1 if y's digit is 0.
(sub & ~y) / x: reduce the same number of 0s after first 1 in x from (sub &
~y).
*/
ll x = sub & -sub, y = sub + x;
if (x != 0)
return (((sub & ~y) / x) >> 1) | y;
else
return INF;
}
// just change the input if you want to change the target.
// If you want to check the common sequences in two strings,
// combine them. e.g. ABC150F
template <typename T> vl z_algorithm(T &s, ll n) {
/*
Paramters
---------
T: the string or list of interest
n: the size of string or list
Returns
-------
res[i] is the maximum number of K which satisfies
s[:K] == s[i:i + K]
for each i = 0, 1, 2, ..., n - 1.
*/
vl res(n);
res[0] = n;
ll i1 = 1, i2 = 0;
while (i1 < n) {
/*
i1: the starting point
i2: the length of substring
*/
while (i1 + i2 < n && s[i2] == s[i1 + i2])
++i2;
res[i1] = i2;
if (i2 == 0) {
++i1;
continue;
}
ll i3 = 1;
// update the already seen points
while (i1 + i3 < n && i3 + res[i3] < i2) {
res[i1 + i3] = res[i3];
++i3;
}
// update up to i1 + i3 and the next possible minimum length is i2 - i3 (=
// res[i3])
i1 += i3, i2 -= i3;
}
return res;
}
ll string_to_ll(string s) {
ll l = s.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = s[l - 1 - idx] - '0';
val += (m * tenth);
tenth *= 10;
idx++;
}
return val;
}
string reflected_string(string s) {
string t, u;
ll n = s.length();
t = s;
reverse(all(t));
u = substring(t, 0, n - 2) + s + substring(t, 1, n - 1);
return u;
}
ld distance_between_point_line(point l_begin, point l_end, point p) {
ll xl1 = l_begin.x, yl1 = l_begin.y;
ll xl2 = l_end.x, yl2 = l_end.y;
ll xp = p.x, yp = p.y;
ll a = yl2 - yl1;
ll b = -xl2 + xl1;
ll c = -a * xl2 - b * yl2;
return abs(ld(a * xp + b * yp + c)) / ld(sqrt(a * a + b * b));
}
bool is_cross(point l1_begin, point l1_end, point l2_begin, point l2_end) {
ll x1 = l1_begin.x, y1 = l1_begin.y;
ll x2 = l1_end.x, y2 = l1_end.y;
ll x3 = l2_begin.x, y3 = l2_begin.y;
ll x4 = l2_end.x, y4 = l2_end.y;
ll val1 = (x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3);
ll val2 = (x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4);
ll val3 = (x3 - x4) * (y1 - y3) + (y3 - y4) * (x3 - x1);
ll val4 = (x3 - x4) * (y2 - y3) + (y3 - y4) * (x3 - x2);
return val1 * val2 < 0 && val3 * val4 < 0;
}
template <typename T> bool isColinear(T p1, T p2, T p3) {
T v1 = p2 - p1, v2 = p3 - p1;
return v1.x * v2.y == v1.y * v2.x;
}
template <typename T> T PerpendicularBisector(T p1, T p2) {
T vec = p2 - p1;
assert(!vec.is_zero());
T ret = {vec.y, -vec.x};
return ret;
}
template <typename T> ld Distance2DPoints(T p1, T p2) {
T vec = (p1 - p2) * (p1 - p2);
return sqrt(vec.x + vec.y);
}
ll SquaredDistance2DPoints(point p1, point p2) {
point vec = (p1 - p2) * (p1 - p2);
return vec.x + vec.y;
}
ld space_of_triangle(point p1, point p2, point p3) {
ll x1 = p1.x, y1 = p1.y;
ll x2 = p2.x, y2 = p2.y;
ll x3 = p3.x, y3 = p3.y;
ll v1 = x2 - x1;
ll u1 = y2 - y1;
ll v2 = x3 - x1;
ll u2 = y3 - y1;
ld s = ld(v1 * u2 - u1 * v2) / ld(2);
return abs(s);
}
pair<point, ll> OuterCenter(point p1, point p2, point p3) {
// the center of circle on the given three points
// return the determinant value and the product of center points and 2 *
// determinant value
point ret;
if (isColinear(p1, p2, p3)) {
ll d1 = SquaredDistance2DPoints(p1, p2);
ll d2 = SquaredDistance2DPoints(p2, p3);
ll d3 = SquaredDistance2DPoints(p3, p1);
if (d1 >= d2 && d1 >= d3) {
ret = p1 + p2;
return mp(ret, 2);
} else if (d2 >= d1 && d2 >= d3) {
ret = p2 + p3;
return mp(ret, 2);
} else {
ret = p3 + p1;
return mp(ret, 2);
}
}
point pv1 = PerpendicularBisector(p1, p2);
point pv2 = PerpendicularBisector(p1, p3);
point cv1_2x = p1 + p2, cv2_2x = p1 + p3;
// cv1 + k pv1 == cv2 + m pv2
// (pv1x -pv2x) (k) = (cv2x - cv1x)
// (pv1y -pv2y) (m) = (cv2y - cv1y)
ll det_inv = -pv1.x * pv2.y + pv1.y * pv2.x;
ll x1_2x = cv2_2x.x - cv1_2x.x, x2_2x = cv2_2x.y - cv1_2x.y;
pl c_2x_det = {-pv2.y * x1_2x + pv2.x * x2_2x,
-pv1.y * x1_2x + pv1.x * x2_2x};
// ret.x = ld(cv1_2x.x * det_inv + pv1.x * c_2x_det.e1) / ld(2 * det_inv);
// ret.y = ld(cv1_2x.y * det_inv + pv1.y * c_2x_det.e1) / ld(2 * det_inv);
ret.x = cv1_2x.x * det_inv + pv1.x * c_2x_det.e1;
ret.y = cv1_2x.y * det_inv + pv1.y * c_2x_det.e1;
ll jacobian = 2 * det_inv;
return mp(ret, jacobian);
}
ll inversion_number(vl a, ll a_max) {
/*
Paramters
---------
a: vector<ll>
All the elements must be non-negative.
Prefably the elements are compressed to reduce the computational cost.
a_max: ll
The maximum value of the vector a or the value bigger than the value
stated previously.
*/
BinaryIndexedTree bit(a_max + 1);
ll val = 0;
rep(i, a.size()) {
// i is the number of elements that have lower index than a[i].
// call the number of elements that have lower value than a[i]
// by subtracting these two, the residual number is the number of elements
// that have larger value.
val += i - bit.query(a[i] - 1); // cumulative sum from 0 to a[i] - 1
bit.update(a[i], 1);
}
return val;
}
ld bin_search(ld left, ld right, bool lb, function<bool(ld)> judge) {
ld mid;
while (right - left > EPS) {
mid = (right + left) / 2;
if (lb) {
if (judge(mid))
right = mid;
else
left = mid + EPS;
} else {
if (judge(mid))
left = mid;
else
right = mid - EPS;
}
}
return right;
}
ll bin_search(ll left, ll right, bool lb, function<bool(ll)> judge) {
ll mid;
while (right > left) {
if (lb) {
// if true (satisfies the condition), range shifts smaller direction
mid = (right + left) / 2;
if (judge(mid))
right = mid;
else
left = mid + 1;
} else {
// if true (satisfies the condition), range shitfs larger direction
mid = (right + left + 1) / 2;
if (judge(mid))
left = mid;
else
right = mid - 1;
}
}
return right;
}
ld trinary_search(ld left, ld right, function<ld(ld)> func) {
// Care the value EPS!!! Compare to the condition
while (abs(right - left) > EPS) {
ld left2 = (2.0 * left + right) / 3.0;
ld right2 = (left + 2.0 * right) / 3.0;
ld f1 = func(left2);
ld f2 = func(right2);
if (f1 <= f2)
right = right2;
else if (f2 <= f1)
left = left2;
}
return right;
}
template <typename T> vector<T> compress(vector<T> v) {
// sort and remove all the duplicated values
sort(all(v));
v.erase(unique(all(v)), v.end());
return v;
}
template <typename T> map<T, ll> dict(const vector<T> &v) {
map<T, ll> d;
rep(i, v.size()) d[v[i]] = i;
return d;
}
points compress2D(vl xs, vl ys) {
/*
NOTE
----
Add the corner points if required
*/
ll n = xs.size();
vl xcs = compress(xs), ycs = compress(ys);
map<ll, ll> xd = dict(xcs), yd = dict(ycs);
points ps(n);
rep(i, n) xs[i] = xd[xs[i]], ys[i] = yd[ys[i]];
rep(i, n) ps[i] = {xs[i], ys[i]};
sort(all(ps));
return ps;
}
void GaussJordanBitVector(vl &bs) {
ll n = bs.size();
ll rank = 0;
ll j = 0;
revrep(i, N_DIGITS) {
for (j = rank; j < n; j++)
if (bs[j] & (1LL << i))
break;
if (j == n)
continue;
if (j > rank)
bs[rank] ^= bs[j];
for (j = rank + 1; j < n; j++)
bs[j] = min(bs[j], bs[j] ^ bs[rank]);
rank++;
}
}
ll kruskal(vector<undirected_edge> &es, ll n_vertex) {
// O(ElogE)
sort(all(es));
UnionFind uf(n_vertex);
ll min_cost = 0;
rep(i, es.size()) {
undirected_edge &e = es[i];
if (!uf.is_same(e.from, e.to)) {
min_cost += e.cost;
uf.unite(e.from, e.to);
}
}
return min_cost;
}
ll LongestIncreasedSequence(vl &v) {
ll n = v.size();
vl dp(n, INF);
rep(i, n) * lower_bound(all(dp), v[i]) = v[i];
return lower_bound(all(dp), INF) - dp.begin();
}
void dijkstra(ll start, Graph &graph, vl &dist, vl &vertex_pre,
bool trace = false) {
priority_queue<pl, vpl, greater<pl>> edge_costs;
ll n = graph.size();
dist = vl(n, INF);
if (trace)
vertex_pre = vl(n, -1);
dist[start] = 0;
edge_costs.push(pl(0, start));
while (!edge_costs.empty()) {
ll idx, cost;
tie(cost, idx) = edge_costs.top();
edge_costs.pop();
if (dist[idx] < cost)
continue;
for (auto e : graph[idx]) {
if (dist[e.to] > dist[idx] + e.cost) {
dist[e.to] = dist[idx] + e.cost;
if (trace)
vertex_pre[e.to] = idx;
edge_costs.push(pl(dist[e.to], e.to));
}
}
}
}
vl get_predecessor(ll g, vl &vertex_pre) {
vl path;
for (; g != -1; g = vertex_pre[g])
path.pb(g);
reverse(all(path));
return path;
}
void warshall_floyd(vl2 &dist) {
ll n = dist.size();
// Dont forget the initialization
// rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(k, n) rep(i, n) rep(j, n) dist[i][j] =
min(dist[i][j], dist[i][k] + dist[k][j]);
}
// ABC061D
bool find_negative_cycle(ll n, ll goal, Graph &graph, vl &dist) {
rep(i, n) rep(v, n) rep(k, graph[v].size()) {
edge e = graph[v][k];
if (dist[e.to] != INF && dist[e.to] > dist[v] + e.cost) {
dist[e.to] = -INF;
if (goal == -1)
return true;
else if (goal == e.to)
return true;
}
}
return false;
}
bool bellman_ford(ll start, ll goal, Graph &graph, vl &dist) {
// if there is a closed circuit, it returns false. (when goal == -1)
// if the distance to goal cannot be obtained, it returns false (when goal !=
// -1)
ll n = graph.size();
dist = vl(n, INF);
dist[start] = 0;
rep(i, n) rep(v, n) rep(k, graph[v].size()) {
edge e = graph[v][k];
if (dist[v] != INF && dist[e.to] > dist[v] + e.cost)
dist[e.to] = dist[v] + e.cost;
}
if (find_negative_cycle(n, goal, graph, dist))
return false;
return true;
}
void Euler_Tour(Graph &tree, vl &euler_tour, vl &in, vl &out, ll anc = 0) {
// record only when we first reach a node and leave the node.
ll n = tree.size();
vb visited(n, false);
in = out = vl(n);
auto dfs = [&](auto dfs, ll source) -> void {
visited[source] = true;
in[source] = euler_tour.size();
euler_tour.pb(source);
bool is_leaf = true;
for (auto &e : tree[source]) {
ll target = e.to;
if (visited[target])
continue;
else
is_leaf = false;
dfs(dfs, target);
}
euler_tour.pb(-source);
out[source] = euler_tour.size() - 1;
};
dfs(dfs, anc);
}
void Euler_Tour2(Graph &tree, vl &euler_tour, vl &in, vl &out, ll anc = 0) {
// record everytime we reach a node
ll n = tree.size();
vb visited(n, false);
in = out = vl(n);
auto dfs = [&](auto dfs, ll source) -> void {
visited[source] = true;
in[source] = euler_tour.size();
euler_tour.pb(source);
bool is_leaf = true;
for (auto &e : tree[source]) {
ll target = e.to;
if (visited[target])
continue;
else
is_leaf = false;
dfs(dfs, target);
euler_tour.pb(source);
}
out[source] = euler_tour.size() - 1;
};
dfs(dfs, anc);
}
std::mt19937 create_rand_engine() {
std::random_device rnd;
std::vector<std::uint_least32_t> v(10);
std::generate(v.begin(), v.end(), std::ref(rnd));
std::seed_seq seed(v.begin(), v.end());
return std::mt19937(seed);
}
vl generate_unique_array(const size_t sz, ll vm, ll vM) {
const size_t range = static_cast<size_t>(vM - vm + 1);
const size_t num = static_cast<size_t>(sz * 1.2);
assert(vm <= vM);
assert(sz <= range);
vl ret;
auto engine = create_rand_engine();
std::uniform_int_distribution<ll> distribution(vm, vM);
while (ret.size() < sz) {
while (ret.size() < num)
ret.pb(distribution(engine));
sort(all(ret));
auto unique_end = unique(all(ret));
if (sz < distance(ret.begin(), unique_end))
unique_end = next(ret.begin(), sz);
ret.erase(unique_end, ret.end());
}
return ret;
}
vl generate_array(const size_t sz, ll vm, ll vM) {
const size_t range = static_cast<size_t>(vM - vm + 1);
assert(vm <= vM);
vl ret;
auto engine = create_rand_engine();
std::uniform_int_distribution<ll> distribution(vm, vM);
while (ret.size() < sz)
ret.pb(distribution(engine));
return ret;
}
void read_vector(ll n, vl &v, ll offset = 0) {
v.resize(n);
rep(i, n) {
in1(v[i]);
v[i] += offset;
}
}
void read_points(ll n, points &ps, ll offset = 0) {
ps.resize(n);
rep(i, n) {
ll x, y;
in2(x, y);
ps[i] = {x, y};
ps[i] += offset;
}
}
void read_2DMap(ll w, ll h, vb2 &block, char b) {
block = vb2(w, vb(h, false));
string s;
rep(y, h) {
in1(s);
rep(x, w) block[x][y] = (s[x] == b);
}
}
/*
diameter of tree
Graph tree;
ll dM = 0, vM = 0, v2 = 0;
void dfs1(ll source, ll parent, ll d){
if (d > dM) dM = d, vM = source;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
if (target == parent) continue;
dfs1(target, source, d + 1);
}
}
void dfs2(ll source, ll parent, ll d){
if (dM <= d) dM = d, v2 = source;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
if (target == parent) continue;
dfs2(target, source, d + 1);
}
}
dfs(0, -1, 0);
dfs2(vM, -1, 0);
prl2(vM + 1, v2 + 1); // the two edges of tree
*/
/*
#5. shakutori method (syakutori, two pointers technique)
// 1. strech right side while the condition is met.
// 2. renew the answer
// 3. increments left side
// 4. Back to 1. (l <= r must be satisfied all the time.)
ll l = 0; ll r = 0;
while (l < n){
if (l == r) r++;
while(r < n && cond) r++;
l++;
}
prl(answer);
#11. bfs ABC146D, ABC007C
1. first create a graph.
2. start searching from a node.
3. do some processes and push nodes connected with a given target node in
BFS.
4. repeat a series of procedure until queue is empty.
queue<pl> q;
void bfs(ll source, ll parents){
ll n_edge = graph[source].size();
if (parents != -1) dist[source] = min(dist[source], dist[parents] + 1);
if (visited[source]) return;
visited[source] = true;
rep(idx, n_edge){
ll target = graph[source][idx].to;
if (target == parents) continue;
q.push(mp(target, source));
}
}
q.push(mp(sg.e1, -1));
while(!q.empty()){
pl source = q.front(); q.pop();
bfs(source.e1, source.e2);
}
*/
/*
x1: 0000 0001 0010 0101 0110 0111 0111
x2: xxxx 0001 0011 0100 0101 1000 0110
x1 & x2: 0000 0001 0010 0100 0100 0000 0110
x: 1001 1010 1100 1011 1101 1111
x & ~ x: 0001 0010 0100 0001 0001 0001
sum: 1010 1100 10000 1100 1100 10000
####### Attention #######
S & (1 << i) -> if true, i in S
S | (1 << i) -> S union {i}
S & ~(1 << i) -> S - {i}
__builtin_popcountl(i) -> the number of 1 in binary
#Conditional Operator
condition ? true : false;
# inclusion-exclusion principle
|U[i = 1 to n] Ai| = sum[i = 1 to n] |Ai| - sum[i < j]|Ai ^ Aj| + ... + (-1)^(n
- 1) |^[i = 1 to n]Ai|
*/
const ll MAX_N = 200005;
const size_t MAX_BIT = 12000;
typedef bitset<MAX_BIT> bts;
typedef vector<bts> vbt;
typedef vector<vbt> vbt2;
typedef vector<vbt2> vbt3;
/*
read_graph(n, m, graph, cost, directed, offset)
cost: if link cost is fixed, put positive integer
otherwise -1
directed: if directed true, olse false
offset: if the given vertex is 1-indexed, -1.
*/
void solve() {
bool okay = false;
string S, T, U;
ll A, B, C, D, N, M, H, W, K, x, y, Q, idx, cnt, num, answer;
vl as, bs, cs, ds;
vb2 block;
vb visited;
Graph graph, tree;
points ps;
// generate_array(size, min, max);
in2(N, K);
vl pos, neg;
ll nz = 0;
rep(i, N) {
in1(A);
if (A > 0)
pos.pb(A);
else if (A < 0)
neg.pb(A);
else
nz++;
}
sort(rall(pos));
sort(rall(neg));
ll n_pos = pos.size(), n_neg = neg.size();
if (n_pos + n_neg + nz == K) {
mint ans = 1;
if (nz > 0)
ans = 0;
else {
rep(i, n_pos) ans *= pos[i];
rep(i, n_neg) ans *= neg[i];
}
prl(ans);
return;
} else if (n_pos == 0 && nz == 0 && K % 2 == 1) {
mint ans = 1;
rep(i, K) ans *= neg[i];
prl(ans);
return;
}
vpl tot;
rep(i, n_pos) tot.pb({pos[i], 1});
rep(i, n_neg) tot.pb({-neg[i], -1});
rep(i, nz) tot.pb({0, 0});
sort(rall(tot));
mint ans = 1;
ll nn = 0, zz = 0, n1 = -INF, n2 = -INF, p1 = -INF, p2 = -INF;
rep(i, K) {
ll v1, v2;
tie(v1, v2) = tot[i];
ans *= v1;
if (v2 == -1)
n1 = v1, nn++;
else if (v2 == 1)
p1 = v1;
else if (v2 == 0)
zz++;
}
if (nn % 2 == 0 || zz > 0)
prl(ans);
else if (p1 == -INF) {
ans *= modinv(n1, MOD);
For(i, K, tot.size()) if (tot[i].e2 != -1) {
ans *= tot[i].e1;
break;
}
prl(ans);
} else {
For(i, K, tot.size()) {
ll v1, v2;
tie(v1, v2) = tot[i];
if (p2 == -INF && v2 != -1)
p2 = v1;
if (n2 == -INF && v2 != 1)
n2 = v1;
if (n2 != -INF && p2 != -INF)
break;
}
assert(p2 > -INF);
if (p2 == -INF || p1 * p2 < n1 * n2) {
ans *= modinv(p1, MOD);
ans *= n2;
} else {
ans *= modinv(n1, MOD);
ans *= p2;
}
prl(ans);
}
// ### DEBUG PART ###
auto naive_solver = [&]() {};
#ifdef _LOCAL
naive_solver();
#endif
}
void test(ll num = 0, bool verbose = false) {
rep(i, max(1LL, num)) {
ll t = clock();
if (verbose)
prl4("\n#####", i + 1, "#####", "\n## Answer ##");
solve();
if (verbose) {
prl("");
prl_time(t);
}
}
}
int main(void) {
#ifdef _LOCAL
test(4, true);
#else
test(0, false);
#endif
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-12;
struct mint {
ll x;
mint(ll 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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct edge {
ll to, cost;
tuple<ll, ll> get_value() { return make_tuple(to, cost); }
};
struct BigInt {
string num;
ll mod(ll _mod) {
ll l = num.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = num[l - 1 - idx] - '0';
val += (m * tenth) % _mod;
val %= _mod;
tenth *= 10;
tenth %= _mod;
idx++;
}
return val;
}
ll digits() { return num.length(); }
bool operator<(BigInt &n2) const {
if (num.length() < n2.digits())
return true;
else if (num.length() > n2.digits())
return false;
return num < n2.num;
}
bool operator>(BigInt &n2) const {
if (num.length() > n2.digits())
return true;
else if (num.length() < n2.digits())
return false;
return num > n2.num;
}
};
struct fpoint {
ld x = 0;
ld y = 0;
bool operator<(const fpoint &p) const {
if (x == p.x)
return y < p.y;
return x < p.x;
}
bool operator==(const fpoint &p) const {
if (p.x - EPS < x && x < p.x + EPS && p.y - EPS < y && y < p.y + EPS)
return true;
return false;
}
bool operator!=(const fpoint &p) const {
if (p.x - EPS > x || x > p.x + EPS || p.y - EPS > y || y > p.y + EPS)
return true;
return false;
}
fpoint &operator+=(const ld a) {
x += a, y += a;
return *this;
}
fpoint &operator-=(const ld a) {
x -= a, y -= a;
return *this;
}
fpoint &operator*=(const ld a) {
x *= a, y *= a;
return *this;
}
fpoint &operator/=(const ld a) {
x /= a, y /= a;
return *this;
}
fpoint &operator+=(const fpoint p) {
x += p.x, y += p.y;
return *this;
}
fpoint &operator-=(const fpoint p) {
x -= p.x, y -= p.y;
return *this;
}
fpoint &operator*=(const fpoint p) {
x *= p.x, y *= p.y;
return *this;
}
fpoint &operator/=(const fpoint p) {
x /= p.x, y /= p.y;
return *this;
}
fpoint operator+(const fpoint p) const { return fpoint(*this) += p; }
fpoint operator-(const fpoint p) const { return fpoint(*this) -= p; }
fpoint operator*(const fpoint p) const { return fpoint(*this) *= p; }
fpoint operator/(const fpoint p) const { return fpoint(*this) /= p; }
fpoint operator+(const ld a) const { return fpoint(*this) += a; }
fpoint operator-(const ld a) const { return fpoint(*this) -= a; }
fpoint operator*(const ld a) const { return fpoint(*this) *= a; }
fpoint operator/(const ld a) const { return fpoint(*this) /= a; }
ld dot(const fpoint &p) const { return x * p.x + y * p.y; }
ll cross(const fpoint &p) const { return x * p.y - y * p.x; }
ld squared_norm() const { return x * x + y * y; }
ld norm() const { return sqrt(x * x + y * y); }
tuple<ld, ld> get_value() { return make_tuple(x, y); }
ll which_quadrant() const {
if (abs(x) < EPS && abs(y) < EPS)
return 0;
if (y > 0)
return x > 0 ? 1 : 2;
return x < 0 ? 3 : 4;
}
bool is_zero() {
fpoint z = {0, 0};
return z == *this;
}
};
struct point {
ll x = 0;
ll y = 0;
bool operator<(const point &p) const {
if (x == p.x)
return y < p.y;
return x < p.x;
}
bool operator==(const point &p) const {
if (x == p.x && y == p.y)
return true;
return false;
}
bool operator!=(const point &p) const {
if (x != p.x || y != p.y)
return true;
return false;
}
point &operator+=(const ll a) {
x += a, y += a;
return *this;
}
point &operator-=(const ll a) {
x -= a, y -= a;
return *this;
}
point &operator*=(const ll a) {
x *= a, y *= a;
return *this;
}
point &operator+=(const point p) {
x += p.x, y += p.y;
return *this;
}
point &operator-=(const point p) {
x -= p.x, y -= p.y;
return *this;
}
point &operator*=(const point p) {
x *= p.x, y *= p.y;
return *this;
}
void operator++(int) { x++, y++; }
void operator++() { x++, y++; }
void operator--(int) { x--, y--; }
void operator--() { x--, y--; }
point operator+(const point p) const { return point(*this) += p; }
point operator-(const point p) const { return point(*this) -= p; }
point operator*(const point p) const { return point(*this) *= p; }
point operator+(const ll a) const { return point(*this) += a; }
point operator-(const ll a) const { return point(*this) -= a; }
point operator*(const ll a) const { return point(*this) *= a; }
ll dot(const point &p) const { return x * p.x + y * p.y; }
ll cross(const point &p) const { return x * p.y - y * p.x; }
ll squared_norm() const { return x * x + y * y; }
tuple<ll, ll> get_value() { return make_tuple(x, y); }
ll which_quadrant() const {
if (x == 0 && y == 0)
return 0;
if (x >= 0 && y >= 0)
return 1;
else if (x <= 0 && y >= 0)
return 2;
else if (x <= 0 && y <= 0)
return 3;
else
return 4;
}
bool is_zero() {
point z = {0, 0};
return z == *this;
}
fpoint to_fpoint() {
fpoint ret = {ld(x), ld(y)};
return ret;
}
};
struct {
template <typename T> bool operator()(const T p1, const T p2) const {
ll q1 = p1.which_quadrant();
ll q2 = p2.which_quadrant();
if (q1 != q2)
return q1 < q2;
// judge for parallel lines
// if p1 cross p2 > 0 -> sin arg(p1 -> o -> p2) > 0
return p1.cross(p2) > 0;
}
} angle_comparator;
struct undirected_edge {
ll from;
ll to;
ll cost;
bool operator<(const undirected_edge &ue) const { return cost < ue.cost; }
tuple<ll, ll, ll> get_value() { return make_tuple(from, to, cost); }
};
struct event {
ll loc, val, sgn;
bool operator<(const event &e) const {
if (loc == e.loc)
return sgn == 1;
return loc < e.loc;
}
bool operator>(const event &e) const {
if (loc == e.loc)
return sgn == -1;
return loc > e.loc;
}
tuple<ll, ll, ll> get_value() { return make_tuple(loc, val, sgn); }
};
typedef std::pair<ll, ll> pl;
typedef std::tuple<ll, ll, ll> tp3;
typedef std::tuple<ll, ll, ll, ll> tp4;
typedef std::vector<ll> vl;
typedef std::vector<vl> vl2;
typedef std::vector<vl2> vl3;
typedef std::vector<vl3> vl4;
typedef std::vector<mint> vmi;
typedef std::vector<vmi> vmi2;
typedef std::vector<vmi2> vmi3;
typedef std::vector<vmi3> vmi4;
typedef std::vector<bool> vb;
typedef std::vector<vb> vb2;
typedef std::vector<vb2> vb3;
typedef std::vector<vb3> vb4;
typedef std::vector<pl> vpl;
typedef std::vector<tp3> vtp3;
typedef std::vector<tp4> vtp4;
typedef std::vector<point> points;
typedef std::vector<fpoint> fpoints;
// priority queue. Taking from the higher value. Don't forget calling !q.empty()
typedef std::priority_queue<ll> pq;
// priority queue. Taking from the lower value
typedef std::priority_queue<ll, vl, greater<ll>> pql;
typedef std::vector<vector<edge>> Graph;
const ll N_DIGITS = 60;
const long double PI = 3.14159265358979323846;
const points dirs = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}, // four directions
{1, 1}, {-1, 1}, {-1, -1}, {1, -1}, // diagonal
{0, 0}}; // self
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(char c) { return string(1, c); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(mint a) { return to_string(a.x); }
string to_string(point p) {
return "{" + to_string(p.x) + ", " + to_string(p.y) + "}";
}
string to_string(fpoint p) {
return "{" + to_string(p.x) + ", " + to_string(p.y) + "}";
}
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)) + ")";
}
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 += "}";
return res;
}
template <typename T> string to_string(priority_queue<T> &q) {
priority_queue<T> copy;
bool first = true;
string res = "{";
while (!q.empty()) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(q.top());
copy.push(q.top());
q.pop();
}
swap(q, copy);
res += "}";
return res;
}
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 rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define revrep(i, n) for (ll(i) = n - 1; (i) >= 0; (i)--)
#define For(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define revFor(i, b, a) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define isNum(c) (0 <= (c) - '0' && (c) - '0' <= 9)
#define toLower(c) char((c) + 0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pr(a) std::cout << (a)
#define prl(a) std::cout << (a) << endl
#define prl2(a, b) std::cout << (a) << " " << (b) << endl
#define prl3(a, b, c) std::cout << (a) << " " << (b) << " " << (c) << endl
#define prl4(a, b, c, d) \
std::cout << (a) << " " << (b) << " " << (c) << " " << (d) << endl
#define prs(a) std::cout << (a) << " "
#define prs2(a, b) std::cout << (a) << " " << (b) << " "
#define prs3(a, b, c) std::cout << (a) << " " << (b) << " " << (c) << " "
#define prs4(a, b, c, d) \
std::cout << (a) << " " << (b) << " " << (c) << " " << (d) << " "
#define yn(condition) \
if ((condition)) \
prl("Yes"); \
else \
prl("No");
#define YN(condition) \
if ((condition)) \
prl("YES"); \
else \
prl("NO");
#define in1(a) cin >> (a)
#define in2(a, b) cin >> (a) >> (b)
#define in3(a, b, c) cin >> (a) >> (b) >> (c)
#define in4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define in5(a, b, c, d, e) cin >> (a) >> (b) >> (c) >> (d) >> (e)
#define in6(a, b, c, d, e, f) cin >> (a) >> (b) >> (c) >> (d) >> (e) >> (f)
#define in7(a, b, c, d, e, f, g) \
cin >> (a) >> (b) >> (c) >> (d) >> (e) >> (f) >> (g)
#define e1 first
#define e2 second
#define Forchar(c, a, z) for (char(c) = (a); (c) <= (z); (c)++)
#define cntchar(s, c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) \
std::cout << fixed << setprecision(digits) << (num) << endl;
#define prl_time(s) \
prl3("Elapsed Time:", 1000.0 * (clock() - s) / CLOCKS_PER_SEC, "[ms]");
#define char_to_str(c) string(1, (c))
#ifdef _LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
struct MaxFlow {
struct F_edge {
ll to, rev, capacity;
F_edge(ll to, ll rev, ll capacity) : to(to), rev(rev), capacity(capacity) {}
};
typedef vector<F_edge> F_edges;
vector<F_edges> graph;
ll n_vertex;
// level is the shortest path to get a given node from the source node.
vl level, iter;
MaxFlow(ll n_vertex) : n_vertex(n_vertex) { graph.resize(n_vertex); }
void add_edge(ll from, ll to, ll capacity) {
graph[from].pb({to, ll(graph[to].size()), capacity});
graph[to].pb({from, ll(graph[from].size()) - 1, 0});
}
void bfs(ll source) {
level = vl(n_vertex, -1);
level[source] = 0;
queue<ll> q;
q.push(source);
while (!q.empty()) {
ll vertex = q.front();
q.pop();
rep(i, graph[vertex].size()) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
// if the flow can be into the target node, implement below.
if (cap_target > 0 && level[target] < 0) {
level[target] = level[vertex] + 1;
q.push(target);
}
}
}
}
ll dfs(ll vertex, ll sink, ll flow) {
if (vertex == sink)
return flow;
for (ll &i = iter[vertex]; i < graph[vertex].size(); i++) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
ll rev_target = graph[vertex][i].rev;
// if capasitiy is not full yet and target is farther,
// then assign current flow.
if (cap_target > 0 && level[vertex] < level[target]) {
ll d = dfs(target, sink, min(cap_target, flow));
if (d > 0) { // if the flow successfully reaches the sink, reduce the
// flow from the capacity
graph[vertex][i].capacity -= d;
graph[target][rev_target].capacity += d;
return d;
}
}
}
return 0;
}
ll dinic(ll source, ll sink) {
// complexity O(EV^2)
ll flow = 0;
while (true) {
bfs(source);
// if there is no path leading to the sink, the maximum flow is 0.
if (level[sink] < 0)
return flow;
iter = vl(n_vertex, 0);
ll f;
while ((f = dfs(source, sink, INF)) > 0)
flow += f;
}
}
};
struct UnionFind {
vl parents, set_size;
set<ll> root_idx;
ll n_groups;
UnionFind(ll n) {
parents = set_size = vl(n);
n_groups = n;
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
root_idx.insert(i);
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
return parents[x] = root_find(parents[x]);
}
void unite(ll x, ll y) {
// priority for x is larger than that of y
x = root_find(x);
y = root_find(y);
if (x == y)
return;
parents[y] = x, set_size[x] += set_size[y];
root_idx.erase(y);
n_groups--;
}
bool is_same(ll x, ll y) { // connected or not
return root_find(x) == root_find(y);
}
ll size(ll x) { return set_size[root_find(x)]; }
ll num_union() const { return n_groups; }
};
struct Doubling { // ABC167D
ll n;
ll sz;
vl2 next;
/*
next[k + 1][i] := next[k][next[k][i]]
next[0][i] := edge[i]
e.g. a0, a1, ..., an-1 / 0 <= ai <= n - 1
a0 -> a[a0] -> a[a[a0]] -> ... -> a[a[...[a[0]]]] (m times)
Let the function repeatedly input a[i] m times be f[m](a[i])
- get(i, x) returns f[x](a[i])
- lower_bound(i, j) returns minimum x which satisfies f[x](a[i]) >= j.
if not possible returns n.
*/
// edge[i]: the step size for one iteration
Doubling(vl &edge) : n(edge.size()), sz(62) {
next.resize(sz, vl(n, -1));
rep(i, n) next[0][i] = edge[i];
rep(k, sz - 1) rep(i, n) next[k + 1][i] = next[k][next[k][i]];
}
ll get(ll i, ll x) {
ll ret = i;
rep(bit, sz) {
if (!(x >> bit & 1))
continue;
ret = next[bit][ret];
}
return ret;
}
ll lower_bound(ll i, ll j) {
ll cur = i, acc = 0;
revrep(wid, sz) {
if (next[wid][cur] < j) {
acc += 1LL << wid;
cur = next[wid][cur];
}
}
return min(n, acc + 1);
}
};
class LowestCommonAncestor {
public:
ll N, logN;
vl depth, len;
Graph tree;
vl2 parents;
LowestCommonAncestor(ll n, ll offset = -1, bool is_weighted = true) {
N = n;
logN = 0;
while (N > (1LL << logN))
logN++;
depth = len = vl(N);
parents = vl2(logN, vl(N));
tree = Graph(N);
input(N, offset, is_weighted);
init(0, -1, 0, 0);
build();
}
void add_edge(ll from, ll to, ll dist) {
tree[from].pb({to, dist});
tree[to].pb({from, dist});
}
void input(ll n, ll offset = -1, bool is_weighted = true) {
rep(i, n - 1) {
ll a, b, d = 1;
in2(a, b);
a += offset, b += offset;
if (is_weighted)
in1(d);
add_edge(a, b, d);
}
}
void init(ll source, ll parent, ll d, ll l) {
depth[source] = d;
parents[0][source] = parent;
len[source] = l;
rep(i, tree[source].size()) {
ll target = tree[source][i].to;
ll cost = tree[source][i].cost;
if (target == parent)
continue;
init(target, source, d + 1, cost + l);
}
}
void build() {
rep(k, logN - 1) rep(n, N) {
// if there is no parent, -1.
// otherwise, the parent of the parent is the parent.
if (parents[k][n] < 0)
parents[k + 1][n] = -1;
else
parents[k + 1][n] = parents[k][parents[k][n]];
}
}
ll query(ll u, ll v) {
if (depth[u] > depth[v])
swap(u, v);
rep(k, logN) if ((depth[v] - depth[u]) >> k & 1) v = parents[k][v];
if (u == v)
return u;
revrep(k, logN) {
if (parents[k][u] != parents[k][v]) {
u = parents[k][u];
v = parents[k][v];
}
}
return parents[0][u];
}
ll distance(ll u, ll v) {
ll w = query(u, v);
return len[u] + len[v] - 2 * len[w];
}
};
struct BinaryIndexedTree {
ll n, ini;
vl dat;
BinaryIndexedTree(ll n, ll ini = 0) : dat(n + 1, ini), n(n), ini(ini){};
// x: 1001 1010 1100 1011 1101 1111
// x & - x: 0001 0010 0100 0001 0001 0001
// ->: 1010 1100 10000 1100 1100 10000
ll update_func(ll val, ll d) {
// if maximum -> max(val, dat)
// return max(val, d);
// if cumulative sum
return val + d;
}
ll query(ll i) {
/*
v[0] + v[1] + ... + v[i]
e.g.) i = 10101
itr1. 10101 -> 10100
itr2. 10100 -> 10000
itr3. 10000 -> 00000 (break)
*/
if (i < 0)
return ini;
ll ret = 0;
for (ll j = i; j >= 0; j = (j & (j + 1)) - 1) {
ret = update_func(ret, dat[j]);
}
return ret;
}
ll query(ll l, ll r) {
// a[l] + a[l + 1] + ... + a[r - 1] + a[r]
return query(r) - query(l - 1);
}
ll lower_bound(ll key) {
// v[0] + v[1] + ... + v[left - 1] < key <= v[0] + v[1] + ... + v[left]
if (key <= 0)
return 0;
ll left = 0, right = 1;
while (right <= n)
right *= 2;
for (ll i = right; i > 0; i /= 2) {
if (left + i <= n && dat[left + i - 1] < key) {
key -= dat[left + i - 1];
left += i;
}
}
return left;
}
void update(ll i, ll val) {
/*
e.g.) i = 10101, n = 11111
itr1. i: 10101, i+1: 10110 -> 10111
itr2. i: 10111, i+1: 11000 -> 11111 (break)
*/
if (i < 0)
return;
for (ll j = i; j < n; j |= j + 1) {
dat[j] = update_func(val, dat[j]);
}
}
};
struct SegmentTree {
ll n, ini, minimize;
vl dat;
// when seeking minimum
// ini = INF
// when seeking maximum
// ini = -INF
SegmentTree(ll n_, bool minimize_ = true) {
n = 1;
minimize = minimize_;
if (minimize)
ini = INF;
else
ini = -INF;
while (n < n_)
n *= 2;
dat.resize(2 * n - 1);
rep(i, 2 * n - 1) dat[i] = ini;
};
void update(ll idx, ll val) {
idx += n - 1;
if (minimize && dat[idx] <= val)
return;
if (!minimize && dat[idx] >= val)
return;
dat[idx] = val;
while (idx > 0) {
idx = (idx - 1) / 2;
// when seeking minimum
if (minimize)
dat[idx] = min(dat[idx * 2 + 1], dat[idx * 2 + 2]);
// when seeking maximum
else
dat[idx] = max(dat[idx * 2 + 1], dat[idx * 2 + 2]);
}
}
ll query(ll l, ll r) {
// ### NOTE ###
// the range is [l, r]
// l, l + 1, ..., r
r++; // to adjust to this method
return query_segment(l, r, 0, 0, n);
}
ll query_segment(ll a, ll b, ll idx, ll l, ll r) {
assert(a < b);
if (r <= a || b <= l)
return ini;
if (a <= l && r <= b)
return dat[idx];
else {
ll seg1 = query_segment(a, b, idx * 2 + 1, l, (l + r) / 2);
ll seg2 = query_segment(a, b, idx * 2 + 2, (l + r) / 2, r);
// when seeking minimum
if (minimize)
return min(seg1, seg2);
// when seeking maximum
else
return max(seg1, seg2);
}
}
};
template <class Target> class RerootingTreeDP {
public:
using T = typename Target::type;
struct DP_edge {
ll to, rev; // rev is the index to trace the source node.
T value; // objective value
};
private:
ll n;
void dfs_fwd(ll source, ll parent) {
ll par_idx = -1;
vector<T> values;
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent) {
par_idx = i;
continue;
}
dfs_fwd(e.to, source);
values.pb(e.value);
}
// If the parent != -1, update the value on edge from parent to source
if (par_idx != -1) {
ll src_idx = tree[source][par_idx].rev;
// update values on the edge from parent to source
tree[parent][src_idx].value = Target::merge(values);
}
}
void dfs_bwd(ll source, ll parent) {
vector<T> values;
for (auto &&e : tree[source])
values.pb(e.value);
values = Target::evaluate(values);
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent)
continue;
// tree[e.to][e.rev]: e.to -> source
tree[e.to][e.rev].value = values[i];
dfs_bwd(e.to, source);
}
}
public:
UnionFind uf;
vector<vector<DP_edge>> tree;
RerootingTreeDP(ll n) : n(n), uf(n), tree(n) {}
void add_edge(ll u, ll v, T val) {
assert(!uf.is_same(u, v));
tree[u].pb({v, ll(tree[v].size()), val});
tree[v].pb({u, ll(tree[u].size()) - 1, val});
uf.unite(u, v);
}
void dp() {
vb visited(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_fwd(i, -1);
visited[uf.root_find(i)] = true;
}
visited.assign(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_bwd(i, -1);
visited[uf.root_find(i)] = true;
}
}
ll size() const { return tree.size(); }
};
// ABC160F is one example
// Modify the functions evaluate and merge based on given problems
struct Merger {
using type = ll;
// This is the exaple of the number of children
static type merge(const vector<type> &value) {
// merge the result below the source node
// each value is from each child node of the source node
// value[i] := f(child i)
// Here, we would like to obtain f(source) using f(child i) (i = 0, 1, ...,
// n_children)
ll ret = 1;
for (auto &&v : value)
ret += v;
return ret;
}
static vector<type> evaluate(const vector<type> &value) {
// value[i] := f(source -> child i)
// we would like to obtain f(child i -> source)
// child j (j != i) is the grandchildren of child i
// represent f(child i -> source) using f(source -> j) (j != i)
// L[i + 1] := the result using f(source -> k) (k = 0, 1, ..., i)
// R[i] := the result using f(source -> k) (k = i, i + 1, ..., n_children)
const ll n_children = value.size();
vl L(n_children + 1, 0), R(n_children + 1, 0);
rep(i, n_children) L[i + 1] = L[i] + value[i];
revrep(i, n_children) R[i] = R[i + 1] + value[i];
vl ret(n_children);
rep(i, n_children) ret[i] = L[i] + R[i + 1] + 1;
return ret;
}
};
struct StronglyConnectedComponents {
ll n, n_cmp;
vl2 graph, graph_rev, dag, cmp;
vl order, visited, cmp_idx;
StronglyConnectedComponents() {}
StronglyConnectedComponents(ll sz)
: n(sz), graph(sz), graph_rev(sz), visited(sz), cmp_idx(sz) {}
void add_edge(ll from, ll to) {
graph[from].pb(to);
graph_rev[to].pb(from);
}
void input(ll m, ll offset = -1) {
ll a, b;
rep(i, m) {
in2(a, b);
add_edge(a + offset, b + offset);
}
}
ll operator[](ll k) { return cmp_idx[k]; }
void dfs_fwd(ll source) {
visited[source] = 1;
rep(i, graph[source].size()) {
ll target = graph[source][i];
if (!visited[target])
dfs_fwd(target);
}
order.pb(source);
}
void dfs_bwd(ll source, ll num) {
visited[source] = 1, cmp_idx[source] = num;
cmp[num].pb(source);
rep(i, graph_rev[source].size()) {
ll target = graph_rev[source][i];
if (!visited[target])
dfs_bwd(target, num);
}
}
ll build() {
fill(all(visited), 0);
order.clear();
rep(i, n) if (!visited[i]) dfs_fwd(i);
fill(all(visited), 0);
ll num = 0;
revrep(i, order.size()) {
if (!visited[order[i]]) {
dag.pb(vl());
cmp.pb(vl());
dfs_bwd(order[i], num++);
}
}
rep(i, n) for (ll to : graph[i]) if (cmp_idx[i] != cmp_idx[to])
dag[cmp_idx[i]]
.pb(cmp_idx[to]);
rep(i, num) {
sort(all(dag[i]));
dag[i].erase(unique(all(dag[i])), dag[i].end());
}
return n_cmp = num;
}
};
struct CombinationMemo {
ll sz, mod;
vl facts, facts_inv, minv;
CombinationMemo(ll sz, ll _mod) : sz(sz), mod(_mod) {
facts.resize(sz + 5);
facts_inv.resize(sz + 5);
minv.resize(sz + 5);
init();
}
void init() {
facts[0] = facts[1] = 1;
minv[1] = 1;
facts_inv[0] = facts_inv[1] = 1;
For(i, 2, sz + 3) {
facts[i] = (i * facts[i - 1]) % mod;
minv[i] = mod - minv[mod % i] * (mod / i) % mod;
facts_inv[i] = facts_inv[i - 1] * minv[i] % mod;
}
}
ll nCk(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll val = (facts[n] * facts_inv[n - r]) % mod;
val *= facts_inv[r];
return val % mod;
}
ll nPk(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll val = (facts[n] * facts_inv[n - r]) % mod;
return val % mod;
}
};
struct PowerMemo {
ll sz, mod, base;
vl powB;
PowerMemo(ll sz, ll base, ll _mod) : sz(sz), base(base), mod(_mod) {
powB.resize(sz + 5);
init();
}
void init() {
powB[0] = 1;
rep(i, sz + 3) powB[i + 1] = (powB[i] * base) % mod;
}
ll operator[](ll k) { return powB[k]; }
};
struct Grid2D {
Graph graph;
ll Width, Height;
Grid2D(ll w, ll h) : Width(w), Height(h) { graph.resize(w * h); }
ll pos_to_idx(point p) { return p.y * Width + p.x; }
point idx_to_pos(ll idx) { return {idx % Width, idx / Width}; }
bool undefined_region(point p, vb2 &block) {
if (p.x < 0 || p.x > Width - 1)
return true;
if (p.y < 0 || p.y > Height - 1)
return true;
if (block[p.x][p.y])
return true;
return false;
}
void build(vb2 &block, ll val = 1) {
rep(x, Width) rep(y, Height) {
point p = {x, y};
ll idx1 = pos_to_idx(p);
ll idx2;
if (block[x][y])
continue;
rep(i, 4) {
point nxt = p + dirs[i];
idx2 = pos_to_idx(nxt);
if (!undefined_region(nxt, block))
graph[idx1].pb(
{idx2, val}); // dist[idx1][idx2] = val; (warshall-floyd)
}
}
}
};
struct Cumulative2D {
vl2 cum;
ll w, h;
Cumulative2D(ll w, ll h) : w(w), h(h) { cum = vl2(w + 1, vl(h + 1, 0)); }
template <typename T> void build(vector<T> &vec) {
// never forget building
rep(x, w + 1) cum[x][0] = 0;
rep(y, h + 1) cum[0][y] = 0;
rep(y, h) rep(x, w) cum[x + 1][y + 1] = cum[x][y + 1] + vec[x][y];
rep(x, w + 1) rep(y, h) cum[x][y + 1] += cum[x][y];
}
ll func(ll x, ll y, ll dx, ll dy) {
// 1-indexed
// the rectangle of (x, y), (x + dx, y), (x, y + dy) and (x + dx, y + dy)
// think about the case of (1, 1, 1, 1).
if (x + dx > w || y + dy > h)
return -INF;
ll val = cum[x + dx][y + dy];
val += cum[x][y];
val -= cum[x][y + dy];
val -= cum[x + dx][y];
return val;
}
};
ll gcd(ll m, ll n) {
ll a = max(m, n);
ll b = min(m, n);
while (b != 1 && b != 0) {
a %= b;
swap(a, b);
}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
ll power_normal(ll a, ll power) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll power_mod(ll a, ll power, ll mod) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod) { return power_mod(a, mod - 2, mod); }
ll combination(ll n, ll r, ll mod) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
ll num = (n - i) % mod, den = (i + 1) % mod;
(numerator *= num) %= mod;
(denomenator *= modinv(den, mod)) %= mod;
}
return (numerator * denomenator) % mod;
}
vl2 pascal_triangle(ll n) {
/*
Complexity: O(n^2)
The upper bound of n is nearly 50.
Parameters
----------
n; the size of returned vector
Returns
-------
comb[i][j]: combination(i, j). 0 <= i <= n, 0 <= j <= i
*/
vl2 comb(n + 1, vl(n + 1));
comb[0][0] = 1;
For(i, 1, n + 1) rep(j, i + 1) {
comb[i][j] += comb[i - 1][j];
if (j > 0)
comb[i][j] += comb[i - 1][j - 1];
}
return comb;
}
ld log_combination(ll n, ll r) {
if (n == r && n == 0)
return 0;
else if (n <= 0 || r < 0 || r > n)
return -INF;
ld val = 0;
for (ll i = 0; i < r; i++) {
val += log(n - i);
val -= log(i + 1);
}
return val;
}
string bin_expression(ll n, ll dig) {
string s = "";
rep(i, dig) {
s += to_string(n % 2);
n /= 2;
}
reverse(all(s));
return s;
}
bool is_prime(ll n) {
if (n <= 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
map<ll, ll> prime_factorization(ll n) {
ll i = 2;
map<ll, ll> table;
while (i * i <= n) {
while (n % i == 0) {
table[i]++;
n /= i;
}
i++;
}
if (n > 1)
table[n] = 1;
return table;
}
vl divisor_table(ll n) {
vl table;
ll i = 1;
while (i * i <= n) {
if (n % i == 0) {
table.pb(i);
if (i * i != n)
table.pb(n / i);
}
i++;
}
sort(all(table));
return table;
}
ll next_combination(ll sub) {
/*
nCk
ll bit = (1 << k) - 1;
for (; bit < (1 << n); bit = next_combination(bit)){
bool ith = bit & (1 << i);
procedures...
}
sub & -sub: the binary which shares the last digit whose value is 1 in sub
sub + x : carry up the last digit
~y : the binary whose digits are 1 if y's digit is 0.
(sub & ~y) / x: reduce the same number of 0s after first 1 in x from (sub &
~y).
*/
ll x = sub & -sub, y = sub + x;
if (x != 0)
return (((sub & ~y) / x) >> 1) | y;
else
return INF;
}
// just change the input if you want to change the target.
// If you want to check the common sequences in two strings,
// combine them. e.g. ABC150F
template <typename T> vl z_algorithm(T &s, ll n) {
/*
Paramters
---------
T: the string or list of interest
n: the size of string or list
Returns
-------
res[i] is the maximum number of K which satisfies
s[:K] == s[i:i + K]
for each i = 0, 1, 2, ..., n - 1.
*/
vl res(n);
res[0] = n;
ll i1 = 1, i2 = 0;
while (i1 < n) {
/*
i1: the starting point
i2: the length of substring
*/
while (i1 + i2 < n && s[i2] == s[i1 + i2])
++i2;
res[i1] = i2;
if (i2 == 0) {
++i1;
continue;
}
ll i3 = 1;
// update the already seen points
while (i1 + i3 < n && i3 + res[i3] < i2) {
res[i1 + i3] = res[i3];
++i3;
}
// update up to i1 + i3 and the next possible minimum length is i2 - i3 (=
// res[i3])
i1 += i3, i2 -= i3;
}
return res;
}
ll string_to_ll(string s) {
ll l = s.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = s[l - 1 - idx] - '0';
val += (m * tenth);
tenth *= 10;
idx++;
}
return val;
}
string reflected_string(string s) {
string t, u;
ll n = s.length();
t = s;
reverse(all(t));
u = substring(t, 0, n - 2) + s + substring(t, 1, n - 1);
return u;
}
ld distance_between_point_line(point l_begin, point l_end, point p) {
ll xl1 = l_begin.x, yl1 = l_begin.y;
ll xl2 = l_end.x, yl2 = l_end.y;
ll xp = p.x, yp = p.y;
ll a = yl2 - yl1;
ll b = -xl2 + xl1;
ll c = -a * xl2 - b * yl2;
return abs(ld(a * xp + b * yp + c)) / ld(sqrt(a * a + b * b));
}
bool is_cross(point l1_begin, point l1_end, point l2_begin, point l2_end) {
ll x1 = l1_begin.x, y1 = l1_begin.y;
ll x2 = l1_end.x, y2 = l1_end.y;
ll x3 = l2_begin.x, y3 = l2_begin.y;
ll x4 = l2_end.x, y4 = l2_end.y;
ll val1 = (x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3);
ll val2 = (x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4);
ll val3 = (x3 - x4) * (y1 - y3) + (y3 - y4) * (x3 - x1);
ll val4 = (x3 - x4) * (y2 - y3) + (y3 - y4) * (x3 - x2);
return val1 * val2 < 0 && val3 * val4 < 0;
}
template <typename T> bool isColinear(T p1, T p2, T p3) {
T v1 = p2 - p1, v2 = p3 - p1;
return v1.x * v2.y == v1.y * v2.x;
}
template <typename T> T PerpendicularBisector(T p1, T p2) {
T vec = p2 - p1;
assert(!vec.is_zero());
T ret = {vec.y, -vec.x};
return ret;
}
template <typename T> ld Distance2DPoints(T p1, T p2) {
T vec = (p1 - p2) * (p1 - p2);
return sqrt(vec.x + vec.y);
}
ll SquaredDistance2DPoints(point p1, point p2) {
point vec = (p1 - p2) * (p1 - p2);
return vec.x + vec.y;
}
ld space_of_triangle(point p1, point p2, point p3) {
ll x1 = p1.x, y1 = p1.y;
ll x2 = p2.x, y2 = p2.y;
ll x3 = p3.x, y3 = p3.y;
ll v1 = x2 - x1;
ll u1 = y2 - y1;
ll v2 = x3 - x1;
ll u2 = y3 - y1;
ld s = ld(v1 * u2 - u1 * v2) / ld(2);
return abs(s);
}
pair<point, ll> OuterCenter(point p1, point p2, point p3) {
// the center of circle on the given three points
// return the determinant value and the product of center points and 2 *
// determinant value
point ret;
if (isColinear(p1, p2, p3)) {
ll d1 = SquaredDistance2DPoints(p1, p2);
ll d2 = SquaredDistance2DPoints(p2, p3);
ll d3 = SquaredDistance2DPoints(p3, p1);
if (d1 >= d2 && d1 >= d3) {
ret = p1 + p2;
return mp(ret, 2);
} else if (d2 >= d1 && d2 >= d3) {
ret = p2 + p3;
return mp(ret, 2);
} else {
ret = p3 + p1;
return mp(ret, 2);
}
}
point pv1 = PerpendicularBisector(p1, p2);
point pv2 = PerpendicularBisector(p1, p3);
point cv1_2x = p1 + p2, cv2_2x = p1 + p3;
// cv1 + k pv1 == cv2 + m pv2
// (pv1x -pv2x) (k) = (cv2x - cv1x)
// (pv1y -pv2y) (m) = (cv2y - cv1y)
ll det_inv = -pv1.x * pv2.y + pv1.y * pv2.x;
ll x1_2x = cv2_2x.x - cv1_2x.x, x2_2x = cv2_2x.y - cv1_2x.y;
pl c_2x_det = {-pv2.y * x1_2x + pv2.x * x2_2x,
-pv1.y * x1_2x + pv1.x * x2_2x};
// ret.x = ld(cv1_2x.x * det_inv + pv1.x * c_2x_det.e1) / ld(2 * det_inv);
// ret.y = ld(cv1_2x.y * det_inv + pv1.y * c_2x_det.e1) / ld(2 * det_inv);
ret.x = cv1_2x.x * det_inv + pv1.x * c_2x_det.e1;
ret.y = cv1_2x.y * det_inv + pv1.y * c_2x_det.e1;
ll jacobian = 2 * det_inv;
return mp(ret, jacobian);
}
ll inversion_number(vl a, ll a_max) {
/*
Paramters
---------
a: vector<ll>
All the elements must be non-negative.
Prefably the elements are compressed to reduce the computational cost.
a_max: ll
The maximum value of the vector a or the value bigger than the value
stated previously.
*/
BinaryIndexedTree bit(a_max + 1);
ll val = 0;
rep(i, a.size()) {
// i is the number of elements that have lower index than a[i].
// call the number of elements that have lower value than a[i]
// by subtracting these two, the residual number is the number of elements
// that have larger value.
val += i - bit.query(a[i] - 1); // cumulative sum from 0 to a[i] - 1
bit.update(a[i], 1);
}
return val;
}
ld bin_search(ld left, ld right, bool lb, function<bool(ld)> judge) {
ld mid;
while (right - left > EPS) {
mid = (right + left) / 2;
if (lb) {
if (judge(mid))
right = mid;
else
left = mid + EPS;
} else {
if (judge(mid))
left = mid;
else
right = mid - EPS;
}
}
return right;
}
ll bin_search(ll left, ll right, bool lb, function<bool(ll)> judge) {
ll mid;
while (right > left) {
if (lb) {
// if true (satisfies the condition), range shifts smaller direction
mid = (right + left) / 2;
if (judge(mid))
right = mid;
else
left = mid + 1;
} else {
// if true (satisfies the condition), range shitfs larger direction
mid = (right + left + 1) / 2;
if (judge(mid))
left = mid;
else
right = mid - 1;
}
}
return right;
}
ld trinary_search(ld left, ld right, function<ld(ld)> func) {
// Care the value EPS!!! Compare to the condition
while (abs(right - left) > EPS) {
ld left2 = (2.0 * left + right) / 3.0;
ld right2 = (left + 2.0 * right) / 3.0;
ld f1 = func(left2);
ld f2 = func(right2);
if (f1 <= f2)
right = right2;
else if (f2 <= f1)
left = left2;
}
return right;
}
template <typename T> vector<T> compress(vector<T> v) {
// sort and remove all the duplicated values
sort(all(v));
v.erase(unique(all(v)), v.end());
return v;
}
template <typename T> map<T, ll> dict(const vector<T> &v) {
map<T, ll> d;
rep(i, v.size()) d[v[i]] = i;
return d;
}
points compress2D(vl xs, vl ys) {
/*
NOTE
----
Add the corner points if required
*/
ll n = xs.size();
vl xcs = compress(xs), ycs = compress(ys);
map<ll, ll> xd = dict(xcs), yd = dict(ycs);
points ps(n);
rep(i, n) xs[i] = xd[xs[i]], ys[i] = yd[ys[i]];
rep(i, n) ps[i] = {xs[i], ys[i]};
sort(all(ps));
return ps;
}
void GaussJordanBitVector(vl &bs) {
ll n = bs.size();
ll rank = 0;
ll j = 0;
revrep(i, N_DIGITS) {
for (j = rank; j < n; j++)
if (bs[j] & (1LL << i))
break;
if (j == n)
continue;
if (j > rank)
bs[rank] ^= bs[j];
for (j = rank + 1; j < n; j++)
bs[j] = min(bs[j], bs[j] ^ bs[rank]);
rank++;
}
}
ll kruskal(vector<undirected_edge> &es, ll n_vertex) {
// O(ElogE)
sort(all(es));
UnionFind uf(n_vertex);
ll min_cost = 0;
rep(i, es.size()) {
undirected_edge &e = es[i];
if (!uf.is_same(e.from, e.to)) {
min_cost += e.cost;
uf.unite(e.from, e.to);
}
}
return min_cost;
}
ll LongestIncreasedSequence(vl &v) {
ll n = v.size();
vl dp(n, INF);
rep(i, n) * lower_bound(all(dp), v[i]) = v[i];
return lower_bound(all(dp), INF) - dp.begin();
}
void dijkstra(ll start, Graph &graph, vl &dist, vl &vertex_pre,
bool trace = false) {
priority_queue<pl, vpl, greater<pl>> edge_costs;
ll n = graph.size();
dist = vl(n, INF);
if (trace)
vertex_pre = vl(n, -1);
dist[start] = 0;
edge_costs.push(pl(0, start));
while (!edge_costs.empty()) {
ll idx, cost;
tie(cost, idx) = edge_costs.top();
edge_costs.pop();
if (dist[idx] < cost)
continue;
for (auto e : graph[idx]) {
if (dist[e.to] > dist[idx] + e.cost) {
dist[e.to] = dist[idx] + e.cost;
if (trace)
vertex_pre[e.to] = idx;
edge_costs.push(pl(dist[e.to], e.to));
}
}
}
}
vl get_predecessor(ll g, vl &vertex_pre) {
vl path;
for (; g != -1; g = vertex_pre[g])
path.pb(g);
reverse(all(path));
return path;
}
void warshall_floyd(vl2 &dist) {
ll n = dist.size();
// Dont forget the initialization
// rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(k, n) rep(i, n) rep(j, n) dist[i][j] =
min(dist[i][j], dist[i][k] + dist[k][j]);
}
// ABC061D
bool find_negative_cycle(ll n, ll goal, Graph &graph, vl &dist) {
rep(i, n) rep(v, n) rep(k, graph[v].size()) {
edge e = graph[v][k];
if (dist[e.to] != INF && dist[e.to] > dist[v] + e.cost) {
dist[e.to] = -INF;
if (goal == -1)
return true;
else if (goal == e.to)
return true;
}
}
return false;
}
bool bellman_ford(ll start, ll goal, Graph &graph, vl &dist) {
// if there is a closed circuit, it returns false. (when goal == -1)
// if the distance to goal cannot be obtained, it returns false (when goal !=
// -1)
ll n = graph.size();
dist = vl(n, INF);
dist[start] = 0;
rep(i, n) rep(v, n) rep(k, graph[v].size()) {
edge e = graph[v][k];
if (dist[v] != INF && dist[e.to] > dist[v] + e.cost)
dist[e.to] = dist[v] + e.cost;
}
if (find_negative_cycle(n, goal, graph, dist))
return false;
return true;
}
void Euler_Tour(Graph &tree, vl &euler_tour, vl &in, vl &out, ll anc = 0) {
// record only when we first reach a node and leave the node.
ll n = tree.size();
vb visited(n, false);
in = out = vl(n);
auto dfs = [&](auto dfs, ll source) -> void {
visited[source] = true;
in[source] = euler_tour.size();
euler_tour.pb(source);
bool is_leaf = true;
for (auto &e : tree[source]) {
ll target = e.to;
if (visited[target])
continue;
else
is_leaf = false;
dfs(dfs, target);
}
euler_tour.pb(-source);
out[source] = euler_tour.size() - 1;
};
dfs(dfs, anc);
}
void Euler_Tour2(Graph &tree, vl &euler_tour, vl &in, vl &out, ll anc = 0) {
// record everytime we reach a node
ll n = tree.size();
vb visited(n, false);
in = out = vl(n);
auto dfs = [&](auto dfs, ll source) -> void {
visited[source] = true;
in[source] = euler_tour.size();
euler_tour.pb(source);
bool is_leaf = true;
for (auto &e : tree[source]) {
ll target = e.to;
if (visited[target])
continue;
else
is_leaf = false;
dfs(dfs, target);
euler_tour.pb(source);
}
out[source] = euler_tour.size() - 1;
};
dfs(dfs, anc);
}
std::mt19937 create_rand_engine() {
std::random_device rnd;
std::vector<std::uint_least32_t> v(10);
std::generate(v.begin(), v.end(), std::ref(rnd));
std::seed_seq seed(v.begin(), v.end());
return std::mt19937(seed);
}
vl generate_unique_array(const size_t sz, ll vm, ll vM) {
const size_t range = static_cast<size_t>(vM - vm + 1);
const size_t num = static_cast<size_t>(sz * 1.2);
assert(vm <= vM);
assert(sz <= range);
vl ret;
auto engine = create_rand_engine();
std::uniform_int_distribution<ll> distribution(vm, vM);
while (ret.size() < sz) {
while (ret.size() < num)
ret.pb(distribution(engine));
sort(all(ret));
auto unique_end = unique(all(ret));
if (sz < distance(ret.begin(), unique_end))
unique_end = next(ret.begin(), sz);
ret.erase(unique_end, ret.end());
}
return ret;
}
vl generate_array(const size_t sz, ll vm, ll vM) {
const size_t range = static_cast<size_t>(vM - vm + 1);
assert(vm <= vM);
vl ret;
auto engine = create_rand_engine();
std::uniform_int_distribution<ll> distribution(vm, vM);
while (ret.size() < sz)
ret.pb(distribution(engine));
return ret;
}
void read_vector(ll n, vl &v, ll offset = 0) {
v.resize(n);
rep(i, n) {
in1(v[i]);
v[i] += offset;
}
}
void read_points(ll n, points &ps, ll offset = 0) {
ps.resize(n);
rep(i, n) {
ll x, y;
in2(x, y);
ps[i] = {x, y};
ps[i] += offset;
}
}
void read_2DMap(ll w, ll h, vb2 &block, char b) {
block = vb2(w, vb(h, false));
string s;
rep(y, h) {
in1(s);
rep(x, w) block[x][y] = (s[x] == b);
}
}
/*
diameter of tree
Graph tree;
ll dM = 0, vM = 0, v2 = 0;
void dfs1(ll source, ll parent, ll d){
if (d > dM) dM = d, vM = source;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
if (target == parent) continue;
dfs1(target, source, d + 1);
}
}
void dfs2(ll source, ll parent, ll d){
if (dM <= d) dM = d, v2 = source;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
if (target == parent) continue;
dfs2(target, source, d + 1);
}
}
dfs(0, -1, 0);
dfs2(vM, -1, 0);
prl2(vM + 1, v2 + 1); // the two edges of tree
*/
/*
#5. shakutori method (syakutori, two pointers technique)
// 1. strech right side while the condition is met.
// 2. renew the answer
// 3. increments left side
// 4. Back to 1. (l <= r must be satisfied all the time.)
ll l = 0; ll r = 0;
while (l < n){
if (l == r) r++;
while(r < n && cond) r++;
l++;
}
prl(answer);
#11. bfs ABC146D, ABC007C
1. first create a graph.
2. start searching from a node.
3. do some processes and push nodes connected with a given target node in
BFS.
4. repeat a series of procedure until queue is empty.
queue<pl> q;
void bfs(ll source, ll parents){
ll n_edge = graph[source].size();
if (parents != -1) dist[source] = min(dist[source], dist[parents] + 1);
if (visited[source]) return;
visited[source] = true;
rep(idx, n_edge){
ll target = graph[source][idx].to;
if (target == parents) continue;
q.push(mp(target, source));
}
}
q.push(mp(sg.e1, -1));
while(!q.empty()){
pl source = q.front(); q.pop();
bfs(source.e1, source.e2);
}
*/
/*
x1: 0000 0001 0010 0101 0110 0111 0111
x2: xxxx 0001 0011 0100 0101 1000 0110
x1 & x2: 0000 0001 0010 0100 0100 0000 0110
x: 1001 1010 1100 1011 1101 1111
x & ~ x: 0001 0010 0100 0001 0001 0001
sum: 1010 1100 10000 1100 1100 10000
####### Attention #######
S & (1 << i) -> if true, i in S
S | (1 << i) -> S union {i}
S & ~(1 << i) -> S - {i}
__builtin_popcountl(i) -> the number of 1 in binary
#Conditional Operator
condition ? true : false;
# inclusion-exclusion principle
|U[i = 1 to n] Ai| = sum[i = 1 to n] |Ai| - sum[i < j]|Ai ^ Aj| + ... + (-1)^(n
- 1) |^[i = 1 to n]Ai|
*/
const ll MAX_N = 200005;
const size_t MAX_BIT = 12000;
typedef bitset<MAX_BIT> bts;
typedef vector<bts> vbt;
typedef vector<vbt> vbt2;
typedef vector<vbt2> vbt3;
/*
read_graph(n, m, graph, cost, directed, offset)
cost: if link cost is fixed, put positive integer
otherwise -1
directed: if directed true, olse false
offset: if the given vertex is 1-indexed, -1.
*/
void solve() {
bool okay = false;
string S, T, U;
ll A, B, C, D, N, M, H, W, K, x, y, Q, idx, cnt, num, answer;
vl as, bs, cs, ds;
vb2 block;
vb visited;
Graph graph, tree;
points ps;
// generate_array(size, min, max);
in2(N, K);
vl pos, neg;
ll nz = 0;
rep(i, N) {
in1(A);
if (A > 0)
pos.pb(A);
else if (A < 0)
neg.pb(A);
else
nz++;
}
sort(rall(pos));
sort(rall(neg));
ll n_pos = pos.size(), n_neg = neg.size();
if (n_pos + n_neg + nz == K) {
mint ans = 1;
if (nz > 0)
ans = 0;
else {
rep(i, n_pos) ans *= pos[i];
rep(i, n_neg) ans *= neg[i];
}
prl(ans);
return;
} else if (n_pos == 0 && nz == 0 && K % 2 == 1) {
mint ans = 1;
rep(i, K) ans *= neg[i];
prl(ans);
return;
}
vpl tot;
rep(i, n_pos) tot.pb({pos[i], 1});
rep(i, n_neg) tot.pb({-neg[i], -1});
rep(i, nz) tot.pb({0, 0});
sort(rall(tot));
mint ans = 1;
ll nn = 0, zz = 0, n1 = -INF, n2 = -INF, p1 = -INF, p2 = -INF;
rep(i, K) {
ll v1, v2;
tie(v1, v2) = tot[i];
ans *= v1;
if (v2 == -1)
n1 = v1, nn++;
else if (v2 == 1)
p1 = v1;
else if (v2 == 0)
zz++;
}
if (nn % 2 == 0 || zz > 0)
prl(ans);
else if (p1 == -INF) {
ans *= modinv(n1, MOD);
For(i, K, tot.size()) if (tot[i].e2 != -1) {
ans *= tot[i].e1;
break;
}
prl(ans);
} else {
For(i, K, tot.size()) {
ll v1, v2;
tie(v1, v2) = tot[i];
if (p2 == -INF && v2 != -1)
p2 = v1;
if (n2 == -INF && v2 != 1)
n2 = v1;
if (n2 != -INF && p2 != -INF)
break;
}
if (n2 == -INF) {
ans *= modinv(n1, MOD);
ans *= p2;
} else if (p2 == -INF) {
ans *= modinv(p1, MOD);
ans *= n2;
} else if (p1 * p2 < n1 * n2) {
ans *= modinv(p1, MOD);
ans *= n2;
} else {
ans *= modinv(n1, MOD);
ans *= p2;
}
prl(ans);
}
// ### DEBUG PART ###
auto naive_solver = [&]() {};
#ifdef _LOCAL
naive_solver();
#endif
}
void test(ll num = 0, bool verbose = false) {
rep(i, max(1LL, num)) {
ll t = clock();
if (verbose)
prl4("\n#####", i + 1, "#####", "\n## Answer ##");
solve();
if (verbose) {
prl("");
prl_time(t);
}
}
}
int main(void) {
#ifdef _LOCAL
test(4, true);
#else
test(0, false);
#endif
return 0;
}
| replace | 2,079 | 2,081 | 2,079 | 2,086 | 0 | |
p02616 | C++ | Runtime Error | // https://atcoder.jp/contests/abc173/tasks/abc173_e
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <long long Modulus = 1000000007> struct MInt {
long long x;
static const long long mod = Modulus;
MInt(long long a = 0) : x((a % mod + mod) % mod) {}
// operator
MInt &operator=(const MInt &a) {
x = a.x;
return *this;
}
MInt &operator=(const long long &a) {
*this = MInt(a);
return *this;
}
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;
x = 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(long long t) const {
if (t == 0)
return 1;
MInt a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// only for prime mod
MInt Inv() const { return pow(mod - 2); }
// only for prime mod
MInt &operator/=(const MInt &a) { return (*this) *= a.Inv(); }
MInt operator/(const MInt &a) const {
MInt res(*this);
return res /= a;
}
};
template <class TMInt = MInt<>> struct Comb {
std::vector<TMInt> fact, invfact, inv;
long long mod;
Comb(int n) : fact(n + 1), invfact(n + 1), inv(n + 1) {
fact[0] = fact[1] = 1;
mod = fact[0].mod;
invfact[0] = invfact[1] = 1;
inv[1] = 1;
for (int i = 2; i < n; ++i) {
fact[i] = fact[i - 1] * TMInt(i);
long long invx = inv[mod % i].x * (mod - mod / i) % mod;
inv[i] = TMInt(invx);
invfact[i] = invfact[i - 1] * inv[i];
}
}
TMInt operator()(int n, int k) {
if (k < 0 || n < k)
return 0;
return fact[n] * invfact[k] * invfact[n - k];
}
TMInt Perm(int n, int k) {
if (k < 0 || n < k)
return 0;
return fact[n] * invfact[n - k];
}
};
using modint = MInt<>;
using combination = Comb<modint>;
int main() {
int N, K;
cin >> N >> K;
int mnum = 0;
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
if (A[i] < 0) {
++mnum;
}
}
modint ans(1);
if (mnum == N && K % 2 == 1) {
sort(A.begin(), A.end(), std::greater<ll>());
for (int i = 0; i < K; ++i) {
ans *= A[i];
}
cout << ans.x << endl;
return 0;
} else if (N == K) {
for (int i = 0; i < K; ++i) {
ans *= A[i];
}
cout << ans.x << endl;
return 0;
}
sort(A.begin(), A.end(), [](ll a, ll b) { return abs(a) > abs(b); });
// pid : 正整数で末尾に一番近い要素のインデックス
// mid : 負の整数で末尾に一番近い要素のインデックス
int pid = -1, mid = -1;
int cnt = 0; // 負の整数をカウント
for (int i = 0; i < K; ++i) {
if (A[i] > 0)
pid = i;
else if (A[i] < 0)
mid = i, ++cnt;
}
if (cnt % 2 == 0) {
for (int i = 0; i < K; ++i)
ans *= A[i];
cout << ans.x << endl;
return 0;
} else {
// k 番目以降で最初に現れる正の整数のインデックスと負の整数のインデックス
int idxp = -1, idxm = -1;
for (int i = K; i < N; ++i) {
if (A[i] > 0) {
idxp = i;
break;
}
}
for (int i = K; i < N; ++i) {
if (A[i] < 0) {
idxm = i;
break;
}
}
// (+, -)を入れ替える or (-, +) を入れ替える
if ((pid > -1 && idxm > -1) && (mid > -1 && idxp > -1)) {
ll diff = abs(A[idxp]) * abs(A[pid]) - abs(A[idxm]) * abs(A[mid]);
if (diff >= 0) {
swap(A[mid], A[idxp]);
} else if (diff < 0) {
swap(A[pid], A[idxm]);
}
} else if (pid > -1 && idxm > -1 && mid > -1 && idxp == -1) {
swap(A[pid], A[idxm]);
} else if (pid > -1 && idxm > -1 && mid == -1 && idxp > -1) {
swap(A[pid], A[idxm]);
} else if (pid > -1 && idxm > -1 && mid == -1 && idxp == -1) {
swap(A[pid], A[idxm]);
} else if (mid > -1 && idxp > -1 && pid > -1 && idxm == -1) {
swap(A[mid], A[idxp]);
} else if (mid > -1 && idxp > -1 && pid == -1 && idxm > -1) {
swap(A[mid], A[idxp]);
} else if (mid > -1 && idxp > -1 && pid == -1 && idxm == -1) {
swap(A[mid], A[idxp]);
} else if (mid > -1 && pid > -1 && idxp == -1 && idxm == -1) {
cout << 0 << endl;
return 0;
} else if (mid > -1 && pid == -1 && idxp == -1 && idxm > -1) {
swap(A[mid], A[idxp]);
for (int i = K; i < N; ++i) {
if (A[i] == 0) {
cout << 0 << endl;
return 0;
}
}
}
for (int i = 0; i < K; ++i) {
ans *= A[i];
}
cout << ans.x << endl;
return 0;
}
return 0;
}
| // https://atcoder.jp/contests/abc173/tasks/abc173_e
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <long long Modulus = 1000000007> struct MInt {
long long x;
static const long long mod = Modulus;
MInt(long long a = 0) : x((a % mod + mod) % mod) {}
// operator
MInt &operator=(const MInt &a) {
x = a.x;
return *this;
}
MInt &operator=(const long long &a) {
*this = MInt(a);
return *this;
}
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;
x = 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(long long t) const {
if (t == 0)
return 1;
MInt a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// only for prime mod
MInt Inv() const { return pow(mod - 2); }
// only for prime mod
MInt &operator/=(const MInt &a) { return (*this) *= a.Inv(); }
MInt operator/(const MInt &a) const {
MInt res(*this);
return res /= a;
}
};
template <class TMInt = MInt<>> struct Comb {
std::vector<TMInt> fact, invfact, inv;
long long mod;
Comb(int n) : fact(n + 1), invfact(n + 1), inv(n + 1) {
fact[0] = fact[1] = 1;
mod = fact[0].mod;
invfact[0] = invfact[1] = 1;
inv[1] = 1;
for (int i = 2; i < n; ++i) {
fact[i] = fact[i - 1] * TMInt(i);
long long invx = inv[mod % i].x * (mod - mod / i) % mod;
inv[i] = TMInt(invx);
invfact[i] = invfact[i - 1] * inv[i];
}
}
TMInt operator()(int n, int k) {
if (k < 0 || n < k)
return 0;
return fact[n] * invfact[k] * invfact[n - k];
}
TMInt Perm(int n, int k) {
if (k < 0 || n < k)
return 0;
return fact[n] * invfact[n - k];
}
};
using modint = MInt<>;
using combination = Comb<modint>;
int main() {
int N, K;
cin >> N >> K;
int mnum = 0;
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
if (A[i] < 0) {
++mnum;
}
}
modint ans(1);
if (mnum == N && K % 2 == 1) {
sort(A.begin(), A.end(), std::greater<ll>());
for (int i = 0; i < K; ++i) {
ans *= A[i];
}
cout << ans.x << endl;
return 0;
} else if (N == K) {
for (int i = 0; i < K; ++i) {
ans *= A[i];
}
cout << ans.x << endl;
return 0;
}
sort(A.begin(), A.end(), [](ll a, ll b) { return abs(a) > abs(b); });
// pid : 正整数で末尾に一番近い要素のインデックス
// mid : 負の整数で末尾に一番近い要素のインデックス
int pid = -1, mid = -1;
int cnt = 0; // 負の整数をカウント
for (int i = 0; i < K; ++i) {
if (A[i] > 0)
pid = i;
else if (A[i] < 0)
mid = i, ++cnt;
}
if (cnt % 2 == 0) {
for (int i = 0; i < K; ++i)
ans *= A[i];
cout << ans.x << endl;
return 0;
} else {
// k 番目以降で最初に現れる正の整数のインデックスと負の整数のインデックス
int idxp = -1, idxm = -1;
for (int i = K; i < N; ++i) {
if (A[i] > 0) {
idxp = i;
break;
}
}
for (int i = K; i < N; ++i) {
if (A[i] < 0) {
idxm = i;
break;
}
}
// (+, -)を入れ替える or (-, +) を入れ替える
if ((pid > -1 && idxm > -1) && (mid > -1 && idxp > -1)) {
ll diff = abs(A[idxp]) * abs(A[pid]) - abs(A[idxm]) * abs(A[mid]);
if (diff >= 0) {
swap(A[mid], A[idxp]);
} else if (diff < 0) {
swap(A[pid], A[idxm]);
}
} else if (pid > -1 && idxm > -1 && mid > -1 && idxp == -1) {
swap(A[pid], A[idxm]);
} else if (pid > -1 && idxm > -1 && mid == -1 && idxp > -1) {
swap(A[pid], A[idxm]);
} else if (pid > -1 && idxm > -1 && mid == -1 && idxp == -1) {
swap(A[pid], A[idxm]);
} else if (mid > -1 && idxp > -1 && pid > -1 && idxm == -1) {
swap(A[mid], A[idxp]);
} else if (mid > -1 && idxp > -1 && pid == -1 && idxm > -1) {
swap(A[mid], A[idxp]);
} else if (mid > -1 && idxp > -1 && pid == -1 && idxm == -1) {
swap(A[mid], A[idxp]);
} else if (mid > -1 && pid > -1 && idxp == -1 && idxm == -1) {
cout << 0 << endl;
return 0;
} else if (mid > -1 && pid == -1 && idxp == -1 && idxm > -1) {
swap(A[mid], A[idxm]);
for (int i = K; i < N; ++i) {
if (A[i] == 0) {
cout << 0 << endl;
return 0;
}
}
}
for (int i = 0; i < K; ++i) {
ans *= A[i];
}
cout << ans.x << endl;
return 0;
}
return 0;
}
| replace | 203 | 204 | 203 | 204 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 1000000007;
int main() {
int N, K;
cin >> N >> K;
vector<ll> a, b;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (x >= 0)
a.push_back(x);
else
b.push_back(x);
}
sort(a.begin(), a.end(), greater<ll>());
sort(b.begin(), b.end(), greater<ll>());
int i, j;
i = j = 0;
ll k = 1;
ll ans = 1;
if (N == K) {
for (ll i : a) {
ans *= i;
ans %= mod;
}
for (ll j : b) {
ans *= j;
ans += mod * ((ans * -1 + mod - 1) / mod);
}
cout << ans << endl;
return 0;
}
if (K % 2 == 1) {
if (a.size() == 0) {
for (int i = 0; i < K; i++) {
ans *= b[i];
if (ans >= 0)
ans %= mod;
else {
ans += mod * ((ans * -1 + mod - 1) / mod);
}
}
cout << ans << endl;
return 0;
} else {
ans *= a[0];
K--;
i++;
}
}
sort(b.begin(), b.end());
while (K > 0) {
if (a.size() > i + 1 && a[i] * a[i + 1] >= b[j] * b[j + 1]) {
ans *= a[i];
ans %= mod;
ans *= a[i + 1];
ans %= mod;
i += 2;
K -= 2;
} else {
ans *= abs(b[j]);
ans %= mod;
ans *= abs(b[j + 1]);
ans %= mod;
j += 2;
K -= 2;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 1000000007;
int main() {
int N, K;
cin >> N >> K;
vector<ll> a, b;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (x >= 0)
a.push_back(x);
else
b.push_back(x);
}
sort(a.begin(), a.end(), greater<ll>());
sort(b.begin(), b.end(), greater<ll>());
int i, j;
i = j = 0;
ll k = 1;
ll ans = 1;
if (N == K) {
for (ll i : a) {
ans *= i;
ans %= mod;
}
for (ll j : b) {
ans *= j;
ans += mod * ((ans * -1 + mod - 1) / mod);
}
cout << ans << endl;
return 0;
}
if (K % 2 == 1) {
if (a.size() == 0) {
for (int i = 0; i < K; i++) {
ans *= b[i];
if (ans >= 0)
ans %= mod;
else {
ans += mod * ((ans * -1 + mod - 1) / mod);
}
}
cout << ans << endl;
return 0;
} else {
ans *= a[0];
K--;
i++;
}
}
sort(b.begin(), b.end());
while (K > 0) {
if (b.size() <= j + 1 ||
(a.size() > i + 1 && a[i] * a[i + 1] >= b[j] * b[j + 1])) {
ans *= a[i];
ans %= mod;
ans *= a[i + 1];
ans %= mod;
i += 2;
K -= 2;
} else {
ans *= abs(b[j]);
ans %= mod;
ans *= abs(b[j + 1]);
ans %= mod;
j += 2;
K -= 2;
}
}
cout << ans << endl;
}
| replace | 60 | 61 | 60 | 62 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for (int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll)1e9 + 7;
// constexpr long long MOD = 998244353LL;
using ld = long double;
static const ld pi = 3.141592653589793L;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
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;
}
struct Edge {
ll to, rev;
long double cap;
Edge(ll _to, long double _cap, ll _rev) {
to = _to;
cap = _cap;
rev = _rev;
}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
void add_edge(Graph &G, ll from, ll to, long double cap, bool revFlag,
long double revCap) {
G[from].push_back(Edge(to, cap, (ll)G[to].size()));
if (revFlag)
G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using mint = ModInt<MOD>;
void solve() {
ll k, n;
cin >> n >> k;
vec<ll> a(n);
REP(i, n) { cin >> a[i]; }
if (k == n) {
mint ans = 1;
REP2(i, n) { ans *= a[i]; }
cout << ans << en;
return;
}
vec<ll> p, m;
ll con0 = 0;
REP(i, n) {
if (a[i] > 0)
p.push_back(a[i]);
else if (a[i] < 0)
m.push_back(a[i]);
else
con0++;
}
if (n - con0 < k or (con0 and ((k % 2 and n - con0 == m.size()) or
(n - con0 == k and m.size() % 2)))) {
cout << 0 << en;
return;
}
sort(all(m));
sort(all(p), greater<ll>());
if (k % 2 and n == m.size()) {
mint ans = 1;
REP2(i, n) {
if (k == 0)
break;
ans *= m[i];
k--;
}
cout << ans << en;
return;
}
vec<P> ms;
mint ans = 1;
for (int i = 0; i + 1 < n; i += 2) {
if (k < 2)
break;
ms.push_back({m[i], m[i + 1]});
ans *= m[i];
ans *= m[i + 1];
k -= 2;
}
for (int i = 0; i < k; i++) {
ans *= p[i];
}
for (int i = k; i + 1 < p.size(); i += 2) {
if (!ms.size())
break;
auto [m1, m2] = ms[ms.size() - 1];
if (m1 * m2 < p[i] * p[i + 1]) {
ans /= m1;
ans /= m2;
ms.pop_back();
ans *= p[i];
ans *= p[i + 1];
} else {
break;
}
}
cout << ans << en;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
/*
ll t;
cin >> t;
REP(i, t)
solve();
*/
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for (int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll)1e9 + 7;
// constexpr long long MOD = 998244353LL;
using ld = long double;
static const ld pi = 3.141592653589793L;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
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;
}
struct Edge {
ll to, rev;
long double cap;
Edge(ll _to, long double _cap, ll _rev) {
to = _to;
cap = _cap;
rev = _rev;
}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
void add_edge(Graph &G, ll from, ll to, long double cap, bool revFlag,
long double revCap) {
G[from].push_back(Edge(to, cap, (ll)G[to].size()));
if (revFlag)
G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using mint = ModInt<MOD>;
void solve() {
ll k, n;
cin >> n >> k;
vec<ll> a(n);
REP(i, n) { cin >> a[i]; }
if (k == n) {
mint ans = 1;
REP2(i, n) { ans *= a[i]; }
cout << ans << en;
return;
}
vec<ll> p, m;
ll con0 = 0;
REP(i, n) {
if (a[i] > 0)
p.push_back(a[i]);
else if (a[i] < 0)
m.push_back(a[i]);
else
con0++;
}
if (n - con0 < k or (con0 and ((k % 2 and n - con0 == m.size()) or
(n - con0 == k and m.size() % 2)))) {
cout << 0 << en;
return;
}
sort(all(m));
sort(all(p), greater<ll>());
if (k % 2 and n == m.size()) {
mint ans = 1;
REP2(i, n) {
if (k == 0)
break;
ans *= m[i];
k--;
}
cout << ans << en;
return;
}
vec<P> ms;
mint ans = 1;
for (int i = 0; i + 1 < m.size(); i += 2) {
if (k < 2)
break;
ms.push_back({m[i], m[i + 1]});
ans *= m[i];
ans *= m[i + 1];
k -= 2;
}
for (int i = 0; i < k; i++) {
ans *= p[i];
}
for (int i = k; i + 1 < p.size(); i += 2) {
if (!ms.size())
break;
auto [m1, m2] = ms[ms.size() - 1];
if (m1 * m2 < p[i] * p[i + 1]) {
ans /= m1;
ans /= m2;
ms.pop_back();
ans *= p[i];
ans *= p[i + 1];
} else {
break;
}
}
cout << ans << en;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
/*
ll t;
cin >> t;
REP(i, t)
solve();
*/
return 0;
}
| replace | 181 | 182 | 181 | 182 | 0 | |
p02616 | C++ | Runtime Error | #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
const int MOD = 1'000'000'007;
const int INF = 1'000'000'000; // 1e9
const int NIL = -1;
const long long LINF = 1'000'000'000'000'000'000; // 1e18
const long double EPS = 1E-10;
template <class T, class S> inline bool chmax(T &a, const S &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class S> inline bool chmin(T &a, const S &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
int main() {
int N, K;
std::cin >> N >> K;
int zero(0), pos(0);
std::vector<std::pair<int, int>> A(N);
{
int a;
for (int i(0); i < N; ++i) {
std::cin >> a;
A[i].first = std::abs(a);
if (A[i].first)
A[i].second = a / A[i].first;
else
++zero;
if (A[i].second == 1)
++pos;
}
}
std::sort(std::rbegin(A), std::rend(A));
if ((K & 1) && !pos)
std::sort(std::begin(A), std::begin(A) + N - zero);
long long ans(1);
int sgn(1);
if (!pos && zero && (K & 1))
ans = 0;
else {
for (int i(0); i < K; ++i)
sgn *= A[i].second;
if (!pos || sgn > -1 || N == K) {
for (int i(0); i < K; ++i) {
ans *= A[i].first;
ans %= MOD;
}
ans *= sgn;
if (ans < 0)
ans += MOD;
} else {
long long a(-1), b(-1), c(-1), d(-1);
int it(NIL);
for (int j(K); j < N; ++j) {
if (!A[j].second)
break;
if (A[j].second != A[K - 1].second) {
it = j;
break;
}
}
if (it != NIL) {
a = A[K - 1].first;
b = A[it].first;
}
int it2(NIL), it3(NIL);
for (int j(K - 2); j >= 0; --j) {
if (A[j].second != A[K - 1].second) {
it2 = j;
break;
}
}
for (int j(K); j < N; ++j) {
if (A[j].second != A[it2].second) {
it3 = j;
break;
}
}
c = A[it2].first;
d = A[it3].first;
if (a == -1)
std::swap(A[it2], A[it3]);
else if (c == -1 || d == -1)
std::swap(A[it], A[K - 1]);
else if (b * c < a * d)
std::swap(A[it2], A[it3]);
else
std::swap(A[it], A[K - 1]);
for (int i(0); i < K; ++i) {
ans *= A[i].first;
ans %= MOD;
}
}
}
std::cout << ans << std::endl;
return 0;
}
| #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
const int MOD = 1'000'000'007;
const int INF = 1'000'000'000; // 1e9
const int NIL = -1;
const long long LINF = 1'000'000'000'000'000'000; // 1e18
const long double EPS = 1E-10;
template <class T, class S> inline bool chmax(T &a, const S &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class S> inline bool chmin(T &a, const S &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
int main() {
int N, K;
std::cin >> N >> K;
int zero(0), pos(0);
std::vector<std::pair<int, int>> A(N);
{
int a;
for (int i(0); i < N; ++i) {
std::cin >> a;
A[i].first = std::abs(a);
if (A[i].first)
A[i].second = a / A[i].first;
else
++zero;
if (A[i].second == 1)
++pos;
}
}
std::sort(std::rbegin(A), std::rend(A));
if ((K & 1) && !pos)
std::sort(std::begin(A), std::begin(A) + N - zero);
long long ans(1);
int sgn(1);
if (!pos && zero && (K & 1))
ans = 0;
else {
for (int i(0); i < K; ++i)
sgn *= A[i].second;
if (!pos || sgn > -1 || N == K) {
for (int i(0); i < K; ++i) {
ans *= A[i].first;
ans %= MOD;
}
ans *= sgn;
if (ans < 0)
ans += MOD;
} else {
long long a(-1), b(-1), c(-1), d(-1);
int it(NIL);
for (int j(K); j < N; ++j) {
if (!A[j].second)
break;
if (A[j].second != A[K - 1].second) {
it = j;
break;
}
}
if (it != NIL) {
a = A[K - 1].first;
b = A[it].first;
}
int it2(NIL), it3(NIL);
for (int j(K - 2); j >= 0; --j) {
if (A[j].second != A[K - 1].second) {
it2 = j;
break;
}
}
for (int j(K); j < N; ++j) {
if (A[j].second != A[it2].second) {
it3 = j;
break;
}
}
if (it2 != NIL && it3 != NIL) {
c = A[it2].first;
d = A[it3].first;
}
if (a == -1)
std::swap(A[it2], A[it3]);
else if (c == -1 || d == -1)
std::swap(A[it], A[K - 1]);
else if (b * c < a * d)
std::swap(A[it2], A[it3]);
else
std::swap(A[it], A[K - 1]);
for (int i(0); i < K; ++i) {
ans *= A[i].first;
ans %= MOD;
}
}
}
std::cout << ans << std::endl;
return 0;
}
| replace | 119 | 121 | 119 | 124 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr ll INF = 3000000000000000000;
constexpr int MOD = 1000000007;
struct ModInt {
ll x;
ModInt(ll a) : x((a % MOD + MOD) % MOD) {}
ModInt operator-() const { return ModInt(-x); }
ModInt &operator+=(const ModInt &a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
ModInt &operator-=(const ModInt &a) {
if ((x -= a.x) < 0)
x += MOD;
return *this;
}
ModInt &operator*=(const ModInt &a) {
(x *= a.x) %= MOD;
return *this;
}
ModInt operator+(const ModInt &a) const {
ModInt res(*this);
return res += a;
}
ModInt operator-(const ModInt &a) const {
ModInt res(*this);
return res -= a;
}
ModInt operator*(const ModInt &a) const {
ModInt res(*this);
return res *= a;
}
ModInt pow(ll t) const {
if (!t)
return 1;
ModInt a = pow(t / 2);
a *= a;
if (t & 1)
a *= *this;
return a;
}
ModInt inv() const { return pow(MOD - 2); }
ModInt &operator/=(const ModInt &a) { return (*this) *= a.inv(); }
ModInt operator/(const ModInt &a) const {
ModInt res(*this);
return res /= a;
}
friend istream &operator>>(istream &is, ModInt &a) {
is >> a.x;
return is;
}
friend ostream &operator<<(ostream &os, const ModInt &a) {
os << a.x;
return os;
}
};
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
REP(i, n) cin >> a[i];
vector<ll> mai, zer, plu;
REP(i, n) {
if (a[i] > 0)
plu.push_back(a[i]);
if (a[i] == 0)
zer.push_back(a[i]);
if (a[i] < 0)
mai.push_back(a[i]);
}
sort(ALL(mai));
sort(ALL(plu));
reverse(ALL(plu));
int ans = -1;
REP(i, n + 1) {
if (i & 1)
continue;
if (i > SZ(mai))
continue;
if (i > k)
continue;
if (i + SZ(plu) < k)
continue;
if (ans == -1) {
ans = i;
} else {
if (mai[i - 2] * mai[i - 1] > plu[k - i] * plu[k - i + 1]) {
ans = i;
} else {
break;
}
}
}
if (ans == -1) {
if (SZ(zer)) {
cout << 0 << "\n";
} else {
reverse(ALL(mai));
REP(i, n + 1) {
if (!(i & 1))
continue;
if (i > SZ(mai))
continue;
if (i > k)
continue;
if (i + SZ(plu) < k)
continue;
if (ans == -1) {
ans = i;
} else {
if (mai[i - 2] * mai[i - 1] < plu[k - i] * plu[k - i + 1]) {
ans = i;
} else {
break;
}
}
}
}
}
ModInt answer(1);
REP(i, ans) { answer *= ModInt(mai[i]); }
REP(i, k - ans) { answer *= ModInt(plu[i]); }
cout << answer << "\n";
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr ll INF = 3000000000000000000;
constexpr int MOD = 1000000007;
struct ModInt {
ll x;
ModInt(ll a) : x((a % MOD + MOD) % MOD) {}
ModInt operator-() const { return ModInt(-x); }
ModInt &operator+=(const ModInt &a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
ModInt &operator-=(const ModInt &a) {
if ((x -= a.x) < 0)
x += MOD;
return *this;
}
ModInt &operator*=(const ModInt &a) {
(x *= a.x) %= MOD;
return *this;
}
ModInt operator+(const ModInt &a) const {
ModInt res(*this);
return res += a;
}
ModInt operator-(const ModInt &a) const {
ModInt res(*this);
return res -= a;
}
ModInt operator*(const ModInt &a) const {
ModInt res(*this);
return res *= a;
}
ModInt pow(ll t) const {
if (!t)
return 1;
ModInt a = pow(t / 2);
a *= a;
if (t & 1)
a *= *this;
return a;
}
ModInt inv() const { return pow(MOD - 2); }
ModInt &operator/=(const ModInt &a) { return (*this) *= a.inv(); }
ModInt operator/(const ModInt &a) const {
ModInt res(*this);
return res /= a;
}
friend istream &operator>>(istream &is, ModInt &a) {
is >> a.x;
return is;
}
friend ostream &operator<<(ostream &os, const ModInt &a) {
os << a.x;
return os;
}
};
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
REP(i, n) cin >> a[i];
vector<ll> mai, zer, plu;
REP(i, n) {
if (a[i] > 0)
plu.push_back(a[i]);
if (a[i] == 0)
zer.push_back(a[i]);
if (a[i] < 0)
mai.push_back(a[i]);
}
sort(ALL(mai));
sort(ALL(plu));
reverse(ALL(plu));
int ans = -1;
REP(i, n + 1) {
if (i & 1)
continue;
if (i > SZ(mai))
continue;
if (i > k)
continue;
if (i + SZ(plu) < k)
continue;
if (ans == -1) {
ans = i;
} else {
if (mai[i - 2] * mai[i - 1] > plu[k - i] * plu[k - i + 1]) {
ans = i;
} else {
break;
}
}
}
if (ans == -1) {
if (SZ(zer)) {
cout << 0 << "\n";
return 0;
} else {
reverse(ALL(mai));
REP(i, n + 1) {
if (!(i & 1))
continue;
if (i > SZ(mai))
continue;
if (i > k)
continue;
if (i + SZ(plu) < k)
continue;
if (ans == -1) {
ans = i;
} else {
if (mai[i - 2] * mai[i - 1] < plu[k - i] * plu[k - i + 1]) {
ans = i;
} else {
break;
}
}
}
}
}
ModInt answer(1);
REP(i, ans) { answer *= ModInt(mai[i]); }
REP(i, k - ans) { answer *= ModInt(plu[i]); }
cout << answer << "\n";
return 0;
}
| insert | 118 | 118 | 118 | 119 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
using pii = pair<int, int>;
using piii = pair<pii, int>;
using pll = pair<long long, long long>;
using plll = pair<pll, long long>;
// #pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define isSquare(x) (sqrt(x) * sqrt(x) == x)
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
};
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
};
inline void in(void) { return; }
template <typename First, typename... Rest>
void in(First &first, Rest &...rest) {
cin >> first;
in(rest...);
return;
}
inline void out(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void out(First first, Rest... rest) {
cout << first << " ";
out(rest...);
return;
}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int INF = 1e9;
const long long INFLL = 1e18;
void iosetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T>
pair<S, T> operator*(const pair<S, T> &s, const S &t) {
return pair<S, T>(s.first * t, s.second * t);
}
template <typename T> void Exit(T first) {
cout << first << endl;
exit(0);
};
template <int mod> struct ModInt {
unsigned x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<mod>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const pii dxy[4] = {pii(1, 0), pii(0, 1), pii(-1, 0), pii(0, -1)};
bool range(int a, int b, int x) {
if (a <= x and x < b)
return true;
else
return false;
}
bool range(int a, int b, int c, int d, pii p) {
if (a <= p.first and p.first < b and c <= p.second and p.second < d)
return true;
else
return false;
}
int main() {
iosetup();
int n, k;
cin >> n >> k;
vector<ll> a(n);
cin >> a;
sort(ALL(a), greater<ll>());
vector<ll> minus, plus, muls;
rep(i, 0, n) {
if (a[i] >= 0)
plus.emplace_back(a[i]);
else
minus.emplace_back(a[i]);
}
modint ans = 1;
sort(ALL(plus), greater<ll>());
sort(ALL(minus));
if (k == n) {
rep(i, 0, k) ans *= minus[i];
Exit(ans);
}
// if(a[0] <= 0 and a.back() <= 0){
// sort(ALL(minus), greater<ll>());
// rep(i, 0, k) ans *= minus[i];
// Exit(ans);
// }
if (a[0] <= 0 and a.back() <= 0) {
if (k % 2 == 0)
reverse(ALL(a));
rep(i, 0, k) ans *= a[i];
Exit(ans);
}
if (minus.size() % 2)
minus.pop_back();
if (k % 2)
ans *= plus[0], plus.erase(plus.begin()), k--;
vector<ll> d, e;
for (int i = 0; i < (int)plus.size(); i += 2) {
if (i + 1 == plus.size())
e.emplace_back(plus[i]);
else
muls.emplace_back(plus[i] * plus[i + 1]);
}
for (int i = 0; i + 1 < (int)minus.size(); i += 2) {
muls.emplace_back(minus[i] * minus[i + 1]);
}
k /= 2;
sort(ALL(muls), greater<ll>());
rep(i, 0, k) ans *= muls[i];
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
using pii = pair<int, int>;
using piii = pair<pii, int>;
using pll = pair<long long, long long>;
using plll = pair<pll, long long>;
// #pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define isSquare(x) (sqrt(x) * sqrt(x) == x)
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
};
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
};
inline void in(void) { return; }
template <typename First, typename... Rest>
void in(First &first, Rest &...rest) {
cin >> first;
in(rest...);
return;
}
inline void out(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void out(First first, Rest... rest) {
cout << first << " ";
out(rest...);
return;
}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int INF = 1e9;
const long long INFLL = 1e18;
void iosetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T>
pair<S, T> operator*(const pair<S, T> &s, const S &t) {
return pair<S, T>(s.first * t, s.second * t);
}
template <typename T> void Exit(T first) {
cout << first << endl;
exit(0);
};
template <int mod> struct ModInt {
unsigned x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<mod>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const pii dxy[4] = {pii(1, 0), pii(0, 1), pii(-1, 0), pii(0, -1)};
bool range(int a, int b, int x) {
if (a <= x and x < b)
return true;
else
return false;
}
bool range(int a, int b, int c, int d, pii p) {
if (a <= p.first and p.first < b and c <= p.second and p.second < d)
return true;
else
return false;
}
int main() {
iosetup();
int n, k;
cin >> n >> k;
vector<ll> a(n);
cin >> a;
sort(ALL(a), greater<ll>());
vector<ll> minus, plus, muls;
rep(i, 0, n) {
if (a[i] >= 0)
plus.emplace_back(a[i]);
else
minus.emplace_back(a[i]);
}
modint ans = 1;
sort(ALL(plus), greater<ll>());
sort(ALL(minus));
if (k == n) {
rep(i, 0, k) ans *= a[i];
Exit(ans);
}
// if(a[0] <= 0 and a.back() <= 0){
// sort(ALL(minus), greater<ll>());
// rep(i, 0, k) ans *= minus[i];
// Exit(ans);
// }
if (a[0] <= 0 and a.back() <= 0) {
if (k % 2 == 0)
reverse(ALL(a));
rep(i, 0, k) ans *= a[i];
Exit(ans);
}
if (minus.size() % 2)
minus.pop_back();
if (k % 2)
ans *= plus[0], plus.erase(plus.begin()), k--;
vector<ll> d, e;
for (int i = 0; i < (int)plus.size(); i += 2) {
if (i + 1 == plus.size())
e.emplace_back(plus[i]);
else
muls.emplace_back(plus[i] * plus[i + 1]);
}
for (int i = 0; i + 1 < (int)minus.size(); i += 2) {
muls.emplace_back(minus[i] * minus[i + 1]);
}
k /= 2;
sort(ALL(muls), greater<ll>());
rep(i, 0, k) ans *= muls[i];
cout << ans << endl;
return 0;
} | replace | 216 | 217 | 216 | 217 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using Int = long long; // clang-format off
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false), std::cout << std::fixed << std::setprecision(13); } } setup_io;
#ifndef dump
#define dump(...)
#endif // clang-format on
/**
* author: knshnb
* created: Sun Jul 5 21:54:22 JST 2020
**/
template <class T> T pow(T x, long long n, const T UNION = 1) {
T ret = UNION;
while (n) {
if (n & 1)
ret *= x;
x *= x;
n >>= 1;
}
return ret;
}
/// @docs src/Math/ModInt.md
template <int Mod> struct ModInt {
int x;
static int runtime_mod;
static std::unordered_map<int, int> to_inv;
// テンプレート引数が負のときは実行時ModInt
static int mod() { return Mod < 0 ? runtime_mod : Mod; }
static void set_runtime_mod(int mod) {
static_assert(Mod < 0,
"template parameter Mod must be negative for runtime ModInt");
runtime_mod = mod;
to_inv.clear();
}
ModInt() : x(0) {}
ModInt(long long x_) {
if ((x = x_ % mod() + mod()) >= mod())
x -= mod();
}
ModInt &operator+=(ModInt rhs) {
if ((x += rhs.x) >= mod())
x -= mod();
return *this;
}
ModInt &operator*=(ModInt rhs) {
x = (unsigned long long)x * rhs.x % mod();
return *this;
}
ModInt &operator-=(ModInt rhs) {
if ((x -= rhs.x) < 0)
x += mod();
return *this;
}
ModInt &operator/=(ModInt rhs) {
x = (unsigned long long)x * rhs.inv().x % mod();
return *this;
}
ModInt operator-() const { return -x < 0 ? mod() - x : -x; }
ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }
ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }
ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }
ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }
bool operator==(ModInt rhs) const { return x == rhs.x; }
bool operator!=(ModInt rhs) const { return x != rhs.x; }
ModInt inv() const {
return to_inv.count(this->x) ? to_inv[this->x]
: (to_inv[this->x] = pow(*this, mod() - 2).x);
}
friend std::ostream &operator<<(std::ostream &s, ModInt<Mod> a) {
s << a.x;
return s;
}
friend std::istream &operator>>(std::istream &s, ModInt<Mod> &a) {
long long tmp;
s >> tmp;
a = ModInt<Mod>(tmp);
return s;
}
friend std::string to_string(ModInt<Mod> a) { return std::to_string(a.x); }
};
template <int Mod> std::unordered_map<int, int> ModInt<Mod>::to_inv;
template <int Mod> int ModInt<Mod>::runtime_mod;
#ifndef CALL_FROM_TEST
using mint = ModInt<1000000007>;
#endif
signed main() {
Int n, K;
std::cin >> n >> K;
std::vector<Int> a(n);
REP(i, n) std::cin >> a[i];
std::sort(a.begin(), a.end());
mint ans = 1;
if (K == n) {
REP(i, n) ans *= a[i];
} else if (a[0] >= 0 && a.back() >= 0) {
for (Int i = n - 1; i >= n - K; i--)
ans *= a[i];
} else if (a[0] <= 0 && a.back() <= 0) {
if (K % 2)
std::reverse(a.begin(), a.end());
REP(i, K) ans *= a[i];
} else {
std::vector<Int> minus, plus;
REP(i, n) { (a[i] >= 0 ? plus : minus).push_back(std::abs(a[i])); }
std::sort(minus.rbegin(), minus.rend());
std::sort(plus.rbegin(), plus.rend());
Int p = std::max(0LL, K - (Int)plus.size());
if (p % 2)
p++;
while (1) {
if (p + 1 >= minus.size())
break;
if (minus[p] * minus[p + 1] < plus[K - p - 1] * plus[K - p - 2])
break;
p += 2;
}
assert(K - p <= plus.size());
REP(i, p) ans *= minus[i];
REP(i, K - p) ans *= plus[i];
}
std::cout << ans << std::endl;
}
| #include <bits/stdc++.h>
using Int = long long; // clang-format off
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false), std::cout << std::fixed << std::setprecision(13); } } setup_io;
#ifndef dump
#define dump(...)
#endif // clang-format on
/**
* author: knshnb
* created: Sun Jul 5 21:54:22 JST 2020
**/
template <class T> T pow(T x, long long n, const T UNION = 1) {
T ret = UNION;
while (n) {
if (n & 1)
ret *= x;
x *= x;
n >>= 1;
}
return ret;
}
/// @docs src/Math/ModInt.md
template <int Mod> struct ModInt {
int x;
static int runtime_mod;
static std::unordered_map<int, int> to_inv;
// テンプレート引数が負のときは実行時ModInt
static int mod() { return Mod < 0 ? runtime_mod : Mod; }
static void set_runtime_mod(int mod) {
static_assert(Mod < 0,
"template parameter Mod must be negative for runtime ModInt");
runtime_mod = mod;
to_inv.clear();
}
ModInt() : x(0) {}
ModInt(long long x_) {
if ((x = x_ % mod() + mod()) >= mod())
x -= mod();
}
ModInt &operator+=(ModInt rhs) {
if ((x += rhs.x) >= mod())
x -= mod();
return *this;
}
ModInt &operator*=(ModInt rhs) {
x = (unsigned long long)x * rhs.x % mod();
return *this;
}
ModInt &operator-=(ModInt rhs) {
if ((x -= rhs.x) < 0)
x += mod();
return *this;
}
ModInt &operator/=(ModInt rhs) {
x = (unsigned long long)x * rhs.inv().x % mod();
return *this;
}
ModInt operator-() const { return -x < 0 ? mod() - x : -x; }
ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }
ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }
ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }
ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }
bool operator==(ModInt rhs) const { return x == rhs.x; }
bool operator!=(ModInt rhs) const { return x != rhs.x; }
ModInt inv() const {
return to_inv.count(this->x) ? to_inv[this->x]
: (to_inv[this->x] = pow(*this, mod() - 2).x);
}
friend std::ostream &operator<<(std::ostream &s, ModInt<Mod> a) {
s << a.x;
return s;
}
friend std::istream &operator>>(std::istream &s, ModInt<Mod> &a) {
long long tmp;
s >> tmp;
a = ModInt<Mod>(tmp);
return s;
}
friend std::string to_string(ModInt<Mod> a) { return std::to_string(a.x); }
};
template <int Mod> std::unordered_map<int, int> ModInt<Mod>::to_inv;
template <int Mod> int ModInt<Mod>::runtime_mod;
#ifndef CALL_FROM_TEST
using mint = ModInt<1000000007>;
#endif
signed main() {
Int n, K;
std::cin >> n >> K;
std::vector<Int> a(n);
REP(i, n) std::cin >> a[i];
std::sort(a.begin(), a.end());
mint ans = 1;
if (K == n) {
REP(i, n) ans *= a[i];
} else if (a[0] >= 0 && a.back() >= 0) {
for (Int i = n - 1; i >= n - K; i--)
ans *= a[i];
} else if (a[0] <= 0 && a.back() <= 0) {
if (K % 2)
std::reverse(a.begin(), a.end());
REP(i, K) ans *= a[i];
} else {
std::vector<Int> minus, plus;
REP(i, n) { (a[i] >= 0 ? plus : minus).push_back(std::abs(a[i])); }
std::sort(minus.rbegin(), minus.rend());
std::sort(plus.rbegin(), plus.rend());
Int p = std::max(0LL, K - (Int)plus.size());
if (p % 2)
p++;
while (1) {
if (p + 1 >= minus.size())
break;
if (K - p - 2 < 0)
break;
if (minus[p] * minus[p + 1] < plus[K - p - 1] * plus[K - p - 2])
break;
p += 2;
}
assert(K - p <= plus.size());
REP(i, p) ans *= minus[i];
REP(i, K - p) ans *= plus[i];
}
std::cout << ans << std::endl;
}
| insert | 120 | 120 | 120 | 122 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
lint Power(lint n, lint x, lint mod) {
if (x == 0)
return 1;
lint res = Power(n, x / 2, mod);
res = res * res % mod;
if (x & 1)
res = res * n % mod;
return res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(begin(a), end(a), [&](int i, int j) { return abs(i) < abs(j); });
reverse(begin(a), end(a));
lint ans = 1;
const lint mod = 1e9 + 7;
int neg = 0;
for (int i = 0; i < k; i++) {
ans *= abs(a[i]);
ans %= mod;
if (a[i] < 0) {
neg++;
}
if (a[i] == 0) {
cout << 0 << "\n";
return 0;
}
}
if (neg & 1) {
int lastneg = -1;
int lastpos = -1;
int nextneg = -1;
int nextpos = -1;
for (int i = 0; i < k; i++) {
if (a[i] < 0) {
lastneg = i;
}
if (a[i] > 0) {
lastpos = i;
;
}
}
for (int i = k; i < n; i++) {
if (nextneg == -1 && a[i] < 0) {
nextneg = i;
}
if (nextpos == -1 && a[i] > 0) {
nextpos = a[i];
}
}
vector<pair<lint, lint>> ratios;
if (lastneg != -1 && nextpos != -1) {
ratios.emplace_back(abs(a[nextpos]), abs(a[lastneg]));
}
if (lastpos != -1 && nextneg != -1) {
ratios.emplace_back(abs(a[nextneg]), abs(a[lastpos]));
}
sort(begin(ratios), end(ratios),
[&](pair<lint, lint> p, pair<lint, lint> q) {
return p.first * q.second < q.first * p.second;
});
if (!ratios.empty()) {
ans *= Power(ratios.back().second, mod - 2, mod);
ans %= mod;
ans *= ratios.back().first;
ans %= mod;
} else {
ans = 1;
sort(begin(a), end(a));
reverse(begin(a), end(a));
for (int i = 0; i < k; i++) {
ans *= a[i];
ans %= mod;
}
}
}
if (ans < 0)
ans += mod;
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long;
lint Power(lint n, lint x, lint mod) {
if (x == 0)
return 1;
lint res = Power(n, x / 2, mod);
res = res * res % mod;
if (x & 1)
res = res * n % mod;
return res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(begin(a), end(a), [&](int i, int j) { return abs(i) < abs(j); });
reverse(begin(a), end(a));
lint ans = 1;
const lint mod = 1e9 + 7;
int neg = 0;
for (int i = 0; i < k; i++) {
ans *= abs(a[i]);
ans %= mod;
if (a[i] < 0) {
neg++;
}
if (a[i] == 0) {
cout << 0 << "\n";
return 0;
}
}
if (neg & 1) {
int lastneg = -1;
int lastpos = -1;
int nextneg = -1;
int nextpos = -1;
for (int i = 0; i < k; i++) {
if (a[i] < 0) {
lastneg = i;
}
if (a[i] > 0) {
lastpos = i;
;
}
}
for (int i = k; i < n; i++) {
if (nextneg == -1 && a[i] < 0) {
nextneg = i;
}
if (nextpos == -1 && a[i] > 0) {
nextpos = i;
}
}
vector<pair<lint, lint>> ratios;
if (lastneg != -1 && nextpos != -1) {
ratios.emplace_back(abs(a[nextpos]), abs(a[lastneg]));
}
if (lastpos != -1 && nextneg != -1) {
ratios.emplace_back(abs(a[nextneg]), abs(a[lastpos]));
}
sort(begin(ratios), end(ratios),
[&](pair<lint, lint> p, pair<lint, lint> q) {
return p.first * q.second < q.first * p.second;
});
if (!ratios.empty()) {
ans *= Power(ratios.back().second, mod - 2, mod);
ans %= mod;
ans *= ratios.back().first;
ans %= mod;
} else {
ans = 1;
sort(begin(a), end(a));
reverse(begin(a), end(a));
for (int i = 0; i < k; i++) {
ans *= a[i];
ans %= mod;
}
}
}
if (ans < 0)
ans += mod;
cout << ans << "\n";
return 0;
}
| replace | 59 | 60 | 59 | 60 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const int MOD = 1000000007;
const int MODD = 998244353;
const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const ld PI = 3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i < b; ++i)
#define rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for (ll i = (n); i--;)
#define rrep2(i, n) for (ll i = (n); i--;)
#define rrep3(i, a, b) for (ll i = (b); i-- > (a);)
#define rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define each1(i, a) for (auto &&i : a)
#define each2(x, y, a) for (auto &&[x, y] : a)
#define each3(x, y, z, a) for (auto &&[x, y, z] : a)
#define each(...) overload4(__VA_ARGS__, each3, each2, each1)(__VA_ARGS__)
#define all1(i) begin(i), end(i)
#define all2(i, a) begin(i), begin(i) + a
#define all3(i, a, b) begin(i) + a, begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define rall1(i) (i).rbegin(), (i).rend()
#define rall2(i, k) (i).rbegin(), (i).rbegin() + k
#define rall3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rall(...) overload3(__VA_ARGS__, rall3, rall2, rall1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(all(__VA_ARGS__), 0.0L)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
in(__VA_ARGS__)
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) \
sort(all(a)); \
a.erase(unique(all(a)), end(a))
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
template <class T> auto min(const T &a) { return *min_element(all(a)); }
template <class T> auto max(const T &a) { return *max_element(all(a)); }
inline ll popcnt(ull a) { return __builtin_popcountll(a); }
ll gcd(ll a, ll b) {
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
ll intpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans *= a;
a *= a;
b /= 2;
}
return ans;
}
ll modpow(ll a, ll b, ll p) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= p;
(a *= a) %= p;
b /= 2;
}
return ans;
}
template <class T, class U> bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
vector<ll> iota(ll n) {
vector<ll> a(n);
iota(a.begin(), a.end(), 0);
return a;
}
vector<pll> factor(ull x) {
vector<pll> ans;
for (ull i = 2; i * i <= x; i++)
if (x % i == 0) {
ans.push_back({i, 1});
while ((x /= i) % i == 0)
ans.back().second++;
}
if (x != 1)
ans.push_back({x, 1});
return ans;
}
map<ll, ll> factor_map(ull x) {
map<ll, ll> ans;
for (ull i = 2; i * i <= x; i++)
if (x % i == 0) {
ans[i] = 1;
while ((x /= i) % i == 0)
ans[i]++;
}
if (x != 1)
ans[x] = 1;
return ans;
}
vector<ll> divisor(ull x) {
vector<ll> ans;
for (ull i = 1; i * i <= x; i++)
if (x % i == 0)
ans.push_back(i);
rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]);
return ans;
}
template <class T> unordered_map<T, ll> press(vector<T> &a) {
auto b = a;
sort(all(b));
b.erase(unique(all(b)), b.end());
unordered_map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
template <class T> map<T, ll> press_map(vector<T> &a) {
auto b = a;
sort(all(b));
b.erase(unique(all(b)), b.end());
map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
int scan() { return getchar(); }
void scan(int &a) { scanf("%d", &a); }
void scan(unsigned &a) { scanf("%u", &a); }
void scan(long &a) { scanf("%ld", &a); }
void scan(long long &a) { scanf("%lld", &a); }
void scan(unsigned long long &a) { scanf("%llu", &a); }
void scan(char &a) {
do {
a = getchar();
} while (a == ' ' || a == '\n');
}
void scan(float &a) { scanf("%f", &a); }
void scan(double &a) { scanf("%lf", &a); }
void scan(long double &a) { scanf("%Lf", &a); }
void scan(vector<bool> &a) {
for (unsigned i = 0; i < a.size(); i++) {
int b;
scan(b);
a[i] = b;
}
}
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(vector<T> &);
template <class T, size_t size> void scan(array<T, size> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T, size_t size> void scan(T (&)[size]);
template <class T> void scan(vector<T> &a) {
for (auto &&i : a)
scan(i);
}
template <class T> void scan(deque<T> &a) {
for (auto &&i : a)
scan(i);
}
template <class T, size_t size> void scan(array<T, size> &a) {
for (auto &&i : a)
scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> void scan(T (&a)[size]) {
for (auto &&i : a)
scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
void print() { putchar(' '); }
void print(bool a) { printf("%d", a); }
void print(int a) { printf("%d", a); }
void print(unsigned a) { printf("%u", a); }
void print(long a) { printf("%ld", a); }
void print(long long a) { printf("%lld", a); }
void print(unsigned long long a) { printf("%llu", a); }
void print(char a) { printf("%c", a); }
void print(char a[]) { printf("%s", a); }
void print(const char a[]) { printf("%s", a); }
void print(float a) { printf("%.15f", a); }
void print(double a) { printf("%.15f", a); }
void print(long double a) { printf("%.15Lf", a); }
void print(const string &a) {
for (auto &&i : a)
print(i);
}
template <class T> void print(const vector<T> &);
template <class T, size_t size> void print(const array<T, size> &);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> void print(const T (&)[size]);
template <class T> void print(const vector<T> &a) {
if (a.empty())
return;
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T> void print(const deque<T> &a) {
if (a.empty())
return;
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T, size_t size> void print(const array<T, size> &a) {
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T, class L> void print(const pair<T, L> &p) {
print(p.first);
putchar(' ');
print(p.second);
}
template <class T, size_t size> void print(const T (&a)[size]) {
print(a[0]);
for (auto i = a; ++i != end(a);) {
putchar(' ');
print(*i);
}
}
template <class T> void print(const T &a) { cout << a; }
int out() {
putchar('\n');
return 0;
}
template <class T> int out(const T &t) {
print(t);
putchar('\n');
return 0;
}
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
return 0;
}
#ifdef DEBUG
inline ll __lg(ull __n) {
return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n);
}
#define debug(...) \
{ \
print(#__VA_ARGS__); \
print(":"); \
out(__VA_ARGS__); \
}
#else
#define debug(...) void(0)
#endif
int first(bool i = true) { return out(i ? "first" : "second"); }
int yes(bool i = true) { return out(i ? "yes" : "no"); }
int Yes(bool i = true) { return out(i ? "Yes" : "No"); }
int No() { return out("No"); }
int YES(bool i = true) { return out(i ? "YES" : "NO"); }
int NO() { return out("NO"); }
int Yay(bool i = true) { return out(i ? "Yay!" : ":("); }
int possible(bool i = true) { return out(i ? "possible" : "impossible"); }
int Possible(bool i = true) { return out(i ? "Possible" : "Impossible"); }
int POSSIBLE(bool i = true) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }
void Case(ll i) { printf("Case #%lld: ", i); }
constexpr uint mod = MOD;
struct Modint {
uint num = 0;
constexpr Modint() noexcept {}
constexpr Modint(const Modint &x) noexcept : num(x.num) {}
inline constexpr operator ll() const noexcept { return num; }
inline constexpr Modint &operator+=(Modint x) noexcept {
num += x.num;
if (num >= mod)
num -= mod;
return *this;
}
inline constexpr Modint &operator++() noexcept {
if (num == mod - 1)
num = 0;
else
num++;
return *this;
}
inline constexpr Modint operator++(int) noexcept {
Modint ans(*this);
operator++();
return ans;
}
inline constexpr Modint operator-() const noexcept {
return Modint(0) -= *this;
}
inline constexpr Modint operator-(Modint x) const noexcept {
return Modint(*this) -= x;
}
inline constexpr Modint &operator-=(Modint x) noexcept {
if (num < x.num)
num += mod;
num -= x.num;
return *this;
}
inline constexpr Modint &operator--() noexcept {
if (num == 0)
num = mod - 1;
else
num--;
return *this;
}
inline constexpr Modint operator--(int) noexcept {
Modint ans(*this);
operator--();
return ans;
}
inline constexpr Modint &operator*=(Modint x) noexcept {
num = ull(num) * x.num % mod;
return *this;
}
inline constexpr Modint &operator/=(Modint x) noexcept {
return operator*=(x.inv());
}
template <class T> constexpr Modint(T x) noexcept {
using U = typename conditional<sizeof(T) >= 4, T, int>::type;
U y = x;
y %= U(mod);
if (y < 0)
y += mod;
num = uint(y);
}
template <class T> inline constexpr Modint operator+(T x) const noexcept {
return Modint(*this) += x;
}
template <class T> inline constexpr Modint &operator+=(T x) noexcept {
return operator+=(Modint(x));
}
template <class T> inline constexpr Modint operator-(T x) const noexcept {
return Modint(*this) -= x;
}
template <class T> inline constexpr Modint &operator-=(T x) noexcept {
return operator-=(Modint(x));
}
template <class T> inline constexpr Modint operator*(T x) const noexcept {
return Modint(*this) *= x;
}
template <class T> inline constexpr Modint &operator*=(T x) noexcept {
return operator*=(Modint(x));
}
template <class T> inline constexpr Modint operator/(T x) const noexcept {
return Modint(*this) /= x;
}
template <class T> inline constexpr Modint &operator/=(T x) noexcept {
return operator/=(Modint(x));
}
inline constexpr Modint inv() const noexcept {
ll x = 0, y = 0;
extgcd(num, mod, x, y);
return x;
}
static inline constexpr ll extgcd(ll a, ll b, ll &x, ll &y) noexcept {
ll g = a;
x = 1;
y = 0;
if (b) {
g = extgcd(b, a % b, y, x);
y -= a / b * x;
}
return g;
}
inline constexpr Modint pow(ull x) const noexcept {
Modint ans = 1, cnt = *this;
while (x) {
if (x & 1)
ans *= cnt;
cnt *= cnt;
x /= 2;
}
return ans;
}
};
std::istream &operator>>(std::istream &is, Modint &x) {
ll a;
in(a);
x = a;
return is;
}
inline constexpr Modint operator""_M(ull x) noexcept { return Modint(x); }
std::vector<Modint> fac(1, 1), inv(1, 1);
inline void reserve(ll a) {
if (fac.size() >= a)
return;
if (a < fac.size() * 2)
a = fac.size() * 2;
if (a >= mod)
a = mod;
while (fac.size() < a)
fac.push_back(fac.back() * Modint(fac.size()));
inv.resize(fac.size());
inv.back() = fac.back().inv();
for (ll i = inv.size() - 1; !inv[i - 1]; i--)
inv[i - 1] = inv[i] * i;
}
inline Modint fact(ll n) {
if (n < 0)
return 0;
reserve(n + 1);
return fac[n];
}
inline Modint perm(ll n, ll r) {
if (r < 0 || n < r)
return 0;
if (n >> 24) {
Modint ans = 1;
for (ll i = 0; i < r; i++)
ans *= n--;
return ans;
}
reserve(n + 1);
return fac[n] * inv[n - r];
}
inline Modint comb(ll n, ll r) {
if (r < 0 || n < r)
return 0;
reserve(r + 1);
return perm(n, r) * inv[r];
}
inline Modint Mcomb(ll n, ll r) {
return comb(n + r - 1, n - 1);
} // r balls into n boxes
inline Modint catalan(ll n) {
reserve(n * 2 + 1);
return fac[n * 2] * inv[n] * inv[n + 1];
}
signed main() {
LL(n, k);
vec(ll, pos, 0);
vec(ll, neg, 0);
ll zero = 0;
rep(n) {
LL(a);
if (a > 0)
pos.push_back(a);
elif (a < 0) neg.push_back(-a);
else zero++;
}
Sort(pos);
Sort(neg);
ll a = k, b = 0;
while (a > ll(pos.size())) {
a -= 2;
b += 2;
}
if (b > ll(neg.size()) || a < 0) {
if (zero)
return out(0);
ll a = k - 1, b = 1;
while (a > ll(pos.size())) {
a -= 2;
b += 2;
}
while (a >= 2 && b + 2 <= ll(neg.size()) &&
pos[a - 1] * pos[a - 2] > neg[b] * neg[b + 1]) {
a -= 2;
b += 2;
}
Modint ans = -1;
rep(a) ans *= pos[i];
rep(b) ans *= neg[i];
return out(ans);
}
Rev(pos);
Rev(neg);
while (b + 2 <= ll(neg.size()) &&
pos[a - 1] * pos[a - 2] < neg[b] * neg[b + 1]) {
a -= 2;
b += 2;
}
Modint ans = 1;
rep(a) ans *= pos[i];
rep(b) ans *= neg[i];
out(ans);
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const int MOD = 1000000007;
const int MODD = 998244353;
const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const ld PI = 3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i < b; ++i)
#define rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for (ll i = (n); i--;)
#define rrep2(i, n) for (ll i = (n); i--;)
#define rrep3(i, a, b) for (ll i = (b); i-- > (a);)
#define rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define each1(i, a) for (auto &&i : a)
#define each2(x, y, a) for (auto &&[x, y] : a)
#define each3(x, y, z, a) for (auto &&[x, y, z] : a)
#define each(...) overload4(__VA_ARGS__, each3, each2, each1)(__VA_ARGS__)
#define all1(i) begin(i), end(i)
#define all2(i, a) begin(i), begin(i) + a
#define all3(i, a, b) begin(i) + a, begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define rall1(i) (i).rbegin(), (i).rend()
#define rall2(i, k) (i).rbegin(), (i).rbegin() + k
#define rall3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rall(...) overload3(__VA_ARGS__, rall3, rall2, rall1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(all(__VA_ARGS__), 0.0L)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
in(__VA_ARGS__)
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) \
sort(all(a)); \
a.erase(unique(all(a)), end(a))
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
template <class T> auto min(const T &a) { return *min_element(all(a)); }
template <class T> auto max(const T &a) { return *max_element(all(a)); }
inline ll popcnt(ull a) { return __builtin_popcountll(a); }
ll gcd(ll a, ll b) {
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
ll intpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans *= a;
a *= a;
b /= 2;
}
return ans;
}
ll modpow(ll a, ll b, ll p) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= p;
(a *= a) %= p;
b /= 2;
}
return ans;
}
template <class T, class U> bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
vector<ll> iota(ll n) {
vector<ll> a(n);
iota(a.begin(), a.end(), 0);
return a;
}
vector<pll> factor(ull x) {
vector<pll> ans;
for (ull i = 2; i * i <= x; i++)
if (x % i == 0) {
ans.push_back({i, 1});
while ((x /= i) % i == 0)
ans.back().second++;
}
if (x != 1)
ans.push_back({x, 1});
return ans;
}
map<ll, ll> factor_map(ull x) {
map<ll, ll> ans;
for (ull i = 2; i * i <= x; i++)
if (x % i == 0) {
ans[i] = 1;
while ((x /= i) % i == 0)
ans[i]++;
}
if (x != 1)
ans[x] = 1;
return ans;
}
vector<ll> divisor(ull x) {
vector<ll> ans;
for (ull i = 1; i * i <= x; i++)
if (x % i == 0)
ans.push_back(i);
rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]);
return ans;
}
template <class T> unordered_map<T, ll> press(vector<T> &a) {
auto b = a;
sort(all(b));
b.erase(unique(all(b)), b.end());
unordered_map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
template <class T> map<T, ll> press_map(vector<T> &a) {
auto b = a;
sort(all(b));
b.erase(unique(all(b)), b.end());
map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
int scan() { return getchar(); }
void scan(int &a) { scanf("%d", &a); }
void scan(unsigned &a) { scanf("%u", &a); }
void scan(long &a) { scanf("%ld", &a); }
void scan(long long &a) { scanf("%lld", &a); }
void scan(unsigned long long &a) { scanf("%llu", &a); }
void scan(char &a) {
do {
a = getchar();
} while (a == ' ' || a == '\n');
}
void scan(float &a) { scanf("%f", &a); }
void scan(double &a) { scanf("%lf", &a); }
void scan(long double &a) { scanf("%Lf", &a); }
void scan(vector<bool> &a) {
for (unsigned i = 0; i < a.size(); i++) {
int b;
scan(b);
a[i] = b;
}
}
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(vector<T> &);
template <class T, size_t size> void scan(array<T, size> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T, size_t size> void scan(T (&)[size]);
template <class T> void scan(vector<T> &a) {
for (auto &&i : a)
scan(i);
}
template <class T> void scan(deque<T> &a) {
for (auto &&i : a)
scan(i);
}
template <class T, size_t size> void scan(array<T, size> &a) {
for (auto &&i : a)
scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> void scan(T (&a)[size]) {
for (auto &&i : a)
scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
void print() { putchar(' '); }
void print(bool a) { printf("%d", a); }
void print(int a) { printf("%d", a); }
void print(unsigned a) { printf("%u", a); }
void print(long a) { printf("%ld", a); }
void print(long long a) { printf("%lld", a); }
void print(unsigned long long a) { printf("%llu", a); }
void print(char a) { printf("%c", a); }
void print(char a[]) { printf("%s", a); }
void print(const char a[]) { printf("%s", a); }
void print(float a) { printf("%.15f", a); }
void print(double a) { printf("%.15f", a); }
void print(long double a) { printf("%.15Lf", a); }
void print(const string &a) {
for (auto &&i : a)
print(i);
}
template <class T> void print(const vector<T> &);
template <class T, size_t size> void print(const array<T, size> &);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> void print(const T (&)[size]);
template <class T> void print(const vector<T> &a) {
if (a.empty())
return;
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T> void print(const deque<T> &a) {
if (a.empty())
return;
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T, size_t size> void print(const array<T, size> &a) {
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T, class L> void print(const pair<T, L> &p) {
print(p.first);
putchar(' ');
print(p.second);
}
template <class T, size_t size> void print(const T (&a)[size]) {
print(a[0]);
for (auto i = a; ++i != end(a);) {
putchar(' ');
print(*i);
}
}
template <class T> void print(const T &a) { cout << a; }
int out() {
putchar('\n');
return 0;
}
template <class T> int out(const T &t) {
print(t);
putchar('\n');
return 0;
}
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
return 0;
}
#ifdef DEBUG
inline ll __lg(ull __n) {
return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n);
}
#define debug(...) \
{ \
print(#__VA_ARGS__); \
print(":"); \
out(__VA_ARGS__); \
}
#else
#define debug(...) void(0)
#endif
int first(bool i = true) { return out(i ? "first" : "second"); }
int yes(bool i = true) { return out(i ? "yes" : "no"); }
int Yes(bool i = true) { return out(i ? "Yes" : "No"); }
int No() { return out("No"); }
int YES(bool i = true) { return out(i ? "YES" : "NO"); }
int NO() { return out("NO"); }
int Yay(bool i = true) { return out(i ? "Yay!" : ":("); }
int possible(bool i = true) { return out(i ? "possible" : "impossible"); }
int Possible(bool i = true) { return out(i ? "Possible" : "Impossible"); }
int POSSIBLE(bool i = true) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }
void Case(ll i) { printf("Case #%lld: ", i); }
constexpr uint mod = MOD;
struct Modint {
uint num = 0;
constexpr Modint() noexcept {}
constexpr Modint(const Modint &x) noexcept : num(x.num) {}
inline constexpr operator ll() const noexcept { return num; }
inline constexpr Modint &operator+=(Modint x) noexcept {
num += x.num;
if (num >= mod)
num -= mod;
return *this;
}
inline constexpr Modint &operator++() noexcept {
if (num == mod - 1)
num = 0;
else
num++;
return *this;
}
inline constexpr Modint operator++(int) noexcept {
Modint ans(*this);
operator++();
return ans;
}
inline constexpr Modint operator-() const noexcept {
return Modint(0) -= *this;
}
inline constexpr Modint operator-(Modint x) const noexcept {
return Modint(*this) -= x;
}
inline constexpr Modint &operator-=(Modint x) noexcept {
if (num < x.num)
num += mod;
num -= x.num;
return *this;
}
inline constexpr Modint &operator--() noexcept {
if (num == 0)
num = mod - 1;
else
num--;
return *this;
}
inline constexpr Modint operator--(int) noexcept {
Modint ans(*this);
operator--();
return ans;
}
inline constexpr Modint &operator*=(Modint x) noexcept {
num = ull(num) * x.num % mod;
return *this;
}
inline constexpr Modint &operator/=(Modint x) noexcept {
return operator*=(x.inv());
}
template <class T> constexpr Modint(T x) noexcept {
using U = typename conditional<sizeof(T) >= 4, T, int>::type;
U y = x;
y %= U(mod);
if (y < 0)
y += mod;
num = uint(y);
}
template <class T> inline constexpr Modint operator+(T x) const noexcept {
return Modint(*this) += x;
}
template <class T> inline constexpr Modint &operator+=(T x) noexcept {
return operator+=(Modint(x));
}
template <class T> inline constexpr Modint operator-(T x) const noexcept {
return Modint(*this) -= x;
}
template <class T> inline constexpr Modint &operator-=(T x) noexcept {
return operator-=(Modint(x));
}
template <class T> inline constexpr Modint operator*(T x) const noexcept {
return Modint(*this) *= x;
}
template <class T> inline constexpr Modint &operator*=(T x) noexcept {
return operator*=(Modint(x));
}
template <class T> inline constexpr Modint operator/(T x) const noexcept {
return Modint(*this) /= x;
}
template <class T> inline constexpr Modint &operator/=(T x) noexcept {
return operator/=(Modint(x));
}
inline constexpr Modint inv() const noexcept {
ll x = 0, y = 0;
extgcd(num, mod, x, y);
return x;
}
static inline constexpr ll extgcd(ll a, ll b, ll &x, ll &y) noexcept {
ll g = a;
x = 1;
y = 0;
if (b) {
g = extgcd(b, a % b, y, x);
y -= a / b * x;
}
return g;
}
inline constexpr Modint pow(ull x) const noexcept {
Modint ans = 1, cnt = *this;
while (x) {
if (x & 1)
ans *= cnt;
cnt *= cnt;
x /= 2;
}
return ans;
}
};
std::istream &operator>>(std::istream &is, Modint &x) {
ll a;
in(a);
x = a;
return is;
}
inline constexpr Modint operator""_M(ull x) noexcept { return Modint(x); }
std::vector<Modint> fac(1, 1), inv(1, 1);
inline void reserve(ll a) {
if (fac.size() >= a)
return;
if (a < fac.size() * 2)
a = fac.size() * 2;
if (a >= mod)
a = mod;
while (fac.size() < a)
fac.push_back(fac.back() * Modint(fac.size()));
inv.resize(fac.size());
inv.back() = fac.back().inv();
for (ll i = inv.size() - 1; !inv[i - 1]; i--)
inv[i - 1] = inv[i] * i;
}
inline Modint fact(ll n) {
if (n < 0)
return 0;
reserve(n + 1);
return fac[n];
}
inline Modint perm(ll n, ll r) {
if (r < 0 || n < r)
return 0;
if (n >> 24) {
Modint ans = 1;
for (ll i = 0; i < r; i++)
ans *= n--;
return ans;
}
reserve(n + 1);
return fac[n] * inv[n - r];
}
inline Modint comb(ll n, ll r) {
if (r < 0 || n < r)
return 0;
reserve(r + 1);
return perm(n, r) * inv[r];
}
inline Modint Mcomb(ll n, ll r) {
return comb(n + r - 1, n - 1);
} // r balls into n boxes
inline Modint catalan(ll n) {
reserve(n * 2 + 1);
return fac[n * 2] * inv[n] * inv[n + 1];
}
signed main() {
LL(n, k);
vec(ll, pos, 0);
vec(ll, neg, 0);
ll zero = 0;
rep(n) {
LL(a);
if (a > 0)
pos.push_back(a);
elif (a < 0) neg.push_back(-a);
else zero++;
}
Sort(pos);
Sort(neg);
ll a = k, b = 0;
while (a > ll(pos.size())) {
a -= 2;
b += 2;
}
if (b > ll(neg.size()) || a < 0) {
if (zero)
return out(0);
ll a = k - 1, b = 1;
while (a > ll(pos.size())) {
a -= 2;
b += 2;
}
while (a >= 2 && b + 2 <= ll(neg.size()) &&
pos[a - 1] * pos[a - 2] > neg[b] * neg[b + 1]) {
a -= 2;
b += 2;
}
Modint ans = -1;
rep(a) ans *= pos[i];
rep(b) ans *= neg[i];
return out(ans);
}
Rev(pos);
Rev(neg);
while (a >= 2 && b + 2 <= ll(neg.size()) &&
pos[a - 1] * pos[a - 2] < neg[b] * neg[b + 1]) {
a -= 2;
b += 2;
}
Modint ans = 1;
rep(a) ans *= pos[i];
rep(b) ans *= neg[i];
out(ans);
}
| replace | 554 | 555 | 554 | 555 | 0 | |
p02616 | C++ | Runtime Error | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
constexpr ll LINF = 1e18;
#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
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 += "}";
return res;
}
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__ << "]:", debug_out(__VA_ARGS__)
//------ Believe yourself as a genius!!!!!! ------
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
ll n, cnt, ans, a[ohara], b, c, d, tmp, m, h, w, x, y, sum, k, q;
P p[ohara];
ll sei = -1, fu = -1;
ll corner;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
rep(i, n) cin >> a[i];
rep(i, n) p[i] = m_p(abs(a[i]), i);
ans = 1;
sort(p, p + n);
reverse(p, p + n);
rep(i, k) {
ans *= (a[p[i].se]);
if (a[p[i].se] >= 0)
sei = i;
else
fu = i;
ans %= MOD;
}
if (ans >= 0)
Cout(ans);
else {
ll h1, h2, h3, h4;
ans = 1;
ll ans2 = 1;
if (sei != -1) {
h2 = abs(a[p[sei].se]);
cnt = 0;
rep(i, n) {
if (i == sei)
continue;
if (cnt < k - 1) {
ans *= (a[p[i].se]);
cnt++;
} else if (cnt == k - 1) {
if (a[p[i].se] >= 0)
continue;
ans *= (a[p[i].se]);
h1 = abs(a[p[i].se]);
ans %= MOD;
cnt++;
break;
}
ans %= MOD;
}
}
ll cnt2 = 0;
if (fu != -1) {
h4 = abs(a[p[fu].se]);
rep(i, n) {
if (i == fu)
continue;
if (cnt2 < k - 1) {
ans2 *= (a[p[i].se]);
cnt2++;
} else if (cnt2 == k - 1) {
if (a[p[i].se] < 0)
continue;
ans2 *= (a[p[i].se]);
h3 = abs(a[p[i].se]);
ans2 %= MOD;
cnt2++;
break;
}
ans2 %= MOD;
}
}
if (cnt2 == k || cnt == k) {
if (sei == -1) {
Cout(ans2);
} else {
if (h2 == 0) {
if (h1 == 0) {
Cout(ans2);
} else
Cout(ans);
} else if (h1 * h4 >= h3 * h2) {
return -1;
Cout(ans);
} else {
Cout(ans2);
}
}
} else {
ans = 1;
rrrep(i, n - 1, n - k) {
ans *= (a[p[i].se]);
ans %= MOD;
}
ans += MOD;
ans %= MOD;
Cout(ans);
}
}
return 0;
}
| #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
constexpr ll LINF = 1e18;
#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
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 += "}";
return res;
}
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__ << "]:", debug_out(__VA_ARGS__)
//------ Believe yourself as a genius!!!!!! ------
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
ll n, cnt, ans, a[ohara], b, c, d, tmp, m, h, w, x, y, sum, k, q;
P p[ohara];
ll sei = -1, fu = -1;
ll corner;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
rep(i, n) cin >> a[i];
rep(i, n) p[i] = m_p(abs(a[i]), i);
ans = 1;
sort(p, p + n);
reverse(p, p + n);
rep(i, k) {
ans *= (a[p[i].se]);
if (a[p[i].se] >= 0)
sei = i;
else
fu = i;
ans %= MOD;
}
if (ans >= 0)
Cout(ans);
else {
ll h1, h2, h3, h4;
ans = 1;
ll ans2 = 1;
if (sei != -1) {
h2 = abs(a[p[sei].se]);
cnt = 0;
rep(i, n) {
if (i == sei)
continue;
if (cnt < k - 1) {
ans *= (a[p[i].se]);
cnt++;
} else if (cnt == k - 1) {
if (a[p[i].se] >= 0)
continue;
ans *= (a[p[i].se]);
h1 = abs(a[p[i].se]);
ans %= MOD;
cnt++;
break;
}
ans %= MOD;
}
}
ll cnt2 = 0;
if (fu != -1) {
h4 = abs(a[p[fu].se]);
rep(i, n) {
if (i == fu)
continue;
if (cnt2 < k - 1) {
ans2 *= (a[p[i].se]);
cnt2++;
} else if (cnt2 == k - 1) {
if (a[p[i].se] < 0)
continue;
ans2 *= (a[p[i].se]);
h3 = abs(a[p[i].se]);
ans2 %= MOD;
cnt2++;
break;
}
ans2 %= MOD;
}
}
if (cnt2 == k || cnt == k) {
if (sei == -1) {
Cout(ans2);
} else {
if (h2 == 0) {
if (h1 == 0) {
Cout(ans2);
} else
Cout(ans);
} else if (h1 * h4 >= h3 * h2) {
Cout(ans);
} else {
Cout(ans2);
}
}
} else {
ans = 1;
rrrep(i, n - 1, n - k) {
ans *= (a[p[i].se]);
ans %= MOD;
}
ans += MOD;
ans %= MOD;
Cout(ans);
}
}
return 0;
}
| delete | 140 | 141 | 140 | 140 | 0 | |
p02616 | C++ | Runtime Error | #pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(), (a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i, j, k) mkp(i, mkp(j, k))
#define rng(i, s, n) for (int i = (s); i < (n); i++)
#define rep(i, n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define vi vec<int>
#define pb emplace_back
#define siz(a) (int)(a).size()
#define crdcomp(b) \
sort(all((b))); \
(b).erase(unique(all((b))), (b).end())
#define getidx(b, i) lower_bound(all(b), (i)) - (b).begin()
#define ssp(i, n) (i == (int)(n)-1 ? "\n" : " ")
#define ctoi(c) (int)(c - '0')
#define itoc(c) (char)(c + '0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) \
int quetimes_ = (n); \
rep(qq123_, quetimes_)
#define gcj printf("Case #%lld: ", qq123_ + 1)
#define readv(a, n) \
a.resize(n, 0); \
rep(i, (n)) a[i] = read()
#define found(a, x) (a.find(x) != a.end())
// #define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
constexpr int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
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;
}
ll read() {
ll u, k = scanf("%lld", &u);
return u;
}
string reads() {
string s;
cin >> s;
return s;
}
H readh(bool g = 0) {
H u;
int k = scanf("%lld %lld", &u.fs, &u.sc);
if (g)
u.fs--, u.sc--;
return u;
}
bool ina(H t, int h, int w) {
return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w;
}
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll popcount(ll x) {
int sum = 0;
for (int i = 0; i < 60; i++)
if ((1ll << i) & x)
sum++;
return sum;
}
class mint {
public:
ll v;
mint(ll v = 0) { s(v % mod + mod); }
constexpr static int mod = 1e9 + 7;
constexpr static int fn_ = 3e5 + 5;
static mint fact[fn_], comp[fn_];
mint pow(int x) const {
mint b(v), c(1);
while (x) {
if (x & 1)
c *= b;
b *= b;
x >>= 1;
}
return c;
}
inline mint &s(int vv) {
v = vv < mod ? vv : vv - mod;
return *this;
}
inline mint inv() const { return pow(mod - 2); }
inline mint operator-() const { return mint() - *this; }
inline mint &operator+=(const mint b) { return s(v + b.v); }
inline mint &operator-=(const mint b) { return s(v + mod - b.v); }
inline mint &operator*=(const mint b) {
v = v * b.v % mod;
return *this;
}
inline mint &operator/=(const mint b) {
v = v * b.inv().v % mod;
return *this;
}
inline mint operator+(const mint b) const { return mint(v) += b; }
inline mint operator-(const mint b) const { return mint(v) -= b; }
inline mint operator*(const mint b) const { return mint(v) *= b; }
inline mint operator/(const mint b) const { return mint(v) /= b; }
friend ostream &operator<<(ostream &os, const mint &m) { return os << m.v; }
friend istream &operator>>(istream &is, mint &m) {
int x;
is >> x;
m = mint(x);
return is;
}
bool operator<(const mint &r) const { return v < r.v; }
bool operator>(const mint &r) const { return v > r.v; }
bool operator<=(const mint &r) const { return v <= r.v; }
bool operator>=(const mint &r) const { return v >= r.v; }
bool operator==(const mint &r) const { return v == r.v; }
bool operator!=(const mint &r) const { return v != r.v; }
explicit operator bool() const { return v; }
explicit operator int() const { return v; }
mint comb(mint k) {
if (k > *this)
return mint();
if (!fact[0])
combinit();
if (v >= fn_) {
if (k > *this - k)
k = *this - k;
mint tmp(1);
for (int i = v; i >= v - k.v + 1; i--)
tmp *= mint(i);
return tmp * comp[k.v];
}
return fact[v] * comp[k.v] * comp[v - k.v];
} // nCk
mint perm(mint k) {
if (k > *this)
return mint();
if (!fact[0])
combinit();
if (v >= fn_) {
mint tmp(1);
for (int i = v; i >= v - k.v + 1; i--)
tmp *= mint(i);
return tmp;
}
return fact[v] * comp[v - k.v];
}
static void combinit() {
fact[0] = 1;
for (int i = 1; i < fn_; i++)
fact[i] = fact[i - 1] * mint(i);
comp[fn_ - 1] = fact[fn_ - 1].inv();
for (int i = fn_ - 2; i >= 0; i--)
comp[i] = comp[i + 1] * mint(i + 1);
}
};
mint mint::fact[fn_], mint::comp[fn_];
//--------------------------------------------------------------
//---------------------------------------------------------------------
int n, k, gg;
mint solve(vi pos, vi neg) {
vi v;
rep(i, siz(neg) / 2) v.pb(neg[i * 2] * neg[i * 2 + 1]);
int l = 0, r = 0;
mint res = 1;
while (l + r * 2 < k) {
if ((l + r * 2) + 2 <= k && l + 1 < siz(pos) && r < siz(v)) {
if (pos[l] * pos[l + 1] < v[r]) {
res *= v[r++];
} else {
res *= pos[l++];
res *= pos[l++];
}
} else if (l < siz(pos)) {
res *= pos[l++];
} else {
res *= v[r++];
res /= pos[--l];
}
}
return res;
}
mint solve2(vi pos, vi neg) {
mint res = 1;
vi v;
for (auto g : pos)
v.pb(g);
for (auto g : neg)
v.pb(-g);
// どうせ負になるんだから絶対値を最小にする
sort(all(v));
rep(i, k) res *= v[i];
return res * -1;
}
vi a;
mt19937 rnd;
mint ans;
void generate() {
a.clear();
n = rnd() % 10 + 1;
k = rnd() % n + 1;
rep(i, n) a.pb((ll)rnd() % 30 - 10);
int res = 1, r = -inf;
rep(i, 1 << n) {
res = 1;
int sum = 0;
rep(j, n) {
if ((i >> j) & 1) {
res *= a[j];
sum++;
}
}
if (sum == k)
chmax(r, res);
}
ans = r;
}
signed main() {
while (1) {
// generate();
cin >> n >> k;
vi neg, pos;
rep(i, n) {
int v = read();
if (v < 0)
neg.pb(v);
else if (v > 0)
pos.pb(v);
}
mint res;
if (siz(pos) + siz(neg) < k) {
res = 0;
} // 0を選ばざるを得ない
else {
sort(all(pos), greater<int>());
sort(all(neg));
if (((siz(pos) == 0 && k % 2) ||
(siz(pos) + siz(neg) == k && siz(neg) % 2))) {
if (siz(pos) + siz(neg) < n) {
res = 0;
} else
res = solve2(pos, neg);
} else {
// 大きい順、小さい順で選んでいきまっせ
res = solve(pos, neg);
}
}
cout << res << endl;
return 0;
if (ans != res) {
cout << n << " " << k << endl;
rep(i, n) cout << a[i] << ssp(i, n);
cout << ans << " " << res << endl;
return 0;
}
}
} | #pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(), (a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i, j, k) mkp(i, mkp(j, k))
#define rng(i, s, n) for (int i = (s); i < (n); i++)
#define rep(i, n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define vi vec<int>
#define pb emplace_back
#define siz(a) (int)(a).size()
#define crdcomp(b) \
sort(all((b))); \
(b).erase(unique(all((b))), (b).end())
#define getidx(b, i) lower_bound(all(b), (i)) - (b).begin()
#define ssp(i, n) (i == (int)(n)-1 ? "\n" : " ")
#define ctoi(c) (int)(c - '0')
#define itoc(c) (char)(c + '0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) \
int quetimes_ = (n); \
rep(qq123_, quetimes_)
#define gcj printf("Case #%lld: ", qq123_ + 1)
#define readv(a, n) \
a.resize(n, 0); \
rep(i, (n)) a[i] = read()
#define found(a, x) (a.find(x) != a.end())
// #define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
constexpr int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
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;
}
ll read() {
ll u, k = scanf("%lld", &u);
return u;
}
string reads() {
string s;
cin >> s;
return s;
}
H readh(bool g = 0) {
H u;
int k = scanf("%lld %lld", &u.fs, &u.sc);
if (g)
u.fs--, u.sc--;
return u;
}
bool ina(H t, int h, int w) {
return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w;
}
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll popcount(ll x) {
int sum = 0;
for (int i = 0; i < 60; i++)
if ((1ll << i) & x)
sum++;
return sum;
}
class mint {
public:
ll v;
mint(ll v = 0) { s(v % mod + mod); }
constexpr static int mod = 1e9 + 7;
constexpr static int fn_ = 3e5 + 5;
static mint fact[fn_], comp[fn_];
mint pow(int x) const {
mint b(v), c(1);
while (x) {
if (x & 1)
c *= b;
b *= b;
x >>= 1;
}
return c;
}
inline mint &s(int vv) {
v = vv < mod ? vv : vv - mod;
return *this;
}
inline mint inv() const { return pow(mod - 2); }
inline mint operator-() const { return mint() - *this; }
inline mint &operator+=(const mint b) { return s(v + b.v); }
inline mint &operator-=(const mint b) { return s(v + mod - b.v); }
inline mint &operator*=(const mint b) {
v = v * b.v % mod;
return *this;
}
inline mint &operator/=(const mint b) {
v = v * b.inv().v % mod;
return *this;
}
inline mint operator+(const mint b) const { return mint(v) += b; }
inline mint operator-(const mint b) const { return mint(v) -= b; }
inline mint operator*(const mint b) const { return mint(v) *= b; }
inline mint operator/(const mint b) const { return mint(v) /= b; }
friend ostream &operator<<(ostream &os, const mint &m) { return os << m.v; }
friend istream &operator>>(istream &is, mint &m) {
int x;
is >> x;
m = mint(x);
return is;
}
bool operator<(const mint &r) const { return v < r.v; }
bool operator>(const mint &r) const { return v > r.v; }
bool operator<=(const mint &r) const { return v <= r.v; }
bool operator>=(const mint &r) const { return v >= r.v; }
bool operator==(const mint &r) const { return v == r.v; }
bool operator!=(const mint &r) const { return v != r.v; }
explicit operator bool() const { return v; }
explicit operator int() const { return v; }
mint comb(mint k) {
if (k > *this)
return mint();
if (!fact[0])
combinit();
if (v >= fn_) {
if (k > *this - k)
k = *this - k;
mint tmp(1);
for (int i = v; i >= v - k.v + 1; i--)
tmp *= mint(i);
return tmp * comp[k.v];
}
return fact[v] * comp[k.v] * comp[v - k.v];
} // nCk
mint perm(mint k) {
if (k > *this)
return mint();
if (!fact[0])
combinit();
if (v >= fn_) {
mint tmp(1);
for (int i = v; i >= v - k.v + 1; i--)
tmp *= mint(i);
return tmp;
}
return fact[v] * comp[v - k.v];
}
static void combinit() {
fact[0] = 1;
for (int i = 1; i < fn_; i++)
fact[i] = fact[i - 1] * mint(i);
comp[fn_ - 1] = fact[fn_ - 1].inv();
for (int i = fn_ - 2; i >= 0; i--)
comp[i] = comp[i + 1] * mint(i + 1);
}
};
mint mint::fact[fn_], mint::comp[fn_];
//--------------------------------------------------------------
//---------------------------------------------------------------------
int n, k, gg;
mint solve(vi pos, vi neg) {
vi v;
rep(i, siz(neg) / 2) v.pb(neg[i * 2] * neg[i * 2 + 1]);
int l = 0, r = 0;
mint res = 1;
while (l + r * 2 < k) {
if ((l + r * 2) + 2 <= k && l + 1 < siz(pos) && r < siz(v)) {
if (pos[l] * pos[l + 1] < v[r]) {
res *= v[r++];
} else {
res *= pos[l++];
res *= pos[l++];
}
} else if (l < siz(pos)) {
res *= pos[l++];
} else {
res *= v[r++];
}
}
while (r * 2 + l > k) {
res /= pos[--l];
}
return res;
}
mint solve2(vi pos, vi neg) {
mint res = 1;
vi v;
for (auto g : pos)
v.pb(g);
for (auto g : neg)
v.pb(-g);
// どうせ負になるんだから絶対値を最小にする
sort(all(v));
rep(i, k) res *= v[i];
return res * -1;
}
vi a;
mt19937 rnd;
mint ans;
void generate() {
a.clear();
n = rnd() % 10 + 1;
k = rnd() % n + 1;
rep(i, n) a.pb((ll)rnd() % 30 - 10);
int res = 1, r = -inf;
rep(i, 1 << n) {
res = 1;
int sum = 0;
rep(j, n) {
if ((i >> j) & 1) {
res *= a[j];
sum++;
}
}
if (sum == k)
chmax(r, res);
}
ans = r;
}
signed main() {
while (1) {
// generate();
cin >> n >> k;
vi neg, pos;
rep(i, n) {
int v = read();
if (v < 0)
neg.pb(v);
else if (v > 0)
pos.pb(v);
}
mint res;
if (siz(pos) + siz(neg) < k) {
res = 0;
} // 0を選ばざるを得ない
else {
sort(all(pos), greater<int>());
sort(all(neg));
if (((siz(pos) == 0 && k % 2) ||
(siz(pos) + siz(neg) == k && siz(neg) % 2))) {
if (siz(pos) + siz(neg) < n) {
res = 0;
} else
res = solve2(pos, neg);
} else {
// 大きい順、小さい順で選んでいきまっせ
res = solve(pos, neg);
}
}
cout << res << endl;
return 0;
if (ans != res) {
cout << n << " " << k << endl;
rep(i, n) cout << a[i] << ssp(i, n);
cout << ans << " " << res << endl;
return 0;
}
}
} | replace | 227 | 229 | 227 | 231 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int M = 1000000007;
int main() {
int n, k;
cin >> n >> k;
long long a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == k) {
long long ans = 1;
for (int i = 0; i < n; i++)
ans = ans * a[i] % M;
if (ans < 0)
ans += M;
cout << ans << endl;
return 0;
}
if (k == 1) {
cout << (*max_element(a, a + n) + M) % M << endl;
return 0;
}
int z = 0, pos = 0, neg = 0;
for (int i = 0; i < n; i++)
if (a[i] == 0)
z++;
else if (a[i] > 0)
pos++;
else
neg++;
if (z > n - k || (z == n - k && neg % 2 == 1)) {
cout << "0\n";
return 0;
}
vector<long long> vp, vn;
for (int i = 0; i < n; i++)
if (a[i] < 0)
vn.push_back(a[i]);
else if (a[i] > 0)
vp.push_back(a[i]);
sort(vp.begin(), vp.end(), greater<int>());
sort(vn.begin(), vn.end());
if (pos == 0 && k % 2 == 1) {
sort(vn.begin(), vn.end(), greater<int>());
long long ans = 1;
for (int i = 0; i < k; i++)
ans = ans * vn[i] % M;
cout << (ans + M) % M << endl;
exit(1);
return 0;
}
if (vn.size() % 2 == 1)
vn.pop_back();
int i = 0, j = 0;
long long ans = 1;
if (k % 2 == 1 && pos > 0) {
k--;
ans = vp[0];
i = 1;
}
if ((vp.size() - i) % 2 == 1)
vp.pop_back();
while (k > 0) {
if (j == vn.size()) {
ans = ans * vp[i] % M * vp[i + 1] % M;
i += 2;
} else if (i == vp.size()) {
ans = ans * vn[j] % M * vn[j + 1] % M;
j += 2;
} else if (vp[i] * vp[i + 1] > vn[j] * vn[j + 1]) {
ans = ans * vp[i] % M * vp[i + 1] % M;
i += 2;
} else {
ans = ans * vn[j] % M * vn[j + 1] % M;
j += 2;
}
k -= 2;
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int M = 1000000007;
int main() {
int n, k;
cin >> n >> k;
long long a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == k) {
long long ans = 1;
for (int i = 0; i < n; i++)
ans = ans * a[i] % M;
if (ans < 0)
ans += M;
cout << ans << endl;
return 0;
}
if (k == 1) {
cout << (*max_element(a, a + n) + M) % M << endl;
return 0;
}
int z = 0, pos = 0, neg = 0;
for (int i = 0; i < n; i++)
if (a[i] == 0)
z++;
else if (a[i] > 0)
pos++;
else
neg++;
if (z > n - k || (z == n - k && neg % 2 == 1)) {
cout << "0\n";
return 0;
}
vector<long long> vp, vn;
for (int i = 0; i < n; i++)
if (a[i] < 0)
vn.push_back(a[i]);
else if (a[i] > 0)
vp.push_back(a[i]);
sort(vp.begin(), vp.end(), greater<int>());
sort(vn.begin(), vn.end());
if (pos == 0 && k % 2 == 1) {
if (z > 0) {
cout << "0\n";
} else {
sort(vn.begin(), vn.end(), greater<int>());
long long ans = 1;
for (int i = 0; i < k; i++)
ans = ans * vn[i] % M;
cout << (ans + M) % M << endl;
}
return 0;
}
if (vn.size() % 2 == 1)
vn.pop_back();
int i = 0, j = 0;
long long ans = 1;
if (k % 2 == 1 && pos > 0) {
k--;
ans = vp[0];
i = 1;
}
if ((vp.size() - i) % 2 == 1)
vp.pop_back();
while (k > 0) {
if (j == vn.size()) {
ans = ans * vp[i] % M * vp[i + 1] % M;
i += 2;
} else if (i == vp.size()) {
ans = ans * vn[j] % M * vn[j + 1] % M;
j += 2;
} else if (vp[i] * vp[i + 1] > vn[j] * vn[j + 1]) {
ans = ans * vp[i] % M * vp[i + 1] % M;
i += 2;
} else {
ans = ans * vn[j] % M * vn[j + 1] % M;
j += 2;
}
k -= 2;
}
cout << ans << endl;
}
| replace | 52 | 58 | 52 | 61 | 0 | |
p02616 | C++ | Runtime Error |
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
const int mod = 1000000007;
int a[111111];
int cmp(int a, int b) { return abs(b) > abs(a); }
int main() {
ios::sync_with_stdio(0);
int t, sn = 0;
t = 1; // assert(1 <= t && t <= 1e5);
while (t--) {
int n, k;
cin >> n >> k;
sn += n;
bool zero = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
zero |= (a[i] == 0);
}
sort(a, a + n, cmp);
// for(int i = 0; i < n; ++i) {
// cout << a[i] << " ";
// if (i == n-k-1)
// cout << "\n";
// }
// cout << "\n";
int sn = 1;
vector<int> nums;
int gneg = -1e9 - 1, gpos = 1e9 + 1;
for (int i = 0, id = n - 1; i < k; ++i, id--) {
if (a[id] < 0)
sn *= -1;
nums.push_back(a[id]);
if (a[id] < 0)
gneg = max(gneg, a[id]);
else
gpos = min(gpos, a[id]);
}
if (sn > 0) {
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else {
int mn = 1, mx = -1;
for (int i = 0; i < n - k; ++i) {
mn = min(mn, a[i]);
mx = max(mx, a[i]);
}
// cout << gneg << " " << mx << "\n";
// cout << gpos << " " << mn << "\n";
bool g1 = gneg != -1e-9 - 1 && mx != -1;
bool g2 = gpos != 1e9 + 1 && mn != 1;
if (g1 && g2) {
int val, repl;
if (mx * 1ll * gpos > mn * 1ll * gneg)
val = gneg, repl = mx;
else
val = gpos, repl = mn;
for (int i = 0; i < k; ++i)
if (nums[i] == val) {
nums[i] = repl;
break;
}
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else if (g1) {
for (int i = 0; i < k; ++i)
if (nums[i] == gneg) {
nums[i] = mx;
break;
}
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else if (g2) {
for (int i = 0; i < k; ++i)
if (nums[i] == gpos) {
nums[i] = mn;
break;
}
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else {
if (zero)
cout << "0\n";
else {
int ans = 1;
for (int i = 0; i < k; ++i)
ans = (ans * 1ll * a[i]) % mod;
cout << (ans + mod) % mod << "\n";
}
}
}
}
return 0;
} |
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
const int mod = 1000000007;
int a[211111];
int cmp(int a, int b) { return abs(b) > abs(a); }
int main() {
ios::sync_with_stdio(0);
int t, sn = 0;
t = 1; // assert(1 <= t && t <= 1e5);
while (t--) {
int n, k;
cin >> n >> k;
sn += n;
bool zero = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
zero |= (a[i] == 0);
}
sort(a, a + n, cmp);
// for(int i = 0; i < n; ++i) {
// cout << a[i] << " ";
// if (i == n-k-1)
// cout << "\n";
// }
// cout << "\n";
int sn = 1;
vector<int> nums;
int gneg = -1e9 - 1, gpos = 1e9 + 1;
for (int i = 0, id = n - 1; i < k; ++i, id--) {
if (a[id] < 0)
sn *= -1;
nums.push_back(a[id]);
if (a[id] < 0)
gneg = max(gneg, a[id]);
else
gpos = min(gpos, a[id]);
}
if (sn > 0) {
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else {
int mn = 1, mx = -1;
for (int i = 0; i < n - k; ++i) {
mn = min(mn, a[i]);
mx = max(mx, a[i]);
}
// cout << gneg << " " << mx << "\n";
// cout << gpos << " " << mn << "\n";
bool g1 = gneg != -1e-9 - 1 && mx != -1;
bool g2 = gpos != 1e9 + 1 && mn != 1;
if (g1 && g2) {
int val, repl;
if (mx * 1ll * gpos > mn * 1ll * gneg)
val = gneg, repl = mx;
else
val = gpos, repl = mn;
for (int i = 0; i < k; ++i)
if (nums[i] == val) {
nums[i] = repl;
break;
}
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else if (g1) {
for (int i = 0; i < k; ++i)
if (nums[i] == gneg) {
nums[i] = mx;
break;
}
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else if (g2) {
for (int i = 0; i < k; ++i)
if (nums[i] == gpos) {
nums[i] = mn;
break;
}
int ans = 1;
for (auto x : nums)
ans = (ans * 1ll * x) % mod;
cout << (ans + mod) % mod << "\n";
} else {
if (zero)
cout << "0\n";
else {
int ans = 1;
for (int i = 0; i < k; ++i)
ans = (ans * 1ll * a[i]) % mod;
cout << (ans + mod) % mod << "\n";
}
}
}
}
return 0;
} | replace | 23 | 24 | 23 | 24 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using i128 = boost::multiprecision::int128_t;
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using VVbo = vector<Vbo>;
using VVV = vector<VV>;
using VVVll = vector<VVll>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
#define rep2(i, m, n) for (int i = int(m); i < int(n); ++i)
#define drep2(i, m, n) for (int i = int(m) - 1; i >= int(n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) a.begin(), a.end()
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
template <typename T> inline int sz(T &x) { return x.size(); }
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << '(' << p.first << ", " << p.second << ')';
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &e : v)
is >> e;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto &e : v)
os << e << ' ';
return os;
}
template <typename T> inline int count_between(vector<T> &a, T l, T r) {
return lower_bound(all(a), r) - lower_bound(all(a), l);
} // [l, r)
inline int fLog2(const int x) {
return 31 - __builtin_clz(x);
} // floor(log2(x))
inline int fLog2(const ll x) { return 63 - __builtin_clzll(x); }
inline int cLog2(const int x) {
return (x == 1) ? 0 : 32 - __builtin_clz(x - 1);
} // ceil(log2(x))
inline int cLog2(const ll x) {
return (x == 1) ? 0 : 64 - __builtin_clzll(x - 1);
}
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
const int INF = 1 << 30;
const ll INFll = 1ll << 62;
const ld EPS = 1e-10;
const ld PI = acos(-1.0);
const int MOD = int(1e9) + 7;
// const int MOD = 998244353;
struct mint {
ll x;
mint(ll 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 -= a.x) < 0)
x += MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint &operator/=(const mint r) {
ll a = r.x, b = MOD, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
x = x * u % MOD;
if (x < 0)
x += MOD;
return *this;
}
mint operator/(const mint a) const { return mint(*this) /= a; }
};
// istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
using Vm = vector<mint>;
using VVm = vector<Vm>;
using VVVm = vector<VVm>;
int main() {
ll n, k;
cin >> n >> k;
Vll a(n);
cin >> a;
sort(all(a), [](int i, int j) -> bool { return abs(i) > abs(j); });
VVll b(2);
VV cnt(2, V(n + 1));
rep(i, n) {
if (a[i] >= 0)
b[0].push_back(a[i]);
else
b[1].push_back(-a[i]);
cnt[0][i + 1] = cnt[0][i] + (a[i] >= 0);
cnt[1][i + 1] = cnt[1][i] + (a[i] < 0);
}
if (n == k) {
mint ans = 1;
rep(i, n) ans *= mint(a[i]);
cout << ans << '\n';
return 0;
}
if (cnt[0][n] == 0) {
mint ans = 1;
if (k & 1) {
reverse(all(b[1]));
ans *= -1;
}
rep(i, k) ans *= b[1][i];
cout << ans << '\n';
return 0;
}
if (!(cnt[1][k] & 1)) {
mint ans = 1;
rep(i, k) ans *= abs(a[i]);
cout << ans << '\n';
return 0;
}
if (cnt[0][k] == 0) {
mint ans = b[0][0];
rep(i, k - 1) ans *= b[1][i];
cout << ans << '\n';
return 0;
}
ll now = 0;
rep(j, 2) if (cnt[j][k] < cnt[j][n])
chmax(now, b[j][cnt[j][k] - 1] * b[j][cnt[j][k]]);
mint ans = now;
rep(j, 2) rep(i, cnt[j][k] - 1) ans *= b[0][i];
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using i128 = boost::multiprecision::int128_t;
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using VVbo = vector<Vbo>;
using VVV = vector<VV>;
using VVVll = vector<VVll>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
#define rep2(i, m, n) for (int i = int(m); i < int(n); ++i)
#define drep2(i, m, n) for (int i = int(m) - 1; i >= int(n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) a.begin(), a.end()
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
template <typename T> inline int sz(T &x) { return x.size(); }
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << '(' << p.first << ", " << p.second << ')';
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &e : v)
is >> e;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto &e : v)
os << e << ' ';
return os;
}
template <typename T> inline int count_between(vector<T> &a, T l, T r) {
return lower_bound(all(a), r) - lower_bound(all(a), l);
} // [l, r)
inline int fLog2(const int x) {
return 31 - __builtin_clz(x);
} // floor(log2(x))
inline int fLog2(const ll x) { return 63 - __builtin_clzll(x); }
inline int cLog2(const int x) {
return (x == 1) ? 0 : 32 - __builtin_clz(x - 1);
} // ceil(log2(x))
inline int cLog2(const ll x) {
return (x == 1) ? 0 : 64 - __builtin_clzll(x - 1);
}
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
const int INF = 1 << 30;
const ll INFll = 1ll << 62;
const ld EPS = 1e-10;
const ld PI = acos(-1.0);
const int MOD = int(1e9) + 7;
// const int MOD = 998244353;
struct mint {
ll x;
mint(ll 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 -= a.x) < 0)
x += MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint &operator/=(const mint r) {
ll a = r.x, b = MOD, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
x = x * u % MOD;
if (x < 0)
x += MOD;
return *this;
}
mint operator/(const mint a) const { return mint(*this) /= a; }
};
// istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
using Vm = vector<mint>;
using VVm = vector<Vm>;
using VVVm = vector<VVm>;
int main() {
ll n, k;
cin >> n >> k;
Vll a(n);
cin >> a;
sort(all(a), [](int i, int j) -> bool { return abs(i) > abs(j); });
VVll b(2);
VV cnt(2, V(n + 1));
rep(i, n) {
if (a[i] >= 0)
b[0].push_back(a[i]);
else
b[1].push_back(-a[i]);
cnt[0][i + 1] = cnt[0][i] + (a[i] >= 0);
cnt[1][i + 1] = cnt[1][i] + (a[i] < 0);
}
if (n == k) {
mint ans = 1;
rep(i, n) ans *= mint(a[i]);
cout << ans << '\n';
return 0;
}
if (cnt[0][n] == 0) {
mint ans = 1;
if (k & 1) {
reverse(all(b[1]));
ans *= -1;
}
rep(i, k) ans *= b[1][i];
cout << ans << '\n';
return 0;
}
if (!(cnt[1][k] & 1)) {
mint ans = 1;
rep(i, k) ans *= abs(a[i]);
cout << ans << '\n';
return 0;
}
if (cnt[0][k] == 0) {
mint ans = b[0][0];
rep(i, k - 1) ans *= b[1][i];
cout << ans << '\n';
return 0;
}
ll now = 0;
rep(j, 2) if (cnt[j][k] < cnt[j][n])
chmax(now, b[j][cnt[j][k] - 1] * b[j][cnt[j][k]]);
mint ans = now;
rep(j, 2) rep(i, cnt[j][k] - 1) ans *= b[j][i];
cout << ans << '\n';
return 0;
}
| replace | 195 | 196 | 195 | 196 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define FORR(i, m, n) for (ll i = m; i >= n; i--)
#define REPO(i, n) for (ll i = 1; i <= n; i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(), n.end()
#define MOD 1000000007
#define P pair<ll, ll>
ll powmod(ll a, ll b) {
a %= MOD;
ll res = 1;
while (b > 0) {
if (b % 2 == 1)
res = res * a % MOD;
a = a * a % MOD;
b /= 2;
}
return res;
}
ll n, k, z, ma;
bool ze, p;
int main() {
cin >> n >> k;
vector<ll> s(n), t1, t2, v1, v2;
REP(i, n) {
cin >> s[i];
if (s[i] == 0)
z++;
else if (s[i] < 0)
t2.push_back(s[i] * -1);
else
t1.push_back(s[i]);
}
sort(ALL(t1));
sort(ALL(t2));
ll t2s = t2.size(), t1s = t1.size();
if (ze > 0)
ze = true;
v1.push_back(0);
v2.push_back(0);
// 正判定
REP(i, k + 1) {
// cout << i << " " << k - i << " " << t1s << " " << t2s << endl;
if (i % 2 == 1)
continue;
if (t1s < k - i)
continue;
if (t2s < i)
continue;
p = true;
ma = max(i, ma);
}
// 正が作れない
if (!p) {
if (ze) {
cout << 0 << endl;
return 0;
}
vector<ll> l;
REP(i, t1s) { l.push_back(t1[i]); }
REP(i, t2s) { l.push_back(t2[i]); }
sort(ALL(l));
ll ans = 1;
REP(i, k) {
ans *= l[i];
ans %= MOD;
}
cout << (MOD * 2 - ans) % MOD << endl;
return 0;
}
vector<P> l;
REP(i, t1s) { l.push_back(P(t1[i], 1)); }
REP(i, t2s) { l.push_back(P(t2[i], -1)); }
sort(ALL(l), greater<P>());
ll ans = 1, cnt = 0, m1 = -1, p1 = -1, m2 = -1, p2 = -1;
REP(i, k) {
ans *= l[i].first;
ans %= MOD;
if (l[i].second == -1)
cnt++;
if (l[i].second == -1)
m1 = l[i].first;
if (l[i].second == 1)
p1 = l[i].first;
}
if (cnt % 2 == 0) {
cout << ans << endl;
return 0;
}
FOR(i, k, n) {
if (m2 == -1 and l[i].second == -1)
m2 = l[i].first;
if (p2 == -1 and l[i].second == 1)
p2 = l[i].first;
}
if (m1 == -1 or p2 == -1) {
ans = ans * m2 % MOD * powmod(p1, MOD - 2) % MOD;
} else if (m2 == -1 or p1 == -1) {
ans = ans * p2 % MOD * powmod(m1, MOD - 2) % MOD;
} else if (p1 * p2 >= m1 * m2) {
ans = ans * p2 % MOD * powmod(m1, MOD - 2) % MOD;
} else {
ans = ans * m2 % MOD * powmod(p1, MOD - 2) % MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define FORR(i, m, n) for (ll i = m; i >= n; i--)
#define REPO(i, n) for (ll i = 1; i <= n; i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(), n.end()
#define MOD 1000000007
#define P pair<ll, ll>
ll powmod(ll a, ll b) {
a %= MOD;
ll res = 1;
while (b > 0) {
if (b % 2 == 1)
res = res * a % MOD;
a = a * a % MOD;
b /= 2;
}
return res;
}
ll n, k, z, ma;
bool ze, p;
int main() {
cin >> n >> k;
vector<ll> s(n), t1, t2, v1, v2;
REP(i, n) {
cin >> s[i];
if (s[i] == 0)
z++;
else if (s[i] < 0)
t2.push_back(s[i] * -1);
else
t1.push_back(s[i]);
}
sort(ALL(t1));
sort(ALL(t2));
ll t2s = t2.size(), t1s = t1.size();
if (z > 0)
ze = true;
v1.push_back(0);
v2.push_back(0);
// 正判定
REP(i, k + 1) {
// cout << i << " " << k - i << " " << t1s << " " << t2s << endl;
if (i % 2 == 1)
continue;
if (t1s < k - i)
continue;
if (t2s < i)
continue;
p = true;
ma = max(i, ma);
}
// 正が作れない
if (!p) {
if (ze) {
cout << 0 << endl;
return 0;
}
vector<ll> l;
REP(i, t1s) { l.push_back(t1[i]); }
REP(i, t2s) { l.push_back(t2[i]); }
sort(ALL(l));
ll ans = 1;
REP(i, k) {
ans *= l[i];
ans %= MOD;
}
cout << (MOD * 2 - ans) % MOD << endl;
return 0;
}
vector<P> l;
REP(i, t1s) { l.push_back(P(t1[i], 1)); }
REP(i, t2s) { l.push_back(P(t2[i], -1)); }
sort(ALL(l), greater<P>());
ll ans = 1, cnt = 0, m1 = -1, p1 = -1, m2 = -1, p2 = -1;
REP(i, k) {
ans *= l[i].first;
ans %= MOD;
if (l[i].second == -1)
cnt++;
if (l[i].second == -1)
m1 = l[i].first;
if (l[i].second == 1)
p1 = l[i].first;
}
if (cnt % 2 == 0) {
cout << ans << endl;
return 0;
}
FOR(i, k, n) {
if (m2 == -1 and l[i].second == -1)
m2 = l[i].first;
if (p2 == -1 and l[i].second == 1)
p2 = l[i].first;
}
if (m1 == -1 or p2 == -1) {
ans = ans * m2 % MOD * powmod(p1, MOD - 2) % MOD;
} else if (m2 == -1 or p1 == -1) {
ans = ans * p2 % MOD * powmod(m1, MOD - 2) % MOD;
} else if (p1 * p2 >= m1 * m2) {
ans = ans * p2 % MOD * powmod(m1, MOD - 2) % MOD;
} else {
ans = ans * m2 % MOD * powmod(p1, MOD - 2) % MOD;
}
cout << ans << endl;
}
| replace | 43 | 44 | 43 | 44 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long mod = 1000000007;
vector<long long> b(0), c(0);
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
b.push_back(-a[i]);
} else {
c.push_back(a[i]);
}
}
sort(b.begin(), b.end());
sort(c.begin(), c.end());
if (k == n) {
long long res = 1;
for (int i = 0; i < static_cast<int>(b.size()); i++) {
res = res * b[i] % mod;
}
for (int i = 0; i < static_cast<int>(c.size()); i++) {
res = res * c[i] % mod;
}
cout << (b.size() % 2 == 0 ? res : (mod - res) % mod) << endl;
} else if (k % 2 == 1 && c.size() == 0) {
long long res = 1;
for (int i = 0; i < k; i++) {
res = res * b[i] % mod;
}
cout << (mod - res) % mod << endl;
} else {
int bl = b.size() - 1, cl = c.size() - 1;
for (int i = 0; i < k; i++) {
if (bl >= 0 && b[bl] >= c[cl]) {
bl--;
} else {
cl--;
}
}
if ((b.size() - bl) % 2 == 0) {
if (bl < 0 || cl == static_cast<int>(c.size()) - 1) {
bl++;
cl--;
} else if (cl < 0) {
bl--;
cl++;
} else if (b[bl] * b[bl + 1] >= c[cl] * c[cl + 1]) {
bl--;
cl++;
} else {
bl++;
cl--;
}
}
long long res = 1;
for (int i = b.size() - 1; i > bl; i--) {
res = res * b[i] % mod;
}
for (int i = c.size() - 1; i > cl; i--) {
res = res * c[i] % mod;
}
cout << res << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long mod = 1000000007;
vector<long long> b(0), c(0);
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
b.push_back(-a[i]);
} else {
c.push_back(a[i]);
}
}
sort(b.begin(), b.end());
sort(c.begin(), c.end());
if (k == n) {
long long res = 1;
for (int i = 0; i < static_cast<int>(b.size()); i++) {
res = res * b[i] % mod;
}
for (int i = 0; i < static_cast<int>(c.size()); i++) {
res = res * c[i] % mod;
}
cout << (b.size() % 2 == 0 ? res : (mod - res) % mod) << endl;
} else if (k % 2 == 1 && c.size() == 0) {
long long res = 1;
for (int i = 0; i < k; i++) {
res = res * b[i] % mod;
}
cout << (mod - res) % mod << endl;
} else {
int bl = b.size() - 1, cl = c.size() - 1;
for (int i = 0; i < k; i++) {
if (bl >= 0 && (cl < 0 || b[bl] >= c[cl])) {
bl--;
} else {
cl--;
}
}
if ((b.size() - bl) % 2 == 0) {
if (bl < 0 || cl == static_cast<int>(c.size()) - 1) {
bl++;
cl--;
} else if (cl < 0) {
bl--;
cl++;
} else if (b[bl] * b[bl + 1] >= c[cl] * c[cl + 1]) {
bl--;
cl++;
} else {
bl++;
cl--;
}
}
long long res = 1;
for (int i = b.size() - 1; i > bl; i--) {
res = res * b[i] % mod;
}
for (int i = c.size() - 1; i > cl; i--) {
res = res * c[i] % mod;
}
cout << res << endl;
}
}
| replace | 49 | 50 | 49 | 50 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <functional>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
if (k == 1) {
ll ans = -1e10;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
ans = max(ans, x);
}
cout << ans << endl;
return 0;
}
const ll MOD = 1e9 + 7;
if (n == k) {
ll ans = 1;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
ans *= x;
ans %= MOD;
}
cout << (ans + MOD) % MOD << endl;
return 0;
}
priority_queue<ll> ppq;
priority_queue<ll, vector<ll>, greater<ll>> npq;
vector<ll> a(n);
bool alln = true;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
if (x >= 0)
ppq.emplace(x);
if (x < 0)
npq.emplace(x);
a[i] = x;
if (x > 0)
alln = false;
}
if (alln) {
if (k % 2)
sort(a.rbegin(), a.rend());
else
sort(a.begin(), a.end());
ll ans = 1;
for (int i = 0; i < k; i++) {
ans *= a[i];
ans %= MOD;
}
cout << (ans + MOD) % MOD << endl;
return 0;
}
ll ans = 1;
priority_queue<ll, vector<ll>, greater<ll>> ansp;
priority_queue<ll> ansn;
for (int i = 0; i < k; i++) {
if (ppq.empty()) {
ansn.push(npq.top());
npq.pop();
continue;
}
if (npq.empty()) {
ansp.push(ppq.top());
ppq.pop();
continue;
}
if (ppq.top() >= -npq.top()) {
ansp.emplace(ppq.top());
ppq.pop();
} else {
ansn.emplace(npq.top());
npq.pop();
}
}
if (ansn.size() % 2) {
if (ppq.empty()) {
ansp.pop();
ansn.push(npq.top());
} else if (npq.empty()) {
ansn.pop();
ansp.push(ppq.top());
} else {
if (ansp.top() * ppq.top() > ansn.top() * npq.top()) {
ansn.pop();
ansp.push(ppq.top());
} else {
ansp.pop();
ansn.push(npq.top());
}
}
}
while (ansp.size()) {
ans = ans * ansp.top() % MOD;
ansp.pop();
}
while (ansn.size()) {
ans = ans * (ansn.top() + MOD) % MOD;
ansn.pop();
}
cout << ans % MOD << endl;
}
| #include <bits/stdc++.h>
#include <functional>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
if (k == 1) {
ll ans = -1e10;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
ans = max(ans, x);
}
cout << ans << endl;
return 0;
}
const ll MOD = 1e9 + 7;
if (n == k) {
ll ans = 1;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
ans *= x;
ans %= MOD;
}
cout << (ans + MOD) % MOD << endl;
return 0;
}
priority_queue<ll> ppq;
priority_queue<ll, vector<ll>, greater<ll>> npq;
vector<ll> a(n);
bool alln = true;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
if (x >= 0)
ppq.emplace(x);
if (x < 0)
npq.emplace(x);
a[i] = x;
if (x > 0)
alln = false;
}
if (alln) {
if (k % 2)
sort(a.rbegin(), a.rend());
else
sort(a.begin(), a.end());
ll ans = 1;
for (int i = 0; i < k; i++) {
ans *= a[i];
ans %= MOD;
}
cout << (ans + MOD) % MOD << endl;
return 0;
}
ll ans = 1;
priority_queue<ll, vector<ll>, greater<ll>> ansp;
priority_queue<ll> ansn;
for (int i = 0; i < k; i++) {
if (ppq.empty()) {
ansn.push(npq.top());
npq.pop();
continue;
}
if (npq.empty()) {
ansp.push(ppq.top());
ppq.pop();
continue;
}
if (ppq.top() >= -npq.top()) {
ansp.emplace(ppq.top());
ppq.pop();
} else {
ansn.emplace(npq.top());
npq.pop();
}
}
if (ansn.size() % 2) {
if (ppq.empty()) {
ansp.pop();
ansn.push(npq.top());
} else if (npq.empty()) {
ansn.pop();
ansp.push(ppq.top());
} else if (ansp.empty()) {
ansp.push(ppq.top());
ansn.pop();
} else {
if (ansp.top() * ppq.top() > ansn.top() * npq.top()) {
ansn.pop();
ansp.push(ppq.top());
} else {
ansp.pop();
ansn.push(npq.top());
}
}
}
while (ansp.size()) {
ans = ans * ansp.top() % MOD;
ansp.pop();
}
while (ansn.size()) {
ans = ans * (ansn.top() + MOD) % MOD;
ansn.pop();
}
cout << ans % MOD << endl;
}
| insert | 88 | 88 | 88 | 91 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
multiset<long long int> a, b;
for (int i = 0; i < n; i++) {
long long int num;
cin >> num;
if (num >= 0)
a.insert(num);
if (num < 0)
b.insert(-num);
}
int negative = b.size();
long long int ans = 1;
if (k % 2 == 1 && negative == n) {
for (int i = 0; i < k; i++) {
ans *= *b.begin();
ans %= MOD;
b.erase(b.begin());
}
ans *= -1;
ans = (ans % MOD + MOD) % MOD;
} else {
int count = 0;
while (count < k) {
if (count == k - 1 || b.size() <= 1) {
ans *= *prev(a.end());
ans %= MOD;
a.erase(prev(a.end()));
count += 1;
} else if (a.size() <= 1) {
ans *= *prev(b.end());
ans %= MOD;
b.erase(prev(b.end()));
ans *= *prev(b.end());
ans %= MOD;
b.erase(prev(b.end()));
count += 2;
} else {
auto a1 = prev(a.end());
auto a2 = prev(a1);
auto b1 = prev(b.end());
auto b2 = prev(b1);
if (*a1 * *a2 > *b1 * *b2) {
ans *= *prev(a.end());
ans %= MOD;
a.erase(prev(a.end()));
count += 1;
} else {
ans *= *prev(b.end());
ans %= MOD;
b.erase(prev(b.end()));
ans *= *prev(b.end());
ans %= MOD;
b.erase(prev(b.end()));
count += 2;
}
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
multiset<long long int> a, b;
for (int i = 0; i < n; i++) {
long long int num;
cin >> num;
if (num >= 0)
a.insert(num);
if (num < 0)
b.insert(-num);
}
int negative = b.size();
long long int ans = 1;
if (n == k) {
for (auto aa : a) {
ans *= aa;
ans %= MOD;
}
for (auto bb : b) {
ans *= bb;
ans %= MOD;
}
if (b.size() % 2 == 1) {
ans *= -1;
ans = (ans % MOD + MOD) % MOD;
}
} else if (k % 2 == 1 && negative == n) {
for (int i = 0; i < k; i++) {
ans *= *b.begin();
ans %= MOD;
b.erase(b.begin());
}
ans *= -1;
ans = (ans % MOD + MOD) % MOD;
} else {
int count = 0;
while (count < k) {
if (count == k - 1 || b.size() <= 1) {
ans *= *prev(a.end());
ans %= MOD;
a.erase(prev(a.end()));
count += 1;
} else if (a.size() <= 1) {
ans *= *prev(b.end());
ans %= MOD;
b.erase(prev(b.end()));
ans *= *prev(b.end());
ans %= MOD;
b.erase(prev(b.end()));
count += 2;
} else {
auto a1 = prev(a.end());
auto a2 = prev(a1);
auto b1 = prev(b.end());
auto b2 = prev(b1);
if (*a1 * *a2 > *b1 * *b2) {
ans *= *prev(a.end());
ans %= MOD;
a.erase(prev(a.end()));
count += 1;
} else {
ans *= *prev(b.end());
ans %= MOD;
b.erase(prev(b.end()));
ans *= *prev(b.end());
ans %= MOD;
b.erase(prev(b.end()));
count += 2;
}
}
}
}
cout << ans << endl;
return 0;
} | replace | 21 | 22 | 21 | 35 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include "debug_print.hpp"
#else
void debug(...) {}
#endif
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x;
ll cnt;
mint(ll x = 0) : x((x % mod + mod) % mod), cnt(0) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint m) {
if ((x += m.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint m) {
if ((x += mod - m.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint m) {
if (m.x == 0)
cnt = 0;
x *= m.x;
if (x != 0)
cnt += m.cnt;
if (x >= mod) {
cnt += x / mod;
x %= mod;
}
return *this;
}
mint operator+(const mint m) const { return mint(*this) += m; }
mint operator-(const mint m) const { return mint(*this) -= m; }
mint operator*(const mint m) const { return mint(*this) *= m; }
mint pow(ll n) const {
if (!n)
return 1;
mint m = pow(n >> 1);
m *= m;
if (n & 1)
m *= *this;
return m;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint m) { return *this *= m.inv(); }
mint operator/(const mint m) const { return mint(*this) /= m; }
};
istream &operator>>(istream &is, mint &m) { return is >> m.x; }
ostream &operator<<(ostream &os, const mint &m) { return os << m.x; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<ll> P, M;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
if (a >= 0)
P.push_back(a);
else
M.push_back(-a);
}
if (N == K) {
mint ans = 1;
for (auto p : P)
ans *= p;
for (auto m : M)
ans *= -m;
cout << ans << endl;
return 0;
}
if (M.size() == N && K % 2 == 1) {
sort(M.begin(), M.end());
mint ans = 1;
for (int i = 0; i < K; i++)
ans *= M[i];
ans *= -1;
cout << ans << endl;
return 0;
}
sort(P.begin(), P.end(), greater<ll>());
sort(M.begin(), M.end(), greater<ll>());
int pidx = 0;
int midx = 0;
mint ans = 1;
while (pidx + midx < K) {
ll x = 0, y = 0;
if (pidx + 1 < P.size())
x = P[pidx] * P[pidx + 1];
if (midx + 1 < M.size())
y = M[midx] * M[midx + 1];
if (x > y || pidx + midx == K - 1) {
ans *= P[pidx];
pidx++;
} else {
ans *= M[midx];
ans *= M[midx + 1];
midx += 2;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include "debug_print.hpp"
#else
void debug(...) {}
#endif
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x;
ll cnt;
mint(ll x = 0) : x((x % mod + mod) % mod), cnt(0) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint m) {
if ((x += m.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint m) {
if ((x += mod - m.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint m) {
if (m.x == 0)
cnt = 0;
x *= m.x;
if (x != 0)
cnt += m.cnt;
if (x >= mod) {
cnt += x / mod;
x %= mod;
}
return *this;
}
mint operator+(const mint m) const { return mint(*this) += m; }
mint operator-(const mint m) const { return mint(*this) -= m; }
mint operator*(const mint m) const { return mint(*this) *= m; }
mint pow(ll n) const {
if (!n)
return 1;
mint m = pow(n >> 1);
m *= m;
if (n & 1)
m *= *this;
return m;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint m) { return *this *= m.inv(); }
mint operator/(const mint m) const { return mint(*this) /= m; }
};
istream &operator>>(istream &is, mint &m) { return is >> m.x; }
ostream &operator<<(ostream &os, const mint &m) { return os << m.x; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<ll> P, M;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
if (a >= 0)
P.push_back(a);
else
M.push_back(-a);
}
if (N == K) {
mint ans = 1;
for (auto p : P)
ans *= p;
for (auto m : M)
ans *= -m;
cout << ans << endl;
return 0;
}
if (M.size() == N && K % 2 == 1) {
sort(M.begin(), M.end());
mint ans = 1;
for (int i = 0; i < K; i++)
ans *= M[i];
ans *= -1;
cout << ans << endl;
return 0;
}
sort(P.begin(), P.end(), greater<ll>());
sort(M.begin(), M.end(), greater<ll>());
int pidx = 0;
int midx = 0;
mint ans = 1;
while (pidx + midx < K) {
ll x = -1, y = -1;
if (pidx + 1 < P.size())
x = P[pidx] * P[pidx + 1];
if (midx + 1 < M.size())
y = M[midx] * M[midx + 1];
if (x > y || pidx + midx == K - 1) {
ans *= P[pidx];
pidx++;
} else {
ans *= M[midx];
ans *= M[midx + 1];
midx += 2;
}
}
cout << ans << endl;
return 0;
}
| replace | 98 | 99 | 98 | 99 | 0 | |
p02616 | C++ | Runtime Error | /*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 com(ll a, ll b) {
if (abs(a) < abs(b))
return true;
return false;
}
int main() {
init();
inl(N, K);
vl p;
p.reserve(N);
vl m;
m.reserve(N);
bool z = false;
REP(i, N) {
inl(tmp);
if (tmp > 0)
p.pb(tmp);
if (tmp < 0)
m.pb(tmp);
if (tmp == 0)
z = true;
}
if (K % 2 == 1 && p.size() == 0) {
if (z == true) {
die(0);
}
sort(all(m), com);
mint max = 1;
REP(i, K) {
if (i < m.size())
max *= m[i];
else
max = 0;
}
die(max);
}
sort(rall(p), com);
bool odd = false;
ll other;
if (K % 2 == 1) {
odd = true;
other = p.back();
p.pop_back();
}
vl a;
REP(i, p.size()) a.pb(p[i]);
REP(i, m.size()) a.pb(m[i]);
sort(all(a), com);
mint max = 1;
for (ll i = 0; i + 1 < K; i++) {
if (*(a.end() - 1) ^ (*(a.end() - 2)) == false) {
max *= *(a.end() - 1) ^ (*(a.end() - 2));
}
}
if (odd == false) {
die(max);
} else {
out(max * other);
}
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 com(ll a, ll b) {
if (abs(a) < abs(b))
return true;
return false;
}
int main() {
init();
inl(N, K);
vl a(N);
in1(a);
sort(rall(a), com);
mint Max = 1;
bool pls = true;
bool zr = false;
REP(i, K) {
Max *= a[i];
pls ^= (a[i] < 0);
zr |= (a[i] == 0);
}
if (pls || zr)
die(Max);
// max!=0
ll inP = INF, outP = INF, inM = INF, outM = INF;
REREP(i, K) {
if (inP == INF && a[i] > 0)
inP = a[i];
if (inM == INF && a[i] < 0)
inM = a[i];
}
FOR(i, K, N) {
if (outP == INF && a[i] >= 0)
outP = a[i];
if (outM == INF && a[i] < 0)
outM = a[i];
}
if (inP != INF && outP != INF && inM != INF && outM != INF) {
// outM/inP or outP/inM
// outM*inM or outP*inP
if (outM * inM < outP * inP)
Max *= (mint)outP / inM;
else
Max *= (mint)outM / inP;
die(Max);
}
if (inP != INF && outM != INF) {
Max *= (mint)outM / inP;
die(Max);
}
if (inM != INF && outP != INF) {
Max *= (mint)outP / inM;
die(Max);
}
Max = 1;
REP(i, K) { Max *= a[N - 1 - i]; }
out(Max);
return 0;
} | replace | 273 | 324 | 273 | 320 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1LL << 60;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
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;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> p, q, r;
int zero = 0;
for (ll A : a) {
if (A > 0)
p.push_back(A);
if (A < 0)
q.push_back(A);
if (A == 0) {
p.push_back(A);
zero++;
}
}
int MAX = min(k, (int)q.size()), MIN = max(k - (int)p.size(), 0);
if (MAX != MIN || MIN % 2 == 0) { // ans is non-negative
mint ans = 1;
sort(rALL(p));
sort(ALL(q));
int ip = 0, iq = 0;
while (k) {
if (k >= 2 && (int)q.size() - iq >= 2 && (int)p.size() - ip >= 2 &&
p[ip] * p[ip + 1] < q[iq] * q[iq + 1]) {
k -= 2;
ans *= q[iq];
ans *= q[iq + 1];
iq += 2;
} else {
k -= 1;
ans *= p[ip];
ip++;
}
}
cout << ans.x << endl;
} else if (zero == 0) { // ans is negative
mint ans = 1;
sort(ALL(p));
sort(rALL(q));
rep(i, min(k, (int)q.size())) { ans *= q[i]; }
rep(i, k - (int)q.size()) { ans *= p[i]; }
cout << ans.x << endl;
} else { // ans is zero
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1LL << 60;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
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;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> p, q, r;
int zero = 0;
for (ll A : a) {
if (A > 0)
p.push_back(A);
if (A < 0)
q.push_back(A);
if (A == 0) {
p.push_back(A);
zero++;
}
}
int MAX = min(k, (int)q.size()), MIN = max(k - (int)p.size(), 0);
if (MAX != MIN || MIN % 2 == 0) { // ans is non-negative
mint ans = 1;
sort(rALL(p));
sort(ALL(q));
int ip = 0, iq = 0;
while (k) {
if (k >= 2 && (int)q.size() - iq >= 2 && (int)p.size() - ip >= 2 &&
p[ip] * p[ip + 1] < q[iq] * q[iq + 1]) {
k -= 2;
ans *= q[iq];
ans *= q[iq + 1];
iq += 2;
} else if (k >= 2 && (int)q.size() - iq >= 2 && (int)p.size() - ip < 2) {
k -= 2;
ans *= q[iq];
ans *= q[iq + 1];
iq += 2;
} else {
k -= 1;
ans *= p[ip];
ip++;
}
}
cout << ans.x << endl;
} else if (zero == 0) { // ans is negative
mint ans = 1;
sort(ALL(p));
sort(rALL(q));
rep(i, min(k, (int)q.size())) { ans *= q[i]; }
rep(i, k - (int)q.size()) { ans *= p[i]; }
cout << ans.x << endl;
} else { // ans is zero
cout << 0 << endl;
}
return 0;
} | insert | 91 | 91 | 91 | 96 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const long long MOD = 1e9 + 7;
const long double Pi = acos(-1);
using P = pair<ll, ll>;
ll gcd(ll a, ll b) { // aとbの最大公約数を返す//計算量は0(log(max(a,b))
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { // aとbの最小公倍数を返す//計算量は0(log(max(a,b))
return a * b / gcd(a, b);
}
ll pow(ll x, ll y) { // x^yを返す//計算量は0(log(y))
ll tmp = x, res = 1;
while (y) {
if (y % 2) {
res = res * tmp % MOD;
}
y >>= 1;
tmp = tmp * tmp % MOD;
}
return res;
}
ll nature(ll a) { // 絶対値を返す
if (a >= 0) {
return (a);
} else {
return (-1 * a);
}
}
ll prime(ll a) { // 素数なら1を返す//計算量は0(sqrt(a))
if (a == 2) {
return 1;
} else if (a % 2 == 0 || a == 1) {
return 0;
}
for (ll i = 3; i * i <= a; i += 2) {
if (a % i == 0) {
return 0;
}
}
return 1;
}
int main() {
ll N, K, a, ans = 1;
cin >> N >> K;
vector<ll> A(0);
vector<ll> B(0);
for (ll i = 0; i < N; i++) {
cin >> a;
if (a >= 0) {
A.push_back(a);
} else {
B.push_back(a);
}
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
sort(B.begin(), B.end());
ll x = 0;
ll y = 0;
// cout<<A.size()<<" "<<B.size()<<endl;
if (B.size() == 0) {
for (int i = 0; i < K; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
if (A.size() == 0) {
if (K % 2 == 1) {
for (int i = 0; i < K; i++) {
ans *= B.at((ll)B.size() - i - 1);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
} else {
for (int i = 0; i < K; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
}
cout << ans << endl;
return 0;
}
if (N == K + 1) {
if ((int)B.size() % 2 == 1) {
for (int i = 0; i < (ll)A.size(); i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < (ll)B.size() - 1; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
} else {
for (int i = 0; i < (ll)A.size() - 1; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < (ll)B.size(); i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
}
if (N == K) {
for (int i = 0; i < (ll)A.size(); i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < (ll)B.size(); i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
/*
int bb=max((ll)0,K-(ll)A.size()+(K-(ll)A.size())%2);
for(int i=0;i<K-bb;i++){
ans*=A.at(i);
ans%=MOD;
ans+=MOD;
ans%=MOD;
}
for(int i=0;i<bb;i++){
ans*=B.at(i);
ans%=MOD;
ans+=MOD;
ans%=MOD;
}
*/
for (int i = 0; i < K; i++) {
if (x == (ll)A.size()) {
y++;
continue;
}
if (y == (ll)B.size()) {
x++;
continue;
}
if (A.at(x) >= -1 * B.at(y)) {
x++;
} else {
y++;
}
}
if (x == 0) {
if (y % 2 == 0) {
for (int i = 0; i < y; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
} else {
ans = A.at(0);
for (int i = 0; i < y - 1; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
}
if (y == 0) {
for (int i = 0; i < x; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
if (y % 2 == 0) {
for (int i = 0; i < x; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < y; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
} else {
if (x == (ll)A.size()) {
for (int i = 0; i < x - 1; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < y + 1; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
if (y == (ll)B.size()) {
for (int i = 0; i < x + 1; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < y - 1; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
if (A.at(x) * A.at(x - 1) >= B.at(x) * B.at(x - 1)) {
} else {
}
cout << ans << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const long long MOD = 1e9 + 7;
const long double Pi = acos(-1);
using P = pair<ll, ll>;
ll gcd(ll a, ll b) { // aとbの最大公約数を返す//計算量は0(log(max(a,b))
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { // aとbの最小公倍数を返す//計算量は0(log(max(a,b))
return a * b / gcd(a, b);
}
ll pow(ll x, ll y) { // x^yを返す//計算量は0(log(y))
ll tmp = x, res = 1;
while (y) {
if (y % 2) {
res = res * tmp % MOD;
}
y >>= 1;
tmp = tmp * tmp % MOD;
}
return res;
}
ll nature(ll a) { // 絶対値を返す
if (a >= 0) {
return (a);
} else {
return (-1 * a);
}
}
ll prime(ll a) { // 素数なら1を返す//計算量は0(sqrt(a))
if (a == 2) {
return 1;
} else if (a % 2 == 0 || a == 1) {
return 0;
}
for (ll i = 3; i * i <= a; i += 2) {
if (a % i == 0) {
return 0;
}
}
return 1;
}
int main() {
ll N, K, a, ans = 1;
cin >> N >> K;
vector<ll> A(0);
vector<ll> B(0);
for (ll i = 0; i < N; i++) {
cin >> a;
if (a >= 0) {
A.push_back(a);
} else {
B.push_back(a);
}
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
sort(B.begin(), B.end());
ll x = 0;
ll y = 0;
// cout<<A.size()<<" "<<B.size()<<endl;
if (B.size() == 0) {
for (int i = 0; i < K; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
if (A.size() == 0) {
if (K % 2 == 1) {
for (int i = 0; i < K; i++) {
ans *= B.at((ll)B.size() - i - 1);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
} else {
for (int i = 0; i < K; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
}
cout << ans << endl;
return 0;
}
if (N == K + 1) {
if ((int)B.size() % 2 == 1) {
for (int i = 0; i < (ll)A.size(); i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < (ll)B.size() - 1; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
} else {
for (int i = 0; i < (ll)A.size() - 1; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < (ll)B.size(); i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
}
if (N == K) {
for (int i = 0; i < (ll)A.size(); i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < (ll)B.size(); i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
/*
int bb=max((ll)0,K-(ll)A.size()+(K-(ll)A.size())%2);
for(int i=0;i<K-bb;i++){
ans*=A.at(i);
ans%=MOD;
ans+=MOD;
ans%=MOD;
}
for(int i=0;i<bb;i++){
ans*=B.at(i);
ans%=MOD;
ans+=MOD;
ans%=MOD;
}
*/
for (int i = 0; i < K; i++) {
if (x == (ll)A.size()) {
y++;
continue;
}
if (y == (ll)B.size()) {
x++;
continue;
}
if (A.at(x) >= -1 * B.at(y)) {
x++;
} else {
y++;
}
}
if (x == 0) {
if (y % 2 == 0) {
for (int i = 0; i < y; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
} else {
ans = A.at(0);
for (int i = 0; i < y - 1; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
}
if (y == 0) {
for (int i = 0; i < x; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
if (y % 2 == 0) {
for (int i = 0; i < x; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < y; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
} else {
if (x == (ll)A.size()) {
for (int i = 0; i < x - 1; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < y + 1; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
if (y == (ll)B.size()) {
for (int i = 0; i < x + 1; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < y - 1; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
if (A.at(x) * A.at(x - 1) >= B.at(y) * B.at(y - 1)) {
for (int i = 0; i < x + 1; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < y - 1; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
} else {
for (int i = 0; i < x - 1; i++) {
ans *= A.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
for (int i = 0; i < y + 1; i++) {
ans *= B.at(i);
ans %= MOD;
ans += MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
}
} | replace | 255 | 263 | 255 | 288 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
// #include<unordered_map>
using namespace std;
#define ll long long
#define dd cout << endl
const long long int inf = 1e18 + 7;
const int mod = 1e9 + 7;
using namespace std;
inline ll int max(ll int a, ll int b) { return a > b ? a : b; }
inline ll int min(ll int a, ll int b) { return a < b ? a : b; }
const int N = 2e5 + 10;
int n, k;
ll a[N];
ll mp[N];
inline bool cmp(ll x, ll y) { return abs(x) < abs(y); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (a[i] >= 0)
mp[1]++;
else
mp[2]++;
}
int l = 1, r = n;
ll ans = 1;
if (mp[1] == 0 && k % 2 == 1) {
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= k; ++i) {
ans = a[i] * ans % mod;
}
} else {
sort(a + 1, a + 1 + n, greater<int>());
while (k > 0) {
if (k % 2 == 1)
ans = ans * a[l++] % mod;
else if (k >= 2) {
if (a[l] * a[l + 1] >= a[r] * a[r - 1]) {
ans = ans * a[l] % mod * a[l + 1] % mod;
l += 2;
k -= 2;
} else {
ans = ans * a[r - 1] % mod * a[r] % mod;
r -= 2;
k -= 2;
}
}
}
}
cout << (ans % mod + mod) % mod << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
// #include<unordered_map>
using namespace std;
#define ll long long
#define dd cout << endl
const long long int inf = 1e18 + 7;
const int mod = 1e9 + 7;
using namespace std;
inline ll int max(ll int a, ll int b) { return a > b ? a : b; }
inline ll int min(ll int a, ll int b) { return a < b ? a : b; }
const int N = 2e5 + 10;
int n, k;
ll a[N];
ll mp[N];
inline bool cmp(ll x, ll y) { return abs(x) < abs(y); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (a[i] >= 0)
mp[1]++;
else
mp[2]++;
}
int l = 1, r = n;
ll ans = 1;
if (mp[1] == 0 && k % 2 == 1) {
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= k; ++i) {
ans = a[i] * ans % mod;
}
} else {
sort(a + 1, a + 1 + n, greater<int>());
while (k > 0) {
if (k % 2 == 1)
ans = ans * a[l++] % mod, k--;
else if (k >= 2) {
if (a[l] * a[l + 1] >= a[r] * a[r - 1]) {
ans = ans * a[l] % mod * a[l + 1] % mod;
l += 2;
k -= 2;
} else {
ans = ans * a[r - 1] % mod * a[r] % mod;
r -= 2;
k -= 2;
}
}
}
}
cout << (ans % mod + mod) % mod << endl;
return 0;
}
| replace | 58 | 59 | 58 | 59 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
#define dump(x) cerr << #x << ": " << x << endl;
#define bit(k) (1LL << (k))
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "{" << p.first << ", " << p.second << "}";
return os;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = (ll)1e9;
const ll INFLL = (ll)1e18 + 1;
const ll MOD = (ll)1e9 + 7;
const double PI = acos(-1.0);
/*
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const string dir = "DRUL";
*/
struct mint {
long long x;
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 modpow(long long t) const {
if (!t)
return 1;
mint a = modpow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return modpow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
friend std::ostream &operator<<(std::ostream &os, const mint &a) {
os << a.x;
return os;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll N, K;
cin >> N >> K;
vector<ll> s, f;
vector<ll> A;
ll cntz = 0, cntpl = 0, cntmi = 0;
rep(i, N) {
ll a;
cin >> a;
A.push_back(abs(a));
if (a == 0)
cntz++;
if (a > 0) {
s.push_back(a);
cntpl++;
}
if (a < 0) {
f.push_back(abs(a));
cntmi++;
}
}
sort(all(A));
sort(all(s), greater<>());
sort(all(f), greater<>());
mint ans = 1;
if (N == K) {
rep(i, K) ans *= A[i];
if (cntmi & 1)
ans = -ans;
cout << ans << endl;
return 0;
}
// K < N;
ll idx[] = {0, 0};
if (K & 1) {
if (cntpl > 0) {
ans *= s[0];
idx[0]++;
}
//
else {
if (cntz > 0)
cout << 0 << endl;
else {
rep(i, K) { ans *= A[i]; }
ans = -ans;
cout << ans << endl;
}
return 0;
}
}
// 残りの偶数個を決めていく
rep(_, K / 2) {
ll tmp[2];
tmp[0] = s[idx[0]] * s[idx[0] + 1];
tmp[1] = f[idx[1]] * f[idx[1] + 1];
if (tmp[0] < tmp[1]) {
ans *= tmp[1];
idx[1] += 2;
} else {
ans *= tmp[0];
idx[0] += 2;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
#define dump(x) cerr << #x << ": " << x << endl;
#define bit(k) (1LL << (k))
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "{" << p.first << ", " << p.second << "}";
return os;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = (ll)1e9;
const ll INFLL = (ll)1e18 + 1;
const ll MOD = (ll)1e9 + 7;
const double PI = acos(-1.0);
/*
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const string dir = "DRUL";
*/
struct mint {
long long x;
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 modpow(long long t) const {
if (!t)
return 1;
mint a = modpow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return modpow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
friend std::ostream &operator<<(std::ostream &os, const mint &a) {
os << a.x;
return os;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll N, K;
cin >> N >> K;
vector<ll> s(K, 0), f(K, 0);
vector<ll> A;
ll cntz = 0, cntpl = 0, cntmi = 0;
rep(i, N) {
ll a;
cin >> a;
A.push_back(abs(a));
if (a == 0)
cntz++;
if (a > 0) {
s.push_back(a);
cntpl++;
}
if (a < 0) {
f.push_back(abs(a));
cntmi++;
}
}
sort(all(A));
sort(all(s), greater<>());
sort(all(f), greater<>());
mint ans = 1;
if (N == K) {
rep(i, K) ans *= A[i];
if (cntmi & 1)
ans = -ans;
cout << ans << endl;
return 0;
}
// K < N;
ll idx[] = {0, 0};
if (K & 1) {
if (cntpl > 0) {
ans *= s[0];
idx[0]++;
}
//
else {
if (cntz > 0)
cout << 0 << endl;
else {
rep(i, K) { ans *= A[i]; }
ans = -ans;
cout << ans << endl;
}
return 0;
}
}
// 残りの偶数個を決めていく
rep(_, K / 2) {
ll tmp[2];
tmp[0] = s[idx[0]] * s[idx[0] + 1];
tmp[1] = f[idx[1]] * f[idx[1] + 1];
if (tmp[0] < tmp[1]) {
ans *= tmp[1];
idx[1] += 2;
} else {
ans *= tmp[0];
idx[0] += 2;
}
}
cout << ans << endl;
}
| replace | 115 | 116 | 115 | 116 | 0 | |
p02616 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
void Main() {
const int MOD = 1e9 + 7;
int n, k;
cin >> n >> k;
vll pos;
vll neg;
rep(i, n) {
ll a;
cin >> a;
if (a >= 0)
pos.pb(a);
else
neg.pb(-a);
}
int po = pos.size();
int ne = neg.size();
if (n == k) {
ll ans = 1;
for (auto a : pos)
ans = (ans * a) % MOD;
for (auto a : neg)
ans = (ans * a) % MOD;
if (ne & 1)
ans = (MOD - ans) % MOD;
cout << ans << endl;
return;
}
if (po == 0 && (k & 1)) {
sort(all(neg));
ll ans = 1;
rep(i, k) { ans = (ans * neg[i]) % MOD; }
ans = (MOD - ans) % MOD;
cout << ans << endl;
return;
}
sort(rall(pos));
sort(rall(neg));
ll ans = 1;
int pi = 0;
int ni = 0;
ll tp, tn;
if (k) {
ans = (ans * pos[pi]) % MOD;
k--;
pi++;
}
while (k >= 2) {
if (pi + 1 < po)
tp = pos[pi] * pos[pi + 1];
else
tp = -1;
if (ni + 1 < ne)
tn = neg[ni] * neg[ni + 1];
else
tn = -1;
if (tp == -1 || tn >= tp) {
ans = (ans % MOD) * (tn % MOD) % MOD;
ni += 2;
} else {
ans = (ans % MOD) * (tp % MOD) % MOD;
pi += 2;
}
k -= 2;
}
// cout << ans << endl;
// cout << k << ": " << ni << " " << pi << " " << endl;
cout << ans << 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;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
void Main() {
const int MOD = 1e9 + 7;
int n, k;
cin >> n >> k;
vll pos;
vll neg;
rep(i, n) {
ll a;
cin >> a;
if (a >= 0)
pos.pb(a);
else
neg.pb(-a);
}
int po = pos.size();
int ne = neg.size();
if (n == k) {
ll ans = 1;
for (auto a : pos)
ans = (ans * a) % MOD;
for (auto a : neg)
ans = (ans * a) % MOD;
if (ne & 1)
ans = (MOD - ans) % MOD;
cout << ans << endl;
return;
}
if (po == 0 && (k & 1)) {
sort(all(neg));
ll ans = 1;
rep(i, k) { ans = (ans * neg[i]) % MOD; }
ans = (MOD - ans) % MOD;
cout << ans << endl;
return;
}
sort(rall(pos));
sort(rall(neg));
ll ans = 1;
int pi = 0;
int ni = 0;
ll tp, tn;
if (k & 1) {
ans = (ans * pos[pi]) % MOD;
k--;
pi++;
}
while (k >= 2) {
if (pi + 1 < po)
tp = pos[pi] * pos[pi + 1];
else
tp = -1;
if (ni + 1 < ne)
tn = neg[ni] * neg[ni + 1];
else
tn = -1;
if (tp == -1 || tn >= tp) {
ans = (ans % MOD) * (tn % MOD) % MOD;
ni += 2;
} else {
ans = (ans % MOD) * (tp % MOD) % MOD;
pi += 2;
}
k -= 2;
}
// cout << ans << endl;
// cout << k << ": " << ni << " " << pi << " " << endl;
cout << ans << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | replace | 68 | 69 | 68 | 69 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define pb push_back
#define fst first
#define snd second
typedef long long ll;
typedef pair<int, int> pii;
template <typename T>
using min_queue = priority_queue<T, vector<T>, greater<T>>;
const ll MOD = 1e9 + 7;
int N, K;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
vector<ll> pos, neg;
int C = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (x > 0)
pos.pb(x);
else if (x < 0)
neg.pb(-x);
else
C++;
}
int A = pos.size(), B = neg.size();
sort(pos.begin(), pos.end());
sort(neg.begin(), neg.end());
ll res = 1;
if (N == K) {
if (C)
res = 0;
else {
for (ll k : pos)
res = res * k % MOD;
for (ll k : neg)
res = res * k % MOD;
if (B % 2 == 1)
res = (MOD - res) % MOD;
}
cout << res << '\n';
return 0;
}
if (A == 0) {
if (K > B) {
res = 0;
} else if (K % 2 == 0) {
for (int i = B - 1; i >= B - K; i--)
res = res * neg[i] % MOD;
} else if (C > 0) {
res = 0;
} else {
for (int i = 0; i < K; i++)
res = res * neg[i] % MOD;
res = (MOD - res) % MOD;
}
cout << res << '\n';
return 0;
}
int mx = A + B / 2 * 2;
if (mx < K) {
res = 0;
} else {
int i = A - 1, j = B - 1;
if (K % 2 == 1) {
res = pos[i];
i--;
K--;
}
while (K >= 2) {
ll a = 0, b = 0;
if (i > 0)
a = pos[i] * pos[i - 1];
if (j > 0)
b = neg[i] * neg[i - 1];
if (max(a, b) == 0)
break;
if (a >= b) {
i -= 2;
res = (res * (a % MOD)) % MOD;
} else {
j -= 2;
res = (res * (b % MOD)) % MOD;
}
K -= 2;
}
}
cout << res << '\n';
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define pb push_back
#define fst first
#define snd second
typedef long long ll;
typedef pair<int, int> pii;
template <typename T>
using min_queue = priority_queue<T, vector<T>, greater<T>>;
const ll MOD = 1e9 + 7;
int N, K;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
vector<ll> pos, neg;
int C = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (x > 0)
pos.pb(x);
else if (x < 0)
neg.pb(-x);
else
C++;
}
int A = pos.size(), B = neg.size();
sort(pos.begin(), pos.end());
sort(neg.begin(), neg.end());
ll res = 1;
if (N == K) {
if (C)
res = 0;
else {
for (ll k : pos)
res = res * k % MOD;
for (ll k : neg)
res = res * k % MOD;
if (B % 2 == 1)
res = (MOD - res) % MOD;
}
cout << res << '\n';
return 0;
}
if (A == 0) {
if (K > B) {
res = 0;
} else if (K % 2 == 0) {
for (int i = B - 1; i >= B - K; i--)
res = res * neg[i] % MOD;
} else if (C > 0) {
res = 0;
} else {
for (int i = 0; i < K; i++)
res = res * neg[i] % MOD;
res = (MOD - res) % MOD;
}
cout << res << '\n';
return 0;
}
int mx = A + B / 2 * 2;
if (mx < K) {
res = 0;
} else {
int i = A - 1, j = B - 1;
if (K % 2 == 1) {
res = pos[i];
i--;
K--;
}
while (K >= 2) {
ll a = 0, b = 0;
if (i > 0)
a = pos[i] * pos[i - 1];
if (j > 0)
b = neg[j] * neg[j - 1];
if (a >= b) {
i -= 2;
res = (res * (a % MOD)) % MOD;
} else {
j -= 2;
res = (res * (b % MOD)) % MOD;
}
K -= 2;
}
}
cout << res << '\n';
return 0;
}
| replace | 101 | 104 | 101 | 102 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
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;
}
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
// constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
struct mint {
long long x;
mint(long long x = 0) : x((x % mod + mod) % mod) {}
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;
}
};
int main() {
/*
cin.tie(nullptr);
ios::sync_with_stdio(false);
*/
ll n, k;
scanf("%lld %lld", &n, &k);
vector<ll> a(n);
for (int i = 0; i < n; i++)
scanf("%lld", &a[i]);
sort(a.rbegin(), a.rend());
vector<ll> vmn, vpl;
ll z = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 0)
z++;
else if (a[i] > 0)
vpl.emplace_back(a[i]);
else
vmn.emplace_back(llabs(a[i]));
}
bool ok = false;
if (k <= vpl.size())
ok = true;
else {
for (ll i = 0; i <= vpl.size(); i++) {
if ((k - i) % 2 == 1)
continue;
ll r = k - i;
if (r <= vmn.size()) {
ok = true;
break;
}
}
}
if (!ok) {
if (z > 0)
puts("0");
else {
vector<ll> v;
for (int i = 0; i < n; i++) {
v.emplace_back(llabs(a[i]));
}
sort(v.begin(), v.end());
mint res = 1;
for (int i = 0; i < k; i++)
res *= v[i];
res *= -1;
cout << res.x << "\n";
}
return 0;
}
sort(vmn.rbegin(), vmn.rend());
sort(vpl.rbegin(), vpl.rend());
mint res = 1;
int ppos, mpos;
ppos = mpos = 0;
if (k & 1) {
k--;
res *= vpl[ppos++];
}
while (k > 0) {
if (ppos + 1 < vpl.size() and mpos + 1 < vmn.size()) {
ll val_pl = vpl[ppos] * vpl[ppos + 1];
ll val_mn = vmn[mpos] * vmn[mpos + 1];
if (val_mn > val_pl) {
res *= val_mn % 1000000007;
mpos += 2;
} else {
res *= val_pl % 1000000007;
ppos += 2;
}
} else if (ppos + 1 < vpl.size()) {
res *= vpl[ppos++];
res *= vpl[ppos++];
} else {
res *= vpl[mpos++];
res *= vpl[mpos++];
}
k -= 2;
}
cout << res.x << "\n";
return 0;
}
| #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
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;
}
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
// constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
struct mint {
long long x;
mint(long long x = 0) : x((x % mod + mod) % mod) {}
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;
}
};
int main() {
/*
cin.tie(nullptr);
ios::sync_with_stdio(false);
*/
ll n, k;
scanf("%lld %lld", &n, &k);
vector<ll> a(n);
for (int i = 0; i < n; i++)
scanf("%lld", &a[i]);
sort(a.rbegin(), a.rend());
vector<ll> vmn, vpl;
ll z = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 0)
z++;
else if (a[i] > 0)
vpl.emplace_back(a[i]);
else
vmn.emplace_back(llabs(a[i]));
}
bool ok = false;
if (k <= vpl.size())
ok = true;
else {
for (ll i = 0; i <= vpl.size(); i++) {
if ((k - i) % 2 == 1)
continue;
ll r = k - i;
if (r <= vmn.size()) {
ok = true;
break;
}
}
}
if (!ok) {
if (z > 0)
puts("0");
else {
vector<ll> v;
for (int i = 0; i < n; i++) {
v.emplace_back(llabs(a[i]));
}
sort(v.begin(), v.end());
mint res = 1;
for (int i = 0; i < k; i++)
res *= v[i];
res *= -1;
cout << res.x << "\n";
}
return 0;
}
sort(vmn.rbegin(), vmn.rend());
sort(vpl.rbegin(), vpl.rend());
mint res = 1;
int ppos, mpos;
ppos = mpos = 0;
if (k & 1) {
k--;
res *= vpl[ppos++];
}
while (k > 0) {
if (ppos + 1 < vpl.size() and mpos + 1 < vmn.size()) {
ll val_pl = vpl[ppos] * vpl[ppos + 1];
ll val_mn = vmn[mpos] * vmn[mpos + 1];
if (val_mn > val_pl) {
res *= val_mn % 1000000007;
mpos += 2;
} else {
res *= val_pl % 1000000007;
ppos += 2;
}
} else if (ppos + 1 < vpl.size()) {
res *= vpl[ppos++];
res *= vpl[ppos++];
} else {
res *= vmn[mpos++];
res *= vmn[mpos++];
}
k -= 2;
}
cout << res.x << "\n";
return 0;
}
| replace | 178 | 180 | 178 | 180 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
vector<ll> v1, v2, u;
ll n, k, a, cnt1, cnt2, N, MOD = 1000000007, ans = 1;
int main(void) {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < 0) {
cnt2++;
v2.push_back(-a);
} else {
cnt1++;
v1.push_back(a);
}
}
if (cnt2 % 2 == 1)
N = cnt2 - 1;
else
N = cnt2;
if (N + cnt1 < k) {
for (int i = 0; i < cnt2; i++) {
v1.push_back(v2[i]);
}
sort(v1.begin(), v1.end());
for (int i = 0; i < k; i++) {
ans *= v1[i];
ans %= MOD;
}
ans = -ans;
cout << (ans + MOD) % MOD << endl;
return 0;
} else {
if (k % 2 == 0) {
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
reverse(v1.begin(), v1.end());
reverse(v2.begin(), v2.end());
for (int i = 0; i < cnt1 / 2; i++) {
u.push_back(v1[i * 2] * v1[i * 2 + 1]);
}
for (int i = 0; i < cnt2 / 2; i++) {
u.push_back(v2[i * 2] * v2[i * 2 + 1]);
}
sort(u.begin(), u.end());
reverse(u.begin(), u.end());
for (int i = 0; i < k / 2; i++) {
ans *= (u[i] % MOD);
ans %= MOD;
}
cout << ans << endl;
return 0;
} else {
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
reverse(v1.begin(), v1.end());
reverse(v2.begin(), v2.end());
ans *= v1[0];
for (int i = 0; i < (cnt1 - 1) / 2; i++) {
u.push_back(v1[i * 2 + 1] * v1[i * 2 + 2]);
}
for (int i = 0; i < cnt2 / 2; i++) {
u.push_back(v2[i * 2] * v2[i * 2 + 1]);
}
sort(u.begin(), u.end());
reverse(u.begin(), u.end());
for (int i = 0; i < k / 2; i++) {
ans *= (u[i] % MOD);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
}
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
vector<ll> v1, v2, u;
ll n, k, a, cnt1, cnt2, N, MOD = 1000000007, ans = 1;
int main(void) {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < 0) {
cnt2++;
v2.push_back(-a);
} else {
cnt1++;
v1.push_back(a);
}
}
if (cnt2 % 2 == 1)
N = cnt2 - 1;
else
N = cnt2;
if (N + cnt1 < k || ((cnt1 == 0) && (k % 2 == 1))) {
for (int i = 0; i < cnt2; i++) {
v1.push_back(v2[i]);
}
sort(v1.begin(), v1.end());
for (int i = 0; i < k; i++) {
ans *= v1[i];
ans %= MOD;
}
ans = -ans;
cout << (ans + MOD) % MOD << endl;
return 0;
} else {
if (k % 2 == 0) {
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
reverse(v1.begin(), v1.end());
reverse(v2.begin(), v2.end());
for (int i = 0; i < cnt1 / 2; i++) {
u.push_back(v1[i * 2] * v1[i * 2 + 1]);
}
for (int i = 0; i < cnt2 / 2; i++) {
u.push_back(v2[i * 2] * v2[i * 2 + 1]);
}
sort(u.begin(), u.end());
reverse(u.begin(), u.end());
for (int i = 0; i < k / 2; i++) {
ans *= (u[i] % MOD);
ans %= MOD;
}
cout << ans << endl;
return 0;
} else {
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
reverse(v1.begin(), v1.end());
reverse(v2.begin(), v2.end());
ans *= v1[0];
for (int i = 0; i < (cnt1 - 1) / 2; i++) {
u.push_back(v1[i * 2 + 1] * v1[i * 2 + 2]);
}
for (int i = 0; i < cnt2 / 2; i++) {
u.push_back(v2[i * 2] * v2[i * 2 + 1]);
}
sort(u.begin(), u.end());
reverse(u.begin(), u.end());
for (int i = 0; i < k / 2; i++) {
ans *= (u[i] % MOD);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
}
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p02616 | C++ | Runtime Error | // C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
#define repex(i, a, b, c) for (int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define a first
#define b second
#define all(x) x.begin(), x.end()
const LL MOD = 1e9 + 7;
int main() {
// 1. 入力情報.
int N, K;
scanf("%d %d", &N, &K);
LL a;
vector<P> A;
rep(i, N) {
scanf("%lld", &a);
if (a < 0)
A.pb({-a, -1});
else
A.pb({a, 1});
}
// 2. sort.
sort(all(A));
// 3. 左右に分割.
// 左: N - K個.
int mL = 0, mR = 0; // 左半分, 右半分の負整数.
int lp = -1, lm = -1; // 左半分で, 一番右側に出現する正整数, 負整数.
int rp = -1, rm = -1; // 右半分で, 一番左側に出現する正整数, 負整数.
repr(i, N - 1 - K, 0) {
if (A[i].b < 0) {
mL++;
if (lm == -1)
lm = i;
} else {
if (lp == -1)
lp = i;
}
}
// 右: K個.
repx(i, N - K, N) {
if (A[i].b < 0) {
mR++;
if (rm == -1)
rm = i;
} else {
if (rp == -1)
rp = i;
}
}
// 4. 選んだ要素の積としてありえる最大値は？
// 4-1. mR が 偶数個 の 場合.
LL ans = 1LL;
if (mR % 2 == 0)
repr(i, N - 1, N - K) ans *= A[i].a, ans %= MOD;
// 4-2. mR が 奇数個 の 場合.
if (mR % 2 != 0) {
if (lp >= 0) {
if (lm >= 0) {
if (rp >= 0) {
// 左半分, 右半分 ともに 正整数, 負整数 が 混在している場合.
// (lm, lp, rm ,rp) = (〇, 〇, 〇, 〇) の 場合.
if (rm >= 0) {
LL a1 = A[lm].a * A[rm].a;
LL a2 = A[lp].a * A[rp].a;
repr(i, N - 1, N - K) if (i != rp && i != rm) ans *= A[i].a,
ans %= MOD;
ans *= (max(a1, a2) % MOD); // テストケース hand_04 対策.
ans %= MOD;
// puts("oooo");
}
// 左半分 は 正整数, 負整数 が 混在しており, 右半分 は
// 正整数のみの場合. (lm, lp, rm ,rp) = (〇, 〇, ×, 〇) の 場合.
if (rm == -1) {
repr(i, N - 1, N - K) ans *= A[i].a, ans %= MOD;
// puts("ooxo");
}
} else {
// 左半分 は 正整数, 負整数 が 混在しており, 右半分 は 負整数のみ の
// 場合. (lm, lp, rm ,rp) = (〇, 〇, 〇, ×) の 場合.
if (rm >= 0) {
repr(i, N - 1, N - K) if (i != rm) ans *= A[i].a, ans %= MOD;
ans *= A[lp].a;
ans %= MOD;
// puts("ooox");
}
// 左半分 は 正整数, 負整数 が 混在しており, 右半分がない場合.
// (lm, lp, rm ,rp) = (〇, 〇, ×, ×) の 場合.
// ここには到達しないはず.
if (rm == -1)
assert(0);
}
} else {
if (rp >= 0) {
// 左半分は, 正整数のみ, 右半分 ともに 正整数, 負整数 が
// 混在している場合. (lm, lp, rm, rp) = (×, 〇, 〇, 〇) の 場合.
if (rm >= 0) {
repr(i, N - 1, N - K) if (i != rm) ans *= A[i].a, ans %= MOD;
ans *= A[lp].a;
ans %= MOD;
// puts("xooo");
}
// 左半分 も 右半分 のいずれも正整数のみの場合.
// (lm, lp, rm, rp) = (×, 〇, ×, 〇) の 場合.
if (rm == -1) {
repr(i, N - 1, N - K) ans *= A[i].a, ans %= MOD;
// puts("xoxo");
}
} else {
// 左半分は, 正整数のみ, 右半分は 負整数のみ の 場合.
// (lm, lp, rm, rp) = (×, 〇, 〇, ×) の 場合.
if (rm >= 0) {
repr(i, N - 1, N - K) if (i != rm) ans *= A[i].a, ans %= MOD;
ans *= A[lp].a;
ans %= MOD;
// puts("xoox");
}
// 左半分 は 正整数のみ, 右半分がない場合.
// (lm, lp, rm, rp) = (×, 〇, ×, ×) の 場合.
// ここには到達しないはず.
if (rm == -1)
assert(0);
}
}
} else {
if (lm >= 0) {
if (rp >= 0) {
// 左半分 は 負整数のみ, 右半分は 正整数, 負整数 が 混在している場合.
// (lm, lp, rm ,rp) = (〇, ×, 〇, 〇) の 場合.
if (rm >= 0) {
repr(i, N - 1, N - K) if (i != rp) ans *= A[i].a, ans %= MOD;
ans *= A[lm].a;
ans %= MOD;
// puts("oxoo");
}
// 左半分 は 負整数のみ, 右半分 は 正整数のみ の 場合.
// (lm, lp, rm ,rp) = (〇, ×, ×, 〇) の 場合.
if (rm == -1) {
repr(i, N - 1, N - K) ans *= A[i].a, ans %= MOD;
// puts("oxxo");
}
} else {
// 左半分 は 負整数のみ, 右半分 は 負整数のみ の 場合.
// (lm, lp, rm ,rp) = (〇, ×, 〇, ×) の 場合.
if (rm >= 0) {
rep(i, K) ans *= A[i].a, ans %= MOD;
ans = ans * (MOD - 1) % MOD; // -1倍.
// puts("oxox");
}
// 左半分 は 負整数のみ, 右半分がない場合.
// (lm, lp, rm ,rp) = (〇, ×, ×, ×) の 場合.
// ここには到達しないはず.
if (rm == -1)
assert(0);
}
} else {
if (rp >= 0) {
// 左半分がなく, 右半分 は 正整数, 負整数 が 混在している場合.
// (lm, lp, rm, rp) = (×, ×, 〇, 〇) の 場合.
if (rm >= 0) {
rep(i, K) ans *= A[i].a, ans %= MOD;
ans = ans * (MOD - 1) % MOD; // -1倍.
// puts("xxoo");
}
// 左半分がなく, 右半分 は 正整数のみ の 場合.
// (lm, lp, rm, rp) = (×, ×, ×, 〇) の 場合.
// ここには到達しないはず.
if (rm == -1)
assert(0);
} else {
// 左半分がなく, 右半分は 負整数のみ の 場合.
// (lm, lp, rm, rp) = (×, ×, 〇, ×) の 場合.
// ここには到達しないはず.
if (rm >= 0)
assert(0);
// 左半分, 右半分 ともにない場合.
// (lm, lp, rm, rp) = (×, ×, ×, ×) の 場合.
// ここには到達しないはず.
if (rm == -1)
assert(0);
}
}
}
}
// 5. 出力.
printf("%lld\n", ans);
return 0;
} | // C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
#define repex(i, a, b, c) for (int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define a first
#define b second
#define all(x) x.begin(), x.end()
const LL MOD = 1e9 + 7;
int main() {
// 1. 入力情報.
int N, K;
scanf("%d %d", &N, &K);
LL a;
vector<P> A;
rep(i, N) {
scanf("%lld", &a);
if (a < 0)
A.pb({-a, -1});
else
A.pb({a, 1});
}
// 2. sort.
sort(all(A));
// 3. 左右に分割.
// 左: N - K個.
int mL = 0, mR = 0; // 左半分, 右半分の負整数.
int lp = -1, lm = -1; // 左半分で, 一番右側に出現する正整数, 負整数.
int rp = -1, rm = -1; // 右半分で, 一番左側に出現する正整数, 負整数.
repr(i, N - 1 - K, 0) {
if (A[i].b < 0) {
mL++;
if (lm == -1)
lm = i;
} else {
if (lp == -1)
lp = i;
}
}
// 右: K個.
repx(i, N - K, N) {
if (A[i].b < 0) {
mR++;
if (rm == -1)
rm = i;
} else {
if (rp == -1)
rp = i;
}
}
// 4. 選んだ要素の積としてありえる最大値は？
// 4-1. mR が 偶数個 の 場合.
LL ans = 1LL;
if (mR % 2 == 0)
repr(i, N - 1, N - K) ans *= A[i].a, ans %= MOD;
// 4-2. mR が 奇数個 の 場合.
if (mR % 2 != 0) {
if (lp >= 0) {
if (lm >= 0) {
if (rp >= 0) {
// 左半分, 右半分 ともに 正整数, 負整数 が 混在している場合.
// (lm, lp, rm ,rp) = (〇, 〇, 〇, 〇) の 場合.
if (rm >= 0) {
LL a1 = A[lm].a * A[rm].a;
LL a2 = A[lp].a * A[rp].a;
repr(i, N - 1, N - K) if (i != rp && i != rm) ans *= A[i].a,
ans %= MOD;
ans *= (max(a1, a2) % MOD); // テストケース hand_04 対策.
ans %= MOD;
// puts("oooo");
}
// 左半分 は 正整数, 負整数 が 混在しており, 右半分 は
// 正整数のみの場合. (lm, lp, rm ,rp) = (〇, 〇, ×, 〇) の 場合.
if (rm == -1) {
repr(i, N - 1, N - K) ans *= A[i].a, ans %= MOD;
// puts("ooxo");
}
} else {
// 左半分 は 正整数, 負整数 が 混在しており, 右半分 は 負整数のみ の
// 場合. (lm, lp, rm ,rp) = (〇, 〇, 〇, ×) の 場合.
if (rm >= 0) {
repr(i, N - 1, N - K) if (i != rm) ans *= A[i].a, ans %= MOD;
ans *= A[lp].a;
ans %= MOD;
// puts("ooox");
}
// 左半分 は 正整数, 負整数 が 混在しており, 右半分がない場合.
// (lm, lp, rm ,rp) = (〇, 〇, ×, ×) の 場合.
// ここには到達しないはず.
if (rm == -1)
assert(0);
}
} else {
if (rp >= 0) {
// 左半分は, 正整数のみ, 右半分 ともに 正整数, 負整数 が
// 混在している場合. (lm, lp, rm, rp) = (×, 〇, 〇, 〇) の 場合.
if (rm >= 0) {
repr(i, N - 1, N - K) if (i != rm) ans *= A[i].a, ans %= MOD;
ans *= A[lp].a;
ans %= MOD;
// puts("xooo");
}
// 左半分 も 右半分 のいずれも正整数のみの場合.
// (lm, lp, rm, rp) = (×, 〇, ×, 〇) の 場合.
if (rm == -1) {
repr(i, N - 1, N - K) ans *= A[i].a, ans %= MOD;
// puts("xoxo");
}
} else {
// 左半分は, 正整数のみ, 右半分は 負整数のみ の 場合.
// (lm, lp, rm, rp) = (×, 〇, 〇, ×) の 場合.
if (rm >= 0) {
repr(i, N - 1, N - K) if (i != rm) ans *= A[i].a, ans %= MOD;
ans *= A[lp].a;
ans %= MOD;
// puts("xoox");
}
// 左半分 は 正整数のみ, 右半分がない場合.
// (lm, lp, rm, rp) = (×, 〇, ×, ×) の 場合.
// ここには到達しないはず.
if (rm == -1)
assert(0);
}
}
} else {
if (lm >= 0) {
if (rp >= 0) {
// 左半分 は 負整数のみ, 右半分は 正整数, 負整数 が 混在している場合.
// (lm, lp, rm ,rp) = (〇, ×, 〇, 〇) の 場合.
if (rm >= 0) {
repr(i, N - 1, N - K) if (i != rp) ans *= A[i].a, ans %= MOD;
ans *= A[lm].a;
ans %= MOD;
// puts("oxoo");
}
// 左半分 は 負整数のみ, 右半分 は 正整数のみ の 場合.
// (lm, lp, rm ,rp) = (〇, ×, ×, 〇) の 場合.
if (rm == -1) {
repr(i, N - 1, N - K) ans *= A[i].a, ans %= MOD;
// puts("oxxo");
}
} else {
// 左半分 は 負整数のみ, 右半分 は 負整数のみ の 場合.
// (lm, lp, rm ,rp) = (〇, ×, 〇, ×) の 場合.
if (rm >= 0) {
rep(i, K) ans *= A[i].a, ans %= MOD;
ans = ans * (MOD - 1) % MOD; // -1倍.
// puts("oxox");
}
// 左半分 は 負整数のみ, 右半分がない場合.
// (lm, lp, rm ,rp) = (〇, ×, ×, ×) の 場合.
// ここには到達しないはず.
if (rm == -1)
assert(0);
}
} else {
if (rp >= 0) {
// 左半分がなく, 右半分 は 正整数, 負整数 が 混在している場合.
// (lm, lp, rm, rp) = (×, ×, 〇, 〇) の 場合.
if (rm >= 0) {
rep(i, K) ans *= A[i].a, ans %= MOD;
ans = ans * (MOD - 1) % MOD; // -1倍.
// puts("xxoo");
}
// 左半分がなく, 右半分 は 正整数のみ の 場合.
// (lm, lp, rm, rp) = (×, ×, ×, 〇) の 場合.
// ここには到達しないはず.
if (rm == -1)
assert(0);
} else {
// 左半分がなく, 右半分は 負整数のみ の 場合.
// (lm, lp, rm, rp) = (×, ×, 〇, ×) の 場合.
// random_m02 で 到達するパターン.
if (rm >= 0) {
rep(i, K) ans *= A[i].a, ans %= MOD;
ans = ans * (MOD - 1) % MOD; // -1倍.
// puts("xxox");
}
// 左半分, 右半分 ともにない場合.
// (lm, lp, rm, rp) = (×, ×, ×, ×) の 場合.
// ここには到達しないはず.
if (rm == -1)
assert(0);
}
}
}
}
// 5. 出力.
printf("%lld\n", ans);
return 0;
} | replace | 184 | 187 | 184 | 190 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
/*
__,.二ﾆ==- ﾆ．、_.
.,.．‐ ⌒ ｀`'ァ-ﾆ、.
ィ'´. ´丶.、
.,ィ'´ `.ｘ、..
.. ／. ､＼.
.ﾝ′. ￢`""冖ｰミト．
,ｒ′. .ﾍ、 `
ﾂ `、....
./´ ﾍ
..... /. .〉.
´/.. .ｌ
ｨ ． ｆ..
.. .ｆ ,d. l ′ 」 ,. ﾄ ！
. 〕../.ｆ.. ′ ．. | .｝ | |.
.!./..f.. / !－ ナ丶п冖т ﾉｰ- ． 〕 |.
|ﾒ | ｜ j , ┌． |〈. л`. /|.. ┤,..
...「...｜. | ´ l. | j.Ｌ......ｭ.Ｌ＿└ヽ_｜Y. ﾒムｗ ょ | j.: | ￣
. ｜. т〕＜.ィ冖T冖.. г‐ `､ `, /┴￢..г￣|.. .′ ｜
... | ．.. ),|.. ｀ ﾘ 「_ﾉ.|| ` V |!｛,｢ll ´.」. 卜
. ｜.」 ′ ヽ └++〃.. ﾙｗｆ ｶz′. ｜.
|..〕 ｢ ．|
.ｌ.|. ′. |
. .〕.. `! _...．.ｰ：'' ｣ ´ λ.
_｢. , ┐_,、｀~‐''"´ ィ .､ ﾍ、
ｆ :_＿..,二ュ．-i―'''^~´ ､＼イ ヘ．`ｘ
. / ｛ j .~^
､/ 'ｔ.. 丿..
.../. ,x┐.. ∠∫
:^. / ￣冖ー=zzｭ┌ｰ―-- ∟,二...＿. _,､．-ｰ.'l+~. .l｀．
. У. ⌒冖‐-=．_.. l｢.｢ ´￣｣了 .,､-''＾ 〉 ヽ_
_/. ￣~'.ー-=．、＿,..usｧ.ｰ''" ｛ ＼´
_ヰl'￢―- ､_ （ .＼
*/
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
ll const MOD = 1000000007;
ll const INF = (long long int)1 << 61;
ll mypow(ll x, ll n, ll mod = MOD) {
ll ret = 1;
while (n > 0) {
if (n & 1) {
ret = (ret * x) % mod;
}
x = (x * x) % mod;
n >>= 1;
}
return ret;
}
ll mygcd(ll a, ll b) {
if (b == 0)
return a;
return mygcd(b, a % b);
}
ll twoPow(ll shiftNum) { return (1LL << (shiftNum - 1)); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a) {
cin >> x;
}
ll mnum = 0;
ll pnum = 0;
ll zero = 0;
vector<pair<ll, bool>> b;
vector<ll> m;
vector<ll> p;
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
mnum++;
b.push_back({-a[i], false});
m.push_back(a[i]);
} else if (a[i] == 0) {
zero++;
b.push_back({0, true});
} else {
pnum++;
b.push_back({a[i], true});
p.push_back(a[i]);
}
}
sort(b.begin(), b.end(), greater<pair<ll, bool>>());
sort(m.begin(), m.end());
sort(p.begin(), p.end(), greater<ll>());
if (pnum == 0 && k % 2 != 0) {
if (zero > 0) {
cout << 0 << endl;
return 0;
} else {
ll ans = 1;
ll num = 0;
for (int i = n - 1; i >= 0; i--) {
if (num == k) {
break;
}
if (b[i].second) {
ans *= b[i].first;
ans %= MOD;
} else {
ans *= (MOD - b[i].first);
ans %= MOD;
}
num++;
}
cout << ans << endl;
}
} else if (pnum + mnum < k) {
cout << 0 << endl;
return 0;
} else if (pnum + mnum == k) {
if (mnum % 2 == 0) {
ll ans = 1;
ll num = 0;
for (int i = 0; i < n; i++) {
if (num == k) {
break;
}
if (b[i].second) {
ans *= b[i].first;
ans %= MOD;
} else {
ans *= (MOD - b[i].first);
ans %= MOD;
}
num++;
}
cout << ans << endl;
} else {
if (zero > 0) {
cout << 0 << endl;
return 0;
} else {
ll ans = 1;
ll num = 0;
for (int i = n - 1; i >= 0; i--) {
if (num == k) {
break;
}
if (!b[i].second) {
ans *= (MOD - b[i].first);
ans %= MOD;
} else {
ans *= b[i].first;
ans %= MOD;
}
num++;
}
cout << ans << endl;
return 0;
}
}
} else {
if (mnum % 2 == 0) {
if (pnum % 2 != 0) {
pnum--;
}
ll ans = 1;
ll num = 0;
ll mct = 0;
ll pct = 0;
while (true) {
if (num == k) {
break;
}
ll mtmp = -1;
if (mct + 1 < m.size()) {
mtmp = m[mct] * m[mct + 1];
}
ll ptmp = -1;
if (pct + 1 < p.size()) {
ptmp = p[pct] * p[pct + 1];
}
if (mtmp > ptmp) {
mct += 2;
ans *= (mtmp) % MOD;
ans %= MOD;
} else {
pct += 2;
ans *= (ptmp) % MOD;
ans %= MOD;
}
num += 2;
}
cout << ans << endl;
return 0;
} else {
ll num = 1;
ll ans = p[0];
ll mct = 0;
ll pct = 1;
while (true) {
if (num == k) {
break;
}
ll mtmp = -1;
if (mct + 1 < m.size()) {
mtmp = m[mct] * m[mct + 1];
}
ll ptmp = -1;
if (pct + 1 < p.size()) {
ptmp = p[pct] * p[pct + 1];
}
if (mtmp > ptmp) {
mct += 2;
ans *= mtmp % MOD;
ans %= MOD;
} else {
pct += 2;
ans *= ptmp % MOD;
ans %= MOD;
}
num += 2;
}
cout << ans << endl;
return 0;
}
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
/*
__,.二ﾆ==- ﾆ．、_.
.,.．‐ ⌒ ｀`'ァ-ﾆ、.
ィ'´. ´丶.、
.,ィ'´ `.ｘ、..
.. ／. ､＼.
.ﾝ′. ￢`""冖ｰミト．
,ｒ′. .ﾍ、 `
ﾂ `、....
./´ ﾍ
..... /. .〉.
´/.. .ｌ
ｨ ． ｆ..
.. .ｆ ,d. l ′ 」 ,. ﾄ ！
. 〕../.ｆ.. ′ ．. | .｝ | |.
.!./..f.. / !－ ナ丶п冖т ﾉｰ- ． 〕 |.
|ﾒ | ｜ j , ┌． |〈. л`. /|.. ┤,..
...「...｜. | ´ l. | j.Ｌ......ｭ.Ｌ＿└ヽ_｜Y. ﾒムｗ ょ | j.: | ￣
. ｜. т〕＜.ィ冖T冖.. г‐ `､ `, /┴￢..г￣|.. .′ ｜
... | ．.. ),|.. ｀ ﾘ 「_ﾉ.|| ` V |!｛,｢ll ´.」. 卜
. ｜.」 ′ ヽ └++〃.. ﾙｗｆ ｶz′. ｜.
|..〕 ｢ ．|
.ｌ.|. ′. |
. .〕.. `! _...．.ｰ：'' ｣ ´ λ.
_｢. , ┐_,、｀~‐''"´ ィ .､ ﾍ、
ｆ :_＿..,二ュ．-i―'''^~´ ､＼イ ヘ．`ｘ
. / ｛ j .~^
､/ 'ｔ.. 丿..
.../. ,x┐.. ∠∫
:^. / ￣冖ー=zzｭ┌ｰ―-- ∟,二...＿. _,､．-ｰ.'l+~. .l｀．
. У. ⌒冖‐-=．_.. l｢.｢ ´￣｣了 .,､-''＾ 〉 ヽ_
_/. ￣~'.ー-=．、＿,..usｧ.ｰ''" ｛ ＼´
_ヰl'￢―- ､_ （ .＼
*/
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
ll const MOD = 1000000007;
ll const INF = (long long int)1 << 61;
ll mypow(ll x, ll n, ll mod = MOD) {
ll ret = 1;
while (n > 0) {
if (n & 1) {
ret = (ret * x) % mod;
}
x = (x * x) % mod;
n >>= 1;
}
return ret;
}
ll mygcd(ll a, ll b) {
if (b == 0)
return a;
return mygcd(b, a % b);
}
ll twoPow(ll shiftNum) { return (1LL << (shiftNum - 1)); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a) {
cin >> x;
}
ll mnum = 0;
ll pnum = 0;
ll zero = 0;
vector<pair<ll, bool>> b;
vector<ll> m;
vector<ll> p;
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
mnum++;
b.push_back({-a[i], false});
m.push_back(a[i]);
} else if (a[i] == 0) {
zero++;
b.push_back({0, true});
} else {
pnum++;
b.push_back({a[i], true});
p.push_back(a[i]);
}
}
sort(b.begin(), b.end(), greater<pair<ll, bool>>());
sort(m.begin(), m.end());
sort(p.begin(), p.end(), greater<ll>());
if (pnum == 0 && k % 2 != 0) {
if (zero > 0) {
cout << 0 << endl;
return 0;
} else {
ll ans = 1;
ll num = 0;
for (int i = n - 1; i >= 0; i--) {
if (num == k) {
break;
}
if (b[i].second) {
ans *= b[i].first;
ans %= MOD;
} else {
ans *= (MOD - b[i].first);
ans %= MOD;
}
num++;
}
cout << ans << endl;
}
} else if (pnum + mnum < k) {
cout << 0 << endl;
return 0;
} else if (pnum + mnum == k) {
if (mnum % 2 == 0) {
ll ans = 1;
ll num = 0;
for (int i = 0; i < n; i++) {
if (num == k) {
break;
}
if (b[i].second) {
ans *= b[i].first;
ans %= MOD;
} else {
ans *= (MOD - b[i].first);
ans %= MOD;
}
num++;
}
cout << ans << endl;
} else {
if (zero > 0) {
cout << 0 << endl;
return 0;
} else {
ll ans = 1;
ll num = 0;
for (int i = n - 1; i >= 0; i--) {
if (num == k) {
break;
}
if (!b[i].second) {
ans *= (MOD - b[i].first);
ans %= MOD;
} else {
ans *= b[i].first;
ans %= MOD;
}
num++;
}
cout << ans << endl;
return 0;
}
}
} else {
if (k % 2 == 0) {
if (pnum % 2 != 0) {
pnum--;
}
ll ans = 1;
ll num = 0;
ll mct = 0;
ll pct = 0;
while (true) {
if (num == k) {
break;
}
ll mtmp = -1;
if (mct + 1 < m.size()) {
mtmp = m[mct] * m[mct + 1];
}
ll ptmp = -1;
if (pct + 1 < p.size()) {
ptmp = p[pct] * p[pct + 1];
}
if (mtmp > ptmp) {
mct += 2;
ans *= (mtmp) % MOD;
ans %= MOD;
} else {
pct += 2;
ans *= (ptmp) % MOD;
ans %= MOD;
}
num += 2;
}
cout << ans << endl;
return 0;
} else {
ll num = 1;
ll ans = p[0];
ll mct = 0;
ll pct = 1;
while (true) {
if (num == k) {
break;
}
ll mtmp = -1;
if (mct + 1 < m.size()) {
mtmp = m[mct] * m[mct + 1];
}
ll ptmp = -1;
if (pct + 1 < p.size()) {
ptmp = p[pct] * p[pct + 1];
}
if (mtmp > ptmp) {
mct += 2;
ans *= mtmp % MOD;
ans %= MOD;
} else {
pct += 2;
ans *= ptmp % MOD;
ans %= MOD;
}
num += 2;
}
cout << ans << endl;
return 0;
}
}
return 0;
} | replace | 185 | 186 | 185 | 186 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 100005
struct MOD_INT {
MOD_INT(ll arg_value) {
value = arg_value;
value %= MOD;
}
MOD_INT operator-() const { return MOD_INT(-value); }
MOD_INT &operator+=(const MOD_INT arg) {
if ((value += arg.value) >= MOD) {
value -= MOD;
}
return *this;
}
MOD_INT &operator-=(const MOD_INT arg) {
if ((value += MOD - arg.value) >= MOD) {
value -= MOD;
}
return *this;
}
MOD_INT &operator*=(const MOD_INT arg) {
(value *= arg.value) %= MOD;
return *this;
}
MOD_INT operator+(const MOD_INT arg) const { return MOD_INT(*this) += arg; }
MOD_INT operator-(const MOD_INT arg) const { return MOD_INT(*this) -= arg; }
MOD_INT operator*(const MOD_INT arg) const { return MOD_INT(*this) *= arg; }
ll value;
};
ll N, K;
ll A[SIZE];
int main() {
scanf("%lld %lld", &N, &K);
vector<ll> PLUS, NEG;
for (ll i = 0; i < N; i++) {
scanf("%lld", &A[i]);
if (A[i] < 0) {
NEG.push_back(A[i]);
} else {
PLUS.push_back(A[i]);
}
}
ll num_NEG = NEG.size();
ll num_PLUS = PLUS.size();
bool FLG = false;
if (num_PLUS > 0) {
if (N == K) {
FLG = (num_NEG % 2 == 0);
} else {
FLG = true;
}
} else { // num_PLUS == 0
FLG = (K % 2 == 0);
}
MOD_INT ans = 1;
if (!FLG) { // 答えが負になる
for (int i = 0; i < N; i++) {
A[i] = abs(A[i]);
}
sort(A, A + N);
for (int i = 0; i < K; i++) {
ans *= A[i];
}
ans *= -1;
} else {
sort(PLUS.begin(), PLUS.end());
sort(NEG.rbegin(), NEG.rend());
if (K % 2 == 1) {
ans *= PLUS.back();
PLUS.pop_back();
}
vector<ll> work;
while (PLUS.size() >= 2) {
ll tmp = PLUS.back();
PLUS.pop_back();
tmp *= PLUS.back();
PLUS.pop_back();
work.push_back(tmp);
}
while (NEG.size() >= 2) {
ll tmp = NEG.back();
NEG.pop_back();
tmp *= NEG.back();
NEG.pop_back();
work.push_back(tmp);
}
sort(work.rbegin(), work.rend());
for (ll i = 0; i < K / 2; i++) {
ans *= work[i];
}
}
printf("%lld\n", (ans.value + MOD) % MOD);
return 0;
}
| #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
struct MOD_INT {
MOD_INT(ll arg_value) {
value = arg_value;
value %= MOD;
}
MOD_INT operator-() const { return MOD_INT(-value); }
MOD_INT &operator+=(const MOD_INT arg) {
if ((value += arg.value) >= MOD) {
value -= MOD;
}
return *this;
}
MOD_INT &operator-=(const MOD_INT arg) {
if ((value += MOD - arg.value) >= MOD) {
value -= MOD;
}
return *this;
}
MOD_INT &operator*=(const MOD_INT arg) {
(value *= arg.value) %= MOD;
return *this;
}
MOD_INT operator+(const MOD_INT arg) const { return MOD_INT(*this) += arg; }
MOD_INT operator-(const MOD_INT arg) const { return MOD_INT(*this) -= arg; }
MOD_INT operator*(const MOD_INT arg) const { return MOD_INT(*this) *= arg; }
ll value;
};
ll N, K;
ll A[SIZE];
int main() {
scanf("%lld %lld", &N, &K);
vector<ll> PLUS, NEG;
for (ll i = 0; i < N; i++) {
scanf("%lld", &A[i]);
if (A[i] < 0) {
NEG.push_back(A[i]);
} else {
PLUS.push_back(A[i]);
}
}
ll num_NEG = NEG.size();
ll num_PLUS = PLUS.size();
bool FLG = false;
if (num_PLUS > 0) {
if (N == K) {
FLG = (num_NEG % 2 == 0);
} else {
FLG = true;
}
} else { // num_PLUS == 0
FLG = (K % 2 == 0);
}
MOD_INT ans = 1;
if (!FLG) { // 答えが負になる
for (int i = 0; i < N; i++) {
A[i] = abs(A[i]);
}
sort(A, A + N);
for (int i = 0; i < K; i++) {
ans *= A[i];
}
ans *= -1;
} else {
sort(PLUS.begin(), PLUS.end());
sort(NEG.rbegin(), NEG.rend());
if (K % 2 == 1) {
ans *= PLUS.back();
PLUS.pop_back();
}
vector<ll> work;
while (PLUS.size() >= 2) {
ll tmp = PLUS.back();
PLUS.pop_back();
tmp *= PLUS.back();
PLUS.pop_back();
work.push_back(tmp);
}
while (NEG.size() >= 2) {
ll tmp = NEG.back();
NEG.pop_back();
tmp *= NEG.back();
NEG.pop_back();
work.push_back(tmp);
}
sort(work.rbegin(), work.rend());
for (ll i = 0; i < K / 2; i++) {
ans *= work[i];
}
}
printf("%lld\n", (ans.value + MOD) % MOD);
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << ": " << (x) << endl
#define INF (int)1e9
#define EPS (double)1e-9
#define MOD ((int)1e9 + 7)
using namespace std;
typedef long long llong;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef pair<int, int> pii;
template <class Type> void line(const Type &a) {
int cnt = 0;
for (const auto &elem : a) {
if (cnt++)
cerr << ' ';
cout << elem;
}
cerr << endl;
}
// 解説参考. 解法2.
int main() {
int n, k;
cin >> n >> k;
vector<llong> a, b;
REP(i, n) {
llong in;
cin >> in;
if (in < 0)
a.push_back(in);
else
b.push_back(in);
}
sort(ALL(a));
sort(ALL(b), greater<llong>());
if (a.size() == n and k % 2 == 1) {
llong anss = 1;
for (int i = a.size() - 1; i >= a.size() - k; --i)
anss = anss * (MOD + a[i]) % MOD;
cout << anss << endl;
return 0;
}
llong ans = 1;
int pa = 0, pb = 0;
while (k > 0) {
if (k <= 1) {
ans = ans * b[pb++] % MOD;
k--;
} else {
if (a.size() - pa >= 2 and
(b.size() - pb <= 1 or
(b.size() - pb >= 2 and a[pa] * a[pa + 1] >= b[pb] * b[pb + 1]))) {
REP(i, 2) ans = ans * (MOD + a[pa++]) % MOD;
k -= 2;
} else {
ans = ans * b[pb++] % MOD;
k--;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << ": " << (x) << endl
#define INF (int)1e9
#define EPS (double)1e-9
#define MOD ((int)1e9 + 7)
using namespace std;
typedef long long llong;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef pair<int, int> pii;
template <class Type> void line(const Type &a) {
int cnt = 0;
for (const auto &elem : a) {
if (cnt++)
cerr << ' ';
cout << elem;
}
cerr << endl;
}
// 解説参考. 解法2.
int main() {
int n, k;
cin >> n >> k;
vector<llong> a, b;
REP(i, n) {
llong in;
cin >> in;
if (in < 0)
a.push_back(in);
else
b.push_back(in);
}
sort(ALL(a));
sort(ALL(b), greater<llong>());
if (k == n) {
llong anss = 1;
REP(i, a.size()) anss = anss * (MOD + a[i]) % MOD;
REP(i, b.size()) anss = anss * b[i] % MOD;
cout << anss << endl;
return 0;
}
if (a.size() == n and k % 2 == 1) {
llong anss = 1;
for (int i = a.size() - 1; i >= a.size() - k; --i)
anss = anss * (MOD + a[i]) % MOD;
cout << anss << endl;
return 0;
}
llong ans = 1;
int pa = 0, pb = 0;
while (k > 0) {
if (k <= 1) {
ans = ans * b[pb++] % MOD;
k--;
} else {
if (a.size() - pa >= 2 and
(b.size() - pb <= 1 or
(b.size() - pb >= 2 and a[pa] * a[pa + 1] >= b[pb] * b[pb + 1]))) {
REP(i, 2) ans = ans * (MOD + a[pa++]) % MOD;
k -= 2;
} else {
ans = ans * b[pb++] % MOD;
k--;
}
}
}
cout << ans << endl;
} | insert | 40 | 40 | 40 | 48 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using lint = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;
template <typename T1, typename T2> inline void chmin(T1 &a, const T2 &b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, const T2 &b) {
if (a < b)
a = b;
}
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
/* do your best */
const long long MAXN = 1001024;
// a, b の最大公約数を返す O( log max(a, b) )
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// ax + by = 1 となるような (x, y) と gcd(a, b) を返す. gcd(a, b) = 1
// の時、解が存在する.
long long extgcd(long long a, long long b, long long &x, long long &y) {
long long d = a;
if (b != 0) {
d = extgcd(b, a, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
// 区間 [a, b) に存在する素数の個数を返す関数
long long prime[MAXN]; // [a,b) の素数のうち i 番目の素数
bool is_prime[MAXN]; // 整数 i が素数であるかどうか
bool is_prime_ab[MAXN]; // 整数 i+a が素数であるかどうか
long long sieve(long long n) {
long long res = 0;
fill(is_prime, is_prime + MAXN, true);
is_prime[0] = is_prime[1] = false; // 0 と 1 は素数ではない。
for (long long i = 2; i <= n; ++i) {
if (!is_prime[i])
continue;
prime[res++] = i;
for (long long j = 2 * i; j <= n; j += i)
is_prime[j] = false; // 素数 i の倍数は素数ではない (ふるい(篩)にかける)
}
return res;
}
/*
long long segment_sieve(long long a, long long b){
fill(is_prime, is_prime + MAXN, true);
fill(is_prime_ab, is_prime_ab + MAXN, true);
for(long long i = 2; i * i <= b - 1; i++) {
if(!is_prime[i]) continue;
for(long long j = 2 * i; j * j <= b - 1; j += i) is_prime[j] = false; //
素数 i で篩にかける for(long long j = a - a % i; j < b; j += i) { if(j < a)
continue; if(is_prime_ab[j-a]) is_prime_ab[j-a] = false; // 素数 i で篩にかける
}
}
long long res = 0;
for(long long i = a; i < b; i++) if(is_prime_ab[i - a]) prime[res++] = i;
return res;
}
*/
// ある整数の約数列挙
vector<long long> divisors(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
res.push_back(i);
if (n / i == i)
continue; // 上の行で追加済み。
res.push_back(n / i);
}
sort(res.begin(), res.end());
return res;
}
// 素因数分解
map<long long, long long> prime_factors(long long n) {
map<long long, long long> res;
if (n == 1) { // n=1 の素因数分解は n^1
res[n] = 1;
return res;
}
for (long long i = 2, _n = n; i * i <= _n; ++i) {
while (n % i == 0) {
++res[i]; // 素数i^{res[i]}
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
// 繰り返し 2 乗法
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
// 逆元を求める. a と m は互いに素であることが要請される.
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
long long fac[MAXN], finv[MAXN], inv[MAXN];
// 前処理 O(n)
void math_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (long long i = 2; i < MAXN; 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;
}
}
// 二項係数計算 O(1)
long long COM(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] % MOD) % MOD;
}
// before your coding, you have to write a line "math_init()"
int main() {
math_init();
lint n, k;
cin >> n >> k;
vector<pair<lint, lint>> a;
vector<lint> se;
vector<lint> hu;
bool posi = true;
bool nega = true;
int cnt0 = 0;
for (int i = 0; i < n; i++) {
lint v;
cin >> v;
if (v == 0) {
cnt0++;
continue;
}
a.emplace_back((lint)abs(v), v);
if (v < 0) {
posi = false;
hu.push_back(v);
}
if (v > 0) {
nega = false;
se.push_back(v);
}
}
if (posi) {
if (a.size() < k) {
cout << 0 << endl;
} else {
lint ans = 1;
sort(RALL(a));
for (int i = 0; i < k; i++) {
ans *= a[i].second;
ans %= MOD;
}
cout << ans << endl;
}
return 0;
}
if (nega) {
if (k % 2 == 0) {
lint ans = 1;
sort(RALL(a));
for (int i = 0; i < k; i++) {
ans *= (a[i].second + MOD) % MOD;
ans %= MOD;
}
cout << ans << endl;
} else {
if (cnt0 > 0) {
cout << 0 << endl;
} else {
sort(ALL(a));
lint ans = 1;
for (int i = 0; i < k; i++) {
ans *= (a[i].second + MOD) % MOD;
ans %= MOD;
}
cout << ans << endl;
}
}
return 0;
}
sort(RALL(se));
sort(ALL(hu));
if (a.size() < k) {
cout << 0 << endl;
return 0;
}
lint cn = 0;
lint cp = 0;
sort(RALL(a));
for (int i = 0; i < k; i++) {
if (a[i].second > 0) {
cp++;
} else {
cn++;
}
}
lint ans = 1;
for (int i = 0; i < k; i++) {
ans *= a[i].first;
ans %= MOD;
}
if (cn % 2 == 0) {
cout << ans << endl;
return 0;
} else {
// 正を増やせるか
bool flag1 = (cp != se.size()) and (cn != 0);
// 負を増やせるか
bool flag2 = (cn != hu.size()) and (cp != 0);
// どっちも増やせない
if (!flag1 and !flag2) {
ans = (-ans + MOD) % MOD;
cout << ans << endl;
return 0;
}
// 正が増やせない
if (!flag1) {
ans *= -hu[cn];
ans %= MOD;
ans *= modinv(se[cp - 1], MOD);
// ans *= inv[se[cp - 1]];
ans %= MOD;
cout << ans << endl;
return 0;
}
// 負が増やせない
if (!flag2) {
ans *= se[cp];
ans %= MOD;
ans *= modinv(-hu[cn - 1], MOD);
// ans *= inv[-hu[cn - 1]];
ans %= MOD;
cout << ans << endl;
return 0;
}
// どっちも増やせる
assert(false);
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using lint = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;
template <typename T1, typename T2> inline void chmin(T1 &a, const T2 &b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, const T2 &b) {
if (a < b)
a = b;
}
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
/* do your best */
const long long MAXN = 1001024;
// a, b の最大公約数を返す O( log max(a, b) )
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// ax + by = 1 となるような (x, y) と gcd(a, b) を返す. gcd(a, b) = 1
// の時、解が存在する.
long long extgcd(long long a, long long b, long long &x, long long &y) {
long long d = a;
if (b != 0) {
d = extgcd(b, a, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
// 区間 [a, b) に存在する素数の個数を返す関数
long long prime[MAXN]; // [a,b) の素数のうち i 番目の素数
bool is_prime[MAXN]; // 整数 i が素数であるかどうか
bool is_prime_ab[MAXN]; // 整数 i+a が素数であるかどうか
long long sieve(long long n) {
long long res = 0;
fill(is_prime, is_prime + MAXN, true);
is_prime[0] = is_prime[1] = false; // 0 と 1 は素数ではない。
for (long long i = 2; i <= n; ++i) {
if (!is_prime[i])
continue;
prime[res++] = i;
for (long long j = 2 * i; j <= n; j += i)
is_prime[j] = false; // 素数 i の倍数は素数ではない (ふるい(篩)にかける)
}
return res;
}
/*
long long segment_sieve(long long a, long long b){
fill(is_prime, is_prime + MAXN, true);
fill(is_prime_ab, is_prime_ab + MAXN, true);
for(long long i = 2; i * i <= b - 1; i++) {
if(!is_prime[i]) continue;
for(long long j = 2 * i; j * j <= b - 1; j += i) is_prime[j] = false; //
素数 i で篩にかける for(long long j = a - a % i; j < b; j += i) { if(j < a)
continue; if(is_prime_ab[j-a]) is_prime_ab[j-a] = false; // 素数 i で篩にかける
}
}
long long res = 0;
for(long long i = a; i < b; i++) if(is_prime_ab[i - a]) prime[res++] = i;
return res;
}
*/
// ある整数の約数列挙
vector<long long> divisors(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
res.push_back(i);
if (n / i == i)
continue; // 上の行で追加済み。
res.push_back(n / i);
}
sort(res.begin(), res.end());
return res;
}
// 素因数分解
map<long long, long long> prime_factors(long long n) {
map<long long, long long> res;
if (n == 1) { // n=1 の素因数分解は n^1
res[n] = 1;
return res;
}
for (long long i = 2, _n = n; i * i <= _n; ++i) {
while (n % i == 0) {
++res[i]; // 素数i^{res[i]}
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
// 繰り返し 2 乗法
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
// 逆元を求める. a と m は互いに素であることが要請される.
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
long long fac[MAXN], finv[MAXN], inv[MAXN];
// 前処理 O(n)
void math_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (long long i = 2; i < MAXN; 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;
}
}
// 二項係数計算 O(1)
long long COM(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] % MOD) % MOD;
}
// before your coding, you have to write a line "math_init()"
int main() {
math_init();
lint n, k;
cin >> n >> k;
vector<pair<lint, lint>> a;
vector<lint> se;
vector<lint> hu;
bool posi = true;
bool nega = true;
int cnt0 = 0;
for (int i = 0; i < n; i++) {
lint v;
cin >> v;
if (v == 0) {
cnt0++;
continue;
}
a.emplace_back((lint)abs(v), v);
if (v < 0) {
posi = false;
hu.push_back(v);
}
if (v > 0) {
nega = false;
se.push_back(v);
}
}
if (posi) {
if (a.size() < k) {
cout << 0 << endl;
} else {
lint ans = 1;
sort(RALL(a));
for (int i = 0; i < k; i++) {
ans *= a[i].second;
ans %= MOD;
}
cout << ans << endl;
}
return 0;
}
if (nega) {
if (k % 2 == 0) {
lint ans = 1;
sort(RALL(a));
for (int i = 0; i < k; i++) {
ans *= (a[i].second + MOD) % MOD;
ans %= MOD;
}
cout << ans << endl;
} else {
if (cnt0 > 0) {
cout << 0 << endl;
} else {
sort(ALL(a));
lint ans = 1;
for (int i = 0; i < k; i++) {
ans *= (a[i].second + MOD) % MOD;
ans %= MOD;
}
cout << ans << endl;
}
}
return 0;
}
sort(RALL(se));
sort(ALL(hu));
if (a.size() < k) {
cout << 0 << endl;
return 0;
}
lint cn = 0;
lint cp = 0;
sort(RALL(a));
for (int i = 0; i < k; i++) {
if (a[i].second > 0) {
cp++;
} else {
cn++;
}
}
lint ans = 1;
for (int i = 0; i < k; i++) {
ans *= a[i].first;
ans %= MOD;
}
if (cn % 2 == 0) {
cout << ans << endl;
return 0;
} else {
// 正を増やせるか
bool flag1 = (cp != se.size()) and (cn != 0);
// 負を増やせるか
bool flag2 = (cn != hu.size()) and (cp != 0);
// どっちも増やせない
if (!flag1 and !flag2) {
ans = (-ans + MOD) % MOD;
cout << ans << endl;
return 0;
}
// 正が増やせない
if (!flag1) {
ans *= -hu[cn];
ans %= MOD;
ans *= modinv(se[cp - 1], MOD);
// ans *= inv[se[cp - 1]];
ans %= MOD;
cout << ans << endl;
return 0;
}
// 負が増やせない
if (!flag2) {
ans *= se[cp];
ans %= MOD;
ans *= modinv(-hu[cn - 1], MOD);
// ans *= inv[-hu[cn - 1]];
ans %= MOD;
cout << ans << endl;
return 0;
}
// どっちも増やせる
if (se[cp] * se[cp - 1] >= hu[cn] * hu[cn - 1]) {
ans *= se[cp];
ans %= MOD;
ans *= modinv(-hu[cn - 1], MOD);
// ans *= inv[-hu[cn - 1]];
ans %= MOD;
cout << ans << endl;
return 0;
} else {
ans *= -hu[cn];
ans %= MOD;
ans *= modinv(se[cp - 1], MOD);
// ans *= inv[se[cp - 1]];
ans %= MOD;
cout << ans << endl;
return 0;
}
}
return 0;
}
| replace | 330 | 332 | 330 | 347 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
ll ans = 1;
vector<ll> minus, plus;
rep(i, n) {
cin >> a[i];
if (a[i] < 0) {
minus.push_back(a[i]);
}
if (a[i] > 0) {
plus.push_back(a[i]);
}
}
sort(minus.begin(), minus.end());
sort(plus.begin(), plus.end(), greater<ll>());
ll zero = n - minus.size() - plus.size();
if (k > minus.size() + plus.size()) {
cout << 0 << endl;
return 0;
}
if (plus.size() == 0 && k % 2 == 1) {
if (zero > 0) {
cout << 0 << endl;
return 0;
}
rep(i, k) {
ll index = minus.size() - i - 1;
ans *= -minus[index];
ans %= mod;
}
ans = -ans + mod * 2;
ans %= mod;
cout << ans << endl;
return 0;
}
ll minus_index = 0, plus_index = 0;
ll minus_remain = minus.size(), plus_remain = plus.size();
if (k % 2 == 1) {
ans *= plus[plus_index];
ans %= mod;
plus_index++;
plus_remain--;
k--;
}
while (k > 0) {
if (minus_remain == 1 && plus_remain == 1) {
return 1;
}
if (minus_remain < 2) {
ans *= plus[plus_index];
ans %= mod;
ans *= plus[plus_index + 1];
ans %= mod;
plus_index += 2;
plus_remain -= 2;
k -= 2;
continue;
}
if (plus_remain < 2) {
ans *= -minus[minus_index];
ans %= mod;
ans *= -minus[minus_index + 1];
ans %= mod;
minus_index += 2;
minus_remain -= 2;
k -= 2;
continue;
}
if (plus[plus_index] * plus[plus_index + 1] >
minus[minus_index] * minus[minus_index + 1]) {
ans *= plus[plus_index];
ans %= mod;
ans *= plus[plus_index + 1];
ans %= mod;
plus_index += 2;
plus_remain -= 2;
k -= 2;
} else {
ans *= -minus[minus_index];
ans %= mod;
ans *= -minus[minus_index + 1];
ans %= mod;
minus_index += 2;
minus_remain -= 2;
k -= 2;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
ll ans = 1;
vector<ll> minus, plus;
rep(i, n) {
cin >> a[i];
if (a[i] < 0) {
minus.push_back(a[i]);
}
if (a[i] > 0) {
plus.push_back(a[i]);
}
}
sort(minus.begin(), minus.end());
sort(plus.begin(), plus.end(), greater<ll>());
ll zero = n - minus.size() - plus.size();
if (k > minus.size() + plus.size()) {
cout << 0 << endl;
return 0;
}
if (plus.size() == 0 && k % 2 == 1) {
if (zero > 0) {
cout << 0 << endl;
return 0;
}
rep(i, k) {
ll index = minus.size() - i - 1;
ans *= -minus[index];
ans %= mod;
}
ans = -ans + mod * 2;
ans %= mod;
cout << ans << endl;
return 0;
}
ll minus_index = 0, plus_index = 0;
ll minus_remain = minus.size(), plus_remain = plus.size();
if (k % 2 == 1) {
ans *= plus[plus_index];
ans %= mod;
plus_index++;
plus_remain--;
k--;
}
while (k > 0) {
if (minus_remain == 1 && plus_remain == 1) {
ans *= plus[plus_index];
ans %= mod;
ans *= minus[minus_index];
while (ans < 0) {
ans += mod;
}
ans %= mod;
break;
}
if (minus_remain < 2) {
ans *= plus[plus_index];
ans %= mod;
ans *= plus[plus_index + 1];
ans %= mod;
plus_index += 2;
plus_remain -= 2;
k -= 2;
continue;
}
if (plus_remain < 2) {
ans *= -minus[minus_index];
ans %= mod;
ans *= -minus[minus_index + 1];
ans %= mod;
minus_index += 2;
minus_remain -= 2;
k -= 2;
continue;
}
if (plus[plus_index] * plus[plus_index + 1] >
minus[minus_index] * minus[minus_index + 1]) {
ans *= plus[plus_index];
ans %= mod;
ans *= plus[plus_index + 1];
ans %= mod;
plus_index += 2;
plus_remain -= 2;
k -= 2;
} else {
ans *= -minus[minus_index];
ans %= mod;
ans *= -minus[minus_index + 1];
ans %= mod;
minus_index += 2;
minus_remain -= 2;
k -= 2;
}
}
cout << ans << endl;
return 0;
}
| replace | 65 | 66 | 65 | 73 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 101010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
// BELOW
// BELOW
struct mint {
int x; // typedef long long int;
mint(int x = 0) : x((x % MOD + MOD) % MOD) {}
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(int 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;
}
};
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
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 % 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;
}
int PERM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[n - k] % MOD) % MOD;
}
int MCOM(int n, int k) {
// n個のものから重複を許してr個選ぶ。
// Choose R from N types of things, allowing for duplication.
return COM(n + k - 1, k);
}
// solve
//-----CODE------//
// https://atcoder.jp/contests/agc036/submissions/6479142
void solve(void) {
int n, k;
cin >> n >> k;
vector<pair<int, int>> vp;
int ma = -1 * INF;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vp.emplace_back(abs(x), x);
chmax(ma, x);
}
sort(ALL(vp));
reverse(ALL(vp));
int cnt_minus = 0;
int cnt_zero = 0;
mint res = 1;
if (k == 1) {
if (ma < 0)
ma = MOD + ma;
cout << ma << endl;
return;
}
if (ma < 0 and k % 2 == 1) {
reverse(ALL(vp));
for (int i = 0; i < k; i++) {
res *= vp[i].first;
}
cout << MOD - res.x << endl;
return;
}
if (k % 2 == 1 and ma == 0 || vp[k - 1].first == 0) {
cout << 0 << endl;
return;
}
for (int i = 0; i < k; i++) {
res *= vp[i].first;
if (vp[i].second < 0)
cnt_minus += 1;
else if (vp[i].second == 0)
cnt_zero += 1;
}
if (n == k || cnt_minus % 2 == 0) {
cout << res.x << endl;
return;
}
abort();
// abort();
int f1 = 0, f2 = 0;
for (int i = k; i < n; i++) {
if (vp[i].second > 0) {
f1 = vp[i].first;
break;
}
}
for (int i = k; i < n; i++) {
if (vp[i].second < 0) {
f2 = vp[i].first;
break;
}
}
int g1 = 0, g2 = 0;
for (int i = k - 1; i >= 0; i--) {
if (vp[i].second < 0) {
g1 = vp[i].first;
break;
}
}
for (int i = k - 1; i >= 0; i--) {
if (vp[i].second > 0) {
g2 = vp[i].first;
break;
}
}
if (abs(f1 * g2) > abs(f2 * g1) || g2 == 0) {
res *= f1;
res /= g1;
cout << res.x << endl;
} else {
res *= f2;
res /= g2;
cout << res.x << endl;
}
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 101010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
// BELOW
// BELOW
struct mint {
int x; // typedef long long int;
mint(int x = 0) : x((x % MOD + MOD) % MOD) {}
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(int 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;
}
};
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
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 % 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;
}
int PERM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[n - k] % MOD) % MOD;
}
int MCOM(int n, int k) {
// n個のものから重複を許してr個選ぶ。
// Choose R from N types of things, allowing for duplication.
return COM(n + k - 1, k);
}
// solve
//-----CODE------//
// https://atcoder.jp/contests/agc036/submissions/6479142
void solve(void) {
int n, k;
cin >> n >> k;
vector<pair<int, int>> vp;
int ma = -1 * INF;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vp.emplace_back(abs(x), x);
chmax(ma, x);
}
sort(ALL(vp));
reverse(ALL(vp));
int cnt_minus = 0;
int cnt_zero = 0;
mint res = 1;
if (k == 1) {
if (ma < 0)
ma = MOD + ma;
cout << ma << endl;
return;
}
if (ma < 0 and k % 2 == 1) {
reverse(ALL(vp));
for (int i = 0; i < k; i++) {
res *= vp[i].first;
}
cout << MOD - res.x << endl;
return;
}
if (k % 2 == 1 and ma == 0 || vp[k - 1].first == 0) {
cout << 0 << endl;
return;
}
for (int i = 0; i < k; i++) {
res *= vp[i].first;
if (vp[i].second < 0)
cnt_minus += 1;
else if (vp[i].second == 0)
cnt_zero += 1;
}
if (n == k || cnt_minus % 2 == 0) {
if (cnt_minus % 2 == 0)
cout << res.x << endl;
else {
cout << MOD - res.x << endl;
}
return;
}
// abort();
// abort();
int f1 = 0, f2 = 0;
for (int i = k; i < n; i++) {
if (vp[i].second > 0) {
f1 = vp[i].first;
break;
}
}
for (int i = k; i < n; i++) {
if (vp[i].second < 0) {
f2 = vp[i].first;
break;
}
}
int g1 = 0, g2 = 0;
for (int i = k - 1; i >= 0; i--) {
if (vp[i].second < 0) {
g1 = vp[i].first;
break;
}
}
for (int i = k - 1; i >= 0; i--) {
if (vp[i].second > 0) {
g2 = vp[i].first;
break;
}
}
if (abs(f1 * g2) > abs(f2 * g1) || g2 == 0) {
res *= f1;
res /= g1;
cout << res.x << endl;
} else {
res *= f2;
res /= g2;
cout << res.x << endl;
}
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| replace | 192 | 196 | 192 | 201 | 0 | |
p02616 | C++ | Runtime Error | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
// #include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
// #include "Ants.h"
using namespace std;
typedef long long ll;
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < n; i++)
#define show(s) cout << s << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define LINF (1LL << 50)
#define MOD (1e9 + 7)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { // 最大公約数を求める///最大公倍数a*b/gcd(a,b)
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcd(ll a, ll b) { // 最小公倍数を求める b=0のときaを返す
if (b == 0)
return a;
return (a / gcd(a, b)) * b;
}
vector<int> divnum(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p;
}
int digiter(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p.size();
}
vector<int> convertstring(string s) {
vector<int> d;
ll n = s.size();
rep(i, n) { d.push_back(s[i] - '0'); }
return d;
}
map<ll, int> prime_factor(ll n) {
map<ll, int> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
vector<ll> Enumeration(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
return res;
}
ll myPow(ll x, ll n, ll m) { // x^n
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
std::vector<int> Eratosthenes(const int N) // 素数列挙
{
std::vector<bool> is_prime(N + 1);
for (int i = 0; i <= N; i++) {
is_prime[i] = true;
}
std::vector<int> P;
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
const ll mod = MOD;
struct mint {
ll x; // typedef long long ll;
mint(ll 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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= 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 { return mint(*this) /= a; }
// operator long long() const { return x; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination { // comb(a,b)でよぶaCb
vector<mint> fact, ifact;
combination(ll n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (ll i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (ll i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(ll n, ll k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(1000005); // comb貯め
mint f(ll n, ll k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
struct SegmentTree {
private:
int n;
vector<int> node;
public:
SegmentTree(vector<int> v) { // SegmentTree seg(vector<int>(N,INF))で呼び出し
int sz = v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1, INF);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
void update(int x, int val) {
x += (n - 1);
node[x] = val;
while (x > 0) {
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
int getmin(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return INF;
if (a <= l && r <= b)
return node[k];
int vl = getmin(a, b, 2 * k + 1, l, (l + r) / 2);
int vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
// 1-indexedなので注意。
struct BIT {
private:
vector<int> bit;
int N;
public:
BIT(int size) {
N = size;
bit.resize(N + 1);
}
// 一点更新です
void add(int a, int w) { // a番目をwに更新
for (int x = a; x <= N; x += x & -x)
bit[x] += w;
}
// 1~Nまでの和を求める。
int sum(int a) {
int ret = 0;
for (int x = a; x > 0; x -= x & -x)
ret += bit[x];
return ret;
}
};
/****Union-Ford-Tree***/
/*int par[int(0x7ffffff)];//Parent
int Rank[int(0x7ffffff)];//Deep_of_the_Tree
//int a[100] = { 4,2,3,1,5 }, m[100] ={3,2,2};
//int n = 0;
//const ll mod = 1000000007;
//n要素で初期化
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
//木の根探し
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
//xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)return;
if (Rank[x] < Rank[y]) {
par[x] = y;
}
else {
par[y] = x;
if (Rank[x] == Rank[y])Rank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}*/
// queue古い順,stack新しい順
/************************************************************************************/
int N, K;
ll A[200005];
vector<ll> p, n;
int32_t main() {
cin >> N >> K;
rep(i, N) {
cin >> A[i];
if (A[i] >= 0)
p.push_back(A[i]);
else {
n.push_back(A[i]);
}
}
sort(A, A + N);
int minus = lower_bound(A, A + N, 0) - A;
int plus = N - minus;
int k = min(minus / 2, K / 2);
// cout << k << endl;
// cout << K - k * 2 << endl;
if (K == 1) {
cout << A[N - 1] << endl;
return 0;
}
bool ok = false;
if (p.size() > 0) {
if (N == K)
ok = (n.size() % 2 == 0);
else
ok = true;
} else {
ok = (K % 2 == 0);
}
if (ok) { // result minus;
// cout << "work" << endl;
mint ans = 1;
priority_queue<P, vector<P>, greater<P>> que;
rep(i, N) que.push(P(abs(A[i]), A[i] + mod));
rep(i, K) {
P p = que.top();
que.pop();
ans *= p.second;
}
// ans += mod;
cout << ans << endl;
} else {
// cout << "plus" << endl;
mint ans = 1;
vector<ll> B;
sort(p.begin(), p.end());
sort(n.begin(), n.end());
if (K % 2 != 0) {
ans *= p.back();
p.pop_back();
}
reverse(p.begin(), p.end());
rep(i, p.size() / 2) B.push_back(p[i * 2] * p[i * 2 + 1]);
rep(i, n.size() / 2) B.push_back(n[i * 2] * n[i * 2 + 1]);
sort(B.rbegin(), B.rend());
rep(i, K / 2) { ans *= B[i]; }
ans += mod;
cout << ans << endl;
}
} | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
// #include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
// #include "Ants.h"
using namespace std;
typedef long long ll;
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < n; i++)
#define show(s) cout << s << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define LINF (1LL << 50)
#define MOD (1e9 + 7)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { // 最大公約数を求める///最大公倍数a*b/gcd(a,b)
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcd(ll a, ll b) { // 最小公倍数を求める b=0のときaを返す
if (b == 0)
return a;
return (a / gcd(a, b)) * b;
}
vector<int> divnum(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p;
}
int digiter(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p.size();
}
vector<int> convertstring(string s) {
vector<int> d;
ll n = s.size();
rep(i, n) { d.push_back(s[i] - '0'); }
return d;
}
map<ll, int> prime_factor(ll n) {
map<ll, int> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
vector<ll> Enumeration(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
return res;
}
ll myPow(ll x, ll n, ll m) { // x^n
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
std::vector<int> Eratosthenes(const int N) // 素数列挙
{
std::vector<bool> is_prime(N + 1);
for (int i = 0; i <= N; i++) {
is_prime[i] = true;
}
std::vector<int> P;
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
const ll mod = MOD;
struct mint {
ll x; // typedef long long ll;
mint(ll 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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= 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 { return mint(*this) /= a; }
// operator long long() const { return x; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination { // comb(a,b)でよぶaCb
vector<mint> fact, ifact;
combination(ll n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (ll i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (ll i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(ll n, ll k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(1000005); // comb貯め
mint f(ll n, ll k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
struct SegmentTree {
private:
int n;
vector<int> node;
public:
SegmentTree(vector<int> v) { // SegmentTree seg(vector<int>(N,INF))で呼び出し
int sz = v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1, INF);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
void update(int x, int val) {
x += (n - 1);
node[x] = val;
while (x > 0) {
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
int getmin(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return INF;
if (a <= l && r <= b)
return node[k];
int vl = getmin(a, b, 2 * k + 1, l, (l + r) / 2);
int vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
// 1-indexedなので注意。
struct BIT {
private:
vector<int> bit;
int N;
public:
BIT(int size) {
N = size;
bit.resize(N + 1);
}
// 一点更新です
void add(int a, int w) { // a番目をwに更新
for (int x = a; x <= N; x += x & -x)
bit[x] += w;
}
// 1~Nまでの和を求める。
int sum(int a) {
int ret = 0;
for (int x = a; x > 0; x -= x & -x)
ret += bit[x];
return ret;
}
};
/****Union-Ford-Tree***/
/*int par[int(0x7ffffff)];//Parent
int Rank[int(0x7ffffff)];//Deep_of_the_Tree
//int a[100] = { 4,2,3,1,5 }, m[100] ={3,2,2};
//int n = 0;
//const ll mod = 1000000007;
//n要素で初期化
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
//木の根探し
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
//xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)return;
if (Rank[x] < Rank[y]) {
par[x] = y;
}
else {
par[y] = x;
if (Rank[x] == Rank[y])Rank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}*/
// queue古い順,stack新しい順
/************************************************************************************/
int N, K;
ll A[200005];
vector<ll> p, n;
int32_t main() {
cin >> N >> K;
rep(i, N) {
cin >> A[i];
if (A[i] >= 0)
p.push_back(A[i]);
else {
n.push_back(A[i]);
}
}
sort(A, A + N);
int minus = lower_bound(A, A + N, 0) - A;
int plus = N - minus;
int k = min(minus / 2, K / 2);
// cout << k << endl;
// cout << K - k * 2 << endl;
if (K == 1) {
cout << A[N - 1] << endl;
return 0;
}
bool ok = false;
if (p.size() > 0) {
if (N == K)
ok = (n.size() % 2 == 0);
else
ok = true;
} else {
ok = (K % 2 == 0);
}
if (!ok) { // result minus;
// cout << "work" << endl;
mint ans = 1;
priority_queue<P, vector<P>, greater<P>> que;
rep(i, N) que.push(P(abs(A[i]), A[i] + mod));
rep(i, K) {
P p = que.top();
que.pop();
ans *= p.second;
}
// ans += mod;
cout << ans << endl;
} else {
// cout << "plus" << endl;
mint ans = 1;
vector<ll> B;
sort(p.begin(), p.end());
sort(n.begin(), n.end());
if (K % 2 != 0) {
ans *= p.back();
p.pop_back();
}
reverse(p.begin(), p.end());
rep(i, p.size() / 2) B.push_back(p[i * 2] * p[i * 2 + 1]);
rep(i, n.size() / 2) B.push_back(n[i * 2] * n[i * 2 + 1]);
sort(B.rbegin(), B.rend());
rep(i, K / 2) { ans *= B[i]; }
ans += mod;
cout << ans << endl;
}
}
| replace | 358 | 359 | 358 | 359 | 0 | |
p02616 | C++ | Runtime Error | // Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
#define all(x) x.begin(), x.end()
template <class T> void dmp(T a) {
rep(i, a.size()) cout << a[i] << " ";
cout << endl;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> void g(T &a) { cin >> a; }
template <class T> void o(const T &a, bool space = false) {
cout << a << (space ? ' ' : '\n');
}
// ios::sync_with_stdio(false);
const ll mod = 1000000007; // 998244353
template <class T> void add(T &a, T b) {
a += b;
if (a >= mod)
a -= mod;
}
struct UF {
int par[2000005], ran[2000005];
void init() {
for (int i = 0; i < 2000005; i++)
par[i] = i, ran[i] = 0;
}
int find(int x) {
if (x == par[x])
return x;
else
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (ran[x] < ran[y])
par[x] = y;
else {
par[y] = x;
if (ran[x] == ran[y])
ran[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
} uf;
ll modpow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll F[2000005], R[2000005];
void make() {
F[0] = 1;
for (int i = 1; i < 2000005; i++)
F[i] = F[i - 1] * i % mod;
R[2000004] = modpow(F[2000004], mod - 2);
for (int i = 2000003; i >= 0; i--)
R[i] = R[i + 1] * (i + 1) % mod;
}
ll C(int a, int b) { return F[a] * R[b] % mod * R[a - b] % mod; }
ll n, k;
vector<ll> pos, neg;
int cnt;
ll a[200005];
void solve() {
cin >> n >> k;
rep(i, n) {
cin >> a[i];
if (a[i] == 0)
cnt++;
else if (a[i] > 0)
pos.pb(a[i]);
else
neg.pb(-a[i]);
}
SORT(pos);
SORT(neg);
// 正に出来る？
bool ok = 0;
for (int i = 0; i <= neg.size(); i += 2) {
int x = k - i;
if (x >= 0 && x <= pos.size()) {
ok = 1;
}
}
if (!ok) {
if (cnt) {
cout << 0 << endl;
} else {
ll ans = 1;
assert(n == k);
rep(i, n) ans = ans * a[i] % mod;
cout << (ans % mod + mod) % mod << endl;
}
return;
} else {
vector<int> ok;
for (int i = 0; i <= neg.size(); i += 2) {
int x = k - i;
if (x >= 0 && x <= pos.size()) {
ok.pb(i);
}
}
ll ans = 1;
rep(i, ok[0]) ans = ans * neg[neg.size() - 1 - i] % mod;
rep(i, k - ok[0]) ans = ans * pos[pos.size() - 1 - i] % mod;
for (int i = 1; i < ok.size(); i++) {
ll up = neg[neg.size() - 1 - (ok[i - 1])] *
neg[neg.size() - 1 - (ok[i - 1] + 1)];
ll dw = pos[pos.size() - 1 - (k - ok[i - 1] - 1)] *
pos[pos.size() - 1 - (k - ok[i - 1] - 2)];
if (up >= dw) {
up %= mod;
dw %= mod;
ans = ans * up % mod * modpow(dw, mod - 2) % mod;
} else {
break;
}
}
cout << ans << endl;
}
}
int main() {
uf.init();
make();
solve();
} | // Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
#define all(x) x.begin(), x.end()
template <class T> void dmp(T a) {
rep(i, a.size()) cout << a[i] << " ";
cout << endl;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> void g(T &a) { cin >> a; }
template <class T> void o(const T &a, bool space = false) {
cout << a << (space ? ' ' : '\n');
}
// ios::sync_with_stdio(false);
const ll mod = 1000000007; // 998244353
template <class T> void add(T &a, T b) {
a += b;
if (a >= mod)
a -= mod;
}
struct UF {
int par[2000005], ran[2000005];
void init() {
for (int i = 0; i < 2000005; i++)
par[i] = i, ran[i] = 0;
}
int find(int x) {
if (x == par[x])
return x;
else
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (ran[x] < ran[y])
par[x] = y;
else {
par[y] = x;
if (ran[x] == ran[y])
ran[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
} uf;
ll modpow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll F[2000005], R[2000005];
void make() {
F[0] = 1;
for (int i = 1; i < 2000005; i++)
F[i] = F[i - 1] * i % mod;
R[2000004] = modpow(F[2000004], mod - 2);
for (int i = 2000003; i >= 0; i--)
R[i] = R[i + 1] * (i + 1) % mod;
}
ll C(int a, int b) { return F[a] * R[b] % mod * R[a - b] % mod; }
ll n, k;
vector<ll> pos, neg;
int cnt;
ll a[200005];
void solve() {
cin >> n >> k;
rep(i, n) {
cin >> a[i];
if (a[i] == 0)
cnt++;
else if (a[i] > 0)
pos.pb(a[i]);
else
neg.pb(-a[i]);
}
SORT(pos);
SORT(neg);
// 正に出来る？
bool ok = 0;
for (int i = 0; i <= neg.size(); i += 2) {
int x = k - i;
if (x >= 0 && x <= pos.size()) {
ok = 1;
}
}
if (!ok) {
if (cnt) {
cout << 0 << endl;
} else {
ll ans = 1;
if (n == k) {
rep(i, n) ans = ans * a[i] % mod;
cout << (ans % mod + mod) % mod << endl;
} else {
rep(i, k) ans = ans * neg[i] % mod;
cout << (mod - ans) % mod << endl;
}
}
return;
} else {
vector<int> ok;
for (int i = 0; i <= neg.size(); i += 2) {
int x = k - i;
if (x >= 0 && x <= pos.size()) {
ok.pb(i);
}
}
ll ans = 1;
rep(i, ok[0]) ans = ans * neg[neg.size() - 1 - i] % mod;
rep(i, k - ok[0]) ans = ans * pos[pos.size() - 1 - i] % mod;
for (int i = 1; i < ok.size(); i++) {
ll up = neg[neg.size() - 1 - (ok[i - 1])] *
neg[neg.size() - 1 - (ok[i - 1] + 1)];
ll dw = pos[pos.size() - 1 - (k - ok[i - 1] - 1)] *
pos[pos.size() - 1 - (k - ok[i - 1] - 2)];
if (up >= dw) {
up %= mod;
dw %= mod;
ans = ans * up % mod * modpow(dw, mod - 2) % mod;
} else {
break;
}
}
cout << ans << endl;
}
}
int main() {
uf.init();
make();
solve();
}
| replace | 132 | 135 | 132 | 139 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Max(a, b) (a > b ? a : b)
#define Min(a, b) (a < b ? a : b)
#define ii pair<int, int>
#define fi first
#define se second
const int MAX = 200000; // 2 * 10^5
const int MOD = 1000000007; // 10^9 + 7
const int OO = 0x3f3f3f3f; // 0x3f3f3f3f;
int32_t main() {
int n, k;
cin >> n >> k;
vector<int> P, N, Z;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x > 0)
P.push_back(x);
else if (x < 0)
N.push_back(x);
else
Z.push_back(x);
}
sort(P.begin(), P.end());
sort(N.rbegin(), N.rend());
vector<int> ans;
while (k > 1 and (P.size() > 1 or N.size() > 1)) {
int a = 0, b = 0;
if (P.size() > 1) {
a = P.back();
P.pop_back();
b = P.back();
P.pop_back();
}
int c = 0, d = 0;
if (N.size() > 1) {
c = N.back();
N.pop_back();
d = N.back();
N.pop_back();
}
if (c * d >= a * b) {
ans.push_back(c);
ans.push_back(d);
if (a and b) {
P.push_back(b);
P.push_back(a);
}
} else {
ans.push_back(a);
ans.push_back(b);
if (c and d) {
N.push_back(d);
N.push_back(c);
}
}
k -= 2;
}
while (k > 0 and P.size() > 0) {
ans.push_back(P.back());
P.pop_back();
k--;
}
while (k > 0 and Z.size() > 0) {
ans.push_back(N.back());
Z.pop_back();
k--;
}
if (k > 0 and N.size() > 0) {
sort(ans.begin(), ans.end());
while (!ans.empty() and ans.back() < 0) {
N.push_back(ans.back());
ans.pop_back();
k++;
}
sort(N.rbegin(), N.rend());
for (int i = 0; i < k; i++)
ans.push_back(N[i]);
}
int res = 1;
for (int &w : ans) {
res = (res * w) % MOD;
if (res < 0)
res += MOD;
}
cout << res << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Max(a, b) (a > b ? a : b)
#define Min(a, b) (a < b ? a : b)
#define ii pair<int, int>
#define fi first
#define se second
const int MAX = 200000; // 2 * 10^5
const int MOD = 1000000007; // 10^9 + 7
const int OO = 0x3f3f3f3f; // 0x3f3f3f3f;
int32_t main() {
int n, k;
cin >> n >> k;
vector<int> P, N, Z;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x > 0)
P.push_back(x);
else if (x < 0)
N.push_back(x);
else
Z.push_back(x);
}
sort(P.begin(), P.end());
sort(N.rbegin(), N.rend());
vector<int> ans;
while (k > 1 and (P.size() > 1 or N.size() > 1)) {
int a = 0, b = 0;
if (P.size() > 1) {
a = P.back();
P.pop_back();
b = P.back();
P.pop_back();
}
int c = 0, d = 0;
if (N.size() > 1) {
c = N.back();
N.pop_back();
d = N.back();
N.pop_back();
}
if (c * d >= a * b) {
ans.push_back(c);
ans.push_back(d);
if (a and b) {
P.push_back(b);
P.push_back(a);
}
} else {
ans.push_back(a);
ans.push_back(b);
if (c and d) {
N.push_back(d);
N.push_back(c);
}
}
k -= 2;
}
while (k > 0 and P.size() > 0) {
ans.push_back(P.back());
P.pop_back();
k--;
}
while (k > 0 and Z.size() > 0) {
ans.push_back(Z.back());
Z.pop_back();
k--;
}
if (k > 0 and N.size() > 0) {
sort(ans.begin(), ans.end());
while (!ans.empty() and ans.back() < 0) {
N.push_back(ans.back());
ans.pop_back();
k++;
}
sort(N.rbegin(), N.rend());
for (int i = 0; i < k; i++)
ans.push_back(N[i]);
}
int res = 1;
for (int &w : ans) {
res = (res * w) % MOD;
if (res < 0)
res += MOD;
}
cout << res << '\n';
return 0;
}
| replace | 73 | 74 | 73 | 74 | 0 | |
p02616 | C++ | Runtime Error | #ifdef MY_LOCAL
#define MY_NAMESPACE(ns) namespace ns {
#define MY_NAMESPACE_ }
#define MY_DEBUG(s) s
#else
#define MY_NAMESPACE(ns)
#define MY_NAMESPACE_
#define MY_DEBUG(s)
#endif
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define EPS (1e-7)
#define IINF ((int)1e9)
ll mod = 1000000007; // 10^9 + 7
MY_NAMESPACE(testbed)
struct mint {
ll x; // typedef long long ll;
mint(ll 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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
ll modval = 1000000007; // 10^9 + 7
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<ll> a(n);
vector<ll> pos, neg;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
neg.push_back(a[i]);
else
pos.push_back(a[i]);
}
bool neg_answer = false;
if (pos.size() == 0)
neg_answer = (k % 2 == 1);
else if (n == k)
neg_answer = (neg.size() % 2 == 1);
mint res = 1;
ll negres = 1;
ll posres = 1;
if (neg_answer) {
sort(a.begin(), a.end(),
[](ll x, ll y) -> bool { return abs(x) < abs(y); });
for (int i = 0; i < k; i++) {
res *= a[i];
negres *= a[i];
negres %= modval;
negres += modval;
negres %= modval;
}
} else {
sort(pos.begin(), pos.end()); // the biggest at last
sort(neg.rbegin(), neg.rend()); // the biggest abs(negative) at last
if (k % 2 == 1) {
res = pos.back();
pos.pop_back();
posres = pos.back();
pos.pop_back();
}
vector<ll> p;
while (pos.size() > 1) {
ll tmp = pos.back();
pos.pop_back();
tmp *= pos.back();
pos.pop_back();
p.push_back(tmp);
}
while (neg.size() > 1) {
ll tmp = neg.back();
neg.pop_back();
tmp *= neg.back();
neg.pop_back();
p.push_back(tmp);
}
sort(p.rbegin(), p.rend());
for (int i = 0; i < k / 2; i++) {
res *= p[i];
ll pval = p[i];
pval %= modval;
posres *= pval;
posres %= modval;
}
}
if (neg_answer)
cout << negres << "\n";
else
cout << posres << "\n";
// cout << res << "\n";
return 0;
}
MY_NAMESPACE_ | #ifdef MY_LOCAL
#define MY_NAMESPACE(ns) namespace ns {
#define MY_NAMESPACE_ }
#define MY_DEBUG(s) s
#else
#define MY_NAMESPACE(ns)
#define MY_NAMESPACE_
#define MY_DEBUG(s)
#endif
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define EPS (1e-7)
#define IINF ((int)1e9)
ll mod = 1000000007; // 10^9 + 7
MY_NAMESPACE(testbed)
struct mint {
ll x; // typedef long long ll;
mint(ll 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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
ll modval = 1000000007; // 10^9 + 7
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<ll> a(n);
vector<ll> pos, neg;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
neg.push_back(a[i]);
else
pos.push_back(a[i]);
}
bool neg_answer = false;
if (pos.size() == 0)
neg_answer = (k % 2 == 1);
else if (n == k)
neg_answer = (neg.size() % 2 == 1);
mint res = 1;
ll negres = 1;
ll posres = 1;
if (neg_answer) {
sort(a.begin(), a.end(),
[](ll x, ll y) -> bool { return abs(x) < abs(y); });
for (int i = 0; i < k; i++) {
res *= a[i];
negres *= a[i];
negres %= modval;
negres += modval;
negres %= modval;
}
} else {
sort(pos.begin(), pos.end()); // the biggest at last
sort(neg.rbegin(), neg.rend()); // the biggest abs(negative) at last
if (k % 2 == 1) {
res = pos.back(); // pos.pop_back();
posres = pos.back();
pos.pop_back();
}
vector<ll> p;
while (pos.size() > 1) {
ll tmp = pos.back();
pos.pop_back();
tmp *= pos.back();
pos.pop_back();
p.push_back(tmp);
}
while (neg.size() > 1) {
ll tmp = neg.back();
neg.pop_back();
tmp *= neg.back();
neg.pop_back();
p.push_back(tmp);
}
sort(p.rbegin(), p.rend());
for (int i = 0; i < k / 2; i++) {
res *= p[i];
ll pval = p[i];
pval %= modval;
posres *= pval;
posres %= modval;
}
}
if (neg_answer)
cout << negres << "\n";
else
cout << posres << "\n";
// cout << res << "\n";
return 0;
}
MY_NAMESPACE_ | replace | 113 | 115 | 113 | 114 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define deb(x) cerr << "\n" << #x << "=" << x << "\n";
#define deb2(x, y) \
cerr << "\n" << #x << "=" << x << "\n" << #y << "=" << y << "\n";
#define w(x) \
int x; \
cin >> x; \
while (x--)
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> pos, neg;
int ans = 1, z = 0;
for (int i = 0; i < n; i++) {
int foo;
cin >> foo;
if (foo <= 0)
neg.push_back(foo);
else
pos.push_back(foo);
}
sort(pos.begin(), pos.end()); // 1 2 3 4 5
sort(neg.rbegin(), neg.rend()); // -1 -2 -3 -4 -5
if (k % 2) {
if (!pos.empty()) {
if (pos.size() - 1 + (neg.size() / 2) * 2 >= k - 1)
ans = pos.back(), pos.pop_back();
else
ans = pos[0], pos.erase(pos.begin());
} else
ans = *neg.begin(), neg.erase(neg.begin());
}
bool ok = 1;
if (ans < 0)
ok = 0;
ans = (ans + mod) % mod;
k -= k % 2;
if (pos.size() + (neg.size() / 2) * 2 < k)
ok = 0;
for (int i = 1; i <= k; i += 2) {
int maxm = 0;
if (neg.size() >= 2) {
if (ok)
maxm = neg.back() * neg[neg.size() - 2];
else
maxm = neg[0] * neg[1];
}
if (pos.size() >= 2) {
if ((ok && maxm < pos.back() * pos[pos.size() - 2]) ||
(!ok && maxm > pos[0] * pos[1])) {
if (ok) {
maxm = pos.back();
pos.pop_back();
maxm = maxm * pos.back();
pos.pop_back();
} else {
maxm = pos[0] * pos[1];
pos.erase(pos.begin());
pos.erase(pos.begin());
}
} else {
if (ok) {
neg.pop_back();
neg.pop_back();
} else {
neg.erase(neg.begin());
neg.erase(neg.begin());
}
}
} else {
if (neg.size() >= 2) {
if (ok) {
neg.pop_back();
neg.pop_back();
} else {
neg.erase(neg.begin());
neg.erase(neg.begin());
}
} else {
assert(!neg.empty() && !pos.empty());
maxm = (*neg.begin()) * pos.back();
pos.pop_back();
neg.erase(neg.begin());
}
}
maxm = (maxm + mod * (int)1e9) % mod;
ans = ((ans % mod * maxm % mod) % mod + mod) % mod;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define deb(x) cerr << "\n" << #x << "=" << x << "\n";
#define deb2(x, y) \
cerr << "\n" << #x << "=" << x << "\n" << #y << "=" << y << "\n";
#define w(x) \
int x; \
cin >> x; \
while (x--)
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> pos, neg;
int ans = 1, z = 0;
for (int i = 0; i < n; i++) {
int foo;
cin >> foo;
if (foo <= 0)
neg.push_back(foo);
else
pos.push_back(foo);
}
sort(pos.begin(), pos.end()); // 1 2 3 4 5
sort(neg.rbegin(), neg.rend()); // -1 -2 -3 -4 -5
if (k % 2) {
if (!pos.empty()) {
if (pos.size() - 1 + (neg.size() / 2) * 2 >= k - 1)
ans = pos.back(), pos.pop_back();
else
ans = pos[0], pos.erase(pos.begin());
} else
ans = *neg.begin(), neg.erase(neg.begin());
}
bool ok = 1;
if (ans < 0)
ok = 0;
ans = (ans + mod) % mod;
k -= k % 2;
if (pos.size() + (neg.size() / 2) * 2 < k)
ok = 0;
for (int i = 1; i <= k; i += 2) {
int maxm = 0;
if (neg.size() >= 2) {
if (ok)
maxm = neg.back() * neg[neg.size() - 2];
else
maxm = neg[0] * neg[1];
}
if (pos.size() >= 2) {
if ((ok && maxm < pos.back() * pos[pos.size() - 2]) ||
(!ok && maxm > pos[0] * pos[1]) || neg.size() < 2) {
if (ok) {
maxm = pos.back();
pos.pop_back();
maxm = maxm * pos.back();
pos.pop_back();
} else {
maxm = pos[0] * pos[1];
pos.erase(pos.begin());
pos.erase(pos.begin());
}
} else {
if (ok) {
neg.pop_back();
neg.pop_back();
} else {
neg.erase(neg.begin());
neg.erase(neg.begin());
}
}
} else {
if (neg.size() >= 2) {
if (ok) {
neg.pop_back();
neg.pop_back();
} else {
neg.erase(neg.begin());
neg.erase(neg.begin());
}
} else {
assert(!neg.empty() && !pos.empty());
maxm = (*neg.begin()) * pos.back();
pos.pop_back();
neg.erase(neg.begin());
}
}
maxm = (maxm + mod * (int)1e9) % mod;
ans = ((ans % mod * maxm % mod) % mod + mod) % mod;
}
cout << ans;
return 0;
}
| replace | 59 | 60 | 59 | 60 | 0 | |
p02616 | C++ | Time Limit Exceeded | /// Find the maximum product of subsequences of size k
#include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
#define pb push_back
#define inf 1000000000000000000
using namespace std;
int main() {
ll i, j, k, n, s = 0;
cin >> n;
cin >> k;
ll K = k;
vector<ll> neg, pos, zero;
vector<pair<ll, ll>> vec;
ll arr[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i] > 0) {
pos.pb(arr[i]);
s = 1;
} else if (arr[i] < 0) {
neg.pb(abs(arr[i]));
s = -1;
} else {
zero.pb(arr[i]);
s = 1;
}
vec.pb(make_pair(abs(arr[i]), s));
}
ll idp = (ll)pos.size() - 1;
ll idn = (ll)neg.size() - 1;
sort(pos.begin(), pos.end());
sort(neg.begin(), neg.end());
sort(vec.begin(), vec.end());
ll ans = 1;
if (k % 2) {
if (pos.size() > 0) {
ans = (ans * pos[idp]) % mod;
idp--;
k--;
}
}
/// as k is even so k will be zero if enough positive or negative pair is
/// present here
while (k && (idp > 0 || idn > 0)) {
ll a = -inf;
ll b = -inf;
if (idp >= 1)
a = pos[idp] * pos[idp - 1];
if (idn >= 1)
b = neg[idn] * neg[idn - 1];
if (a > b) {
ans = (ans % mod * (a % mod + mod) % mod) % mod;
idp = idp - 2;
k = k - 2;
} else if (a < b) {
ans = (ans % mod * (b % mod + mod) % mod) % mod;
idn = idn - 2;
k = k - 2;
}
}
if (k) {
if (zero.size())
ans = 0;
else {
ans = 1;
for (i = 0; i < K; i++)
ans =
(ans % mod * (((vec[i].first * vec[i].second) % mod) + mod) % mod) %
mod;
}
}
cout << ans;
return 0;
}
| /// Find the maximum product of subsequences of size k
#include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
#define pb push_back
#define inf 1000000000000000000
using namespace std;
int main() {
ll i, j, k, n, s = 0;
cin >> n;
cin >> k;
ll K = k;
vector<ll> neg, pos, zero;
vector<pair<ll, ll>> vec;
ll arr[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i] > 0) {
pos.pb(arr[i]);
s = 1;
} else if (arr[i] < 0) {
neg.pb(abs(arr[i]));
s = -1;
} else {
zero.pb(arr[i]);
s = 1;
}
vec.pb(make_pair(abs(arr[i]), s));
}
ll idp = (ll)pos.size() - 1;
ll idn = (ll)neg.size() - 1;
sort(pos.begin(), pos.end());
sort(neg.begin(), neg.end());
sort(vec.begin(), vec.end());
ll ans = 1;
if (k % 2) {
if (pos.size() > 0) {
ans = (ans * pos[idp]) % mod;
idp--;
k--;
}
}
/// as k is even so k will be zero if enough positive or negative pair is
/// present here
while (k && (idp > 0 || idn > 0)) {
ll a = -inf;
ll b = -inf;
if (idp >= 1)
a = pos[idp] * pos[idp - 1];
if (idn >= 1)
b = neg[idn] * neg[idn - 1];
if (a > b) {
ans = (ans % mod * (a % mod + mod) % mod) % mod;
idp = idp - 2;
k = k - 2;
} else {
ans = (ans % mod * (b % mod + mod) % mod) % mod;
idn = idn - 2;
k = k - 2;
}
}
if (k) {
if (zero.size())
ans = 0;
else {
ans = 1;
for (i = 0; i < K; i++)
ans =
(ans % mod * (((vec[i].first * vec[i].second) % mod) + mod) % mod) %
mod;
}
}
cout << ans;
return 0;
}
| replace | 55 | 56 | 55 | 56 | TLE | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using LD = long double;
using PII = pair<int, int>;
using PLI = pair<long long, int>;
using PLL = pair<long long, long long>;
using TI = tuple<int, int, int>;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const deque<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T, class Cmp>
ostream &operator<<(ostream &out, const set<T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "}";
return out;
}
template <typename T>
ostream &operator<<(ostream &out, const unordered_set<T> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream &operator<<(ostream &out, const map<U, T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &p : a) {
out << (first ? "" : ", ");
out << p.first << ":" << p.second;
first = 0;
}
out << "}";
return out;
}
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << '\n';
else
cout << "NO" << '\n';
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << '\n';
else
cout << "No" << '\n';
}
template <class T> T gcd(T a, T b) {
while (b) {
T tmp = b;
b = a % b;
a = tmp;
}
return a;
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
long long qpow(long long a, long long b, int MOD) {
if (b == 0)
return 1;
long long res = 1;
while (b) {
if (b & 1)
res = (res * a) % MOD;
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
const int MOD = 1e9 + 7;
const int maxn = 2e6;
int fac[maxn + 5];
int invfac[maxn + 5];
void init() {
fac[0] = 1;
for (int i = 1; i <= maxn; i++)
fac[i] = 1LL * fac[i - 1] * i % MOD;
invfac[maxn] = (int)(qpow(fac[maxn], MOD - 2, MOD));
for (int i = maxn - 1; i >= 0; i--)
invfac[i] = 1LL * invfac[i + 1] * (i + 1) % MOD;
}
int C(int n, int k) {
assert(0 <= k && n >= k);
int tmp = (int)(1LL * invfac[k] * invfac[n - k] % MOD);
return (int)(1LL * fac[n] * tmp % MOD);
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<LL> a(n), pos, zero, neg;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > 0) {
pos.push_back(a[i]);
} else if (a[i] == 0) {
zero.push_back(a[i]);
} else {
neg.push_back(a[i]);
}
}
sort(pos.begin(), pos.end());
sort(neg.begin(), neg.end());
reverse(neg.begin(), neg.end());
int pcnt = pos.size(), zcnt = zero.size(), ncnt = neg.size();
LL ALL = 1;
for (auto &v : a)
ALL = (ALL * v) % MOD;
ALL = (ALL + MOD) % MOD;
if (k == 1) {
LL ans = *max_element(a.begin(), a.end()) % MOD;
cout << (ans + MOD) % MOD << '\n';
return 0;
}
if (k == pcnt + zcnt + ncnt) {
cout << ALL << '\n';
return 0;
}
if (k > pcnt + ncnt) {
cout << 0 << '\n';
return 0;
} else if (pcnt == 0) {
if (k & 1) {
if (zcnt) {
cout << 0 << '\n';
return 0;
}
LL now = 1;
for (int i = 0; i < k; i++)
now = (now * neg[i]) % MOD;
cout << (now + MOD) % MOD << '\n';
return 0;
} else {
if (k > ncnt) {
cout << 0 << '\n';
return 0;
}
LL now = 1;
for (int i = ncnt - 1; i >= ncnt - k; i--) {
now = (now * neg[i]) % MOD;
}
cout << (now + MOD) % MOD << '\n';
return 0;
}
} else {
LL now = 1;
int i = pos.size() - 1, j = neg.size() - 1;
for (; k;) {
if (k == 1) {
if (i >= 0) {
assert(0);
now = now * pos[i--] % MOD;
} else if (j >= 1) {
now = now * qpow(pos[0], MOD - 2, MOD) % MOD;
now = now * neg[j--] % MOD;
now = now * neg[j--] % MOD;
} else {
if (zcnt)
now = 0;
else
now = now * neg[j] % MOD;
}
k--;
} else {
LL P = 0, N = 0;
if (i >= 1)
P = pos[i] * pos[i - 1];
else if (i == 0)
P = pos[i];
if (j >= 1)
N = neg[j] * neg[j - 1];
else if (j == 0)
N = neg[j];
if (P > N) {
now = now * (P % MOD) % MOD;
k -= 1 + (i > 0);
i -= 1 + (i > 0);
} else {
now = now * (N % MOD) % MOD;
k -= 1 + (j > 0);
j -= 1 + (j > 0);
}
}
// trace(k, now);
}
cout << (now + MOD) % MOD << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using LD = long double;
using PII = pair<int, int>;
using PLI = pair<long long, int>;
using PLL = pair<long long, long long>;
using TI = tuple<int, int, int>;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const deque<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T, class Cmp>
ostream &operator<<(ostream &out, const set<T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "}";
return out;
}
template <typename T>
ostream &operator<<(ostream &out, const unordered_set<T> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream &operator<<(ostream &out, const map<U, T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &p : a) {
out << (first ? "" : ", ");
out << p.first << ":" << p.second;
first = 0;
}
out << "}";
return out;
}
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << '\n';
else
cout << "NO" << '\n';
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << '\n';
else
cout << "No" << '\n';
}
template <class T> T gcd(T a, T b) {
while (b) {
T tmp = b;
b = a % b;
a = tmp;
}
return a;
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
long long qpow(long long a, long long b, int MOD) {
if (b == 0)
return 1;
long long res = 1;
while (b) {
if (b & 1)
res = (res * a) % MOD;
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
const int MOD = 1e9 + 7;
const int maxn = 2e6;
int fac[maxn + 5];
int invfac[maxn + 5];
void init() {
fac[0] = 1;
for (int i = 1; i <= maxn; i++)
fac[i] = 1LL * fac[i - 1] * i % MOD;
invfac[maxn] = (int)(qpow(fac[maxn], MOD - 2, MOD));
for (int i = maxn - 1; i >= 0; i--)
invfac[i] = 1LL * invfac[i + 1] * (i + 1) % MOD;
}
int C(int n, int k) {
assert(0 <= k && n >= k);
int tmp = (int)(1LL * invfac[k] * invfac[n - k] % MOD);
return (int)(1LL * fac[n] * tmp % MOD);
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<LL> a(n), pos, zero, neg;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > 0) {
pos.push_back(a[i]);
} else if (a[i] == 0) {
zero.push_back(a[i]);
} else {
neg.push_back(a[i]);
}
}
sort(pos.begin(), pos.end());
sort(neg.begin(), neg.end());
reverse(neg.begin(), neg.end());
int pcnt = pos.size(), zcnt = zero.size(), ncnt = neg.size();
LL ALL = 1;
for (auto &v : a)
ALL = (ALL * v) % MOD;
ALL = (ALL + MOD) % MOD;
if (k == 1) {
LL ans = *max_element(a.begin(), a.end()) % MOD;
cout << (ans + MOD) % MOD << '\n';
return 0;
}
if (k == pcnt + zcnt + ncnt) {
cout << ALL << '\n';
return 0;
}
if (k > pcnt + ncnt) {
cout << 0 << '\n';
return 0;
} else if (pcnt == 0) {
if (k & 1) {
if (zcnt) {
cout << 0 << '\n';
return 0;
}
LL now = 1;
for (int i = 0; i < k; i++)
now = (now * neg[i]) % MOD;
cout << (now + MOD) % MOD << '\n';
return 0;
} else {
if (k > ncnt) {
cout << 0 << '\n';
return 0;
}
LL now = 1;
for (int i = ncnt - 1; i >= ncnt - k; i--) {
now = (now * neg[i]) % MOD;
}
cout << (now + MOD) % MOD << '\n';
return 0;
}
} else {
LL now = 1;
int i = pos.size() - 1, j = neg.size() - 1;
for (; k;) {
if (k == 1) {
if (i >= 0) {
if (j >= 1 && i < pcnt - 2 &&
pos[i] * pos[i + 1] < neg[j] * neg[j - 1]) {
now = now * qpow(pos[i + 1], MOD - 2, MOD) % MOD;
now = now * neg[j--] % MOD;
now = now * neg[j--] % MOD;
} else
now = now * pos[i--] % MOD;
} else if (j >= 1) {
now = now * qpow(pos[0], MOD - 2, MOD) % MOD;
now = now * neg[j--] % MOD;
now = now * neg[j--] % MOD;
} else {
if (zcnt)
now = 0;
else
now = now * neg[j] % MOD;
}
k--;
} else {
LL P = 0, N = 0;
if (i >= 1)
P = pos[i] * pos[i - 1];
else if (i == 0)
P = pos[i];
if (j >= 1)
N = neg[j] * neg[j - 1];
else if (j == 0)
N = neg[j];
if (P > N) {
now = now * (P % MOD) % MOD;
k -= 1 + (i > 0);
i -= 1 + (i > 0);
} else {
now = now * (N % MOD) % MOD;
k -= 1 + (j > 0);
j -= 1 + (j > 0);
}
}
// trace(k, now);
}
cout << (now + MOD) % MOD << '\n';
}
return 0;
}
| replace | 214 | 216 | 214 | 221 | 0 | |
p02616 | C++ | Runtime Error | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define LL long long int
const LL INF = (1LL << 60);
const int INF_INT = 2147483647 - 1e6 - 1;
const LL mod = 1000000007ll;
const int mod_int = 1000000007;
struct mint {
LL x;
mint(LL x = 0) : x((x % mod + mod) % mod) {}
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;
}
};
LL N, K;
LL A[200000];
mint ans = 1;
void solve() {
sort(A, A + N, [](int x, int y) { return abs(x) > abs(y); });
vector<LL> pos, neg;
int Np = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= 0) {
pos.push_back(A[i]);
if (A[i] > 0)
Np++;
}
if (A[i] < 0) {
neg.push_back(A[i]);
}
}
if (Np == 0) {
if (K % 2 == 0) {
for (int i = 0; i < K; i++)
ans *= mint(A[i]);
} else {
for (int i = N - 1; i >= N - K; i--)
ans *= mint(A[i]);
}
return;
}
vector<LL> cand;
if (K % 2 == 0) {
for (int i = 0; i + 1 < pos.size(); i += 2)
cand.push_back(pos[i] * pos[i + 1]);
for (int i = 0; i + 1 < neg.size(); i += 2)
cand.push_back(neg[i] * neg[i + 1]);
} else {
ans *= mint(pos[0]);
for (int i = 1; i + 1 < pos.size(); i += 2)
cand.push_back(pos[i] * pos[i + 1]);
for (int i = 0; i + 1 < neg.size(); i += 2)
cand.push_back(neg[i] * neg[i + 1]);
}
cand.push_back((*(--pos.end())) * (*(--neg.end())));
sort(cand.begin(), cand.end(), greater<LL>());
for (int i = 0; i < K / 2; i++) {
ans *= mint(cand[i]);
// cout << cand[i] << endl;
}
}
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
solve();
cout << ans.x << endl;
return 0;
} | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define LL long long int
const LL INF = (1LL << 60);
const int INF_INT = 2147483647 - 1e6 - 1;
const LL mod = 1000000007ll;
const int mod_int = 1000000007;
struct mint {
LL x;
mint(LL x = 0) : x((x % mod + mod) % mod) {}
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;
}
};
LL N, K;
LL A[200000];
mint ans = 1;
void solve() {
sort(A, A + N, [](int x, int y) { return abs(x) > abs(y); });
vector<LL> pos, neg;
int Np = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= 0) {
pos.push_back(A[i]);
if (A[i] > 0)
Np++;
}
if (A[i] < 0) {
neg.push_back(A[i]);
}
}
if (Np == 0) {
if (K % 2 == 0) {
for (int i = 0; i < K; i++)
ans *= mint(A[i]);
} else {
for (int i = N - 1; i >= N - K; i--)
ans *= mint(A[i]);
}
return;
}
vector<LL> cand;
if (K % 2 == 0) {
for (int i = 0; i + 1 < pos.size(); i += 2)
cand.push_back(pos[i] * pos[i + 1]);
for (int i = 0; i + 1 < neg.size(); i += 2)
cand.push_back(neg[i] * neg[i + 1]);
} else {
ans *= mint(pos[0]);
for (int i = 1; i + 1 < pos.size(); i += 2)
cand.push_back(pos[i] * pos[i + 1]);
for (int i = 0; i + 1 < neg.size(); i += 2)
cand.push_back(neg[i] * neg[i + 1]);
}
if (neg.size() > 0)
cand.push_back((*(--pos.end())) * (*(--neg.end())));
sort(cand.begin(), cand.end(), greater<LL>());
for (int i = 0; i < K / 2; i++) {
ans *= mint(cand[i]);
// cout << cand[i] << endl;
}
}
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
solve();
cout << ans.x << endl;
return 0;
} | replace | 119 | 120 | 119 | 121 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <typename T, typename U> T pow_(T a, U b) {
return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
ll modpow(ll a, ll b, ll _mod) {
return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.F << " " << p.S;
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
rep(i, sz(vec)) {
if (i)
os << " ";
os << vec[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &s) {
for (auto e : s)
os << e;
return os;
}
template <typename T> inline istream &operator>>(istream &is, vector<T> &v) {
rep(j, sz(v)) is >> v[j];
return is;
}
template <class T, class T2> inline void add(T &a, T2 b) {
(a += b % mod) %= mod;
if (a < 0)
a += mod;
}
template <class T> void operator+=(vector<T> &v, vector<T> v2) {
rep(i, sz(v2)) v.eb(v2[i]);
}
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(12); // debuged
int T;
T = 1;
while (T--)
solve();
}
void solve() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
cin >> a;
vector<ll> b, c;
rep(i, n) {
if (a[i] > 0)
b.eb(a[i]);
else if (a[i] < 0)
c.eb(-a[i]);
}
int flg = 0;
ll ans;
if (sz(b) + (sz(c) / 2 * 2) >= k)
flg = 1;
if (flg) {
sort(all(b));
sort(all(c));
// cerr << b << endl << c << endl;
ans = 1;
if (k % 2) {
ans = b.back();
b.pop_back();
}
vector<ll> d;
auto get = [&](vector<ll> b) {
while (sz(b) >= 2) {
ll tmp = b.back();
b.pop_back();
tmp *= b.back(); // mod 取らない !!
b.pop_back();
d.eb(tmp);
}
};
get(b);
get(c);
sort(all(d));
// cerr << d << endl;
rep(i, k / 2) {
(ans *= d.back() % mod) %= mod;
d.pop_back();
}
} else {
if (sz(b) + sz(c) != n) {
ans = 0;
} else {
// とにかく絶対値小さいのを
vector<pii> v(n);
rep(i, n) v[i] = pii(abs(a[i]), a[i] > 0); // 0 はない
sort(all(v));
// rep(i, n) cerr << v[i] << endl;
ans = 1;
rep(i, k) {
ll y = v[i].F;
if (v[i].S == 0)
(y = -y % mod + mod) %= mod;
(ans *= y) %= mod;
}
}
}
cout << ans << endl;
}
/*
8 3
-366234132 -570811034 -825899702 -247819003 141930537 831482523 -241868851
959494248 ans : 547971197
4 3
-120078725 137721685 -839194760 -781735442
ans : 662908466
9 8
0 1 4 4 -10 -7 -2 9 9
ans : 0
15 12
9 -7 -6 -10 1 -2 -10 -9 8 -2 -10 -3 5 5 5
ans : 82399972
15 12
1 -7 -3 5 6 -3 -8 5 -6 8 9 6 5 3 -4
ans : 306367993
*/
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <typename T, typename U> T pow_(T a, U b) {
return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
ll modpow(ll a, ll b, ll _mod) {
return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.F << " " << p.S;
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
rep(i, sz(vec)) {
if (i)
os << " ";
os << vec[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &s) {
for (auto e : s)
os << e;
return os;
}
template <typename T> inline istream &operator>>(istream &is, vector<T> &v) {
rep(j, sz(v)) is >> v[j];
return is;
}
template <class T, class T2> inline void add(T &a, T2 b) {
(a += b % mod) %= mod;
if (a < 0)
a += mod;
}
template <class T> void operator+=(vector<T> &v, vector<T> v2) {
rep(i, sz(v2)) v.eb(v2[i]);
}
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(12); // debuged
int T;
T = 1;
while (T--)
solve();
}
void solve() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
cin >> a;
vector<ll> b, c;
rep(i, n) {
if (a[i] > 0)
b.eb(a[i]);
else if (a[i] < 0)
c.eb(-a[i]);
}
int flg = 0;
ll ans;
// 個数が足りてて, kが奇数なら正の数が1つ以上あるか
if (sz(b) + (sz(c) / 2 * 2) >= k && (k % 2 == 0 || sz(b)))
flg = 1;
if (flg) {
sort(all(b));
sort(all(c));
// cerr << b << endl << c << endl;
ans = 1;
if (k % 2) {
ans = b.back();
b.pop_back();
}
vector<ll> d;
auto get = [&](vector<ll> b) {
while (sz(b) >= 2) {
ll tmp = b.back();
b.pop_back();
tmp *= b.back(); // mod 取らない !!
b.pop_back();
d.eb(tmp);
}
};
get(b);
get(c);
sort(all(d));
// cerr << d << endl;
rep(i, k / 2) {
(ans *= d.back() % mod) %= mod;
d.pop_back();
}
} else {
if (sz(b) + sz(c) != n) {
ans = 0;
} else {
// とにかく絶対値小さいのを
vector<pii> v(n);
rep(i, n) v[i] = pii(abs(a[i]), a[i] > 0); // 0 はない
sort(all(v));
// rep(i, n) cerr << v[i] << endl;
ans = 1;
rep(i, k) {
ll y = v[i].F;
if (v[i].S == 0)
(y = -y % mod + mod) %= mod;
(ans *= y) %= mod;
}
}
}
cout << ans << endl;
}
/*
8 3
-366234132 -570811034 -825899702 -247819003 141930537 831482523 -241868851
959494248 ans : 547971197
4 3
-120078725 137721685 -839194760 -781735442
ans : 662908466
9 8
0 1 4 4 -10 -7 -2 9 9
ans : 0
15 12
9 -7 -6 -10 1 -2 -10 -9 8 -2 -10 -3 5 5 5
ans : 82399972
15 12
1 -7 -3 5 6 -3 -8 5 -6 8 9 6 5 3 -4
ans : 306367993
*/
| replace | 108 | 109 | 108 | 110 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define orep(i, n) for (long long i = 1; i <= (n); ++i) // one rep
#define drep(i, n) for (long long i = (n)-1; i >= 0; --i) // down rep
#define srep(i, s, t) for (long long i = (s); i < (t); ++i) // set rep
#define rng(x) (x).begin(), (x).end()
// range
#define rrng(a) (a).rbegin(), (a).rend() // reverse range
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define ru(x, y) (((x) + (y)-1) / (y)) // round up
#define fi first
#define se second
#define eb emplace_back
#define fcout cout << fixed << setprecision(15)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vp = vector<P>;
using vl = vector<ll>;
template <typename T> void Yes(T flag) {
cout << (flag ? "Yes" : "No") << endl;
}
template <typename T> void pv(vector<T> vec) {
cout << "[";
for (auto &v : vec) {
cout << v << ",";
}
cout << "]" << endl;
}
template <> void pv(vector<P> vec) {
cout << "[";
for (auto &v : vec) {
cout << "<" << v.fi << "," << v.se << ">"
<< ",";
}
cout << "]" << endl;
}
template <> void pv(vector<pair<ll, int>> vec) {
cout << "[";
for (auto &v : vec) {
cout << "<" << v.fi << "," << v.se << ">"
<< ",";
}
cout << "]" << endl;
}
template <typename T> void pv2(vector<vector<T>> vec) {
for (auto &v : vec)
pv(v);
}
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
long long x;
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 -= a.x) < 0)
x += mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint operator++() const { return mint(*this) += mint(1); }
mint operator--() const { return mint(*this) -= mint(1); }
mint pow(long long 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 { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, int>> v;
rep(i, n) {
ll a;
cin >> a;
if (a >= 0)
v.eb(pair<ll, int>(a, 1));
if (a < 0)
v.eb(pair<ll, int>(-a, 0));
}
sort(rrng(v));
mint ans = mint(1);
int mp = 0;
rep(i, k) {
if (v.at(i).se == 0)
mp++;
ans *= mint(v.at(i).fi);
}
if (mp % 2 != 0) {
int plmi = v.at(k - 1).se;
ll kouho1 = v.at(k - 1).fi;
if (kouho1 == 0) {
cout << 0 << endl;
return 0;
}
ll louho1 = 0;
bool plmiflag = false;
// last plus or last minus
srep(i, k, n) {
if (v.at(i).se == !plmi) {
louho1 = v.at(i).fi;
plmiflag = true;
break;
}
}
ll kouho2 = 0, louho2 = 0;
bool nazoflag = false;
drep(i, k) {
if (v.at(i).se == !plmi) {
kouho2 = v.at(i).fi;
nazoflag = true;
break;
}
}
srep(i, k, n) {
if (!nazoflag)
continue;
if (v.at(i).se == plmi) {
louho2 = v.at(i).fi;
plmiflag = true;
break;
}
}
if (plmiflag) {
if (louho2 / kouho2 <= louho1 / kouho1) {
ans /= mint(kouho1);
ans *= mint(louho1);
} else {
ans /= mint(kouho2);
ans *= mint(louho2);
}
} else {
ans = mint(1);
sort(rng(v));
rep(i, k) { ans *= mint(v.at(i).fi); }
ans = -ans;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define orep(i, n) for (long long i = 1; i <= (n); ++i) // one rep
#define drep(i, n) for (long long i = (n)-1; i >= 0; --i) // down rep
#define srep(i, s, t) for (long long i = (s); i < (t); ++i) // set rep
#define rng(x) (x).begin(), (x).end()
// range
#define rrng(a) (a).rbegin(), (a).rend() // reverse range
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define ru(x, y) (((x) + (y)-1) / (y)) // round up
#define fi first
#define se second
#define eb emplace_back
#define fcout cout << fixed << setprecision(15)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vp = vector<P>;
using vl = vector<ll>;
template <typename T> void Yes(T flag) {
cout << (flag ? "Yes" : "No") << endl;
}
template <typename T> void pv(vector<T> vec) {
cout << "[";
for (auto &v : vec) {
cout << v << ",";
}
cout << "]" << endl;
}
template <> void pv(vector<P> vec) {
cout << "[";
for (auto &v : vec) {
cout << "<" << v.fi << "," << v.se << ">"
<< ",";
}
cout << "]" << endl;
}
template <> void pv(vector<pair<ll, int>> vec) {
cout << "[";
for (auto &v : vec) {
cout << "<" << v.fi << "," << v.se << ">"
<< ",";
}
cout << "]" << endl;
}
template <typename T> void pv2(vector<vector<T>> vec) {
for (auto &v : vec)
pv(v);
}
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
long long x;
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 -= a.x) < 0)
x += mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint operator++() const { return mint(*this) += mint(1); }
mint operator--() const { return mint(*this) -= mint(1); }
mint pow(long long 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 { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, int>> v;
rep(i, n) {
ll a;
cin >> a;
if (a >= 0)
v.eb(pair<ll, int>(a, 1));
if (a < 0)
v.eb(pair<ll, int>(-a, 0));
}
sort(rrng(v));
mint ans = mint(1);
int mp = 0;
rep(i, k) {
if (v.at(i).se == 0)
mp++;
ans *= mint(v.at(i).fi);
}
if (mp % 2 != 0) {
int plmi = v.at(k - 1).se;
ll kouho1 = v.at(k - 1).fi;
if (kouho1 == 0) {
cout << 0 << endl;
return 0;
}
ll louho1 = 0;
bool plmiflag = false;
// last plus or last minus
srep(i, k, n) {
if (v.at(i).se == !plmi) {
louho1 = v.at(i).fi;
plmiflag = true;
break;
}
}
ll kouho2 = 0, louho2 = 0;
bool nazoflag = false;
drep(i, k) {
if (v.at(i).se == !plmi) {
kouho2 = v.at(i).fi;
nazoflag = true;
break;
}
}
srep(i, k, n) {
if (!nazoflag)
continue;
if (v.at(i).se == plmi) {
louho2 = v.at(i).fi;
plmiflag = true;
break;
}
}
if (plmiflag) {
if (louho2 * kouho1 <= louho1 * kouho2) {
ans /= mint(kouho1);
ans *= mint(louho1);
} else {
ans /= mint(kouho2);
ans *= mint(louho2);
}
} else {
ans = mint(1);
sort(rng(v));
rep(i, k) { ans *= mint(v.at(i).fi); }
ans = -ans;
}
}
cout << ans << endl;
return 0;
}
| replace | 162 | 163 | 162 | 163 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define MP make_pair
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define DB(x) cerr << #x << " = " << x << endl
#define DB2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";
#define DEBUG \
int x12345; \
cin >> x12345;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
const long long MOD = 1e9 + 7;
///////////////////////////////////////////////
// for template
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;
}
///////////////////////////////////////////////
/// 🍈( '-' 🍈 |AC|
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val = val % MOD;
if (val < 0)
val += MOD * ((-val + MOD - 1) / MOD);
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD * ((-val + MOD - 1) / MOD);
val = val % MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> po, ng;
ll zero = 0;
REP(i, N) {
ll a;
cin >> a;
if (a == 0)
zero++;
if (a >= 0) {
po.emplace_back(a);
} else if (a < 0) {
ng.emplace_back(a);
}
}
ll pnum = po.size();
ll nnum = ng.size();
sort(po.rbegin(), po.rend());
sort(ALL(ng));
int pp = 0;
int np = 0;
if (N == K) {
ll ans = 1;
REP(i, pnum) {
ans = (ans * po[i]) % MOD;
if (ans < 0)
ans += MOD;
}
REP(j, nnum) {
ans = (ans * ng[j]) % MOD;
if (ans < 0)
ans += MOD;
}
cout << ans << endl;
return 0;
}
while (pp + np < K) {
if ((pp + np < K - 1) and (pp >= pnum)) {
np += 2;
} else if ((pp + np == K - 1) or (np + 1 >= nnum)) {
pp += 1;
// if (pp > pnum){
// ll ans = 1;
// REP(i,K){
// ans = (ans * ng[nnum - i - 1]) % MOD;
// if (ans < 0) ans += MOD;
// if (ans == 0){
// cout << "i = " << i << endl;
// }
// }
// cout << ans << endl;
// return 0;
// }
} else {
if (po[pp] * po[pp + 1] >= ng[np] * ng[np + 1]) {
pp += 1;
} else {
np += 2;
}
}
}
ll ans = 1;
REP(i, pp) { ans = (ans * po[i]) % MOD; }
REP(j, np) {
ans = (ans * ng[j]) % MOD;
if (ans < 0)
ans += MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define MP make_pair
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define DB(x) cerr << #x << " = " << x << endl
#define DB2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";
#define DEBUG \
int x12345; \
cin >> x12345;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
const long long MOD = 1e9 + 7;
///////////////////////////////////////////////
// for template
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;
}
///////////////////////////////////////////////
/// 🍈( '-' 🍈 |AC|
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val = val % MOD;
if (val < 0)
val += MOD * ((-val + MOD - 1) / MOD);
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD * ((-val + MOD - 1) / MOD);
val = val % MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> po, ng;
ll zero = 0;
REP(i, N) {
ll a;
cin >> a;
if (a == 0)
zero++;
if (a >= 0) {
po.emplace_back(a);
} else if (a < 0) {
ng.emplace_back(a);
}
}
ll pnum = po.size();
ll nnum = ng.size();
sort(po.rbegin(), po.rend());
sort(ALL(ng));
int pp = 0;
int np = 0;
if (N == K) {
ll ans = 1;
REP(i, pnum) {
ans = (ans * po[i]) % MOD;
if (ans < 0)
ans += MOD;
}
REP(j, nnum) {
ans = (ans * ng[j]) % MOD;
if (ans < 0)
ans += MOD;
}
cout << ans << endl;
return 0;
}
while (pp + np < K) {
if ((pp + np < K - 1) and (pp >= pnum)) {
np += 2;
} else if ((pp + np == K - 1) or (np + 1 >= nnum)) {
pp += 1;
if (pp > pnum) { // N != K
ll ans = 1;
REP(i, K) {
ans = (ans * ng[nnum - i - 1]) % MOD;
if (ans < 0)
ans += MOD;
if (ans == 0) {
cout << "i = " << i << endl;
}
}
cout << ans << endl;
return 0;
}
} else {
if (po[pp] * po[pp + 1] >= ng[np] * ng[np + 1]) {
pp += 1;
} else {
np += 2;
}
}
}
ll ans = 1;
REP(i, pp) { ans = (ans * po[i]) % MOD; }
REP(j, np) {
ans = (ans * ng[j]) % MOD;
if (ans < 0)
ans += MOD;
}
cout << ans << endl;
} | replace | 182 | 194 | 182 | 195 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define maxn 100005
#define mod 1000000007
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<long long> vll;
typedef vector<bool> vb;
typedef set<int> si;
#define fori(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, b, a) for (int i = (b); i >= (a); --i)
#define all(a) (a).begin(), (a).end()
#define __builtin_popcountll bitCountLL
#define __builtin_popcount bitCount
//__builtin_ctz 末尾0的个数, __builtin_clz 前导0的个数
//__builtin_ffs 最后一个1的位置
const int INF = 2e9;
const ll ML = 4e18;
ll solve() {
int n, k;
cin >> n >> k;
vll a, b;
for (int i = 0; i < n; ++i) {
ll x;
cin >> x;
if (x >= 0)
a.push_back(x);
else
b.push_back(x);
}
sort(a.rbegin(), a.rend());
sort(b.begin(), b.end());
ll res = 1;
if (a.size() == 0 && k % 2) {
int i = b.size() - 1;
while (k--) {
res = (res * b[i--]) % mod;
}
res = (res + mod) % mod;
return res;
}
if ((int)(a.size() + b.size()) == k) {
for (ll i : a)
res = (res * i) % mod;
for (ll i : b)
res = (res * i) % mod;
res = (res + mod) % mod;
return res;
}
bool ok = false;
int pos = a.size() - 1;
for (int i = 0; i * 2 <= (int)b.size(); i++) {
if (2 * i + (int)a.size() < k)
continue;
if (!ok) {
ok = true;
pos = k - 1 - 2 * i;
continue;
}
if (a[pos] * a[pos - 1] > b[2 * i - 1] * b[2 * i - 2])
break;
pos -= 2;
}
for (int i = 0; i <= pos; i++)
res = (res * a[i]) % mod;
int len = k - pos - 1;
for (int i = 0; i < len / 2; i++) {
ll x = (b[2 * i] * b[2 * i + 1]) % mod;
res = (res * x) % mod;
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// cout.precision(30); cout << fixed;
// freopen("D:\\data_in.txt", "r", stdin);
cout << solve() << endl;
// cout << (-1) % 3 << endl;
/*clock_t start,finish;
start = clock();
finish = clock();
cout << "\n" << (double)(finish - start) / (double)(CLOCKS_PER_SEC) * 1000 <<
"ms" << endl;
*/
return 0;
}
/***************************************************************
question:
idea:
tag:
record:
***************************************************************/
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define maxn 100005
#define mod 1000000007
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<long long> vll;
typedef vector<bool> vb;
typedef set<int> si;
#define fori(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, b, a) for (int i = (b); i >= (a); --i)
#define all(a) (a).begin(), (a).end()
#define __builtin_popcountll bitCountLL
#define __builtin_popcount bitCount
//__builtin_ctz 末尾0的个数, __builtin_clz 前导0的个数
//__builtin_ffs 最后一个1的位置
const int INF = 2e9;
const ll ML = 4e18;
ll solve() {
int n, k;
cin >> n >> k;
vll a, b;
for (int i = 0; i < n; ++i) {
ll x;
cin >> x;
if (x >= 0)
a.push_back(x);
else
b.push_back(x);
}
sort(a.rbegin(), a.rend());
sort(b.begin(), b.end());
ll res = 1;
if (a.size() == 0 && k % 2) {
int i = b.size() - 1;
while (k--) {
res = (res * b[i--]) % mod;
}
res = (res + mod) % mod;
return res;
}
if ((int)(a.size() + b.size()) == k) {
for (ll i : a)
res = (res * i) % mod;
for (ll i : b)
res = (res * i) % mod;
res = (res + mod) % mod;
return res;
}
bool ok = false;
int pos = a.size() - 1;
for (int i = 0; i * 2 <= (int)b.size(); i++) {
if (2 * i + (int)a.size() < k)
continue;
if (!ok) {
ok = true;
pos = k - 1 - 2 * i;
continue;
}
if (pos < 1)
break;
if (a[pos] * a[pos - 1] > b[2 * i - 1] * b[2 * i - 2])
break;
pos -= 2;
}
for (int i = 0; i <= pos; i++)
res = (res * a[i]) % mod;
int len = k - pos - 1;
for (int i = 0; i < len / 2; i++) {
ll x = (b[2 * i] * b[2 * i + 1]) % mod;
res = (res * x) % mod;
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// cout.precision(30); cout << fixed;
// freopen("D:\\data_in.txt", "r", stdin);
cout << solve() << endl;
// cout << (-1) % 3 << endl;
/*clock_t start,finish;
start = clock();
finish = clock();
cout << "\n" << (double)(finish - start) / (double)(CLOCKS_PER_SEC) * 1000 <<
"ms" << endl;
*/
return 0;
}
/***************************************************************
question:
idea:
tag:
record:
***************************************************************/
| insert | 64 | 64 | 64 | 66 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"
struct mint {
const int mod = 1000000007;
long long x;
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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(long long t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
multiset<ll> minus, plus;
ll zero = 0;
rep(i, n) {
if (a[i] == 0) {
zero++;
} else if (a[i] < 0) {
minus.insert(-a[i]);
} else if (a[i] > 0) {
plus.insert(a[i]);
}
}
// 答えがどうしてもマイナスになる場合
if (((k % 2 == 1) && (zero == 0) && (sz(plus) == 0))) {
mint ans = 1;
ll cnt = 0;
for (auto it = minus.begin(); it != minus.end(); it++) {
ans *= -*it;
cnt++;
if (cnt == k)
break;
}
cout << ans.x << endl;
return 0;
}
// 答えがどうしてもマイナスになる場合2
if ((n == k) && (zero == 0) && (sz(minus) % 2 == 1)) {
mint ans = 1;
ll cnt = 0;
for (auto it = minus.begin(); it != minus.end(); it++) {
ans *= -*it;
}
for (auto it = plus.begin(); it != plus.end(); it++) {
ans *= *it;
}
cout << ans.x << endl;
return 0;
}
// マイナスになりそうな答えを0にできる場合
if (((k % 2 == 1) && (zero != 0) && (sz(plus) == 0))) {
cout << 0 << endl;
return 0;
}
// その2
if ((n == k) && (zero != 0) && (sz(minus) % 2 == 1)) {
cout << 0 << endl;
return 0;
}
// 答えをプラスにできる場合
priority_queue<pair<ll, ll>> pq;
auto pit = plus.rbegin();
rep(i, sz(plus) / 2) {
ll v1 = *pit;
pit++;
ll v2 = *pit;
pit++;
pq.push(make_pair(v1 * v2, 0));
}
auto mit = minus.rbegin();
rep(i, sz(minus) / 2) {
ll v1 = *mit;
mit++;
ll v2 = *mit;
mit++;
pq.push(make_pair(v1 * v2, 1));
}
mint ans = 1;
if (k % 2 == 0) {
rep(i, k / 2) {
ans *= pq.top().first;
pq.pop();
}
} else {
ll puse = 0;
rep(i, k / 2) {
while ((((puse + 1) * 2) == sz(plus)) && (pq.top().second == 0)) {
pq.pop();
}
pair<ll, ll> p = pq.top();
pq.pop();
ans *= p.first;
if (p.second == 0)
puse++;
}
pit = plus.rbegin();
rep(i, puse * 2) pit++;
ans *= *pit;
}
cout << ans.x << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"
struct mint {
const int mod = 1000000007;
long long x;
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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(long long t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
multiset<ll> minus, plus;
ll zero = 0;
rep(i, n) {
if (a[i] == 0) {
zero++;
} else if (a[i] < 0) {
minus.insert(-a[i]);
} else if (a[i] > 0) {
plus.insert(a[i]);
}
}
// 答えがどうしてもマイナスになる場合
if (((k % 2 == 1) && (zero == 0) && (sz(plus) == 0))) {
mint ans = 1;
ll cnt = 0;
for (auto it = minus.begin(); it != minus.end(); it++) {
ans *= -*it;
cnt++;
if (cnt == k)
break;
}
cout << ans.x << endl;
return 0;
}
// 答えがどうしてもマイナスになる場合2
if ((n == k) && (zero == 0) && (sz(minus) % 2 == 1)) {
mint ans = 1;
ll cnt = 0;
for (auto it = minus.begin(); it != minus.end(); it++) {
ans *= -*it;
}
for (auto it = plus.begin(); it != plus.end(); it++) {
ans *= *it;
}
cout << ans.x << endl;
return 0;
}
// マイナスになりそうな答えを0にできる場合
if (((k % 2 == 1) && (zero != 0) && (sz(plus) == 0))) {
cout << 0 << endl;
return 0;
}
// その2
if ((n == k) && (zero != 0) && (sz(minus) % 2 == 1)) {
cout << 0 << endl;
return 0;
}
// どうしても0になる場合
if ((sz(plus) + sz(minus)) < k) {
cout << 0 << endl;
return 0;
}
// 答えをプラスにできる場合
priority_queue<pair<ll, ll>> pq;
auto pit = plus.rbegin();
rep(i, sz(plus) / 2) {
ll v1 = *pit;
pit++;
ll v2 = *pit;
pit++;
pq.push(make_pair(v1 * v2, 0));
}
auto mit = minus.rbegin();
rep(i, sz(minus) / 2) {
ll v1 = *mit;
mit++;
ll v2 = *mit;
mit++;
pq.push(make_pair(v1 * v2, 1));
}
mint ans = 1;
if (k % 2 == 0) {
rep(i, k / 2) {
ans *= pq.top().first;
pq.pop();
}
} else {
ll puse = 0;
rep(i, k / 2) {
while ((((puse + 1) * 2) == sz(plus)) && (pq.top().second == 0)) {
pq.pop();
}
pair<ll, ll> p = pq.top();
pq.pop();
ans *= p.first;
if (p.second == 0)
puse++;
}
pit = plus.rbegin();
rep(i, puse * 2) pit++;
ans *= *pit;
}
cout << ans.x << endl;
return 0;
}
| insert | 105 | 105 | 105 | 110 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1e-12;
static const double pi = 3.14159265358979323846;
static const int dx[4] = {1, -1, 0, 0};
static const int dy[4] = {0, 0, 1, -1};
static const int ddx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
static const int ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int mod = 1000000007;
int N, K;
int A[200005];
vector<PI> pls;
vector<PI> mns;
bool used[200005];
int modPow(int a, int n) {
if (n == 1)
return a % mod;
if (n % 2 == 1)
return (a * modPow(a, n - 1)) % mod;
int t = modPow(a, n / 2);
return (t * t) % mod;
}
signed main() {
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i) {
if (A[i] >= 0)
pls.push_back(PI(A[i], i));
else
mns.push_back(PI(A[i], i));
}
sort(pls.begin(), pls.end(), greater<PI>());
sort(mns.begin(), mns.end());
int ans = 1;
if (N == K) {
for (int i = 0; i < N; ++i) {
ans *= A[i];
ans = (ans + mod) % mod;
}
} else if (pls.size() == 0) {
cout << 1 / 0 << endl;
for (int i = 0; i < K; ++i) {
ans *= mns[mns.size() - i - 1].first;
ans = (ans + mod) % mod;
}
} else {
vector<int> res;
int p = 0, m = 0;
while (res.size() < K) {
if (p != pls.size() && m != mns.size()) {
if (pls[p].first > abs(mns[m].first)) {
res.push_back(pls[p].first);
used[pls[p].second] = true;
p++;
} else {
res.push_back(mns[m].first);
used[mns[m].second] = true;
m++;
}
} else if (p != pls.size()) {
res.push_back(pls[p].first);
used[pls[p].second] = true;
p++;
} else {
res.push_back(mns[m].first);
used[mns[m].second] = true;
m++;
}
}
for (int i = 0; i < K; ++i) {
ans *= abs(res[i]);
ans %= mod;
}
if (m % 2 != 0) {
int mi1 = INF, mi2 = INF;
int ma1 = -INF, ma2 = -INF;
for (int i = 0; i < N; ++i) {
if (used[i] && A[i] < 0)
chmin(mi1, abs(A[i]));
else if (!used[i] && A[i] >= 0)
chmax(ma1, A[i]);
}
for (int i = 0; i < N; ++i) {
if (used[i] && A[i] > 0)
chmin(mi2, A[i]);
else if (!used[i] && A[i] < 0)
chmax(ma2, abs(A[i]));
}
// if((ma1==-INF||mi1==INF)&&(ma2==-INF||mi2==INF))cout<<A[10000000]<<endl;
if ((ma2 == -INF || mi2 == INF) || ma1 * mi2 > ma2 * mi1) {
// cout<<1/0<<endl;
ans *= (ma1 * modPow(mi1, mod - 2)) % mod;
ans %= mod;
} else {
// cout<<1/0<<endl;
ans *= (ma2 * modPow(mi2, mod - 2)) % mod;
ans %= mod;
}
}
}
cout << (ans + mod) % mod << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1e-12;
static const double pi = 3.14159265358979323846;
static const int dx[4] = {1, -1, 0, 0};
static const int dy[4] = {0, 0, 1, -1};
static const int ddx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
static const int ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int mod = 1000000007;
int N, K;
int A[200005];
vector<PI> pls;
vector<PI> mns;
bool used[200005];
int modPow(int a, int n) {
if (n == 1)
return a % mod;
if (n % 2 == 1)
return (a * modPow(a, n - 1)) % mod;
int t = modPow(a, n / 2);
return (t * t) % mod;
}
signed main() {
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i) {
if (A[i] >= 0)
pls.push_back(PI(A[i], i));
else
mns.push_back(PI(A[i], i));
}
sort(pls.begin(), pls.end(), greater<PI>());
sort(mns.begin(), mns.end());
int ans = 1;
if (N == K) {
for (int i = 0; i < N; ++i) {
ans *= A[i];
ans = (ans + mod) % mod;
}
} else if (pls.size() == 0) {
if (K % 2 == 0) {
for (int i = 0; i < K; ++i) {
ans *= mns[i].first;
ans = (ans + mod) % mod;
}
} else {
for (int i = 0; i < K; ++i) {
ans *= mns[N - i - 1].first;
ans = (ans + mod) % mod;
}
}
} else {
vector<int> res;
int p = 0, m = 0;
while (res.size() < K) {
if (p != pls.size() && m != mns.size()) {
if (pls[p].first > abs(mns[m].first)) {
res.push_back(pls[p].first);
used[pls[p].second] = true;
p++;
} else {
res.push_back(mns[m].first);
used[mns[m].second] = true;
m++;
}
} else if (p != pls.size()) {
res.push_back(pls[p].first);
used[pls[p].second] = true;
p++;
} else {
res.push_back(mns[m].first);
used[mns[m].second] = true;
m++;
}
}
for (int i = 0; i < K; ++i) {
ans *= abs(res[i]);
ans %= mod;
}
if (m % 2 != 0) {
int mi1 = INF, mi2 = INF;
int ma1 = -INF, ma2 = -INF;
for (int i = 0; i < N; ++i) {
if (used[i] && A[i] < 0)
chmin(mi1, abs(A[i]));
else if (!used[i] && A[i] >= 0)
chmax(ma1, A[i]);
}
for (int i = 0; i < N; ++i) {
if (used[i] && A[i] > 0)
chmin(mi2, A[i]);
else if (!used[i] && A[i] < 0)
chmax(ma2, abs(A[i]));
}
// if((ma1==-INF||mi1==INF)&&(ma2==-INF||mi2==INF))cout<<A[10000000]<<endl;
if ((ma2 == -INF || mi2 == INF) || ma1 * mi2 > ma2 * mi1) {
// cout<<1/0<<endl;
ans *= (ma1 * modPow(mi1, mod - 2)) % mod;
ans %= mod;
} else {
// cout<<1/0<<endl;
ans *= (ma2 * modPow(mi2, mod - 2)) % mod;
ans %= mod;
}
}
}
cout << (ans + mod) % mod << endl;
} | replace | 71 | 75 | 71 | 81 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long long INF=(long long)1E17;
#define i_7 (long long)(1e9 + 7)
// #define i_7 998'244'353
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
long long po(long a, long b) {
if (b == 0) {
return 1;
}
long long z = po(a, b / 2);
z = mod(z * z);
if (b % 2 != 0) {
z = mod(a * z);
}
return z;
}
bool prime_(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
} else {
for (int i = 2; i <= std::sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
long long gcd_(long long a, long long b) {
if (a < b) {
std::swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd_(b, a % b);
}
}
long long lcm_(long long x, long long y) { return (x / gcd_(x, y)) * y; }
// using namespace std;
// using namespace boost::multiprecision;
// using namespace __gnu_pbds;
int main() {
using namespace std;
int n, k;
cin >> n >> k;
vector<long long> a(n);
bool all_minus = true;
REP(i, n) {
cin >> a[i];
if (a[i] >= 0)
all_minus = false;
}
auto cmp = [](long long x, long long y) -> bool { return abs(x) >= abs(y); };
sort(ALL(a), cmp);
long long ans = 1;
if (k == n) {
REP(i, k) {
ans *= a[i];
ans = mod(ans);
}
cout << ans << endl;
return 0;
}
if (all_minus && k % 2 == 1) {
reverse(ALL(a));
REP(i, k) {
ans *= a[i];
ans = mod(ans);
}
cout << ans << endl;
return 0;
}
queue<long long> s;
deque<long long> pos;
deque<long long> neg;
REP(i, n) {
if (a[i] >= 0LL) {
pos.push_back(a[i]);
} else {
neg.push_back(a[i]);
}
}
while ((int)s.size() < k) {
if ((int)s.size() == (k - 1)) {
long long p1 = pos.front();
pos.pop_front();
s.push(p1);
break;
}
if ((int)neg.size() < 2) {
long long p1 = pos.front();
pos.pop_front();
s.push(p1);
} else if (pos.empty()) {
long long n1 = neg.front();
neg.pop_front();
long long n2 = neg.front();
neg.pop_front();
s.push(n1);
s.push(n2);
} else if ((int)pos.size() < 2) {
long long p1 = pos.front();
pos.pop_front();
long long n1 = neg.front();
neg.pop_front();
long long n2 = neg.front();
neg.pop_front();
if (p1 >= n1 * n2) {
s.push(p1);
neg.push_front(n2);
neg.push_front(n1);
} else {
s.push(n1);
s.push(n2);
pos.push_front(p1);
}
} else {
long long p1 = pos.front();
pos.pop_front();
long long p2 = pos.front();
pos.pop_front();
long long n1 = neg.front();
neg.pop_front();
long long n2 = neg.front();
neg.pop_front();
if (p1 * p2 >= n1 * n2) {
s.push(p1);
pos.push_front(p2);
neg.push_front(n2);
neg.push_front(n1);
} else {
s.push(n1);
s.push(n2);
pos.push_front(p2);
pos.push_front(p1);
}
}
}
while (!s.empty()) {
long long x = s.front();
s.pop();
ans *= x;
ans = mod(ans);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long long INF=(long long)1E17;
#define i_7 (long long)(1e9 + 7)
// #define i_7 998'244'353
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
long long po(long a, long b) {
if (b == 0) {
return 1;
}
long long z = po(a, b / 2);
z = mod(z * z);
if (b % 2 != 0) {
z = mod(a * z);
}
return z;
}
bool prime_(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
} else {
for (int i = 2; i <= std::sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
long long gcd_(long long a, long long b) {
if (a < b) {
std::swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd_(b, a % b);
}
}
long long lcm_(long long x, long long y) { return (x / gcd_(x, y)) * y; }
// using namespace std;
// using namespace boost::multiprecision;
// using namespace __gnu_pbds;
int main() {
using namespace std;
int n, k;
cin >> n >> k;
vector<long long> a(n);
bool all_minus = true;
REP(i, n) {
cin >> a[i];
if (a[i] >= 0)
all_minus = false;
}
auto cmp = [](long long x, long long y) -> bool { return abs(x) > abs(y); };
sort(ALL(a), cmp);
long long ans = 1;
if (k == n) {
REP(i, k) {
ans *= a[i];
ans = mod(ans);
}
cout << ans << endl;
return 0;
}
if (all_minus && k % 2 == 1) {
reverse(ALL(a));
REP(i, k) {
ans *= a[i];
ans = mod(ans);
}
cout << ans << endl;
return 0;
}
queue<long long> s;
deque<long long> pos;
deque<long long> neg;
REP(i, n) {
if (a[i] >= 0LL) {
pos.push_back(a[i]);
} else {
neg.push_back(a[i]);
}
}
while ((int)s.size() < k) {
if ((int)s.size() == (k - 1)) {
long long p1 = pos.front();
pos.pop_front();
s.push(p1);
break;
}
if ((int)neg.size() < 2) {
long long p1 = pos.front();
pos.pop_front();
s.push(p1);
} else if (pos.empty()) {
long long n1 = neg.front();
neg.pop_front();
long long n2 = neg.front();
neg.pop_front();
s.push(n1);
s.push(n2);
} else if ((int)pos.size() < 2) {
long long p1 = pos.front();
pos.pop_front();
long long n1 = neg.front();
neg.pop_front();
long long n2 = neg.front();
neg.pop_front();
if (p1 >= n1 * n2) {
s.push(p1);
neg.push_front(n2);
neg.push_front(n1);
} else {
s.push(n1);
s.push(n2);
pos.push_front(p1);
}
} else {
long long p1 = pos.front();
pos.pop_front();
long long p2 = pos.front();
pos.pop_front();
long long n1 = neg.front();
neg.pop_front();
long long n2 = neg.front();
neg.pop_front();
if (p1 * p2 >= n1 * n2) {
s.push(p1);
pos.push_front(p2);
neg.push_front(n2);
neg.push_front(n1);
} else {
s.push(n1);
s.push(n2);
pos.push_front(p2);
pos.push_front(p1);
}
}
}
while (!s.empty()) {
long long x = s.front();
s.pop();
ans *= x;
ans = mod(ans);
}
cout << ans << endl;
return 0;
}
| replace | 78 | 79 | 78 | 79 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR \
if (DEBUG) \
cerr
#define MACRO(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, NAME, ...) NAME
#define pr(...) \
CERR << MACRO(__VA_ARGS__, pr10, pr9, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) \
<< endl
#define pr1(a) (#a) << "=" << (a) << " "
#define pr2(a, b) pr1(a) << pr1(b)
#define pr3(a, b, c) pr1(a) << pr2(b, c)
#define pr4(a, b, c, d) pr1(a) << pr3(b, c, d)
#define pr5(a, b, c, d, e) pr1(a) << pr4(b, c, d, e)
#define pr6(a, b, c, d, e, f) pr1(a) << pr5(b, c, d, e, f)
#define pr7(a, b, c, d, e, f, g) pr1(a) << pr6(b, c, d, e, f, g)
#define pr8(a, b, c, d, e, f, g, h) pr1(a) << pr7(b, c, d, e, f, g, h)
#define pr9(a, b, c, d, e, f, g, h, i) pr1(a) << pr8(b, c, d, e, f, g, h, i)
#define pr10(a, b, c, d, e, f, g, h, i, j) \
pr1(a) << pr9(b, c, d, e, f, g, h, i, j)
#define prArr(a) \
{ \
CERR << (#a) << "={"; \
int i = 0; \
for (auto t : (a)) \
CERR << (i++ ? ", " : "") << t; \
CERR << "}" << endl; \
}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL << 60) + 1e9; // ~ 1.15 * 1e18
const Int mod = (1e9) + 7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int, Int>;
template <class T> T Max(T &a, T b) { return a = max(a, b); }
template <class T> T Min(T &a, T b) { return a = min(a, b); }
template <class T1, class T2> ostream &operator<<(ostream &o, pair<T1, T2> p) {
return o << "(" << p.first << "," << p.second << ")";
}
template <class T1, class T2, class T3>
ostream &operator<<(ostream &o, tuple<T1, T2, T3> t) {
return o << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << ")";
}
template <class T1, class T2> istream &operator>>(istream &i, pair<T1, T2> &p) {
return i >> p.first >> p.second;
}
template <class T> ostream &operator<<(ostream &o, vector<T> a) {
Int i = 0;
for (T t : a)
o << (i++ ? " " : "") << t;
return o;
}
template <class T> istream &operator>>(istream &i, vector<T> &a) {
for (T &t : a)
i >> t;
return i;
}
// INSERT ABOVE HERE
Int mod_pow(Int x, Int y) {
Int res = 1;
while (y) {
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y /= 2;
}
return res;
}
signed main() {
srand((unsigned)time(NULL));
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
Int N, K;
cin >> N >> K;
vector<Int> A(N);
cin >> A;
sort(A.begin(), A.end(), [&](Int a, Int b) { return abs(a) > abs(b); });
Int base = 1;
{ // すべてかけたら+
Int cnt = 0;
for (Int i = 0; i < K; i++) {
if (A[i] < 0)
cnt++;
if (A[i] == 0) {
cout << 0 << endl;
return 0;
}
base = base * abs(A[i]);
base %= mod;
}
if (cnt % 2 == 0) {
cout << base << endl;
return 0;
}
}
Int a = 1, b = -1; // 負-1、正+1
Int x = -1, y = 1; // 正-1、負+1
for (Int i = 0; i < K; i++) {
if (A[i] < 0)
a = A[i];
if (A[i] > 0)
x = A[i];
}
for (Int i = K; i < N; i++) {
if (A[i] > 0 && b == -1)
b = A[i];
if (A[i] < 0 && y == 1)
y = A[i];
}
if ((a == 1 || b == -1) && (x == -1 || y == 1)) {
Int ans = 1;
Int cnt = 0;
for (Int i = 0; i < K; i++) {
ans = ans * abs(A[N - 1 - i]) % mod;
if (A[N - 1 - i] < 0)
cnt++;
}
assert(cnt % 2 == 1);
cout << (mod - ans) % mod << endl;
return 0;
}
if (a == 1 || b == -1) {
Int ans = base * mod_pow(abs(x), mod - 2) % mod;
ans = ans * abs(y) % mod;
cout << ans << endl;
return 0;
}
if (x == -1 || y == 1) {
Int ans = base * mod_pow(abs(a), mod - 2) % mod;
ans = ans * abs(b) % mod;
cout << ans << endl;
return 0;
}
// if(b / a < y / x)
if (b * x < y * a) {
Int ans = base * mod_pow(abs(x), mod - 2) % mod;
ans = ans * abs(y) % mod;
cout << ans << endl;
return 0;
}
Int ans = base * mod_pow(abs(a), mod - 2) % mod;
ans = ans * abs(b) % mod;
cout << ans << endl;
return 0;
return 0;
}
| #include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR \
if (DEBUG) \
cerr
#define MACRO(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, NAME, ...) NAME
#define pr(...) \
CERR << MACRO(__VA_ARGS__, pr10, pr9, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) \
<< endl
#define pr1(a) (#a) << "=" << (a) << " "
#define pr2(a, b) pr1(a) << pr1(b)
#define pr3(a, b, c) pr1(a) << pr2(b, c)
#define pr4(a, b, c, d) pr1(a) << pr3(b, c, d)
#define pr5(a, b, c, d, e) pr1(a) << pr4(b, c, d, e)
#define pr6(a, b, c, d, e, f) pr1(a) << pr5(b, c, d, e, f)
#define pr7(a, b, c, d, e, f, g) pr1(a) << pr6(b, c, d, e, f, g)
#define pr8(a, b, c, d, e, f, g, h) pr1(a) << pr7(b, c, d, e, f, g, h)
#define pr9(a, b, c, d, e, f, g, h, i) pr1(a) << pr8(b, c, d, e, f, g, h, i)
#define pr10(a, b, c, d, e, f, g, h, i, j) \
pr1(a) << pr9(b, c, d, e, f, g, h, i, j)
#define prArr(a) \
{ \
CERR << (#a) << "={"; \
int i = 0; \
for (auto t : (a)) \
CERR << (i++ ? ", " : "") << t; \
CERR << "}" << endl; \
}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL << 60) + 1e9; // ~ 1.15 * 1e18
const Int mod = (1e9) + 7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int, Int>;
template <class T> T Max(T &a, T b) { return a = max(a, b); }
template <class T> T Min(T &a, T b) { return a = min(a, b); }
template <class T1, class T2> ostream &operator<<(ostream &o, pair<T1, T2> p) {
return o << "(" << p.first << "," << p.second << ")";
}
template <class T1, class T2, class T3>
ostream &operator<<(ostream &o, tuple<T1, T2, T3> t) {
return o << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << ")";
}
template <class T1, class T2> istream &operator>>(istream &i, pair<T1, T2> &p) {
return i >> p.first >> p.second;
}
template <class T> ostream &operator<<(ostream &o, vector<T> a) {
Int i = 0;
for (T t : a)
o << (i++ ? " " : "") << t;
return o;
}
template <class T> istream &operator>>(istream &i, vector<T> &a) {
for (T &t : a)
i >> t;
return i;
}
// INSERT ABOVE HERE
Int mod_pow(Int x, Int y) {
Int res = 1;
while (y) {
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y /= 2;
}
return res;
}
signed main() {
srand((unsigned)time(NULL));
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
Int N, K;
cin >> N >> K;
vector<Int> A(N);
cin >> A;
sort(A.begin(), A.end(), [&](Int a, Int b) { return abs(a) > abs(b); });
Int base = 1;
{ // すべてかけたら+
Int cnt = 0;
for (Int i = 0; i < K; i++) {
if (A[i] < 0)
cnt++;
if (A[i] == 0) {
cout << 0 << endl;
return 0;
}
base = base * abs(A[i]);
base %= mod;
}
if (cnt % 2 == 0) {
cout << base << endl;
return 0;
}
}
Int a = 1, b = -1; // 負-1、正+1
Int x = -1, y = 1; // 正-1、負+1
for (Int i = 0; i < K; i++) {
if (A[i] < 0)
a = A[i];
if (A[i] > 0)
x = A[i];
}
for (Int i = K; i < N; i++) {
if (A[i] > 0 && b == -1)
b = A[i];
if (A[i] < 0 && y == 1)
y = A[i];
}
if ((a == 1 || b == -1) && (x == -1 || y == 1)) {
Int ans = 1;
Int cnt = 0;
for (Int i = 0; i < K; i++) {
ans = ans * abs(A[N - 1 - i]) % mod;
if (A[N - 1 - i] < 0)
cnt++;
}
// assert(cnt%2 == 1);
if (cnt % 2 == 0) {
cout << ans << endl;
return 0;
}
cout << (mod - ans) % mod << endl;
return 0;
}
if (a == 1 || b == -1) {
Int ans = base * mod_pow(abs(x), mod - 2) % mod;
ans = ans * abs(y) % mod;
cout << ans << endl;
return 0;
}
if (x == -1 || y == 1) {
Int ans = base * mod_pow(abs(a), mod - 2) % mod;
ans = ans * abs(b) % mod;
cout << ans << endl;
return 0;
}
// if(b / a < y / x)
if (b * x < y * a) {
Int ans = base * mod_pow(abs(x), mod - 2) % mod;
ans = ans * abs(y) % mod;
cout << ans << endl;
return 0;
}
Int ans = base * mod_pow(abs(a), mod - 2) % mod;
ans = ans * abs(b) % mod;
cout << ans << endl;
return 0;
return 0;
}
| replace | 136 | 137 | 136 | 141 | 0 | |
p02617 | C++ | Runtime Error | #include <bits/stdc++.h>
#define del(a, i) memset(a, i, sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l + r) >> 1)
#define lowbit(x) (x & (-x))
#define INF 0x3f3f3f3f
using namespace std;
template <class T> inl T read() {
T x = 0;
int f = 1;
char k = getchar();
for (; k > '9' || k < '0'; k = getchar())
if (k == '-')
f = -1;
for (; k >= '0' && k <= '9'; k = getchar())
x = x * 10 + k - '0';
return x * f;
}
template <class T> inl T read(T &x) { return x = read<T>(); }
int _num, _buf[20];
template <class T> il print(T x) {
if (x == 0)
return putchar('0'), void();
if (x < 0)
putchar('-'), x = -x;
while (x)
_buf[++_num] = x % 10, x /= 10;
while (_num)
putchar(_buf[_num--] + '0');
}
ll mul(ll a, ll b, ll mod) {
long double c = 1.;
return (a * b - (ll)(c * a * b / mod) * mod) % mod;
}
it qpow(int x, int m, int mod) {
int res = 1, bas = x;
while (m) {
if (m & 1)
res = (1ll * res * bas) % mod;
bas = (1ll * bas * bas) % mod, m >>= 1;
}
return res;
}
const int N = 2e5 + 5;
int n, val[N];
ll ans;
vector<int> G[N];
struct Seg_Tree {
int tag;
ll sum;
} T[N];
#define lc (cur << 1)
#define rc (cur << 1 | 1)
il pushup(int cur) { T[cur].sum = T[lc].sum + T[rc].sum; }
il maintain(int cur, int l, int r, int k) {
T[cur].tag += k;
T[cur].sum += 1ll * k * (r - l + 1);
}
il pushdown(int cur, int l, int r) {
if (!T[cur].tag)
return;
maintain(lc, l, mid, T[cur].tag);
maintain(rc, mid + 1, r, T[cur].tag);
T[cur].tag = 0;
}
il Build(int cur, int l, int r) {
if (l == r) {
T[cur].sum = val[l];
return;
}
Build(lc, l, mid), Build(rc, mid + 1, r);
pushup(cur);
}
il Updata(int cur, int l, int r, int L, int R, int k) {
if (l >= L && r <= R) {
maintain(cur, l, r, k);
return;
}
pushdown(cur, l, r);
if (mid >= L)
Updata(lc, l, mid, L, R, k);
if (R > mid)
Updata(rc, mid + 1, r, L, R, k);
pushup(cur);
}
int main() {
// freopen( ".in", "r", stdin ) ;
// freopen( ".out", "w", stdout ) ;
n = read<int>();
for (ri i = 1; i <= n; ++i)
val[i] = 1;
for (ri i = 1; i < n; ++i) {
int u = read<int>(), v = read<int>();
if (u > v)
swap(u, v);
G[u].push_back(v);
val[v] -= 1;
}
for (ri i = 1; i <= n; ++i)
val[i] += val[i - 1];
Build(1, 1, n);
ans += T[1].sum;
for (ri i = 1; i < n; ++i) {
Updata(1, 1, n, i, n, -1);
for (auto x : G[i])
Updata(1, 1, n, x, n, 1);
ans += T[1].sum;
}
print(ans), puts("");
cerr << 1. * clock() / CLOCKS_PER_SEC << "\n";
return 0;
} | #include <bits/stdc++.h>
#define del(a, i) memset(a, i, sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l + r) >> 1)
#define lowbit(x) (x & (-x))
#define INF 0x3f3f3f3f
using namespace std;
template <class T> inl T read() {
T x = 0;
int f = 1;
char k = getchar();
for (; k > '9' || k < '0'; k = getchar())
if (k == '-')
f = -1;
for (; k >= '0' && k <= '9'; k = getchar())
x = x * 10 + k - '0';
return x * f;
}
template <class T> inl T read(T &x) { return x = read<T>(); }
int _num, _buf[20];
template <class T> il print(T x) {
if (x == 0)
return putchar('0'), void();
if (x < 0)
putchar('-'), x = -x;
while (x)
_buf[++_num] = x % 10, x /= 10;
while (_num)
putchar(_buf[_num--] + '0');
}
ll mul(ll a, ll b, ll mod) {
long double c = 1.;
return (a * b - (ll)(c * a * b / mod) * mod) % mod;
}
it qpow(int x, int m, int mod) {
int res = 1, bas = x;
while (m) {
if (m & 1)
res = (1ll * res * bas) % mod;
bas = (1ll * bas * bas) % mod, m >>= 1;
}
return res;
}
const int N = 2e5 + 5;
int n, val[N];
ll ans;
vector<int> G[N];
struct Seg_Tree {
int tag;
ll sum;
} T[N << 2];
#define lc (cur << 1)
#define rc (cur << 1 | 1)
il pushup(int cur) { T[cur].sum = T[lc].sum + T[rc].sum; }
il maintain(int cur, int l, int r, int k) {
T[cur].tag += k;
T[cur].sum += 1ll * k * (r - l + 1);
}
il pushdown(int cur, int l, int r) {
if (!T[cur].tag)
return;
maintain(lc, l, mid, T[cur].tag);
maintain(rc, mid + 1, r, T[cur].tag);
T[cur].tag = 0;
}
il Build(int cur, int l, int r) {
if (l == r) {
T[cur].sum = val[l];
return;
}
Build(lc, l, mid), Build(rc, mid + 1, r);
pushup(cur);
}
il Updata(int cur, int l, int r, int L, int R, int k) {
if (l >= L && r <= R) {
maintain(cur, l, r, k);
return;
}
pushdown(cur, l, r);
if (mid >= L)
Updata(lc, l, mid, L, R, k);
if (R > mid)
Updata(rc, mid + 1, r, L, R, k);
pushup(cur);
}
int main() {
// freopen( ".in", "r", stdin ) ;
// freopen( ".out", "w", stdout ) ;
n = read<int>();
for (ri i = 1; i <= n; ++i)
val[i] = 1;
for (ri i = 1; i < n; ++i) {
int u = read<int>(), v = read<int>();
if (u > v)
swap(u, v);
G[u].push_back(v);
val[v] -= 1;
}
for (ri i = 1; i <= n; ++i)
val[i] += val[i - 1];
Build(1, 1, n);
ans += T[1].sum;
for (ri i = 1; i < n; ++i) {
Updata(1, 1, n, i, n, -1);
for (auto x : G[i])
Updata(1, 1, n, x, n, 1);
ans += T[1].sum;
}
print(ans), puts("");
cerr << 1. * clock() / CLOCKS_PER_SEC << "\n";
return 0;
} | replace | 57 | 58 | 57 | 58 | 0 | 0.029827 |
p02617 | C++ | Runtime Error | #ifdef LOCAL
#include <header.hpp>
#else
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#endif
#define lp(i, l, r) for (auto i = regu(l); i <= decltype(i)(r); ++i)
#define rp(i, r, l) for (auto i = regu(r); i >= decltype(i)(l); --i)
#define lv(i, a) for (int i = 0; i < int(a.size()); ++i)
#define rv(i, a) for (int i = int(a.size()) - 1; i >= 0; --i)
#define lm(i, m) for (auto i = m; i; i = (m) & (i - 1))
#define many for (int C = 1, T = -1; T < 0 && cin >> T, C <= T; ++C)
#define goog "Case #" + to_string(C) + ":"
#define rang(a) begin(a), end(a)
#define elif else if
#ifndef LOCAL
#define endl '\n'
#undef assert
#define assert
#endif
using namespace std;
using namespace __gnu_pbds;
const auto eps = 1e-8, pi = acos(-1);
template <class T> int comp(const T &a, const T &b) {
return a < b - eps ? -1 : (a > b + eps);
}
#if __cplusplus > 201103L
template <class T> auto regu(const T &a) { return int(a); }
template <> auto regu(const long long &a) { return a; }
template <> auto regu(const uint64_t &a) { return int64_t(a); }
#endif
template <class T> int barr(const T &a, const int &i) {
return int(a >> i & 1);
}
template <class T> int bcnt(const T &a) { return __builtin_popcount(a); }
template <> int bcnt(const int64_t &a) { return __builtin_popcountll(a); }
template <class T> int blen(const T &a) { return a ? 1 + blen(a / 2) : 0; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> T rint(T l, T r) {
return uniform_int_distribution<T>(l, r)(rng);
}
template <class A, class B> B conv(const A &a, B b = B()) {
stringstream s;
s << a, s >> b;
return b;
}
template <class T = int> T inf() { return numeric_limits<T>::max() / 2; }
template <class T> T sign(const T &a) { return a == 0 ? 0 : (a < 0 ? -1 : 1); }
template <class T> T floor(const T &a, const T &b) {
assert(b != 0);
return sign(a) * sign(b) > 0 ? abs(a) / abs(b)
: -(abs(a) + abs(b) - 1) / abs(b);
}
template <class T> T ceil(const T &a, const T &b) {
assert(b != 0);
return sign(a) * sign(b) > 0 ? (abs(a) + abs(b) - 1) / abs(b)
: -abs(a) / abs(b);
}
template <class T> bool tmin(T &a, T b) { return b < a ? a = b, true : false; }
template <class T> bool tmax(T &a, T b) { return b > a ? a = b, true : false; }
#if __cplusplus > 201103L
template <class T> auto min(const T &a) { return *min_element(rang(a)); }
template <class T> auto max(const T &a) { return *max_element(rang(a)); }
template <class T> auto sum(const T &a) {
return accumulate(rang(a), (typename T::value_type)0);
}
template <> auto sum(const vector<int> &a) { return accumulate(rang(a), 0ll); }
template <> auto sum(const vector<string> &a) {
return accumulate(rang(a), string());
}
template <class C, class V> auto find(C &c, const V &v) {
return find(rang(c), v);
}
template <class C, class V> auto find(const C &c, const V &v) {
return find(rang(c), v);
}
#endif
template <class T, class C = less<typename T::value_type>>
void sort(T &a, C c = C()) {
sort(rang(a), c);
}
template <class T> void reve(T &a) { reverse(rang(a)); }
template <class T> void uniq(T &a) {
sort(a), a.erase(unique(rang(a)), end(a));
}
template <class T> void shuf(T &a) { shuffle(rang(a), rng); }
template <class T> void merg(T l, T m, T r) { inplace_merge(l, m, r); }
#if __cplusplus > 201103L
template <class T> auto vect(const T &v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T &v, int n, D... m) {
return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}
#endif
template <class F, class S> istream &operator>>(istream &s, pair<F, S> &a) {
return s >> a.first >> a.second;
}
template <class F, class S>
ostream &operator<<(ostream &s, const pair<F, S> &a) {
return s << a.first << " " << a.second;
}
template <class T> istream &operator>>(istream &s, vector<T> &a) {
for (int i = -1; i < 0 && (!a.size() && (cin >> i, a.resize(i), 0), i = 0),
i < int(a.size());)
s >> a[i++];
return s;
}
template <class T> ostream &operator<<(ostream &s, const vector<T> &a) {
lv(i, a) cout << a[i] << (i + 1 == int(a.size()) ? "" : " ");
return s;
}
template <class T> T in() {
T a;
cin >> a;
return a;
}
template <class T> void in(T &a) { cin >> a; }
template <class A, class... B> void in(A &a, B &...b) { cin >> a, in(b...); }
void ou() { cout << endl; }
template <class T> void ou(const T &a) { cout << a << endl; }
template <class A, class... B> void ou(const A &a, const B &...b) {
cout << a << ' ', ou(b...);
}
bool yep(const bool &a) { return ou(a ? "yes" : "no"), a; }
bool Yep(const bool &a) { return ou(a ? "Yes" : "No"), a; }
bool YEP(const bool &a) { return ou(a ? "YES" : "NO"), a; }
#if __cplusplus > 201103L
template <class T> struct func {
func(T &&t_) : t(forward<T>(t_)) {}
template <class... A> auto operator()(A &&...a) const {
return t(*this, forward<A>(a)...);
}
T t;
};
#endif
template <class T> struct hash_safe {};
template <> struct hash_safe<int> {
size_t operator()(unsigned long long a) const {
static unsigned long long d =
chrono::steady_clock::now().time_since_epoch().count();
a += d + 0x9e3779b97f4a7c15, a = (a ^ (a >> 30)) * 0xbf58476d1ce4e5b9;
a = (a ^ (a >> 27)) * 0x94d049bb133111eb;
return a ^ (a >> 31);
}
};
template <> struct hash_safe<long long> {
size_t operator()(unsigned long long a) const { return hash_safe<int>()(a); }
};
template <class A, class B> struct hash_safe<pair<A, B>> {
size_t operator()(pair<A, B> a) const {
auto h = hash_safe<A>()(a.first), g = hash_safe<B>()(a.second);
return (h >> 16 << 16) + (g >> 16);
}
};
template <class T> using unordered_set_safe = unordered_set<T, hash_safe<T>>;
template <class T>
using unordered_multiset_safe = unordered_multiset<T, hash_safe<T>>;
template <class K, class V>
using unordered_map_safe = unordered_map<K, V, hash_safe<K>>;
template <class K, class V>
using unordered_multimap_safe = unordered_multimap<K, V, hash_safe<K>>;
#define unordered_set unordered_set_safe
#define unordered_multiset unordered_multiset_safe
#define unordered_map unordered_map_safe
#define unordered_multimap unordered_multimap_safe
template <class T, class C = less<T>>
using bbst =
tree<T, null_type, C, rb_tree_tag, tree_order_statistics_node_update>;
template <class T, class C = greater<T>>
using heap = __gnu_pbds::priority_queue<T, C, pairing_heap_tag>;
using ll = long long;
using ld = long double;
using str = string;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vvi = vector<vi>;
// The templates end here.
int main() {
ios::sync_with_stdio(0);
cout << setprecision(16) << fixed;
cin.tie(0);
int n;
in(n);
vpii e(n - 1);
in(e);
ll ans = 0;
lp(r, 1, n) ans += ll(r) * (r + 1) / 2;
for (auto t : e) {
int u = t.first, v = t.second;
if (u > v)
swap(u, v);
ans -= ll(u) * (n - v + 1);
}
ou(ans);
return 0;
}
| #ifdef LOCAL
#include <header.hpp>
#else
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#endif
#define lp(i, l, r) for (auto i = regu(l); i <= decltype(i)(r); ++i)
#define rp(i, r, l) for (auto i = regu(r); i >= decltype(i)(l); --i)
#define lv(i, a) for (int i = 0; i < int(a.size()); ++i)
#define rv(i, a) for (int i = int(a.size()) - 1; i >= 0; --i)
#define lm(i, m) for (auto i = m; i; i = (m) & (i - 1))
#define many for (int C = 1, T = -1; T < 0 && cin >> T, C <= T; ++C)
#define goog "Case #" + to_string(C) + ":"
#define rang(a) begin(a), end(a)
#define elif else if
#ifndef LOCAL
#define endl '\n'
#undef assert
#define assert
#endif
using namespace std;
using namespace __gnu_pbds;
const auto eps = 1e-8, pi = acos(-1);
template <class T> int comp(const T &a, const T &b) {
return a < b - eps ? -1 : (a > b + eps);
}
#if __cplusplus > 201103L
template <class T> auto regu(const T &a) { return int(a); }
template <> auto regu(const long long &a) { return a; }
template <> auto regu(const uint64_t &a) { return int64_t(a); }
#endif
template <class T> int barr(const T &a, const int &i) {
return int(a >> i & 1);
}
template <class T> int bcnt(const T &a) { return __builtin_popcount(a); }
template <> int bcnt(const int64_t &a) { return __builtin_popcountll(a); }
template <class T> int blen(const T &a) { return a ? 1 + blen(a / 2) : 0; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> T rint(T l, T r) {
return uniform_int_distribution<T>(l, r)(rng);
}
template <class A, class B> B conv(const A &a, B b = B()) {
stringstream s;
s << a, s >> b;
return b;
}
template <class T = int> T inf() { return numeric_limits<T>::max() / 2; }
template <class T> T sign(const T &a) { return a == 0 ? 0 : (a < 0 ? -1 : 1); }
template <class T> T floor(const T &a, const T &b) {
assert(b != 0);
return sign(a) * sign(b) > 0 ? abs(a) / abs(b)
: -(abs(a) + abs(b) - 1) / abs(b);
}
template <class T> T ceil(const T &a, const T &b) {
assert(b != 0);
return sign(a) * sign(b) > 0 ? (abs(a) + abs(b) - 1) / abs(b)
: -abs(a) / abs(b);
}
template <class T> bool tmin(T &a, T b) { return b < a ? a = b, true : false; }
template <class T> bool tmax(T &a, T b) { return b > a ? a = b, true : false; }
#if __cplusplus > 201103L
template <class T> auto min(const T &a) { return *min_element(rang(a)); }
template <class T> auto max(const T &a) { return *max_element(rang(a)); }
template <class T> auto sum(const T &a) {
return accumulate(rang(a), (typename T::value_type)0);
}
template <> auto sum(const vector<int> &a) { return accumulate(rang(a), 0ll); }
template <> auto sum(const vector<string> &a) {
return accumulate(rang(a), string());
}
template <class C, class V> auto find(C &c, const V &v) {
return find(rang(c), v);
}
template <class C, class V> auto find(const C &c, const V &v) {
return find(rang(c), v);
}
#endif
template <class T, class C = less<typename T::value_type>>
void sort(T &a, C c = C()) {
sort(rang(a), c);
}
template <class T> void reve(T &a) { reverse(rang(a)); }
template <class T> void uniq(T &a) {
sort(a), a.erase(unique(rang(a)), end(a));
}
template <class T> void shuf(T &a) { shuffle(rang(a), rng); }
template <class T> void merg(T l, T m, T r) { inplace_merge(l, m, r); }
#if __cplusplus > 201103L
template <class T> auto vect(const T &v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T &v, int n, D... m) {
return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}
#endif
template <class F, class S> istream &operator>>(istream &s, pair<F, S> &a) {
return s >> a.first >> a.second;
}
template <class F, class S>
ostream &operator<<(ostream &s, const pair<F, S> &a) {
return s << a.first << " " << a.second;
}
template <class T> istream &operator>>(istream &s, vector<T> &a) {
for (int i = -1; i < 0 && (!a.size() && (cin >> i, a.resize(i), 0), i = 0),
i < int(a.size());)
s >> a[i++];
return s;
}
template <class T> ostream &operator<<(ostream &s, const vector<T> &a) {
lv(i, a) cout << a[i] << (i + 1 == int(a.size()) ? "" : " ");
return s;
}
template <class T> T in() {
T a;
cin >> a;
return a;
}
template <class T> void in(T &a) { cin >> a; }
template <class A, class... B> void in(A &a, B &...b) { cin >> a, in(b...); }
void ou() { cout << endl; }
template <class T> void ou(const T &a) { cout << a << endl; }
template <class A, class... B> void ou(const A &a, const B &...b) {
cout << a << ' ', ou(b...);
}
bool yep(const bool &a) { return ou(a ? "yes" : "no"), a; }
bool Yep(const bool &a) { return ou(a ? "Yes" : "No"), a; }
bool YEP(const bool &a) { return ou(a ? "YES" : "NO"), a; }
#if __cplusplus > 201103L
template <class T> struct func {
func(T &&t_) : t(forward<T>(t_)) {}
template <class... A> auto operator()(A &&...a) const {
return t(*this, forward<A>(a)...);
}
T t;
};
#endif
template <class T> struct hash_safe {};
template <> struct hash_safe<int> {
size_t operator()(unsigned long long a) const {
static unsigned long long d =
chrono::steady_clock::now().time_since_epoch().count();
a += d + 0x9e3779b97f4a7c15, a = (a ^ (a >> 30)) * 0xbf58476d1ce4e5b9;
a = (a ^ (a >> 27)) * 0x94d049bb133111eb;
return a ^ (a >> 31);
}
};
template <> struct hash_safe<long long> {
size_t operator()(unsigned long long a) const { return hash_safe<int>()(a); }
};
template <class A, class B> struct hash_safe<pair<A, B>> {
size_t operator()(pair<A, B> a) const {
auto h = hash_safe<A>()(a.first), g = hash_safe<B>()(a.second);
return (h >> 16 << 16) + (g >> 16);
}
};
template <class T> using unordered_set_safe = unordered_set<T, hash_safe<T>>;
template <class T>
using unordered_multiset_safe = unordered_multiset<T, hash_safe<T>>;
template <class K, class V>
using unordered_map_safe = unordered_map<K, V, hash_safe<K>>;
template <class K, class V>
using unordered_multimap_safe = unordered_multimap<K, V, hash_safe<K>>;
#define unordered_set unordered_set_safe
#define unordered_multiset unordered_multiset_safe
#define unordered_map unordered_map_safe
#define unordered_multimap unordered_multimap_safe
template <class T, class C = less<T>>
using bbst =
tree<T, null_type, C, rb_tree_tag, tree_order_statistics_node_update>;
template <class T, class C = greater<T>>
using heap = __gnu_pbds::priority_queue<T, C, pairing_heap_tag>;
using ll = long long;
using ld = long double;
using str = string;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vvi = vector<vi>;
// The templates end here.
int main() {
ios::sync_with_stdio(0);
cout << setprecision(16) << fixed;
cin.tie(0);
int n;
in(n);
vpii e(n - 1);
if (n != 1)
in(e);
ll ans = 0;
lp(r, 1, n) ans += ll(r) * (r + 1) / 2;
for (auto t : e) {
int u = t.first, v = t.second;
if (u > v)
swap(u, v);
ans -= ll(u) * (n - v + 1);
}
ou(ans);
return 0;
}
| replace | 188 | 189 | 188 | 190 | 0 | |
p02617 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, x, n) for (int i = x; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(X) (X).begin(), (X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
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;
}
template <class A, size_t N, class T> void Fill(A (&a)[N], const T &v) {
fill((T *)a, (T *)(a + N), v);
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &t) {
os << "{";
rep(i, t.size()) { os << t[i] << ","; }
os << "}";
return os;
}
template <class T, size_t n>
ostream &operator<<(ostream &os, const array<T, n> &t) {
os << "{";
rep(i, n) { os << t[i] << ","; }
os << "}";
return os;
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &t) {
return os << "(" << t.first << "," << t.second << ")";
}
const ll INF = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
ll N, ans = 0;
vector<pii> e;
int add[200005] = {};
cin >> N;
rep(i, N - 1) {
int u, v;
cin >> u >> v;
u--;
v--;
if (u > v)
swap(u, v);
e.emplace_back(u, v);
add[v]++;
}
sort(all(e));
reverse(all(e));
ll sum = 0, cur = 0;
rep(i, N) {
cur += 1 - add[i];
sum += cur;
}
ans += sum;
rep(i, N) {
sum -= (N - i);
while (e.back().X == i) {
sum += N - e.back().Y;
e.pop_back();
}
ans += sum;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, x, n) for (int i = x; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(X) (X).begin(), (X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
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;
}
template <class A, size_t N, class T> void Fill(A (&a)[N], const T &v) {
fill((T *)a, (T *)(a + N), v);
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &t) {
os << "{";
rep(i, t.size()) { os << t[i] << ","; }
os << "}";
return os;
}
template <class T, size_t n>
ostream &operator<<(ostream &os, const array<T, n> &t) {
os << "{";
rep(i, n) { os << t[i] << ","; }
os << "}";
return os;
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &t) {
return os << "(" << t.first << "," << t.second << ")";
}
const ll INF = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
ll N, ans = 0;
vector<pii> e;
int add[200005] = {};
cin >> N;
rep(i, N - 1) {
int u, v;
cin >> u >> v;
u--;
v--;
if (u > v)
swap(u, v);
e.emplace_back(u, v);
add[v]++;
}
sort(all(e));
reverse(all(e));
ll sum = 0, cur = 0;
rep(i, N) {
cur += 1 - add[i];
sum += cur;
}
ans += sum;
rep(i, N) {
sum -= (N - i);
while (!e.empty() && e.back().X == i) {
sum += N - e.back().Y;
e.pop_back();
}
ans += sum;
}
cout << ans << endl;
return 0;
} | replace | 84 | 85 | 84 | 85 | 0 | |
p02617 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
#define rep_1(i, m, n) for (int i = m; i <= n; i++)
#define mem(st) memset(st, 0, sizeof st)
inline int read() {
int num = 0, w = 0;
char ch = 0;
while (!isdigit(ch)) {
w |= ch == '-';
ch = getchar();
}
while (isdigit(ch)) {
num = (num << 3) + (num << 1) + (ch ^ 48);
ch = getchar();
}
return w ? -num : num;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
typedef pair<double, double> pdd;
const int inf = 0x3f3f3f3f;
const int N = 2e5 + 10;
void solve() {
ll n;
cin >> n;
ll ans = 0;
// for(ll i=0; i<=n; i++)
// ans+=(n-i)*(i+1);
for (ll i = 1; i <= n; i++)
for (int j = i; j <= n; j++)
ans += j - i + 1;
for (ll i = 1; i <= n - 1; i++) {
ll l, r;
cin >> l >> r;
if (l > r)
swap(l, r);
ans -= l * (n - r + 1);
}
cout << ans << endl;
}
signed main() {
int t = 1;
while (t--)
solve();
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
#define rep_1(i, m, n) for (int i = m; i <= n; i++)
#define mem(st) memset(st, 0, sizeof st)
inline int read() {
int num = 0, w = 0;
char ch = 0;
while (!isdigit(ch)) {
w |= ch == '-';
ch = getchar();
}
while (isdigit(ch)) {
num = (num << 3) + (num << 1) + (ch ^ 48);
ch = getchar();
}
return w ? -num : num;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
typedef pair<double, double> pdd;
const int inf = 0x3f3f3f3f;
const int N = 2e5 + 10;
void solve() {
ll n;
cin >> n;
ll ans = 0;
// for(ll i=0; i<=n; i++)
// ans+=(n-i)*(i+1);
for (ll i = 1; i <= n; i++) {
// for(int j=i;j<=n;j++)
// ans+=j-i+1;
ans += (i + n) * (n - i + 1) / 2 + (n - i + 1) - i * (n - i + 1);
}
for (ll i = 1; i <= n - 1; i++) {
ll l, r;
cin >> l >> r;
if (l > r)
swap(l, r);
ans -= l * (n - r + 1);
}
cout << ans << endl;
}
signed main() {
int t = 1;
while (t--)
solve();
return 0;
}
| replace | 41 | 44 | 41 | 46 | TLE | |
p02617 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int M = 1000000007;
signed main() {
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(0));
for (int i = 0; i < N - 1; i++) {
int n, m;
cin >> n >> m;
A[n - 1].push_back(m - 1);
A[m - 1].push_back(n - 1);
}
int ans = 0;
for (int i = 0; i < N; i++) {
int k = 0;
for (int j = i; j < N; j++) {
k++;
for (int n : A[j])
if (i <= n && n < j)
k--;
ans += k;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int M = 1000000007;
signed main() {
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(0));
for (int i = 0; i < N - 1; i++) {
int n, m;
cin >> n >> m;
A[n - 1].push_back(m - 1);
A[m - 1].push_back(n - 1);
}
int ans = 0, k = 0, l = 0;
vector<int> B(500);
for (int j = 0; j < N; j++) {
k += j + 1;
for (int n : A[j])
if (n < j)
l += n + 1;
ans += k - l;
}
cout << ans << endl;
} | replace | 14 | 24 | 14 | 22 | TLE | |
p02617 | C++ | Runtime Error | // https://atcoder.jp/contests/abc173/tasks/abc173_f
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, b, e) for (int i = (b); i <= (int)(e); i++)
#define DEBUG 1
#if DEBUG
#define _GLIBCXX_DEBUG
#define DUMP(a) \
REP(_i, a.size()) cout << a[_i] << (_i + 1 == a.size() ? "\n" : " ")
#define DUMP2D(b) \
REP(_j, b.size()) DUMP(b[_j]); \
cout << endl
#else
#define DUMP(a)
#define DUMP2D(b)
#endif
const int N_MAX = 2 * 1e5;
ll N;
vector<int> u;
vector<int> v;
int main() {
cin >> N;
u = vector<int>(N - 1);
v = vector<int>(N - 1);
REP(i, N - 1) cin >> u[i] >> v[i];
ll ans = (N * N * N + N * N * 3 + N * 2) / 6;
REP(i, N) {
ll a = min(u[i], v[i]);
ll b = max(u[i], v[i]);
ans -= a * (N - b + 1);
}
cout << ans << endl;
}
| // https://atcoder.jp/contests/abc173/tasks/abc173_f
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, b, e) for (int i = (b); i <= (int)(e); i++)
#define DEBUG 1
#if DEBUG
#define _GLIBCXX_DEBUG
#define DUMP(a) \
REP(_i, a.size()) cout << a[_i] << (_i + 1 == a.size() ? "\n" : " ")
#define DUMP2D(b) \
REP(_j, b.size()) DUMP(b[_j]); \
cout << endl
#else
#define DUMP(a)
#define DUMP2D(b)
#endif
const int N_MAX = 2 * 1e5;
ll N;
vector<int> u;
vector<int> v;
int main() {
cin >> N;
u = vector<int>(N - 1);
v = vector<int>(N - 1);
REP(i, N - 1) cin >> u[i] >> v[i];
ll ans = (N * N * N + N * N * 3 + N * 2) / 6;
REP(i, N - 1) {
ll a = min(u[i], v[i]);
ll b = max(u[i], v[i]);
ans -= a * (N - b + 1);
}
cout << ans << endl;
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p02617 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
pair<long long, long long> a[N];
long long n, seg[N], lazy[N];
vector<long long> adj[N];
void prop(long long idx, long long start, long long end) {
if (start > end)
return;
seg[idx] += lazy[idx] * (end - start + 1);
if (start != end) {
lazy[2 * idx + 1] += lazy[idx];
lazy[2 * idx + 2] += lazy[idx];
}
lazy[idx] = 0;
}
void upd(long long idx, long long start, long long end, long long l,
long long r, long long val) {
prop(idx, start, end);
if (start > end || start > r || end < l)
return;
else if (start >= l && end <= r) {
seg[idx] += (end - start + 1) * val;
if (start != end) {
lazy[2 * idx + 1] += val;
lazy[2 * idx + 2] += val;
}
} else {
long long mid = (start + end) / 2;
upd(2 * idx + 1, start, mid, l, r, val);
upd(2 * idx + 2, mid + 1, end, l, r, val);
seg[idx] = seg[2 * idx + 1] + seg[2 * idx + 2];
}
}
long long query(long long idx, long long start, long long end, long long l,
long long r) {
prop(idx, start, end);
if (start > end || start > r || end < l)
return 0;
else if (start >= l && end <= r)
return seg[idx];
else {
long long mid = (start + end) / 2;
long long ls = query(2 * idx + 1, start, mid, l, r);
long long rs = query(2 * idx + 2, mid + 1, end, l, r);
return (ls + rs);
}
}
bool cmp(pair<long long, long long> lhs, pair<long long, long long> rhs) {
return lhs.second < rhs.second;
}
int main(int argc, char const *argv[]) {
cin >> n;
for (long long i = 0; i < n - 1; ++i) {
long long u, v;
cin >> u >> v;
u--;
v--;
if (u > v)
swap(u, v);
adj[u].push_back(v);
a[i] = make_pair(u, v);
}
sort(a, a + n - 1, cmp);
long long j = 0;
for (long long i = 0; i < n; ++i) {
while (j < n - 1 && a[j].second <= i)
j++;
upd(0, 0, n - 1, i, i, i + 1 - j);
}
long long ans = query(0, 0, n - 1, 0, n - 1);
for (long long i = 1; i < n; ++i) {
upd(0, 0, n - 1, 0, n - 1, -1);
for (long long v : adj[i - 1])
upd(0, 0, n - 1, v, n - 1, 1);
ans = ans + 1LL * query(0, 0, n - 1, i, n - 1);
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
pair<long long, long long> a[N];
long long n, seg[4 * N], lazy[4 * N];
vector<long long> adj[N];
void prop(long long idx, long long start, long long end) {
if (start > end)
return;
seg[idx] += lazy[idx] * (end - start + 1);
if (start != end) {
lazy[2 * idx + 1] += lazy[idx];
lazy[2 * idx + 2] += lazy[idx];
}
lazy[idx] = 0;
}
void upd(long long idx, long long start, long long end, long long l,
long long r, long long val) {
prop(idx, start, end);
if (start > end || start > r || end < l)
return;
else if (start >= l && end <= r) {
seg[idx] += (end - start + 1) * val;
if (start != end) {
lazy[2 * idx + 1] += val;
lazy[2 * idx + 2] += val;
}
} else {
long long mid = (start + end) / 2;
upd(2 * idx + 1, start, mid, l, r, val);
upd(2 * idx + 2, mid + 1, end, l, r, val);
seg[idx] = seg[2 * idx + 1] + seg[2 * idx + 2];
}
}
long long query(long long idx, long long start, long long end, long long l,
long long r) {
prop(idx, start, end);
if (start > end || start > r || end < l)
return 0;
else if (start >= l && end <= r)
return seg[idx];
else {
long long mid = (start + end) / 2;
long long ls = query(2 * idx + 1, start, mid, l, r);
long long rs = query(2 * idx + 2, mid + 1, end, l, r);
return (ls + rs);
}
}
bool cmp(pair<long long, long long> lhs, pair<long long, long long> rhs) {
return lhs.second < rhs.second;
}
int main(int argc, char const *argv[]) {
cin >> n;
for (long long i = 0; i < n - 1; ++i) {
long long u, v;
cin >> u >> v;
u--;
v--;
if (u > v)
swap(u, v);
adj[u].push_back(v);
a[i] = make_pair(u, v);
}
sort(a, a + n - 1, cmp);
long long j = 0;
for (long long i = 0; i < n; ++i) {
while (j < n - 1 && a[j].second <= i)
j++;
upd(0, 0, n - 1, i, i, i + 1 - j);
}
long long ans = query(0, 0, n - 1, 0, n - 1);
for (long long i = 1; i < n; ++i) {
upd(0, 0, n - 1, 0, n - 1, -1);
for (long long v : adj[i - 1])
upd(0, 0, n - 1, v, n - 1, 1);
ans = ans + 1LL * query(0, 0, n - 1, i, n - 1);
}
cout << ans << '\n';
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02618 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (lint)(n); i++)
#define REP(i, n) for (int i = 1; i <= (lint)(n); i++)
#define all(V) V.begin(), V.end()
#define stackReplaceBegin(size) \
void *p = malloc(size); \
esp_new = (lint)p + size - 1; \
void *stack_extend_memory_ = malloc(size); \
void *stack_extend_origin_memory_; \
char *stack_extend_dummy_memory_ = (char *)alloca( \
(1 + (int)(((long long)stack_extend_memory_) & 127)) * 16); \
*stack_extend_dummy_memory_ = 0; \
asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp" \
: "=b"(stack_extend_origin_memory_) \
: "a"((char *)stack_extend_memory_ + (size)-1024));
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;
lint esp_new;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
inline lint gcd(lint a, lint b) {
while (b) {
lint c = a;
a = b;
b = c % b;
}
return a;
}
inline lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool isprime(lint n) {
if (n == 1)
return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
template <typename T> T mypow(T a, unsigned int b) {
T res(1), now(a);
while (b) {
if (b & 1)
res *= now;
b >>= 1;
now *= now;
}
return res;
}
template <typename T> void printArray(std::vector<T> &vec) {
rep(i, vec.size() - 1) std::cout << vec[i] << " ";
std::cout << vec.back() << std::endl;
}
template <typename T> void printArray(T l, T r) {
T rprev = r;
rprev--;
for (T i = l; i != rprev; i++) {
std::cout << *i << " ";
}
std::cout << *rprev << std::endl;
}
int D, c[27], s[370][27], ans[370];
int curscore;
std::set<int> st[27];
void change(int day, int contest) {
int x;
curscore -= s[day][ans[day]];
curscore += s[day][contest];
auto l = *--st[ans[day]].lower_bound(day);
auto r = *st[ans[day]].upper_bound(day);
x = day - l;
curscore += c[ans[day]] * x * (x - 1) / 2;
x = r - day;
curscore += c[ans[day]] * x * (x - 1) / 2;
x = r - l;
curscore -= c[ans[day]] * x * (x - 1) / 2;
l = *--st[contest].lower_bound(day);
r = *st[contest].upper_bound(day);
x = day - l;
curscore -= c[contest] * x * (x - 1) / 2;
x = r - day;
curscore -= c[contest] * x * (x - 1) / 2;
x = r - l;
curscore += c[contest] * x * (x - 1) / 2;
st[ans[day]].erase(day);
st[contest].insert(day);
ans[day] = contest;
}
int main() {
freopen("sample.txt", "r", stdin);
freopen("out.txt", "w", stdout);
std::random_device rd;
std::mt19937 mt(rd());
scanf("%d", &D);
REP(i, 26) scanf("%d", c + i);
REP(i, D) { REP(j, 26) scanf("%d", &s[i][j]); }
REP(i, 26) {
st[i].insert(0);
st[i].insert(D + 1);
}
int last[27] = {};
REP(i, D) {
int max = -INF, cand;
REP(j, 26) {
int cnt = s[i][j];
REP(k, 26) {
if (j != k)
cnt -= c[k] * (i - last[k]);
}
if (chmax(max, cnt))
cand = j;
}
ans[i] = cand;
st[cand].insert(i);
last[cand] = i;
curscore += max;
}
time_t time = clock();
while ((clock() - time) <= 1.98 * CLOCKS_PER_SEC) {
int prevscore = curscore;
if (mt() % 4) {
int day, contest, prevcontest;
day = mt() % D + 1;
contest = mt() % 26 + 1;
prevcontest = ans[day];
change(day, contest);
if (curscore < prevscore) {
change(day, prevcontest);
}
} else {
int day = D, contest;
while (day == D)
day = mt() % D + 1;
int w = mt() % (D - day) + 1;
contest = ans[day];
change(day, ans[day + w]);
change(day + w, contest);
if (curscore < prevscore) {
change(day + w, ans[day]);
change(day, contest);
}
}
}
REP(i, D) std::cout << ans[i] << std::endl;
// std::cout<<curscore<<std::endl;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (lint)(n); i++)
#define REP(i, n) for (int i = 1; i <= (lint)(n); i++)
#define all(V) V.begin(), V.end()
#define stackReplaceBegin(size) \
void *p = malloc(size); \
esp_new = (lint)p + size - 1; \
void *stack_extend_memory_ = malloc(size); \
void *stack_extend_origin_memory_; \
char *stack_extend_dummy_memory_ = (char *)alloca( \
(1 + (int)(((long long)stack_extend_memory_) & 127)) * 16); \
*stack_extend_dummy_memory_ = 0; \
asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp" \
: "=b"(stack_extend_origin_memory_) \
: "a"((char *)stack_extend_memory_ + (size)-1024));
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;
lint esp_new;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
inline lint gcd(lint a, lint b) {
while (b) {
lint c = a;
a = b;
b = c % b;
}
return a;
}
inline lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool isprime(lint n) {
if (n == 1)
return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
template <typename T> T mypow(T a, unsigned int b) {
T res(1), now(a);
while (b) {
if (b & 1)
res *= now;
b >>= 1;
now *= now;
}
return res;
}
template <typename T> void printArray(std::vector<T> &vec) {
rep(i, vec.size() - 1) std::cout << vec[i] << " ";
std::cout << vec.back() << std::endl;
}
template <typename T> void printArray(T l, T r) {
T rprev = r;
rprev--;
for (T i = l; i != rprev; i++) {
std::cout << *i << " ";
}
std::cout << *rprev << std::endl;
}
int D, c[27], s[370][27], ans[370];
int curscore;
std::set<int> st[27];
void change(int day, int contest) {
int x;
curscore -= s[day][ans[day]];
curscore += s[day][contest];
auto l = *--st[ans[day]].lower_bound(day);
auto r = *st[ans[day]].upper_bound(day);
x = day - l;
curscore += c[ans[day]] * x * (x - 1) / 2;
x = r - day;
curscore += c[ans[day]] * x * (x - 1) / 2;
x = r - l;
curscore -= c[ans[day]] * x * (x - 1) / 2;
l = *--st[contest].lower_bound(day);
r = *st[contest].upper_bound(day);
x = day - l;
curscore -= c[contest] * x * (x - 1) / 2;
x = r - day;
curscore -= c[contest] * x * (x - 1) / 2;
x = r - l;
curscore += c[contest] * x * (x - 1) / 2;
st[ans[day]].erase(day);
st[contest].insert(day);
ans[day] = contest;
}
int main() {
// freopen("sample.txt","r",stdin);
// freopen("out.txt","w",stdout);
std::random_device rd;
std::mt19937 mt(rd());
scanf("%d", &D);
REP(i, 26) scanf("%d", c + i);
REP(i, D) { REP(j, 26) scanf("%d", &s[i][j]); }
REP(i, 26) {
st[i].insert(0);
st[i].insert(D + 1);
}
int last[27] = {};
REP(i, D) {
int max = -INF, cand;
REP(j, 26) {
int cnt = s[i][j];
REP(k, 26) {
if (j != k)
cnt -= c[k] * (i - last[k]);
}
if (chmax(max, cnt))
cand = j;
}
ans[i] = cand;
st[cand].insert(i);
last[cand] = i;
curscore += max;
}
time_t time = clock();
while ((clock() - time) <= 1.98 * CLOCKS_PER_SEC) {
int prevscore = curscore;
if (mt() % 4) {
int day, contest, prevcontest;
day = mt() % D + 1;
contest = mt() % 26 + 1;
prevcontest = ans[day];
change(day, contest);
if (curscore < prevscore) {
change(day, prevcontest);
}
} else {
int day = D, contest;
while (day == D)
day = mt() % D + 1;
int w = mt() % (D - day) + 1;
contest = ans[day];
change(day, ans[day + w]);
change(day + w, contest);
if (curscore < prevscore) {
change(day + w, ans[day]);
change(day, contest);
}
}
}
REP(i, D) std::cout << ans[i] << std::endl;
// std::cout<<curscore<<std::endl;
return 0;
} | replace | 142 | 144 | 142 | 144 | -8 | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ld = long double;
#define repd(i, a, b) for (int i = a; i < int(b); i++)
#define rep(i, n) repd(i, 0, n)
#define VARNAME(v) #v
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
constexpr int BEAM = 600;
int d;
vector<int> c(26);
cin >> d;
rep(i, 26) cin >> c[i];
vector<array<int, 26>> s(d);
rep(i, d) rep(j, 26) cin >> s[i][j];
vector<int> curs = {0};
vector<array<int, 26>> curl(1);
vector<vector<int>> cura(1);
rep(i, d) {
int len = int(curs.size()) * 26, ind = 0;
vector<P> nxs(len);
vector<array<int, 26>> nxl(len);
vector<vector<int>> nxa(len);
rep(j, curs.size()) {
rep(t, 26) {
int score = curs[j];
array<int, 26> last = curl[j];
vector<int> ans = cura[j];
score += s[i][t];
last[t] = i + 1;
rep(k, 26) score -= c[k] * (i + 1 - last[k]);
ans.emplace_back(t);
nxs[ind] = P(score, ind);
nxl[ind] = last;
nxa[ind] = ans;
ind++;
}
}
sort(nxs.rbegin(), nxs.rend());
len = min(len, BEAM);
curs.resize(len);
curl.resize(len);
cura.resize(len);
rep(j, len) {
curs[j] = nxs[j].first;
curl[j] = nxl[nxs[j].second];
cura[j] = nxa[nxs[j].second];
}
}
int ans = 0;
rep(i, min(int(curs.size()), BEAM)) {
if (curs[ans] < curs[i])
ans = i;
}
for (auto x : cura[ans]) {
cout << x + 1 << endl;
}
}
| #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ld = long double;
#define repd(i, a, b) for (int i = a; i < int(b); i++)
#define rep(i, n) repd(i, 0, n)
#define VARNAME(v) #v
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
constexpr int BEAM = 510;
int d;
vector<int> c(26);
cin >> d;
rep(i, 26) cin >> c[i];
vector<array<int, 26>> s(d);
rep(i, d) rep(j, 26) cin >> s[i][j];
vector<int> curs = {0};
vector<array<int, 26>> curl(1);
vector<vector<int>> cura(1);
rep(i, d) {
int len = int(curs.size()) * 26, ind = 0;
vector<P> nxs(len);
vector<array<int, 26>> nxl(len);
vector<vector<int>> nxa(len);
rep(j, curs.size()) {
rep(t, 26) {
int score = curs[j];
array<int, 26> last = curl[j];
vector<int> ans = cura[j];
score += s[i][t];
last[t] = i + 1;
rep(k, 26) score -= c[k] * (i + 1 - last[k]);
ans.emplace_back(t);
nxs[ind] = P(score, ind);
nxl[ind] = last;
nxa[ind] = ans;
ind++;
}
}
sort(nxs.rbegin(), nxs.rend());
len = min(len, BEAM);
curs.resize(len);
curl.resize(len);
cura.resize(len);
rep(j, len) {
curs[j] = nxs[j].first;
curl[j] = nxl[nxs[j].second];
cura[j] = nxa[nxs[j].second];
}
}
int ans = 0;
rep(i, min(int(curs.size()), BEAM)) {
if (curs[ans] < curs[i])
ans = i;
}
for (auto x : cura[ans]) {
cout << x + 1 << endl;
}
}
| replace | 15 | 16 | 15 | 16 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.