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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02584 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -21474... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -21474... | replace | 27 | 32 | 27 | 46 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long x, k, d;
cin >> x >> k >> d;
long kk = abs(x) + d; // 距離
long nn = 0; // 何回でアウトしたか
for (long i = 1; i <= k; i++) {
if (x > 0) {
x -= d;
} else {
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long x, k, d;
cin >> x >> k >> d;
long kk = abs(x) + d; // 距離
long nn = 0; // 何回でアウトしたか
nn = abs(x) / d;
if (nn > k)
nn = k;
kk = abs(x) - nn * d;
long nokor... | replace | 13 | 26 | 13 | 19 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define F first
#define S second
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long double x, k, d;
cin >> x >> k >> d;
ll y = k;
if (y % 2 != 0) {
long double r = (k + 1) / 2;
long double l = (-... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define F first
#define S second
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long double x, k, d;
cin >> x >> k >> d;
ll y = k;
if (y % 2 != 0) {
long double r = (k + 1) / 2;
long double l = (-... | replace | 19 | 20 | 19 | 20 | TLE | |
p02584 | Python | Runtime Error | X, K, D = map(int, input().split())
def f(C):
NX = float("inf")
if C > K:
return NX
if K % 2 == 0:
if C % 2 == 0:
NX = abs(abs(X) - C * D)
else:
NX = abs(abs(X) - (C + 1) * D)
if C > 0:
NX = min(NX, abs(abs(X) - (C - 1) * D))
... | X, K, D = map(int, input().split())
def f(C):
NX = float("inf")
if C > K:
return NX
if K % 2 == 0:
if C % 2 == 0:
NX = abs(abs(X) - C * D)
else:
NX = abs(abs(X) - (C + 1) * D)
if C > 0:
NX = min(NX, abs(abs(X) - (C - 1) * D))
... | replace | 17 | 18 | 17 | 18 | 0 | |
p02584 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "/home/laxsuryavanshi/Desktop/cp/trace.hpp"
#else
#define trace(...)
#endif // LOCAL_DEBUG
int32_t main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
std::cout.tie(0);
#ifdef LOCAL_INPUT
freopen("in", "r", stdin);
#endif
typ... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "/home/laxsuryavanshi/Desktop/cp/trace.hpp"
#else
#define trace(...)
#endif // LOCAL_DEBUG
int32_t main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
std::cout.tie(0);
#ifdef LOCAL_INPUT
freopen("in", "r", stdin);
#endif
typ... | replace | 19 | 20 | 19 | 20 | 0 | |
p02584 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
constexpr long long INFLL = 1e18;
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
constexpr long long INFLL = 1e18;
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
... | insert | 33 | 33 | 33 | 40 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, d, c;
cin >> a >> d >> c;
for (long long i = 0; i < d; i++) {
if (abs(a) <= c / 2) {
i += ((d - i - 1) / 2) * 2;
}
if (a > 0)
a -= c;
else
a += c;
}
cout << abs(a) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, d, c;
cin >> a >> d >> c;
a = abs(a);
long long step = min(d, a / c);
d -= step;
a -= step * c;
if (d % 2 == 0)
cout << a << endl;
else
cout << c - a << endl;
} | replace | 6 | 16 | 6 | 14 | TLE | |
p02584 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X, K, D;
cin >> X >> K >> D;
if (X < 0) {
X = -X;
}
// D未満になるまでにかかる回数
int64_t num = X / D;
assert(num <= K);
if (num >= K) {
cout << X - D * K << endl;
return 0;
}
// D未満になったときの値
int64_t x = X - D * num;
// 残り操作回... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X, K, D;
cin >> X >> K >> D;
if (X < 0) {
X = -X;
}
// D未満になるまでにかかる回数
int64_t num = X / D;
if (num >= K) {
cout << X - D * K << endl;
return 0;
}
// D未満になったときの値
int64_t x = X - D * num;
// 残り操作回数
int64_t rem = K ... | delete | 12 | 13 | 12 | 12 | 0 | |
p02584 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ABS(ll a) {
if (a < 0)
return -a;
else
return a;
}
int main() {
ll X, K, D;
cin >> X >> K >> D;
for (ll i = 0; i < K;) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ABS(ll a) {
if (a < 0)
return -a;
else
return a;
}
int main() {
ll X, K, D;
cin >> X >> K >> D;
ll i = min(ABS(X) / D, K);
... | replace | 21 | 22 | 21 | 24 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
const double pi = 3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
const double pi = 3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec... | replace | 245 | 250 | 245 | 256 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef __int128 LL;
inline __int128 read() {
__int128 x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef __int128 LL;
inline __int128 read() {
__int128 x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0... | replace | 29 | 42 | 29 | 42 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
int MAX_INT = 1e9;
// 最大公約数
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// 最小公倍数
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main(void) {
ios::sync_with_stdio(fal... | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
int MAX_INT = 1e9;
// 最大公約数
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// 最小公倍数
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main(void) {
ios::sync_with_stdio(fal... | insert | 30 | 30 | 30 | 33 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <new>
#include <queue>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define loop(i, x, z) for (int i = x; i < z; i++)
us... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <new>
#include <queue>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define loop(i, x, z) for (int i = x; i < z; i++)
us... | insert | 24 | 24 | 24 | 33 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define _start \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define _start \
ios_base::sync_with_stdio(false); ... | replace | 62 | 66 | 62 | 69 | TLE | |
p02584 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <unistd.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame ... | #include <bits/stdc++.h>
#include <unistd.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame ... | replace | 246 | 338 | 246 | 273 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02584 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define printll(a) printf("%lld\n", a)
#define printdbl(a) printf("%lf\n", a)
#define printYes() printf("Yes\n")
#define printNo() printf("No\n")
#define scanll(a) scanf("%lld", &a)
#define scanInt(a) scanf("%... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define printll(a) printf("%lld\n", a)
#define printdbl(a) printf("%lf\n", a)
#define printYes() printf("Yes\n")
#define printNo() printf("No\n")
#define scanll(a) scanf("%lld", &a)
#define scanInt(a) scanf("%... | replace | 44 | 47 | 44 | 51 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(... | #include <bits/stdc++.h>
using namespace std;
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(... | replace | 34 | 55 | 34 | 56 | TLE | |
p02584 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
long long k;
long long d;
cin >> x >> k >> d;
long long mostnear = abs(x) % d;
if (mostnear / d + k <= abs(x) / d) {
cout << abs(x) - (k * d);
} else if ((abs(k) % abs(x / d) == 1))
cout << mostnear;
else
cout << abs(mos... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
long long k;
long long d;
cin >> x >> k >> d;
long long mostnear = abs(x) % d;
if (mostnear / d + k <= abs(x) / d) {
cout << abs(x) - (k * d);
} else if (abs(x / d) % 2 == 0 && k % 2 == 0)
cout << mostnear;
else if (abs(x / ... | replace | 10 | 11 | 10 | 13 | 0 | |
p02584 | C++ | Time Limit Exceeded | #include <cmath>
#include <ctype.h>
#include <iostream>
#include <limits.h>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
// 最大公約数
int gcd(int a, int b)... | #include <cmath>
#include <ctype.h>
#include <iostream>
#include <limits.h>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
// 最大公約数
int gcd(int a, int b)... | replace | 78 | 93 | 78 | 89 | TLE | |
p02584 | C++ | Time Limit Exceeded | // ABC 175 C
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int x, d, k, ans, fl, flfl, flflfl = 0, fm;
cin >> x >> k >> d;
fl = 1;
if (k % 2 == 0) {
fl = 0;
}
if (x < 0) {
x *= -1;
}
flfl = 0;
if (d >= x) {
flfl = 1;
}
// cout << flfl<<endl;
if (flfl == 0) {
... | // ABC 175 C
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int x, d, k, ans, fl, flfl, flflfl = 0, fm;
cin >> x >> k >> d;
fl = 1;
if (k % 2 == 0) {
fl = 0;
}
if (x < 0) {
x *= -1;
}
flfl = 0;
if (d >= x) {
flfl = 1;
}
// cout << flfl<<endl;
if (flfl == 0) {
... | replace | 20 | 28 | 20 | 21 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <iostream>
long long abs(long long a) { return (a < 0) ? -a : a; }
int sgn(long long a) { return (a < 0) ? -1 : 1; }
int main() {
long long X, K, D;
std::cin >> X >> K >> D;
while (K > 0) {
if (abs(X - sgn(X) * D) < abs(X)) {
long long times = abs(X) / D;
if (K < times)
times ... | #include <iostream>
long long abs(long long a) { return (a < 0) ? -a : a; }
int sgn(long long a) { return (a < 0) ? -1 : 1; }
int main() {
long long X, K, D;
std::cin >> X >> K >> D;
while (K > 0) {
if (abs(X - sgn(X) * D) < abs(X)) {
long long times = abs(X) / D;
if (times == 0)
times... | insert | 13 | 13 | 13 | 15 | TLE | |
p02584 | C++ | Runtime Error | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define int long long
#define INF 1e18
#define ff first
#define ss second
#define vi vector<int>
#define pii pair<int, int>
#define mii map<int, ... | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define int long long
#define INF 1e18
#define ff first
#define ss second
#define vi vector<int>
#define pii pair<int, int>
#define mii map<int, ... | replace | 61 | 62 | 61 | 62 | 0 | |
p02584 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mod 1000000007
#define pi 3.141592653589793
typedef vector<ll> vcl;
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mod 1000000007
#define pi 3.141592653589793
typedef vector<ll> vcl;
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b)... | replace | 38 | 42 | 38 | 40 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
long long x, pos, plus_min, minus_min;
unsigned long k, d;
cin >> x >> k >> d;
pos = x;
plus_min = pow(10, 15) + 1;
minus_min = -pow(10, 15) - 1;
for (unsigned long i = 1; i <= k; i++) {
if (pos < 0) {
po... | #include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
long long x, pos, plus_min, minus_min;
unsigned long k, d;
cin >> x >> k >> d;
pos = x;
plus_min = pow(10, 15) + 1;
minus_min = -pow(10, 15) - 1;
long long quotient = abs(x) / d, mod = abs(x) % d;
if (k * d <= ab... | insert | 12 | 12 | 12 | 25 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<int>>;
using ll = long long;
//----------素因数分解----------
vector<ll>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<int>>;
using ll = long long;
//----------素因数分解----------
vector<ll>... | insert | 25 | 25 | 25 | 35 | TLE | |
p02584 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define foi(i, n) for (int i = 0; i < n; i++)
#define Foi(i, k, n) \
for (int i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define fol(i, n) for (ll i = 0; i < n; i++)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define foi(i, n) for (int i = 0; i < n; i++)
#define Foi(i, k, n) \
for (int i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define fol(i, n) for (ll i = 0; i < n; i++)
#defin... | replace | 83 | 87 | 83 | 90 | TLE | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(1 + n);
vector<ll> c(1 + n);
for (int i = 1; i <= n; ++i)
cin >> p[i];
for (int i = 1; i <= n; ++i)
cin >> c[i];
// ループのスコア計算は前処理
vector<ll> loop_score(1 + n);
vector<int> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(1 + n);
vector<ll> c(1 + n);
for (int i = 1; i <= n; ++i)
cin >> p[i];
for (int i = 1; i <= n; ++i)
cin >> c[i];
// ループのスコア計算は前処理
vector<ll> loop_score(1 + n);
vector<int> ... | replace | 42 | 46 | 42 | 48 | TLE | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
vector<ll> c(n);
for (auto &e : p) {
cin >> e;
e--;
}
for (auto &e : c)
cin >> e;
vector<ll> s1(n), s2(n), d1(n), d2(n);
for (int i = 0; i < n; i++) {
if (d1[i]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
vector<ll> c(n);
for (auto &e : p) {
cin >> e;
e--;
}
for (auto &e : c)
cin >> e;
vector<ll> s1(n), s2(n), d1(n), d2(n);
for (int i = 0; i < n; i++) {
if (d1[i]... | replace | 37 | 39 | 37 | 40 | TLE | |
p02585 | C++ | Time Limit Exceeded | #pragma GCC target("avx")
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define LD long double
#define ST string
#define BS bitset
#define PA pair<L... | #pragma GCC target("avx")
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define LD long double
#define ST string
#define BS bitset
#define PA pair<L... | replace | 263 | 264 | 263 | 264 | TLE | |
p02585 | Python | Time Limit Exceeded | N, K = map(int, input().split())
P = list(map(int, input().split()))
C = list(map(int, input().split()))
P = [None] + P
C = [None] + C
all_max = C[1]
for st in range(1, N + 1):
scores = []
visit = set()
p = st
while p not in visit and len(visit) < K:
next_p = P[p]
scores.append(C[next... | N, K = map(int, input().split())
P = list(map(int, input().split()))
C = list(map(int, input().split()))
P = [None] + P
C = [None] + C
all_max = C[1]
for st in range(1, N + 1):
scores = []
visit = set()
p = st
while p not in visit and len(visit) < K:
next_p = P[p]
scores.append(C[next... | insert | 48 | 48 | 48 | 49 | TLE | |
p02585 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, s, n) for (ll i = s; i < (n); i++)
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> p(n), c(n);
rep(i, n) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, s, n) for (ll i = s; i < (n); i++)
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> p(n), c(n);
rep(i, n) {
... | replace | 21 | 22 | 21 | 22 | -11 | |
p02585 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n), c(n);
rep(i, n) cin >> p[i];
rep(i, n) cin >> c[i];
rep(i, n) p[i]--;
ll ans = -1e18;
rep(si, n) {
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n), c(n);
rep(i, n) cin >> p[i];
rep(i, n) cin >> c[i];
rep(i, n) p[i]--;
ll ans = -1e18;
rep(si, n) {
in... | replace | 27 | 28 | 27 | 28 | 0 | |
p02585 | C++ | Time Limit Exceeded | #include <iostream>
#include <limits.h>
#include <queue>
#include <vector>
using namespace std;
int main(void) {
int N;
long long K;
cin >> N >> K;
vector<int> P(N + 1); // move
for (int i = 1; i < N + 1; i++) {
cin >> P[i];
}
vector<long long> C(N + 1); // point
for (int i = 1; i < N + 1; i++) {... | #include <iostream>
#include <limits.h>
#include <queue>
#include <vector>
using namespace std;
int main(void) {
int N;
long long K;
cin >> N >> K;
vector<int> P(N + 1); // move
for (int i = 1; i < N + 1; i++) {
cin >> P[i];
}
vector<long long> C(N + 1); // point
for (int i = 1; i < N + 1; i++) {... | insert | 43 | 43 | 43 | 60 | TLE | |
p02585 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
... | replace | 75 | 76 | 75 | 76 | 0 | |
p02585 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REPS(i, n) for (ll(i) = 1; (i) <= (n); (i)++)
#define RREP(i, n) for (ll(i) = (n -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REPS(i, n) for (ll(i) = 1; (i) <= (n); (i)++)
#define RREP(i, n) for (ll(i) = (n -... | replace | 78 | 79 | 78 | 83 | 0 | |
p02585 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.... | replace | 85 | 86 | 85 | 86 | 0 | |
p02585 | Python | Runtime Error | import sys
readline = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
sys.setrecursionlimit(10**5)
def main():
n, k = map(int, readline().split())
p = list(map(int, readline().split()))
p = [x - 1 for x in p]
c = list(map(int, readline().split()))
ans = -INF
for i in range(n):
... | import sys
readline = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
sys.setrecursionlimit(10**5)
def main():
n, k = map(int, readline().split())
p = list(map(int, readline().split()))
p = [x - 1 for x in p]
c = list(map(int, readline().split()))
ans = -INF
for i in range(n):
... | replace | 33 | 34 | 33 | 34 | 0 | |
p02585 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, K;
vector<int> P, C;
map<int, vector<pair<ll, int>>> memo;
vector<pair<ll, int>> f(int k) {
if (memo.count(k))
return memo[k];
if (k == 1) {
vector<pair<ll, int>> r(N);
for (int i = 0; i < N; ++i) {
r[i] = {C[P[i]], P[i]};
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, K;
vector<int> P, C;
map<int, vector<pair<ll, int>>> memo;
vector<pair<ll, int>> f(int k) {
if (memo.count(k))
return memo[k];
if (k == 1) {
vector<pair<ll, int>> r(N);
for (int i = 0; i < N; ++i) {
r[i] = {C[P[i]], P[i]};
... | replace | 16 | 18 | 16 | 23 | MLE | |
p02585 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limit... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limit... | replace | 158 | 159 | 158 | 159 | 0 | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for (ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for (ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typ... | replace | 38 | 42 | 38 | 54 | TLE | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> P(N), C(N);
for (auto &x : P)
cin >> x, x--;
for (auto &x : C)
cin >> x;
ll res = -1e18;
for (int i = 0; i < N; i++) {
vector<ll> sum;
ll t = 0;
int idx = i;
do {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> P(N), C(N);
for (auto &x : P)
cin >> x, x--;
for (auto &x : C)
cin >> x;
ll res = -1e18;
for (int i = 0; i < N; i++) {
vector<ll> sum;
ll t = 0;
int idx = i;
do {
... | replace | 23 | 27 | 23 | 33 | TLE | |
p02585 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | insert | 71 | 71 | 71 | 75 | TLE | |
p02585 | C++ | Runtime Error | #include "list"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsi... | #include "list"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsi... | replace | 240 | 241 | 240 | 241 | 0 | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
ll r;
cin >> n >> k;
vector<vector<ll>> v(n);
vector<ll> p(n), c(n), siz(n, 0);
for (ll &i : p)
cin >> i, --i;
for (ll &i : c)
cin >> ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
ll r;
cin >> n >> k;
vector<vector<ll>> v(n);
vector<ll> p(n), c(n), siz(n, 0);
for (ll &i : p)
cin >> i, --i;
for (ll &i : c)
cin >> ... | replace | 26 | 29 | 26 | 32 | TLE | |
p02585 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
// #pragma warning(disable : 4996)
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
// #pragma warning(disable : 4996)
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <... | replace | 104 | 115 | 104 | 124 | TLE | |
p02585 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD (long long)(1e9 + 7)
using namespace std;
long long n, k, vis[5005];
long long p[5005], c[5005], sum[5005], ans = -1e18;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> p[i];
for (int i = 1; i <= n; i++)
cin >> c[i];
for (int i = 1; i <= n; i++) {
... | #include <bits/stdc++.h>
#define MOD (long long)(1e9 + 7)
using namespace std;
long long n, k, vis[5005];
long long p[5005], c[5005], sum[5005], ans = -1e18;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> p[i];
for (int i = 1; i <= n; i++)
cin >> c[i];
for (int i = 1; i <= n; i++) {
... | replace | 18 | 19 | 18 | 19 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02585 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e2 + 9;
const double ep = 1e-7;
const int mod = 998244353;
const double pi = acos(-1);
const int INF = -1e9;
#define mk make_pair
#define PII pair<int, int>
#define PIII pair<int, PII>
#define PIL pair<int, ll>
#define PLI pair<ll, int>
#define eb emplace_... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 5e3 + 9;
const double ep = 1e-7;
const int mod = 998244353;
const double pi = acos(-1);
const int INF = -1e9;
#define mk make_pair
#define PII pair<int, int>
#define PIII pair<int, PII>
#define PIL pair<int, ll>
#define PLI pair<ll, int>
#define eb emplace_... | replace | 2 | 3 | 2 | 3 | 0 | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define pii pair<int, int>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0);
#define fio ... | #include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define pii pair<int, int>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0);
#define fio ... | replace | 73 | 81 | 73 | 130 | TLE | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
#define endl '\n'
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
#define endl '\n'
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename... | insert | 148 | 148 | 148 | 149 | TLE | |
p02585 | Python | Runtime Error | n, k = [int(z) for z in input().strip().split()]
p = [int(z) - 1 for z in input().strip().split()]
c = [int(z) for z in input().strip().split()]
visited = [False for _ in range(n)]
cycle = []
for start in range(n):
if visited[start]:
continue
now = start
route = []
while not visited[now]:
... | n, k = [int(z) for z in input().strip().split()]
p = [int(z) - 1 for z in input().strip().split()]
c = [int(z) for z in input().strip().split()]
visited = [False for _ in range(n)]
cycle = []
for start in range(n):
if visited[start]:
continue
now = start
route = []
while not visited[now]:
... | replace | 35 | 36 | 35 | 37 | 0 | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> p(n);
vector<ll> c(n);
for (ll i = 0; i < n; i++) {
ll _p;
cin >> _p;
p[i] = _p - 1;
}
for (ll i = 0; i < n; i++) {
cin >> c[i];
}
ll best = -INFINITY;
for (ll start = ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> p(n);
vector<ll> c(n);
for (ll i = 0; i < n; i++) {
ll _p;
cin >> _p;
p[i] = _p - 1;
}
for (ll i = 0; i < n; i++) {
cin >> c[i];
}
ll best = -INFINITY;
for (ll start = ... | replace | 19 | 20 | 19 | 20 | TLE | |
p02585 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5010;
ll c[N], p[N], q[N << 1], u[N << 1];
vector<ll> V[N];
bool vis[N];
int main() {
ll n, k;
scanf("%lld %lld", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%lld", &p[i]);
for (int i = 1; i <= n; i++)
scanf("%lld", &c[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5010;
ll c[N], p[N], q[N << 1], u[N << 1];
vector<ll> V[N];
bool vis[N];
int main() {
ll n, k;
scanf("%lld %lld", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%lld", &p[i]);
for (int i = 1; i <= n; i++)
scanf("%lld", &c[i]... | replace | 35 | 36 | 35 | 36 | 0 | |
p02585 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <... | replace | 48 | 49 | 48 | 49 | TLE | |
p02585 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INPUT freopen("input.txt", "r", stdin);
#define ll long long
#define ld long double
#define len(s) s.size()
#define fl(st, en, in) for (int i = st; i < en; i += in)
#define rfl(st, en, de) for (int i = st; i < en; i -= de)
#define fll fl(0, n, 1)
#define cy cou... | #include <bits/stdc++.h>
using namespace std;
#define INPUT freopen("input.txt", "r", stdin);
#define ll long long
#define ld long double
#define len(s) s.size()
#define fl(st, en, in) for (int i = st; i < en; i += in)
#define rfl(st, en, de) for (int i = st; i < en; i -= de)
#define fll fl(0, n, 1)
#define cy cou... | replace | 27 | 28 | 27 | 28 | 0 | |
p02585 | C++ | Runtime Error | /*
ID: Loxilante
Time: 2020/08/16
Prog: ABC175D
Lang: cpp
*/
#ifdef ONLINE_JUDGE
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
#define rep(i, l, r) for (register int i = l; i < r; i++)
#define hrp(i, l, r) for (register int i = l; i <= r; i++)
#define rev(i, r, l) for (regis... | /*
ID: Loxilante
Time: 2020/08/16
Prog: ABC175D
Lang: cpp
*/
#ifdef ONLINE_JUDGE
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
#define rep(i, l, r) for (register int i = l; i < r; i++)
#define hrp(i, l, r) for (register int i = l; i <= r; i++)
#define rev(i, r, l) for (regis... | replace | 75 | 76 | 75 | 80 | 0 | |
p02585 | C++ | Runtime Error | /*input
5 2
2 4 5 1 3
3 4 -10 -8 8
*/
/*
______________
| )
| ) /
|______/
... | /*input
5 2
2 4 5 1 3
3 4 -10 -8 8
*/
/*
______________
| )
| ) /
|______/
... | replace | 167 | 168 | 167 | 168 | 0 | |
p02585 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for... | replace | 70 | 71 | 70 | 71 | 0 | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
// freopen("input.txt", "r", stdin);
ll compute_neg(deque<ll> cost, ll k) {
... | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
// freopen("input.txt", "r", stdin);
ll compute_neg(deque<ll> cost, ll k) {
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
ll n, k, ans = -10000000000;
cin >> n >> k;
vector<ll> p(n), c(n);
rep(i, n) {
cin >> p[i];
--p[i];
}
rep(i, n) cin >> c[i];
if (k) {
v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
ll n, k, ans = -10000000000;
cin >> n >> k;
vector<ll> p(n), c(n);
rep(i, n) {
cin >> p[i];
--p[i];
}
rep(i, n) cin >> c[i];
vector<ll> dp(... | replace | 16 | 24 | 16 | 34 | TLE | |
p02585 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <ve... | insert | 76 | 76 | 76 | 77 | TLE | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi firs... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi firs... | replace | 73 | 74 | 73 | 74 | TLE | |
p02585 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ff first
#define ss second
typedef long long ll;
ll power(ll a, ll b) { // a^b
ll res = 1;
a = a % MOD;
while (b > 0) {
if (b & 1) {
res = (res * a) % MOD;
b--;
}
a = (a * a) % MOD;
b >>= 1;
}
return res;
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ff first
#define ss second
typedef long long ll;
ll power(ll a, ll b) { // a^b
ll res = 1;
a = a % MOD;
while (b > 0) {
if (b & 1) {
res = (res * a) % MOD;
b--;
}
a = (a * a) % MOD;
b >>= 1;
}
return res;
... | replace | 28 | 29 | 28 | 29 | -11 | |
p02585 | C++ | Time Limit Exceeded | //
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define lch (o << 1)
#define rch (o << 1 | 1)
typedef double db;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> pint;
typedef tuple<int, int, int> tint;
const int N = 1e5 + 5;
... | //
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define lch (o << 1)
#define rch (o << 1 | 1)
typedef double db;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> pint;
typedef tuple<int, int, int> tint;
const int N = 1e5 + 5;
... | delete | 49 | 52 | 49 | 49 | TLE | |
p02585 | C++ | Runtime Error | #pragma GCC optimize(2)
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#incl... | #pragma GCC optimize(2)
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#incl... | replace | 27 | 28 | 27 | 28 | 0 | |
p02585 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int arr[5001];
int points[5001];
pair<int, ll> memo[5001]; // {횟수,총점수}
int main() {
int N, ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int arr[5001];
int points[5001];
pair<int, ll> memo[5001]; // {횟수,총점수}
int main() {
int N, ... | insert | 54 | 54 | 54 | 61 | TLE | |
p02585 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1010101010;
constex... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1010101010;
constex... | replace | 74 | 75 | 74 | 76 | 0 | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t K;
cin >> N >> K;
vector<int> P(N);
for (int i = 0; i < N; i++)
cin >> P[i], P[i]--;
vector<int64_t> C(N);
for (int i = 0; i < N; i++)
cin >> C[i];
vector<int> visited(N);
vector<vector<int>> VV;
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t K;
cin >> N >> K;
vector<int> P(N);
for (int i = 0; i < N; i++)
cin >> P[i], P[i]--;
vector<int64_t> C(N);
for (int i = 0; i < N; i++)
cin >> C[i];
vector<int> visited(N);
vector<vector<int>> VV;
for (int i = 0; i < ... | insert | 24 | 24 | 24 | 26 | TLE | |
p02585 | C++ | Runtime Error | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
vector<ll> c(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
p[i]--;
}
for (int i = 0; i < n; i++)
cin >> c[i];
vector<vector<int>> v(... | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
vector<ll> c(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
p[i]--;
}
for (int i = 0; i < n; i++)
cin >> c[i];
vector<vector<int>> v(... | replace | 62 | 63 | 62 | 69 | 0 | |
p02585 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
int p[5001];
int c[5001];
long long ans[5001] = {0};
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
int p[5001];
int c[5001];
long long ans[5001] = {0};
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 0; i < ... | replace | 24 | 25 | 24 | 25 | TLE | |
p02586 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll, ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll, ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v... | replace | 43 | 44 | 43 | 46 | TLE | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll v[3000][3000], dp[3000][3000][4];
int main(void) {
int r, c, t;
cin >> r >> c >> t;
fill(v[0], v[r + 1], 0);
rep(i, t) {
int a, b;
cin >> a >> b;
cin >> ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll v[3000][3000], dp[3000][3000][4];
int main(void) {
int r, c, t;
cin >> r >> c >> t;
fill(v[0], v[r], 0);
rep(i, t) {
int a, b;
cin >> a >> b;
cin >> v[a ... | replace | 11 | 12 | 11 | 12 | -11 | |
p02586 | C++ | Runtime Error | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::num... | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::num... | replace | 28 | 30 | 28 | 30 | -11 | |
p02586 | 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 | 129 | 130 | 129 | 130 | 0 | |
p02586 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <vector>
// #include<unordered_map>
int main() {
int R, C, K;
std::cin >> R >> C >> K;
std::vector<std::vector<unsigned long long>> mat(
R, std::vector<unsigned long long>(C, 0));
std::vector<std::vector<bool>> flags(R, std::vector<bool>(C, 1));
std::vector<... | #include <iostream>
#include <queue>
#include <vector>
// #include<unordered_map>
int main() {
int R, C, K;
std::cin >> R >> C >> K;
std::vector<std::vector<unsigned long long>> mat(
R, std::vector<unsigned long long>(C, 0));
std::vector<std::vector<bool>> flags(R, std::vector<bool>(C, 1));
std::vector<... | replace | 58 | 59 | 58 | 59 | -11 | |
p02586 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#inclu... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#inclu... | replace | 24 | 25 | 24 | 25 | -11 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll, ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll, ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v... | replace | 38 | 41 | 38 | 40 | 0 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int M = 1e3;
int n, m, mat[M][M];
long long memo[M][M][4];
long long solve(int i, int j, int cnt) {
if (i == n || j == m)
return 0;
long long &r = memo[i][j][cnt];
if (r == -1) {
r = max(solve(i + 1, j, 0), solve(i, j + 1, cnt));
if (cnt < 3 && mat... | #include <bits/stdc++.h>
using namespace std;
const int M = 3e3;
int n, m, mat[M][M];
long long memo[M][M][4];
long long solve(int i, int j, int cnt) {
if (i == n || j == m)
return 0;
long long &r = memo[i][j][cnt];
if (r == -1) {
r = max(solve(i + 1, j, 0), solve(i, j + 1, cnt));
if (cnt < 3 && mat... | replace | 3 | 4 | 3 | 4 | 0 | |
p02586 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#in... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#in... | replace | 97 | 98 | 97 | 98 | -11 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
ll R, C, K;
cin >> R >> C >> K;
vector<ll> r(K), c(K), v(K);
rep(i, K) cin >> r[i] >> c[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
ll R, C, K;
cin >> R >> C >> K;
vector<ll> r(K), c(K), v(K);
rep(i, K) cin >> r[i] >> c[... | replace | 17 | 18 | 17 | 19 | 0 | |
p02586 | C++ | Runtime Error | #ifndef INCLUDEHEADER_MY_TEMPLATE
#define INCLUDEHEADER_MY_TEMPLATE
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cst... | #ifndef INCLUDEHEADER_MY_TEMPLATE
#define INCLUDEHEADER_MY_TEMPLATE
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cst... | insert | 870 | 870 | 870 | 873 | -11 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// #define ll long long
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// #define ll long long
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1... | delete | 55 | 56 | 55 | 55 | -11 | |
p02586 | C++ | Time Limit Exceeded | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
constexpr long long INF = 1LL << 60;
constexpr long long MOD = 1000000007;
double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define r... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
constexpr long long INF = 1LL << 60;
constexpr long long MOD = 1000000007;
double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define r... | replace | 361 | 377 | 361 | 377 | TLE | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define INF (int)1e9 + 4
#define INFL (ll)1e18 + 4
#define md (int)1e9 + 7
#define mx 10000000
#define mk make_pair
#define pi pair<int, int>
#define ss second
#define ff first
#define pb emplace_back
#define onell(x) __builti... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define INF (int)1e9 + 4
#define INFL (ll)1e18 + 4
#define md (int)1e9 + 7
#define mx 10000000
#define mk make_pair
#define pi pair<int, int>
#define ss second
#define ff first
#define pb emplace_back
#define onell(x) __builti... | replace | 32 | 33 | 32 | 33 | 0 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FO(x) \
{ \
freopen(#x ".in", "r", stdin); \
freopen(#x ".out", "w", std... | #include <bits/stdc++.h>
using namespace std;
#define FO(x) \
{ \
freopen(#x ".in", "r", stdin); \
freopen(#x ".out", "w", std... | replace | 51 | 52 | 51 | 52 | -11 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> ostream &operator<<(ostream &os, vector<T> V) {
os << "[ ";
for (auto v : V)
os << v << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, set<T> S) {
os << "{ ";
for (auto s : S)
os << s << " ";
return os << ... | #include <bits/stdc++.h>
using namespace std;
template <class T> ostream &operator<<(ostream &os, vector<T> V) {
os << "[ ";
for (auto v : V)
os << v << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, set<T> S) {
os << "{ ";
for (auto s : S)
os << s << " ";
return os << ... | replace | 95 | 96 | 95 | 96 | 0 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int R, C, K;
long long memo[3005][3005][10];
int grid[3005][3005];
bool exists(int r, int c) { return (1 <= r && r <= R) && (1 <= c && c <= C); }
long long dp(int r, int c, int rem) {
if (memo[r][c][rem] != -1)
return memo[r][c][rem];
memo[r][c][rem] = 0;
if (... | #include <bits/stdc++.h>
using namespace std;
int R, C, K;
long long memo[3005][3005][10];
int grid[3005][3005];
bool exists(int r, int c) { return (1 <= r && r <= R) && (1 <= c && c <= C); }
long long dp(int r, int c, int rem) {
if (memo[r][c][rem] != -1)
return memo[r][c][rem];
memo[r][c][rem] = 0;
if (... | replace | 53 | 54 | 53 | 54 | -11 | |
p02586 | C++ | Runtime Error |
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <re... |
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <re... | replace | 369 | 370 | 369 | 370 | 0 | |
p02586 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
typedef long long int64;
const int MAXN = 3000;
int n, m, q;
int a[MAXN][MAXN];
int64 f[MAXN][MAXN][4];
#define chkmax(x, y) x = std::max(x, y)
int main() {
// #ifndef ONLINE_JUDGE
// freopen("e.in", "r", stdin);
// freopen("e.out", "w", stdout);
// #endif
... | #include <algorithm>
#include <cstdio>
typedef long long int64;
const int MAXN = 3000 + 10;
int n, m, q;
int a[MAXN][MAXN];
int64 f[MAXN][MAXN][4];
#define chkmax(x, y) x = std::max(x, y)
int main() {
// #ifndef ONLINE_JUDGE
// freopen("e.in", "r", stdin);
// freopen("e.out", "w", stdout);
// #endi... | replace | 5 | 6 | 5 | 6 | -11 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int r, c, k;
cin >> r >> c >> k;
ll vec[3100][3100][4] = {};
ll p[3100][3100] = {};
for (int i = 0; i < k; i++) {
int a, b;
ll point;
cin >> a >> b >> point;
p[a][b] = point;
}
for (int i = 1; i <= r; i++) {
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int r, c, k;
cin >> r >> c >> k;
vector<vector<vector<ll>>> vec(3100, vector<vector<ll>>(3100, vector<ll>(4)));
vector<vector<ll>> p(3100, vector<ll>(3100));
for (int i = 0; i < 3100; i++) {
for (int j = 0; j < 3100; j++) {
... | replace | 7 | 9 | 7 | 18 | -11 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi firs... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi firs... | replace | 42 | 43 | 42 | 43 | -11 | |
p02586 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = lon... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = lon... | insert | 66 | 66 | 66 | 68 | TLE | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll N = 2e3 + 30, Mod = 1e9 + 7;
const ll SQ = 330;
ll dp[N][N][4], n, m, k, a[N][N];
int main() {
ios::s... | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll N = 3e3 + 30, Mod = 1e9 + 7;
const ll SQ = 330;
ll dp[N][N][4], n, m, k, a[N][N];
int main() {
ios::s... | replace | 10 | 11 | 10 | 11 | -11 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll MOD = 1e9 + 7;
ll R, C;
ll dp[3000][3000][4];
// dp[i][j][picked] : denotes the max value picked from (i,j) to (R,C) with the
// constraints given
ll rec(int i, int j, int picked, vector<vector<ll>> &grid) {
if (i > R || i < 1 || j > C |... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll MOD = 1e9 + 7;
ll R, C;
ll dp[3001][3001][4];
// dp[i][j][picked] : denotes the max value picked from (i,j) to (R,C) with the
// constraints given
ll rec(int i, int j, int picked, vector<vector<ll>> &grid) {
if (i > R || i < 1 || j > C |... | replace | 5 | 6 | 5 | 6 | -11 | |
p02586 | C++ | Runtime Error | // #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
//==... | // #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
//==... | replace | 174 | 175 | 174 | 175 | -11 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int r, c, k;
cin >> r >> c >> k;
vector<vector<ll>> item(r, vector<ll>(c));
ll dp[3100][3100][4];
for (int i = 0; i < r + 100; i++) {
for (int j = 0; j < c + 100; j++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int r, c, k;
cin >> r >> c >> k;
vector<vector<ll>> item(r, vector<ll>(c));
vector<vector<vector<ll>>> dp(r + 100,
vector<vector<ll>>(c + 100, vector<... | replace | 13 | 21 | 13 | 23 | -11 | |
p02586 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <un... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <un... | replace | 38 | 39 | 38 | 39 | 0 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pvec(v) \
for (auto e : v) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pvec(v) \
for (auto e : v) ... | replace | 45 | 46 | 45 | 46 | 0 | |
p02586 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll, ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll, ll>>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll, ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll, ll>>... | replace | 16 | 17 | 16 | 17 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02586 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int R, C, K;
cin >> R >> C >> K;
map<int, map<int, ll>... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int R, C, K;
cin >> R >> C >> K;
int goods[R][C];
me... | replace | 19 | 20 | 19 | 22 | TLE | |
p02586 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <chrono>
#include <map>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <thread>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repu(i, k, n) for (int i = k; i <= n; i++)
#define repd(i, k, n) for (ll i... | #include <algorithm>
#include <bits/stdc++.h>
#include <chrono>
#include <map>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <thread>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repu(i, k, n) for (int i = k; i <= n; i++)
#define repd(i, k, n) for (ll i... | replace | 44 | 46 | 44 | 47 | 0 | Time : 23.212ms
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.