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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03061 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
template <class T, class F> struct segment_tree {
std::vector<T> data;
int n;
F f;
T identity;
segment_tree() {}
segment_tree(int sz, T ide, F _f) : f(_f), identity(ide) {
n = 1;
while (n < sz)
n <<= 1;
data.resize(2 * n, identity);
}
segment_tree(std::vector<T> const &v, T ide, F _f) : f(_f), identity(ide) {
build(v);
}
void build(std::vector<T> const &v) {
int sz = v.size();
n = 1;
while (n < sz)
n <<= 1;
data.resize(2 * n, identity);
for (int i = 0; i < sz; ++i)
data[i + n] = v[i];
for (int i = n - 1; i > 0; --i)
data[i] = f(data[i << 1 | 0], data[i << 1 | 1]);
}
void set(int i, T x) {
i += n;
data[i] = x;
while (i, i >>= 1)
data[i] = f(data[i << 1 | 0], data[i << 1 | 1]);
}
T query(int l, int r) const {
l += n, r += n;
T x = identity;
while (l < r) {
if (l & 1)
x = f(x, data[l++]);
if (r & 1)
x = f(x, data[--r]);
l >>= 1, r >>= 1;
}
return x;
}
T operator[](int i) const { return data[i + n]; }
};
template <class T, class F> auto make_segtree(int n, T ide, F f) {
return segment_tree<T, F>(n, ide, f);
}
template <class T, class F>
auto make_segtree(std::vector<T> const &v, T ide, F f) {
return segment_tree<T, F>(v, ide, f);
}
signed main() {
int n;
cin >> n;
std::vector<int64_t> a(n);
for (auto &ai : a)
cin >> ai;
auto gcd = [](auto a, auto b) {
while (1) {
a %= b;
std::swap(a, b);
}
return a;
};
auto seg = make_segtree<int64_t>(a, 0, gcd);
int64_t ans = 1;
for (int i = 0; i < n; ++i) {
seg.set(i, 0);
ans = std::max(ans, seg.query(0, n));
seg.set(i, a[i]);
}
cout << (ans) << endl;
} | #include <iostream>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
template <class T, class F> struct segment_tree {
std::vector<T> data;
int n;
F f;
T identity;
segment_tree() {}
segment_tree(int sz, T ide, F _f) : f(_f), identity(ide) {
n = 1;
while (n < sz)
n <<= 1;
data.resize(2 * n, identity);
}
segment_tree(std::vector<T> const &v, T ide, F _f) : f(_f), identity(ide) {
build(v);
}
void build(std::vector<T> const &v) {
int sz = v.size();
n = 1;
while (n < sz)
n <<= 1;
data.resize(2 * n, identity);
for (int i = 0; i < sz; ++i)
data[i + n] = v[i];
for (int i = n - 1; i > 0; --i)
data[i] = f(data[i << 1 | 0], data[i << 1 | 1]);
}
void set(int i, T x) {
i += n;
data[i] = x;
while (i, i >>= 1)
data[i] = f(data[i << 1 | 0], data[i << 1 | 1]);
}
T query(int l, int r) const {
l += n, r += n;
T x = identity;
while (l < r) {
if (l & 1)
x = f(x, data[l++]);
if (r & 1)
x = f(x, data[--r]);
l >>= 1, r >>= 1;
}
return x;
}
T operator[](int i) const { return data[i + n]; }
};
template <class T, class F> auto make_segtree(int n, T ide, F f) {
return segment_tree<T, F>(n, ide, f);
}
template <class T, class F>
auto make_segtree(std::vector<T> const &v, T ide, F f) {
return segment_tree<T, F>(v, ide, f);
}
signed main() {
int n;
cin >> n;
std::vector<int64_t> a(n);
for (auto &ai : a)
cin >> ai;
auto gcd = [](auto a, auto b) {
while (b) {
a %= b;
std::swap(a, b);
}
return a;
};
auto seg = make_segtree<int64_t>(a, 0, gcd);
int64_t ans = 1;
for (int i = 0; i < n; ++i) {
seg.set(i, 0);
ans = std::max(ans, seg.query(0, n));
seg.set(i, a[i]);
}
cout << (ans) << endl;
} | replace | 68 | 69 | 68 | 69 | TLE | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> l(n);
vector<int> r(n);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
}
for (int i = 0; i < n; i++) {
r[i + 1] = gcd(r[i], a[n - i - 1]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int g = gcd(l[i], r[n - 1 - i]);
ans = max(ans, g);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> l(n + 1);
vector<int> r(n + 1);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
}
for (int i = 0; i < n; i++) {
r[i + 1] = gcd(r[i], a[n - i - 1]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int g = gcd(l[i], r[n - 1 - i]);
ans = max(ans, g);
}
cout << ans << endl;
}
| replace | 14 | 16 | 14 | 16 | 0 | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, double>;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> l(n), r(n);
rep(i, n) l[i + 1] = gcd(l[i], a[i]);
for (int i = n - 2; i >= 0; i--)
r[i] = gcd(r[i + 1], a[i + 1]);
int ans = 0;
rep(i, n) ans = max(ans, gcd(l[i], r[i]));
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, double>;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> l(n), r(n);
rep(i, n - 1) l[i + 1] = gcd(l[i], a[i]);
for (int i = n - 2; i >= 0; i--)
r[i] = gcd(r[i + 1], a[i + 1]);
int ans = 0;
rep(i, n) ans = max(ans, gcd(l[i], r[i]));
cout << ans << endl;
return 0;
} | replace | 26 | 27 | 26 | 27 | 0 | |
p03061 | C++ | Time Limit Exceeded | // qqqqqqHHMqqqqqHf!(:;jHmmkf``(:;jkqqqqqqqqqmMH#HMqqK_````````````````(kqqqqqqHMMM
// qqqqqqHHmqqqqH=` :;;jkqH=?~..;;jqqqqqqqqqmM#HM#MHH!````
// ```````..-``dqWbWkRqHMMM qqqqqqMHmqqqK!``.;;;dqH:
// ```.?TUqqHmqqqqmHHHM4Mqkt..```` ..JgHHW@P`.HHkqHHHqM#NN
// qqqqqmHMmqHTYWHgHmmgHR...``` :;Jkq9qqqqqgMH#1dHk$...-gW@HY"=!``dH!
// dHNmqqqqmM### qqqqqqgMmH[`````
// ?dHMMMHHHHHJ<;JkK>XqqqmMH#<+Hb%.WYYTHppf-````.gt`.HHMmmqqqmM###
// qqkqqqm@H?S,```` Jpbbpp:````
// :!dK<;JkqqMMY(;dW^````.ppbpf!```.Y<`.HHHMgmqqqmH### qqqqqqqqD``
// ````(ppbppW````` ~.f`:;jkqM#^.;jf!````.Wppbpf````````(HH#HmmqqmH#NN#
// qqqqqqqkP``````.fpbpbpf``` ` `.``~:;WHY``(+=``````Jppbpf\````
// ``.MH#HHgqqqmHNNNN qqqqqqqk]```` `,fpbbpf>```` `` ``_:<? ``.?!``` ``
// Wpppp%``` ``` dHH##HmmqqmH#### qqqqqqqk]``````,fpbppt``` `` `` `_~````` `` ``
// ```WppW=``` ````.HHHHMHmmqqmM#### qqqqqqqk$`` ````4ppfY```` `` `` `- `` `` ``
// ``` ``(T=`````` ``.MH##HMMmmqqmM##HH qqqqqqHqP``` ````?7!```` `` `` ``` `` `
// ` `` ````````` ` ````.MHH#HgMmqmqmHHHHH qqqkqqmkR```` ` `` ` `` ` ` `
// ``` ` ``` ` ......_. ```dH#HHgMqqgqqmH#HH NqqqqqHqR``` _ ........_` `` ```
// ``` ````` ``` ............```,HHHHmqqqHqqmMH## MmqqqqHqR``` _........_ `` ``
// ``` `` ` `` ` ` ` `__ ` ``,HHHMmmqqMHmmMHH# HMqqqqXkH `````````````` `
// `` ` `` `` `` `` `` ```` ````` ````.HHHMmMHm@HHqmMHH HHHmqqfHk;``` ` ` `` `
// ` `` ``` ` ` ``` `` `` `` ```` `..```.HHHHMMHMg@HHHHHMH HHMmmqMHkP<.`` ``` `
// ` ``` `` ``` ``` ` `` `` `` ` ```` ```.MH##HM#HMg@@@@H@HH
// ##HNmqR`jW<<_ ``` ````` `` ` ` ``` `` `` `` `` ```` `````
// .dHH##H#HHHMHH@@H@@@@ HH##NqH..X2:<<-.`` ` `` ``` ``` ` `` `` `` ` `` ` ``` `
// .gMHHH#H#HHH#HM@@H@@H@@H -WHHHNH[ =v._:::<-. ` `` ` `` ```````.`` `````````
//.MHH###H#MHHHHH@H@H@@HH@ ` 7MHHMH.l==. ~:::::<_-.. ````` ``````` `` ...uX;
//`,MHHHH#M@@MM@@@@@@H@@@@
// . TMHHbZl=1. _~::::::(<::<:<___-___:<<:::::jX3=. ` `
// `,MMHM@@@@Mg@@@@@@@@@H@
//
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, a, b) for (signed i = a; i < (b); ++i)
#define erep(i, a, b) for (signed i = a; i <= (b); ++i)
#define per(i, a, b) for (signed i = (a); i > (b); --i)
#define eper(i, a, b) for (signed i = (a); i >= b; --i)
#define fore(i, x, a) for (auto &&x : a)
#define ITR(i, b, e) for (auto i = (b); i != (e); ++i)
#define pb push_back
#define mp make_pair
#define ALL(x) begin(x), end(x)
#define F first
#define S second
#define debug(x) cout << #x << ": " << (x) << '\n';
const long long INF = 1001001001001001001;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
using namespace std;
using Pii = pair<int, int>;
using vii = vector<int>;
template <class T> using PS_queue = priority_queue<T, vector<T>, greater<T>>;
template <class T> using vv = vector<T>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
ITR(i, begin(v), end(v)) os << *i << (i == end(v) - 1 ? "" : " ");
return os;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
ITR(i, begin(v), end(v)) is >> *i;
return is;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
struct edge {
int from, to, cost;
};
int dy[] = {0, 1, -1, 0};
int dx[] = {1, 0, 0, -1};
// cout << fixed;
// cout << setprecision(10) << val;
int n;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vii a(n);
cin >> a;
map<int, int> m;
priority_queue<Pii> que;
rep(i, 0, n) {
for (int j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
m[j]++;
que.push({m[j], j});
if (j * j != a[i]) {
m[a[i] / j]++;
que.push({m[a[i] / j], a[i] / j});
}
}
}
}
while (que.top().F == n)
que.pop();
int ans = que.top().S;
int g = a[0];
rep(i, 0, n) { g = gcd(g, a[i]); }
chmax(ans, g);
cout << ans << endl;
return 0;
}
| // qqqqqqHHMqqqqqHf!(:;jHmmkf``(:;jkqqqqqqqqqmMH#HMqqK_````````````````(kqqqqqqHMMM
// qqqqqqHHmqqqqH=` :;;jkqH=?~..;;jqqqqqqqqqmM#HM#MHH!````
// ```````..-``dqWbWkRqHMMM qqqqqqMHmqqqK!``.;;;dqH:
// ```.?TUqqHmqqqqmHHHM4Mqkt..```` ..JgHHW@P`.HHkqHHHqM#NN
// qqqqqmHMmqHTYWHgHmmgHR...``` :;Jkq9qqqqqgMH#1dHk$...-gW@HY"=!``dH!
// dHNmqqqqmM### qqqqqqgMmH[`````
// ?dHMMMHHHHHJ<;JkK>XqqqmMH#<+Hb%.WYYTHppf-````.gt`.HHMmmqqqmM###
// qqkqqqm@H?S,```` Jpbbpp:````
// :!dK<;JkqqMMY(;dW^````.ppbpf!```.Y<`.HHHMgmqqqmH### qqqqqqqqD``
// ````(ppbppW````` ~.f`:;jkqM#^.;jf!````.Wppbpf````````(HH#HmmqqmH#NN#
// qqqqqqqkP``````.fpbpbpf``` ` `.``~:;WHY``(+=``````Jppbpf\````
// ``.MH#HHgqqqmHNNNN qqqqqqqk]```` `,fpbbpf>```` `` ``_:<? ``.?!``` ``
// Wpppp%``` ``` dHH##HmmqqmH#### qqqqqqqk]``````,fpbppt``` `` `` `_~````` `` ``
// ```WppW=``` ````.HHHHMHmmqqmM#### qqqqqqqk$`` ````4ppfY```` `` `` `- `` `` ``
// ``` ``(T=`````` ``.MH##HMMmmqqmM##HH qqqqqqHqP``` ````?7!```` `` `` ``` `` `
// ` `` ````````` ` ````.MHH#HgMmqmqmHHHHH qqqkqqmkR```` ` `` ` `` ` ` `
// ``` ` ``` ` ......_. ```dH#HHgMqqgqqmH#HH NqqqqqHqR``` _ ........_` `` ```
// ``` ````` ``` ............```,HHHHmqqqHqqmMH## MmqqqqHqR``` _........_ `` ``
// ``` `` ` `` ` ` ` `__ ` ``,HHHMmmqqMHmmMHH# HMqqqqXkH `````````````` `
// `` ` `` `` `` `` `` ```` ````` ````.HHHMmMHm@HHqmMHH HHHmqqfHk;``` ` ` `` `
// ` `` ``` ` ` ``` `` `` `` ```` `..```.HHHHMMHMg@HHHHHMH HHMmmqMHkP<.`` ``` `
// ` ``` `` ``` ``` ` `` `` `` ` ```` ```.MH##HM#HMg@@@@H@HH
// ##HNmqR`jW<<_ ``` ````` `` ` ` ``` `` `` `` `` ```` `````
// .dHH##H#HHHMHH@@H@@@@ HH##NqH..X2:<<-.`` ` `` ``` ``` ` `` `` `` ` `` ` ``` `
// .gMHHH#H#HHH#HM@@H@@H@@H -WHHHNH[ =v._:::<-. ` `` ` `` ```````.`` `````````
//.MHH###H#MHHHHH@H@H@@HH@ ` 7MHHMH.l==. ~:::::<_-.. ````` ``````` `` ...uX;
//`,MHHHH#M@@MM@@@@@@H@@@@
// . TMHHbZl=1. _~::::::(<::<:<___-___:<<:::::jX3=. ` `
// `,MMHM@@@@Mg@@@@@@@@@H@
//
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, a, b) for (signed i = a; i < (b); ++i)
#define erep(i, a, b) for (signed i = a; i <= (b); ++i)
#define per(i, a, b) for (signed i = (a); i > (b); --i)
#define eper(i, a, b) for (signed i = (a); i >= b; --i)
#define fore(i, x, a) for (auto &&x : a)
#define ITR(i, b, e) for (auto i = (b); i != (e); ++i)
#define pb push_back
#define mp make_pair
#define ALL(x) begin(x), end(x)
#define F first
#define S second
#define debug(x) cout << #x << ": " << (x) << '\n';
const long long INF = 1001001001001001001;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
using namespace std;
using Pii = pair<int, int>;
using vii = vector<int>;
template <class T> using PS_queue = priority_queue<T, vector<T>, greater<T>>;
template <class T> using vv = vector<T>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
ITR(i, begin(v), end(v)) os << *i << (i == end(v) - 1 ? "" : " ");
return os;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
ITR(i, begin(v), end(v)) is >> *i;
return is;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
struct edge {
int from, to, cost;
};
int dy[] = {0, 1, -1, 0};
int dx[] = {1, 0, 0, -1};
// cout << fixed;
// cout << setprecision(10) << val;
int n;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vii a(n);
cin >> a;
vii left(n + 1, 0), right(n + 1, 0);
rep(i, 0, n) left[i + 1] = gcd(left[i], a[i]);
eper(i, n - 1, 0) right[i] = gcd(right[i + 1], a[i]);
int ans = 0;
rep(i, 0, n) { chmax(ans, gcd(left[i], right[i + 1])); }
cout << ans << endl;
return 0;
}
| replace | 100 | 120 | 100 | 105 | TLE | |
p03061 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int main() {
int n, MAX = 0;
cin >> n;
vector<int> a(n), l(n), r(n);
a[0] = 0;
l[0] = 0;
r[n + 1] = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
l[i] = gcd(l[i - 1], a[i - 1]);
}
for (int i = n; i >= 0; i--) {
r[i] = gcd(r[i + 1], a[i + 1]);
}
for (int i = 0; i <= n; i++) {
if (MAX < gcd(l[i], r[i]))
MAX = gcd(l[i], r[i]);
}
cout << MAX << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int main() {
int n, MAX = 0;
cin >> n;
vector<int> a(n + 2), l(n + 2), r(n + 2);
a[0] = 0;
l[0] = 0;
r[n + 1] = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
l[i] = gcd(l[i - 1], a[i - 1]);
}
for (int i = n; i >= 0; i--) {
r[i] = gcd(r[i + 1], a[i + 1]);
}
for (int i = 0; i <= n; i++) {
if (MAX < gcd(l[i], r[i]))
MAX = gcd(l[i], r[i]);
}
cout << MAX << endl;
return 0;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
ll n;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ll u = pow(n, 0.5);
vector<ll> v;
ll now = a[0];
for (int i = 1; i < n; i++) {
if (i % u == 0) {
v.push_back(now);
now = a[i];
} else {
now = gcd(now, a[i]);
}
}
v.push_back(now);
// cout<<u;return 0;
// cout<<t[0]<<t[1]<<t[2];return 0;
ll ans = 0;
for (int i = 0; i < n; i++) {
ll y = i / u;
ll r;
if (y == 0)
r = v[1];
else
r = v[0];
for (int j = 0; j < v.size(); j++) {
if (j == y)
continue;
r = gcd(r, v[j]);
}
for (int j = y * u; j < y * u + u; j++) {
if (j == i)
continue;
r = gcd(r, a[j]);
}
ans = max(r, ans);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
ll n;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ll u = pow(n, 0.5);
vector<ll> v;
ll now = a[0];
for (int i = 1; i < n; i++) {
if (i % u == 0) {
v.push_back(now);
now = a[i];
} else {
now = gcd(now, a[i]);
}
}
v.push_back(now);
// cout<<u;return 0;
// cout<<t[0]<<t[1]<<t[2];return 0;
ll ans = 0;
for (int i = 0; i < n; i++) {
ll y = i / u;
ll r;
if (y == 0)
r = v[1];
else
r = v[0];
for (int j = 0; j < v.size(); j++) {
if (j == y)
continue;
r = gcd(r, v[j]);
}
for (int j = y * u; j < y * u + u; j++) {
if (j == i || j >= n)
continue;
r = gcd(r, a[j]);
}
ans = max(r, ans);
}
cout << ans << endl;
} | replace | 44 | 45 | 44 | 45 | 0 | |
p03061 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
int n, a[100000] = {0}, min = 1000000000, min2 = 1000000000;
scanf("%d", &n);
getchar();
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
getchar();
if (a[i] <= min) {
min2 = min;
min = a[i];
}
}
for (int i = min2; i >= 1; i--) {
int notcount = 0;
for (int j = 0; j < n; j++) {
if (a[j] % i != 0) {
notcount++;
}
if (notcount > 1) {
goto label;
}
}
if (notcount == 0 || notcount == 1) {
printf("%d\n", i);
return 0;
}
label : {}
}
return 0;
} | #include <stdio.h>
int main(void) {
int n, a[100000] = {0}, min = 1000000000, min2 = 1000000000;
scanf("%d", &n);
getchar();
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
getchar();
if (a[i] <= min) {
min2 = min;
min = a[i];
} else if (a[i] <= min2) {
min2 = a[i];
}
}
for (int i = min2; i >= 1; i--) {
int notcount = 0;
for (int j = 0; j < n; j++) {
if (a[j] % i != 0) {
notcount++;
}
if (notcount > 1) {
goto label;
}
}
if (notcount == 0 || notcount == 1) {
printf("%d\n", i);
return 0;
}
label : {}
}
return 0;
} | insert | 11 | 11 | 11 | 13 | TLE | |
p03061 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (a % b != 0) {
return gcd(b, a % b);
} else {
return b;
}
}
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 1; i < N + 1; ++i)
cin >> A[i];
vector<long long> left(N + 2), right(N);
left[0] = 0, left[1] = A[1];
right[N + 1] = 0, right[N] = A[N];
for (int i = 2; i < N + 1; ++i) {
left[i] = gcd(A[i], left[i - 1]);
right[(N + 1) - i] = gcd(A[(N + 1) - i], right[(N + 1) - i + 1]);
}
long long gcd_max = 0;
for (int i = 1; i < N + 1; ++i) {
int a;
if (left[i - 1] == 0)
a = right[i + 1];
else if (right[i + 1] == 0)
a = left[i - 1];
else
a = gcd(left[i - 1], right[i + 1]);
if (gcd_max < a)
gcd_max = a;
}
cout << gcd_max << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (a % b != 0) {
return gcd(b, a % b);
} else {
return b;
}
}
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 1; i < N + 1; ++i)
cin >> A[i];
vector<long long> left(N + 2), right(N + 2);
left[0] = 0, left[1] = A[1];
right[N + 1] = 0, right[N] = A[N];
for (int i = 2; i < N + 1; ++i) {
left[i] = gcd(A[i], left[i - 1]);
right[(N + 1) - i] = gcd(A[(N + 1) - i], right[(N + 1) - i + 1]);
}
long long gcd_max = 0;
for (int i = 1; i < N + 1; ++i) {
int a;
if (left[i - 1] == 0)
a = right[i + 1];
else if (right[i + 1] == 0)
a = left[i - 1];
else
a = gcd(left[i - 1], right[i + 1]);
if (gcd_max < a)
gcd_max = a;
}
cout << gcd_max << endl;
} | replace | 26 | 27 | 26 | 27 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
// 先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
// 最短経路の表 a(全部INFで初期化)
// 縦横 x,y
// 迷路 f
// スタートsx,sy
// ゴールgx,gy
// 文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
// 各頂点ごとにどこに辺が出てるかの表がc
// 各頂点ごとの色を表すV<int>(頂点数max)のcolorを用意する
// aはどこ塗るか、bは何で塗るかなので、(0,1,c)でよぶとおけ
V<int> color(205);
bool nibu_hantei(int a, int b, V<V<int>> c) {
color[a] = b;
fo(i, c[a].sz) {
if (b == color[c[a][i]])
return false;
if (color[c[a][i]] == 0 && !nibu_hantei(c[a][i], -b, c))
return false;
}
return true;
}
// aは頂点数
// nibu_hanteiの上にcolorを用意する
// 各頂点ごとにどこに辺が出てるかの表がc
bool renketujanai_nibu_hantei(int a, V<V<int>> c) {
fo(i, a) {
if (color[i] == 0) {
if (!nibu_hantei(i, 1, c))
return false;
}
}
return true;
}
signed main() {
int a;
cin >> a;
V<int> b(a);
fo(i, a) { cin >> b[i]; }
V<int> c(a), d(a);
c[0] = b[0];
fo(i, a - 1) { c[i + 1] = gcm(c[i], b[i + 1]); }
d[a - 1] = b[a - 1];
for (int i = a - 1; i >= 0; i--) {
d[i - 1] = gcm(d[i], b[i - 1]);
}
int e = max(c[a - 2], d[1]);
fo(i, a - 2) { e = max(e, gcm(c[i], d[i + 2])); }
cout << e << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
// 先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
// 最短経路の表 a(全部INFで初期化)
// 縦横 x,y
// 迷路 f
// スタートsx,sy
// ゴールgx,gy
// 文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
// 各頂点ごとにどこに辺が出てるかの表がc
// 各頂点ごとの色を表すV<int>(頂点数max)のcolorを用意する
// aはどこ塗るか、bは何で塗るかなので、(0,1,c)でよぶとおけ
V<int> color(205);
bool nibu_hantei(int a, int b, V<V<int>> c) {
color[a] = b;
fo(i, c[a].sz) {
if (b == color[c[a][i]])
return false;
if (color[c[a][i]] == 0 && !nibu_hantei(c[a][i], -b, c))
return false;
}
return true;
}
// aは頂点数
// nibu_hanteiの上にcolorを用意する
// 各頂点ごとにどこに辺が出てるかの表がc
bool renketujanai_nibu_hantei(int a, V<V<int>> c) {
fo(i, a) {
if (color[i] == 0) {
if (!nibu_hantei(i, 1, c))
return false;
}
}
return true;
}
signed main() {
int a;
cin >> a;
V<int> b(a);
fo(i, a) { cin >> b[i]; }
V<int> c(a), d(a);
c[0] = b[0];
fo(i, a - 1) { c[i + 1] = gcm(c[i], b[i + 1]); }
d[a - 1] = b[a - 1];
for (int i = a - 1; i > 0; i--) {
d[i - 1] = gcm(d[i], b[i - 1]);
}
int e = max(c[a - 2], d[1]);
fo(i, a - 2) { e = max(e, gcm(c[i], d[i + 2])); }
cout << e << endl;
} | replace | 369 | 370 | 369 | 370 | -6 | free(): invalid pointer
|
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
vector<ll> finddivisor(ll x) { // 整数xの約数が入ったvectorを返すよ(xを含む)
vector<ll> divisor;
for (ll i = 1; (i * i) <= x; i++) {
if (x % i == 0) {
divisor.push_back(i);
if (i * i != x) {
divisor.push_back(x / i);
} // 約数はペアを持つことを利用
}
}
sort(divisor.begin(), divisor.end());
// divisor.push_back(x);
return divisor;
}
int main() {
ll n, ans = 1;
cin >> n;
vector<ll> v(n), a, b;
for (ll i = 0; i < n; i++) {
cin >> v.at(i);
}
a = finddivisor(v.at(0));
b = finddivisor(v.at(1));
for (int i = 0; i < a.size(); i++) {
ll cnt = 0;
for (int j = 0; j < n; j++) {
if (v.at(j) % a.at(i) != 0) {
cnt++;
}
if (cnt >= 2) {
break;
}
}
if (cnt < 2) {
ans = max(ans, a.at(i));
}
}
for (int i = 0; i < a.size(); i++) {
ll cnt = 0;
for (int j = 0; j < n; j++) {
if (v.at(j) % b.at(i) != 0) {
cnt++;
}
if (cnt >= 2) {
break;
}
}
if (cnt < 2) {
ans = max(ans, b.at(i));
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
vector<ll> finddivisor(ll x) { // 整数xの約数が入ったvectorを返すよ(xを含む)
vector<ll> divisor;
for (ll i = 1; (i * i) <= x; i++) {
if (x % i == 0) {
divisor.push_back(i);
if (i * i != x) {
divisor.push_back(x / i);
} // 約数はペアを持つことを利用
}
}
sort(divisor.begin(), divisor.end());
// divisor.push_back(x);
return divisor;
}
int main() {
ll n, ans = 1;
cin >> n;
vector<ll> v(n), a, b;
for (ll i = 0; i < n; i++) {
cin >> v.at(i);
}
a = finddivisor(v.at(0));
b = finddivisor(v.at(1));
for (int i = 0; i < a.size(); i++) {
ll cnt = 0;
for (int j = 0; j < n; j++) {
if (v.at(j) % a.at(i) != 0) {
cnt++;
}
if (cnt >= 2) {
break;
}
}
if (cnt < 2) {
ans = max(ans, a.at(i));
}
}
for (int i = 0; i < b.size(); i++) {
ll cnt = 0;
for (int j = 0; j < n; j++) {
if (v.at(j) % b.at(i) != 0) {
cnt++;
}
if (cnt >= 2) {
break;
}
}
if (cnt < 2) {
ans = max(ans, b.at(i));
}
}
cout << ans << endl;
} | replace | 43 | 44 | 43 | 44 | 0 | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> P;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1000000007;
const double PI = 3.1415926535897932;
const ll INF = 10000000000;
/****** define constant end ********/
/****** define variable start ******/
ll n;
vl a;
/******* define variable end *******/
ll gcd(ll a, ll b) {
while (a && b) {
if (a >= b)
a %= b;
else
b %= a;
}
return a + b;
}
ll solve() {
cin >> n;
a.resize(n);
REP(i, n) { cin >> a[i]; }
vl l(n);
vl r(n);
l[0] = 0;
r[n] = 0;
vl m(n);
REP(j, n) { l[j + 1] = gcd(l[j], a[j]); }
for (ll j = n - 1; j >= 0; j--) {
r[j] = gcd(r[j + 1], a[j]);
}
REP(i, n) { m[i] = gcd(l[i], r[i + 1]); }
ll ans = 0;
REP(i, n) { ans = max(m[i], ans); }
cout << ans << endl;
return 0;
}
int main() {
// clock_t start = clock();
cout << std::fixed << std::setprecision(10);
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll end_solve = solve();
/*
clock_t end = clock();
const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC *
1000.0; printf("time %lf[ms]\n", time);
*/
return (int)end_solve;
}
| #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> P;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1000000007;
const double PI = 3.1415926535897932;
const ll INF = 10000000000;
/****** define constant end ********/
/****** define variable start ******/
ll n;
vl a;
/******* define variable end *******/
ll gcd(ll a, ll b) {
while (a && b) {
if (a >= b)
a %= b;
else
b %= a;
}
return a + b;
}
ll solve() {
cin >> n;
a.resize(n);
REP(i, n) { cin >> a[i]; }
vl l(n + 1);
vl r(n + 1);
l[0] = 0;
r[n] = 0;
vl m(n);
REP(j, n) { l[j + 1] = gcd(l[j], a[j]); }
for (ll j = n - 1; j >= 0; j--) {
r[j] = gcd(r[j + 1], a[j]);
}
REP(i, n) { m[i] = gcd(l[i], r[i + 1]); }
ll ans = 0;
REP(i, n) { ans = max(m[i], ans); }
cout << ans << endl;
return 0;
}
int main() {
// clock_t start = clock();
cout << std::fixed << std::setprecision(10);
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll end_solve = solve();
/*
clock_t end = clock();
const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC *
1000.0; printf("time %lf[ms]\n", time);
*/
return (int)end_solve;
}
| replace | 34 | 36 | 34 | 36 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03061 | C++ | Runtime Error | //
// Created on 2019-02-09.
//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define PB push_back
#define INF 1e9
#define MOD 1e9 + 7
#define EPS 1e-9
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N), l(N, 0), r(N, 0);
REP(i, N) { cin >> A[i]; }
for (int i = 0; i < N - 1; ++i)
l[i + 1] = gcd(l[i], A[i]);
for (int i = N - 1; i >= 1; --i)
r[i - 1] = gcd(r[i], A[i]);
ll ans = 1;
REP(i, N) ans = max(ans, gcd(l[i], r[i]));
cout << ans << endl;
return 0;
}
| //
// Created on 2019-02-09.
//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define PB push_back
#define INF 1e9
#define MOD 1e9 + 7
#define EPS 1e-9
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
ll gcd(ll a, ll b) {
if (b == 0)
return (a);
else
return (gcd(b, a % b));
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N), l(N, 0), r(N, 0);
REP(i, N) { cin >> A[i]; }
for (int i = 0; i < N - 1; ++i)
l[i + 1] = gcd(l[i], A[i]);
for (int i = N - 1; i >= 1; --i)
r[i - 1] = gcd(r[i], A[i]);
ll ans = 1;
REP(i, N) ans = max(ans, gcd(l[i], r[i]));
cout << ans << endl;
return 0;
}
| replace | 27 | 29 | 27 | 29 | -8 | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define dump(a) cerr << #a << " = " << (a) << "(L:" << __LINE__ << ")" << endl
void solve(long long N, std::vector<long long> A) {
map<long long, int> C;
rep(i, N) C[A[i]]++;
set<long long> S(A.begin(), A.end());
vector<long long> B(S.begin(), S.end());
N = B.size();
if (N == 1) {
cout << B[0] << endl;
} else {
long long ans = 0;
rep(i, N) {
if (C[B[i]] != 1)
continue;
long long tmp = B[i == 0];
rep(j, N) {
if (i == j)
continue;
tmp = __gcd(tmp, B[j]);
// if (tmp < ans) break;
}
ans = max(ans, tmp);
}
assert(ans);
cout << ans << endl;
}
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define dump(a) cerr << #a << " = " << (a) << "(L:" << __LINE__ << ")" << endl
void solve(long long N, std::vector<long long> A) {
map<long long, int> C;
rep(i, N) C[A[i]]++;
set<long long> S(A.begin(), A.end());
vector<long long> B(S.begin(), S.end());
N = B.size();
if (N == 1) {
cout << B[0] << endl;
} else {
long long ans = 0;
rep(i, N) ans = __gcd(ans, B[i]);
rep(i, N) {
if (C[B[i]] != 1)
continue;
long long tmp = B[i == 0];
rep(j, N) {
if (i == j)
continue;
tmp = __gcd(tmp, B[j]);
// if (tmp < ans) break;
}
ans = max(ans, tmp);
}
assert(ans);
cout << ans << endl;
}
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
| insert | 18 | 18 | 18 | 19 | 0 | |
p03061 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long> a(n), l(n), r(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i];
l[0] = 0;
r[n] = 0;
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
int j = n - 1 - i;
r[j] = gcd(r[j + 1], a[j]);
}
long res = 1;
for (int i = 0; i < n; i++) {
res = max(res, gcd(l[i], r[i + 1]));
}
cout << res << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long> a(n), l(n + 1), r(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i];
l[0] = 0;
r[n] = 0;
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
int j = n - 1 - i;
r[j] = gcd(r[j + 1], a[j]);
}
long res = 1;
for (int i = 0; i < n; i++) {
res = max(res, gcd(l[i], r[i + 1]));
}
cout << res << endl;
} | replace | 15 | 16 | 15 | 16 | -6 | free(): invalid pointer
|
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define scn(n) scanf("%d", &n)
#define scnll(n) scanf("%lld", &n)
#define scn2(n, m) scanf("%d%d", &n, &m)
#define scn3(n, m, w) scanf("%d%d%d", &n, &m, &w)
#define scn2ll(n, m) scanf("%lld%lld", &n, &m)
#define atoz(v) v.begin(), v.end()
#define ratoz(v) v.rbegin(), v.rend()
#define Fill(a, v) memset(a, v, sizeof(a))
#define sz(v) v.size()
#define fi first
#define se second
#define inf 1e9
#define pi acos(-1.0)
#define sqr(x) x *x
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define ten(n) (int)1e##n
#define tenll(n) (lli)1e##n
#define mod 1000000007
#define FastIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
/// priority_queue< int, vector< int >, greater< int > > minHeap;
void mor() {
cout << "NO";
exit(0);
}
int main() {
/// freopen("output.txt","w",stdout);
/// freopen("input.txt","r",stdin);
/// FastIO;
int n;
scn(n);
int a[n + 1];
for (int i = 1; i <= n; i++)
scn(a[i]);
vector<int> L(n + 3, 0), R(n + 3, 0);
for (int i = 1; i <= n; i++)
L[i] = __gcd(L[i - 1], a[i]);
for (int i = n; i; i--)
R[i] = __gcd(R[i + 1], a[i]);
int ans = L[n];
for (int i = 1; i <= n; i++) {
ans = max(ans, __gcd(R[i + 1], L[i - 1]));
}
cout << ans;
return main();
}
/// sin and cos expect input in radians not degrees. so use , sin(degrees * pi /
/// 180)
| #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define scn(n) scanf("%d", &n)
#define scnll(n) scanf("%lld", &n)
#define scn2(n, m) scanf("%d%d", &n, &m)
#define scn3(n, m, w) scanf("%d%d%d", &n, &m, &w)
#define scn2ll(n, m) scanf("%lld%lld", &n, &m)
#define atoz(v) v.begin(), v.end()
#define ratoz(v) v.rbegin(), v.rend()
#define Fill(a, v) memset(a, v, sizeof(a))
#define sz(v) v.size()
#define fi first
#define se second
#define inf 1e9
#define pi acos(-1.0)
#define sqr(x) x *x
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define ten(n) (int)1e##n
#define tenll(n) (lli)1e##n
#define mod 1000000007
#define FastIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
/// priority_queue< int, vector< int >, greater< int > > minHeap;
void mor() {
cout << "NO";
exit(0);
}
int main() {
/// freopen("output.txt","w",stdout);
/// freopen("input.txt","r",stdin);
/// FastIO;
int n;
scn(n);
int a[n + 1];
for (int i = 1; i <= n; i++)
scn(a[i]);
vector<int> L(n + 3, 0), R(n + 3, 0);
for (int i = 1; i <= n; i++)
L[i] = __gcd(L[i - 1], a[i]);
for (int i = n; i; i--)
R[i] = __gcd(R[i + 1], a[i]);
int ans = L[n];
for (int i = 1; i <= n; i++) {
ans = max(ans, __gcd(R[i + 1], L[i - 1]));
}
cout << ans;
return 0;
}
/// sin and cos expect input in radians not degrees. so use , sin(degrees * pi /
/// 180)
| replace | 72 | 73 | 72 | 73 | -11 | |
p03061 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
#define yes "Yes"
#define no "No"
typedef pair<int, int> P;
lint euclid(lint a, lint b) {
lint temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (b < 1)
return -1;
if (a % b == 0)
return b;
return euclid(b, a % b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
lint n;
cin >> n;
vector<lint> a(n);
REP(i, n) cin >> a[i];
vector<lint> l(n); // それより左のgcd
vector<lint> r(n); // それより右のgcd
l[0] = a[0]; // l0=a0
r[n - 1] = a[n - 1]; // ln-1=an-1
REP(i, n - 1) l[i + 1] = euclid(a[i + 1], l[i]); // 最初にl1 =gcd(a1, l0)
for (int i = n - 1; i >= 0; i--)
r[i - 1] = euclid(a[i - 1], r[i]); // 最初にln-2=gcd(al-2,ln-1)
/*
12 15 18
--------
12 3 3 l:そこより左の全てのgcd
3 3 18 r:そこより右の全てのgcd
*/
lint tmp = r[1];
FOR(i, 1, n - 1) { // tmp=a[i]以外のgcdを求め、ans=max(tmp)を求める
tmp =
max(tmp, euclid(l[i - 1],
r[i + 1])); // tmp=gcd(それより左のgcd,それより右のgcd)
}
tmp = max(tmp, l[n - 2]);
print(tmp);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
#define yes "Yes"
#define no "No"
typedef pair<int, int> P;
lint euclid(lint a, lint b) {
lint temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (b < 1)
return -1;
if (a % b == 0)
return b;
return euclid(b, a % b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
lint n;
cin >> n;
vector<lint> a(n);
REP(i, n) cin >> a[i];
vector<lint> l(n); // それより左のgcd
vector<lint> r(n); // それより右のgcd
l[0] = a[0]; // l0=a0
r[n - 1] = a[n - 1]; // ln-1=an-1
REP(i, n - 1) l[i + 1] = euclid(a[i + 1], l[i]); // 最初にl1 =gcd(a1, l0)
for (int i = n - 1; i > 0; i--)
r[i - 1] = euclid(a[i - 1], r[i]); // 最初にln-2=gcd(al-2,ln-1)
/*
12 15 18
--------
12 3 3 l:そこより左の全てのgcd
3 3 18 r:そこより右の全てのgcd
*/
lint tmp = r[1];
FOR(i, 1, n - 1) { // tmp=a[i]以外のgcdを求め、ans=max(tmp)を求める
tmp =
max(tmp, euclid(l[i - 1],
r[i + 1])); // tmp=gcd(それより左のgcd,それより右のgcd)
}
tmp = max(tmp, l[n - 2]);
print(tmp);
return 0;
} | replace | 45 | 46 | 45 | 46 | -6 | free(): invalid pointer
|
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define foreach(it, v) \
for (typeof(v.begin()) it = v.begin(); it != v.end(); ++it)
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
typedef unsigned int uint;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef set<int> si;
int N;
int A[10010];
int l[10010];
int r[10010];
int gcd(int x, int y) {
if (x < y)
swap(x, y);
while (y) {
x = x % y;
swap(x, y);
}
return x;
}
int main() {
scanf("%d", &N);
rep(i, N) { scanf("%d", &A[i]); }
l[0] = A[0];
for (int i = 1; i < N; ++i)
l[i] = gcd(l[i - 1], A[i]);
r[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; --i)
r[i] = gcd(r[i + 1], A[i]);
int ans = max(l[N - 2], r[1]);
for (int i = 1; i < N - 1; ++i)
ans = max(ans, gcd(l[i - 1], r[i + 1]));
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define foreach(it, v) \
for (typeof(v.begin()) it = v.begin(); it != v.end(); ++it)
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
typedef unsigned int uint;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef set<int> si;
int N;
int A[100010];
int l[100010];
int r[100010];
int gcd(int x, int y) {
if (x < y)
swap(x, y);
while (y) {
x = x % y;
swap(x, y);
}
return x;
}
int main() {
scanf("%d", &N);
rep(i, N) { scanf("%d", &A[i]); }
l[0] = A[0];
for (int i = 1; i < N; ++i)
l[i] = gcd(l[i - 1], A[i]);
r[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; --i)
r[i] = gcd(r[i + 1], A[i]);
int ans = max(l[N - 2], r[1]);
for (int i = 1; i < N - 1; ++i)
ans = max(ans, gcd(l[i - 1], r[i + 1]));
cout << ans << "\n";
return 0;
}
| replace | 21 | 24 | 21 | 24 | 0 | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int gcd(int x, int y) {
if (y == 0) {
return x;
} else if (x == 0) {
return y;
} else {
return gcd(y, x % y);
}
}
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> gcd_L(N), gcd_R(N + 1);
rep(i, N) { cin >> A[i]; }
gcd_L[0] = 0;
gcd_R[N] = 0;
// i番目をかえる
for (int i = 0; i < N; i++) {
gcd_L[i + 1] = gcd(A[i], gcd_L[i]);
}
for (int i = N - 1; i >= 0; i--) {
gcd_R[i] = gcd(A[i], gcd_R[i + 1]);
}
int ans = 0;
for (int i = 0; i < N; i++) {
ans = max(ans, gcd(gcd_L[i], gcd_R[i + 1]));
}
cout << ans << endl;
/*
rep(i,N){
cout << A[i] << " ";
}cout << endl;
*/
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int gcd(int x, int y) {
if (y == 0) {
return x;
} else if (x == 0) {
return y;
} else {
return gcd(y, x % y);
}
}
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> gcd_L(N + 3), gcd_R(N + 3);
rep(i, N) { cin >> A[i]; }
gcd_L[0] = 0;
gcd_R[N] = 0;
// i番目をかえる
for (int i = 0; i < N; i++) {
gcd_L[i + 1] = gcd(A[i], gcd_L[i]);
}
for (int i = N - 1; i >= 0; i--) {
gcd_R[i] = gcd(A[i], gcd_R[i + 1]);
}
int ans = 0;
for (int i = 0; i < N; i++) {
ans = max(ans, gcd(gcd_L[i], gcd_R[i + 1]));
}
cout << ans << endl;
/*
rep(i,N){
cout << A[i] << " ";
}cout << endl;
*/
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p03061 | C++ | Runtime Error | #pragma GCC optimize("O2,Ofast,inline,unroll-all-loops,-ffast-math")
#include <bits/stdc++.h>
#define pb(X) push_back(X)
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
using namespace std;
int n, a, b, c, d, q, ans;
int gcd(int a, int b) {
while (a && b) {
if (a > b) {
a %= b;
} else {
b %= a;
}
}
return max(a, b);
}
int main() {
INIT cin >> n;
vector<int> a(n);
vector<int> g1(n + 2), g2(n + 2);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
g1[i] = gcd(g1[i - 1], a[i]);
}
for (int i = n; i > 0; --i) {
g2[i] = gcd(g2[i + 1], a[i]);
}
for (int i = 1; i <= n; ++i) {
ans = max(ans, gcd(g1[i - 1], g2[i + 1]));
}
cout << ans;
return 0;
} | #pragma GCC optimize("O2,Ofast,inline,unroll-all-loops,-ffast-math")
#include <bits/stdc++.h>
#define pb(X) push_back(X)
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
using namespace std;
int n, a, b, c, d, q, ans;
int gcd(int a, int b) {
while (a && b) {
if (a > b) {
a %= b;
} else {
b %= a;
}
}
return max(a, b);
}
int main() {
INIT cin >> n;
vector<int> a(n + 1);
vector<int> g1(n + 2), g2(n + 2);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
g1[i] = gcd(g1[i - 1], a[i]);
}
for (int i = n; i > 0; --i) {
g2[i] = gcd(g2[i + 1], a[i]);
}
for (int i = 1; i <= n; ++i) {
ans = max(ans, gcd(g1[i - 1], g2[i + 1]));
}
cout << ans;
return 0;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p03061 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int gcd(int a, int b);
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int left, right, max_gcd = 0;
for (int n = 0; n < N; n++) {
left = 0;
right = 0;
for (int i = 0; i < n; i++)
left = gcd(left, A[i]);
for (int i = N - 1; i > n; i--)
right = gcd(right, A[i]);
max_gcd = max(max_gcd, gcd(left, right));
}
cout << max_gcd << endl;
}
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
| #include <iostream>
using namespace std;
int gcd(int a, int b);
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int left[N], right[N], max_gcd = 0;
left[0] = 0;
right[N - 1] = 0;
for (int i = 1; i < N; i++) {
left[i] = gcd(left[i - 1], A[i - 1]);
right[N - i - 1] = gcd(right[N - i], A[N - i]);
}
for (int i = 0; i < N; i++) {
max_gcd = max(max_gcd, gcd(left[i], right[i]));
}
cout << max_gcd << endl;
}
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
| replace | 11 | 20 | 11 | 20 | TLE | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = int(A); I < int(B); ++I)
#define FORR(I, A, B) for (ll I = int((B)-1); I >= int(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x, v) \
(lower_bound(x.begin(), x.end(), v) - x.begin()) // xi>=v x is sorted
#define POSU(x, v) \
(upper_bound(x.begin(), x.end(), v) - x.begin()) // xi>v x is sorted
#define NUM(x, v) (POSU(x, v) - POSL(x, v)) // x is sorted
#define REV(x) (reverse(x.begin(), x.end())) // reverse
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll c = gcd(a, b);
return ((a / c) * (b / c) * c);
} // saisyo kobaisu
#define NEXTP(x) next_permutation(x.begin(), x.end())
const ll INF = 1e18 + 7;
const ll MOD = 1e9 + 7;
class Seg_Tree {
public:
vector<int> dat;
int n;
void initsize(int n0) {
int k = 1;
while (1) {
if (n0 <= k) {
n = k;
dat.resize(2 * n - 1);
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = 1;
break;
}
k *= 2;
}
}
// i banme wo x nisuru
void update(int i, int x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2;
dat[i] = gcd(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
//[a,b)
int query0(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return dat[a + n - 1];
if (a <= l && r <= b)
return dat[k];
else {
int vl = query0(a, b, k * 2 + 1, l, (l + r) / 2);
int vr = query0(a, b, k * 2 + 2, (l + r) / 2, r);
return gcd(vl, vr);
}
}
// return min [a,b)
int query(int a, int b) { return query0(a, b, 0, 0, n); }
};
int main() {
int N;
cin >> N;
Seg_Tree sg;
sg.initsize(N);
FOR(i, 0, N) {
ll k;
cin >> k;
sg.update(i, k);
}
int ans = max(sg.query(1, N), sg.query(0, N - 1));
FOR(i, 0, N) {
int p = gcd(sg.query(0, i), sg.query(i + 1, N));
ans = max(ans, p);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = int(A); I < int(B); ++I)
#define FORR(I, A, B) for (ll I = int((B)-1); I >= int(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x, v) \
(lower_bound(x.begin(), x.end(), v) - x.begin()) // xi>=v x is sorted
#define POSU(x, v) \
(upper_bound(x.begin(), x.end(), v) - x.begin()) // xi>v x is sorted
#define NUM(x, v) (POSU(x, v) - POSL(x, v)) // x is sorted
#define REV(x) (reverse(x.begin(), x.end())) // reverse
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll c = gcd(a, b);
return ((a / c) * (b / c) * c);
} // saisyo kobaisu
#define NEXTP(x) next_permutation(x.begin(), x.end())
const ll INF = 1e18 + 7;
const ll MOD = 1e9 + 7;
class Seg_Tree {
public:
vector<int> dat;
int n;
void initsize(int n0) {
int k = 1;
while (1) {
if (n0 <= k) {
n = k;
dat.resize(2 * n - 1);
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = 1;
break;
}
k *= 2;
}
}
// i banme wo x nisuru
void update(int i, int x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2;
dat[i] = gcd(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
//[a,b)
int query0(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return dat[a + n - 1];
if (a <= l && r <= b)
return dat[k];
else {
int vl = query0(a, b, k * 2 + 1, l, (l + r) / 2);
int vr = query0(a, b, k * 2 + 2, (l + r) / 2, r);
return gcd(vl, vr);
}
}
// return min [a,b)
int query(int a, int b) { return query0(a, b, 0, 0, n); }
};
int main() {
int N;
cin >> N;
Seg_Tree sg;
sg.initsize(N);
FOR(i, 0, N) {
ll k;
cin >> k;
sg.update(i, k);
}
int ans = max(sg.query(1, N), sg.query(0, N - 1));
FOR(i, 1, N - 1) {
int p = gcd(sg.query(0, i), sg.query(i + 1, N));
ans = max(ans, p);
}
cout << ans << endl;
}
| replace | 86 | 87 | 86 | 87 | 0 | |
p03061 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
multiset<long> A;
long temp;
for (int i = 0; i < N; i++) {
cin >> temp;
A.insert(temp);
}
int count;
long j;
for (j = *(++A.begin()); j > 0; j--) {
count = 0;
for (auto a : A) {
if (a % j != 0)
count++;
}
if (count < 2)
break;
}
cout << j;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
multiset<long> A;
long temp;
for (int i = 0; i < N; i++) {
cin >> temp;
A.insert(temp);
}
int count;
long j;
for (j = *(++A.begin()); j > 0; j--) {
count = 0;
for (auto a : A) {
if (a % j != 0)
count++;
if (count > 1)
break;
}
if (count < 2)
break;
}
cout << j;
return 0;
} | insert | 19 | 19 | 19 | 21 | TLE | |
p03061 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define re return
#define ll long long
#define ull unsigned ll
#define ld long double
#define f first
#define s second
#define pi acos(-1)
#define oo (ll)1e9 + 8
#define OO 1e18
#define EPS 1e-9
#define Endl '\n'
#define all(v) (v).begin(), (v).end()
#define FX(n) fixed << setprecision(n)
#define mm(o, k) memset(o, k, sizeof o)
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
const int maxn = 20 + 5;
const int N = 1e4 + 5, M = N * 2;
ll a[maxn];
ll awl[maxn];
ll a5r[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = 1; i <= n; ++i)
awl[i] = __gcd(a[i], awl[i - 1]);
for (int i = n; i >= 1; --i)
a5r[i] = __gcd(a[i], a5r[i + 1]);
ll ans = awl[n];
for (int i = 0; i <= n; ++i)
ans = max(ans, __gcd(awl[i], a5r[i + 2]));
printf("%lld\n", ans);
re 0;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define re return
#define ll long long
#define ull unsigned ll
#define ld long double
#define f first
#define s second
#define pi acos(-1)
#define oo (ll)1e9 + 8
#define OO 1e18
#define EPS 1e-9
#define Endl '\n'
#define all(v) (v).begin(), (v).end()
#define FX(n) fixed << setprecision(n)
#define mm(o, k) memset(o, k, sizeof o)
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
const int maxn = 1e5 + 5;
const int N = 1e4 + 5, M = N * 2;
ll a[maxn];
ll awl[maxn];
ll a5r[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = 1; i <= n; ++i)
awl[i] = __gcd(a[i], awl[i - 1]);
for (int i = n; i >= 1; --i)
a5r[i] = __gcd(a[i], a5r[i + 1]);
ll ans = awl[n];
for (int i = 0; i <= n; ++i)
ans = max(ans, __gcd(awl[i], a5r[i + 2]));
printf("%lld\n", ans);
re 0;
} | replace | 18 | 19 | 18 | 19 | 0 | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define clr(a, x) memset(a, x, sizeof(a))
#define SZ(x) ((int)(x).size())
#define lson rt << 1
#define rson rt << 1 | 1
#define pb push_back
#define fi first
#define se second
#define what_is(x) cerr << #x << " " << x << endl;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T> inline void _read(T &x) { cin >> x; }
void R() {}
template <typename T, typename... U> void R(T &head, U &...tail) {
_read(head);
R(tail...);
}
template <typename T> inline void _write(const T &x) { cout << x << ' '; }
void W() { cout << endl; }
template <typename T, typename... U> void W(const T &head, const U &...tail) {
_write(head);
W(tail...);
}
void go();
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
go();
return 0;
}
/****************ackun*********************/
const int MAXN = 25;
int a[MAXN];
int bl[MAXN], br[MAXN];
void go() {
int n;
R(n);
rep(i, 1, n) { R(a[i]); }
bl[1] = a[1];
rep(i, 2, n) { bl[i] = __gcd(bl[i - 1], a[i]); }
br[n] = a[n];
per(i, n - 1, 1) { br[i] = __gcd(br[i + 1], a[i]); }
int ans = max(bl[n - 1], br[2]);
rep(i, 2, n - 1) { ans = max(ans, __gcd(bl[i - 1], br[i + 1])); }
W(ans);
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define clr(a, x) memset(a, x, sizeof(a))
#define SZ(x) ((int)(x).size())
#define lson rt << 1
#define rson rt << 1 | 1
#define pb push_back
#define fi first
#define se second
#define what_is(x) cerr << #x << " " << x << endl;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T> inline void _read(T &x) { cin >> x; }
void R() {}
template <typename T, typename... U> void R(T &head, U &...tail) {
_read(head);
R(tail...);
}
template <typename T> inline void _write(const T &x) { cout << x << ' '; }
void W() { cout << endl; }
template <typename T, typename... U> void W(const T &head, const U &...tail) {
_write(head);
W(tail...);
}
void go();
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
go();
return 0;
}
/****************ackun*********************/
const int MAXN = 1e5 + 10;
int a[MAXN];
int bl[MAXN], br[MAXN];
void go() {
int n;
R(n);
rep(i, 1, n) { R(a[i]); }
bl[1] = a[1];
rep(i, 2, n) { bl[i] = __gcd(bl[i - 1], a[i]); }
br[n] = a[n];
per(i, n - 1, 1) { br[i] = __gcd(br[i + 1], a[i]); }
int ans = max(bl[n - 1], br[2]);
rep(i, 2, n - 1) { ans = max(ans, __gcd(bl[i - 1], br[i + 1])); }
W(ans);
}
| replace | 38 | 39 | 38 | 39 | 0 | |
p03061 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int n;
cin >> n;
int a[100000];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int L[100000];
for (int i = 1; i < n; i++) {
L[0] = 0;
L[i] = gcd(L[i - 1], a[i - 1]);
}
int R[100000];
for (int i = n - 2; i >= 0; i--) {
R[n - 1] = 0;
R[i] = gcd(R[i + 1], a[i + 1]);
}
int M[100000];
int ans = 0;
for (int i = 0; i < n; i++) {
M[i] = gcd(L[i], R[i]);
ans = max(ans, M[i]);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return (gcd(b, a % b));
}
}
int main() {
int n;
cin >> n;
int a[100000];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int L[100000];
for (int i = 1; i < n; i++) {
L[0] = 0;
L[i] = gcd(L[i - 1], a[i - 1]);
}
int R[100000];
for (int i = n - 2; i >= 0; i--) {
R[n - 1] = 0;
R[i] = gcd(R[i + 1], a[i + 1]);
}
int M[100000];
int ans = 0;
for (int i = 0; i < n; i++) {
M[i] = gcd(L[i], R[i]);
ans = max(ans, M[i]);
}
cout << ans << endl;
return 0;
} | replace | 7 | 9 | 7 | 9 | -8 | |
p03061 | C++ | Runtime Error | // #define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>
namespace n91 {
using i8 = std::int_least8_t;
using i32 = std::int_least32_t;
using i64 = std::int_least64_t;
using u8 = std::uint_least8_t;
using u32 = std::uint_least32_t;
using u64 = std::uint_least64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
class rep {
const usize f, l;
public:
class itr {
friend rep;
usize i;
constexpr itr(const usize x) noexcept : i(x) {}
public:
void operator++() noexcept { ++i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
constexpr rep(const usize first, const usize last) noexcept
: f(first), l(last) {}
constexpr itr begin() const noexcept { return itr(f); }
constexpr itr end() const noexcept { return itr(l); }
};
class revrep {
const usize f, l;
public:
class itr {
friend revrep;
usize i;
constexpr itr(usize x) noexcept : i(x) {}
public:
void operator++() noexcept { --i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
constexpr itr begin() const noexcept { return itr(l); }
constexpr itr end() const noexcept { return itr(f); }
};
template <class T> using vec_alias = std::vector<T>;
template <class T> auto md_vec(const usize n, const T &value) {
return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) {
return a < b ? b - a : a - b;
}
} // namespace n91
#include <utility>
namespace n91 {
template <class T> T gcd(T m, T n) {
while (m %= n)
::std::swap(m, n);
return n;
}
} // namespace n91
#include <algorithm>
#include <iostream>
#include <utility>
namespace n91 {
void main_() {
usize n;
std::cin >> n;
u32 ans = 0;
std::vector<u32> a(n);
for (auto &e : a) {
std::cin >> e;
}
std::vector<u32> l(n + 1), r(n + 1);
l[0] = 0;
r[n] = 0;
for (const auto i : rep(0, n)) {
l[i + 1] = gcd(l[i], a[i]);
}
for (const auto i : revrep(0, n)) {
r[i] = gcd(r[i + 1], a[i]);
}
for (const auto i : rep(0, n)) {
ans = std::max(ans, gcd(l[i], r[i + 1]));
}
std::cout << ans << std::endl;
}
} // namespace n91
int main() {
n91::main_();
return 0;
}
| // #define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>
namespace n91 {
using i8 = std::int_least8_t;
using i32 = std::int_least32_t;
using i64 = std::int_least64_t;
using u8 = std::uint_least8_t;
using u32 = std::uint_least32_t;
using u64 = std::uint_least64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
class rep {
const usize f, l;
public:
class itr {
friend rep;
usize i;
constexpr itr(const usize x) noexcept : i(x) {}
public:
void operator++() noexcept { ++i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
constexpr rep(const usize first, const usize last) noexcept
: f(first), l(last) {}
constexpr itr begin() const noexcept { return itr(f); }
constexpr itr end() const noexcept { return itr(l); }
};
class revrep {
const usize f, l;
public:
class itr {
friend revrep;
usize i;
constexpr itr(usize x) noexcept : i(x) {}
public:
void operator++() noexcept { --i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
constexpr itr begin() const noexcept { return itr(l); }
constexpr itr end() const noexcept { return itr(f); }
};
template <class T> using vec_alias = std::vector<T>;
template <class T> auto md_vec(const usize n, const T &value) {
return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) {
return a < b ? b - a : a - b;
}
} // namespace n91
#include <utility>
namespace n91 {
template <class T> T gcd(T m, T n) {
if (n == 0) {
return m;
}
while (m %= n)
::std::swap(m, n);
return n;
}
} // namespace n91
#include <algorithm>
#include <iostream>
#include <utility>
namespace n91 {
void main_() {
usize n;
std::cin >> n;
u32 ans = 0;
std::vector<u32> a(n);
for (auto &e : a) {
std::cin >> e;
}
std::vector<u32> l(n + 1), r(n + 1);
l[0] = 0;
r[n] = 0;
for (const auto i : rep(0, n)) {
l[i + 1] = gcd(l[i], a[i]);
}
for (const auto i : revrep(0, n)) {
r[i] = gcd(r[i + 1], a[i]);
}
for (const auto i : rep(0, n)) {
ans = std::max(ans, gcd(l[i], r[i + 1]));
}
std::cout << ans << std::endl;
}
} // namespace n91
int main() {
n91::main_();
return 0;
}
| insert | 70 | 70 | 70 | 73 | -8 | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll euq_gcd(ll a, ll b) { return b ? euq_gcd(b, a % b) : a; }
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
for (ll i = 1; i <= N; i++)
cin >> A[i];
vector<ll> L(N), R(N + 2);
L[0] = R[N + 1] = 0;
for (ll i = 1; i <= N; i++) {
L[i] = euq_gcd(L[i - 1], A[i]);
R[N + 1 - i] = euq_gcd(R[N + 2 - i], A[N + 1 - i]);
}
ll max = -1;
for (ll i = 1; i <= N; i++) {
ll temp = euq_gcd(L[i - 1], R[i + 1]);
if (temp > max)
max = temp;
}
cout << max << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll euq_gcd(ll a, ll b) { return b ? euq_gcd(b, a % b) : a; }
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
for (ll i = 1; i <= N; i++)
cin >> A[i];
vector<ll> L(N), R(N + 2);
L[0] = R[N + 1] = 0;
for (ll i = 1; i < N; i++) {
L[i] = euq_gcd(L[i - 1], A[i]);
R[N + 1 - i] = euq_gcd(R[N + 2 - i], A[N + 1 - i]);
}
ll max = -1;
for (ll i = 1; i <= N; i++) {
ll temp = euq_gcd(L[i - 1], R[i + 1]);
if (temp > max)
max = temp;
}
cout << max << endl;
return 0;
} | replace | 16 | 17 | 16 | 17 | -6 | free(): invalid pointer
|
p03061 | C++ | Runtime Error | /**
* created: 13.05.2020 23:20:39
**/
#include <bits/stdc++.h>
#define int long long
const int INF = 1e18L + 5;
#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++)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> l(n), r(n);
for (int i = 0; i < n; i++)
l[i + 1] = __gcd(l[i], a[i]);
for (int i = n - 1; i > 0; i--)
r[i - 1] = __gcd(r[i], a[i]);
int ans = 0;
rep(i, n) ans = max(ans, __gcd(l[i], r[i]));
cout << ans << endl;
return 0;
} | /**
* created: 13.05.2020 23:20:39
**/
#include <bits/stdc++.h>
#define int long long
const int INF = 1e18L + 5;
#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++)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> l(n), r(n);
for (int i = 0; i < n - 1; i++)
l[i + 1] = __gcd(l[i], a[i]);
for (int i = n - 1; i > 0; i--)
r[i - 1] = __gcd(r[i], a[i]);
int ans = 0;
rep(i, n) ans = max(ans, __gcd(l[i], r[i]));
cout << ans << endl;
return 0;
} | replace | 20 | 21 | 20 | 21 | -6 | free(): invalid pointer
|
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define INF 1LL << 60
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, b, e) for (int i = (b); i <= (e); i++)
int N;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
/**
* 累積GCDの計算
* L[i] := GCD(A[0]..A[i-1])
* R[i] := GCD(A[i]..A[N-1])
*/
vi L, R;
int cumulativeGcd(vi A) {
L.resize(N + 1, 0);
R.resize(N + 1, 0);
for (int i = 0; i <= N; i++)
L[i + 1] = gcd(L[i], A[i]);
for (int i = N - 1; i >= 0; i--)
R[i] = gcd(R[i + 1], A[i]);
}
int main() {
cin >> N;
vi A(N);
REP(i, N) cin >> A[i];
cumulativeGcd(A);
int M = 0;
REP(i, N) { M = max(M, gcd(L[i], R[i + 1])); }
cout << M << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define INF 1LL << 60
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, b, e) for (int i = (b); i <= (e); i++)
int N;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
/**
* 累積GCDの計算
* L[i] := GCD(A[0]..A[i-1])
* R[i] := GCD(A[i]..A[N-1])
*/
vi L, R;
int cumulativeGcd(vi A) {
L.resize(N + 1, 0);
R.resize(N + 1, 0);
for (int i = 0; i < N; i++)
L[i + 1] = gcd(L[i], A[i]);
for (int i = N - 1; i >= 0; i--)
R[i] = gcd(R[i + 1], A[i]);
}
int main() {
cin >> N;
vi A(N);
REP(i, N) cin >> A[i];
cumulativeGcd(A);
int M = 0;
REP(i, N) { M = max(M, gcd(L[i], R[i + 1])); }
cout << M << endl;
return 0;
}
| replace | 26 | 27 | 26 | 27 | 0 | |
p03061 | C++ | Runtime Error | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <tuple>
#include <utility>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define vll vector<ll>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
vll a(n), l(n), r(n + 1), m(n);
rep(i, n) { cin >> a[i]; }
l[0] = 0;
r[n] = 0;
rep(i, n) { l[i + 1] = __gcd(l[i], a[i]); }
for (int i = n - 1; i >= 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
rep(i, n) { m[i] = __gcd(l[i], r[i + 1]); }
int max = 0;
rep(i, n) {
if (max < m[i]) {
max = m[i];
}
}
cout << max;
return 0;
}
| #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <tuple>
#include <utility>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define vll vector<ll>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
vll a(n), l(n), r(n + 1), m(n);
rep(i, n) { cin >> a[i]; }
l[0] = 0;
r[n] = 0;
rep(i, n - 1) { l[i + 1] = __gcd(l[i], a[i]); }
for (int i = n - 1; i >= 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
rep(i, n) { m[i] = __gcd(l[i], r[i + 1]); }
int max = 0;
rep(i, n) {
if (max < m[i]) {
max = m[i];
}
}
cout << max;
return 0;
}
| replace | 38 | 39 | 38 | 39 | -6 | free(): invalid pointer
|
p03061 | C++ | Runtime Error | /// mAAria
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <stdio.h>
#include <string>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define inf 1000000000
#define mod 1000000007
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep1(i, a, b) for (int i = a; i >= b; i--)
#define dmp(x) cerr << "line " << __LINE__ << " " << #x << ":" << x << endl
#define fs first
#define sc second
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define mt make_tuple
#define MAX 500000
#define K 30
int a[11111], pre[11111], suf[11111], ans;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++)
pre[i] = __gcd(pre[i - 1], a[i]);
for (int i = n; i >= 1; i--)
suf[i] = __gcd(suf[i + 1], a[i]);
for (int i = 1; i <= n; i++)
ans = max(ans, __gcd(pre[i - 1], suf[i + 1]));
cout << ans << endl;
return 0;
}
///....
| /// mAAria
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <stdio.h>
#include <string>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define inf 1000000000
#define mod 1000000007
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep1(i, a, b) for (int i = a; i >= b; i--)
#define dmp(x) cerr << "line " << __LINE__ << " " << #x << ":" << x << endl
#define fs first
#define sc second
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define mt make_tuple
#define MAX 500000
#define K 30
int a[111111], pre[111111], suf[111111], ans;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++)
pre[i] = __gcd(pre[i - 1], a[i]);
for (int i = n; i >= 1; i--)
suf[i] = __gcd(suf[i + 1], a[i]);
for (int i = 1; i <= n; i++)
ans = max(ans, __gcd(pre[i - 1], suf[i + 1]));
cout << ans << endl;
return 0;
}
///....
| replace | 27 | 28 | 27 | 28 | 0 | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<char, LL> P;
const LL mod = 998244353;
const LL LINF = 1LL << 62;
const int INF = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> ca(n + 1, 0), cb(n + 1, 0);
for (int i = 0; i <= n; i++) {
ca[i + 1] = __gcd(ca[i], a[i]);
}
for (int i = n; i >= 1; i--) {
cb[i - 1] = __gcd(cb[i], a[i - 1]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, __gcd(ca[i], cb[i + 1]));
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<char, LL> P;
const LL mod = 998244353;
const LL LINF = 1LL << 62;
const int INF = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> ca(n + 1, 0), cb(n + 1, 0);
for (int i = 0; i < n; i++) {
ca[i + 1] = __gcd(ca[i], a[i]);
}
for (int i = n; i >= 1; i--) {
cb[i - 1] = __gcd(cb[i], a[i - 1]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, __gcd(ca[i], cb[i + 1]));
}
cout << ans << endl;
return 0;
}
| replace | 23 | 24 | 23 | 24 | 0 | |
p03061 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> data(n);
for (int i = 0; i < n; i++) {
cin >> data[i];
}
sort(data.begin(), data.end());
for (long long i = data[1]; i > 0; i--) {
int c = 0;
for (int j = 0; j < n; j++) {
if (data[j] % i != 0)
c++;
}
if (c < 2) {
cout << i << endl;
return 0;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> data(n);
for (int i = 0; i < n; i++) {
cin >> data[i];
}
sort(data.begin(), data.end());
for (long long i = data[1]; i > 0; i--) {
int c = 0;
for (int j = 0; j < n; j++) {
if (data[j] % i != 0)
c++;
if (c == 2)
break;
}
if (c < 2) {
cout << i << endl;
return 0;
}
}
}
| insert | 16 | 16 | 16 | 18 | TLE | |
p03061 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (ll j = 0; j < N; ++j)
cin >> A[j];
vector<ll> cache(N);
cache[0] = A[1];
for (ll j = 1; j < N; ++j) {
cache[j] = A[0];
}
for (ll j = 1; j < N; ++j) {
for (ll k = 0; k < N; ++k) {
if (j != k)
cache[k] = gcd(cache[k], A[j]);
}
}
ll ans = cache[0];
for (ll j = 0; j < N; ++j) {
ans = max(ans, cache[j]);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (ll j = 0; j < N; ++j)
cin >> A[j];
vector<ll> cache(N);
cache[0] = A[1];
for (ll j = 1; j < N; ++j) {
cache[j] = A[0];
}
ll tmp = A[0];
for (ll j = 2; j < N; ++j) {
tmp = gcd(tmp, A[j - 1]);
cache[j] = tmp;
}
tmp = A[N - 1];
for (ll j = N - 2; j >= 0; --j) {
tmp = gcd(tmp, A[j + 1]);
cache[j] = gcd(cache[j], tmp);
}
ll ans = cache[0];
for (ll j = 0; j < N; ++j) {
ans = max(ans, cache[j]);
}
cout << ans << endl;
return 0;
}
| replace | 19 | 24 | 19 | 28 | TLE | |
p03061 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
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())
const ll MAX = 510000;
const ll MOD = 1000000007;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll N;
cin >> N;
vector<ll> a(N);
rep(i, N) cin >> a[i];
vector<ll> right(N);
vector<ll> left(N);
left[0] = a[0];
right[N - 2] = a[N - 1];
repn(i, N) { left[i] = gcd(left[i - 1], a[i]); }
for (ll i = N - 3; i >= 0; i--) {
right[i] = gcd(right[i + 1], a[i + 1]);
}
ll ans = 1;
ans = max(left[N - 2], right[0]);
rep(i, N) { ans = max(ans, gcd(left[i], right[i + 1])); }
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
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())
const ll MAX = 510000;
const ll MOD = 1000000007;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll N;
cin >> N;
vector<ll> a(N);
rep(i, N) cin >> a[i];
vector<ll> right(N + 2);
vector<ll> left(N + 2);
left[0] = a[0];
right[N - 2] = a[N - 1];
repn(i, N) { left[i] = gcd(left[i - 1], a[i]); }
for (ll i = N - 3; i >= 0; i--) {
right[i] = gcd(right[i + 1], a[i + 1]);
}
ll ans = 1;
ans = max(left[N - 2], right[0]);
rep(i, N) { ans = max(ans, gcd(left[i], right[i + 1])); }
cout << ans << endl;
}
| replace | 43 | 45 | 43 | 45 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03061 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n), l(n), r(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
l[i + 1] = gcd(l[i], a[i]);
for (int i = n - 1; i >= 1; i--)
r[i - 1] = gcd(r[i], a[i]);
int ans = 1;
for (int i = 0; i < n; i++) {
ans = max(ans, gcd(l[i], r[i]));
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n), l(n), r(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
l[i + 1] = gcd(l[i], a[i]);
for (int i = n - 1; i >= 1; i--)
r[i - 1] = gcd(r[i], a[i]);
int ans = 1;
for (int i = 0; i < n; i++) {
ans = max(ans, gcd(l[i], r[i]));
}
cout << ans << endl;
return 0;
} | replace | 6 | 8 | 6 | 8 | -8 | |
p03061 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
vector<int> tree;
int gcd(int a, int b) {
if (a == 0 || b == 0) {
return max(a, b);
}
int c;
c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int solve(int a, int b, int i, int l, int r) {
if (r <= a || b <= l) {
return 0;
}
if (a <= l && r <= b) {
return tree.at(i);
}
int x = solve(a, b, 2 * i + 1, l, (l + r) / 2);
int y = solve(a, b, 2 * i + 2, (l + r) / 2, r);
return gcd(x, y);
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int n = 1;
while (n < N) {
n >>= 1;
}
tree.resize(2 * n - 1, 0);
for (int i = 0; i < N; i++) {
tree.at(i + n - 1) = A.at(i);
}
for (int i = n - 2; i >= 0; i--) {
tree.at(i) = gcd(tree.at(2 * i + 1), tree.at(2 * i + 2));
}
int ans = 1;
for (int i = 0; i < N; i++) {
int x1 = solve(0, i, 0, 0, n);
int x2 = solve(i + 1, n, 0, 0, n);
ans = max(ans, gcd(x1, x2));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
vector<int> tree;
int gcd(int a, int b) {
if (a == 0 || b == 0) {
return max(a, b);
}
int c;
c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int solve(int a, int b, int i, int l, int r) {
if (r <= a || b <= l) {
return 0;
}
if (a <= l && r <= b) {
return tree.at(i);
}
int x = solve(a, b, 2 * i + 1, l, (l + r) / 2);
int y = solve(a, b, 2 * i + 2, (l + r) / 2, r);
return gcd(x, y);
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int n = 1;
while (n < N) {
n <<= 1;
}
tree.resize(2 * n - 1, 0);
for (int i = 0; i < N; i++) {
tree.at(i + n - 1) = A.at(i);
}
for (int i = n - 2; i >= 0; i--) {
tree.at(i) = gcd(tree.at(2 * i + 1), tree.at(2 * i + 2));
}
int ans = 1;
for (int i = 0; i < N; i++) {
int x1 = solve(0, i, 0, 0, n);
int x2 = solve(i + 1, n, 0, 0, n);
ans = max(ans, gcd(x1, x2));
}
cout << ans << endl;
}
| replace | 41 | 42 | 41 | 42 | TLE | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
vector<int> l(n), r(n);
for (int i = 0; i < n; i++)
l[i + 1] = gcd(a[i], l[i]);
for (int i = n - 1; i > 0; i--)
r[i - 1] = gcd(a[i], r[i]);
int ans = 1;
for (int i = 0; i < n; i++) {
int tmp = gcd(l[i], r[i]);
ans = max(ans, tmp);
}
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
vector<int> l(n), r(n);
for (int i = 0; i < n - 1; i++)
l[i + 1] = gcd(a[i], l[i]);
for (int i = n - 1; i > 0; i--)
r[i - 1] = gcd(a[i], r[i]);
int ans = 1;
for (int i = 0; i < n; i++) {
int tmp = gcd(l[i], r[i]);
ans = max(ans, tmp);
}
printf("%d\n", ans);
} | replace | 16 | 17 | 16 | 17 | 0 | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> l(N), r(N);
for (int i = 0; i < N - 1; ++i) {
l[i + 1] = gcd(l[i], a[i]);
}
for (int i = N - 1; i >= 1; ++i) {
r[i - 1] = gcd(r[i], a[i]);
}
int ans = 1;
for (int i = 0; i < N; ++i) {
ans = max(ans, gcd(l[i], r[i]));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> l(N), r(N);
for (int i = 0; i < N - 1; ++i) {
l[i + 1] = gcd(l[i], a[i]);
}
for (int i = N - 1; i >= 1; --i) {
r[i - 1] = gcd(r[i], a[i]);
}
int ans = 1;
for (int i = 0; i < N; ++i) {
ans = max(ans, gcd(l[i], r[i]));
}
cout << ans << endl;
} | replace | 20 | 21 | 20 | 21 | -11 | |
p03061 | C++ | Time Limit Exceeded | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
i64 n;
cin >> n;
vector<i64> a(n);
for (i64 i = 0; i < n; i++)
cin >> a[i];
i64 ans = 0;
for (i64 i = 0; i < n; i++) {
i64 tmp = a[(i == 0 ? 1 : 0)];
for (i64 j = 0; j < n; j++)
if (i != j)
tmp = __gcd(tmp, a[j]);
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
i64 n;
cin >> n;
vector<i64> a(n);
for (i64 i = 0; i < n; i++)
cin >> a[i];
vector<i64> suml(n), sumr(n);
suml[0] = a[0];
for (i64 i = 1; i < n; i++)
suml[i] = __gcd(suml[i - 1], a[i]);
sumr[n - 1] = a[n - 1];
for (i64 i = n - 2; 0 <= i; i--)
sumr[i] = __gcd(sumr[i + 1], a[i]);
i64 ans = max(suml[n - 2], sumr[1]);
for (i64 i = 1; i < n - 1; i++)
ans = max(ans, __gcd(suml[i - 1], sumr[i + 1]));
cout << ans << endl;
return 0;
}
| replace | 11 | 19 | 11 | 21 | TLE | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
const int mod = 1e9 + 7;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
signed main() {
int n;
cin >> n;
vi a;
REP(i, n) { a.PB(read()); }
vi l(n), r(n);
REP(i, n - 1) { l[i + 1] = gcd(l[i], a[i]); }
for (int i = n - 1; i <= 1; i--)
r[i - 1] = gcd(r[i], a[i]);
int ans = 1;
REP(i, n) { chmax(ans, gcd(l[i], r[i])); }
print(ans);
}
| #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
const int mod = 1e9 + 7;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
signed main() {
int n;
cin >> n;
vi a;
REP(i, n) { a.PB(read()); }
vi l(n), r(n);
REP(i, n - 1) { l[i + 1] = gcd(l[i], a[i]); }
for (int i = n - 1; i >= 1; i--)
r[i - 1] = gcd(r[i], a[i]);
int ans = 1;
REP(i, n) { chmax(ans, gcd(l[i], r[i])); }
print(ans);
}
| replace | 95 | 96 | 95 | 96 | 0 | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y % x == 0)
return x;
else
return gcd(y % x, x);
}
int main() {
int n, m, k;
m = 0;
cin >> n;
vector<int> li(n), l(n + 1, 0), r(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> li[i];
for (int i = 0; i < n; i++) {
l.at(i + 1) = gcd(li[i], l[i]);
r.at(n - i - 1) = gcd(li[n - 1 - i], r[n - i]);
}
for (int i = 0; i < n; i++) {
k = gcd(l[i], r[i + 1]);
if (k > m)
m = k;
}
cout << m << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
else
return gcd(y % x, x);
}
int main() {
int n, m, k;
m = 0;
cin >> n;
vector<int> li(n), l(n + 1, 0), r(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> li[i];
for (int i = 0; i < n; i++) {
l.at(i + 1) = gcd(li[i], l[i]);
r.at(n - i - 1) = gcd(li[n - 1 - i], r[n - i]);
}
for (int i = 0; i < n; i++) {
k = gcd(l[i], r[i + 1]);
if (k > m)
m = k;
}
cout << m << endl;
return 0;
} | replace | 4 | 6 | 4 | 6 | -8 | |
p03061 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n;
int a[10005];
int gcd1[10005];
int gcd2[10005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
gcd1[1] = a[1];
gcd2[n] = a[n];
for (int i = 2; i <= n; ++i)
gcd1[i] = __gcd(gcd1[i - 1], a[i]); // cout<<gcd1[i]<<" ";
// cout<<endl;
for (int i = n - 1; i >= 1; --i)
gcd2[i] = __gcd(gcd2[i + 1], a[i]); // cout<<gcd2[i]<<" ";
// cout<<endl;
gcd1[0] = gcd2[2];
gcd2[n + 1] = gcd1[n - 1];
int ans = 0;
for (int i = 1; i <= n; ++i)
ans = max(ans, __gcd(gcd1[i - 1], gcd2[i + 1]));
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
int gcd1[100005];
int gcd2[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
gcd1[1] = a[1];
gcd2[n] = a[n];
for (int i = 2; i <= n; ++i)
gcd1[i] = __gcd(gcd1[i - 1], a[i]); // cout<<gcd1[i]<<" ";
// cout<<endl;
for (int i = n - 1; i >= 1; --i)
gcd2[i] = __gcd(gcd2[i + 1], a[i]); // cout<<gcd2[i]<<" ";
// cout<<endl;
gcd1[0] = gcd2[2];
gcd2[n + 1] = gcd1[n - 1];
int ans = 0;
for (int i = 1; i <= n; ++i)
ans = max(ans, __gcd(gcd1[i - 1], gcd2[i + 1]));
printf("%d\n", ans);
return 0;
} | replace | 3 | 6 | 3 | 6 | 0 | |
p03062 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define isNum(a) (a >= '0' && a <= '9')
#define SP putchar(' ')
#define EL putchar('\n')
#define File(a) freopen(a ".in", "r", stdin), freopen(a ".out", "w", stdout)
template <class T> inline void read(T &);
template <class T> inline void write(const T &);
typedef long long ll;
typedef const long long &cll;
typedef const int &ci;
typedef std::pair<int, int> pii;
const int iinf = 2147483647;
const ll llinf = 9223372036854775807ll;
using std::abs;
using std::max;
using std::min;
using std::sort;
const int N = 50005;
ll dp[N][2];
int a[N];
int main() {
int n;
read(n);
for (int i = 1; i <= n; ++i) {
read(a[i]);
}
dp[1][0] = a[1];
dp[1][1] = -iinf;
for (int i = 2; i <= n; ++i) {
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]) + a[i];
dp[i][1] = max(dp[i - 1][0] - 2 * a[i - 1] - a[i],
dp[i - 1][1] + 2 * a[i - 1] - a[i]);
}
write(max(dp[n][0], dp[n][1])), EL;
return 0;
}
template <class T> void read(T &Re) {
T k = 0;
char ch = getchar();
int flag = 1;
while (!isNum(ch)) {
if (ch == '-') {
flag = -1;
}
ch = getchar();
}
while (isNum(ch)) {
k = (k << 1) + (k << 3) + ch - '0';
ch = getchar();
}
Re = flag * k;
}
template <class T> void write(const T &Wr) {
if (Wr < 0) {
putchar('-');
write(-Wr);
} else {
if (Wr < 10) {
putchar(Wr + '0');
} else {
write(Wr / 10);
putchar((Wr % 10) + '0');
}
}
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define isNum(a) (a >= '0' && a <= '9')
#define SP putchar(' ')
#define EL putchar('\n')
#define File(a) freopen(a ".in", "r", stdin), freopen(a ".out", "w", stdout)
template <class T> inline void read(T &);
template <class T> inline void write(const T &);
typedef long long ll;
typedef const long long &cll;
typedef const int &ci;
typedef std::pair<int, int> pii;
const int iinf = 2147483647;
const ll llinf = 9223372036854775807ll;
using std::abs;
using std::max;
using std::min;
using std::sort;
const int N = 100005;
ll dp[N][2];
int a[N];
int main() {
int n;
read(n);
for (int i = 1; i <= n; ++i) {
read(a[i]);
}
dp[1][0] = a[1];
dp[1][1] = -iinf;
for (int i = 2; i <= n; ++i) {
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]) + a[i];
dp[i][1] = max(dp[i - 1][0] - 2 * a[i - 1] - a[i],
dp[i - 1][1] + 2 * a[i - 1] - a[i]);
}
write(max(dp[n][0], dp[n][1])), EL;
return 0;
}
template <class T> void read(T &Re) {
T k = 0;
char ch = getchar();
int flag = 1;
while (!isNum(ch)) {
if (ch == '-') {
flag = -1;
}
ch = getchar();
}
while (isNum(ch)) {
k = (k << 1) + (k << 3) + ch - '0';
ch = getchar();
}
Re = flag * k;
}
template <class T> void write(const T &Wr) {
if (Wr < 0) {
putchar('-');
write(-Wr);
} else {
if (Wr < 10) {
putchar(Wr + '0');
} else {
write(Wr / 10);
putchar((Wr % 10) + '0');
}
}
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p03062 | C++ | Runtime Error | #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define FORQ(i, b, e) for (int i = (b); i <= (e); ++i)
#define FORD(i, b, e) for (int i = (b)-1; i >= (e); --i)
#define REP(x, n) for (int x = 0; x < (n); ++x)
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
#define pii pair<int, int>
#define pll pair<LL, LL>
#define vi vector<int>
#define vii vector<vi>
const double pi = 3.14159265358979323846264;
const int mod = 1000000007;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// std::cout << std::fixed;
// std::cout << std::setprecision(12);
// std::cout << std::defaultfloat;
int n;
cin >> n;
vector<int> a(n);
priority_queue<int> p;
priority_queue<int> ng;
LL ans = 0;
FOR(i, 0, n) {
cin >> a[i];
if (a[i] >= 0) {
p.push(-a[i]);
ans += a[i];
} else {
ng.push(a[i]);
ans += -a[i];
}
}
int sz = ng.size();
if (sz % 2 == 1) {
if (-p.top() > -ng.top()) {
ans -= -ng.top() * 2;
} else {
ans -= -p.top() * 2;
}
} else {
}
cout << ans;
return 0;
}
| #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define FORQ(i, b, e) for (int i = (b); i <= (e); ++i)
#define FORD(i, b, e) for (int i = (b)-1; i >= (e); --i)
#define REP(x, n) for (int x = 0; x < (n); ++x)
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
#define pii pair<int, int>
#define pll pair<LL, LL>
#define vi vector<int>
#define vii vector<vi>
const double pi = 3.14159265358979323846264;
const int mod = 1000000007;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// std::cout << std::fixed;
// std::cout << std::setprecision(12);
// std::cout << std::defaultfloat;
int n;
cin >> n;
vector<int> a(n);
priority_queue<int> p;
priority_queue<int> ng;
LL ans = 0;
FOR(i, 0, n) {
cin >> a[i];
if (a[i] >= 0) {
p.push(-a[i]);
ans += a[i];
} else {
ng.push(a[i]);
ans += -a[i];
}
}
int sz = ng.size();
if (sz % 2 == 1) {
if (p.empty()) {
ans -= -ng.top() * 2;
} else if (-p.top() > -ng.top()) {
ans -= -ng.top() * 2;
} else {
ans -= -p.top() * 2;
}
} else {
}
cout << ans;
return 0;
}
| replace | 67 | 68 | 67 | 70 | 0 | |
p03062 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = ll(1e9 + 7);
const ll INF = ll(1e18) + 7;
// repetition
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RREP(i, n) for (ll i = n; i != 0; i--)
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
unsigned getDigit(unsigned num) {
unsigned digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
return digit;
}
unsigned binarySearch(ll target, ll max, ll min) {
while ((max - min) > 1) {
if ((max + min) / 2 > target) {
max = (max + min) / 2;
min = min;
} else {
max = max;
min = (max + min) / 2;
}
}
}
void f(int rest, string s) {
char abc[] = "abc";
if (rest == 0) {
cout << s << endl;
} else {
for (int i = 0; i < 3; i++) {
f(rest - 1, s + abc[i]);
}
}
}
// origin (ox, oy) destination (dx, dy)
//
/*
ll dfs2(ll ox, ll oy, vector<vector<char>> v, vector<vector<int>> dist) {
int m = 0;
for (int i = 0; i < 4; i++) {
int nx = ox+dx[i], ny = oy + dy[i];
if(nx < 0 || nx >= w || ny < 0 || nx >= h) continue;
if(v[nx][ny] != '.') continue;
if(dist[nx][ny] == -1) {
dist[nx][ny] = dist[ox][oy] + 1;
dist[nx][ny] = min(dist[ox][oy], dist[nx][ny]);
cout << "v[nx][ny]: " << dist[nx][ny] << endl;
cout << "dx: " << dx << endl;
cout << "dy: " << dy << endl;
cout << "v[ox][oy]: " << v[ox][oy] << endl;
cout << "(nx, ny)" << "("<< nx << "," << ny << ")"<< endl;
dfs2(nx, ny, v, dist);
}
m = max(m, dist[nx][ny]);
}
return m;
}
int main() {
// n,m->size, k-> value
// vector<vector<ll>> a(n ,vector<ll>(m, k));
// vector
// vector<ll> s(n,0);
// vector<vector<ll>> v;
// map<ll,ll> m;
// priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>
pq;
// vector<pair<ll, ll>> epv(n, {0, 0});
// vector<vector<char>> v(h, vector<char>(w));
for(auto&& m: em) {
epv.push_back({ m.second, m.first });
}
ll n, k, a;
cin >> n >> k;
vector<ll> vp;
vector<ll> vn;
ll c = 0;
REP(i, n) {
cin >> a;
if(a >= 0 ) vp.push_back(a);
else vn.push_back(a);
}
sort(vp.begin(), vp.end());
sort(vn.begin(), vn.end());
ll ps = vp.size();
ll ns = vn.size();
cout << "k: " << k << endl;
cout << "ps: " << ps << endl;
cout << "ns: " << ns << endl;
if(k < ps * ns) {
ll m = k%ns;
ll d = k - (m+1);
cout << vn[m] * vp[d] << endl;
}else {
ll kd = k - ps*ns;
ll md = kd%ps;
ll dd = kd - md;
ll s = 0;
REP(i, ps) {
s = s+(ps-i-1);
cout << "s: " << s << endl;
cout << "kd: " << kd << endl;
cout << "s: " << s << endl;
cout << "kd: " << kd << endl;
cout << "i: " << i << endl;
if(s > kd) {
cout << "vp[i]: " << vp[i] << endl;
cout << "vp[ps-i]: " << vp[s-kd+i-1] << endl;
cout << vp[i] * vp[s-kd+i-1] << endl;
break;
}
}
}
}
ll h, w;
vector<vector<char>> v;
vector<ll> dx = {-1, 0, 1, 0};
vector<ll> dy = {0, -1, 0, 1};
ll bfs(ll ox, ll oy) {
vector<vector<ll>> vd(h, vector<ll>(w, -1));
queue<pair<ll, ll>> q;
q.push({ox, oy});
vd[oy][ox] = 0;
ll res = 0;
while(!q.empty()) {
pair<ll, ll> vn = q.front();
q.pop();
res = max(res, vd[vn.second][vn.first]);
for(ll i = 0; i < 4; i++){
ll nx = vn.first +dx[i];
ll ny = vn.second + dy[i];
if(nx < 0 || ny < 0 || nx >= w || ny >= h) continue;
if(v[ny][nx] == '#') continue;
if(vd[ny][nx] == -1) {
vd[ny][nx] = res + 1;
q.push({nx, ny});
}
}
}
return res;
}
bool kai(string s) {
bool flg = true;
ll n = s.size();
for(ll i=0; i<n/2; i++) {
if(s[i] == s[n-1 -i]){
flg = true;
} else {
flg = false;
break;
}
}
return flg;
}
*/
struct UnionFind {
vector<ll> par;
map<ll, ll> s;
UnionFind(ll n) : par(n) {
REP(i, n) {
par[i] = i;
s[i]++;
}
}
ll root(ll x) {
if (par[x] == x)
return x;
return root(par[x]);
}
void unite(ll x, ll y) {
ll rx = root(x);
ll ry = root(y);
if (rx == ry)
return;
if (size(rx) > size(ry)) {
s[rx] = s[rx] + s[ry];
par[root(y)] = rx;
} else {
s[ry] = s[ry] + s[rx];
par[root(x)] = ry;
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return s[root(x)]; }
};
ll mod_pow(ll base, ll exp, ll mod) {
if (exp == 1)
return base % mod;
if (exp % 2 == 1)
return (base * mod_pow(base, exp - 1, mod)) % mod;
ll t = mod_pow(base, exp / 2, mod);
return (t * t) % mod;
}
// nPr
ll mod_permutation(ll n, ll r) {
ll t = 1;
while (r != 0) {
t = (t % MOD) * (n % MOD);
n--;
r--;
}
return t;
}
ll mod_factorial(ll r) {
ll v = 1;
while (r != 0) {
v = (v % MOD) * (r % MOD);
r--;
}
return v;
}
deque<ll> prime_factorization(ll n) {
vector<ll> P;
ll nn = sqrt(n) + 2;
vector<ll> prime(nn, true);
for (ll i = 2; i <= nn; i++) {
if (prime[i]) {
for (ll j = 2 * i; j <= nn; j += i) {
prime[j] = false;
}
P.emplace_back(i);
}
}
deque<ll> d;
REP(i, P.size()) {
while (n % P[i] == 0) {
d.push_back(P[i]);
n /= P[i];
}
}
if (n > nn)
d.push_back(n);
return d;
}
struct Node {
vector<ll> edges;
vector<ll> costs;
bool done;
ll cost;
friend bool operator<(const Node &lhs, const Node &rhs) {
return rhs.cost < lhs.cost;
}
};
ll mod_conb() {
//((p%MOD)*(mod_pow(k, MOD-2)%MOD)*(mod_pow(ki, MOD-2)%MOD))%MOD
}
vector<vector<ll>> vv;
ll c = 0;
vector<ll> v;
ll n, m, q;
// indexからmまでのn桁の数列の列挙
void dfs2(ll index, ll count) {
if (count < n) {
for (ll i = index; i <= m; i++) {
v[count] = i;
dfs2(i, count + 1);
}
} else {
vv.push_back(v);
}
}
ll total(vector<ll> v) {
ll t = 0;
REP(i, v.size()) { t += v[i]; }
return t;
}
int main() {
ll n;
std::ifstream in("testcase_17");
std::cin.rdbuf(in.rdbuf());
cin >> n;
vector<ll> v;
ll a;
REP(i, n) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
REP(i, n) {
if (i < n - 1) {
if (v[i] + v[i + 1] < 0) {
v[i] = -v[i];
v[i + 1] = -v[i + 1];
}
}
}
cout << total(v) << endl;
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = ll(1e9 + 7);
const ll INF = ll(1e18) + 7;
// repetition
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RREP(i, n) for (ll i = n; i != 0; i--)
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
unsigned getDigit(unsigned num) {
unsigned digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
return digit;
}
unsigned binarySearch(ll target, ll max, ll min) {
while ((max - min) > 1) {
if ((max + min) / 2 > target) {
max = (max + min) / 2;
min = min;
} else {
max = max;
min = (max + min) / 2;
}
}
}
void f(int rest, string s) {
char abc[] = "abc";
if (rest == 0) {
cout << s << endl;
} else {
for (int i = 0; i < 3; i++) {
f(rest - 1, s + abc[i]);
}
}
}
// origin (ox, oy) destination (dx, dy)
//
/*
ll dfs2(ll ox, ll oy, vector<vector<char>> v, vector<vector<int>> dist) {
int m = 0;
for (int i = 0; i < 4; i++) {
int nx = ox+dx[i], ny = oy + dy[i];
if(nx < 0 || nx >= w || ny < 0 || nx >= h) continue;
if(v[nx][ny] != '.') continue;
if(dist[nx][ny] == -1) {
dist[nx][ny] = dist[ox][oy] + 1;
dist[nx][ny] = min(dist[ox][oy], dist[nx][ny]);
cout << "v[nx][ny]: " << dist[nx][ny] << endl;
cout << "dx: " << dx << endl;
cout << "dy: " << dy << endl;
cout << "v[ox][oy]: " << v[ox][oy] << endl;
cout << "(nx, ny)" << "("<< nx << "," << ny << ")"<< endl;
dfs2(nx, ny, v, dist);
}
m = max(m, dist[nx][ny]);
}
return m;
}
int main() {
// n,m->size, k-> value
// vector<vector<ll>> a(n ,vector<ll>(m, k));
// vector
// vector<ll> s(n,0);
// vector<vector<ll>> v;
// map<ll,ll> m;
// priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>
pq;
// vector<pair<ll, ll>> epv(n, {0, 0});
// vector<vector<char>> v(h, vector<char>(w));
for(auto&& m: em) {
epv.push_back({ m.second, m.first });
}
ll n, k, a;
cin >> n >> k;
vector<ll> vp;
vector<ll> vn;
ll c = 0;
REP(i, n) {
cin >> a;
if(a >= 0 ) vp.push_back(a);
else vn.push_back(a);
}
sort(vp.begin(), vp.end());
sort(vn.begin(), vn.end());
ll ps = vp.size();
ll ns = vn.size();
cout << "k: " << k << endl;
cout << "ps: " << ps << endl;
cout << "ns: " << ns << endl;
if(k < ps * ns) {
ll m = k%ns;
ll d = k - (m+1);
cout << vn[m] * vp[d] << endl;
}else {
ll kd = k - ps*ns;
ll md = kd%ps;
ll dd = kd - md;
ll s = 0;
REP(i, ps) {
s = s+(ps-i-1);
cout << "s: " << s << endl;
cout << "kd: " << kd << endl;
cout << "s: " << s << endl;
cout << "kd: " << kd << endl;
cout << "i: " << i << endl;
if(s > kd) {
cout << "vp[i]: " << vp[i] << endl;
cout << "vp[ps-i]: " << vp[s-kd+i-1] << endl;
cout << vp[i] * vp[s-kd+i-1] << endl;
break;
}
}
}
}
ll h, w;
vector<vector<char>> v;
vector<ll> dx = {-1, 0, 1, 0};
vector<ll> dy = {0, -1, 0, 1};
ll bfs(ll ox, ll oy) {
vector<vector<ll>> vd(h, vector<ll>(w, -1));
queue<pair<ll, ll>> q;
q.push({ox, oy});
vd[oy][ox] = 0;
ll res = 0;
while(!q.empty()) {
pair<ll, ll> vn = q.front();
q.pop();
res = max(res, vd[vn.second][vn.first]);
for(ll i = 0; i < 4; i++){
ll nx = vn.first +dx[i];
ll ny = vn.second + dy[i];
if(nx < 0 || ny < 0 || nx >= w || ny >= h) continue;
if(v[ny][nx] == '#') continue;
if(vd[ny][nx] == -1) {
vd[ny][nx] = res + 1;
q.push({nx, ny});
}
}
}
return res;
}
bool kai(string s) {
bool flg = true;
ll n = s.size();
for(ll i=0; i<n/2; i++) {
if(s[i] == s[n-1 -i]){
flg = true;
} else {
flg = false;
break;
}
}
return flg;
}
*/
struct UnionFind {
vector<ll> par;
map<ll, ll> s;
UnionFind(ll n) : par(n) {
REP(i, n) {
par[i] = i;
s[i]++;
}
}
ll root(ll x) {
if (par[x] == x)
return x;
return root(par[x]);
}
void unite(ll x, ll y) {
ll rx = root(x);
ll ry = root(y);
if (rx == ry)
return;
if (size(rx) > size(ry)) {
s[rx] = s[rx] + s[ry];
par[root(y)] = rx;
} else {
s[ry] = s[ry] + s[rx];
par[root(x)] = ry;
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return s[root(x)]; }
};
ll mod_pow(ll base, ll exp, ll mod) {
if (exp == 1)
return base % mod;
if (exp % 2 == 1)
return (base * mod_pow(base, exp - 1, mod)) % mod;
ll t = mod_pow(base, exp / 2, mod);
return (t * t) % mod;
}
// nPr
ll mod_permutation(ll n, ll r) {
ll t = 1;
while (r != 0) {
t = (t % MOD) * (n % MOD);
n--;
r--;
}
return t;
}
ll mod_factorial(ll r) {
ll v = 1;
while (r != 0) {
v = (v % MOD) * (r % MOD);
r--;
}
return v;
}
deque<ll> prime_factorization(ll n) {
vector<ll> P;
ll nn = sqrt(n) + 2;
vector<ll> prime(nn, true);
for (ll i = 2; i <= nn; i++) {
if (prime[i]) {
for (ll j = 2 * i; j <= nn; j += i) {
prime[j] = false;
}
P.emplace_back(i);
}
}
deque<ll> d;
REP(i, P.size()) {
while (n % P[i] == 0) {
d.push_back(P[i]);
n /= P[i];
}
}
if (n > nn)
d.push_back(n);
return d;
}
struct Node {
vector<ll> edges;
vector<ll> costs;
bool done;
ll cost;
friend bool operator<(const Node &lhs, const Node &rhs) {
return rhs.cost < lhs.cost;
}
};
ll mod_conb() {
//((p%MOD)*(mod_pow(k, MOD-2)%MOD)*(mod_pow(ki, MOD-2)%MOD))%MOD
}
vector<vector<ll>> vv;
ll c = 0;
vector<ll> v;
ll n, m, q;
// indexからmまでのn桁の数列の列挙
void dfs2(ll index, ll count) {
if (count < n) {
for (ll i = index; i <= m; i++) {
v[count] = i;
dfs2(i, count + 1);
}
} else {
vv.push_back(v);
}
}
ll total(vector<ll> v) {
ll t = 0;
REP(i, v.size()) { t += v[i]; }
return t;
}
int main() {
ll n;
// std::ifstream in("testcase_17");
// std::cin.rdbuf(in.rdbuf());
cin >> n;
vector<ll> v;
ll a;
REP(i, n) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
REP(i, n) {
if (i < n - 1) {
if (v[i] + v[i + 1] < 0) {
v[i] = -v[i];
v[i + 1] = -v[i + 1];
}
}
}
cout << total(v) << endl;
} | replace | 346 | 348 | 346 | 348 | TLE | |
p03062 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> Q;
/**** Const List ****/
const ll INF = 1LL << 60;
const ll mod = 1000000007;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, -1, 0, 1};
const ll NCK_MAX = 510000;
/**** General Functions ****/
ll ketawa(ll n) {
ll a = 0;
while (n != 0) {
a += n % 10;
n /= 10;
}
return a;
}
ll RepeatSquaring(ll N, ll P, ll M) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RepeatSquaring(N, P / 2, M);
return (t % M) * (t % M) % M;
}
return (N * RepeatSquaring(N, P - 1, M)) % M;
}
bool IsPrime(ll a) { // order root a
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0 && a != i) {
return false;
}
}
return true;
}
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; }
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll q = a / b, g = extgcd(b, a - q * b, x, y);
ll z = x - q * y;
x = y;
y = z;
return g;
}
ll invmod(ll a, ll m) { // a^-1 mod m
ll x, y;
extgcd(a, m, x, y);
x %= m;
if (x < 0)
x += m;
return x;
}
ll *fac, *finv, *inv;
void nCk_init(ll mod) {
fac = new ll[NCK_MAX];
finv = new ll[NCK_MAX];
inv = new ll[NCK_MAX];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < NCK_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;
}
}
ll nCk(ll n, ll k, ll mod) {
if (fac == NULL)
nCk_init(mod);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll lmin(ll a, ll b) { return a > b ? b : a; };
ll lmax(ll a, ll b) { return a > b ? a : b; };
ll lsum(ll a, ll b) { return a + b; };
/**** Zip ****/
template <typename T> class Zip {
vector<T> d;
bool flag;
public:
Zip() { flag = false; }
void add(T x) {
d.push_back(x);
flag = true;
}
ll getNum(T x) { // T need to have operator < !!
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return lower_bound(d.begin(), d.end(), x) - d.begin();
}
ll size() {
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return (ll)d.size();
}
};
/**** Union Find ****/
class UnionFind {
vector<ll> par, rank; // par > 0: number, par < 0: -par
public:
void init(ll n) {
par.resize(n, 1);
rank.resize(n, 0);
}
ll getSize(ll x) { return par[find(x)]; }
ll find(ll x) {
if (par[x] > 0)
return x;
return -(par[x] = -find(-par[x]));
}
void merge(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = -y;
} else {
par[x] += par[y];
par[y] = -x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool isSame(ll x, ll y) { return find(x) == find(y); }
};
/**** Segment Tree ****/
class SegmentTree {
public:
vector<pair<double, double>> node; // node[0]は使用しない
ll n; // データの個数(nodeの最下層には何個並んでいるか)
pair<double, double> initial_value; // 初期値
public:
void Init(ll n_, pair<double, double> initial_value_) {
n = 1;
while (n < n_)
n *= 2;
node.resize(2 * n);
for (ll i = 0; i < 2 * n; i++) {
node[i] = initial_value_;
}
initial_value = initial_value_;
}
void Update(ll k, pair<double, double> a) {
// node[k]をaにする
// それに従って先祖も変わっていく
k += n;
node[k] = a;
while (k > 1) {
k = k / 2;
node[k] = pair<double, double>(
node[k * 2].first * node[k * 2 + 1].first,
node[k * 2].second * node[k * 2 + 1].first + node[k * 2 + 1].second);
}
}
/*void Watch(){
for(ll i=0;i<2*n;i++){
cout<<node[i]<<endl;
}
}*/
double Query() { //[a,b)
return node[1].first + node[1].second;
}
};
/**** LIS ****/
ll lis(ll *a, ll n, ll *dp) {
fill(dp, dp + n, INF); // INFを代入
for (ll i = 0; i < n; i++)
*lower_bound(dp, dp + n, a[i]) = a[i];
return (ll)(lower_bound(dp, dp + n, INF) - dp);
}
/**** main function ****/
string s, t = {};
ll h, w, n, m;
double dp[1000][1000];
ll ans;
vector<ll> vec;
ll zenbu;
ll zero;
int main() {
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> m;
if (m < 0) {
zenbu++;
vec.push_back(-1 * m);
} else if (m == 0) {
zero++;
} else {
vec.push_back(m);
}
}
for (ll i = 0; i < n; i++) {
ans += vec[i];
}
if (zero != 0 || zenbu % 2 == 0) {
cout << ans << endl;
} else {
sort(vec.begin(), vec.end());
cout << ans - vec[0] * 2 << endl;
}
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> Q;
/**** Const List ****/
const ll INF = 1LL << 60;
const ll mod = 1000000007;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, -1, 0, 1};
const ll NCK_MAX = 510000;
/**** General Functions ****/
ll ketawa(ll n) {
ll a = 0;
while (n != 0) {
a += n % 10;
n /= 10;
}
return a;
}
ll RepeatSquaring(ll N, ll P, ll M) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RepeatSquaring(N, P / 2, M);
return (t % M) * (t % M) % M;
}
return (N * RepeatSquaring(N, P - 1, M)) % M;
}
bool IsPrime(ll a) { // order root a
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0 && a != i) {
return false;
}
}
return true;
}
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; }
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll q = a / b, g = extgcd(b, a - q * b, x, y);
ll z = x - q * y;
x = y;
y = z;
return g;
}
ll invmod(ll a, ll m) { // a^-1 mod m
ll x, y;
extgcd(a, m, x, y);
x %= m;
if (x < 0)
x += m;
return x;
}
ll *fac, *finv, *inv;
void nCk_init(ll mod) {
fac = new ll[NCK_MAX];
finv = new ll[NCK_MAX];
inv = new ll[NCK_MAX];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < NCK_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;
}
}
ll nCk(ll n, ll k, ll mod) {
if (fac == NULL)
nCk_init(mod);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll lmin(ll a, ll b) { return a > b ? b : a; };
ll lmax(ll a, ll b) { return a > b ? a : b; };
ll lsum(ll a, ll b) { return a + b; };
/**** Zip ****/
template <typename T> class Zip {
vector<T> d;
bool flag;
public:
Zip() { flag = false; }
void add(T x) {
d.push_back(x);
flag = true;
}
ll getNum(T x) { // T need to have operator < !!
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return lower_bound(d.begin(), d.end(), x) - d.begin();
}
ll size() {
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return (ll)d.size();
}
};
/**** Union Find ****/
class UnionFind {
vector<ll> par, rank; // par > 0: number, par < 0: -par
public:
void init(ll n) {
par.resize(n, 1);
rank.resize(n, 0);
}
ll getSize(ll x) { return par[find(x)]; }
ll find(ll x) {
if (par[x] > 0)
return x;
return -(par[x] = -find(-par[x]));
}
void merge(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = -y;
} else {
par[x] += par[y];
par[y] = -x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool isSame(ll x, ll y) { return find(x) == find(y); }
};
/**** Segment Tree ****/
class SegmentTree {
public:
vector<pair<double, double>> node; // node[0]は使用しない
ll n; // データの個数(nodeの最下層には何個並んでいるか)
pair<double, double> initial_value; // 初期値
public:
void Init(ll n_, pair<double, double> initial_value_) {
n = 1;
while (n < n_)
n *= 2;
node.resize(2 * n);
for (ll i = 0; i < 2 * n; i++) {
node[i] = initial_value_;
}
initial_value = initial_value_;
}
void Update(ll k, pair<double, double> a) {
// node[k]をaにする
// それに従って先祖も変わっていく
k += n;
node[k] = a;
while (k > 1) {
k = k / 2;
node[k] = pair<double, double>(
node[k * 2].first * node[k * 2 + 1].first,
node[k * 2].second * node[k * 2 + 1].first + node[k * 2 + 1].second);
}
}
/*void Watch(){
for(ll i=0;i<2*n;i++){
cout<<node[i]<<endl;
}
}*/
double Query() { //[a,b)
return node[1].first + node[1].second;
}
};
/**** LIS ****/
ll lis(ll *a, ll n, ll *dp) {
fill(dp, dp + n, INF); // INFを代入
for (ll i = 0; i < n; i++)
*lower_bound(dp, dp + n, a[i]) = a[i];
return (ll)(lower_bound(dp, dp + n, INF) - dp);
}
/**** main function ****/
string s, t = {};
ll h, w, n, m;
double dp[1000][1000];
ll ans;
vector<ll> vec;
ll zenbu;
ll zero;
int main() {
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> m;
if (m < 0) {
zenbu++;
vec.push_back(-1 * m);
} else if (m == 0) {
zero++;
vec.push_back(m);
} else {
vec.push_back(m);
}
}
for (ll i = 0; i < n; i++) {
ans += vec[i];
}
if (zero != 0 || zenbu % 2 == 0) {
cout << ans << endl;
} else {
sort(vec.begin(), vec.end());
cout << ans - vec[0] * 2 << endl;
}
}
| insert | 244 | 244 | 244 | 245 | 0 | |
p03062 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
long long dp[10010][2];
long long INF = -100000000000000;
long long max(long long a, long long b) { return a > b ? a : b; }
int main() {
int N;
cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
dp[0][0] = 0;
dp[0][1] = INF;
for (int i = 0; i < N; i++) {
dp[i + 1][0] = max(dp[i][0] + a[i], dp[i][1] - a[i]);
dp[i + 1][1] = max(dp[i][0] - a[i], dp[i][1] + a[i]);
}
cout << dp[N][0] << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
long long dp[100010][2];
long long INF = -100000000000000;
long long max(long long a, long long b) { return a > b ? a : b; }
int main() {
int N;
cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
dp[0][0] = 0;
dp[0][1] = INF;
for (int i = 0; i < N; i++) {
dp[i + 1][0] = max(dp[i][0] + a[i], dp[i][1] - a[i]);
dp[i + 1][1] = max(dp[i][0] - a[i], dp[i][1] + a[i]);
}
cout << dp[N][0] << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
//
int num;
int cnt = 0;
long long kekka = 0;
cin >> num;
vector<long long> vec(num);
for (int i = 0; i < num; i++) {
long long tmp;
cin >> tmp;
if (tmp < 0)
cnt++;
vec.at(i) = tmp;
}
sort(vec.begin(), vec.end());
if (cnt % 2 == 0) {
for (int i = 0; i < num; i++) {
kekka += abs(vec.at(i));
}
} else {
for (int i = 0; i < cnt - 1; i++) {
kekka += abs(vec.at(i));
}
if (abs(vec.at(cnt - 1)) > abs(vec.at(cnt))) {
vec.at(cnt - 1) *= -1;
vec.at(cnt) *= -1;
}
for (int i = cnt - 1; i < num; i++) {
kekka += vec.at(i);
}
}
cout << kekka << endl;
//
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
//
int num;
int cnt = 0;
long long kekka = 0;
cin >> num;
vector<long long> vec(num);
for (int i = 0; i < num; i++) {
long long tmp;
cin >> tmp;
if (tmp < 0)
cnt++;
vec.at(i) = tmp;
}
sort(vec.begin(), vec.end());
if (cnt % 2 == 0) {
for (int i = 0; i < num; i++) {
kekka += abs(vec.at(i));
}
} else {
for (int i = 0; i < cnt - 1; i++) {
kekka += abs(vec.at(i));
}
if (cnt == num) {
kekka += vec.at(num - 1);
} else {
if (abs(vec.at(cnt - 1)) > abs(vec.at(cnt))) {
vec.at(cnt - 1) *= -1;
vec.at(cnt) *= -1;
}
for (int i = cnt - 1; i < num; i++) {
kekka += vec.at(i);
}
}
}
cout << kekka << endl;
//
}
| replace | 29 | 35 | 29 | 40 | 0 | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
const int maxn = 1e5 + 10;
ll dp[maxn][2];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
vi vs(n);
dp[0][0] = 0;
dp[0][1] = -(1LL << 60);
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
dp[i + 1][0] = max(dp[i][0] + x, dp[i][1] - x);
dp[i + 1][1] = max(dp[i][0] - x, dp[i][1] + x);
}
cout << dp[n][0] << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
const int maxn = 1e5 + 10;
ll dp[maxn][2];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vi vs(n);
dp[0][0] = 0;
dp[0][1] = -(1LL << 60);
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
dp[i + 1][0] = max(dp[i][0] + x, dp[i][1] - x);
dp[i + 1][1] = max(dp[i][0] - x, dp[i][1] + x);
}
cout << dp[n][0] << endl;
return 0;
} | delete | 22 | 26 | 22 | 22 | 0 | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
ll dp[110][110];
int main() {
int n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v[i];
rep(i, 2) { rep(j, n) dp[i][j] = -inf; }
dp[0][0] = v[0] + v[1];
dp[1][0] = -v[0] - v[1];
rep(j, n - 2) {
dp[0][j + 1] = max(dp[0][j] + v[j + 2], dp[0][j + 1]);
dp[1][j + 1] = max(dp[0][j] - 2 * v[j + 1] - v[j + 2], dp[1][j + 1]);
dp[0][j + 1] = max(dp[0][j + 1], dp[1][j] + v[j + 2]);
dp[1][j + 1] = max(dp[1][j + 1], dp[1][j] + 2 * v[j + 1] - v[j + 2]);
}
/*
rep(i,2){
rep(j,n-1) cout<<dp[i][j]<<" ";
cout<<endl;
}*/
cout << max(dp[0][n - 2], dp[1][n - 2]) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
ll dp[5][100010];
int main() {
int n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v[i];
rep(i, 2) { rep(j, n) dp[i][j] = -inf; }
dp[0][0] = v[0] + v[1];
dp[1][0] = -v[0] - v[1];
rep(j, n - 2) {
dp[0][j + 1] = max(dp[0][j] + v[j + 2], dp[0][j + 1]);
dp[1][j + 1] = max(dp[0][j] - 2 * v[j + 1] - v[j + 2], dp[1][j + 1]);
dp[0][j + 1] = max(dp[0][j + 1], dp[1][j] + v[j + 2]);
dp[1][j + 1] = max(dp[1][j + 1], dp[1][j] + 2 * v[j + 1] - v[j + 2]);
}
/*
rep(i,2){
rep(j,n-1) cout<<dp[i][j]<<" ";
cout<<endl;
}*/
cout << max(dp[0][n - 2], dp[1][n - 2]) << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p03062 | C++ | Runtime Error | /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////GLOBAL
///DEFINITIONS////////////////////////////////////////////////////////
///////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int tab[10000];
int n;
cin >> n;
LL licznik = 0;
int counter = 0;
for (int i = 0; i < n; i++) {
cin >> tab[i];
}
for (int i = 0; i < n; i++) {
licznik += abs(tab[i]);
if (tab[i] < 0)
counter++;
}
if (counter % 2 == 1) {
int mini = INF;
for (int i = 0; i < n; i++) {
mini = min(mini, abs(tab[i]));
// cout << "current mini: " << mini << endl;
}
licznik -= mini * 2;
}
cout << licznik << endl;
return 0;
}
| /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////GLOBAL
///DEFINITIONS////////////////////////////////////////////////////////
///////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int tab[100005];
int n;
cin >> n;
LL licznik = 0;
int counter = 0;
for (int i = 0; i < n; i++) {
cin >> tab[i];
}
for (int i = 0; i < n; i++) {
licznik += abs(tab[i]);
if (tab[i] < 0)
counter++;
}
if (counter % 2 == 1) {
int mini = INF;
for (int i = 0; i < n; i++) {
mini = min(mini, abs(tab[i]));
// cout << "current mini: " << mini << endl;
}
licznik -= mini * 2;
}
cout << licznik << endl;
return 0;
}
| replace | 52 | 53 | 52 | 53 | 0 | |
p03062 | C++ | Runtime Error | #include <iostream>
using namespace std;
long long a[105];
long long xabs(long long x) {
if (x >= 0)
return x;
else
return x * -1;
}
int main() {
int n, i, t = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] < 0)
t++;
}
long long ans = 0;
if (t % 2 == 0) {
for (i = 1; i <= n; i++)
ans += xabs(a[i]);
cout << ans;
} else {
long long minv = 0x7ffffffff;
for (i = 1; i <= n; i++) {
ans += xabs(a[i]);
minv = min(minv, xabs(a[i]));
}
cout << ans - minv * 2;
}
return 0;
} | #include <iostream>
using namespace std;
long long a[100005];
long long xabs(long long x) {
if (x >= 0)
return x;
else
return x * -1;
}
int main() {
int n, i, t = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] < 0)
t++;
}
long long ans = 0;
if (t % 2 == 0) {
for (i = 1; i <= n; i++)
ans += xabs(a[i]);
cout << ans;
} else {
long long minv = 0x7ffffffff;
for (i = 1; i <= n; i++) {
ans += xabs(a[i]);
minv = min(minv, xabs(a[i]));
}
cout << ans - minv * 2;
}
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p03062 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg, (x).ed
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (ll i = (n); i >= 1; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
const ll MOD = 1000000007;
const ll INF = 1000000000000000;
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;
}
ll maxx(ll x, ll y, ll z) { return max(max(x, y), z); }
ll minn(ll x, ll y, ll z) { return min(min(x, y), z); }
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x * (y / gcd(x, y)); }
ll digsz(ll x) {
if (x == 0)
return 1;
else {
ll ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
}
ll digsum(ll x) {
ll sum = 0;
while (x) {
sum += x % 10;
x /= 10;
}
return sum;
}
vector<ll> pw2(62, 1);
vector<ll> pw10(19, 1);
int main() {
{ rep1(i, 61) pw2[i] = 2 * pw2[i - 1]; }
{ rep1(i, 18) pw10[i] = 10 * pw10[i - 1]; }
ll N;
cin >> N;
ll ans = 0;
vector<ll> minus;
vector<ll> plus;
rep(i, N) {
ll tmp;
cin >> tmp;
if (tmp < 0)
minus.pb(tmp);
else
plus.pb(tmp);
}
sort(all(plus));
sort(all(minus));
if (sz(minus) % 2 == 0) {
rep(i, sz(minus)) { ans -= minus[i]; }
rep(i, sz(plus)) { ans += plus[i]; }
} else {
rep(i, sz(minus) - 1) { ans -= minus[i]; }
rep1(i, sz(plus) - 1) { ans += plus[i]; }
ans += abs(abs(minus[sz(minus) - 1]) - abs(plus[0]));
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg, (x).ed
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (ll i = (n); i >= 1; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
const ll MOD = 1000000007;
const ll INF = 1000000000000000;
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;
}
ll maxx(ll x, ll y, ll z) { return max(max(x, y), z); }
ll minn(ll x, ll y, ll z) { return min(min(x, y), z); }
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x * (y / gcd(x, y)); }
ll digsz(ll x) {
if (x == 0)
return 1;
else {
ll ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
}
ll digsum(ll x) {
ll sum = 0;
while (x) {
sum += x % 10;
x /= 10;
}
return sum;
}
vector<ll> pw2(62, 1);
vector<ll> pw10(19, 1);
int main() {
{ rep1(i, 61) pw2[i] = 2 * pw2[i - 1]; }
{ rep1(i, 18) pw10[i] = 10 * pw10[i - 1]; }
ll N;
cin >> N;
ll ans = 0;
vector<ll> minus;
vector<ll> plus;
rep(i, N) {
ll tmp;
cin >> tmp;
if (tmp < 0)
minus.pb(tmp);
else
plus.pb(tmp);
}
sort(all(plus));
sort(all(minus));
if (sz(minus) % 2 == 0) {
rep(i, sz(minus)) { ans -= minus[i]; }
rep(i, sz(plus)) { ans += plus[i]; }
} else {
rep(i, sz(minus) - 1) { ans -= minus[i]; }
rep1(i, sz(plus) - 1) { ans += plus[i]; }
if (sz(plus) > 0)
ans += abs(abs(minus[sz(minus) - 1]) - abs(plus[0]));
else
ans += minus[sz(minus) - 1];
}
cout << ans << endl;
}
| replace | 103 | 104 | 103 | 107 | 0 | |
p03062 | C++ | Time Limit Exceeded | // I can
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (i = 0; i < n; i++)
#define forn(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i)
#define ford(i, n) for (ll i = (ll)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define fora(it, x) for (auto it : x)
#define PI 3.14159265
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef long double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
const ll maxn = 100000, mod = 1e9 + 7;
int n, a[maxn];
ll memo[maxn][2];
ll go(int pos, int par) {
if (pos == n)
return 0;
if (memo[pos][par] != -1)
return memo[pos][par];
ll ans;
if (par) {
ll val = -a[pos];
if (pos == n - 1)
ans = val + go(pos + 1, 0);
else
ans = max(val + go(pos + 1, 0), a[pos] + go(pos + 1, 1));
} else {
if (pos == n - 1)
ans = a[pos] + go(pos + 1, 0);
else
ans = max(a[pos] + go(pos + 1, 0), -a[pos] + go(pos + 1, 1));
}
return ans;
}
int main() {
sync
memset(memo, -1, sizeof(memo));
cin >> n;
forn(i, n) cin >> a[i];
cout << go(0, 0);
return 0;
} | // I can
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (i = 0; i < n; i++)
#define forn(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i)
#define ford(i, n) for (ll i = (ll)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define fora(it, x) for (auto it : x)
#define PI 3.14159265
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef long double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
const ll maxn = 100000, mod = 1e9 + 7;
int n, a[maxn];
ll memo[maxn][2];
ll go(int pos, int par) {
if (pos == n)
return 0;
if (memo[pos][par] != -1)
return memo[pos][par];
ll ans;
if (par) {
ll val = -a[pos];
if (pos == n - 1)
ans = val + go(pos + 1, 0);
else
ans = max(val + go(pos + 1, 0), a[pos] + go(pos + 1, 1));
} else {
if (pos == n - 1)
ans = a[pos] + go(pos + 1, 0);
else
ans = max(a[pos] + go(pos + 1, 0), -a[pos] + go(pos + 1, 1));
}
return memo[pos][par] = ans;
}
int main() {
sync
memset(memo, -1, sizeof(memo));
cin >> n;
forn(i, n) cin >> a[i];
cout << go(0, 0);
return 0;
} | replace | 63 | 64 | 63 | 64 | TLE | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 1000
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define all(cont) cont.begin(), cont.end()
#define sortcmp(n, cmpfunc) sort(all(n), cmpfunc)
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0)
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
ll powm(ll a, ll b);
ll divm(ll a, ll b);
ll multm(ll a, ll b);
ll subm(ll a, ll b);
ll addm(ll a, ll b);
int main() {
fastio;
// #ifndef ONLINE_JUDGE
// freopen("input.in", "r", stdin);
// freopen("output.out", "w", stdout);
// #endif
int n;
ll a[N], dp[N][2];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0][0] = a[0] + a[1];
dp[0][1] = (a[0] + a[1]) * -1;
for (int i = 1; i < n - 1; i++) {
for (int j = 0; j < 2; j++) {
if (j == 0)
dp[i][j] = max(dp[i - 1][0], dp[i - 1][1]) + a[i + 1];
else
dp[i][j] =
max(dp[i - 1][0] - 2 * a[i], dp[i - 1][1] + 2 * a[i]) - a[i + 1];
}
}
cout << max(dp[n - 2][0], dp[n - 2][1]) << endl;
return 0;
}
// template function
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll powm(ll a, ll b) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2)
x = (x * y) % mod;
y = (y * y) % mod;
b /= 2;
}
return x % mod;
}
ll multm(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll divm(ll a, ll b) { return (a * powm(b, mod - 2)); }
ll subm(ll a, ll b) {
a -= b;
if (a < 0)
a += mod;
return a;
}
ll addm(ll a, ll b) {
a += b;
if (a >= mod)
a -= mod;
return a;
} | #include <bits/stdc++.h>
using namespace std;
#define N 100012
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define all(cont) cont.begin(), cont.end()
#define sortcmp(n, cmpfunc) sort(all(n), cmpfunc)
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0)
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
ll powm(ll a, ll b);
ll divm(ll a, ll b);
ll multm(ll a, ll b);
ll subm(ll a, ll b);
ll addm(ll a, ll b);
int main() {
fastio;
// #ifndef ONLINE_JUDGE
// freopen("input.in", "r", stdin);
// freopen("output.out", "w", stdout);
// #endif
int n;
ll a[N], dp[N][2];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0][0] = a[0] + a[1];
dp[0][1] = (a[0] + a[1]) * -1;
for (int i = 1; i < n - 1; i++) {
for (int j = 0; j < 2; j++) {
if (j == 0)
dp[i][j] = max(dp[i - 1][0], dp[i - 1][1]) + a[i + 1];
else
dp[i][j] =
max(dp[i - 1][0] - 2 * a[i], dp[i - 1][1] + 2 * a[i]) - a[i + 1];
}
}
cout << max(dp[n - 2][0], dp[n - 2][1]) << endl;
return 0;
}
// template function
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll powm(ll a, ll b) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2)
x = (x * y) % mod;
y = (y * y) % mod;
b /= 2;
}
return x % mod;
}
ll multm(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll divm(ll a, ll b) { return (a * powm(b, mod - 2)); }
ll subm(ll a, ll b) {
a -= b;
if (a < 0)
a += mod;
return a;
}
ll addm(ll a, ll b) {
a += b;
if (a >= mod)
a -= mod;
return a;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p03062 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int uii;
typedef pair<int, int> pii;
typedef unsigned long long uLL;
typedef vector<int> vii;
//__int128
const int maxn = 2e5;
int a[maxn];
int main(int argc, char const *argv[]) {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
int n;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
LL res = 0;
int c = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] < 0) {
++c;
a[i] = -a[i];
}
res += a[i];
}
if (c & 1) {
sort(a, a + n);
res -= 2 * a[0];
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int uii;
typedef pair<int, int> pii;
typedef unsigned long long uLL;
typedef vector<int> vii;
//__int128
const int maxn = 2e5;
int a[maxn];
int main(int argc, char const *argv[]) {
#ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
int n;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
LL res = 0;
int c = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] < 0) {
++c;
a[i] = -a[i];
}
res += a[i];
}
if (c & 1) {
sort(a, a + n);
res -= 2 * a[0];
}
cout << res << endl;
return 0;
} | replace | 24 | 26 | 24 | 26 | 0 | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forr(a, b, v) for (int v = a; v <= b; v++)
#define ford(a, b, v) for (int v = a; v >= b; v--)
const int N = 100005;
int main() {
int n;
int A[N];
// store the sum of the result in a long long pair
ll s = 0;
cin >> n;
forr(1, n, i) { cin >> A[i]; }
forr(1, n - 2, i) {
if (A[i] < 0) {
A[i] *= -1;
A[i + 1] *= -1;
}
s += A[i];
}
// add the last two pairs
if ((A[n] > 0 and A[n - 1] > 0) or (A[n] < 0 and A[n - 1] < 0)) {
s += max(A[n - 1] + A[n], -A[n - 1] - A[n]);
} else {
int *mni = min_element(A + 1, A + n - 2);
int mnv = *mni;
if (mnv > min(abs(A[n - 1]), abs(A[n]))) {
s += max(A[n - 1] + A[n], -A[n - 1] - A[n]);
} else {
s -= mnv * 2;
s += abs(A[n - 1]);
s += abs(A[n]);
}
}
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forr(a, b, v) for (int v = a; v <= b; v++)
#define ford(a, b, v) for (int v = a; v >= b; v--)
const int N = 100005;
int main() {
int n;
int A[N];
// store the sum of the result in a long long pair
ll s = 0;
cin >> n;
forr(1, n, i) { cin >> A[i]; }
if (n == 2) {
int s = max(A[n - 1] + A[n], -A[n - 1] - A[n]);
cout << s << endl;
return 0;
}
forr(1, n - 2, i) {
if (A[i] < 0) {
A[i] *= -1;
A[i + 1] *= -1;
}
s += A[i];
}
// add the last two pairs
if ((A[n] > 0 and A[n - 1] > 0) or (A[n] < 0 and A[n - 1] < 0)) {
s += max(A[n - 1] + A[n], -A[n - 1] - A[n]);
} else {
int *mni = min_element(A + 1, A + n - 2);
int mnv = *mni;
if (mnv > min(abs(A[n - 1]), abs(A[n]))) {
s += max(A[n - 1] + A[n], -A[n - 1] - A[n]);
} else {
s -= mnv * 2;
s += abs(A[n - 1]);
s += abs(A[n]);
}
}
cout << s << endl;
return 0;
}
| insert | 13 | 13 | 13 | 19 | 0 | |
p03062 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <vector>
#define INF 100000
using namespace std;
void chmin(int &a, int b) {
if (a > b)
a = b;
}
void chmax(int &a, int b) {
if (a < b)
a = b;
}
int N;
vector<int> A;
vector<int> L, R;
int rec(int a, int b) {
if (a == 0)
return b;
if (b == 0)
return a;
return rec(b, a % b);
}
int main() {
cin >> N;
A.resize(N);
int min = 1000000000;
int pm = 1;
long long sum = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
pm = (pm * tmp) / abs(pm * tmp);
sum += abs(tmp);
chmin(min, abs(tmp));
}
if (pm >= 0)
cout << sum << endl;
else
cout << sum - 2 * min << endl;
} | #include <cmath>
#include <iostream>
#include <vector>
#define INF 100000
using namespace std;
void chmin(int &a, int b) {
if (a > b)
a = b;
}
void chmax(int &a, int b) {
if (a < b)
a = b;
}
int N;
vector<int> A;
vector<int> L, R;
int rec(int a, int b) {
if (a == 0)
return b;
if (b == 0)
return a;
return rec(b, a % b);
}
int main() {
cin >> N;
A.resize(N);
int min = 1000000000;
int pm = 1;
long long sum = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
if (tmp > 0) {
} else if (tmp < 0) {
pm *= -1;
} else {
pm = 0;
}
sum += abs(tmp);
chmin(min, abs(tmp));
}
if (pm >= 0)
cout << sum << endl;
else
cout << sum - 2 * min << endl;
} | replace | 41 | 42 | 41 | 48 | 0 | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 100012
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define all(cont) cont.begin(), cont.end()
#define sortcmp(n, cmpfunc) sort(all(n), cmpfunc)
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0)
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
ll powm(ll a, ll b);
ll divm(ll a, ll b);
ll multm(ll a, ll b);
ll subm(ll a, ll b);
ll addm(ll a, ll b);
int main() {
fastio;
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
#endif
int n;
ll a[N];
pair<ll, ll> dp[N][2];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0][0] = mp(a[0] + a[1], a[1]);
dp[0][1] = mp((a[0] + a[1]) * -1, a[1] * -1);
for (int i = 1; i < n - 1; i++) {
for (int j = 0; j < 2; j++) {
if (j == 0)
dp[i][j] = mp(max(dp[i - 1][0].first, dp[i - 1][1].first) + a[i + 1],
a[i + 1]);
else
dp[i][j] = mp(max(dp[i - 1][0].first + (dp[i - 1][0].second * -2),
dp[i - 1][1].first + (dp[i - 1][1].second * -2)) +
(a[i + 1] * -1),
a[i + 1] * -1);
}
}
cout << max(dp[n - 2][0].first, dp[n - 2][1].first) << endl;
return 0;
}
// template function
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll powm(ll a, ll b) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2)
x = (x * y) % mod;
y = (y * y) % mod;
b /= 2;
}
return x % mod;
}
ll multm(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll divm(ll a, ll b) { return (a * powm(b, mod - 2)); }
ll subm(ll a, ll b) {
a -= b;
if (a < 0)
a += mod;
return a;
}
ll addm(ll a, ll b) {
a += b;
if (a >= mod)
a -= mod;
return a;
} | #include <bits/stdc++.h>
using namespace std;
#define N 100012
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define all(cont) cont.begin(), cont.end()
#define sortcmp(n, cmpfunc) sort(all(n), cmpfunc)
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0)
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
ll powm(ll a, ll b);
ll divm(ll a, ll b);
ll multm(ll a, ll b);
ll subm(ll a, ll b);
ll addm(ll a, ll b);
int main() {
fastio;
// #ifndef ONLINE_JUDGE
// freopen("input.in", "r", stdin);
// freopen("output.out", "w", stdout);
// #endif
int n;
ll a[N];
pair<ll, ll> dp[N][2];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0][0] = mp(a[0] + a[1], a[1]);
dp[0][1] = mp((a[0] + a[1]) * -1, a[1] * -1);
for (int i = 1; i < n - 1; i++) {
for (int j = 0; j < 2; j++) {
if (j == 0)
dp[i][j] = mp(max(dp[i - 1][0].first, dp[i - 1][1].first) + a[i + 1],
a[i + 1]);
else
dp[i][j] = mp(max(dp[i - 1][0].first + (dp[i - 1][0].second * -2),
dp[i - 1][1].first + (dp[i - 1][1].second * -2)) +
(a[i + 1] * -1),
a[i + 1] * -1);
}
}
cout << max(dp[n - 2][0].first, dp[n - 2][1].first) << endl;
return 0;
}
// template function
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll powm(ll a, ll b) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2)
x = (x * y) % mod;
y = (y * y) % mod;
b /= 2;
}
return x % mod;
}
ll multm(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll divm(ll a, ll b) { return (a * powm(b, mod - 2)); }
ll subm(ll a, ll b) {
a -= b;
if (a < 0)
a += mod;
return a;
}
ll addm(ll a, ll b) {
a += b;
if (a >= mod)
a -= mod;
return a;
} | replace | 24 | 28 | 24 | 28 | 0 | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[1000];
int mainasu = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
mainasu++;
}
}
long long ans = 0;
long long mins = abs(a[0]);
for (int i = 0; i < n; i++) {
ans = ans + abs(a[i]);
mins = min(mins, abs(a[i]));
}
if (mainasu % 2 == 1) {
ans = ans - mins * 2;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <numeric>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[100000];
int mainasu = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
mainasu++;
}
}
long long ans = 0;
long long mins = abs(a[0]);
for (int i = 0; i < n; i++) {
ans = ans + abs(a[i]);
mins = min(mins, abs(a[i]));
}
if (mainasu % 2 == 1) {
ans = ans - mins * 2;
}
cout << ans << endl;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
#define M 1000000007
#define endl "\n"
#define int long long
using namespace std;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
int mi = 1e9;
int ind;
for (int i = 0; i < n; i++) {
if (abs(ar[i]) < mi) {
mi = abs(ar[i]);
ind = i;
}
}
for (int i = 0; i < ind; i++) {
if (ar[i] < 0) {
ar[i] = -ar[i];
ar[i + 1] = -ar[i + 1];
}
}
for (int j = n - 1; j > ind; j--) {
if (ar[j] < 0) {
ar[j] = -ar[j];
ar[j - 1] = -ar[j - 1];
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += ar[i];
}
cout << ans;
}
| #include <bits/stdc++.h>
typedef long long ll;
#define M 1000000007
#define endl "\n"
#define int long long
using namespace std;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
int mi = 2 * M;
int ind;
for (int i = 0; i < n; i++) {
if (abs(ar[i]) < mi) {
mi = abs(ar[i]);
ind = i;
}
}
for (int i = 0; i < ind; i++) {
if (ar[i] < 0) {
ar[i] = -ar[i];
ar[i + 1] = -ar[i + 1];
}
}
for (int j = n - 1; j > ind; j--) {
if (ar[j] < 0) {
ar[j] = -ar[j];
ar[j - 1] = -ar[j - 1];
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += ar[i];
}
cout << ans;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a[10001];
cin >> N;
long long ans = 0;
int mini = INT_MAX, cnt = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
cnt++;
}
ans += abs(a[i]);
mini = min(abs(a[i]), mini);
}
if (cnt % 2 == 1) {
ans -= 2 * mini;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a[100001];
cin >> N;
long long ans = 0;
int mini = INT_MAX, cnt = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
cnt++;
}
ans += abs(a[i]);
mini = min(abs(a[i]), mini);
}
if (cnt % 2 == 1) {
ans -= 2 * mini;
}
cout << ans << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p03062 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
long n;
cin >> n;
vector<long long int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
while ((a.at(0) + a.at(1)) < 0) {
a.at(0) *= -1;
a.at(1) *= -1;
sort(a.begin(), a.end());
}
long long int ans = 0;
rep(i, n) ans += a[i];
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
long n;
cin >> n;
vector<long long int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
rep(i, n / 2) {
if (a[2 * i] + a[2 * i + 1] < 0) {
a[2 * i] *= -1;
a[2 * i + 1] *= -1;
} else
break;
}
long long int ans = 0;
rep(i, n) ans += a[i];
cout << ans << endl;
} | replace | 11 | 15 | 11 | 17 | TLE | |
p03062 | C++ | Runtime Error | /**
* author: prakhar17252
* created: 27.04.2019 18:27:22
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
#define int ll
#define pb emplace_back
#define push emplace
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define len(a) (int)a.size()
#define reset(a, val) memset(a, val, sizeof(a))
#define endl '\n'
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <class T, class S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << v.first << ' ' << v.second;
return os;
}
template <class T, class S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
for (auto i : v)
os << '(' << i.first << "=>" << i.second << ')' << ' ';
return os;
}
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <class Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <class Arg1, class... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *sep = strchr(names + 1, ',');
cerr.write(names, sep - names) << " : " << arg1 << " ";
__f(sep + 1, args...);
}
#else
#define trace(...) 0
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target( \
"avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#endif // ifndef ONLINE_JUDGE
template <class T, class cmp = less<T>>
using ordered_set =
tree<T, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
const ll mod = (int)1e9 + 7;
const ll inf = (ll)2e18;
const ll ninf = (ll)-2e18;
ll power(ll x, ll y, ll mod = inf) {
if (y == 0)
return 1LL;
if (y % 2)
return ((x % mod) * power(x, y - 1, mod)) % mod;
return power((x * x) % mod, y / 2, mod);
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
time_t t1, t2;
t1 = clock();
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
int n;
cin >> n;
vector<int> a(n), neg, pos;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
neg.emplace_back(a[i]);
} else {
pos.emplace_back(a[i]);
}
}
int ans = 0;
if (neg.size() % 2 == 0) {
for (int i = 0; i < n; i++) {
ans += abs(a[i]);
}
} else {
sort(a.begin(), a.end(),
[&](int i, int j) -> bool { return abs(i) < abs(j); });
for (int i = 1; i < n; i++) {
ans += abs(a[i]);
}
ans -= abs(a[0]);
}
cout << ans << '\n';
t2 = clock();
#ifndef ONLINE_JUDGE
cerr << endl << "time taken: " << (ld)(t2 - t1) / CLOCKS_PER_SEC << endl;
#endif // ONLINE_JUDGE
return 0;
} | /**
* author: prakhar17252
* created: 27.04.2019 18:27:22
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
#define int ll
#define pb emplace_back
#define push emplace
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define len(a) (int)a.size()
#define reset(a, val) memset(a, val, sizeof(a))
#define endl '\n'
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <class T, class S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << v.first << ' ' << v.second;
return os;
}
template <class T, class S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
for (auto i : v)
os << '(' << i.first << "=>" << i.second << ')' << ' ';
return os;
}
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <class Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <class Arg1, class... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *sep = strchr(names + 1, ',');
cerr.write(names, sep - names) << " : " << arg1 << " ";
__f(sep + 1, args...);
}
#else
#define trace(...) 0
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target( \
"avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#endif // ifndef ONLINE_JUDGE
template <class T, class cmp = less<T>>
using ordered_set =
tree<T, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
const ll mod = (int)1e9 + 7;
const ll inf = (ll)2e18;
const ll ninf = (ll)-2e18;
ll power(ll x, ll y, ll mod = inf) {
if (y == 0)
return 1LL;
if (y % 2)
return ((x % mod) * power(x, y - 1, mod)) % mod;
return power((x * x) % mod, y / 2, mod);
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
time_t t1, t2;
t1 = clock();
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// freopen("error.txt", "w", stderr);
// #endif
int n;
cin >> n;
vector<int> a(n), neg, pos;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
neg.emplace_back(a[i]);
} else {
pos.emplace_back(a[i]);
}
}
int ans = 0;
if (neg.size() % 2 == 0) {
for (int i = 0; i < n; i++) {
ans += abs(a[i]);
}
} else {
sort(a.begin(), a.end(),
[&](int i, int j) -> bool { return abs(i) < abs(j); });
for (int i = 1; i < n; i++) {
ans += abs(a[i]);
}
ans -= abs(a[0]);
}
cout << ans << '\n';
t2 = clock();
#ifndef ONLINE_JUDGE
cerr << endl << "time taken: " << (ld)(t2 - t1) / CLOCKS_PER_SEC << endl;
#endif // ONLINE_JUDGE
return 0;
} | replace | 91 | 96 | 91 | 96 | -6 | |
p03062 | Python | Runtime Error | import math # noqa
import bisect # noqa
import queue # noqa
if __name__ == "__main__":
N = int(input())
A = list(map(int, input().split()))
cnt_neg = 0
abs_min = 1_000_000_005
for a in A:
abs_min = min(abs_min, abs(a))
if a < 0:
cnt_neg += 1
ans = 0
for a in A:
ans += abs(a)
if cnt_neg % 2 != 0:
ans -= 2 * abs_min
print(ans)
| import math # noqa
import bisect # noqa
import queue # noqa
if __name__ == "__main__":
N = int(input())
A = list(map(int, input().split()))
cnt_neg = 0
abs_min = 1000000005
for a in A:
abs_min = min(abs_min, abs(a))
if a < 0:
cnt_neg += 1
ans = 0
for a in A:
ans += abs(a)
if cnt_neg % 2 != 0:
ans -= 2 * abs_min
print(ans)
| replace | 10 | 11 | 10 | 11 | 0 | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9 + 1
#define MOD 0
// #define int ll
using namespace std;
typedef vector<long long> vl;
// int gcd(int a,int b) {
// if(b == 0) {
// return b;
// }
// return gcd(b, a%b);
// }
signed main() {
int n, ch = 0;
ll sum = 0;
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vector<ll> a(10005, INF);
vector<ll> b(10005, INF);
rep(i, n) {
cin >> a[i];
b[i] = a[i];
a[i] = llabs(a[i]);
sum += a[i];
if (a[i] == 0) {
ch = 1;
}
}
if (ch == 1) {
cout << sum << endl;
return 0;
} else {
rep(i, n - 1) {
if (b[i] < 0) {
b[i + 1] = b[i + 1] * (-1);
}
}
}
if (b[n - 1] > 0) {
cout << sum << endl;
} else {
sort(a.begin(), a.end());
sum -= 2 * a[0];
cout << sum << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9 + 1
#define MOD 0
// #define int ll
using namespace std;
typedef vector<long long> vl;
// int gcd(int a,int b) {
// if(b == 0) {
// return b;
// }
// return gcd(b, a%b);
// }
signed main() {
int n, ch = 0;
ll sum = 0;
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vector<ll> a(100050, INF);
vector<ll> b(100050, INF);
rep(i, n) {
cin >> a[i];
b[i] = a[i];
a[i] = llabs(a[i]);
sum += a[i];
if (a[i] == 0) {
ch = 1;
}
}
if (ch == 1) {
cout << sum << endl;
return 0;
} else {
rep(i, n - 1) {
if (b[i] < 0) {
b[i + 1] = b[i + 1] * (-1);
}
}
}
if (b[n - 1] > 0) {
cout << sum << endl;
} else {
sort(a.begin(), a.end());
sum -= 2 * a[0];
cout << sum << endl;
}
return 0;
}
| replace | 25 | 27 | 25 | 27 | 0 | |
p03062 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int n;
ll S = 0;
vector<ll> a, pos, neg;
void solve() {
cin >> n;
a.resize(n, 0);
rep(i, n) {
cin >> a[i];
if (a[i] >= 0)
pos.push_back(a[i]);
else
neg.push_back(a[i]);
}
rep(i, n) {
if (a[i] >= 0)
S += a[i];
else
S -= a[i];
}
if (neg.size() % 2 == 0) {
cout << S << endl;
} else {
sort(neg.begin(), neg.end());
sort(pos.begin(), pos.end());
cout << S - 2 * min(pos[0], -neg.back()) << endl;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
} | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int n;
ll S = 0;
vector<ll> a, pos = {INF}, neg;
void solve() {
cin >> n;
a.resize(n, 0);
rep(i, n) {
cin >> a[i];
if (a[i] >= 0)
pos.push_back(a[i]);
else
neg.push_back(a[i]);
}
rep(i, n) {
if (a[i] >= 0)
S += a[i];
else
S -= a[i];
}
if (neg.size() % 2 == 0) {
cout << S << endl;
} else {
sort(neg.begin(), neg.end());
sort(pos.begin(), pos.end());
cout << S - 2 * min(pos[0], -neg.back()) << endl;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
} | replace | 42 | 43 | 42 | 43 | 0 | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)1e18
#define pii pair<ll, ll>
#define mod 1000000007 // 998244353
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fb(i, a, b) for (ll i = a; i > b; i--)
#define ff first
#define ss second
#define PI 3.141592653589793238
#define pq priority_queue<ll>
#define pqr priority_queue<ll, vector<ll>, greater<ll>()>
using namespace std;
ll pow_mod(ll a, ll b) {
ll res = 1;
while (b != 0) {
if (b & 1) {
res = (res * a) % mod;
}
a = (a * a) % mod;
b /= 2;
}
return res;
}
void solve() {
ll n;
cin >> n;
ll a[n + 1];
for (ll i = 1; i <= n; i++)
cin >> a[i];
ll sum = 0;
ll mn = INF;
vector<ll> v;
for (ll i = 1; i <= n; i++) {
if (a[i] > 0) {
sum += a[i];
mn = min(mn, a[i]);
} else
v.pb(abs(a[i]));
}
if (!v.empty())
sort(v.begin(), v.end());
for (ll i = 1; i < (ll)v.size(); i++)
sum += v[i];
ll sz = (ll)v.size();
if (sz % 2 == 0)
sum += v[0];
if (sz % 2 == 1 && !v.empty()) {
ll x = v[0];
if (x > mn) {
sum -= 2 * mn;
sum += x;
} else
sum -= x;
}
cout << sum << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// Start from Here.
ll t;
t = 1;
// cin>>t;
while (t--)
solve();
// Good Bye!
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)1e18
#define pii pair<ll, ll>
#define mod 1000000007 // 998244353
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fb(i, a, b) for (ll i = a; i > b; i--)
#define ff first
#define ss second
#define PI 3.141592653589793238
#define pq priority_queue<ll>
#define pqr priority_queue<ll, vector<ll>, greater<ll>()>
using namespace std;
ll pow_mod(ll a, ll b) {
ll res = 1;
while (b != 0) {
if (b & 1) {
res = (res * a) % mod;
}
a = (a * a) % mod;
b /= 2;
}
return res;
}
void solve() {
ll n;
cin >> n;
ll a[n + 1];
for (ll i = 1; i <= n; i++)
cin >> a[i];
ll sum = 0;
ll mn = INF;
vector<ll> v;
for (ll i = 1; i <= n; i++) {
if (a[i] > 0) {
sum += a[i];
mn = min(mn, a[i]);
} else
v.pb(abs(a[i]));
}
if (!v.empty())
sort(v.begin(), v.end());
for (ll i = 1; i < (ll)v.size(); i++)
sum += v[i];
ll sz = (ll)v.size();
if (sz % 2 == 0 && !v.empty())
sum += v[0];
if (sz % 2 == 1 && !v.empty()) {
ll x = v[0];
if (x > mn) {
sum -= 2 * mn;
sum += x;
} else
sum -= x;
}
cout << sum << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// Start from Here.
ll t;
t = 1;
// cin>>t;
while (t--)
solve();
// Good Bye!
return 0;
} | replace | 55 | 56 | 55 | 56 | 0 | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
const int MOD = 1e9 + 7, N = 1e5 + 10;
void test();
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
vector<int> a(n);
ll sum_p = 0, sum_n = 0, c = 0;
for (auto &i : a) {
cin >> i;
if (i >= 0) {
sum_p += i;
} else {
c++;
sum_n -= i;
}
i = abs(i);
}
sort(all(a));
ll sum = sum_p + sum_n;
if (c & 1) {
sum -= 2 * a[0];
}
cout << sum << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
const int MOD = 1e9 + 7, N = 1e5 + 10;
void test();
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
vector<int> a(n);
ll sum_p = 0, sum_n = 0, c = 0;
for (auto &i : a) {
cin >> i;
if (i >= 0) {
sum_p += i;
} else {
c++;
sum_n -= i;
}
i = abs(i);
}
sort(all(a));
ll sum = sum_p + sum_n;
if (c & 1) {
sum -= 2 * a[0];
}
cout << sum << "\n";
} | replace | 18 | 22 | 18 | 22 | 0 | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b % 2)
ans = ans * a % MOD;
a = a * a % MOD;
b /= 2;
}
return ans;
}
const int N = 2e5 + 11;
LL n, a[N];
LL ans;
int sta;
vector<LL> l, r;
int main() {
ios::sync_with_stdio(false);
cin >> n;
LL x = 0, sta = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] < 0)
l.pb(a[i]);
else if (a[i] >= 0)
ans += a[i], r.pb(a[i]);
}
sort(l.begin(), l.end());
sort(r.begin(), r.end());
for (int i = 2; i <= l.size(); i += 2) {
ans -= l[i - 1];
ans -= l[i - 2];
}
if (l.size() % 2 == 1) {
if (r.size() && r[0] + l[l.size() - 1] < 0) {
ans -= l[l.size() - 1];
sta = 1;
}
}
if (sta)
ans -= 2 * r[0];
else
ans += l[l.size() - 1];
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b % 2)
ans = ans * a % MOD;
a = a * a % MOD;
b /= 2;
}
return ans;
}
const int N = 2e5 + 11;
LL n, a[N];
LL ans;
int sta;
vector<LL> l, r;
int main() {
ios::sync_with_stdio(false);
cin >> n;
LL x = 0, sta = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] < 0)
l.pb(a[i]);
else if (a[i] >= 0)
ans += a[i], r.pb(a[i]);
}
sort(l.begin(), l.end());
sort(r.begin(), r.end());
for (int i = 2; i <= l.size(); i += 2) {
ans -= l[i - 1];
ans -= l[i - 2];
}
if (l.size() % 2 == 1) {
if (r.size() && r[0] + l[l.size() - 1] < 0) {
ans -= l[l.size() - 1];
sta = 1;
}
}
if (sta)
ans -= 2 * r[0];
else if (l.size() && l.size() % 2 == 1 && !sta)
ans += l[l.size() - 1];
cout << ans << endl;
return 0;
}
| replace | 53 | 54 | 53 | 54 | 0 | |
p03062 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
long long sum = 0;
int m = 1e9 + 1;
int count = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
sum += abs(A[i]);
m = min(abs(A[i]), m);
if (A[i] < 0) {
count++;
}
}
cout << sum - (count % 2 == 0 ? 0 : 2 * m) << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
long long sum = 0;
int m = 1e9 + 1;
int count = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += abs(A[i]);
m = min(abs(A[i]), m);
if (A[i] < 0) {
count++;
}
}
cout << sum - (count % 2 == 0 ? 0 : 2 * m) << endl;
return 0;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p03062 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define sc1(a) scanf("%d", &a)
int main() {
bool f = 0;
long long n, a, b = 0ll, x = 2e9;
sc1(n);
rep(i, n) {
scanf("%lld", &a);
if (a < 0)
f = f ^ 1;
b += abs(a);
x = min(x, abs(a));
}
printf("%lld\n", f ? b - x * 2 : b);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define sc1(a) scanf("%d", &a)
int main() {
bool f = 0;
int n;
long long a, b = 0ll, x = 2e9;
sc1(n);
rep(i, n) {
scanf("%lld", &a);
if (a < 0)
f = f ^ 1;
b += abs(a);
x = min(x, abs(a));
}
printf("%lld\n", f ? b - x * 2 : b);
return 0;
}
| replace | 8 | 9 | 8 | 10 | TLE | |
p03062 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
sort(A.begin(), A.end());
int64_t ans = 0;
for (int i = 0; i < N; i++)
ans += abs(A.at(i));
auto itr = upper_bound(A.begin(), A.end(), 0);
int k = distance(A.begin(), itr);
if (k % 2 == 0)
cout << ans << endl;
else {
int64_t Min = 2 * min(abs(A.at(k - 1)), A.at(k));
ans -= Min;
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
sort(A.begin(), A.end());
int64_t ans = 0;
for (int i = 0; i < N; i++)
ans += abs(A.at(i));
auto itr = upper_bound(A.begin(), A.end(), 0);
int k = distance(A.begin(), itr);
if (k % 2 == 0)
cout << ans << endl;
else if (k == N) {
ans += 2 * A.at(N - 1);
cout << ans << endl;
} else {
int64_t Min = 2 * min(abs(A.at(k - 1)), A.at(k));
ans -= Min;
cout << ans << endl;
}
return 0;
} | replace | 16 | 17 | 16 | 20 | 0 | |
p03062 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll>> mat;
typedef vector<ll> vec;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
#define all(v) (v).begin(), (v).end()
const ll mod = 1000000007;
const ll INF = mod * mod;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
// int qp(int a,ll b){int
// ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
ll qp(ll a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } // 最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } // 最小公倍数
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool chmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool chmin(T &m, const T q) {
if (q < m) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
void solve() {
ll N;
cin >> N;
priority_queue<ll, vec, greater<ll>> plus;
priority_queue<ll> minus;
bool haszero = false;
rep(i, N) {
ll a;
cin >> a;
if (a > 0)
plus.push(a);
else if (a < 0)
minus.push(a);
else
haszero = true;
}
ll sum = 0;
if (minus.size() % 2 == 0 || haszero) {
while (!plus.empty()) {
sum += plus.top();
plus.pop();
}
while (!minus.empty()) {
sum -= minus.top();
minus.pop();
}
} else {
ll b = plus.top();
plus.pop();
ll c = minus.top();
minus.pop();
ll diff = max(b + c, -b - c);
sum += diff;
while (!plus.empty()) {
sum += plus.top();
plus.pop();
}
while (!minus.empty()) {
sum -= minus.top();
minus.pop();
}
}
cout << sum << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
std::cout << fixed << setprecision(10);
solve();
// stop
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll>> mat;
typedef vector<ll> vec;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
#define all(v) (v).begin(), (v).end()
const ll mod = 1000000007;
const ll INF = mod * mod;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
// int qp(int a,ll b){int
// ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
ll qp(ll a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } // 最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } // 最小公倍数
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool chmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool chmin(T &m, const T q) {
if (q < m) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
void solve() {
ll N;
cin >> N;
priority_queue<ll, vec, greater<ll>> plus;
priority_queue<ll> minus;
bool haszero = false;
rep(i, N) {
ll a;
cin >> a;
if (a > 0)
plus.push(a);
else if (a < 0)
minus.push(a);
else
haszero = true;
}
ll sum = 0;
if (minus.size() % 2 == 0 || haszero) {
while (!plus.empty()) {
sum += plus.top();
plus.pop();
}
while (!minus.empty()) {
sum -= minus.top();
minus.pop();
}
} else {
if (!plus.empty() && !minus.empty()) {
ll b = plus.top();
plus.pop();
ll c = minus.top();
minus.pop();
ll diff = max(b + c, -b - c);
sum += diff;
} else if (plus.empty()) {
sum += minus.top();
minus.pop();
}
while (!plus.empty()) {
sum += plus.top();
plus.pop();
}
while (!minus.empty()) {
sum -= minus.top();
minus.pop();
}
}
cout << sum << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
std::cout << fixed << setprecision(10);
solve();
// stop
return 0;
} | replace | 192 | 198 | 192 | 203 | 0 | |
p03063 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
// 1
vector<int> v(N + 1, 0);
for (int i = 1; i <= N; i++)
v[i] = s[i - 1] == '.' ? v[i - 1] + 1 : v[i - 1];
v[N + 1] = v[N];
// 2
int ans = N;
for (int i = 0; i <= N; i++)
ans = min(ans, i - v[i] + v[N] - v[i]);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
// 1
vector<int> v(N + 1, 0);
for (int i = 1; i <= N; i++)
v[i] = s[i - 1] == '.' ? v[i - 1] + 1 : v[i - 1];
// 2
int ans = N;
for (int i = 0; i <= N; i++)
ans = min(ans, i - v[i] + v[N] - v[i]);
cout << ans << endl;
return 0;
}
| delete | 14 | 15 | 14 | 14 | 0 | |
p03063 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, l[100005], r[100005];
char s[100005];
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
for (int i = 1; i <= n; i++) {
l[i] = l[i - 1];
if (s[i] == '#')
l[i]++;
}
for (int i = n; i >= 1; i--) {
r[i] = r[i + 1];
if (s[i] == '.')
r[i]++;
}
int ans = 1e9;
for (int i = 1; i < n; i++)
ans = min(ans, l[i] + r[i + 1]);
ans = min(ans, l[n]);
ans = min(ans, r[1]);
printf("%d\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
int n, l[200005], r[200005];
char s[200005];
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
for (int i = 1; i <= n; i++) {
l[i] = l[i - 1];
if (s[i] == '#')
l[i]++;
}
for (int i = n; i >= 1; i--) {
r[i] = r[i + 1];
if (s[i] == '.')
r[i]++;
}
int ans = 1e9;
for (int i = 1; i < n; i++)
ans = min(ans, l[i] + r[i + 1]);
ans = min(ans, l[n]);
ans = min(ans, r[1]);
printf("%d\n", ans);
}
| replace | 2 | 4 | 2 | 4 | 0 | |
p03063 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int U[50500], V[50500];
int main(void) {
int N;
cin >> N;
string S, tmp;
cin >> tmp;
S = "*" + tmp + "*";
int ans = 300000;
for (int i = 1; i <= N; i++) {
if (S[i] != '.') {
U[i] = U[i - 1] + 1;
} else {
U[i] = U[i - 1];
}
}
for (int i = N; i >= 1; i--) {
if (S[i] != '#') {
V[i] = V[i + 1] + 1;
} else {
V[i] = V[i + 1];
}
}
for (int i = 0; i <= N; i++) {
// cout << "U[" << i << "]= " << U[i] << " V[" << i + 1 << "]= " << V[i +
// 1] << endl;
ans = min(U[i] + V[i + 1], ans);
}
cout << ans << endl;
// system("pause");
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int U[505000], V[505000];
int main(void) {
int N;
cin >> N;
string S, tmp;
cin >> tmp;
S = "*" + tmp + "*";
int ans = 300000;
for (int i = 1; i <= N; i++) {
if (S[i] != '.') {
U[i] = U[i - 1] + 1;
} else {
U[i] = U[i - 1];
}
}
for (int i = N; i >= 1; i--) {
if (S[i] != '#') {
V[i] = V[i + 1] + 1;
} else {
V[i] = V[i + 1];
}
}
for (int i = 0; i <= N; i++) {
// cout << "U[" << i << "]= " << U[i] << " V[" << i + 1 << "]= " << V[i +
// 1] << endl;
ans = min(U[i] + V[i + 1], ans);
}
cout << ans << endl;
// system("pause");
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03063 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt_b[100005] = {0};
int cnt_w[100005] = {0};
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
cnt_b[i + 1] = cnt_b[i] + 1;
cnt_w[i + 1] = cnt_w[i];
} else {
cnt_b[i + 1] = cnt_b[i];
cnt_w[i + 1] = cnt_w[i] + 1;
}
}
int ans = n;
for (int i = 0; i <= n; i++) {
int left_black = cnt_b[i]; // (0, i) に含まれる黒の個数
int right_white = cnt_w[n] - cnt_w[i]; // [i, n+1) に含まれる黒の個数
ans = min(ans, left_black + right_white);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt_b[200005] = {0};
int cnt_w[200005] = {0};
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
cnt_b[i + 1] = cnt_b[i] + 1;
cnt_w[i + 1] = cnt_w[i];
} else {
cnt_b[i + 1] = cnt_b[i];
cnt_w[i + 1] = cnt_w[i] + 1;
}
}
int ans = n;
for (int i = 0; i <= n; i++) {
int left_black = cnt_b[i]; // (0, i) に含まれる黒の個数
int right_white = cnt_w[n] - cnt_w[i]; // [i, n+1) に含まれる黒の個数
ans = min(ans, left_black + right_white);
}
cout << ans << endl;
return 0;
} | replace | 10 | 12 | 10 | 12 | 0 | |
p03063 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long ll;
const int mod = 1e9 + 7;
const ll inf = 3e18 + 5;
int n;
string s;
int dp[200050][2];
bool c[200050];
int f(int a, bool b) {
if (a == n)
return 0;
if (dp[a][b] != -1)
return dp[a][b];
return dp[a][b] =
min(!c[a] + f(a + 1, true), b ? (int)1e9 : c[a] + f(a + 1, false));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin >> n;
cin >> s;
memset(dp, -1, sizeof dp);
bool frt;
for (int i = 0; i < n; i++)
if (s[i] == '#')
c[i] = true;
else
c[i] = false;
cout << f(0, false);
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long ll;
const int mod = 1e9 + 7;
const ll inf = 3e18 + 5;
int n;
string s;
int dp[200050][2];
bool c[200050];
int f(int a, bool b) {
if (a == n)
return 0;
if (dp[a][b] != -1)
return dp[a][b];
return dp[a][b] =
min(!c[a] + f(a + 1, true), b ? (int)1e9 : c[a] + f(a + 1, false));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
cin >> s;
memset(dp, -1, sizeof dp);
bool frt;
for (int i = 0; i < n; i++)
if (s[i] == '#')
c[i] = true;
else
c[i] = false;
cout << f(0, false);
} | delete | 31 | 36 | 31 | 31 | 0 | |
p03063 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
int n, dpw[100001] = {}, dpb[100001] = {}, ans = 1000000;
char s[100100];
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < n; i++) {
dpw[i + 1] = dpw[i];
if (s[i] == '#') {
dpw[i + 1]++;
}
}
for (int i = n - 1; i >= 0; i--) {
dpb[n - i] = dpb[n - 1 - i];
if (s[i] == '.') {
dpb[n - i]++;
}
}
for (int i = 0; i <= n; i++) {
ans = min(ans, dpb[i] + dpw[n - i]);
}
printf("%d\n", ans);
} | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
int n, dpw[200011] = {}, dpb[200011] = {}, ans = 2001000;
char s[200100];
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < n; i++) {
dpw[i + 1] = dpw[i];
if (s[i] == '#') {
dpw[i + 1]++;
}
}
for (int i = n - 1; i >= 0; i--) {
dpb[n - i] = dpb[n - 1 - i];
if (s[i] == '.') {
dpb[n - i]++;
}
}
for (int i = 0; i <= n; i++) {
ans = min(ans, dpb[i] + dpw[n - i]);
}
printf("%d\n", ans);
} | replace | 5 | 7 | 5 | 7 | 0 | |
p03063 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long ll;
/*
黒を白にすることもある
*/
ll n, ru[100010] = {}, ru2[100010] = {}, ans = 1e18;
string s;
bool black = false;
vector<pair<char, int>> v;
void RLE(string &s, vector<pair<char, int>> &v) {
v.push_back({s[0], 0});
for (int i = 0; i < s.size(); i++) {
if (s[i] == v[v.size() - 1].first) {
v[v.size() - 1].second++;
} else {
v.push_back({s[i], 1});
}
}
}
void init() {
cin >> n >> s;
RLE(s, v);
ru[0] = 0;
ru2[0] = 0;
reg(i, 1, v.size()) {
ru[i] = ru[i - 1] + (v[i - 1].first == '#' ? v[i - 1].second : 0);
ru2[i] = ru2[i - 1] + (v[i - 1].first == '.' ? v[i - 1].second : 0);
// cerr<<ru[i]<<","<<ru2[i]<<endl;
}
// rep(i,v.size())cerr<<v[i].first<<","<<v[i].second<<endl;
cerr << "初期化終了" << endl;
}
int main(void) {
init();
reg(i, 0, v.size()) { ans = min(ans, ru[i] + ru2[v.size()] - ru2[i]); }
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long ll;
/*
黒を白にすることもある
*/
ll n, ru[200010] = {}, ru2[200010] = {}, ans = 1e18;
string s;
bool black = false;
vector<pair<char, int>> v;
void RLE(string &s, vector<pair<char, int>> &v) {
v.push_back({s[0], 0});
for (int i = 0; i < s.size(); i++) {
if (s[i] == v[v.size() - 1].first) {
v[v.size() - 1].second++;
} else {
v.push_back({s[i], 1});
}
}
}
void init() {
cin >> n >> s;
RLE(s, v);
ru[0] = 0;
ru2[0] = 0;
reg(i, 1, v.size()) {
ru[i] = ru[i - 1] + (v[i - 1].first == '#' ? v[i - 1].second : 0);
ru2[i] = ru2[i - 1] + (v[i - 1].first == '.' ? v[i - 1].second : 0);
// cerr<<ru[i]<<","<<ru2[i]<<endl;
}
// rep(i,v.size())cerr<<v[i].first<<","<<v[i].second<<endl;
cerr << "初期化終了" << endl;
}
int main(void) {
init();
reg(i, 0, v.size()) { ans = min(ans, ru[i] + ru2[v.size()] - ru2[i]); }
cout << ans << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | 初期化終了
|
p03063 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 0x7fffffff
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 1e5 + 5;
char s[Maxn];
int n, f[Maxn][2];
int main() {
cin >> n >> s + 1;
for (int i = 1; i <= n; i++) {
f[i][0] = f[i - 1][0] + (s[i] != '.');
f[i][1] = min(f[i - 1][0], f[i - 1][1]) + (s[i] != '#');
}
cout << min(f[n][0], f[n][1]) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define INF 0x7fffffff
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 2e5 + 5;
char s[Maxn];
int n, f[Maxn][2];
int main() {
cin >> n >> s + 1;
for (int i = 1; i <= n; i++) {
f[i][0] = f[i - 1][0] + (s[i] != '.');
f[i][1] = min(f[i - 1][0], f[i - 1][1]) + (s[i] != '#');
}
cout << min(f[n][0], f[n][1]) << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03063 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define x first
#define y second
#define all(aaa) (aaa).begin(), (aaa).end()
#define REP(i, sss, eee) for (int i = sss; i <= eee; ++i)
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define N 1000000007
#define inf 1000000000000000000
using namespace __gnu_pbds;
using namespace std;
template <class T> T MAX(T a, T b) { return ((a > b) ? a : b); }
template <class T> T MIN(T a, T b) { return ((a < b) ? a : b); }
template <class T> T MOD(T a) { return ((a >= 0) ? a : (-1 * a)); }
template <class T> void SWAP(T &a, T &b) {
T temp = a;
a = b;
b = temp;
}
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set; // for multiset use less_equal above
inline int ex(int a, int b) {
if (b == 0 || a == 1) {
return 1;
}
if (a == 0 || b == 1) {
return a;
}
int tmp = ex(a, (b / 2));
if (b % 2) {
return ((((tmp * tmp) % N) * a) % N);
} else {
return ((tmp * tmp) % N);
}
}
inline int inv(int k) {
if (k == 1) {
return 1;
} else {
return ex(k, N - 2);
}
}
/*****************default********************/
int solve() {
int n;
cin >> n;
string str;
cin >> str;
std::vector<int> pref(n + 1, 0);
REP(i, 0, n - 1) {
pref[i + 1] = pref[i];
if (str[i] == '#') {
pref[i + 1]++;
}
}
std::vector<int> suff(n + 1, 0);
for (int i = n - 1; i >= 0; --i) {
suff[i] = suff[i + 1];
if (str[i] == '.') {
++suff[i];
}
}
int ans = 10000000000000000;
REP(partition, 0, n) { ans = MIN(ans, (pref[partition] + suff[partition])); }
cout << ans << "\n";
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
speed int tt = 1;
// cin>>tt;
while (tt--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define x first
#define y second
#define all(aaa) (aaa).begin(), (aaa).end()
#define REP(i, sss, eee) for (int i = sss; i <= eee; ++i)
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define N 1000000007
#define inf 1000000000000000000
using namespace __gnu_pbds;
using namespace std;
template <class T> T MAX(T a, T b) { return ((a > b) ? a : b); }
template <class T> T MIN(T a, T b) { return ((a < b) ? a : b); }
template <class T> T MOD(T a) { return ((a >= 0) ? a : (-1 * a)); }
template <class T> void SWAP(T &a, T &b) {
T temp = a;
a = b;
b = temp;
}
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set; // for multiset use less_equal above
inline int ex(int a, int b) {
if (b == 0 || a == 1) {
return 1;
}
if (a == 0 || b == 1) {
return a;
}
int tmp = ex(a, (b / 2));
if (b % 2) {
return ((((tmp * tmp) % N) * a) % N);
} else {
return ((tmp * tmp) % N);
}
}
inline int inv(int k) {
if (k == 1) {
return 1;
} else {
return ex(k, N - 2);
}
}
/*****************default********************/
int solve() {
int n;
cin >> n;
string str;
cin >> str;
std::vector<int> pref(n + 1, 0);
REP(i, 0, n - 1) {
pref[i + 1] = pref[i];
if (str[i] == '#') {
pref[i + 1]++;
}
}
std::vector<int> suff(n + 1, 0);
for (int i = n - 1; i >= 0; --i) {
suff[i] = suff[i + 1];
if (str[i] == '.') {
++suff[i];
}
}
int ans = 10000000000000000;
REP(partition, 0, n) { ans = MIN(ans, (pref[partition] + suff[partition])); }
cout << ans << "\n";
}
signed main() {
speed int tt = 1;
// cin>>tt;
while (tt--) {
solve();
}
return 0;
} | delete | 77 | 81 | 77 | 77 | -11 | |
p03063 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << "\n"
#define all(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define oorret 0
#define oor(x) \
[&]() { \
try { \
x; \
} catch (const out_of_range &oor) { \
return oorret; \
} \
return x; \
}()
typedef long long ll;
typedef pair<int, int> P;
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;
}
int n;
int main() {
cin >> n;
string s;
cin >> s;
int l = n;
vector<int> b(n, 0);
vector<int> w(n, 0);
vector<int> sb(n + 1, 0);
vector<int> sw(n + 1, 0);
vector<int> bp;
REP(i, n) {
if (s[i] == '.') {
w[i] = 1;
} else {
bp.push_back(i);
b[i] = 1;
}
}
REP(i, n + 1) {
sw[i + 1] = sw[i] + w[i];
sb[i + 1] = sb[i] + b[i];
}
/*REP(i,n){
if(b[i]==1){
int temp = sb[i]-sb[0] + sw[n]- sw[i];
chmin(res,temp);
}
}*/
int res = bp.size();
REP(i, bp.size()) {
int temp = i + sw[n] - sw[bp[i]];
chmin(res, temp);
}
put(res);
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << "\n"
#define all(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define oorret 0
#define oor(x) \
[&]() { \
try { \
x; \
} catch (const out_of_range &oor) { \
return oorret; \
} \
return x; \
}()
typedef long long ll;
typedef pair<int, int> P;
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;
}
int n;
int main() {
cin >> n;
string s;
cin >> s;
int l = n;
vector<int> b(n, 0);
vector<int> w(n, 0);
vector<int> sb(n + 1, 0);
vector<int> sw(n + 1, 0);
vector<int> bp;
REP(i, n) {
if (s[i] == '.') {
w[i] = 1;
} else {
bp.push_back(i);
b[i] = 1;
}
}
REP(i, n) {
sw[i + 1] = sw[i] + w[i];
sb[i + 1] = sb[i] + b[i];
}
/*REP(i,n){
if(b[i]==1){
int temp = sb[i]-sb[0] + sw[n]- sw[i];
chmin(res,temp);
}
}*/
int res = bp.size();
REP(i, bp.size()) {
int temp = i + sw[n] - sw[bp[i]];
chmin(res, temp);
}
put(res);
return 0;
}
| replace | 57 | 58 | 57 | 58 | 0 | |
p03063 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// #define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(s, v, it) for (s::iterator it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define mp make_pair
#define pb push_back
#define pof pop_front
#define pob pop_back
#define fi first
#define se second
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(x) freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef queue<int> qi;
typedef queue<pii> qii;
typedef set<int> si;
typedef map<int, int> mii;
typedef map<string, int> msi;
const int N = 100010;
const int INF = 0x3f3f3f3f;
const int iinf = 1 << 30;
const ll linf = 2e18;
const int MOD = 1000000007;
const double eps = 1e-7;
void douout(double x) { printf("%lf\n", x + 0.0000000001); }
template <class T> void print(T a) {
cout << a << endl;
exit(0);
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void upd(T &a, T b) { (a += b) %= MOD; }
template <class T> void mul(T &a, T b) { a = (ll)a * b % MOD; }
int n, ans;
int a[N], b[N];
signed main() {
// file("test") ;
scanf("%d", &n);
string s;
cin >> s;
rep(i, 0, n - 1) a[i + 1] = a[i] + (s[i] == '#');
per(i, n - 1, 0) b[i] = b[i + 1] + (s[i] == '.');
int ans = n;
rep(i, 0, n) chmin(ans, a[i] + b[i]);
printf("%d\n", ans);
return 0;
}
/*
写代码时请注意：
1.ll？数组大小，边界？数据范围？
2.精度？
3.特判？
4.至少做一些
思考提醒：
1.最大值最小->二分？
2.可以贪心么？不行dp可以么
3.可以优化么
4.维护区间用什么数据结构？
5.统计方案是用dp？模了么？
6.逆向思维？
*/
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// #define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(s, v, it) for (s::iterator it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define mp make_pair
#define pb push_back
#define pof pop_front
#define pob pop_back
#define fi first
#define se second
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(x) freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef queue<int> qi;
typedef queue<pii> qii;
typedef set<int> si;
typedef map<int, int> mii;
typedef map<string, int> msi;
const int N = 200010;
const int INF = 0x3f3f3f3f;
const int iinf = 1 << 30;
const ll linf = 2e18;
const int MOD = 1000000007;
const double eps = 1e-7;
void douout(double x) { printf("%lf\n", x + 0.0000000001); }
template <class T> void print(T a) {
cout << a << endl;
exit(0);
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void upd(T &a, T b) { (a += b) %= MOD; }
template <class T> void mul(T &a, T b) { a = (ll)a * b % MOD; }
int n, ans;
int a[N], b[N];
signed main() {
// file("test") ;
scanf("%d", &n);
string s;
cin >> s;
rep(i, 0, n - 1) a[i + 1] = a[i] + (s[i] == '#');
per(i, n - 1, 0) b[i] = b[i + 1] + (s[i] == '.');
int ans = n;
rep(i, 0, n) chmin(ans, a[i] + b[i]);
printf("%d\n", ans);
return 0;
}
/*
写代码时请注意：
1.ll？数组大小，边界？数据范围？
2.精度？
3.特判？
4.至少做一些
思考提醒：
1.最大值最小->二分？
2.可以贪心么？不行dp可以么
3.可以优化么
4.维护区间用什么数据结构？
5.统计方案是用dp？模了么？
6.逆向思维？
*/
| replace | 52 | 53 | 52 | 53 | 0 | |
p03063 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;
const int MAX_N = 1e5 + 10;
int dp[MAX_N][2];
template <typename T> T chmax(T &a, const T &b) { return a = (a > b ? a : b); }
template <typename T> T chmin(T &a, const T &b) { return a = (a < b ? a : b); }
int main() {
rep(i, MAX_N) rep(j, 2) dp[i][j] = INF;
int n;
cin >> n;
string s;
cin >> s;
if (s[0] == '#') {
dp[0][1] = 0;
dp[0][0] = 1;
} else {
dp[0][0] = 0;
dp[0][1] = 1;
}
REP(i, 1, n) {
if (s[i] == '#') {
chmin(dp[i][1], dp[i - 1][1]);
chmin(dp[i][1], dp[i - 1][0]);
// chmin(dp[i][0], dp[i-1][1]+1);
chmin(dp[i][0], dp[i - 1][0] + 1);
} else {
chmin(dp[i][0], dp[i - 1][0]);
// chmin(dp[i][0], dp[i-1][1]);
chmin(dp[i][1], dp[i - 1][0] + 1);
chmin(dp[i][1], dp[i - 1][1] + 1);
}
}
cout << min(dp[n - 1][0], dp[n - 1][1]) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;
const int MAX_N = 2e5 + 10;
int dp[MAX_N][2];
template <typename T> T chmax(T &a, const T &b) { return a = (a > b ? a : b); }
template <typename T> T chmin(T &a, const T &b) { return a = (a < b ? a : b); }
int main() {
rep(i, MAX_N) rep(j, 2) dp[i][j] = INF;
int n;
cin >> n;
string s;
cin >> s;
if (s[0] == '#') {
dp[0][1] = 0;
dp[0][0] = 1;
} else {
dp[0][0] = 0;
dp[0][1] = 1;
}
REP(i, 1, n) {
if (s[i] == '#') {
chmin(dp[i][1], dp[i - 1][1]);
chmin(dp[i][1], dp[i - 1][0]);
// chmin(dp[i][0], dp[i-1][1]+1);
chmin(dp[i][0], dp[i - 1][0] + 1);
} else {
chmin(dp[i][0], dp[i - 1][0]);
// chmin(dp[i][0], dp[i-1][1]);
chmin(dp[i][1], dp[i - 1][0] + 1);
chmin(dp[i][1], dp[i - 1][1] + 1);
}
}
cout << min(dp[n - 1][0], dp[n - 1][1]) << endl;
return 0;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p03063 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 1e5;
int cntW[N];
int cntB[N];
int main() {
int n;
string s;
cin >> n >> s;
cntW[0] = cntB[0] = 0;
for (int i = 0; i < n; ++i) {
cntW[i + 1] = cntW[i] + (s[i] == '.');
cntB[i + 1] = cntB[i] + (s[i] == '#');
}
int ans = 1e9;
for (int i = 0; i <= n; ++i)
ans = min(ans, cntB[i] + cntW[n] - cntW[i]);
printf("%d", ans);
}
| #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 2e5 + 5;
int cntW[N];
int cntB[N];
int main() {
int n;
string s;
cin >> n >> s;
cntW[0] = cntB[0] = 0;
for (int i = 0; i < n; ++i) {
cntW[i + 1] = cntW[i] + (s[i] == '.');
cntB[i + 1] = cntB[i] + (s[i] == '#');
}
int ans = 1e9;
for (int i = 0; i <= n; ++i)
ans = min(ans, cntB[i] + cntW[n] - cntW[i]);
printf("%d", ans);
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p03063 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
int N;
int S[100010];
char s[100010];
int main() {
scanf("%d", &N);
scanf("%s", s + 1);
for (int i = 1; i <= N; i++) {
S[i] = S[i - 1];
if (s[i] == '#') {
S[i]++;
}
}
int ans = 1e9;
for (int i = 0; i <= N; i++) {
ans = min(ans, S[i] + N - i - (S[N] - S[i]));
}
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
int N;
int S[200010];
char s[200010];
int main() {
scanf("%d", &N);
scanf("%s", s + 1);
for (int i = 1; i <= N; i++) {
S[i] = S[i - 1];
if (s[i] == '#') {
S[i]++;
}
}
int ans = 1e9;
for (int i = 0; i <= N; i++) {
ans = min(ans, S[i] + N - i - (S[N] - S[i]));
}
printf("%d\n", ans);
} | replace | 8 | 10 | 8 | 10 | 0 | |
p03063 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 5;
int n;
char a[maxn];
int pre[maxn];
void inline Init() {
scanf("%d %s", &n, a + 1);
for (int i = 1; i <= n; ++i)
pre[i] = pre[i - 1] + (a[i] == '#');
}
int ans = 0x7fffffff;
void inline Solve() {
for (int i = 0; i <= n; ++i) {
int x = pre[i];
int y = (n - i) - (pre[n] - pre[i]);
// cerr << x << ' ' << y << endl;
ans = min(ans, x + y);
}
printf("%d\n", ans);
}
int main() {
Init();
Solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 5;
int n;
char a[maxn];
int pre[maxn];
void inline Init() {
scanf("%d %s", &n, a + 1);
for (int i = 1; i <= n; ++i)
pre[i] = pre[i - 1] + (a[i] == '#');
}
int ans = 0x7fffffff;
void inline Solve() {
for (int i = 0; i <= n; ++i) {
int x = pre[i];
int y = (n - i) - (pre[n] - pre[i]);
// cerr << x << ' ' << y << endl;
ans = min(ans, x + y);
}
printf("%d\n", ans);
}
int main() {
Init();
Solve();
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p03063 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <tuple>
#include <vector>
using namespace std;
#define FOR(i, init, a) for (int i = init; i < a; i++)
#define rep(i, a) FOR(i, 0, a)
#define rrep(i, a) for (int i = a; i >= 0; i--)
#define rep1(i, a) for (int i = 1; i <= a; i++)
#define cout1(a) cout << a << endl;
#define cout2(a, b) cout << a << " " << b << endl;
#define cout3(a, b, c) cout << a << " " << b << " " << c << endl;
#define cout4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl;
#define mem(a, n) memset(a, n, sizeof(a))
#define all(a) a.begin(), a.end()
#define chmin(a, b) a = min(a, b);
#define chmax(a, b) a = max(a, b);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LLINF = 1e18;
static const double pi = 3.141592653589793;
int N;
int cntw[100009], cntb[100009];
int rw[100009], rb[100009];
string stn;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> stn;
rep(i, N) {
if (stn[i] == '.') {
cntw[i]++;
} else {
cntb[i]++;
}
if (i) {
cntw[i] += cntw[i - 1];
cntb[i] += cntb[i - 1];
}
}
rrep(i, N - 1) {
if (stn[i] == '.') {
rw[i]++;
} else {
rb[i]++;
}
if (i < N - 1) {
rw[i] += rw[i + 1];
rb[i] += rb[i + 1];
}
}
int ans = min(cntb[N - 1], cntw[N - 1]);
rep(i, N) {
int n = cntb[i] + rw[i + 1];
chmin(ans, n)
}
cout1(ans)
} | #include "bits/stdc++.h"
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <tuple>
#include <vector>
using namespace std;
#define FOR(i, init, a) for (int i = init; i < a; i++)
#define rep(i, a) FOR(i, 0, a)
#define rrep(i, a) for (int i = a; i >= 0; i--)
#define rep1(i, a) for (int i = 1; i <= a; i++)
#define cout1(a) cout << a << endl;
#define cout2(a, b) cout << a << " " << b << endl;
#define cout3(a, b, c) cout << a << " " << b << " " << c << endl;
#define cout4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl;
#define mem(a, n) memset(a, n, sizeof(a))
#define all(a) a.begin(), a.end()
#define chmin(a, b) a = min(a, b);
#define chmax(a, b) a = max(a, b);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LLINF = 1e18;
static const double pi = 3.141592653589793;
int N;
int cntw[200009], cntb[200009];
int rw[200009], rb[200009];
string stn;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> stn;
rep(i, N) {
if (stn[i] == '.') {
cntw[i]++;
} else {
cntb[i]++;
}
if (i) {
cntw[i] += cntw[i - 1];
cntb[i] += cntb[i - 1];
}
}
rrep(i, N - 1) {
if (stn[i] == '.') {
rw[i]++;
} else {
rb[i]++;
}
if (i < N - 1) {
rw[i] += rw[i + 1];
rb[i] += rb[i + 1];
}
}
int ans = min(cntb[N - 1], cntw[N - 1]);
rep(i, N) {
int n = cntb[i] + rw[i + 1];
chmin(ans, n)
}
cout1(ans)
} | replace | 38 | 40 | 38 | 40 | 0 | |
p03063 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, ans[20001] = {0};
string s;
cin >> n >> s;
reverse(s.begin(), s.end());
rep(i, n) if (s[i] == '#') ans[0]++;
rep(i, n) {
if (s[i] == '#')
ans[i + 1] = ans[i] - 1;
else
ans[i + 1] = ans[i] + 1;
}
sort(ans, ans + n + 1);
cout << ans[0];
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, ans[200001] = {0};
string s;
cin >> n >> s;
reverse(s.begin(), s.end());
rep(i, n) if (s[i] == '#') ans[0]++;
rep(i, n) {
if (s[i] == '#')
ans[i + 1] = ans[i] - 1;
else
ans[i + 1] = ans[i] + 1;
}
sort(ans, ans + n + 1);
cout << ans[0];
} | replace | 4 | 5 | 4 | 5 | 0 | |
p03063 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
const int N = 100005;
int n, sum[N], b[N], ans = 1e9;
char s[N];
inline void read(int &i) {
i = 0;
char c = getchar();
bool j = 0;
for (; !isdigit(c); c = getchar())
if (c == '-')
j = 1;
for (; isdigit(c); c = getchar())
i = (i << 1) + (i << 3) + c - '0';
i = j ? -i : i;
}
int main() {
read(n);
scanf("%s", s + 1);
for (int i = 1; i <= n; ++i)
sum[i] = sum[i - 1] + (s[i] == '.');
for (int i = n; i >= 1; --i)
b[i] = b[i + 1] + (s[i] == '#');
for (int i = 0; i <= n; ++i) {
ans = min(ans, (i - sum[i]) + (n - i - b[i + 1]));
}
printf("%d\n", ans);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
const int N = 200005;
int n, sum[N], b[N], ans = 1e9;
char s[N];
inline void read(int &i) {
i = 0;
char c = getchar();
bool j = 0;
for (; !isdigit(c); c = getchar())
if (c == '-')
j = 1;
for (; isdigit(c); c = getchar())
i = (i << 1) + (i << 3) + c - '0';
i = j ? -i : i;
}
int main() {
read(n);
scanf("%s", s + 1);
for (int i = 1; i <= n; ++i)
sum[i] = sum[i - 1] + (s[i] == '.');
for (int i = n; i >= 1; --i)
b[i] = b[i + 1] + (s[i] == '#');
for (int i = 0; i <= n; ++i) {
ans = min(ans, (i - sum[i]) + (n - i - b[i + 1]));
}
printf("%d\n", ans);
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03063 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int B[101010];
int W[101010];
int b(int l, int r) { return B[r] - B[l - 1]; }
int w(int l, int r) { return W[r] - W[l - 1]; }
int main() {
int N;
cin >> N;
int ans = N;
for (int i = 2; i <= N + 1; i++) {
char c;
cin >> c;
B[i] = B[i - 1];
W[i] = W[i - 1];
if (c == '#')
B[i]++;
else
W[i]++;
}
B[N + 2] = B[N + 1];
W[N + 2] = W[N + 1];
for (int i = 1; i <= N + 1; i++) {
int tmp = b(1, i) + w(i + 1, N + 2);
ans = min(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int B[201010];
int W[201010];
int b(int l, int r) { return B[r] - B[l - 1]; }
int w(int l, int r) { return W[r] - W[l - 1]; }
int main() {
int N;
cin >> N;
int ans = N;
for (int i = 2; i <= N + 1; i++) {
char c;
cin >> c;
B[i] = B[i - 1];
W[i] = W[i - 1];
if (c == '#')
B[i]++;
else
W[i]++;
}
B[N + 2] = B[N + 1];
W[N + 2] = W[N + 1];
for (int i = 1; i <= N + 1; i++) {
int tmp = b(1, i) + w(i + 1, N + 2);
ans = min(ans, tmp);
}
cout << ans << endl;
return 0;
} | replace | 4 | 6 | 4 | 6 | 0 | |
p03063 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i, a, b, c) for (int(i) = (a); (i) <= (b); (i) += (c))
#define fdn(i, a, b, c) for (int(i) = (a); (i) >= (b); (i) -= (c))
#define MEM0(a) memset((a), 0, sizeof(a));
#define MEM_1(a) memset((a), -1, sizeof(a));
#define ALL(a) a.begin(), a.end()
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {
ll ret = 1;
for (; b; b >>= 1, a = (a * a) % MMM)
if (b & 1)
ret = (ret * a) % MMM;
return ret;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return a + b;
return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
int n;
char s[100001];
int a[100001], b[100001];
int main() {
scanf("%d%s", &n, s);
a[0] = (s[0] == '.'), b[0] = (s[0] == '#');
fup(i, 1, n - 1, 1) {
a[i] = a[i - 1] + (s[i] == '.');
b[i] = i + 1 - a[i];
}
int ans = a[n - 1];
fup(i, 0, n - 1, 1) ans = min(ans, b[i] + a[n - 1] - a[i]);
printf("%d", ans);
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i, a, b, c) for (int(i) = (a); (i) <= (b); (i) += (c))
#define fdn(i, a, b, c) for (int(i) = (a); (i) >= (b); (i) -= (c))
#define MEM0(a) memset((a), 0, sizeof(a));
#define MEM_1(a) memset((a), -1, sizeof(a));
#define ALL(a) a.begin(), a.end()
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {
ll ret = 1;
for (; b; b >>= 1, a = (a * a) % MMM)
if (b & 1)
ret = (ret * a) % MMM;
return ret;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return a + b;
return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
int n;
char s[200001];
int a[200001], b[200001];
int main() {
scanf("%d%s", &n, s);
a[0] = (s[0] == '.'), b[0] = (s[0] == '#');
fup(i, 1, n - 1, 1) {
a[i] = a[i - 1] + (s[i] == '.');
b[i] = i + 1 - a[i];
}
int ans = a[n - 1];
fup(i, 0, n - 1, 1) ans = min(ans, b[i] + a[n - 1] - a[i]);
printf("%d", ans);
} | replace | 75 | 77 | 75 | 77 | 0 | |
p03063 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1 << 30;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
vector<int> b(n, INF), w(n, INF);
b[0] = w[0] = 0;
for (int i = 0; i < n; i++) {
b[i + 1] = min(b[i], w[i]) + (s[i] != '#');
w[i + 1] = w[i] + (s[i] != '.');
}
cout << min(b[n], w[n]) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1 << 30;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
vector<int> b(n + 1, INF), w(n + 1, INF);
b[0] = w[0] = 0;
for (int i = 0; i < n; i++) {
b[i + 1] = min(b[i], w[i]) + (s[i] != '#');
w[i + 1] = w[i] + (s[i] != '.');
}
cout << min(b[n], w[n]) << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | -6 | free(): invalid pointer
|
p03064 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int max_n = 305;
const int mod = 998244353;
int n, a[max_n];
int dp[max_n][max_n];
int f[max_n][max_n];
int Pow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = 1ll * res * a % mod;
b >>= 1;
a = 1ll * a * a % mod;
}
return res;
}
int main() {
scanf("%d", &n);
int sum = 0;
for (int i = 1; i <= n; i++)
scanf("%d", a + i), sum += a[i];
int t = (sum + 1) / 2;
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= sum; j++) {
dp[i][j] += dp[i - 1][j] * 2 % mod, dp[i][j] %= mod;
if (j >= a[i])
dp[i][j] += dp[i - 1][j - a[i]], dp[i][j] %= mod;
}
}
int ans = 0;
for (int i = t; i <= sum; i++)
ans += dp[n][i], ans %= mod;
ans = 1ll * ans * 3 % mod;
if (sum % 2 == 0) {
f[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= sum; j++) {
f[i][j] += f[i - 1][j], f[i][j] %= mod;
if (j >= a[i])
f[i][j] += f[i - 1][j - a[i]], f[i][j] %= mod;
}
}
ans += mod - 1ll * 3 * f[n][t] % mod, ans %= mod;
}
ans = (Pow(3, n) + mod - ans) % mod;
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int max_n = 305;
const int mod = 998244353;
int n, a[max_n];
int dp[max_n][90005];
int f[max_n][90005];
int Pow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = 1ll * res * a % mod;
b >>= 1;
a = 1ll * a * a % mod;
}
return res;
}
int main() {
scanf("%d", &n);
int sum = 0;
for (int i = 1; i <= n; i++)
scanf("%d", a + i), sum += a[i];
int t = (sum + 1) / 2;
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= sum; j++) {
dp[i][j] += dp[i - 1][j] * 2 % mod, dp[i][j] %= mod;
if (j >= a[i])
dp[i][j] += dp[i - 1][j - a[i]], dp[i][j] %= mod;
}
}
int ans = 0;
for (int i = t; i <= sum; i++)
ans += dp[n][i], ans %= mod;
ans = 1ll * ans * 3 % mod;
if (sum % 2 == 0) {
f[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= sum; j++) {
f[i][j] += f[i - 1][j], f[i][j] %= mod;
if (j >= a[i])
f[i][j] += f[i - 1][j - a[i]], f[i][j] %= mod;
}
}
ans += mod - 1ll * 3 * f[n][t] % mod, ans %= mod;
}
ans = (Pow(3, n) + mod - ans) % mod;
printf("%d\n", ans);
return 0;
}
| replace | 6 | 8 | 6 | 8 | 0 | |
p03064 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 300
#define A 300
#define mod 998244353
int a[N + 1], dp1[2][N * A / 2 + 1], dp2[2][N * A / 2 + 1], Sum[N + 1];
int main() {
int n, imp = 0, power = 1, i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", a + i), Sum[i] = Sum[i - 1] + a[i], power = 3ll * power % mod;
dp1[0][0] = 1;
for (i = 1; i <= n; i++)
for (j = 0; j <= Sum[i]; j++)
dp1[i & 1][j] = (2 * dp1[i - 1 & 1][j] % mod +
(j >= a[i] ? dp1[i - 1 & 1][j - a[i]] : 0)) %
mod
// ,printf("dp[%d][%d]=%d\n",i,j,dp1[i&1][j])
;
for (i = Sum[n] + 1 >> 1; i <= Sum[n]; i++)
imp += 3ll * dp1[n & 1][i] % mod, imp %= mod;
if (!(Sum[n] & 1)) {
dp2[0][0] = 1;
for (i = 1; i <= n; i++)
for (j = 0; j <= Sum[i]; j++)
dp2[i & 1][j] =
(dp2[i - 1 & 1][j] + (j >= a[i] ? dp2[i - 1 & 1][j - a[i]] : 0)) %
mod;
imp -= 3ll * dp2[n & 1][Sum[n] >> 1] % mod;
while (imp < 0)
imp += mod;
imp %= mod;
}
power -= imp;
if (power < 0)
power += mod;
printf("%d\n", power);
return 0;
}
/*1
4
1
1
1
2
*/
/*2
6
1
3
2
3
5
2
*/
/*3
20
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9
3
2
3
8
4
*/ | #include <bits/stdc++.h>
using namespace std;
#define N 300
#define A 300
#define mod 998244353
int a[N + 1], dp1[2][N * A + 1], dp2[2][N * A + 1], Sum[N + 1];
int main() {
int n, imp = 0, power = 1, i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", a + i), Sum[i] = Sum[i - 1] + a[i], power = 3ll * power % mod;
dp1[0][0] = 1;
for (i = 1; i <= n; i++)
for (j = 0; j <= Sum[i]; j++)
dp1[i & 1][j] = (2 * dp1[i - 1 & 1][j] % mod +
(j >= a[i] ? dp1[i - 1 & 1][j - a[i]] : 0)) %
mod
// ,printf("dp[%d][%d]=%d\n",i,j,dp1[i&1][j])
;
for (i = Sum[n] + 1 >> 1; i <= Sum[n]; i++)
imp += 3ll * dp1[n & 1][i] % mod, imp %= mod;
if (!(Sum[n] & 1)) {
dp2[0][0] = 1;
for (i = 1; i <= n; i++)
for (j = 0; j <= Sum[i]; j++)
dp2[i & 1][j] =
(dp2[i - 1 & 1][j] + (j >= a[i] ? dp2[i - 1 & 1][j - a[i]] : 0)) %
mod;
imp -= 3ll * dp2[n & 1][Sum[n] >> 1] % mod;
while (imp < 0)
imp += mod;
imp %= mod;
}
power -= imp;
if (power < 0)
power += mod;
printf("%d\n", power);
return 0;
}
/*1
4
1
1
1
2
*/
/*2
6
1
3
2
3
5
2
*/
/*3
20
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9
3
2
3
8
4
*/ | replace | 5 | 6 | 5 | 6 | 0 | |
p03064 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
ll n, a[330] = {0}, sum = 0;
ll dp[2][300][90010] = {0};
ll power(ll a, ll b) {
if (b == 0) {
return 1;
} else if (b == 1) {
return a % MOD;
} else if (b % 2 == 0) {
ll c = power(a, b / 2);
return (c * c) % MOD;
} else {
ll c = power(a, b / 2);
return (((c * c) % MOD) * a) % MOD;
}
}
signed main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
dp[0][0][0] = 1;
ll s1 = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= sum; ++j) {
if (j - a[i - 1] >= 0) {
dp[0][i][j] += dp[0][i - 1][j - a[i - 1]];
}
dp[0][i][j] += 2 * dp[0][i - 1][j];
dp[0][i][j] %= MOD;
if ((sum + 1) / 2 <= j && i == n)
s1 = (s1 + dp[0][i][j]) % MOD;
}
}
dp[1][0][0] = 1;
ll s2 = 0;
if (sum % 2 == 0) {
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= sum; ++j) {
if (j - a[i - 1] >= 0) {
dp[1][i][j] += dp[1][i - 1][j - a[i - 1]];
}
dp[1][i][j] += dp[1][i - 1][j];
dp[1][i][j] %= MOD;
if (sum / 2 == j && i == n)
s2 = (s2 + dp[1][i][j]) % MOD;
}
}
}
ll res = power(3, n);
res = (res + MOD - 3 * s1) % MOD;
res = (res + MOD + 3 * s2) % MOD;
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
ll n, a[330] = {0}, sum = 0;
ll dp[2][310][90010] = {0};
ll power(ll a, ll b) {
if (b == 0) {
return 1;
} else if (b == 1) {
return a % MOD;
} else if (b % 2 == 0) {
ll c = power(a, b / 2);
return (c * c) % MOD;
} else {
ll c = power(a, b / 2);
return (((c * c) % MOD) * a) % MOD;
}
}
signed main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
dp[0][0][0] = 1;
ll s1 = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= sum; ++j) {
if (j - a[i - 1] >= 0) {
dp[0][i][j] += dp[0][i - 1][j - a[i - 1]];
}
dp[0][i][j] += 2 * dp[0][i - 1][j];
dp[0][i][j] %= MOD;
if ((sum + 1) / 2 <= j && i == n)
s1 = (s1 + dp[0][i][j]) % MOD;
}
}
dp[1][0][0] = 1;
ll s2 = 0;
if (sum % 2 == 0) {
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= sum; ++j) {
if (j - a[i - 1] >= 0) {
dp[1][i][j] += dp[1][i - 1][j - a[i - 1]];
}
dp[1][i][j] += dp[1][i - 1][j];
dp[1][i][j] %= MOD;
if (sum / 2 == j && i == n)
s2 = (s2 + dp[1][i][j]) % MOD;
}
}
}
ll res = power(3, n);
res = (res + MOD - 3 * s1) % MOD;
res = (res + MOD + 3 * s2) % MOD;
cout << res << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | -11 | |
p03064 | C++ | Runtime Error | // template version 1.8
// varibable settings {{{
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
#define int long long
#define INF 1e18
// #define INF 2147483647
#define MOD 998244353
#define infile "../test/sample-1.in"
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
#define fi first
#define se second
// }}}
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) \
sort(all(x)); \
x.erase(unique(all(x)), x.end())
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;
template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
// dump macro
#ifdef PCM
#include "dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
// }}}
int dp[300][50000];
int dp2[300][50000];
int solve() {
int n;
cin >> n;
vi a(n);
rep(i, n) { cin >> a[i]; }
sort(all(a));
int S = accumulate(all(a), 0LL);
int r = (S % 2 == 0 ? S / 2 : S / 2 + 1);
dump(S, r);
dp[0][a[0]] = 1;
dp[0][0] = 2;
rep(i, 1, n) {
rep(j, S + 5) {
dp[i][j + a[i]] += dp[i - 1][j];
dp[i][j + a[i]] %= MOD;
dp[i][j] += 2 * dp[i - 1][j];
dp[i][j] %= MOD;
}
}
int x = 0;
rep(i, r, S + 5) {
x += dp[n - 1][i];
x %= MOD;
}
int A = 1;
rep(i, n) {
A *= 3;
A %= MOD;
}
int res;
if (S % 2 != 0) {
res = A - 3 * x;
res %= MOD;
} else {
dp2[0][a[0]] = 1;
dp2[0][0] = 1;
rep(i, 1, n) {
rep(j, S + 5) {
dp2[i][j + a[i]] += dp2[i - 1][j];
dp2[i][j + a[i]] %= MOD;
dp2[i][j] += dp2[i - 1][j];
dp2[i][j] %= MOD;
}
}
res = A - (3 * x - dp2[n - 1][S / 2] * 3);
res %= MOD;
}
cout << (res < 0 ? res + MOD : res) << endl;
return 0;
}
signed main() { //{{{
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} //}}}
| // template version 1.8
// varibable settings {{{
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
#define int long long
#define INF 1e18
// #define INF 2147483647
#define MOD 998244353
#define infile "../test/sample-1.in"
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
#define fi first
#define se second
// }}}
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) \
sort(all(x)); \
x.erase(unique(all(x)), x.end())
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;
template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
// dump macro
#ifdef PCM
#include "dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
// }}}
int dp[300][90005];
int dp2[300][90005];
int solve() {
int n;
cin >> n;
vi a(n);
rep(i, n) { cin >> a[i]; }
sort(all(a));
int S = accumulate(all(a), 0LL);
int r = (S % 2 == 0 ? S / 2 : S / 2 + 1);
dump(S, r);
dp[0][a[0]] = 1;
dp[0][0] = 2;
rep(i, 1, n) {
rep(j, S + 5) {
dp[i][j + a[i]] += dp[i - 1][j];
dp[i][j + a[i]] %= MOD;
dp[i][j] += 2 * dp[i - 1][j];
dp[i][j] %= MOD;
}
}
int x = 0;
rep(i, r, S + 5) {
x += dp[n - 1][i];
x %= MOD;
}
int A = 1;
rep(i, n) {
A *= 3;
A %= MOD;
}
int res;
if (S % 2 != 0) {
res = A - 3 * x;
res %= MOD;
} else {
dp2[0][a[0]] = 1;
dp2[0][0] = 1;
rep(i, 1, n) {
rep(j, S + 5) {
dp2[i][j + a[i]] += dp2[i - 1][j];
dp2[i][j + a[i]] %= MOD;
dp2[i][j] += dp2[i - 1][j];
dp2[i][j] %= MOD;
}
}
res = A - (3 * x - dp2[n - 1][S / 2] * 3);
res %= MOD;
}
cout << (res < 0 ? res + MOD : res) << endl;
return 0;
}
signed main() { //{{{
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} //}}}
| replace | 67 | 69 | 67 | 69 | -11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.