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++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#defi... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#defi... | replace | 42 | 44 | 42 | 44 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define Fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fo(a, b, c) for (int i = a; i < b... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define Fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fo(a, b, c) for (int i = a; i < b... | replace | 115 | 116 | 115 | 116 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
typedef pair<int, int> P;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
ll r = 1e9;
ll l = 0;
vector<int> a(n);
rep(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
typedef pair<int, int> P;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
ll r = 1e9;
ll l = 0;
vector<int> a(n);
rep(i... | insert | 19 | 19 | 19 | 23 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i, n) for (ll i = 0; i < n; i++)
#define fo1(i, n) for (ll i = 1; i <= n; i++)
#define loop(i, a, b) for (ll i = a; i <= b; i++)
#define loopr(i, a, b) for (... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i, n) for (ll i = 0; i < n; i++)
#define fo1(i, n) for (ll i = 1; i <= n; i++)
#define loop(i, a, b) for (ll i = a; i <= b; i++)
#define loopr(i, a, b) for (... | replace | 57 | 58 | 57 | 58 | TLE | |
p02598 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define per(i, a, b) for (int i = a; i >= b; --i)
#define mem0(x) memset(x, 0, sizeof(x))
#define meminf(x) memset(x, 0x3f, sizeof(x))
#define VI vector<int>
#define VL vec... | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define per(i, a, b) for (int i = a; i >= b; --i)
#define mem0(x) memset(x, 0, sizeof(x))
#define meminf(x) memset(x, 0x3f, sizeof(x))
#define VI vector<int>
#define VL vec... | replace | 34 | 35 | 34 | 36 | TLE | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define uu first
#define vv second
#define pii pair<int, int>
#define pdp pair<double, pii>
#define pll pair<ll, ll>
#define fastio \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#define ll long long int
#define uu first
#define vv second
#define pii pair<int, int>
#define pdp pair<double, pii>
#define pll pair<ll, ll>
#define fastio \
ios_base::sync_with_stdio(0); ... | replace | 25 | 26 | 25 | 26 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include... | replace | 51 | 52 | 51 | 52 | 0 | |
p02598 | C++ | Runtime Error | /**
* @author: Mackenzie
**/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_... | /**
* @author: Mackenzie
**/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_... | replace | 43 | 44 | 43 | 44 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i <= n; i++)
#define per(i, n, x... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i <= n; i++)
#define per(i, n, x... | replace | 47 | 48 | 47 | 48 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int l... | #include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int l... | replace | 78 | 79 | 78 | 79 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout << x << endl;
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define lp(i, n) repi(i, 0, n)
#de... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout << x << endl;
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define lp(i, n) repi(i, 0, n)
#de... | replace | 33 | 34 | 33 | 34 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | replace | 126 | 127 | 126 | 127 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool is_possible(int mid, vector<int> &v, int K) {
int ret = 0;
for (auto i : v) {
ret += (i % mid == 0 ? i / mid - 1 : i / mid);
}
return (ret <= K)... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool is_possible(int mid, vector<int> &v, int K) {
int ret = 0;
for (auto i : v) {
ret += (i % mid == 0 ? i / mid - 1 : i / mid);
}
return (ret <= K)... | replace | 24 | 25 | 24 | 25 | 0 | |
p02598 | C++ | Runtime Error | //-----------------------
// author : xyqkoala
// time : 2020-08-03
//-----------------------
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typede... | //-----------------------
// author : xyqkoala
// time : 2020-08-03
//-----------------------
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typede... | replace | 54 | 55 | 54 | 55 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long K;
cin >> N >> K;
vector<long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
sort(A.begin(), A.end());
long left = 1;
long right = 1000000000;
while (left < right) {
long X = (right - left) / 2;
long count = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long K;
cin >> N >> K;
vector<long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
sort(A.begin(), A.end());
long left = 1;
long right = 1000000000;
while (left < right) {
long X = (right + left) / 2;
long count = 0;
... | replace | 14 | 15 | 14 | 15 | TLE | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define db double
using namespace std;
const int M = 2e5 + 10;
int a[M], n, k;
bool check(int x) {
int cnt = 0;
for (int i = 0; i < n; i++)
cnt += (a[i] - 1) / x;
// printf("%d %d\n",x,cnt);
return cnt <= k;
}
int main() {
scanf("%d%d", &n, &k);
for (int i =... | #include <bits/stdc++.h>
#define ll long long
#define db double
using namespace std;
const int M = 2e5 + 10;
int a[M], n, k;
bool check(int x) {
int cnt = 0;
for (int i = 0; i < n; i++)
cnt += (a[i] - 1) / x;
// printf("%d %d\n",x,cnt);
return cnt <= k;
}
int main() {
scanf("%d%d", &n, &k);
for (int i =... | replace | 18 | 19 | 18 | 19 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(X) (X).begin(), (X).end()
#define rall(X) (X).rbegin(), (X).rend()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define ff first
#define ss second
#define P 1000000007
#define in(x, a, b) (a <= x && x < b)
using namespace std;
using ll = l... | #include <bits/stdc++.h>
#define all(X) (X).begin(), (X).end()
#define rall(X) (X).rbegin(), (X).rend()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define ff first
#define ss second
#define P 1000000007
#define in(x, a, b) (a <= x && x < b)
using namespace std;
using ll = l... | replace | 44 | 45 | 44 | 45 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)((v).size())
#define fs first
#define sd second
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<pi, int> ppi;
typedef vector<int> vi;
typedef vector<vecto... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)((v).size())
#define fs first
#define sd second
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<pi, int> ppi;
typedef vector<int> vi;
typedef vector<vecto... | replace | 70 | 71 | 70 | 71 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define mt make_tuple
#define MOD 1000000007
#define fo(i, a, b) for (i = a; i < b; i++)
#define foe(i, a, b) for (i = a; i <= b; i++)
#define all(x... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define mt make_tuple
#define MOD 1000000007
#define fo(i, a, b) for (i = a; i < b; i++)
#define foe(i, a, b) for (i = a; i <= b; i++)
#define all(x... | replace | 39 | 40 | 39 | 40 | 0 | |
p02598 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int mx = 2e5 + 9;
int n;
ll k;
ll a[mx];
ll ceill(ll x, ll y) { return (x + y - 1) / y; }
bool ok(ll x) {
ll ttl = 0;
for (int i = 0; i < n; i++) {
ttl += ceill(a[i], x);
}
return (ttl - n <= k);
}
int main() {
scanf("%d %lld... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int mx = 2e5 + 9;
int n;
ll k;
ll a[mx];
ll ceill(ll x, ll y) { return (x + y - 1) / y; }
bool ok(ll x) {
ll ttl = 0;
for (int i = 0; i < n; i++) {
ttl += ceill(a[i], x);
}
return (ttl - n <= k);
}
int main() {
scanf("%d %lld... | replace | 27 | 29 | 27 | 29 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define PI acos(-1)
using namespace std;
constexpr double EPS = 1e-8;
constexpr int MAXN = 3e5 + 5;
constexpr int INF = 0x3f3f3f3f;
array<int, MAXN> a;
int n, k;
inline bool check(int mid) {
int cnt(0);
for (int i = 1; i <= n; i++) {
if (a[i] % mid == 0)
... | #include <bits/stdc++.h>
#define int long long
#define PI acos(-1)
using namespace std;
constexpr double EPS = 1e-8;
constexpr int MAXN = 3e5 + 5;
constexpr int INF = 0x3f3f3f3f;
array<int, MAXN> a;
int n, k;
inline bool check(int mid) {
int cnt(0);
for (int i = 1; i <= n; i++) {
if (a[i] % mid == 0)
... | replace | 30 | 31 | 30 | 31 | 0 | |
p02598 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aryssoncf
*/
// Taken from:
// https://github.com/bqi343/USACO/blob/master/Implementations/content/contest/templateShort.cpp
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aryssoncf
*/
// Taken from:
// https://github.com/bqi343/USACO/blob/master/Implementations/content/contest/templateShort.cpp
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>... | replace | 138 | 139 | 138 | 139 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define ff first
... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define ff first
... | replace | 38 | 39 | 38 | 39 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define trav(a, x) for (auto &a : x)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define trav(a, x) for (auto &a : x)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld... | replace | 30 | 31 | 30 | 31 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int64_t divceil(int64_t numer, int64_t denom) {
if (numer % denom == 0) {
return numer / denom;
} else {
return 1L + numer / denom;
}
}
int main() {
int64_t N, K;
cin >> N;
cin >> K;
int64_t max_a = -1;
vector<int64_t> A(N);
int64_t total_length ... | #include <bits/stdc++.h>
using namespace std;
int64_t divceil(int64_t numer, int64_t denom) {
if (numer % denom == 0) {
return numer / denom;
} else {
return 1L + numer / denom;
}
}
int main() {
int64_t N, K;
cin >> N;
cin >> K;
int64_t max_a = -1;
vector<int64_t> A(N);
int64_t total_length ... | replace | 34 | 35 | 34 | 35 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast \
ios_base ::sync_with_stdio(0); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast \
ios_base ::sync_with_stdio(0); \
cin.tie(NULL); ... | replace | 171 | 172 | 171 | 172 | 0 | |
p02598 | C++ | Runtime Error | // Konrad Paluszek,University of Warsaw(former XIV LO Staszic)
// #STAY AT HOME
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#define TIME (chrono::steady_clock::now().time_since_epoch().count())
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define xfm(a, b) a... | // Konrad Paluszek,University of Warsaw(former XIV LO Staszic)
// #STAY AT HOME
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#define TIME (chrono::steady_clock::now().time_since_epoch().count())
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define xfm(a, b) a... | replace | 202 | 203 | 202 | 203 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<pair<P, P>>;
using vvp ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<pair<P, P>>;
using vvp ... | replace | 56 | 57 | 56 | 57 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (register int i = a; i <= b; i++)
#define per(i, a, b) for (register int i = a; i >= b; i--)
typedef long long LL;
const LL mod = 1e9 + 7;
const int N = 3e5 + 5;
int n;
LL k, a[N];
LL l, r;
bool Check(LL s) {
LL res = 0;
rep(i, 1, n) res += (a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (register int i = a; i <= b; i++)
#define per(i, a, b) for (register int i = a; i >= b; i--)
typedef long long LL;
const LL mod = 1e9 + 7;
const int N = 3e5 + 5;
int n;
LL k, a[N];
LL l, r;
bool Check(LL s) {
LL res = 0;
rep(i, 1, n) res += (a... | replace | 21 | 22 | 21 | 22 | 0 | |
p02598 | C++ | Runtime Error | #include <cstdio>
long long a[100005];
int isOk(int n, long long have, long long len) {
long long left = have;
for (int i = 1; i <= n; i++) {
long long L = 0, R = left;
long long res = -1;
while (L <= R) {
long long M = (L + R) / 2;
if ((M + 1) * len >= a[i]) {
res = M;
R = ... | #include <cstdio>
long long a[200005];
int isOk(int n, long long have, long long len) {
long long left = have;
for (int i = 1; i <= n; i++) {
long long L = 0, R = left;
long long res = -1;
while (L <= R) {
long long M = (L + R) / 2;
if ((M + 1) * len >= a[i]) {
res = M;
R = ... | replace | 1 | 2 | 1 | 2 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
bool check(int mid, vector<int> &a, int k) {
int n = a.size();
priority_queue<double> que;
// bool ret = false;
rep(i, n) que.push(a[i]);
rep(i, k) {
doub... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
bool check(int mid, vector<int> &a, int k) {
int n = a.size();
int cnt = 0;
rep(i, n) cnt += (a[i] - 1) / mid;
return (cnt <= k);
}
int main() {
int n, k;
... | replace | 8 | 19 | 8 | 11 | TLE | |
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 <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <u... | #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 <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <u... | replace | 146 | 147 | 146 | 147 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
constexpr int mod = 1e9 + 7;
signed main() {
int n, k, a[200000];
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
int ub = 0, lb = mod;
for (int cnt = 0; cnt < 100; cnt++) {
int mid = (lb + ub) / 2;
int ans = 0;
for (i... | #include <bits/stdc++.h>
#define int long long
using namespace std;
constexpr int mod = 1e9 + 7;
signed main() {
int n, k, a[200000];
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
int ub = 0, lb = mod;
while (lb - ub > 1) {
int mid = (lb + ub) / 2;
int ans = 0;
for (int i = 0; i < n;... | replace | 10 | 11 | 10 | 11 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
// ll mod = 998244353;
#define rep(i, n) for (int i = 0; i < (n)... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
// ll mod = 998244353;
#define rep(i, n) for (int i = 0; i < (n)... | replace | 32 | 34 | 32 | 34 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#ifndef M_PI
#define M_PI 3.141592653589
#endif
#define int long long
#define double long double
#ifdef TIME
#define start ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#ifndef M_PI
#define M_PI 3.141592653589
#endif
#define int long long
#define double long double
#ifdef TIME
#define start ... | replace | 113 | 114 | 113 | 114 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int... | replace | 24 | 26 | 24 | 26 | 0 | |
p02598 | C++ | Runtime Error | // Abhinav ---IIIT_A
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define f(i, x, n) for (int i = x; i < (int)n; ++i)
#define vpii vector<pair<int, int>>
#define vi vector<int>
#define mpii map<pair<int, int>, int>
#de... | // Abhinav ---IIIT_A
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define f(i, x, n) for (int i = x; i < (int)n; ++i)
#define vpii vector<pair<int, int>>
#define vi vector<int>
#define mpii map<pair<int, int>, int>
#de... | replace | 44 | 45 | 44 | 45 | -11 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
// *st.find_by_order(index), 0-based
//... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
// *st.find_by_order(index), 0-based
//... | replace | 29 | 30 | 29 | 30 | 0 | |
p02598 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
using ll = int64_t;
bool ok(const vector<ll> &A, ll k, ll allowed) {
ll cost = 0;
for (ll i = 0; i < A.size(); i++) {
// smallest K s.t. allowed*K >= A[i]
// cost += K-1
// 1..allowed -> 0
// allowed+1..2*allowed -> 1
cost += (A[i] - 1)... | #include <iostream>
#include <vector>
using namespace std;
using ll = int64_t;
bool ok(const vector<ll> &A, ll k, ll allowed) {
ll cost = 0;
for (ll i = 0; i < A.size(); i++) {
// smallest K s.t. allowed*K >= A[i]
// cost += K-1
// 1..allowed -> 0
// allowed+1..2*allowed -> 1
cost += (A[i] - 1)... | replace | 25 | 26 | 25 | 26 | 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>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define debug_array(a, n) \
for (ll bccc = (0); bccc < (n); b... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define debug_array(a, n) \
for (ll bccc = (0); bccc < (n); b... | replace | 83 | 84 | 83 | 84 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define NMAX 200002
using namespace std;
vector<int> v;
int N, K, M = 0, m = 0, ans = 0;
bool able(int a) {
int cou = 0;
for (auto &&i : v) {
int b = i;
if (b <= a)
break;
while (true) {
if (b > a) {
b = b - ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define NMAX 200002
using namespace std;
vector<int> v;
int N, K, M = 0, m = 0, ans = 0;
bool able(int a) {
int cou = 0;
for (auto &&i : v) {
int b = i;
if (b <= a)
break;
if (b > a) {
cou = cou + b / a - (b % a == 0... | replace | 14 | 21 | 14 | 16 | TLE | |
p02598 | C++ | Runtime Error | /*
_ __ _ _____ _____ _____
___ _ _| |__ ___ / _|_ __ ___ __ _| | __ |___ |___ |___ |
/ __| | | | '_ \ / _ \ |_| '__/ _ \/ _` | |/ / / / / / / /
| (__| |_| | |_) | __/ _| | | __/ (_| | < / / / / / /
\___|\__,_|_.__/ \___|_| |_| \___|\__,_|_|\_\ ... | /*
_ __ _ _____ _____ _____
___ _ _| |__ ___ / _|_ __ ___ __ _| | __ |___ |___ |___ |
/ __| | | | '_ \ / _ \ |_| '__/ _ \/ _` | |/ / / / / / / /
| (__| |_| | |_) | __/ _| | | __/ (_| | < / / / / / /
\___|\__,_|_.__/ \___|_| |_| \___|\__,_|_|\_\ ... | replace | 241 | 242 | 241 | 242 | 0 | |
p02598 | C++ | Runtime Error | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <deque>
#include <functional>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <complex>
#include <numeric>
#include <utility>
#include <i... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <deque>
#include <functional>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <complex>
#include <numeric>
#include <utility>
#include <i... | replace | 77 | 78 | 77 | 78 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template... | #include <algorithm>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template... | insert | 48 | 48 | 48 | 50 | 0 | |
p02598 | C++ | Runtime Error | #ifndef INCLUDEHEADER_MY_TEMPLATE
#define INCLUDEHEADER_MY_TEMPLATE
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cst... | #ifndef INCLUDEHEADER_MY_TEMPLATE
#define INCLUDEHEADER_MY_TEMPLATE
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cst... | replace | 857 | 858 | 857 | 858 | 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 | 35 | 44 | 35 | 47 | 0 | |
p02598 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
int maxsize = 0;
for (int i = 0; i < N; ++i) {
cin >> A[i];
maxsize = max(A[i], maxsize);
}
int l = 0;
int r = maxsize;
for (int n = 0; n < 100; ++n) {
int x = (l + r) / 2;
int count... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
int maxsize = 0;
for (int i = 0; i < N; ++i) {
cin >> A[i];
maxsize = max(A[i], maxsize);
}
int l = 1;
int r = maxsize;
for (int n = 0; n < 100; ++n) {
int x = (l + r) / 2;
int count... | replace | 13 | 14 | 13 | 14 | 0 | |
p02598 | C++ | Runtime Error | // #define _CRT_SECURE_NO_WARNINGS
// #include <bits/stdc++.h>
#include "bits/stdc++.h"
#define rep(i, n) for (long long(i) = 0; (i) < (long long)(n); (i)++)
#define all(x) (x).begin(), (x).end()
#define int long long
#define PI (3.14159265358979323)
#define MOD (1000000007LL)
#define INF (1LL << 60LL)
#define MAX_N ... | // #define _CRT_SECURE_NO_WARNINGS
// #include <bits/stdc++.h>
#include "bits/stdc++.h"
#define rep(i, n) for (long long(i) = 0; (i) < (long long)(n); (i)++)
#define all(x) (x).begin(), (x).end()
#define int long long
#define PI (3.14159265358979323)
#define MOD (1000000007LL)
#define INF (1LL << 60LL)
#define MAX_N ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long int Exp(long long int exp_n, long long int exp_e, long long exp_mod);
int main() {
long long int N, K, Max_A = 0, O;
priority_queue<long long int> q;
cin >> N >> K;
long long int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
Max_A = max(Max_... | #include <bits/stdc++.h>
using namespace std;
long long int Exp(long long int exp_n, long long int exp_e, long long exp_mod);
int main() {
long long int N, K, Max_A = 0, O;
priority_queue<long long int> q;
cin >> N >> K;
long long int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
Max_A = max(Max_... | replace | 15 | 16 | 15 | 16 | 0 | |
p02598 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#defin... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#defin... | replace | 31 | 32 | 31 | 32 | 0 | |
p02598 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int l = 0, r = 0;
rep(i, 0, n) {
cin >> a[i];
r = max(r, a[i]);
}
// upper bound
while (l != r) {
int mid = (r + l) >> 1... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int l = 1, r = 0;
rep(i, 0, n) {
cin >> a[i];
r = max(r, a[i]);
}
// upper bound
while (l != r) {
int mid = (r + l) >> 1... | replace | 10 | 11 | 10 | 11 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1e9 + 7;
cons... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1e9 + 7;
cons... | replace | 35 | 36 | 35 | 36 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define del(a, i) memset(a, i, sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l + r) >> 1)
#define lowbit(x) (x & (-x))
#define INF 0x3f3f3f3f
using namespace std;
... | #include <bits/stdc++.h>
#define del(a, i) memset(a, i, sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l + r) >> 1)
#define lowbit(x) (x & (-x))
#define INF 0x3f3f3f3f
using namespace std;
... | replace | 62 | 63 | 62 | 63 | 0 | 0.025796
|
p02598 | C++ | Runtime Error | //@sakshjha
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define ll long long int
#define ld long double
#define FAST \
... | //@sakshjha
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define ll long long int
#define ld long double
#define FAST \
... | insert | 43 | 43 | 43 | 47 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, k, a[200010];
signed main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
int l = 0, r = 1000000000, ans = -1;
while (l <= r) {
int mid = (l + r) / 2;
int cnt = 0ll;
for (int ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, k, a[200010];
signed main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
int l = 1, r = 1000000000, ans = -1;
while (l <= r) {
int mid = (l + r) / 2;
int cnt = 0ll;
for (int ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using llong = long long int;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int MOD = 1000000007;
const static in... | #include <bits/stdc++.h>
using namespace std;
using llong = long long int;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int MOD = 1000000007;
const static in... | replace | 25 | 26 | 25 | 26 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll... | #include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll... | replace | 66 | 67 | 66 | 67 | 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;
using vi = vector<int>;
using vll = vector<ll>;
#define MOD 1000000007
int main() {
int n, k;
cin >> n >> k;
vll a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ng = -1, ok = 1e10,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
#define MOD 1000000007
int main() {
int n, k;
cin >> n >> k;
vll a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ng = 0, ok = 1e10, ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02598 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define REP(i, start, end) for (int i = start, i##Len = (end); i < i##Len; ++i)
#define REPR(i, start, end) for (int i = start, i##Len = (end); i > i##Len; --i)
using ll = long long;
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define REP(i, start, end) for (int i = start, i##Len = (end); i < i##Len; ++i)
#define REPR(i, start, end) for (int i = start, i##Len = (end); i > i##Len; --i)
using ll = long long;
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
... | insert | 35 | 35 | 35 | 39 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bo... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bo... | insert | 82 | 82 | 82 | 87 | TLE | |
p02598 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
const ll INF = 10010010010010;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (int ii = 0; ii < N; ++ii) {
cin >> A[ii];
}
ll l = -1;
ll r = INF;
while (l ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
const ll INF = 10010010010010;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (int ii = 0; ii < N; ++ii) {
cin >> A[ii];
}
ll l = 0;
ll r = INF;
while (l +... | replace | 19 | 20 | 19 | 20 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
using ll = long long;
#define ull unsigned ll
#define endl "\n"
#define vi vector<int>
#define vl vector<ll>
#define all(v) (v).begin(), (v).end()
#define mst(a, b) memset(a, b, sizeof(a))
#define pi pair<int, int>
#define pl pair<ll, ll>
#d... | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
using ll = long long;
#define ull unsigned ll
#define endl "\n"
#define vi vector<int>
#define vl vector<ll>
#define all(v) (v).begin(), (v).end()
#define mst(a, b) memset(a, b, sizeof(a))
#define pi pair<int, int>
#define pl pair<ll, ll>
#d... | insert | 51 | 51 | 51 | 55 | 0 | |
p02598 | C++ | Runtime Error | /*╔═══╗──╔╗╔╗───────────────────╔╗────────╔═══╦═══╗
║║─║╠╗╠╗╔╣╚═╦══╦═╗╔╦╗╔═╗╔══╦══╣╚═╦╦══╦══╣║─║║║─╚╝
║╔═╗║╚╝║╚╣║║║╚╝║║─╔╦╗║║║║╚╝║╚╝║╚╝║║║═╬══║╔═╗║╚╩═║
╚╝─╚╩══╩═╩╝╚╩══╩╝─╚╩╝╚╝╚╩══╩══╩══╩╩══╩══╩╝─╚╩═══╝*/
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
usi... | /*╔═══╗──╔╗╔╗───────────────────╔╗────────╔═══╦═══╗
║║─║╠╗╠╗╔╣╚═╦══╦═╗╔╦╗╔═╗╔══╦══╣╚═╦╦══╦══╣║─║║║─╚╝
║╔═╗║╚╝║╚╣║║║╚╝║║─╔╦╗║║║║╚╝║╚╝║╚╝║║║═╬══║╔═╗║╚╩═║
╚╝─╚╩══╩═╩╝╚╩══╩╝─╚╩╝╚╝╚╩══╩══╩══╩╩══╩══╩╝─╚╩═══╝*/
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
usi... | replace | 221 | 222 | 221 | 222 | 0 | |
p02598 | C++ | Runtime Error | /*COMPETITIVE PROGRAMMING C++ TEMPLATE */
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define all(x) x.begin(), x.en... | /*COMPETITIVE PROGRAMMING C++ TEMPLATE */
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define all(x) x.begin(), x.en... | insert | 28 | 28 | 28 | 33 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <... | replace | 44 | 45 | 44 | 45 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ... | replace | 75 | 76 | 75 | 76 | 0 | |
p02598 | C++ | Runtime Error | #pragma region RegionDefs
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, l, r) for (int i = (l), i##_len = (r); i < i##_len; ++i)
#define repr(i, l, r) for (int i = (r)-1, i##_left = (l); i >= i##_left; --i)
#define all(x) begin(x), end(x)
using namespace std... | #pragma region RegionDefs
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, l, r) for (int i = (l), i##_len = (r); i < i##_len; ++i)
#define repr(i, l, r) for (int i = (r)-1, i##_left = (l); i >= i##_left; --i)
#define all(x) begin(x), end(x)
using namespace std... | replace | 74 | 75 | 74 | 75 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ii pair<int, int>
#define OK (cerr << "OK" << endl)
#define debug(x) cerr << #x " = " << (x) << endl
#define ff first
#define ss second
#define int long long
#define tt tuple<int, int, int>
#define all(x) x.begin(), x.end()
#define vvi vect... | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ii pair<int, int>
#define OK (cerr << "OK" << endl)
#define debug(x) cerr << #x " = " << (x) << endl
#define ff first
#define ss second
#define int long long
#define tt tuple<int, int, int>
#define all(x) x.begin(), x.end()
#define vvi vect... | replace | 42 | 44 | 42 | 44 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
// #define inf 998244353
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#de... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
// #define inf 998244353
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#de... | replace | 195 | 197 | 195 | 197 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define pmod 1000000007
#define INF 1000000000000000000
#define pi atan(1) * 4
#define modi 1000000
v... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define pmod 1000000007
#define INF 1000000000000000000
#define pi atan(1) * 4
#define modi 1000000
v... | replace | 32 | 33 | 32 | 33 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll ub = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll ub = ... | insert | 18 | 18 | 18 | 20 | 0 | |
p02598 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define pb push_back
#define size(v) (int)v.size()
#define fast \
ios_base::sync_with_stdio(false); ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define pb push_back
#define size(v) (int)v.size()
#define fast \
ios_base::sync_with_stdio(false); ... | replace | 52 | 53 | 52 | 53 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int left = -1;
int right = INF;
while (right - left ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int left = 0;
int right = INF;
while (right - left >... | replace | 16 | 17 | 16 | 17 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
// #define N 9982... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
// #define N 9982... | insert | 41 | 41 | 41 | 44 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k, i, mini, maxi = 1e9;
vector<int> A;
bool check(int tar) {
int j, cur = 0;
for (j = 0; j < n; j++) {
cur += (A[j] - 1) / tar;
}
if (cur > k)
return false;
else
return true;
}
int main() {
cin >> n >> k;
for (i = 0; i < n; i++) {
int ... | #include <bits/stdc++.h>
using namespace std;
int n, k, i, mini = 1, maxi = 1e9;
vector<int> A;
bool check(int tar) {
int j, cur = 0;
for (j = 0; j < n; j++) {
cur += (A[j] - 1) / tar;
}
if (cur > k)
return false;
else
return true;
}
int main() {
cin >> n >> k;
for (i = 0; i < n; i++) {
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define mk make_pair
template <class key, class cmp = std::less<key>>
using ordered_set =
tree<key, null_type, cmp, rb_... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define mk make_pair
template <class key, class cmp = std::less<key>>
using ordered_set =
tree<key, null_type, cmp, rb_... | replace | 38 | 39 | 38 | 39 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (auto &e : A)
cin >> e;
auto OK = [&](int x) -> bool {
int cnt = 0;
for (auto &a : A) {
if (a == x)
continue;
cnt += (a / x);
}
return cnt <= K;
};
int l = -1,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (auto &e : A)
cin >> e;
auto OK = [&](int x) -> bool {
int cnt = 0;
for (auto &a : A) {
if (a == x)
continue;
cnt += (a / x);
}
return cnt <= K;
};
int l = 0, ... | replace | 18 | 19 | 18 | 19 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define f first
#define s second
#define fore(i, a, b) for (int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#define f first
#define s second
#define fore(i, a, b) for (int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ \
ios_base::sync_with_stdio(0); ... | replace | 103 | 104 | 103 | 104 | 0 | |
p02598 | Python | Runtime Error | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K, *A = map(int, read().split())
ng = -1
ok = 10**9
while ok - ng > 1:
mid = (ok + ng) // 2
res = 0
for a ... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K, *A = map(int, read().split())
ng = 0
ok = 10**9
while ok - ng > 1:
mid = (ok + ng) // 2
res = 0
for a i... | replace | 13 | 14 | 13 | 14 | 0 | |
p02598 | Python | Time Limit Exceeded | def is_good(mid, key):
return sum(count_cuts(a, mid) for a in A) <= key
def binary_search(key):
bad, good = 0, 10**16
while good - bad > 1:
mid = (bad + good) // 2
if is_good(mid, key):
good = mid
else:
bad = mid
return good
def count_cuts(a, unit):
... | def is_good(mid, key):
return sum(count_cuts(a, mid) for a in A) <= key
def binary_search(key):
bad, good = 0, 2 * 10**14 + 1
while good - bad > 1:
mid = (bad + good) // 2
if is_good(mid, key):
good = mid
else:
bad = mid
return good
def count_cuts(a, u... | replace | 5 | 6 | 5 | 6 | TLE | |
p02598 | Python | Time Limit Exceeded | from sys import stdin
import numpy as np
n, k = map(int, stdin.readline().split())
a = np.array(stdin.readline().split(), dtype=np.int64)
ng = 0
ok = 10**9 + 1
while ok - ng > 1:
mid = (ok + ng) >> 1
if sum(0 - -b // mid - 1 for b in a) <= k:
ok = mid
else:
ng = mid
print(ok)
| from sys import stdin
import numpy as np
n, k = map(int, stdin.readline().split())
a = np.array(stdin.readline().split(), dtype=np.int64)
ng = 0
ok = 10**9 + 1
while ok - ng > 1:
mid = (ok + ng) >> 1
if np.sum(0 - -a // mid - 1) <= k:
ok = mid
else:
ng = mid
print(ok)
| replace | 10 | 11 | 10 | 11 | TLE | |
p02598 | C++ | Runtime Error | #include <iostream>
using namespace std;
bool able_check(long L, long *A, long N, long K);
int main(void) {
long N, K;
cin >> N >> K;
long *A = (long *)malloc(sizeof(long) * N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long min = 0;
long max = 1000000010;
while (max - min > 5) {
long mid =... | #include <iostream>
using namespace std;
bool able_check(long L, long *A, long N, long K);
int main(void) {
long N, K;
cin >> N >> K;
long *A = (long *)malloc(sizeof(long) * N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long min = 1;
long max = 1000000010;
while (max - min > 5) {
long mid =... | replace | 12 | 13 | 12 | 13 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 200003;
int n, k;
int a[N];
inline bool check(int x) {
long long tot = 0;
for (int i = 1; i <= n; i += 1)
tot += a[i] / x + (a[i] % x != 0) - 1;
return tot <= k;
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i += 1)
cin >> a[i];
int... | #include <bits/stdc++.h>
using namespace std;
const int N = 200003;
int n, k;
int a[N];
inline bool check(int x) {
long long tot = 0;
for (int i = 1; i <= n; i += 1)
tot += a[i] / x + (a[i] % x != 0) - 1;
return tot <= k;
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i += 1)
cin >> a[i];
int... | replace | 15 | 16 | 15 | 16 | 0 | |
p02598 | C++ | Runtime Error | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#in... | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#in... | insert | 115 | 115 | 115 | 117 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define fr(i, a, b) for (ll i = a; i < b; i++)
int main() {
ios::sync_with_stdio(false);
#ifdef CODE
freopen("input.txt", "r", stdin);
freopen(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define fr(i, a, b) for (ll i = a; i < b; i++)
int main() {
ios::sync_with_stdio(false);
#ifdef CODE
freopen("input.txt", "r", stdin);
freopen(... | replace | 21 | 22 | 21 | 22 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {... | replace | 36 | 37 | 36 | 37 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl '\n'
bool check(int x, vector<int> &v, int k) {
int cuts = 0;
for (int i = 0; i < v.size(); i++) {
cuts += v[i] / x;
if (v[i] % x == 0)
cuts--;
}
if (cuts <= k)
return true;
else
return false;
}
int32_t ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl '\n'
bool check(int x, vector<int> &v, int k) {
int cuts = 0;
for (int i = 0; i < v.size(); i++) {
cuts += v[i] / x;
if (v[i] % x == 0)
cuts--;
}
if (cuts <= k)
return true;
else
return false;
}
int32_t ... | replace | 23 | 24 | 23 | 24 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define PI acos(-1)
#define pb push_back
#define mp make_pair
#define int long long int
#define pi pair<int, int>
#define pii pair<int, pi>
#define fir first
#define sec second
#define MAXN 500001
#define MAXL 20
#define INF 200001
#define mod 1000000007
bool possible(int... | #include <bits/stdc++.h>
using namespace std;
#define PI acos(-1)
#define pb push_back
#define mp make_pair
#define int long long int
#define pi pair<int, int>
#define pii pair<int, pi>
#define fir first
#define sec second
#define MAXN 500001
#define MAXL 20
#define INF 200001
#define mod 1000000007
bool possible(int... | replace | 27 | 28 | 27 | 28 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define lp(i, n) for (int i = 0; i < (n); ++i)
#define pr1(x) cout << "[" << #x << ": " << x << "] \n";
#define pr2(x, y) \
cout << "[" << #x << ": " << x << ", " << #y << "... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define lp(i, n) for (int i = 0; i < (n); ++i)
#define pr1(x) cout << "[" << #x << ": " << x << "] \n";
#define pr2(x, y) \
cout << "[" << #x << ": " << x << ", " << #y << "... | replace | 27 | 28 | 27 | 28 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool solve(vector<int> &a, int k, int l) {
ll r = 0;
for (int i : a)
r += (i - 1) / l;
return r <= k;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool solve(vector<int> &a, int k, int l) {
ll r = 0;
for (int i : a)
r += (i - 1) / l;
return r <= k;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
... | replace | 17 | 18 | 17 | 18 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MAXN = 1e9;
ll n, k;
vector<ll> a;
bool check(ll x) {
ll operations = 0;
for (int i = 0; i < n; i++) {
operations += ((a[i] - 1) / x);
}
if (operations > k) {
return false;
}
return true;
}
void search() {
ll left = 0, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MAXN = 1e9;
ll n, k;
vector<ll> a;
bool check(ll x) {
ll operations = 0;
for (int i = 0; i < n; i++) {
operations += ((a[i] - 1) / x);
}
if (operations > k) {
return false;
}
return true;
}
void search() {
ll left = 1, ... | replace | 20 | 21 | 20 | 21 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll mod = 1000000007;
bool judge(ll x, ll *A, ll N, ll K) {
ll p = 0;
for (int i = 0; i < N; ++i) {
p += (A[i] - 1) / x;
}
// cout<<"x: "<<x<<" p:"<<p<<endl;
return p <= K;
}
ll binarysearch(ll *A, ll N, ll K) {
ll ok = 1e9... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll mod = 1000000007;
bool judge(ll x, ll *A, ll N, ll K) {
ll p = 0;
for (int i = 0; i < N; ++i) {
p += (A[i] - 1) / x;
}
// cout<<"x: "<<x<<" p:"<<p<<endl;
return p <= K;
}
ll binarysearch(ll *A, ll N, ll K) {
ll ok = 1e9... | replace | 22 | 23 | 22 | 23 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define err(args...) \
{}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream &operator>>(istre... | #include <bits/stdc++.h>
#define err(args...) \
{}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream &operator>>(istre... | replace | 45 | 51 | 45 | 46 | TLE | |
p02598 | C++ | Runtime Error | #ifndef __OPTIMIZE_H__
#define __OPTIMIZE_H__
/* updated: 2020-07-22 */
#include <cmath>
#include <cstdint>
#include <stack>
#include <vector>
/* std::not_fn などに相当するものを自作するほうがいいか？ */
/* findAllBoundaries の戻り値 */
template <class Value> struct BoundariesResult {
std::vector<int64_t> args; // func の引数の列
std::vecto... | #ifndef __OPTIMIZE_H__
#define __OPTIMIZE_H__
/* updated: 2020-07-22 */
#include <cmath>
#include <cstdint>
#include <stack>
#include <vector>
/* std::not_fn などに相当するものを自作するほうがいいか？ */
/* findAllBoundaries の戻り値 */
template <class Value> struct BoundariesResult {
std::vector<int64_t> args; // func の引数の列
std::vecto... | replace | 366 | 367 | 366 | 367 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define fi first
#define se second
#define vll vector<int>
#define pii pair<int, int>
#define vvll vector<vector<int>>
#define pb push_back
#define sz(v) (int)(v).size()
#define inf 1e10
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#de... | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define fi first
#define se second
#define vll vector<int>
#define pii pair<int, int>
#define vvll vector<vector<int>>
#define pb push_back
#define sz(v) (int)(v).size()
#define inf 1e10
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#de... | replace | 41 | 42 | 41 | 42 | 0 | |
p02598 | C++ | Runtime Error | // 問題の URL を書いておく
//
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
// #define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) ... | // 問題の URL を書いておく
//
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
// #define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) ... | insert | 46 | 46 | 46 | 49 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int N_MAX = 200000;
typedef long long ll;
int main() {
ll n, i, l, r, c, k, t, s = 0;
ll a[N_MAX];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
sort(a, a + n, greater<ll>());
l = s / (n + k);
r = a[0];
while (l... | #include <algorithm>
#include <iostream>
using namespace std;
int N_MAX = 200000;
typedef long long ll;
int main() {
ll n, i, l, r, c, k, t, s = 0;
ll a[N_MAX];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
sort(a, a + n, greater<ll>());
l = max(s / (n + k), (ll)1);
r = a[0]... | replace | 14 | 15 | 14 | 15 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize(2)
#define ll long long
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, n, a) for (int i = n; i >= a; i--)
#define endl '\n'
#define eps 0.000000001
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#define IO ... | #include <bits/stdc++.h>
#pragma GCC optimize(2)
#define ll long long
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, n, a) for (int i = n; i >= a; i--)
#define endl '\n'
#define eps 0.000000001
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#define IO ... | replace | 26 | 27 | 26 | 27 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define X first;
#define Y second;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const ll INF = 2e18;
const int inf = 1e9 + 10;
const int maxN = 2e5 + 10;
const int maxK = 1e4 + 10;
const int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define X first;
#define Y second;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const ll INF = 2e18;
const int inf = 1e9 + 10;
const int maxN = 2e5 + 10;
const int maxK = 1e4 + 10;
const int ... | replace | 38 | 39 | 38 | 39 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
using ii = pair<ll, ll>;
#define all(o) (o).begin(), (o).end()
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define ld long double
#define eps 0.00000000001
class prioritize {
public:
bool operator()(ii &p1, ii &p2... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
using ii = pair<ll, ll>;
#define all(o) (o).begin(), (o).end()
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define ld long double
#define eps 0.00000000001
class prioritize {
public:
bool operator()(ii &p1, ii &p2... | replace | 38 | 39 | 38 | 39 | -11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.