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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, K;
cin >> N >> M >> K;
vector<long long> A(N), B(N);
long long A_sum = 0, B_sum = 0;
for (int i = 0; i < N; i++) {
long long a;
cin >> a;
A[i] = a;
}
for (int i = 0; i < M; i++) {
long long b;
cin >> b;
B[M -... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, K;
cin >> N >> M >> K;
vector<long long> A(N), B(M);
long long A_sum = 0, B_sum = 0;
for (int i = 0; i < N; i++) {
long long a;
cin >> a;
A[i] = a;
}
for (int i = 0; i < M; i++) {
long long b;
cin >> b;
B[M -... | replace | 6 | 7 | 6 | 7 | -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)
|
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const llint INF = 1<<21;
// static const llint MOD = 1e9 + 7;
bool compPair(const pi... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const llint INF = 1<<21;
// static const llint MOD = 1e9 + 7;
bool compPair(const pi... | replace | 43 | 48 | 43 | 53 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
#ifdef LOCAL_EXEC
#else
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#endif // LOCAL_EXEC
long long int n, i, j, k, m, ans = 0, a, b, mid;
cin >> n >> m >> k;
long long int A[n + 1], B[m + 1];
A[0] = 0;
B[0] = 0;
for (i... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
#ifdef LOCAL_EXEC
#else
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#endif // LOCAL_EXEC
long long int n, i, j, k, m, ans = 0, a, b, mid;
cin >> n >> m >> k;
long long int A[n + 1], B[m + 1];
A[0] = 0;
B[0] = 0;
for (i... | replace | 45 | 46 | 45 | 46 | 0 | |
p02623 | C++ | Time Limit Exceeded | /**
* author: yuya1234
* created: 30.06.2020 10:57:25
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) fo... | /**
* author: yuya1234
* created: 30.06.2020 10:57:25
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) fo... | insert | 57 | 57 | 57 | 58 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n, m, k;
cin >> n >> m >> k;
vector<long> a(n);
vector<long> b(m);
for (long i = 0; i < n; i++)
cin >> a[i];
for (long i = 0; i < m; i++)
cin >> b[i];
long total = 0;
long c = 0;
long cnt = 0;
while (true) {
if (total + ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n, m, k;
cin >> n >> m >> k;
vector<long> a(n);
vector<long> b(m);
for (long i = 0; i < n; i++)
cin >> a[i];
for (long i = 0; i < m; i++)
cin >> b[i];
long total = 0;
long c = 0;
long cnt = 0;
while (true) {
if (total + ... | insert | 42 | 42 | 42 | 44 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, k;
vector<int> a, b;
vector<int> sum_a, sum_b;
int n_max, m_max;
cin >> n >> m >> k;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < m; i++) {
int tmp;
cin >>... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, k;
vector<int> a, b;
vector<int> sum_a, sum_b;
int n_max, m_max;
cin >> n >> m >> k;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < m; i++) {
int tmp;
cin >>... | replace | 98 | 99 | 98 | 99 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// #define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define repr(i, a, b) for (ll i = a; i >= b; i--)
int main() {
ll n, m, k;
cin >> n >> m >> k;
ll *a = new ll[n];
ll *b = new ll[m];
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// #define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define repr(i, a, b) for (ll i = a; i >= b; i--)
int main() {
ll n, m, k;
cin >> n >> m >> k;
ll *a = new ll[n];
ll *b = new ll[m];
r... | replace | 27 | 29 | 27 | 29 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define FOR(i, f, t) for (int i = int(f); i <= int(t); i++)
#define RFOR(i, f, t) for (int i = int(f); i >= int(t); i--)
#de... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define FOR(i, f, t) for (int i = int(f); i <= int(t); i++)
#define RFOR(i, f, t) for (int i = int(f); i >= int(t); i--)
#de... | replace | 67 | 68 | 67 | 68 | TLE | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
int main() {
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n), b(m), aa(n + 1), bb(m + 1), time(n + m + 1);
aa[0] = 0;
bb[0] = 0;
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = 0; i < m; i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
int main() {
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n), b(m), aa(n + 1), bb(m + 1), time(n + m + 1);
aa[0] = 0;
bb[0] = 0;
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = 0; i < m; i+... | replace | 41 | 49 | 41 | 46 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <math.h>
#define ll long long
// to increase precision
// std::cout<<std::fixed;
// std::cout<<std::setprecision(6)<<z;
// clock_t tStart = clock();
// printf("Time taken: %.9fs\n", (double)(clock() - tStart)/CLOCKS_PER_SEC);
#define maxn 100001
... | #include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <math.h>
#define ll long long
// to increase precision
// std::cout<<std::fixed;
// std::cout<<std::setprecision(6)<<z;
// clock_t tStart = clock();
// printf("Time taken: %.9fs\n", (double)(clock() - tStart)/CLOCKS_PER_SEC);
#define maxn 100001
... | replace | 38 | 39 | 38 | 39 | 0 | |
p02623 | C++ | Runtime Error | //{{{
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll... | //{{{
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll... | replace | 52 | 53 | 52 | 53 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef pair<string, string> Pstring;
typedef pair<double, double> Pdouble;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define Precision13 cout <<... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef pair<string, string> Pstring;
typedef pair<double, double> Pdouble;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define Precision13 cout <<... | replace | 39 | 41 | 39 | 41 | -11 | |
p02623 | C++ | Runtime Error | // Compiler optimization
#pragma GCC optimize("Ofast")
// include
#include <bits/stdc++.h>
using namespace std;
// typedef
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef string S;
typedef queue<int> qi;
typedef pair<l... | // Compiler optimization
#pragma GCC optimize("Ofast")
// include
#include <bits/stdc++.h>
using namespace std;
// typedef
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef string S;
typedef queue<int> qi;
typedef pair<l... | replace | 52 | 53 | 52 | 53 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007... | replace | 28 | 29 | 28 | 29 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n + 1), b(m + 1), prefa(m + 1), prefb(m + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
prefa[i] = pref... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n + 1), b(m + 1), prefa(n + 1), prefb(m + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
prefa[i] = pref... | replace | 13 | 14 | 13 | 14 | 0 | |
p02623 | C++ | Runtime Error | // author rhythmicankur
// god_is_almighty
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#define f first
#define s second
#define int long long
#define ll int
#define ld long double
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define vi vector<int>
#define pii pair... | // author rhythmicankur
// god_is_almighty
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#define f first
#define s second
#define int long long
#define ll int
#define ld long double
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define vi vector<int>
#define pii pair... | replace | 66 | 67 | 66 | 67 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int n, m, k;
vi a, b;
bool Read() {
cin >> n;
if (cin.eof())
return 0;
cin >> m >> k;
a.resize(n);
b.resize(m);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int n, m, k;
vi a, b;
bool Read() {
cin >> n;
if (cin.eof())
return 0;
cin >> m >> k;
a.resize(n);
b.resize(m);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
ret... | replace | 24 | 36 | 24 | 41 | TLE | |
p02623 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <locale.h>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n, m, k;
long long int a[200002], b[200002]; //
int possa = 0;
long long int ssx = 0, ax; /... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <locale.h>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n, m, k;
long long int a[200002], b[200002]; //
int possa = 0;
long long int ssx = 0, ax; /... | insert | 37 | 37 | 37 | 39 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n + 1, 0), b(m ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n + 1, 0), b(m ... | insert | 22 | 22 | 22 | 24 | -11 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long int psumA[100001];
long long int psumB[100001];
int A[100001], B[100001];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m, k;
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) {
cin >> A[i];
}
for (int i = 1; i <= m; i++) ... | #include <bits/stdc++.h>
using namespace std;
long long int psumA[200001];
long long int psumB[200001];
int A[200001], B[200001];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m, k;
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) {
cin >> A[i];
}
for (int i = 1; i <= m; i++) ... | replace | 4 | 7 | 4 | 7 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m, k = 0;
cin >> n >> m >> k;
vector<ll> a(n);
vector<ll> b(m);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = 0; i < m; i++) {
cin >> b[i];
}
vector<ll> aSum(n + 1);
vector<ll> bSum(m + 1);
a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m, k = 0;
cin >> n >> m >> k;
vector<ll> a(n);
vector<ll> b(m);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = 0; i < m; i++) {
cin >> b[i];
}
vector<ll> aSum(n + 1);
vector<ll> bSum(m + 1);
a... | replace | 42 | 43 | 42 | 43 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#define ll long long int
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.... | #include <bits/stdc++.h>
#include <iostream>
#define ll long long int
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.... | replace | 28 | 31 | 28 | 31 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define pii pair<int, int>
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int n, m, k;
cin >> n >> m >> k;
vector<int> a... | #include <bits/stdc++.h>
using namespace std;
#define pb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define pii pair<int, int>
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int n, m, k;
cin >> n >> m >> k;
vector<int> a... | replace | 29 | 31 | 29 | 31 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
ll M;
cin >> M;
ll K;
cin >> K;
vector<ll> A(N);
for (ll i = 0; i < N; i++)
cin >> A[i];
vector<ll> B(M);
for (ll i = 0; i < M; i++)
cin >> B[i];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
ll M;
cin >> M;
ll K;
cin >> K;
vector<ll> A(N);
for (ll i = 0; i < N; i++)
cin >> A[i];
vector<ll> B(M);
for (ll i = 0; i < M; i++)
cin >> B[i];
... | replace | 34 | 35 | 34 | 38 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define M_PI 3.1415926535
#define ll long long
#define ld long double
#define all(a) a.begin(), a.end()
#define Summon_Tourist \
ios::sync_with_stdio(false); \
cin.ti... | #include <bits/stdc++.h>
using namespace std;
#define M_PI 3.1415926535
#define ll long long
#define ld long double
#define all(a) a.begin(), a.end()
#define Summon_Tourist \
ios::sync_with_stdio(false); \
cin.ti... | replace | 21 | 23 | 21 | 24 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 2e5 + 10, mod = 1e9 + 7;
void solve() {
int n, m, k;
cin >> n >> m >> k;
ll a[n + 1], b[m + 1];
a[0] = 0, b[0] = 0;
for (int i = 1; i <= n; ++i) {
int in;
cin >> in;
a[i] = a[i - 1] + i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 2e5 + 10, mod = 1e9 + 7;
void solve() {
int n, m, k;
cin >> n >> m >> k;
ll a[n + 1], b[m + 1];
a[0] = 0, b[0] = 0;
for (int i = 1; i <= n; ++i) {
int in;
cin >> in;
a[i] = a[i - 1] + i... | replace | 26 | 32 | 26 | 28 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define maxn 500005
#define inf int(21e8)
#define mod int(1e9 + 7)
#define db double
#define ll long long
#define si stack<int>
#define qi queue<int>
#define vi vector<int>
#define pi pair<int, int>
#define pq priority... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define maxn 500005
#define inf int(21e8)
#define mod int(1e9 + 7)
#define db double
#define ll long long
#define si stack<int>
#define qi queue<int>
#define vi vector<int>
#define pi pair<int, int>
#define pq priority... | replace | 33 | 39 | 33 | 39 | 0 | sh: 1: pause: not found
|
p02623 | C++ | Runtime Error | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | replace | 19 | 20 | 19 | 20 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
long long K;
cin >> K;
long long a;
vector<long long> A(N + 1);
vector<long long> B(M + 1);
A[0] = 0;
B[0] = 0;
for (int i = 1; i < N + 1; i++) {
cin >> a;
A[i] = A[i - 1] +... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
long long K;
cin >> K;
long long a;
vector<long long> A(N + 1);
vector<long long> B(M + 1);
A[0] = 0;
B[0] = 0;
for (int i = 1; i < N + 1; i++) {
cin >> a;
A[i] = A[i - 1] +... | replace | 28 | 35 | 28 | 31 | TLE | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define SZ(c) int(c.size())
#define pb push_back
#define loop(i, start, n) for (int i = start; i < n; i++)
#define rloop(i, start, n) for (int i = start; i > n; i--)
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vecto... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define SZ(c) int(c.size())
#define pb push_back
#define loop(i, start, n) for (int i = start; i < n; i++)
#define rloop(i, start, n) for (int i = start; i > n; i--)
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vecto... | replace | 34 | 40 | 34 | 42 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m, K, ans;
long long a[100004], b[100004];
int main() {
cin >> n >> m >> K;
for (int i = 1; i <= n; i++)
cin >> a[i], a[i] = a[i - 1] + a[i];
for (int i = 1; i <= m; i++)
cin >> b[i], b[i] = b[i - 1] + b[i];
for (int i = 0; i <= n; i++)
if (K >= a... | #include <bits/stdc++.h>
using namespace std;
int n, m, K, ans;
long long a[200004], b[200004];
int main() {
cin >> n >> m >> K;
for (int i = 1; i <= n; i++)
cin >> a[i], a[i] = a[i - 1] + a[i];
for (int i = 1; i <= m; i++)
cin >> b[i], b[i] = b[i - 1] + b[i];
for (int i = 0; i <= n; i++)
if (K >= a... | replace | 3 | 4 | 3 | 4 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
#define REP(i, n) for (ll i = ... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
#define REP(i, n) for (ll i = ... | replace | 178 | 182 | 178 | 187 | TLE | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#d... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#d... | replace | 47 | 49 | 47 | 49 | -6 | munmap_chunk(): invalid pointer
|
p02623 | C++ | Runtime Error | // ░░░░░░░░( •̪●)░░░░░░░░░░░░░░░░░░░░░░░░
// ░░░░░░███████ ]▄▄▄▄▄▄▄▄▃░░░▃░░░░ ▃░
// ▂▄▅█████████▅▄▃▂░░░░░░░░░░░░░░░░░
// [███████████████████].░░░░░░░░░░░░░░
// ◥⊙▲⊙▲⊙▲⊙▲⊙▲⊙▲⊙◤...░░░░░░░░░░░░
// PointBlank's code (⌐■_■)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll po... | // ░░░░░░░░( •̪●)░░░░░░░░░░░░░░░░░░░░░░░░
// ░░░░░░███████ ]▄▄▄▄▄▄▄▄▃░░░▃░░░░ ▃░
// ▂▄▅█████████▅▄▃▂░░░░░░░░░░░░░░░░░
// [███████████████████].░░░░░░░░░░░░░░
// ◥⊙▲⊙▲⊙▲⊙▲⊙▲⊙▲⊙◤...░░░░░░░░░░░░
// PointBlank's code (⌐■_■)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll po... | replace | 57 | 58 | 57 | 58 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF 1000000007
#define mod 1005
#define ll long long int
const double mx = 2e6 + 5;
void solve() {
ll n, m, k;
ll maxPos = 0;
cin >> n >> m >> k;
// cout<<"nmk\n";
vect... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF 1000000007
#define mod 1005
#define ll long long int
const double mx = 2e6 + 5;
void solve() {
ll n, m, k;
ll maxPos = 0;
cin >> n >> m >> k;
// cout<<"nmk\n";
vect... | replace | 51 | 52 | 51 | 52 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long... | #include <bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long... | replace | 17 | 18 | 17 | 18 | -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)
|
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | replace | 83 | 84 | 83 | 84 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n), b(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i];
vector<ll> c(n + 1), d(n + 1);
rep(i, n) c[i + 1] = c[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n), b(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i];
vector<ll> c(n + 1), d(m + 1);
rep(i, n) c[i + 1] = c[i... | replace | 13 | 14 | 13 | 14 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, M, K;
std::cin >> N >> M >> K;
std::vector<unsigned long long> A, B;
A.resize(N + 1);
for (int i = 0; i < N; i++) {
int tmp;
std::cin >> tmp;
A[i + 1] = A[i] + tmp;
}
B.resize(M + 1);
for (int i = 0; i < M; i++) ... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, M, K;
std::cin >> N >> M >> K;
std::vector<unsigned long long> A, B;
A.resize(N + 1);
for (int i = 0; i < N; i++) {
int tmp;
std::cin >> tmp;
A[i + 1] = A[i] + tmp;
}
B.resize(M + 1);
for (int i = 0; i < M; i++) ... | replace | 21 | 28 | 21 | 24 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#define fast ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#define fast ... | replace | 109 | 110 | 109 | 110 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<long long> vl;
int main() {
long long N, M, K;
cin >> N >> M >> K;
vl a(N + ... | #include <bits/stdc++.h>
using namespace std;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<long long> vl;
int main() {
long long N, M, K;
cin >> N >> M >> K;
vl a(N + ... | replace | 18 | 19 | 18 | 19 | 0 | |
p02623 | 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, m, k;
cin >> n >> m >> k;
vector<long> a(n + 1, 0);
vector<long> b(m + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
for (int i = 1; i <= m; i++) {
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<long> a(n + 1, 0);
vector<long> b(m + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
for (int i = 1; i <= m; i++) {
cin >> ... | replace | 20 | 21 | 20 | 21 | -11 | |
p02623 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
int A[100002], B[100002];
int main() {
int t = 1;
// cin >> t;
while (t--) {
int n, m, ms;
scanf("%d%d%d", &n, &m, &ms);
for (int A_i = 0; A_i < n; A_i++) {
scanf("%d", &A[A_i]);
}
for (int B_i = 0; B_i < m; B_i++) {
scanf("%d", &B[... |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int A[N], B[N];
int main() {
int t = 1;
// cin >> t;
while (t--) {
int n, m, ms;
scanf("%d%d%d", &n, &m, &ms);
for (int A_i = 0; A_i < n; A_i++) {
scanf("%d", &A[A_i]);
}
for (int B_i = 0; B_i < m; B_i++) {
scan... | replace | 3 | 5 | 3 | 5 | 0 | |
p02623 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <class T = ll> inline T in(istream &is = cin) {
T ret;
is >> ret;
return ret;
}
template <class T>
inline auto vec2(class vector<T>::size_type h, class vector<T>::size_type w,
T v = T()) {
return vector<vector<T>>(h, v... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <class T = ll> inline T in(istream &is = cin) {
T ret;
is >> ret;
return ret;
}
template <class T>
inline auto vec2(class vector<T>::size_type h, class vector<T>::size_type w,
T v = T()) {
return vector<vector<T>>(h, v... | replace | 46 | 47 | 46 | 47 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, r, n) for (int i = (int)(r); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define INF 2147483647
#define INF64 9223372036854775807
#define MOD 1000000007
int main() {
int64_t n, m, k;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, r, n) for (int i = (int)(r); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define INF 2147483647
#define INF64 9223372036854775807
#define MOD 1000000007
int main() {
int64_t n, m, k;
cin >> ... | replace | 30 | 31 | 30 | 31 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mxN = 2e5 + 10;
int n, m;
ll k, a[mxN], b[mxN];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m >> k;
for (int i = 0; i < n; ++i) {
cin >> a[i + 1];
a[i + 1] += a[i];
}
for (int i = 0; i < m; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mxN = 2e5 + 10;
int n, m;
ll k, a[mxN], b[mxN];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m >> k;
for (int i = 0; i < n; ++i) {
cin >> a[i + 1];
a[i + 1] += a[i];
}
for (int i = 0; i < m; ++i) {
... | replace | 26 | 30 | 26 | 31 | TLE | |
p02623 | C++ | Runtime Error | // #pragma GCC target ("avx")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define endl '\n'
#pragma region TEMPLATE
/* TYPE */
typedef lo... | // #pragma GCC target ("avx")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define endl '\n'
#pragma region TEMPLATE
/* TYPE */
typedef lo... | replace | 272 | 273 | 272 | 273 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define llint long long int
using namespace std;
int main() {
int N, M, K;
cin >> N >> M >> K;
vector<llint> A(N), B(M);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i < N; i++) {
A[i] += A[i - 1];
}
for (int i = 0; i < M; i++) {
cin >> B[i];
... | #include <bits/stdc++.h>
#define llint long long int
using namespace std;
int main() {
int N, M, K;
cin >> N >> M >> K;
vector<llint> A(N), B(M);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i < N; i++) {
A[i] += A[i - 1];
}
for (int i = 0; i < M; i++) {
cin >> B[i];
... | replace | 29 | 31 | 29 | 34 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define SCANF(i) \
int i; ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define SCANF(i) \
int i; ... | replace | 33 | 34 | 33 | 34 | 0 | |
p02623 | C++ | Runtime Error | #include <iostream>
#include <vector>
/*
二台の机 A, B があります。机 A には N 冊の本が、机 B には M
冊の本が、それぞれ縦に積まれています。
机 A に現在上から i 番目に積まれている本 (1≤i≤N) は読むのに Ai 分を要し、
机 B に現在上から i 番目に積まれている本 (1≤i≤M) は読むのに Bi 分を要します。
次の行為を考えます。
本が残っている机を選び、その机の最も上に積まれた本を読んで机から取り除く。
合計所要時間が K
分を超えないようにこの行為を繰り返すとき、最大で何冊の本を読むことができるでしょうか。本を読むこと以外に要する時間は無視しま... | #include <iostream>
#include <vector>
/*
二台の机 A, B があります。机 A には N 冊の本が、机 B には M
冊の本が、それぞれ縦に積まれています。
机 A に現在上から i 番目に積まれている本 (1≤i≤N) は読むのに Ai 分を要し、
机 B に現在上から i 番目に積まれている本 (1≤i≤M) は読むのに Bi 分を要します。
次の行為を考えます。
本が残っている机を選び、その机の最も上に積まれた本を読んで机から取り除く。
合計所要時間が K
分を超えないようにこの行為を繰り返すとき、最大で何冊の本を読むことができるでしょうか。本を読むこと以外に要する時間は無視しま... | replace | 98 | 99 | 98 | 99 | -11 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | replace | 140 | 141 | 140 | 143 | -11 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
// int a[200001];
// int b[200001];
ll a[10];
ll b[10];
int main() {
int N, M, K;
cin >> N >> M >> K;
a[0] = 0;
b[0] = 0;
rep2(i, N) {
int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
ll a[200001];
ll b[200001];
int main() {
int N, M, K;
cin >> N >> M >> K;
a[0] = 0;
b[0] = 0;
rep2(i, N) {
int x;
cin >> x;
a[i] = ... | replace | 6 | 10 | 6 | 8 | 0 | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#defi... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#defi... | insert | 62 | 62 | 62 | 63 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define _ \
ios::sync_with_stdio(false); \
cout.tie(NULL); \
cin.tie(NULL);
using namespac... | #include <bits/stdc++.h>
#define ll long long
#define _ \
ios::sync_with_stdio(false); \
cout.tie(NULL); \
cin.tie(NULL);
using namespac... | insert | 41 | 41 | 41 | 43 | -11 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI = acos(-1);
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
int main() {
ll n, m, k;
cin >> n >> m >> k;
vect... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI = acos(-1);
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
int main() {
ll n, m, k;
cin >> n >> m >> k;
vect... | replace | 29 | 30 | 29 | 30 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll N = 5e5 + 1;
const ll INF = 1e10;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n, m, k;
cin >> n >> m >> k;
vector<ll> a(n), b(m);
for (ll &i : a)
cin >> i;
for (ll &i : b)
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll N = 5e5 + 1;
const ll INF = 1e10;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n, m, k;
cin >> n >> m >> k;
vector<ll> a(n), b(m);
for (ll &i : a)
cin >> i;
for (ll &i : b)
cin >... | replace | 30 | 31 | 30 | 31 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> A, B;
long long K;
long long N, M;
cin >> N >> M >> K;
vector<long long> Sum_A(N + 1, 0), Sum_B(M + 1, 0);
int tmp;
Sum_A.push_back(0);
for (int i = 1; i <= N; i++) {
cin >> tmp;
A.push_back(tmp);
Sum_... | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> A, B;
long long K;
long long N, M;
cin >> N >> M >> K;
vector<long long> Sum_A(N + 1, 0), Sum_B(M + 1, 0);
int tmp;
Sum_A.push_back(0);
for (int i = 1; i <= N; i++) {
cin >> tmp;
A.push_back(tmp);
Sum_... | replace | 31 | 32 | 31 | 32 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int t = 1;
// cin>>t;
while (t--) {
ll n, m, k;
cin >> n >> m >> k;
ll arr1[n], arr2[m];
for (int i = 0; i < n; i++)
cin >> arr1[i];
for (int i = 0; i < m; i++)
cin >> arr2[i];
ll dp[n + 1];
dp... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int t = 1;
// cin>>t;
while (t--) {
ll n, m, k;
cin >> n >> m >> k;
ll arr1[n], arr2[m];
for (int i = 0; i < n; i++)
cin >> arr1[i];
for (int i = 0; i < m; i++)
cin >> arr2[i];
ll dp[n + 1];
dp... | replace | 23 | 24 | 23 | 24 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int> a(n), b(m);
a[0] = 0;
b[0] = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
int ans = 0, j = m;
ll tot... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int> a(n), b(m);
a[0] = 0;
b[0] = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
int ans = 0, j = m;
ll tot... | replace | 22 | 23 | 22 | 23 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespac... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespac... | delete | 19 | 22 | 19 | 19 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, m, k;
cin >> n >> m >> k;
ll A[n];
ll B[n];
ll preA[n + 1];
ll preB[m + 1];
preA[0] = 0;
preB[0] = 0;
for (ll i = 0; i < n; ++i) {
cin >> A[i];
preA[i + 1] = preA[i] + A[i];
}
for (ll i = 0; i < m; ++i)... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, m, k;
cin >> n >> m >> k;
ll A[n];
ll B[m];
ll preA[n + 1];
ll preB[m + 1];
preA[0] = 0;
preB[0] = 0;
for (ll i = 0; i < n; ++i) {
cin >> A[i];
preA[i + 1] = preA[i] + A[i];
}
for (ll i = 0; i < m; ++i)... | replace | 9 | 10 | 9 | 10 | 0 | |
p02623 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;... |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;... | replace | 63 | 68 | 63 | 74 | TLE | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::ios_base::sync_with_stdio(false);
int n, m;
long long k;
std::cin >> n >> m >> k;
std::vector<long long> a(n + 1), b(m + 1);
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
a[i] += a[i - 1];
}
for (int i = 1; i <= m; ... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::ios_base::sync_with_stdio(false);
int n, m;
long long k;
std::cin >> n >> m >> k;
std::vector<long long> a(n + 1), b(m + 1);
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
a[i] += a[i - 1];
}
for (int i = 1; i <= m; ... | replace | 18 | 27 | 18 | 31 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
ll time = 0;
ll book_b = 0;
ll book_a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int> a(n), b(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
ll time = 0;
ll book_b = 0;
ll book_a... | replace | 8 | 9 | 8 | 9 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i += 1)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define repv(arr) for (auto it = arr[i].begin(); it != arr[i].end(); it++)
#define vi vector<int>
#define vb vector<bool>
#define vs vector<string>
#define vl vector<long... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i += 1)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define repv(arr) for (auto it = arr[i].begin(); it != arr[i].end(); it++)
#define vi vector<int>
#define vb vector<bool>
#define vs vector<string>
#define vl vector<long... | replace | 32 | 34 | 32 | 34 | 0 | |
p02623 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define eb emplace_back
#define pb push_back
// #define mp make_pair
#define ff first
#define ss second
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
void io() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef LOCAL... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define eb emplace_back
#define pb push_back
// #define mp make_pair
#define ff first
#define ss second
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
void io() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef LOCAL... | replace | 64 | 65 | 64 | 65 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Sort2(x) sort((x).begin(), (x).end(), greater<int>())
#define pb push_back
using namespace std;
using ll =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Sort2(x) sort((x).begin(), (x).end(), greater<int>())
#define pb push_back
using namespace std;
using ll =... | replace | 23 | 24 | 23 | 24 | 0 | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
long long n, m, k;
std::cin >> n >> m >> k;
// long long a[n+1], b[m+1];
std::vector<long long> a{n + 1}, b{m + 1};
a[0] = 0;
b[0] = 0;
for (int i = 1; i < n + 1; i++)
std::cin >> a[i];
for (int i = 1; i < m + 1; i++)
std:... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
long long n, m, k;
std::cin >> n >> m >> k;
// long long a[n+1], b[m+1];
std::vector<long long> a(n + 1), b(m + 1);
a[0] = 0;
b[0] = 0;
for (int i = 1; i < n + 1; i++)
std::cin >> a[i];
for (int i = 1; i < m + 1; i++)
std:... | replace | 8 | 9 | 8 | 9 | -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)
|
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#defi... | replace | 176 | 177 | 176 | 177 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/*bool subseq(string s,string t){
ll y=0;
for(ll i=0;y<s.size()&& i<t.size();i++){
if(s[y]==t[i]){
y++;
}
}
if(y==s.size())
return true;
else return false;
}*/
/*ll x=1000000001;
vect... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/*bool subseq(string s,string t){
ll y=0;
for(ll i=0;y<s.size()&& i<t.size();i++){
if(s[y]==t[i]){
y++;
}
}
if(y==s.size())
return true;
else return false;
}*/
/*ll x=1000000001;
vect... | replace | 155 | 157 | 155 | 157 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long int
using namespace std;
#undef int
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
#define int long long int
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
#undef int
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
#define int long long int
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
... | replace | 18 | 19 | 18 | 19 | -11 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
ll k;
cin >> k;
vector<ll> a(n + 1), b(n + 1);
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
ll k;
cin >> k;
vector<ll> a(n + 1), b(m + 1);
for (int i = 0; i < n; i++) {
... | replace | 15 | 16 | 15 | 16 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
const int MAX{200010};
const ll MOD{1000000007}, oo{1LL << 62};
ll solve(ll N, ll M, ll K, const vector<ll> &xs, const vector<ll> &ys) {
ll ans = 0, sum = 0, a = 0, b = 0, c = 0;
while (a < N and (sum + xs[a] <= K)) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
const int MAX{200010};
const ll MOD{1000000007}, oo{1LL << 62};
ll solve(ll N, ll M, ll K, const vector<ll> &xs, const vector<ll> &ys) {
ll ans = 0, sum = 0, a = 0, b = 0, c = 0;
while (a < N and (sum + xs[a] <= K)) {
... | replace | 29 | 30 | 29 | 30 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, K;
long long sum = 0;
cin >> N >> M >> K;
vector<int> A(N), B(M);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int j = 0; j < N; j++) {
cin >> B.at(j);
sum += B.at(j);
}
int ans = 0;
int j = M;
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, K;
long long sum = 0;
cin >> N >> M >> K;
vector<int> A(N), B(M);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int j = 0; j < M; j++) {
cin >> B.at(j);
sum += B.at(j);
}
int ans = 0;
int j = M;
for (int i = 0... | replace | 11 | 12 | 11 | 12 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
////////////////////////////// Begin Macros
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define in(x, a, b) (a <= x and x < b)
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define reprev(i, N) for (int i = (int)(N)-1; i >= 0; i... | #include <bits/stdc++.h>
using namespace std;
////////////////////////////// Begin Macros
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define in(x, a, b) (a <= x and x < b)
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define reprev(i, N) for (int i = (int)(N)-1; i >= 0; i... | delete | 182 | 183 | 182 | 182 | TLE | |
p02623 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL << 60;
const double PI = 3.14159265358979323846;
const int NMAX = 100005;
using namespa... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL << 60;
const double PI = 3.14159265358979323846;
const int NMAX = 100005;
using namespa... | replace | 40 | 41 | 40 | 41 | TLE | |
p02623 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll int64_t
using namespace std;
// memory exceed
/*
int main() {
int64_t n,m,k;
cin >> n>>m>>k;
vector<unsigned int> A(n+5);
vector<unsigned int> B(m+5);
rep... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll int64_t
using namespace std;
// memory exceed
/*
int main() {
int64_t n,m,k;
cin >> n>>m>>k;
vector<unsigned int> A(n+5);
vector<unsigned int> B(m+5);
rep... | replace | 118 | 120 | 118 | 119 | 0 | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf = 1000000007;
int main() {
long long n;
cin >> n;
long long ans = 0;
for (long long i = 1; i <= n; i++) {
long long pre = i;
long long num = i;
for (long long j = 2; j <= num; j++) {
long long cnt = 0;
whi... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf = 1000000007;
int main() {
long long n;
cin >> n;
long long ans = 0;
for (long long i = 1; i <= n; i++) {
long long y = n / i;
ans += y * (1 + y) / 2 * i;
}
cout << ans << endl;
return 0;
}
| replace | 13 | 26 | 13 | 15 | TLE | |
p02624 | C++ | Runtime Error |
// Problem : D - Sum of Divisors
// Contest : AtCoder - AtCoder Beginner Contest 172
// URL : https://atcoder.jp/contests/abc172/tasks/abc172_d
// Memory Limit : 1024 MB
// Time Limit : 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <algorithm>
#include <cmath>
#include <cstdio>
#incl... |
// Problem : D - Sum of Divisors
// Contest : AtCoder - AtCoder Beginner Contest 172
// URL : https://atcoder.jp/contests/abc172/tasks/abc172_d
// Memory Limit : 1024 MB
// Time Limit : 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <algorithm>
#include <cmath>
#include <cstdio>
#incl... | replace | 25 | 26 | 25 | 26 | 0 | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <char cmp = ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <char cmp = ... | replace | 59 | 61 | 59 | 60 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z,
ans, tmp, hoge, fuga, piyo, sum;
ll A[200100], B[200100], C[200100], D[200100];
string st, str;
char ch;
vector<pair<long long, long long>> prime_factorize(long long ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z,
ans, tmp, hoge, fuga, piyo, sum;
ll A[200100], B[200100], C[200100], D[200100];
string st, str;
char ch;
vector<pair<long long, long long>> prime_factorize(long long ... | replace | 28 | 30 | 28 | 329 | TLE | |
p02624 | C++ | Runtime Error | /*
@uthor: Amit Kumar
user -->GitHub: drviruses ; CodeChef: dr_virus_ ;
Codeforces,AtCoder,Hackerearth,Hakerrank: dr_virus;
*/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
/... | /*
@uthor: Amit Kumar
user -->GitHub: drviruses ; CodeChef: dr_virus_ ;
Codeforces,AtCoder,Hackerearth,Hakerrank: dr_virus;
*/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
/... | replace | 134 | 135 | 134 | 135 | TLE | |
p02624 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define pp pop_back
#define f first
#define s second
#define sz(a) (int)((a).size())
#define NoType ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
#define mp make_pair
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define pp pop_back
#define f first
#define s second
#define sz(a) (int)((a).size())
#define NoType ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
#define mp make_pair
... | replace | 36 | 39 | 36 | 37 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm = 1000000000;
ll MM = mm + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.141592653589793
int main() {
ll n;
cin >> n;
ll sum = 0;
for (ll i = 1; i <= n; i++) {
ll cnt = 0;
for (ll j = 1; j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm = 1000000000;
ll MM = mm + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.141592653589793
int main() {
ll n;
cin >> n;
ll sum = 0;
for (ll i = 1; i <= n; i++) {
ll m = n / i;
sum += i * (1 ... | replace | 15 | 26 | 15 | 17 | TLE | |
p02624 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int _max = 1e7 + 10;
const int mod = 1e9 + 7;
typedef long long ll;
ll a[_max];
int init() {
for (int i = 1; i <= _max; i++) {
int begin = i;
while (1) {
if (begin > _max) {
break;
}
a[begin]++;
begin = begin + i;
}
}... | #include <bits/stdc++.h>
using namespace std;
const int _max = 1e7 + 10;
const int mod = 1e9 + 7;
typedef long long ll;
ll a[_max];
void init() {
for (int i = 1; i <= _max; i++) {
int begin = i;
while (1) {
if (begin > _max) {
break;
}
a[begin]++;
begin = begin + i;
}
... | replace | 8 | 9 | 8 | 9 | TLE | |
p02624 | C++ | Time Limit Exceeded | // K-OS WITH THE OCDE
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second
#define ar array
#define mod 1000000007
#define pb push_back
#define mpa make_pair
#define TEST \
ll t; ... | // K-OS WITH THE OCDE
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second
#define ar array
#define mod 1000000007
#define pb push_back
#define mpa make_pair
#define TEST \
ll t; ... | replace | 153 | 159 | 153 | 156 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define int long ... | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define int long ... | replace | 44 | 45 | 44 | 45 | TLE | |
p02624 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
class Osa_k {
private:
int n;
vector<int> factor;
public:
// O(NloglogN)
Osa_k(int _n) : n(_n) {
factor.assign(n, 0);
iota(factor.begin(), factor.end(), 0);
for (int i = 2; i * i < n; i++) {
if (factor[i] < i)
conti... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
class Osa_k {
private:
int n;
vector<int> factor;
public:
// O(NloglogN)
Osa_k(int _n) : n(_n) {
factor.assign(n, 0);
iota(factor.begin(), factor.end(), 0);
for (int i = 2; i * i < n; i++) {
if (factor[i] < i)
conti... | replace | 55 | 56 | 55 | 56 | 0 | |
p02624 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_one(i, n) for (int i = 1; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int prime[n + 1];
rep(i, n + 1)... | #include <algorithm>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_one(i, n) for (int i = 1; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
rep_one(k, n + 1) {... | replace | 14 | 41 | 14 | 18 | 0 | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | replace | 140 | 143 | 140 | 142 | TLE | |
p02624 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i, n + 1, i):
ans += j
print(ans)
| n = int(input())
ans = 0
for i in range(1, int(n**0.5) + 1):
k = n // i
ans += i * k * (k + 1) // 2
if i != k:
l = n // (i + 1)
ans += i * (i + 1) * (k + l + 1) * (k - l) // 4
print(ans)
| replace | 2 | 5 | 2 | 8 | TLE | |
p02624 | Python | Time Limit Exceeded | def main():
num = int(input())
ans = 0
for div in range(1, num + 1):
for i in range(div, num + 1):
if i % div == 0:
ans += i
print(ans)
if __name__ == "__main__":
main()
| def main():
num = int(input())
ans = 0
for divisor in range(1, num + 1):
quotient = num // divisor
ans += (quotient + 1) * quotient * divisor // 2
print(ans)
if __name__ == "__main__":
main()
| replace | 4 | 8 | 4 | 7 | TLE | |
p02624 | Python | Time Limit Exceeded | n = int(input())
# 愚直にやると約数の個数テーブルをO(NlogN)
print(sum(i * j for i in range(1, n + 1) for j in range(1, n // i + 1)))
| n = int(input())
ans = 0
for a in range(1, n + 1):
num = n // a
ans += num * (num + 1) // 2 * a
print(ans)
| replace | 1 | 3 | 1 | 7 | TLE | |
p02624 | Python | Time Limit Exceeded | from numba import njit
import numpy as np
@njit("i8(i8)")
def solve(n):
ans = 1
res = np.ones(n + 1, dtype=np.int64)
for i in range(2, n + 1):
res[i::i] += 1
res[i] *= i
ans += res[i]
return ans
N = int(input())
print(solve(N))
| from numba import njit
import numpy as np
@njit("i8(i8)")
def solve(n):
ans = 1
res = np.ones(n + 1, dtype=np.int64)
for i in range(2, n + 1):
for j in range(i, n + 1, i):
res[j] += 1
ans += i * res[i]
return ans
N = int(input())
print(solve(N))
| replace | 9 | 12 | 9 | 12 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define yn ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define yn ... | replace | 25 | 26 | 25 | 26 | TLE | |
p02624 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll> v(1e9);
for (int i = 1; i <= N; ++i) {
for (int j = i; j <= N; j += i) {
v[j]++;
}
}
ll ans = 0;
for (int i = 1; i <= N; ++i) {
ans += i * (v[i]);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll> v(N + 1);
for (int i = 1; i <= N; ++i) {
for (int j = i; j <= N; j += i) {
v[j]++;
}
}
ll ans = 0;
for (int i = 1; i <= N; ++i) {
ans += i * (v[i]);
}
cout << ans << endl;
}
| replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.en... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.en... | replace | 49 | 50 | 49 | 52 | TLE | |
p02624 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = -1; i < (n); i++)
#define PI 3.141592653589793
usin... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = -1; i < (n); i++)
#define PI 3.141592653589793
usin... | replace | 29 | 30 | 29 | 30 | 0 | |
p02624 | C++ | Runtime Error | #include <stdio.h>
using namespace std;
typedef long long llong;
#define MAX
int main() {
int N;
llong ans = 0;
scanf("%lld", &N);
for (llong x = 1; x <= N; x++) {
llong n = N / x;
ans += n * (2 * x + (n - 1) * x) / 2;
}
printf("%lld\n", ans);
return 0;
} | #include <stdio.h>
using namespace std;
typedef long long llong;
#define MAX
int main() {
llong N;
llong ans = 0;
scanf("%lld", &N);
for (llong x = 1; x <= N; x++) {
llong n = N / x;
ans += n * (2 * x + (n - 1) * x) / 2;
}
printf("%lld\n", ans);
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02624 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unorder... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unorder... | replace | 69 | 73 | 69 | 76 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.