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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long temp[1000], a[100000], n, m, ans;
inline void __merge(int l, int r) {
if (l == r)
return;
int mid = (l + r) >> 1;
__merge(l, mid);
__merge(mid + 1, r);
int i = l, j = mid + 1;
for (int k = l; k <= r; k++) {
if ((i <= mid && a[i] < a[j]) || j > ... | #include <bits/stdc++.h>
using namespace std;
long long temp[200020], a[200020], n, m, ans;
inline void __merge(int l, int r) {
if (l == r)
return;
int mid = (l + r) >> 1;
__merge(l, mid);
__merge(mid + 1, r);
int i = l, j = mid + 1;
for (int k = l; k <= r; k++) {
if ((i <= mid && a[i] < a[j]) || j ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, p[100005], k, ans = 0;
signed main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> p[i];
sort(p, p + n);
for (int i = 0; i < n - k; i++) {
ans += p[i];
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, p[200005], k, ans = 0;
signed main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> p[i];
sort(p, p + n);
for (int i = 0; i < n - k; i++) {
ans += p[i];
}
cout << ans;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
sort(H.rbegin(), H.rend());
for (int i = 0; i < K; i++)
H.at(i) = 0;
cout << accumulate(H.begin(), H.end(), 0L) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
sort(H.rbegin(), H.rend());
for (int i = 0; i < min(K, N); i++)
H.at(i) = 0;
cout << accumulate(H.begin(), H.end(), 0L) << "\n";
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef lo... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef lo... | replace | 20 | 21 | 20 | 21 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.rbegin(), h.rend());
ll ans = 0;
if (n <= k) {
ans = 0;
} else {
for (int i = n - 1; i > k; i++... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.rbegin(), h.rend());
ll ans = 0;
if (n <= k) {
ans = 0;
} else {
for (int i = n - 1; i >= k; i-... | replace | 15 | 16 | 15 | 16 | -11 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)a, i##_len = (b); i < i##_len; i++)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(box) box.begin(), box.end()
using ... | #include <bits/stdc++.h>
#define int long long
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)a, i##_len = (b); i < i##_len; i++)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(box) box.begin(), box.end()
using ... | replace | 107 | 108 | 107 | 108 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll i, j, k, n, m;
cin >> n >> m;
ll a[m];
ll sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (i = 0; i < (n - m); i++)
sum +=... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll i, j, k, n, m;
cin >> n >> m;
ll a[n];
ll sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (i = 0; i < (n - m); i++)
sum +=... | replace | 9 | 10 | 9 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
// #define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
// #define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin... | replace | 81 | 82 | 81 | 82 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
sort(H.rbegin(), H.rend());
cout << accumulate(H.begin() + K, H.end(), 0L) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
sort(H.rbegin(), H.rend());
K = min(N, K);
cout << accumulate(H.begin() + K, H.end(), 0L) << "\n";
} | insert | 10 | 10 | 10 | 11 | 0 | |
p02785 | Python | Time Limit Exceeded | import numpy as np
N, K = [int(i) for i in input().split()]
H = [int(h) for h in input().split()]
H = np.sort(np.array(H))[::-1]
for i in range(min(K, H.shape[0])):
H = np.delete(H, 0)
print(np.sum(H))
| import numpy as np
N, K = [int(i) for i in input().split()]
H = [int(h) for h in input().split()]
H = np.sort(np.array(H))[::-1]
H = H[min(K, H.shape[0]) :]
print(np.sum(H))
| replace | 6 | 8 | 6 | 7 | TLE | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long lon... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long lon... | replace | 16 | 17 | 16 | 17 | 0 | |
p02785 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | insert | 142 | 142 | 142 | 143 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < (b); i++)
#define repr(i, b, a) for (int i = int(b); i >= (a); i--)
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < (b); i++)
#define repr(i, b, a) for (int i = int(b); i >= (a); i--)
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + ... | replace | 38 | 39 | 38 | 39 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define f first
#define s second
using namespace std;
void fast() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
fast();
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.e... | #include <bits/stdc++.h>
#define ll long long int
#define f first
#define s second
using namespace std;
void fast() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
fast();
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.e... | replace | 20 | 21 | 20 | 21 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100001];
long long s;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n - k; i++) {
s += a[i];
}
cout << s;
}
| #include <bits/stdc++.h>
using namespace std;
int n, k, a[300001];
long long s;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n - k; i++) {
s += a[i];
}
cout << s;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long> health(n);
for (int i = 0; i < n; i++) {
cin >> health[i];
}
sort(health.begin(), health.end(), greater<int>());
long long sum = 0LL;
if (k > 0)
health.erase(health.begin(), health.begin() + k);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long> health(n);
for (int i = 0; i < n; i++) {
cin >> health[i];
}
sort(health.begin(), health.end(), greater<int>());
long long sum = 0LL;
if (k > 0)
health.erase(health.begin(), health.begin() + min(k,... | replace | 14 | 15 | 14 | 15 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, p) for (int i = 1; i <= p; i++)
#define ll long long
using namespace std;
int main() {
ll int N, K;
ll int kaisu;
kaisu = 0;
cin >> N >> K;
vector<ll int> H;
ll int x;
for (int ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, p) for (int i = 1; i <= p; i++)
#define ll long long
using namespace std;
int main() {
ll int N, K;
ll int kaisu;
kaisu = 0;
cin >> N >> K;
vector<ll int> H;
ll int x;
for (int ... | replace | 29 | 30 | 29 | 30 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include "lib/bigint2.h"
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace... | #include <bits/stdc++.h>
// #include "lib/bigint2.h"
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace... | replace | 33 | 34 | 33 | 34 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main(void) {
int n, k, v;
long long num = 0;
vector<int> h;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> v;
h.push_back(v);
}
sort(h.begin(), h.end());
for (int i = h.size() - 1; k ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main(void) {
int n, k, v;
long long num = 0;
vector<int> h;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> v;
h.push_back(v);
}
sort(h.begin(), h.end());
for (int i = 0; i < n - k; i+... | replace | 20 | 26 | 20 | 21 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define NREP() for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define YN(x) x ? cout << "YES" << endl : cout << "NO" << endl;
#define Yn(x) x ? cout << "Yes" << endl : cout << "No" << endl;
#define... | #include <bits/stdc++.h>
#define NREP() for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define YN(x) x ? cout << "YES" << endl : cout << "NO" << endl;
#define Yn(x) x ? cout << "Yes" << endl : cout << "No" << endl;
#define... | replace | 21 | 22 | 21 | 26 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
auto s = 0LL;
vector<int> H(N);
for (auto &h : H) {
cin >> h;
s += h;
}
sort(H.rbegin(), H.rend());
for (int i = 0; i < K; ++i)
s -= H[i];
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
auto s = 0LL;
vector<int> H(N);
for (auto &h : H) {
cin >> h;
s += h;
}
sort(H.rbegin(), H.rend());
for (int i = 0; i < min(K, N); ++i)
s -= H[i];
cout << s << endl;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 7;
ll a[maxn];
int main() {
ll n, k, t, s = 0;
scanf("%lld%lld", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
sort(a, a + n);
for (int i = 0; i < n - k; i++)
s += a[i];
printf("%lld\n", s)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 7;
ll a[maxn];
int main() {
ll n, k, t, s = 0;
scanf("%lld%lld", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
sort(a, a + n);
for (int i = 0; i < n - k; i++)
s += a[i];
printf("%lld\n", s)... | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
typedef long long llong;
const int inf = 1 << 20;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
sort(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
typedef long long llong;
const int inf = 1 << 20;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
sort(... | insert | 14 | 14 | 14 | 15 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr.begin(), arr.end(), greater<int>());
cout << accumulate(arr.begin() + k, arr.end(), 0);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
if (k >= n) {
cout << "0";
} else {
sort(arr.begin(), arr.end(), greater<int>());
cout << accumulate(arr.b... | replace | 13 | 16 | 13 | 19 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
ll arr[100005] = {};
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
sort(arr, arr + n, greater<ll>());
for (int i = 0; i < m; i++) {
sum -= arr[i];
}
if (s... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
ll arr[300005] = {};
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
sort(arr, arr + n, greater<ll>());
for (int i = 0; i < m; i++) {
sum -= arr[i];
}
if (s... | replace | 7 | 8 | 7 | 8 | 0 | |
p02785 | Python | Time Limit Exceeded | N, K = map(int, input().lower().split())
H = []
total = 0
input_string = input()
H = input_string.split()
H = list(map(int, H))
for j in range(K):
if not H:
break
else:
H.remove(max(H))
print(sum(H))
| N, K = map(int, input().lower().split())
H = []
total = 0
input_string = input()
H = input_string.split()
H = list(map(int, H))
H.sort(reverse=True)
del H[0:K]
print(sum(H))
| replace | 6 | 11 | 6 | 10 | TLE | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.rbegin(), a.rend());
long long ans = 0;
for (int i = 0; i < k; i++) {
a[i] = 0;
}
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.rbegin(), a.rend());
long long ans = 0;
for (int i = k; i < n; i++) {
ans += a[i];
}
... | replace | 15 | 19 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
bool ok[n];
rep(i, n) ok[i] = false;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
bool ok[n];
rep(i, n) ok[i] = false;... | replace | 17 | 18 | 17 | 18 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#define MAX_COUNT 200005
#define LL long long
using namespace std;
LL health[MAX_COUNT] = {0};
int partition(int start, int end) {
int p = start;
LL pivot = health[end];
for (int j = start; j < end; ++j) {
if (health[j] < pivot) {
LL t = health[j];
health[... | #include <algorithm>
#include <iostream>
#define MAX_COUNT 200005
#define LL long long
using namespace std;
LL health[MAX_COUNT] = {0};
int partition(int start, int end) {
int p = start;
LL pivot = health[end];
for (int j = start; j < end; ++j) {
if (health[j] < pivot) {
LL t = health[j];
health[... | insert | 42 | 42 | 42 | 49 | TLE | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K;
cin >> N >> K;
vector<int> H(N);
for (int64_t i = 0; i < N; i++) {
int64_t j;
cin >> j;
H.at(i) = j;
}
sort(H.begin(), H.end());
for (int64_t i = 0; i < K; i++) {
H.pop_back();
}
int64_t h_sum = 0;
for (a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K;
cin >> N >> K;
vector<int> H(N);
for (int64_t i = 0; i < N; i++) {
int64_t j;
cin >> j;
H.at(i) = j;
}
sort(H.begin(), H.end());
for (int64_t i = 0; i < K; i++) {
H.pop_back();
if (H.size() == 0) {
bre... | insert | 20 | 20 | 20 | 23 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
int main(void) {
int n, k, i, j, h[20000], cnt;
long long sum;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
sort(h, h + n);
cnt = k;
sum = 0;
for (i = n - 1; i >= 0; i--) {
if (cnt <= 0) {
sum += h[i];... | #include <algorithm>
#include <cstdio>
using namespace std;
int main(void) {
int n, k, i, j, h[200000], cnt;
long long sum;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
sort(h, h + n);
cnt = k;
sum = 0;
for (i = n - 1; i >= 0; i--) {
if (cnt <= 0) {
sum += h[i]... | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> h(n);
for (auto &e : h)
cin >> e;
sort(h.begin(), h.end());
long long res;
if (n == k) {
res = 0;
} else {
res = accumulate(begin(h), end(h) - k, 0LL);
}
cout << res << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> h(n);
for (auto &e : h)
cin >> e;
sort(h.begin(), h.end());
long long res;
if (n <= k) {
res = 0;
} else {
res = accumulate(begin(h), end(h) - k, 0LL);
}
cout << res << endl;
re... | replace | 11 | 12 | 11 | 12 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<ll>());
ll sum = 0;
if (n <= k) {
cout << 0 << endl;
return 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<ll>());
ll sum = 0;
if (n <= k) {
cout << 0 << endl;
return 0;
... | replace | 18 | 19 | 18 | 19 | TLE | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);... | replace | 23 | 24 | 23 | 24 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define double long double
#define rep(i, a, n) for (int i = (int)(a); (i) < (int)(n); ++(i))
#define repe(i, a, n) for (int i = (int)(a); (i) <= (int)(n); ++(i))
#define repif(i, a, x) for (int i = (int)(a); (x); ++(i))
#define repr(i, a, n) for (int i = ((int)(a)-1); (i)... | #include <bits/stdc++.h>
#define int long long
#define double long double
#define rep(i, a, n) for (int i = (int)(a); (i) < (int)(n); ++(i))
#define repe(i, a, n) for (int i = (int)(a); (i) <= (int)(n); ++(i))
#define repif(i, a, x) for (int i = (int)(a); (x); ++(i))
#define repr(i, a, n) for (int i = ((int)(a)-1); (i)... | replace | 52 | 53 | 52 | 53 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int h;
int n;
int sum = 0;
int a[100000];
int k;
int ans;
cin >> n;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
if (k >= n) {
ans = 0;
} else {
for (int i = 0; i < n - k; i++) {
ans += a[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int h, n, sum = 0, a[200000], k, ans = 0;
cin >> n;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
if (k >= n) {
ans = 0;
} else {
for (int i = 0; i < n - k; i++) {
ans += a[i];
}
}
c... | replace | 4 | 10 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v;
ll sum = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
sum += x;
}
sort(v.rbegin(), v.rend());
for (int i = 0; i < k; i++) {
sum -= v[i];
}
co... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v;
ll sum = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
sum += x;
}
sort(v.rbegin(), v.rend());
for (int i = 0; i < v.size(); i++) {
if (i >= k)
... | replace | 15 | 16 | 15 | 18 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define F first
#define S second
#define pb push_back
mt19937 rnd;
const int N = 1e5 + 10;
ll a[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define F first
#define S second
#define pb push_back
mt19937 rnd;
const int N = 2e5 + 10;
ll a[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n); (i) > 0; (i)--)
#define rrep(i, n, m) for (int(i) = (n); (i) < (m); (i)++)
#define rrepr(i, n, m) for (int(i) = (n); (i) > (m); (i)--)
#define SORT(s) sort((s).begin(), (s).end())
#d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n); (i) > 0; (i)--)
#define rrep(i, n, m) for (int(i) = (n); (i) < (m); (i)++)
#define rrepr(i, n, m) for (int(i) = (n); (i) > (m); (i)--)
#define SORT(s) sort((s).begin(), (s).end())
#d... | replace | 39 | 40 | 39 | 40 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k, h[100010];
long long ans = 0;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
for (int i = 0; i < n - k; i++) {
ans += h[i];
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k, h[200010];
long long ans = 0;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
for (int i = 0; i < n - k; i++) {
ans += h[i];
}
cout << ans;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | C++ | Runtime Error | // ===================================
// author: M_sea
// website: http://m-sea-blog.com/
// ===================================
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#define re register
using namespace std;
typedef long ... | // ===================================
// author: M_sea
// website: http://m-sea-blog.com/
// ===================================
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#define re register
using namespace std;
typedef long ... | replace | 28 | 29 | 28 | 29 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
rep(i, k) h.pop_back();
long long ans = 0;
rep(i, h.size(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
if (n > k)
rep(i, k) h.pop_back();
else {
cout << 0 ... | replace | 13 | 14 | 13 | 19 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vb = vector<bool>;
using vl = vector<ll>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define all(x) x.begin(), x.end... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vb = vector<bool>;
using vl = vector<ll>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define all(x) x.begin(), x.end... | replace | 19 | 20 | 19 | 20 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 100000;
int n, m, a[N + 9];
LL ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
for (int i = n - m; i >= 1; --i)
ans += a[i];
printf("%lld\n", ans);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 200000;
int n, m, a[N + 9];
LL ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
for (int i = n - m; i >= 1; --i)
ans += a[i];
printf("%lld\n", ans);
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
long T = 0;
cin >> N >> K;
vector<long> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
if (N < K)
K = N;
for (int i = 0; i < K; i++) {
for (int j = 0; j < N - 1 - i; j++) {
if (H.at(j) > H.at(j + 1))
swap... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
long T = 0;
cin >> N >> K;
vector<long> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
if (N < K)
K = N;
sort(H.begin(), H.end());
for (int i = 0; i < N - K; i++) {
T += H.at(i);
}
cout << T << endl;
} | replace | 15 | 21 | 15 | 16 | TLE | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
void solve() {}
int ma... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
void solve() {}
int ma... | replace | 24 | 25 | 24 | 26 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
vector<long long> vec(N);
for (int i = 0; i < N; ++i)
cin >> vec[i];... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
vector<long long> vec(N);
for (int i = 0; i < N; ++i)
cin >> vec[i];... | insert | 19 | 19 | 19 | 21 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int a[200000];
int main() {
int n, k, M = -1, ti, i;
long long s = 0;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
sort(a, a + n);
for (i = 1; i <= k; i++)
s -= a[n - i];
cout << s;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int a[200000];
int main() {
int n, k, M = -1, ti, i;
long long s = 0;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
if (n <= k) {
cout << "0";
return 0;
}
sort(a, a + n);
for (i = 1; i <= k; i++)
s -... | insert | 12 | 12 | 12 | 16 | 0 | |
p02786 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t h = 0, c = 1;
cin >> h;
cout << flush;
if (h <= 1)
return 1;
while (h > 1) {
h /= 2;
++c;
}
int64_t ans = 0, d = 1;
for (int i = 0; i < c; ++i) {
ans += d;
d *= 2;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t h = 0, c = 1;
cin >> h;
while (h > 1) {
h /= 2;
++c;
}
int64_t ans = 0, d = 1;
for (int i = 0; i < c; ++i) {
ans += d;
d *= 2;
}
cout << ans << endl;
return 0;
}
| delete | 6 | 10 | 6 | 6 | 0 | |
p02786 | C++ | Time Limit Exceeded | // abc153_d
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | // abc153_d
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | insert | 56 | 56 | 56 | 62 | TLE | |
p02786 | C++ | Runtime Error | /* FAILING IS AN ART
AND
I HAVE MASTERED IT
*/
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false); ... | /* FAILING IS AN ART
AND
I HAVE MASTERED IT
*/
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false); ... | delete | 45 | 49 | 45 | 45 | 0 | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
int minimumCost(int price[], int n) {
sort(price, price + n);
int totalCost = 0;
for (int i = n - 1; i > 1; i -= 2) {
if (i == 2) {
totalCost += price[2] + price[0];
} else {
int price_first = price[i] + price[0] + 2 * price[1... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int minimumCost(int price[], int n) {
sort(price, price + n);
int totalCost = 0;
for (int i = n - 1; i > 1; i -= 2) {
if (i == 2) {
totalCost += price[2] + price[0];
} else {
int price_first = price[i] + price[0] + 2 * price[1... | replace | 23 | 24 | 23 | 28 | TLE | |
p02786 | C++ | Time Limit Exceeded | // #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include ... | // #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include ... | insert | 58 | 58 | 58 | 62 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll const mod = (ll)1e12;
#define max 1000
ll mons(ll h) {
int i = 1;
ll ans = 0;
while (i <= h) {
ans += i;
i = i * 2;
}
return ans;
}
int main() {
ll h;
cin >> h;
ll ans = mons(h);
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll const mod = (ll)1e12;
#define max 1000
ll mons(ll h) {
ll i = 1;
ll ans = 0;
while (i <= h) {
ans += i;
i = i * 2;
}
return ans;
}
int main() {
ll h;
cin >> h;
ll ans = mons(h);
cout << ans;
return 0;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | replace | 33 | 45 | 33 | 37 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define all(vv) (vv).begin(), (vv).end()
#define rep(ii, jj, ll, ss) for (int ii = jj; ii < ll; ii += ss)
#define time ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define all(vv) (vv).begin(), (vv).end()
#define rep(ii, jj, ll, ss) for (int ii = jj; ii < ll; ii += ss)
#define time ... | replace | 16 | 17 | 16 | 17 | TLE | |
p02786 | C++ | Time Limit Exceeded | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Sagor
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <set>
#include <vector>
typedef long long int ll;
typedef double ld;
using namespace std;... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Sagor
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <set>
#include <vector>
typedef long long int ll;
typedef double ld;
using namespace std;... | replace | 25 | 26 | 25 | 26 | TLE | |
p02786 | C++ | Runtime Error |
#include <bits/stdc++.h>
#define MOD 1000000007
#define debug(x) cout << "x :" << x << endl;
#define case(t, ans) cout << "Case #" << t << ": " << ans << endl;
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ll long long
// typedef l... |
#include <bits/stdc++.h>
#define MOD 1000000007
#define debug(x) cout << "x :" << x << endl;
#define case(t, ans) cout << "Case #" << t << ": " << ans << endl;
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ll long long
// typedef l... | replace | 25 | 29 | 25 | 29 | 0 | |
p02786 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
template <typename T> inline string to_bin_str(T n) {
string str;
while (n > 0) {
str.push_back('0' + (n & 1));
n >>= 1;
}
reverse(str.begin(), str.end());
return str... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
template <typename T> inline string to_bin_str(T n) {
string str;
while (n > 0) {
str.push_back('0' + (n & 1));
n >>= 1;
}
reverse(str.begin(), str.end());
return str... | replace | 30 | 31 | 30 | 31 | 0 | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int64_t attack(int64_t hp) {
if (hp == 1) {
return 1;
}
return 1 + attack(hp / 2) + attack(hp / 2);
}
int main() {
int64_t h, min;
cin >> h;
min = attack(h);
cout << min << endl;
} | #include <bits/stdc++.h>
using namespace std;
int64_t attack(int64_t hp) {
if (hp == 1) {
return 1;
}
return 1 + 2 * attack(hp / 2);
}
int main() {
int64_t h, min;
cin >> h;
min = attack(h);
cout << min << endl;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02786 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define E "\n"
using namespace std;
const long long MOD = (long long)1e9 + 7;
long long h;
int fun(long long v) {
int ret = 2 * fun(v / 2);
if (v % 2)
ret++;
return ret;
}
int main() {
ios::s... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define E "\n"
using namespace std;
const long long MOD = (long long)1e9 + 7;
long long h;
long long fun(long long v) {
if (v == 1)
return 1;
long long ret = 2 * fun(v / 2);
ret++;
return ret;... | replace | 12 | 16 | 12 | 17 | -11 | |
p02786 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
#define pi 3.14159265358979323846
#... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
#define pi 3.14159265358979323846
#... | replace | 106 | 112 | 106 | 116 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i <= int(b); ++i)
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << "... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i <= int(b); ++i)
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << "... | replace | 25 | 26 | 25 | 26 | TLE | |
p02786 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
long long func(long long H) {
if (H == 1)
return 1;
else {
return func(2 / H) + 1;
}
}
int main(void) {
long long H;
cin >> H;
cout << func(H) << endl;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
long long func(long long H) {
if (H == 1)
return 1;
else {
return 2 * func(H / 2) + 1;
}
}
int main(void) {
long long H;
cin >> H;
cout << func(H) << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define si set<int>
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pii>
#define vpp vector<pair<int, pii>>
#define mii map<i... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define si set<int>
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pii>
#define vpp vector<pair<int, pii>>
#define mii map<i... | insert | 74 | 74 | 74 | 78 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include "math.h"
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <typeinfo>
#include <vector>
#define pai 3.14159265358979323846264338327950288
using namespace std;
// Caracal vs Monster
int main() {
long long int h, cnt = 0, sum = 0;
cin >> h;
while... | #include "math.h"
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <typeinfo>
#include <vector>
#define pai 3.14159265358979323846264338327950288
using namespace std;
// Caracal vs Monster
int main() {
long long int h, cnt = 0, sum = 0;
cin >> h;
while... | insert | 20 | 20 | 20 | 24 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORN(i, b, a) for (int i = (b); _a = (a); i >= _a; i--)
#define REP(i, n) for (int i = 0, _n = n; i < n; i++)
#define ll long long
#define pii pair<int, int>
#define re return
#define vi vector<int>
#define pb push_back
#def... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORN(i, b, a) for (int i = (b); _a = (a); i >= _a; i--)
#define REP(i, n) for (int i = 0, _n = n; i < n; i++)
#define ll long long
#define pii pair<int, int>
#define re return
#define vi vector<int>
#define pb push_back
#def... | replace | 37 | 38 | 37 | 38 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF LLONG_MAX / 10
#define rep(i, n) for (int i = 0; i < n; i++)
#define krep(i, k, n, m) for (int i = k; i < n; i += m)
#define erep(i, k, n) for (int i = k; i < n; i++)
#define mod 1000000007
// 最大公約数
int gcd(int s, int b) {
if (b == 0)
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF LLONG_MAX / 10
#define rep(i, n) for (int i = 0; i < n; i++)
#define krep(i, k, n, m) for (int i = k; i < n; i += m)
#define erep(i, k, n) for (int i = k; i < n; i++)
#define mod 1000000007
// 最大公約数
int gcd(int s, int b) {
if (b == 0)
... | insert | 18 | 18 | 18 | 22 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long solve(long long x) { return 2 * solve(x / 2) + 1; }
int main() {
long long h;
cin >> h;
cout << solve(h) << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long solve(long long x) {
if (x)
return 2 * solve(x / 2) + 1;
else
return 0;
}
int main() {
long long h;
cin >> h;
cout << solve(h) << endl;
}
| replace | 2 | 3 | 2 | 8 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | replace | 176 | 189 | 176 | 259 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long dfs(long long a) {
if (a == 1)
return 2;
return (dfs(a / 2) + 1) * 2;
}
int main() {
long long h;
cin >> h;
cout << dfs(h / 2) + 1;
} | #include <bits/stdc++.h>
using namespace std;
long long dfs(long long a) {
if (a == 1)
return 2;
return (dfs(a / 2) + 1) * 2;
}
int main() {
long long h;
cin >> h;
if (h == 1)
cout << 1;
else
cout << dfs(h / 2) + 1;
} | replace | 12 | 13 | 12 | 16 | TLE | |
p02786 | C++ | Time Limit Exceeded | /*coderanant*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define f1(i, a, b) for (int i = a; i < b; i++)
#define f2(i, a, b) for (int i = a; i >= b; i--)
#define endl '\n'
#define pb push_back
#define gp " "
#define ff first
#define ss second
#define mp make_pair
const i... | /*coderanant*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define f1(i, a, b) for (int i = a; i < b; i++)
#define f2(i, a, b) for (int i = a; i >= b; i--)
#define endl '\n'
#define pb push_back
#define gp " "
#define ff first
#define ss second
#define mp make_pair
const i... | replace | 22 | 23 | 22 | 23 | TLE | |
p02786 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 2147483647
#define int long long
#define _MATH_DEFINES_DEFINED
#pragma GCC optimize("O2")
using namespace std;
int tot, cs;
inline int read(void) {
int f = 1, n = 0;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdig... | #include <bits/stdc++.h>
#define INF 2147483647
#define int long long
#define _MATH_DEFINES_DEFINED
#pragma GCC optimize("O2")
using namespace std;
int tot, cs;
inline int read(void) {
int f = 1, n = 0;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdig... | insert | 31 | 31 | 31 | 35 | 0 | |
p02786 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll func(ll n) {
if (n == 1)
return 1;
return 2 * func(n / 2) + 1;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll h;
cin >> h;
ll ans = func(h);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll func(ll n) {
if (n == 1)
return 1;
return 2 * func(n / 2) + 1;
}
int main() {
#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll h;
cin >> h;
ll ans = func(h);
... | replace | 14 | 15 | 14 | 15 | 0 | |
p02786 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rg register
#define us unsigned
#define ll long long
#define ui <int>
#define pi <int, int>
#define tmpl template <typename typ>
#define oprt operator
#define sp putchar(32)
#define el putchar(10)
#define flin(x) freopen(x, "r", stdin)
#define flout(x) freopen(x, "w", stdout)
#define fl... | #include <bits/stdc++.h>
#define rg register
#define us unsigned
#define ll long long
#define ui <int>
#define pi <int, int>
#define tmpl template <typename typ>
#define oprt operator
#define sp putchar(32)
#define el putchar(10)
#define flin(x) freopen(x, "r", stdin)
#define flout(x) freopen(x, "w", stdout)
#define fl... | replace | 85 | 86 | 85 | 86 | 0 | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int64_t times2(int64_t n) {
int64_t output = 1;
for (int64_t i = 0; i < n; ++i) {
output *= 2;
}
return output;
}
int main() {
// input
int64_t H;
cin >> H;
// calculation
int64_t count = 1;
while (1) {
H /= 2;
count++;
if (H == 1) {
... | #include <bits/stdc++.h>
using namespace std;
int64_t times2(int64_t n) {
int64_t output = 1;
for (int64_t i = 0; i < n; ++i) {
output *= 2;
}
return output;
}
int main() {
// input
int64_t H;
cin >> H;
// calculation
if (H == 1) {
cout << 1 << endl;
return 0;
}
int64_t count = 1;
... | insert | 17 | 17 | 17 | 22 | TLE | |
p02786 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()... | insert | 70 | 70 | 70 | 73 | -11 | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long h, a, b, c, i, j, k, n, m, x, y, ans = 0;
string str;
cin >> h;
c = 1;
while (1) {
ans += c;
c = c * 2;
h = h / 2;
if (h == 1) {
ans += c;
break;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long h, a, b, c, i, j, k, n, m, x, y, ans = 0;
string str;
cin >> h;
if (h == 1) {
cout << 1 << endl;
return 0;
}
c = 1;
while (1) {
ans += c;
c = c * 2;
h = h / 2;
if (h == 1) {
ans += c;
break;
}
... | insert | 9 | 9 | 9 | 13 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5;
ll arr[N + 5];
int main() {
ll total = 0;
ll n;
cin >> n;
ll cur = 1;
while (n) {
if (n == 1)
total += cur;
else {
total += cur;
n /= 2;
cur *= 2;
}
}
cout << total << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5;
ll arr[N + 5];
int main() {
ll total = 0;
ll n;
cin >> n;
ll cur = 1;
while (n) {
total += cur;
n /= 2;
cur *= 2;
}
cout << total << endl;
} | replace | 13 | 20 | 13 | 16 | TLE | |
p02786 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
mt19937 rng(std::chrono::duration_cast<std::chrono::nanoseconds>(
chrono::high_resolution_clock::now().time_since_epoch())
.count());
#define mp make_pair
#define pb push_back
#define F first
#define S second
const i... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
mt19937 rng(std::chrono::duration_cast<std::chrono::nanoseconds>(
chrono::high_resolution_clock::now().time_since_epoch())
.count());
#define mp make_pair
#define pb push_back
#define F first
#define S second
const i... | delete | 27 | 31 | 27 | 27 | 0 | |
p02786 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long H;
cin >> H;
int count = 0;
while (true) {
H = H / 2;
count++;
if (H == 1)
break;
}
// cout<<count<<endl;
long long sum = 0;
for (int i = 0; i <= count; i++) {
s... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long H;
cin >> H;
int count = 0;
if (H == 1) {
cout << 1 << endl;
return 0;
}
while (true) {
H = H / 2;
count++;
if (H == 1)
break;
}
// cout<<count<<endl;
long... | insert | 10 | 10 | 10 | 14 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long H;
cin >> H;
long cnt = 0;
long i = 0;
while (H >= 1) {
cnt += pow(2, i);
i++;
}
cout << cnt;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long H;
cin >> H;
long cnt = 0;
long i = 0;
while (H >= 1) {
cnt += pow(2, i);
i++;
H = H / 2;
}
cout << cnt;
} | insert | 11 | 11 | 11 | 12 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long dfs(long long n) {
if (n == 1)
return 1;
else
return dfs(n / 2) + dfs(n / 2) + 1;
}
int main() {
long long n;
cin >> n;
cout << dfs(n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long dfs(long long n) {
if (n == 1)
return 1;
else
return dfs(n / 2) * 2 + 1;
}
int main() {
long long n;
cin >> n;
cout << dfs(n);
return 0;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int H;
cin >> H;
if (H == 1) {
puts("1");
return 0;
}
int b = 1;
while ((1 << b) <= H)
b++;
cout << (1 << b) - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int H;
cin >> H;
if (H == 1) {
puts("1");
return 0;
}
int b = (int)log2(H) + 1;
cout << (1LL << b) - 1 << endl;
}
| replace | 12 | 17 | 12 | 14 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long solve(long n) {
if (n == 1)
return 1;
else
return 2 * solve(n / 2) + 1;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input", "r", stdin);
freopen("output", "w", stdout);
#endif
long n;
cin >> n;
long ans = solve(n);
cout << ans;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
long solve(long n) {
if (n == 1)
return 1;
else
return 2 * solve(n / 2) + 1;
}
int main() {
long n;
cin >> n;
long ans = solve(n);
cout << ans;
return 0;
} | delete | 11 | 15 | 11 | 11 | TLE | |
p02786 | C++ | Time Limit Exceeded | /*
本宝的程序外人别想看！！
name: [夏宝宝]
run time：[] ms
compilation time: [] ms
output memory: [] MiB
where: []
state: []
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int s1, s2 = 1;
cin >> s1;
long long int sum;
while (s2 > 0) {
sum += s2;
s2 *= 2;
s1 = floor(s1 / 2);
}
cout... | /*
本宝的程序外人别想看！！
name: [夏宝宝]
run time：[] ms
compilation time: [] ms
output memory: [] MiB
where: []
state: []
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int s1, s2 = 1;
cin >> s1;
long long int sum;
while (s1 > 0) {
sum += s2;
s2 *= 2;
s1 = floor(s1 / 2);
}
cout... | replace | 20 | 21 | 20 | 21 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll h;
cin >> h;
ll r = 1;
while (h) {
h >> 1;
r << 1;
}
cout << r - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll h;
cin >> h;
ll r = 1;
while (h) {
h >>= 1;
r <<= 1;
}
cout << r - 1 << endl;
} | replace | 9 | 11 | 9 | 11 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int h, c = 1, x = 0, v = 0, i, p = 0;
cin >> h;
while (1) {
h = h / 2;
c = c * 2;
p += c / 2;
if (h == 1) {
break;
}
}
p = c + p;
cout << p << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int h, c = 1, x = 0, v = 0, i, p = 0;
cin >> h;
if (h == 1) {
cout << "1" << endl;
return 0;
}
while (1) {
h = h / 2;
c = c * 2;
p += c / 2;
if (h == 1) {
break;
}
}
p = c + p;
cout << p << endl;... | insert | 5 | 5 | 5 | 9 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | replace | 181 | 182 | 181 | 182 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long h, a = 1, s = 0;
cin >> h;
while (h >= 1) {
s += a;
a *= 2;
}
cout << s;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long h, a = 1, s = 0;
cin >> h;
while (h >= 1) {
s += a;
a *= 2;
h /= 2;
}
cout << s;
}
| insert | 8 | 8 | 8 | 9 | TLE | |
p02786 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
// 16:12 from
int main() {
// the biggest power of 2 that doesnot exceed n
ll h;
ll b = 1;
while (2 * b <= h)
b *= 2;
cout << 2 * b - 1;
}
// int h;
// cin>>h;
// vector<int> dp(h+1);
// dp[0]=0;
// dp[1]=1;
// for(int i... | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
// 16:12 from
int main() {
// the biggest power of 2 that doesnot exceed n
ll h;
cin >> h;
ll b = 1;
while (2 * b <= h)
b *= 2;
cout << 2 * b - 1;
}
// int h;
// cin>>h;
// vector<int> dp(h+1);
// dp[0]=0;
// dp[1]=1;
/... | insert | 9 | 9 | 9 | 10 | TLE | |
p02787 | Python | Time Limit Exceeded | MAX_LIMIT = 1e30
H, N = list(map(int, input().split()))
A, B = [], []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a) # HP
B.append(b) # power
# dp[i] means minimum power used to reduce HP i
dp = [MAX_LIMIT] * (H + max(A))
dp[0] = 0
for i in range(1, H + max(A)):
cands = []
... | h, n = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(n)]
dp = [0] * (h + max(a for a, b in ab))
for i in range(1, h + 1):
dp[i] = min(dp[i - a] + b for a, b in ab)
print(dp[h])
| replace | 0 | 24 | 0 | 6 | TLE | |
p02787 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (lol i = 0; i < lol(n); i++)
#define REPD(i, n) for (lol i = n - 1; i >= 0; i--)
#define FOR(i, a, b) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (lol i = 0; i < lol(n); i++)
#define REPD(i, n) for (lol i = n - 1; i >= 0; i--)
#define FOR(i, a, b) ... | replace | 46 | 47 | 46 | 47 | TLE | |
p02787 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1001001001;
int main() {
int n, h;
cin >> h >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
// dp[i][j] i番目までの魔法、モンスターのHPjまでの最小魔法消費量
vector<vector<int>> dp(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1001001001;
int main() {
int n, h;
cin >> h >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
// dp[i][j] i番目までの魔法、モンスターのHPjまでの最小魔法消費量
vector<vector<int>> dp(... | replace | 14 | 15 | 14 | 15 | -6 | malloc(): corrupted top size
|
p02787 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int h, n, t = 0;
cin >> h >> n;
int dp[n + 1][h + 1];
vector<int> a(n);
vector<int> b(n);
rep(i, n) {
cin >> a[i] >> b[i];
for (int j = 0; j <= h; j++) {
... | #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int h, n, t = 0;
cin >> h >> n;
int dp[n + 1][h + 1];
vector<int> a(n);
vector<int> b(n);
rep(i, n) {
cin >> a[i] >> b[i];
for (int j = 0; j <= h; j++) {
... | replace | 21 | 23 | 21 | 23 | TLE | |
p02787 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
template <class T> bool chmin(T &v, const T &v2) {
if (v > v2) {
v = v2;
return true;
} else
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
template <class T> bool chmin(T &v, const T &v2) {
if (v > v2) {
v = v2;
return true;
} else
return ... | replace | 20 | 21 | 20 | 21 | 0 | |
p02787 | C++ | Runtime Error | /* # */
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
// #pragma warning(disable:4996)
using namespace std;
/** Type Defi... | /* # */
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
// #pragma warning(disable:4996)
using namespace std;
/** Type Defi... | replace | 58 | 59 | 58 | 59 | 0 | |
p02787 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 20;
const int INF = 0x3f3f3f3f;
int p[maxn], v[maxn];
int dp[10000 + 50];
int main() {
int n, m;
while (scanf("%d %d", &m, &n) != EOF) {
for (int i = 1; i <= n; i++) {
scanf("%d %d", &v[i], &p[i]);
}
memset(dp, INF, sizeof(dp));... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 20;
const int INF = 0x3f3f3f3f;
int p[maxn], v[maxn];
int dp[20000 + 50];
int main() {
int n, m;
while (scanf("%d %d", &m, &n) != EOF) {
for (int i = 1; i <= n; i++) {
scanf("%d %d", &v[i], &p[i]);
}
memset(dp, INF, sizeof(dp));... | replace | 5 | 6 | 5 | 6 | -11 | |
p02787 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
// #include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#... | #include <iostream>
#include <stdio.h>
// #include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#... | replace | 53 | 54 | 53 | 54 | 0 | |
p02787 | C++ | Runtime Error | #include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
using namespace std;
int D[10001];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
TEST(freopen("input.txt", "r", stdin));
TEST(freopen("output.... | #include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
using namespace std;
int D[30001];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
TEST(freopen("input.txt", "r", stdin));
TEST(freopen("output.... | replace | 12 | 13 | 12 | 13 | -11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.