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;
... | #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;
... | 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] = gc... | #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 +... | 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... | #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... | 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"=!`... | // qqqqqqHHMqqqqqHf!(:;jHmmkf``(:;jkqqqqqqqqqmMH#HMqqK_````````````````(kqqqqqqHMMM
// qqqqqqHHmqqqqH=` :;;jkqH=?~..;;jqqqqqqqqqmM#HM#MHH!````
// ```````..-``dqWbWkRqHMMM qqqqqqMHmqqqK!``.;;;dqH:
// ```.?TUqqHmqqqqmHHHM4Mqkt..```` ..JgHHW@P`.HHkqHHHqM#NN
// qqqqqmHMmqHTYWHgHmmgHR...``` :;Jkq9qqqqqgMH#1dHk$...-gW@HY"=!`... | 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 <... | #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 (in... | 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]... | #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]... | 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 notco... | #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];
}
}... | 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... | #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... | 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()
#defin... | #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()
#defin... | 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_b... | #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_b... | 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 doub... | #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 doub... | 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()
#def... | //
// 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()
#def... | 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[... | #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[... | 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 ... | #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 (in... | 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 mak... | #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 mak... | 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
... | #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
... | 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(); i... | #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(); i... | 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> ... | #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> ... | 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 st... | #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 st... | 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]);
fo... | #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 - ... | 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... | #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... | 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)
c... | #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)
c... | 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) fix... | #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) fix... | 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 secon... | #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 secon... | 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];... | #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];
}
... | 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 u... | // #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 u... | 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... | #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... | 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);
... | /**
* 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);
... | 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... | #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... | 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 <... | #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 <... | 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... | /// 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... | 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;
c... | #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;
c... | 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)... | #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)... | 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]... | #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]... | 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 ... | #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 ... | 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++)
... | #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++)
... | 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) {
retu... | #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) {
retu... | 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]... | #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(... | 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], ... | #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], ... | 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 != ... | #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 ... | 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, in... | #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, in... | 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... | #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(... | 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]<<" ";
... | #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]<<" "... | 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) ... | #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) ... | 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 <ios... | #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 <ios... | 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 ... | #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 ... | 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... | #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... | 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;
d... | #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;
... | 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());
i... | #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());
i... | 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() {... | #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() {... | 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;
l... | #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;
l... | 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'
typed... | /*
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'
typed... | 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... | #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... | 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;... | #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;... | 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... | // 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... | 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 ... | #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 ... | 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 pa... | #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 pa... | 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) { ... | #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) { ... | 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)
r... | #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)
r... | 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 ... | #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 ... | 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++... | #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... | 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;... | #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 = ... | 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) {
... | #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) {
... | 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());
}
... | #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;
... | 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 pu... | /**
* 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 pu... | 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 i... | 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... | 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 ... | #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 ... | 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>
#incl... | #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>
#incl... | 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.14159... | #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.14159... | 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 = ... | #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 = ... | 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 %... | #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 %... | 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 <= ... | #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... | 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... | #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));
}
... | 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 = dista... | #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 = dista... | 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>
#i... | #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>
#i... | 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;
fo... | #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 <= ... | 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... | #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... | 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 {... | #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... | 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... | #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... | 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[... | #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[... | 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]++;
}
}
f... | #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]++;
}
}
f... | 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;
... | #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;
... | 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++) {... | #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++) {... | 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 v... | #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 v... | 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 <<... | #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 <<... | 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 <... | #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 <... | 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()... | #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()... | 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] == '#');... | #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] == '... | 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... | #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... | 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) {
... | #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) {
... | 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... | #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... | 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 + ... | #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 +... | 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... | #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... | 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] =... | #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] =... | 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 <... | #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 <... | 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])... | #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... | 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;
... | #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;
... | 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 ... | #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 * ... | 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 ... | #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 ... | 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 s... | // 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 s... | 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.