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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02598 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define SPBR(w, n) std::cout << (w + 1 == n ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define SPBR(w, n) std::cout << (w + 1 == n ... | replace | 74 | 87 | 74 | 75 | TLE | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5 + 10;
int n, k, a[N];
int check(int x) {
int ans = 0;
for (int i = 1; i <= n; i++)
ans += (a[i] + x - 1) / x - 1;
return ans <= k;
}
signed main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%lld... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5 + 10;
int n, k, a[N];
int check(int x) {
int ans = 0;
for (int i = 1; i <= n; i++)
ans += (a[i] + x - 1) / x - 1;
return ans <= k;
}
signed main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%lld... | replace | 15 | 16 | 15 | 16 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | replace | 91 | 93 | 91 | 93 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define uint unsigned int
#define ull unsigned long long
#define pb push_back
#define mk make_pair
#define ins insert
#define all(x) (x).begin(),... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define uint unsigned int
#define ull unsigned long long
#define pb push_back
#define mk make_pair
#define ins insert
#define all(x) (x).begin(),... | replace | 51 | 52 | 51 | 52 | 0 | |
p02598 | C++ | Runtime Error |
#include <bits/stdc++.h>
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
using namespace std;
#define M 1000000001
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define repb(i, a, b) for (int i = a; i >= b; --i)
#define repv(arr) for (auto it = arr[i].begin(); it != arr[i].end(); ++it)
#define vi vector<in... |
#include <bits/stdc++.h>
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
using namespace std;
#define M 1000000001
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define repb(i, a, b) for (int i = a; i >= b; --i)
#define repv(arr) for (auto it = arr[i].begin(); it != arr[i].end(); ++it)
#define vi vector<in... | replace | 41 | 42 | 41 | 42 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ff first
#define ss second
us... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ff first
#define ss second
us... | replace | 34 | 35 | 34 | 35 | 0 | |
p02598 | C++ | Runtime Error | // Created by ...
#include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z ... | // Created by ...
#include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z ... | replace | 76 | 77 | 76 | 77 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int mod = (1 ? 1e9 + 7 : 998244353);
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
ll a, b, c, d, e, f, n, T;
double z[200... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int mod = (1 ? 1e9 + 7 : 998244353);
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
ll a, b, c, d, e, f, n, T;
double z[200... | replace | 23 | 24 | 23 | 24 | TLE | |
p02598 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> a;
ll n, k;
bool ok(ll x) {
ll res = 0;
for (ll i = 0; i < n; i++)
if (a[i] > x) {
res += a[i] / x;
if (a[i] % x == 0)
res--;
}
return res <= k;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> a;
ll n, k;
bool ok(ll x) {
ll res = 0;
for (ll i = 0; i < n; i++)
if (a[i] > x) {
res += a[i] / x;
if (a[i] % x == 0)
res--;
}
return res <= k;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);... | replace | 27 | 28 | 27 | 28 | TLE | |
p02598 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int hmax = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > hmax)
hmax = a[i];
}
int l = 0, h = hmax;
while (l != h && h != 0)... | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int hmax = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > hmax)
hmax = a[i];
}
int l = 1, h = hmax;
while (l != h) {
int... | replace | 15 | 17 | 15 | 17 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
int main() {
int n, k;
cin >> n >> k;
int a[n], ng = -1, ok = 1e9 + 1, mid, tk;
for (int i = 0; i < n; i++)
cin >> a[i];
while (ok - ng > 1) {
mid = ng + (ok - ng) / 2;
tk = 0;
for (int i = 0; i < n; i++)
tk += max(0, a[i... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
int main() {
int n, k;
cin >> n >> k;
int a[n], ng = 0, ok = 1e9 + 1, mid, tk;
for (int i = 0; i < n; i++)
cin >> a[i];
while (ok - ng > 1) {
mid = ng + (ok - ng) / 2;
tk = 0;
for (int i = 0; i < n; i++)
tk += max(0, a[i]... | replace | 7 | 8 | 7 | 8 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define repr1(i, n) for (int i = n; i >= 1; i--)
#define all(v) v.begin(), v.end()
using ll = long long;
using pii = pair<int, i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define repr1(i, n) for (int i = n; i >= 1; i--)
#define all(v) v.begin(), v.end()
using ll = long long;
using pii = pair<int, i... | replace | 47 | 48 | 47 | 48 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#defi... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#defi... | insert | 48 | 48 | 48 | 52 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll ok = 1e9;
ll ng = 0;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int t = 40;
while (t--) {
ll mid = (ok + ng) / 2;
ll count = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll ok = 1e9;
ll ng = 1;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int t = 40;
while (t--) {
ll mid = (ok + ng) / 2;
ll count = 0;
for (int i = 0; i < N; i++) {
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02598 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
/**
******************* Author:Bisnu sarkar ****************************
**/
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
#define fRead(x) freopen(x, "r", stdin)
#define fWrite(x) freopen(x, "w", stdout)
#defin... |
#include <bits/stdc++.h>
using namespace std;
/**
******************* Author:Bisnu sarkar ****************************
**/
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
#define fRead(x) freopen(x, "r", stdin)
#define fWrite(x) freopen(x, "w", stdout)
#defin... | replace | 106 | 107 | 106 | 107 | 0 | |
p02598 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll A[100006];
int N, K;
bool f(ll x) {
int cnt = 0;
for (int i = 0; i < N; i++) {
if (A[i] <= x)
continue;
cnt += (int)ceil(1.0 * A[i] / x) - 1;
}
return cnt <= K;
}
int main() {
cin >> N >> K;
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll A[200006];
int N, K;
bool f(ll x) {
int cnt = 0;
for (int i = 0; i < N; i++) {
if (A[i] <= x)
continue;
cnt += (int)ceil(1.0 * A[i] / x) - 1;
}
return cnt <= K;
}
int main() {
cin >> N >> K;
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02598 | 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 | 142 | 143 | 142 | 143 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// #define MODE... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// #define MODE... | replace | 94 | 95 | 94 | 95 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mod(n, k) ((((n) % (k)) + (k)) % (k))
#define forn(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef l... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mod(n, k) ((((n) % (k)) + (k)) % (k))
#define forn(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef l... | replace | 21 | 24 | 21 | 24 | TLE | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define REP(i, n) for (ll i = 0LL; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, n, m) for (ll i = (ll)n; i < (ll)(m); i++)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define REP(i, n) for (ll i = 0LL; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, n, m) for (ll i = (ll)n; i < (ll)(m); i++)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000... | replace | 42 | 43 | 42 | 43 | 0 | |
p02598 | C++ | Runtime Error | /*
Created by Rahul Goel.
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/*******************************************************************************/
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T,... | /*
Created by Rahul Goel.
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/*******************************************************************************/
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T,... | replace | 69 | 70 | 69 | 75 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 200010
const int MOD = 1000000007;
int v[maxn];
int n;
int k;
bool check(int m) {
int times = 0;
for (int i = 0; i < n; i++) {
times += v[i] / m + (v[i] % m > 0) - 1;
}
return times <= k;
}
void solve() {... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 200010
const int MOD = 1000000007;
int v[maxn];
int n;
int k;
bool check(int m) {
int times = 0;
for (int i = 0; i < n; i++) {
times += v[i] / m + (v[i] % m > 0) - 1;
}
return times <= k;
}
void solve() {... | replace | 26 | 27 | 26 | 27 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std... | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std... | replace | 48 | 49 | 48 | 49 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, k;
cin >> n >> k;
int A[n];
for (int i = 0; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, k;
cin >> n >> k;
int A[n];
for (int i = 0; i < n; i+... | replace | 21 | 22 | 21 | 22 | -8 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 100000000;
#define rep1(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, k, n) for (ll i = k; i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 100000000;
#define rep1(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, k, n) for (ll i = k; i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return ... | replace | 38 | 39 | 38 | 39 | 0 | |
p02598 | C++ | Time Limit Exceeded | #pragma region cp -helper
#include <bits/stdc++.h>
using namespace std;
#define AC \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cou... | #pragma region cp -helper
#include <bits/stdc++.h>
using namespace std;
#define AC \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cou... | replace | 62 | 69 | 62 | 65 | TLE | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define sint(a) scanf("%d", &a)
#define sint2(a, b) scanf("%d %d", &a, &b)
#define sll(a) scanf("%lld", &a)
#define sll2(a, b) scanf("%lld %lld", &a, &b)
#define mem(a, i) memset(a, i, sizeof(a))
#define pb push_back
#define int long long
#define ll long long
#define lson ... | #include <bits/stdc++.h>
using namespace std;
#define sint(a) scanf("%d", &a)
#define sint2(a, b) scanf("%d %d", &a, &b)
#define sll(a) scanf("%lld", &a)
#define sll2(a, b) scanf("%lld %lld", &a, &b)
#define mem(a, i) memset(a, i, sizeof(a))
#define pb push_back
#define int long long
#define ll long long
#define lson ... | replace | 59 | 60 | 59 | 60 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define init(a, i) \
for (int k = 0; k < (i); k++) \
(a)[k] = 0
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define init(a, i) \
for (int k = 0; k < (i); k++) \
(a)[k] = 0
#... | replace | 30 | 31 | 30 | 31 | 0 | |
p02598 | C++ | Runtime Error | #ifndef TEMPLATE_HPP
#define TEMPLATE_HPP
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <... | #ifndef TEMPLATE_HPP
#define TEMPLATE_HPP
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <... | replace | 72 | 74 | 72 | 74 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k;
int a[200010];
char check(const int &n);
int main() {
scanf("%d%d", &n, &k);
int maxv = 0;
long long sum = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
sum += a[i], maxv = max(maxv, a[i]);
}
int l = sum / (n + k), r = maxv;
while (... | #include <bits/stdc++.h>
using namespace std;
int n, k;
int a[200010];
char check(const int &n);
int main() {
scanf("%d%d", &n, &k);
int maxv = 0;
long long sum = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
sum += a[i], maxv = max(maxv, a[i]);
}
int l = (sum + n + k - 1) / (n + k), r = m... | replace | 16 | 17 | 16 | 17 | 0 | |
p02598 | C++ | Runtime Error | #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 ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
... | #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 ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
... | replace | 21 | 22 | 21 | 22 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int n, k;
int a[maxn];
bool check(int mid) {
int num = 0;
for (int i = 1; i <= n; i++) {
num += a[i] / mid + (a[i] % mid != 0) - 1;
if (num > k)
return false;
}
return true;
}
int main() {
int l = 0, r, mid;
r = 0;
s... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int n, k;
int a[maxn];
bool check(int mid) {
int num = 0;
for (int i = 1; i <= n; i++) {
num += a[i] / mid + (a[i] % mid != 0) - 1;
if (num > k)
return false;
}
return true;
}
int main() {
int l = 1, r, mid;
r = 0;
s... | replace | 19 | 20 | 19 | 20 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
auto solve = [&](int x) {
int cnt = 0;
rep(i, n) {
double now = a[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
auto solve = [&](int x) {
int cnt = 0;
rep(i, n) {
// x = 3
/... | replace | 15 | 21 | 15 | 19 | TLE | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using dd = long double;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> log(N);
for (ll i = 0; i < N; i++) {
cin >>... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using dd = long double;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> log(N);
for (ll i = 0; i < N; i++) {
cin >>... | replace | 20 | 21 | 20 | 21 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v)... | replace | 49 | 50 | 49 | 50 | 0 | |
p02598 | C++ | Runtime Error |
// E - Logs
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int N, K;
ll A[200000];
// 長さt以下にできるかどうか
bool is_ok(ll t) {
ll cnt = 0;
for (int i = 0; i < N; i++) {
cnt += (A[i] - 1) / t; // 切る回... |
// E - Logs
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int N, K;
ll A[200000];
// 長さt以下にできるかどうか
bool is_ok(ll t) {
if (t == 0)
return false;
ll cnt = 0;
for (int i = 0; i < N; i++) {
... | insert | 15 | 15 | 15 | 18 | 0 | |
p02598 | C++ | Runtime Error | // g++ 7.4.0
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> ar(n);
for (int &i : ar)
cin >> i;
int l = -1;
int h = *max_element(ar.begin(), ar.end());
auto fun = [&](int x) { // want... | // g++ 7.4.0
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> ar(n);
for (int &i : ar)
cin >> i;
int l = 0;
int h = *max_element(ar.begin(), ar.end());
auto fun = [&](int x) { // want ... | replace | 15 | 16 | 15 | 16 | 0 | |
p02598 | C++ | Runtime Error |
#define INF 10000000000
#define MOD 1000000007
#if 1 // use_templates
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <st... |
#define INF 10000000000
#define MOD 1000000007
#if 1 // use_templates
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <st... | replace | 72 | 73 | 72 | 75 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define el "\n"
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define rep_a(i, a, n) for (int i = a; i < n; i++)
#define tr(ds, it) for (auto it = ds.begin(); it !=... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define el "\n"
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define rep_a(i, a, n) for (int i = a; i < n; i++)
#define tr(ds, it) for (auto it = ds.begin(); it !=... | insert | 63 | 63 | 63 | 66 | 0 | |
p02598 | C++ | Runtime Error | // #include <fsociety>
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_se... | // #include <fsociety>
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_se... | replace | 42 | 43 | 42 | 43 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define loopi(x, y) for (int i = x; i < (y); i++)
#define loopj(x, y) for (int j =... | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define loopi(x, y) for (int i = x; i < (y); i++)
#define loopj(x, y) for (int j =... | replace | 45 | 46 | 45 | 46 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e10;
const long long MOD = 1e9 + 7;
using Grap... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e10;
const long long MOD = 1e9 + 7;
using Grap... | replace | 44 | 45 | 44 | 45 | TLE | |
p02598 | C++ | Runtime Error | /* [Template].cpp
Example code to use when starting new code. This particular problem was problem
977A_Wrong_Subtraction from CodeForces
Compile: g++ -o E.exe E.cpp
Execute: ./E
*/
/* Solution sketch
E: Use (integer) binary search on the answer. Suppose the answer is X
(0≤X≤10^9). Then go through all logs Ai and cou... | /* [Template].cpp
Example code to use when starting new code. This particular problem was problem
977A_Wrong_Subtraction from CodeForces
Compile: g++ -o E.exe E.cpp
Execute: ./E
*/
/* Solution sketch
E: Use (integer) binary search on the answer. Suppose the answer is X
(0≤X≤10^9). Then go through all logs Ai and cou... | replace | 53 | 54 | 53 | 59 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define N 1000000007
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> a(n);
ll sum = 0;
ll max_a = 0;
for (int i = 0; i < n; i++) {
c... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define N 1000000007
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> a(n);
ll sum = 0;
ll max_a = 0;
for (int i = 0; i < n; i++) {
c... | replace | 29 | 30 | 29 | 30 | TLE | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pi... | replace | 83 | 93 | 83 | 96 | 0 | |
p02598 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//----------------------- Print Function ----------------------//
inline void print() { cout << endl; }
template <typename First, typename... Rest>
void print(const First &first, const Rest &...rest) {
cout << first << ' ';
print(rest...);
}... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//----------------------- Print Function ----------------------//
inline void print() { cout << endl; }
template <typename First, typename... Rest>
void print(const First &first, const Rest &...rest) {
cout << first << ' ';
print(rest...);
}... | replace | 48 | 49 | 48 | 49 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long lo... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long lo... | replace | 94 | 95 | 94 | 95 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#includ... | insert | 143 | 143 | 143 | 147 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define all(s) (s).begin(), (s).end()
ll n, k;
vl logs;
bool test(ll target) {
ll output = 0;
for (ll curr : logs) {
if... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define all(s) (s).begin(), (s).end()
ll n, k;
vl logs;
bool test(ll target) {
ll output = 0;
for (ll curr : logs) {
if... | replace | 25 | 26 | 25 | 26 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &&i : a)
cin >> i;
int L = -1, R = *max_element(a.begin(), a.end());
while (R - L > 1) {
int M = (L + R) / 2;
int cnt = 0;
for (auto &&i... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &&i : a)
cin >> i;
int L = 0, R = *max_element(a.begin(), a.end());
while (R - L > 1) {
int M = (L + R) / 2;
int cnt = 0;
for (auto &&i ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int start = 0;
int end = 1000000001;
int ans = 1000000000;
while (start != end) {
int mid = (start + end) /... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int start = 1;
int end = 1000000001;
int ans = 1000000000;
while (start != end) {
int mid = (start + end) /... | replace | 9 | 10 | 9 | 10 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 200000;
int N, K;
int A[MAX];
bool check(int len) {
int c = 0;
for (int i = 0; ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 200000;
int N, K;
int A[MAX];
bool check(int len) {
int c = 0;
for (int i = 0; ... | replace | 32 | 33 | 32 | 33 | 0 | |
p02598 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for (int ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for (int ... | replace | 34 | 35 | 34 | 35 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, p, q, x, y, i, k, a, b;
cin >> n >> k;
ll ara[n];
for (i = 0; i < n; i++)
cin >> ara[i];
if (k == 0) {
cout << *max_element(ara, ara + n) << endl;
return 0;
}
ll mx = 1e18 + 100;
ll l = 0, r = mx;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, p, q, x, y, i, k, a, b;
cin >> n >> k;
ll ara[n];
for (i = 0; i < n; i++)
cin >> ara[i];
if (k == 0) {
cout << *max_element(ara, ara + n) << endl;
return 0;
}
ll mx = 1e18 + 100;
ll l = 1, r = mx;
... | replace | 19 | 20 | 19 | 20 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int cut_times(int *logs, int n, int min_length) {
int ans = 0;
for (int i = 0; i < n; i++) {
ans += (logs[i] - 1) / min_length;
}
return ans;
}
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
// sort(a, ... | #include <bits/stdc++.h>
using namespace std;
int cut_times(int *logs, int n, int min_length) {
int ans = 0;
for (int i = 0; i < n; i++) {
ans += (logs[i] - 1) / min_length;
}
return ans;
}
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
// sort(a, ... | replace | 21 | 22 | 21 | 22 | 0 | |
p02598 | C++ | Runtime Error | // #include<bits/stdc++.h>
// using namespace std;
// #define mem(a) memset(a,0,sizeof(a))
// #define dbg(x) cout<<#x<<" = "<<x<<endl
// #define ll long long
////不要再爆long long了！！！！！！！！不要再爆long long了！！！！！！！
// multiset<double>s;
// void prt()
//{
// for(multiset<double>::iterator it=s.begin();it!=s.end();it++)
// {
// ... | // #include<bits/stdc++.h>
// using namespace std;
// #define mem(a) memset(a,0,sizeof(a))
// #define dbg(x) cout<<#x<<" = "<<x<<endl
// #define ll long long
////不要再爆long long了！！！！！！！！不要再爆long long了！！！！！！！
// multiset<double>s;
// void prt()
//{
// for(multiset<double>::iterator it=s.begin();it!=s.end();it++)
// {
// ... | replace | 65 | 66 | 65 | 69 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
bool check(int n, vector<ll> &a, ll k, ll x) {
ll cnt = 0... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
bool check(int n, vector<ll> &a, ll k, ll x) {
ll cnt = 0... | replace | 33 | 34 | 33 | 34 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define F first
#define S second
using namespace... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define F first
#define S second
using namespace... | replace | 37 | 38 | 37 | 38 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int nax = 2e5 + 10;
int n, k;
int a[nax];
int main() {
cin.tie(0)->sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int l = 0, r = 1e9;
int ans = -1;
while (l <= r) {
int mid = l + r >> 1;
long long tot... | #include <bits/stdc++.h>
using namespace std;
const int nax = 2e5 + 10;
int n, k;
int a[nax];
int main() {
cin.tie(0)->sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int l = 1, r = 1e9;
int ans = -1;
while (l <= r) {
int mid = l + r >> 1;
long long tot... | replace | 14 | 15 | 14 | 15 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<int, null_type, less<int>, rb_tree_tag,
... | #include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<int, null_type, less<int>, rb_tree_tag,
... | replace | 35 | 36 | 35 | 36 | 0 | |
p02598 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
// Some constants don't work
#ifndef INT_MAX
#define INT_MAX 2147483647
#endif
#ifndef INT_MIN
#define INT_MIN -2147483648
#endif
// short hand tricks
typedef long long ll;
using namespace std;
int main(int argc, cha... | // #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
// Some constants don't work
#ifndef INT_MAX
#define INT_MAX 2147483647
#endif
#ifndef INT_MIN
#define INT_MIN -2147483648
#endif
// short hand tricks
typedef long long ll;
using namespace std;
int main(int argc, cha... | replace | 26 | 27 | 26 | 27 | 0 | |
p02598 | C++ | Runtime Error | /*
AtCoder Beginner Contest 174 - E - Logs
https://atcoder.jp/contests/abc174/tasks/abc174_e
*/
#include <bits/stdc++.h>
using namespace std;
#define FAST_INP \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)... | /*
AtCoder Beginner Contest 174 - E - Logs
https://atcoder.jp/contests/abc174/tasks/abc174_e
*/
#include <bits/stdc++.h>
using namespace std;
#define FAST_INP \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)... | replace | 19 | 20 | 19 | 20 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, k;
vector<int> a;
bool f(int m) {
int cnt = 0;
for (int i = 0; i < n; i++) {
cnt += (a[i] - 1) / m;
}
return cnt <= k;
}
int main(void) {
cin >> n >> k;
a.assign(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, k;
vector<int> a;
bool f(int m) {
int cnt = 0;
for (int i = 0; i < n; i++) {
cnt += (a[i] - 1) / m;
}
return cnt <= k;
}
int main(void) {
cin >> n >> k;
a.assign(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];... | replace | 22 | 23 | 22 | 23 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll is(vector<ll> &a, ll m, ll k) {
ll count = 0;
for (ll i = 0; i < a.size(); i++) {
count = count + a[i] / m;
if (a[i] % m == 0)
count--;
}
if (count > k)
return 0;
else if (count == k)
return 1;
return 2;
}
int... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll is(vector<ll> &a, ll m, ll k) {
ll count = 0;
for (ll i = 0; i < a.size(); i++) {
count = count + a[i] / m;
if (a[i] % m == 0)
count--;
}
if (count > k)
return 0;
else if (count == k)
return 1;
return 2;
}
int... | replace | 45 | 46 | 45 | 46 | 0 | |
p02598 | 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 FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
int N, K;
ci... | #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 FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
int N, K;
ci... | replace | 18 | 19 | 18 | 19 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const ll MOD = 1000000007;
const long double PI = 3.14159265358979;
const ll MAX = 0;
int main() {
ll N, K;
cin >> N >> K;
ll a[N];
rep(i, N) { cin >> a[i]; }
ll l = 1, r = 1000000000;
while (r ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const ll MOD = 1000000007;
const long double PI = 3.14159265358979;
const ll MAX = 0;
int main() {
ll N, K;
cin >> N >> K;
ll a[N];
rep(i, N) { cin >> a[i]; }
ll l = 1, r = 1000000000;
while (r ... | replace | 14 | 15 | 14 | 15 | TLE | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int n, k;
int a[200200];
bool check(int now) {
int cnt = 0;
rep(i, n) { cnt += ((a[i] - 1) / now); }
return cnt <= k;
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
rep(i, n) cin >> a[i];
int lb = 0,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int n, k;
int a[200200];
bool check(int now) {
if (now == 0)
return 0;
int cnt = 0;
rep(i, n) { cnt += ((a[i] - 1) / now); }
return cnt <= k;
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
rep(i,... | insert | 8 | 8 | 8 | 10 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <... | #include <algorithm>
#include <assert.h>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <... | replace | 59 | 60 | 59 | 60 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h> // ver2.7.1
#define int long long
#define endl "\n" // fflush(stdout);
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define VVi vector<Vi>
#define VVVi vector<VVi>
#define Vm vector<mint>
#define Vs vector<string>
#define Vd vector<double>
#define Vc vector<char>
#define Pii pai... | #include <bits/stdc++.h> // ver2.7.1
#define int long long
#define endl "\n" // fflush(stdout);
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define VVi vector<Vi>
#define VVVi vector<VVi>
#define Vm vector<mint>
#define Vs vector<string>
#define Vd vector<double>
#define Vc vector<char>
#define Pii pai... | replace | 241 | 242 | 241 | 242 | 0 | |
p02598 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define all(v) (v).begin(), (v).end()
#define repeat(cnt, l) \
for (typename remove_const< \
typename... | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define all(v) (v).begin(), (v).end()
#define repeat(cnt, l) \
for (typename remove_const< \
typename... | replace | 179 | 180 | 179 | 180 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define mod 1000000007
#define string_mod 2549536629329_base_255
#define pb push_back
#define F first
#define S second
#define ff first
#defin... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define mod 1000000007
#define string_mod 2549536629329_base_255
#define pb push_back
#define F first
#define S second
#define ff first
#defin... | replace | 36 | 37 | 36 | 37 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define nl '\n'
#define dbg(a) cout << #a << "=" << a << endl
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define nl '\n'
#define dbg(a) cout << #a << "=" << a << endl
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | replace | 38 | 39 | 38 | 39 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool kmax(vector<ll> &v, ll log, ll k) {
ll sum = 0;
for (int i = 0; i < v.size(); i++)
sum += (v[i] - 1) / log;
return sum <= k;
}
ll bs(vector<ll> &v, ll low, ll high, ll k) {
if (low < high) {
ll mid = (high + low) / 2;
if (kmax... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool kmax(vector<ll> &v, ll log, ll k) {
ll sum = 0;
for (int i = 0; i < v.size(); i++)
sum += (v[i] - 1) / log;
return sum <= k;
}
ll bs(vector<ll> &v, ll low, ll high, ll k) {
if (low < high) {
ll mid = (high + low) / 2;
if (kmax... | replace | 31 | 32 | 31 | 32 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int n, k, a[MAXN];
bool can(int L) {
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += (a[i] - 1) / L;
}
if (sum > k)
return false;
else
return true;
}
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; ... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int n, k, a[MAXN];
bool can(int L) {
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += (a[i] - 1) / L;
}
if (sum > k)
return false;
else
return true;
}
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; ... | replace | 24 | 25 | 24 | 25 | 0 | |
p02598 | C++ | Runtime Error | /* winners never quit and quitters never win.
#swap */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("-O3")
using ll = long long;
using ld = long double;
... | /* winners never quit and quitters never win.
#swap */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("-O3")
using ll = long long;
using ld = long double;
... | replace | 110 | 111 | 110 | 111 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
long long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
long long left = -1, right = 1000000000;
while (right - left > 1) {
long long mid = (left + right) / 2;
long long count = 0;
fo... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
long long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
long long left = -1, right = 1000000000;
while (right - left > 1) {
long long mid = (left + right) / 2;
long long count = 0;
fo... | insert | 16 | 16 | 16 | 20 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MSET(x, y) memset(x, y, sizeof(x))
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 100005
#define ll long long
#define ld long double
#define INF 1e18
#define endl "\n"
#define fastio ... | #include <bits/stdc++.h>
#define MSET(x, y) memset(x, y, sizeof(x))
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 100005
#define ll long long
#define ld long double
#define INF 1e18
#define endl "\n"
#define fastio ... | replace | 58 | 60 | 58 | 60 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
struct edge {
int to;
ll cost;
};
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, 1, -1};
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
if (a < b)
swap(a, b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
struct edge {
int to;
ll cost;
};
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, 1, -1};
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
if (a < b)
swap(a, b... | replace | 35 | 36 | 35 | 36 | 0 | |
p02598 | C++ | Time Limit Exceeded | #pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#de... | #pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#de... | replace | 110 | 119 | 110 | 112 | TLE | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | replace | 9 | 10 | 9 | 10 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h> //Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 ... | #include <bits/stdc++.h> //Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 ... | replace | 69 | 70 | 69 | 70 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for (ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for (ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf... | replace | 20 | 21 | 20 | 21 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define sz 200009
ll n, m, i, j, k, l, t, arr[sz], brr[sz], crr[sz], ans, hi, lo, mi;
char c[sz];
int main() {
scanf("%lld %lld", &n, &k);
for (i = 1; i <= n; i++)
scanf("%lld", &arr[i]), hi = max(hi, arr[i]);
ans = hi;
while (hi >= lo)... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define sz 200009
ll n, m, i, j, k, l, t, arr[sz], brr[sz], crr[sz], ans, hi, lo, mi;
char c[sz];
int main() {
scanf("%lld %lld", &n, &k);
for (i = 1; i <= n; i++)
scanf("%lld", &arr[i]), hi = max(hi, arr[i]);
ans = hi;
lo = 1;
while ... | insert | 11 | 11 | 11 | 12 | 0 | |
p02598 | C++ | Time Limit Exceeded |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... | replace | 62 | 66 | 62 | 65 | TLE | |
p02598 | C++ | Time Limit Exceeded | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K, tmp, high, mid, low, res = 0;
priority_queue<long long int> A;
cin >> N >> K;
rep(i, N) {
cin >> tmp;
A.push(tmp);
}
high = A.top() + 1;
low = 0;
while (high... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K, tmp, high, mid, low, res = 0;
priority_queue<long long int> A;
cin >> N >> K;
rep(i, N) {
cin >> tmp;
A.push(tmp);
}
high = A.top() + 1;
low = 0;
while (high... | replace | 21 | 22 | 21 | 25 | TLE | |
p02598 | C++ | Runtime Error | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef vector<pair<l... | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef vector<pair<l... | insert | 52 | 52 | 52 | 56 | 0 | |
p02598 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
bool possible(long long longestLog, const vector<long long> &A, long long K) {
long long N = A.size();
long long numOfLongestLogs = 0;
for (long long i = 0; i < N; ++i) {
numOfLongestLogs += A[i] / longestLog;
if (A[i] % longestLog == 0) {
--numOfLonge... | #include "bits/stdc++.h"
using namespace std;
bool possible(long long longestLog, const vector<long long> &A, long long K) {
long long N = A.size();
long long numOfLongestLogs = 0;
for (long long i = 0; i < N; ++i) {
numOfLongestLogs += A[i] / longestLog;
if (A[i] % longestLog == 0) {
--numOfLonge... | replace | 37 | 38 | 37 | 38 | 0 | |
p02598 | C++ | Runtime Error | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | replace | 155 | 156 | 155 | 156 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, k, a[200500];
bool check(ll x) {
ll cnt = 0;
for (int i = 0; i < n; i++) {
cnt += a[i] / x - (a[i] % x == 0);
}
return cnt <= k;
}
void solve() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll l = -1, r =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, k, a[200500];
bool check(ll x) {
ll cnt = 0;
for (int i = 0; i < n; i++) {
cnt += a[i] / x - (a[i] % x == 0);
}
return cnt <= k;
}
void solve() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll l = 0, r = ... | replace | 18 | 19 | 18 | 19 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
#include <climits>
#include <iomanip>
#include <math.h>
#include <queue>
#include <vector>
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
int needed_kaisu(long long a, long long N, long ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
#include <climits>
#include <iomanip>
#include <math.h>
#include <queue>
#include <vector>
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
int needed_kaisu(long long a, long long N, long ... | replace | 46 | 47 | 46 | 47 | 0 | |
p02598 | 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;
vector<ll> a(200000);
int main(void) {
ll n, k;
cin >> n >> k;
rep(i, n) cin >> a[i];
ll l = 0, h = *max_element(a.begin(), a.begin() + n);
while (l < h) {
ll mid = (l + h) / 2, cnt = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
vector<ll> a(200000);
int main(void) {
ll n, k;
cin >> n >> k;
rep(i, n) cin >> a[i];
ll l = 1, h = *max_element(a.begin(), a.begin() + n);
while (l < h) {
ll mid = (l + h) / 2, cnt = 0;
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> P;
constexpr int INF = 1e9;
constexpr int MOD = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<ll... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> P;
constexpr int INF = 1e9;
constexpr int MOD = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<ll... | replace | 20 | 21 | 20 | 21 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, (n)-1, 0)
#define all(v) v.begin(), v.end()
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, (n)-1, 0)
#define all(v) v.begin(), v.end()
... | replace | 37 | 38 | 37 | 38 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n, k;
double mid, Left, Right, len[200005];
const double eps = 1e-8;
bool Judge(double lim) {
int cnt = 0;
for (int i = 1; i <= n; i++)
cnt += ceil(len[i] / lim) - 1;
return cnt <= k;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
s... | #include <bits/stdc++.h>
using namespace std;
int n, k;
double mid, Left, Right, len[200005];
const double eps = 1e-6;
bool Judge(double lim) {
int cnt = 0;
for (int i = 1; i <= n; i++)
cnt += ceil(len[i] / lim) - 1;
return cnt <= k;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
s... | replace | 4 | 5 | 4 | 5 | TLE | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k, mid, Left, Right, len[200005];
bool Judge(int lim) {
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (len[i] % lim == 0)
cnt += len[i] / lim - 1;
else
cnt += len[i] / lim;
}
return cnt > k;
}
int main() {
scanf("%d%d", &n, &k);
for (... | #include <bits/stdc++.h>
using namespace std;
int n, k, mid, Left, Right, len[200005];
bool Judge(int lim) {
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (len[i] % lim == 0)
cnt += len[i] / lim - 1;
else
cnt += len[i] / lim;
}
return cnt > k;
}
int main() {
scanf("%d%d", &n, &k), Left = ... | replace | 14 | 15 | 14 | 15 | 0 | |
p02598 | C++ | Runtime Error | /*
-------------- | /
| | /
| | /
| * |/ | | ------ *
| | | | / \
| | |\ | | | |\ |
\ ... | /*
-------------- | /
| | /
| | /
| * |/ | | ------ *
| | | | / \
| | |\ | | | |\ |
\ ... | replace | 47 | 48 | 47 | 48 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
long long int lis[200003];
int main() {
long long int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> lis[i];
long long int l = 0, r = 2100000000, mid;
for (int i = 0; i < 100; i++) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
long long int lis[200003];
int main() {
long long int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> lis[i];
long long int l = 0, r = 2100000000, mid;
for (int i = 0; i < 100; i++) {
... | insert | 15 | 15 | 15 | 19 | 0 | |
p02598 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
#define I_AM_SPEED \
ios::sync_with_stdio(0); \
cin.tie(0); \
... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
#define I_AM_SPEED \
ios::sync_with_stdio(0); \
cin.tie(0); \
... | replace | 42 | 43 | 42 | 43 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02598 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int cut(int k, int *a, int n, int u) {
int res = 0;
for (int i = 0; i < n; ++i) {
res += (a[i] + k - 1) / k - 1;
}
// cout<<k<<" "<<res<<endl;
return (res <= u) ? 1 : 0;
}
signed main() {
int n, k, a[200200] = {0};
cin ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int cut(int k, int *a, int n, int u) {
int res = 0;
if (!k)
return 0;
for (int i = 0; i < n; ++i) {
res += (a[i] + k - 1) / k - 1;
}
// cout<<k<<" "<<res<<endl;
return (res <= u) ? 1 : 0;
}
signed main() {
int n, k,... | insert | 8 | 8 | 8 | 10 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll n, k;
bool isOK(vector<ll> &a, ll mid) {
ll l = 0;
rep(i, 0, n) {
if (a[i] % mid == 0) {
l += a[i] / mid - 1;
} else {
l += a[i] / mid;
}
}
... | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll n, k;
bool isOK(vector<ll> &a, ll mid) {
ll l = 0;
rep(i, 0, n) {
if (a[i] % mid == 0) {
l += a[i] / mid - 1;
} else {
l += a[i] / mid;
}
}
... | replace | 24 | 26 | 24 | 26 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.