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 | // om namah shivaay
// faith over fear
// no one wants to die,yet death is the destination we all share
// don't think you are,know you are!!
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define a... | // om namah shivaay
// faith over fear
// no one wants to die,yet death is the destination we all share
// don't think you are,know you are!!
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define a... | replace | 54 | 55 | 54 | 55 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | replace | 64 | 65 | 64 | 65 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);... | replace | 23 | 24 | 23 | 24 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
int N, K;
int A[200010];
signed main() {
cin >> N >> K;
rep(i, N) cin >> A[i];
sort(A, A + N);
if (K == 0) {
cout << A[N - 1] << endl;
return 0;
}
int l = 0, r = 100100100100100100... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
int N, K;
int A[200010];
signed main() {
cin >> N >> K;
rep(i, N) cin >> A[i];
sort(A, A + N);
if (K == 0) {
cout << A[N - 1] << endl;
return 0;
}
int l = 1, r = 100100100100100100... | replace | 20 | 21 | 20 | 21 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#includ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#includ... | replace | 107 | 108 | 107 | 108 | 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 ll long long
#define PI acos(-1)
#define pb push_back
#define ins insert
#define INF 5000000000000000007 // 1e18+7
#define mk make_pair
#define lb(v, x... | #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 ll long long
#define PI acos(-1)
#define pb push_back
#define ins insert
#define INF 5000000000000000007 // 1e18+7
#define mk make_pair
#define lb(v, x... | replace | 97 | 98 | 97 | 98 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define... | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define... | replace | 36 | 37 | 36 | 37 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// const double pi=acos(-1.0);
#define mod 1000000007
#define forn(i, k, n) for (ll i = k; i < n; i++)
#define fornr(i, k, k1) for (ll i = k; i >= k1; i--)
#define v(ll) vector<ll>
#define vl(a, n, ll, k) vector<ll> a(n, k)
#define vli(a, n) vector... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// const double pi=acos(-1.0);
#define mod 1000000007
#define forn(i, k, n) for (ll i = k; i < n; i++)
#define fornr(i, k, k1) for (ll i = k; i >= k1; i--)
#define v(ll) vector<ll>
#define vl(a, n, ll, k) vector<ll> a(n, k)
#define vli(a, n) vector... | replace | 62 | 63 | 62 | 63 | 0 | |
p02598 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int ... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int ... | replace | 21 | 22 | 21 | 22 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const ll mod = 1000000007;
const ll INF = 1e+14;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const ll mod = 1000000007;
const ll INF = 1e+14;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#de... | replace | 21 | 22 | 21 | 22 | 0 | |
p02598 | C++ | Runtime Error | // Code by Mukul Totla
#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool check(ll mid, ll k, ll *arr, ll n) {
for (ll i = 0; i < n; i++) {
if (arr[i] > mid) {
ll val = ((arr[i] + mid - 1) / mid) - 1;
if (k - val >= 0)
k -= val;
else
return false;
}
}
... | // Code by Mukul Totla
#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool check(ll mid, ll k, ll *arr, ll n) {
for (ll i = 0; i < n; i++) {
if (arr[i] > mid) {
ll val = ((arr[i] + mid - 1) / mid) - 1;
if (k - val >= 0)
k -= val;
else
return false;
}
}
... | replace | 33 | 36 | 33 | 38 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> pa;
const int N = 2e5 + 100;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
ll a[N];
ll n, k;
bool check(int x) {
ll sum = 0;
for (int i = 1; i <= n; i++) {
sum += a[i] / x;
if (a[i] % x == 0)
sum--;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> pa;
const int N = 2e5 + 100;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
ll a[N];
ll n, k;
bool check(int x) {
ll sum = 0;
for (int i = 1; i <= n; i++) {
sum += a[i] / x;
if (a[i] % x == 0)
sum--;
}... | replace | 29 | 30 | 29 | 30 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
bool check(int n, int k, vector<int> a, int m) {
int cuts_need = 0;
for (int i : a) {
cuts_need += (i - 1) / m;
}
return cuts_need <= k;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<in... | #include <bits/stdc++.h>
using namespace std;
#define int long long
bool check(int n, int k, vector<int> a, int m) {
int cuts_need = 0;
for (int i : a) {
cuts_need += (i - 1) / m;
}
return cuts_need <= k;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<in... | replace | 23 | 24 | 23 | 24 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define fst first
#define sc second
#define snd second
#define sz(X) (int)(X).size()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fornr(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define forab(i, a... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define fst first
#define sc second
#define snd second
#define sz(X) (int)(X).size()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fornr(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define forab(i, a... | replace | 33 | 34 | 33 | 34 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
// #define int ll
#define forl(i, a, b) for (int i = a... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
// #define int ll
#define forl(i, a, b) for (int i = a... | replace | 63 | 64 | 63 | 64 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 50;
ll n, k;
ll a[maxn];
inline int log_number(int x, int mid) {
if (x % mid == 0)
return x / mid;
else
return x / mid + 1;
}
bool check(int x) {
int ans = 0;
for (int i = 1; i <= n; ++i) {
ans += log_number(a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 50;
ll n, k;
ll a[maxn];
inline int log_number(int x, int mid) {
if (x % mid == 0)
return x / mid;
else
return x / mid + 1;
}
bool check(int x) {
int ans = 0;
for (int i = 1; i <= n; ++i) {
ans += log_number(a... | replace | 3 | 4 | 3 | 4 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (i = a; i < b; i++)
#define rep2(i, a, b) for (i = a; i >= b; i--)
#define mod 1000000007
#define mod2 998244353
#define FIO \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (i = a; i < b; i++)
#define rep2(i, a, b) for (i = a; i >= b; i--)
#define mod 1000000007
#define mod2 998244353
#define FIO \
ios_base::sync_with_stdio(false); ... | replace | 175 | 176 | 175 | 176 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | replace | 36 | 38 | 36 | 38 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
const int N = 2e5 + 5;
int n, k, a[N], l, r, ans;
bool check(int cur) {
int cur_ans = 0;
for (int i = 1; i <= n; ++i) {
int cnt = 0;
cnt = (a[i] - 1) / cur + 1;
cur_ans += cnt - 1;
}
return cur_ans <= k;
}
int32_t main() {
std::cin >> n >> k;
for... | #include <bits/stdc++.h>
#define LL long long
const int N = 2e5 + 5;
int n, k, a[N], l = 1, r, ans;
bool check(int cur) {
int cur_ans = 0;
for (int i = 1; i <= n; ++i) {
int cnt = 0;
cnt = (a[i] - 1) / cur + 1;
cur_ans += cnt - 1;
}
return cur_ans <= k;
}
int32_t main() {
std::cin >> n >> k;
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <vector>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
LL floor_usr(LL a, int b) { return (a + (b - 1)) / b; }
const int maxN = 20;
// 当分割するのが最適なメソッド。
// 各丸太についてn... | #include <algorithm>
#include <bits/stdc++.h>
#include <vector>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
LL floor_usr(LL a, int b) { return (a + (b - 1)) / b; }
const int maxN = 200001;
// 当分割するのが最適なメソッド。
// 各丸太に... | replace | 10 | 11 | 10 | 11 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#pragma... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#pragma... | replace | 78 | 79 | 78 | 79 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define scan(n) scanf("%d", &n)
#define ls(n) scanf("%lld", &n)
#define print(n) printf("%d ", n)
#define pln(n) printf("%d\n", n)
#define lpln(n) printf("%lld\n", n)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rev(i, a, n) for (int i = n -... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define scan(n) scanf("%d", &n)
#define ls(n) scanf("%lld", &n)
#define print(n) printf("%d ", n)
#define pln(n) printf("%d\n", n)
#define lpln(n) printf("%lld\n", n)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rev(i, a, n) for (int i = n -... | replace | 49 | 50 | 49 | 50 | -11 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
ll k;
vector<ll> a;
bool check(ll x) {
ll cnt = 0;
for (int i = 0; i < n; ++i) {
if (a[i] > x) {
if (a[i] % x == 0)
cnt += (a[i] / x) - 1;
else
cnt += a[i] / x;
}
}
return cnt <= k;
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
ll k;
vector<ll> a;
bool check(ll x) {
ll cnt = 0;
for (int i = 0; i < n; ++i) {
if (a[i] > x) {
if (a[i] % x == 0)
cnt += (a[i] / x) - 1;
else
cnt += a[i] / x;
}
}
return cnt <= k;
}
int main() {
... | replace | 31 | 33 | 31 | 33 | 0 | |
p02598 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll di(vector<ll> &A, int len) {
ll ret{};
for (ll &a : A)
ret += (a - 1) / len + 1;
return ret;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll &a : A)
cin >> a;
int lower{-1}, upper{1000000001};
... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll di(vector<ll> &A, int len) {
ll ret{};
for (ll &a : A)
ret += (a - 1) / len + 1;
return ret;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll &a : A)
cin >> a;
int lower{0}, upper{1000000001};
... | replace | 19 | 20 | 19 | 20 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define ld long ... | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define ld long ... | replace | 56 | 57 | 56 | 57 | 0 | |
p02598 | C++ | Time Limit Exceeded | // #pragma warning(disable:4996)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include ... | // #pragma warning(disable:4996)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include ... | replace | 63 | 64 | 63 | 64 | TLE | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define IO_OP \
std::ios::sync_with_stdio(0); \
std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_bac... | #include <bits/stdc++.h>
#define IO_OP \
std::ios::sync_with_stdio(0); \
std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_bac... | replace | 37 | 38 | 37 | 38 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | replace | 36 | 37 | 36 | 37 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | replace | 37 | 38 | 37 | 38 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void A() {
int x;
cin >> x;
if (x >= 30)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void B() {
ll n, d;
cin >> n >> d;
int res = 0;
for (int i = 0; i < n; i++) {
ll x, y;
cin >> x >> y;
if (x * x + y * y <= d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void A() {
int x;
cin >> x;
if (x >= 30)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void B() {
ll n, d;
cin >> n >> d;
int res = 0;
for (int i = 0; i < n; i++) {
ll x, y;
cin >> x >> y;
if (x * x + y * y <= d... | insert | 64 | 64 | 64 | 68 | 0 | |
p02598 | C++ | Runtime Error | #include "list"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsi... | #include "list"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsi... | replace | 174 | 175 | 174 | 175 | 0 | |
p02598 | C++ | Time Limit Exceeded | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
double X[200100];
int N;
long long Count(double len) {
long long Ans = 0;
for (int i = 0; i < N; i++) {
// Ans+=(long long)(X[i]/len);//解答引っ張ってきた人の条件。なぜか通る
Ans += ceil(X[... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
double X[200100];
int N;
long long Count(double len) {
long long Ans = 0;
for (int i = 0; i < N; i++) {
Ans += (long long)(X[i] / len); // 解答引っ張ってきた人の条件。なぜか通る
// Ans+= ce... | replace | 11 | 13 | 11 | 13 | TLE | |
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 lli lo... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define lli lo... | replace | 29 | 30 | 29 | 30 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define mid ((l + r) >> 1)
#define MAXN (int)(1e5 + 2333)
int a[MAXN];
inline int f(int x, int y) {
if (x % y)
return (int)(x / y) + 1;
return x / y;
}
int main() {
int n, k;
scanf("%d%d", &n,... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define mid ((l + r) >> 1)
#define MAXN (int)(2e5 + 2333)
int a[MAXN];
inline int f(int x, int y) {
if (x % y)
return (int)(x / y) + 1;
return x / y;
}
int main() {
int n, k;
scanf("%d%d", &n,... | replace | 7 | 8 | 7 | 8 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
using ll = long long;
using P = pair<long long, long lon... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
using ll = long long;
using P = pair<long long, long lon... | insert | 13 | 13 | 13 | 15 | 0 | |
p02598 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long double X[200100];
int N;
long long Count(long double len) {
long long Ans = 0;
for (int i = 0; i < N; i++) {
// Ans+=(long long)(X[i]/len);//解答引っ張ってきた人の条件。なぜか通る
Ans += ceil(X[i] / len) - 1; // 多少遅くなるがこっちが正解
}
return Ans;
}
int main() {
long long K;
... | #include <bits/stdc++.h>
using namespace std;
long double X[200100];
int N;
long long Count(long double len) {
long long Ans = 0;
for (int i = 0; i < N; i++) {
Ans += (long long)(X[i] / len); // 解答引っ張ってきた人の条件。なぜか通る
// Ans+= ceil(X[i]/len)-1;//多少遅くなるがこっちが正解
}
return Ans;
}
int main() {
long long K;
... | replace | 7 | 9 | 7 | 9 | TLE | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
int a[200005] = {0};
int n, k;
int solve(int fun) {
int num = 0;
for (int i = 0; i < n; i++) {
num += (a[i] - 1) / fun;
}
if (num <= k)
return 1;
return 0;
}
int main() {
cin >> n >> k;
for (in... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
int a[200005] = {0};
int n, k;
int solve(int fun) {
int num = 0;
for (int i = 0; i < n; i++) {
num += (a[i] - 1) / fun;
}
if (num <= k)
return 1;
return 0;
}
int main() {
cin >> n >> k;
for (in... | replace | 20 | 21 | 20 | 21 | 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) < ((int)(n)); ++(i))
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
rep(i, N) cin >> A[i];
sort(A.begin(), A.end(), greater<ll>());
ll l = 0, r = 1000000000;
ll m = (l + r) / 2;
while (r - l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; (i) < ((int)(n)); ++(i))
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
rep(i, N) cin >> A[i];
sort(A.begin(), A.end(), greater<ll>());
ll l = 1, r = 1000000000;
ll m = (l + r) / 2;
while (r - l... | replace | 11 | 12 | 11 | 12 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | replace | 118 | 119 | 118 | 119 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define io std::ios::sync_with_stdio(false)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int qpow(int a, int n) {
... | #include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define io std::ios::sync_with_stdio(false)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int qpow(int a, int n) {
... | replace | 17 | 18 | 17 | 18 | 0 | |
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 long double ld;
// typedef tree<int,null_type,less<int
// >,rb_tree_tag,tree_order_statistics_node_update>indexed_set;
template <class T1, class T2> ostream &operator<<(... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
// typedef tree<int,null_type,less<int
// >,rb_tree_tag,tree_order_statistics_node_update>indexed_set;
template <class T1, class T2> ostream &operator<<(... | replace | 49 | 50 | 49 | 50 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int MAXN = 2e5 + 1;
ll N, K;
ll A[MAXN];
bool chk(ll l) {
ll totalCut = 0;
rep(i, N) { totalCut += (A[i] + l - 1) / l - 1; }
return totalCut <= K;
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int MAXN = 2e5 + 1;
ll N, K;
ll A[MAXN];
bool chk(ll l) {
ll totalCut = 0;
rep(i, N) { totalCut += (A[i] + l - 1) / l - 1; }
return totalCut <= K;
}
int main() {
... | replace | 21 | 22 | 21 | 22 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define Dco... | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define Dco... | replace | 49 | 50 | 49 | 50 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define rep(i, a, b) for (i = a; i < b; i++)
#define pii pair<ll, ll>
#define all(x) x.begin(), x.end()
#define nl "\n"
#define ump unordered_map
#define mtv(...) debug_out(vec_splitter(#__VA_ARGS... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define rep(i, a, b) for (i = a; i < b; i++)
#define pii pair<ll, ll>
#define all(x) x.begin(), x.end()
#define nl "\n"
#define ump unordered_map
#define mtv(...) debug_out(vec_splitter(#__VA_ARGS... | insert | 38 | 38 | 38 | 41 | -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;
#define ll long long
#define VI vector<int>
#define VLL vector<ll>
#define PII pair<int, int>
#define mp make_pair
#define pb push_back
#define PI acos(-1)
#define ld long double
const int MxN = 200001;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define RFOR(i, a, b)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VI vector<int>
#define VLL vector<ll>
#define PII pair<int, int>
#define mp make_pair
#define pb push_back
#define PI acos(-1)
#define ld long double
const int MxN = 200001;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define RFOR(i, a, b)... | replace | 40 | 41 | 40 | 41 | 0 | |
p02598 | C++ | Runtime Error | /**
* author: otera
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <se... | /**
* author: otera
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <se... | replace | 83 | 84 | 83 | 84 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef bool boool;
typedef long long ll;
#define vl vector<ll>
#define vb vector<boool>
#define vs vector<string>
#define vp vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define mod 1000000007
#define all(x) x.begin(), x.end(... | #include <bits/stdc++.h>
using namespace std;
typedef bool boool;
typedef long long ll;
#define vl vector<ll>
#define vb vector<boool>
#define vs vector<string>
#define vp vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define mod 1000000007
#define all(x) x.begin(), x.end(... | replace | 23 | 28 | 23 | 24 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> a(20000);
bool good(int x) {
int cut = 0;
for (int i = 0; i < n; i++) {
cut += a[i] / x;
if (a[i] % x == 0)
cut--;
if (cut > k)
return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);... | #include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> a(200000);
bool good(int x) {
int cut = 0;
for (int i = 0; i < n; i++) {
cut += a[i] / x;
if (a[i] % x == 0)
cut--;
if (cut > k)
return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0)... | replace | 5 | 6 | 5 | 6 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &&e : a) {
cin >> e;
}
int upper = *max_element(a.begin(), a.end()) + 1;
int lower = -1;
while (upper - lower > 1) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &&e : a) {
cin >> e;
}
int upper = *max_element(a.begin(), a.end());
int lower = 0;
while (upper - lower > 1) {
in... | replace | 15 | 17 | 15 | 17 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INFLL 1e18
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define endl "\n"
template <class T> bool chm... | #include <bits/stdc++.h>
#define INFLL 1e18
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define endl "\n"
template <class T> bool chm... | replace | 45 | 46 | 45 | 46 | 0 | |
p02598 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | insert | 253 | 253 | 253 | 257 | 0 | |
p02598 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
typedef pair<int, i... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
typedef pair<int, i... | insert | 21 | 21 | 21 | 23 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, x, n) for (int i = x; i < (int)n; i++)
#define rep(i, n) REP(i, 0, n)
#define sp(p) cout << setprecision(16) << fixed << p << endl;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define SORT(a) sort(all(a))
#define RSORT(a) sort(rall(... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, x, n) for (int i = x; i < (int)n; i++)
#define rep(i, n) REP(i, 0, n)
#define sp(p) cout << setprecision(16) << fixed << p << endl;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define SORT(a) sort(all(a))
#define RSORT(a) sort(rall(... | replace | 97 | 98 | 97 | 98 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout << t << endl; }
template <typename T, typename... Args> void print(T t, Args... args) {
cout << t << " ";
print(args...);
}
typedef complex<double> base;
#define IOS ... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout << t << endl; }
template <typename T, typename... Args> void print(T t, Args... args) {
cout << t << " ";
print(args...);
}
typedef complex<double> base;
#define IOS ... | replace | 40 | 41 | 40 | 41 | 0 | |
p02598 | C++ | Runtime Error | #include "algorithm"
#include "bitset"
#include "chrono"
#include "cstring"
#include "ctime"
#include "iomanip"
#include "iostream"
#include "map"
#include "math.h"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "vector"
#include "ext/pb_ds/assoc_contai... | #include "algorithm"
#include "bitset"
#include "chrono"
#include "cstring"
#include "ctime"
#include "iomanip"
#include "iostream"
#include "map"
#include "math.h"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "vector"
#include "ext/pb_ds/assoc_contai... | replace | 94 | 95 | 94 | 95 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define vii vector<ll>
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define vii vector<ll>
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | replace | 19 | 20 | 19 | 20 | 0 | Time elapsed : 0.022698 sec
|
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
vector<ll> a;
ll n;
ll k;
bool ch(ll x) {
ll now = 0;
for (int i = 0; i < n; ++i)... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
vector<ll> a;
ll n;
ll k;
bool ch(ll x) {
ll now = 0;
if (x == 0)
return fals... | insert | 16 | 16 | 16 | 18 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
// g++ -std=c++17 -Wshadow -Wall -g -fsanitize=address -fsanitize=undefined
// -D_GLIBCXX_DEBUG -o
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll r = *max_element(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
// g++ -std=c++17 -Wshadow -Wall -g -fsanitize=address -fsanitize=undefined
// -D_GLIBCXX_DEBUG -o
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll r = *max_element(... | replace | 16 | 17 | 16 | 17 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
const ll MOD = 1000000007ll;
const int MAX = 5100000;
usi... | #include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
const ll MOD = 1000000007ll;
const int MAX = 5100000;
usi... | replace | 101 | 102 | 101 | 102 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <cinttypes>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define FSCNd64 "%" SCNd64
#define FPRId64 "%" PRId64
using namespace std;
using l... | #include <algorithm>
#include <cinttypes>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define FSCNd64 "%" SCNd64
#define FPRId64 "%" PRId64
using namespace std;
using l... | replace | 64 | 65 | 64 | 65 | 0 | |
p02598 | C++ | Runtime Error |
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#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;
template <typename T>
using ordered_set =
tree<T, n... |
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#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;
template <typename T>
using ordered_set =
tree<T, n... | replace | 343 | 344 | 343 | 344 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> vo... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> vo... | replace | 94 | 95 | 94 | 95 | 0 | |
p02598 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef set<int>::iterator sit;
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef set<int>::iterator sit;
... | replace | 56 | 57 | 56 | 57 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(n) (n).begin(), (n).end()
#define fi first
#define se second
typedef pair<int, int> PII;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(n) (n).begin(), (n).end()
#define fi first
#define se second
typedef pair<int, int> PII;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >... | insert | 28 | 28 | 28 | 32 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
const int N = 2e5 + 5, INF = 2e9;
using namespace std;
template <typename tp> inline void r(tp &n) {
n = 0;
char c = getchar();
while (!isdigit(c))
c = getchar();
while (isdigit(c))
n = n * 10 + c - 48, c = getchar();
}
int n, k;
int a[N];
bool OK(int cur) {
int ret = 0;
for... | #include <bits/stdc++.h>
const int N = 2e5 + 5, INF = 2e9;
using namespace std;
template <typename tp> inline void r(tp &n) {
n = 0;
char c = getchar();
while (!isdigit(c))
c = getchar();
while (isdigit(c))
n = n * 10 + c - 48, c = getchar();
}
int n, k;
int a[N];
bool OK(int cur) {
int ret = 0;
for... | replace | 21 | 22 | 21 | 22 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fr(j, i, n) for (int i = j; i < n; ++i)
#define frr(j, i, n) for (int i = j; i <= n; ++i)
using namespace std;
void solve() {
ll n, k;
cin >>... | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fr(j, i, n) for (int i = j; i < n; ++i)
#define frr(j, i, n) for (int i = j; i <= n; ++i)
using namespace std;
void solve() {
ll n, k;
cin >>... | replace | 15 | 16 | 15 | 16 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<ll, ll>
#define SZ(x) ((int)(x).size())
// #define endl "\n"
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
ll mod = 1e9 + 7;
// const double pi = acos(-1.0);
/*
ll kmp(string x)
{
ll n=... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<ll, ll>
#define SZ(x) ((int)(x).size())
// #define endl "\n"
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
ll mod = 1e9 + 7;
// const double pi = acos(-1.0);
/*
ll kmp(string x)
{
ll n=... | replace | 109 | 110 | 109 | 110 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int, int>;
using mp = map<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> a(n);
int amax = 0;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int, int>;
using mp = map<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> a(n);
int amax = 0;
for (int i = 0; i ... | replace | 25 | 26 | 25 | 26 | 0 | |
p02598 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include "bits/stdc++.h"
#include <iostream>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int integer;
#define int long long
typedef pai... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include "bits/stdc++.h"
#include <iostream>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int integer;
#define int long long
typedef pai... | replace | 113 | 114 | 113 | 114 | 0 | |
p02598 | C++ | Runtime Error | // NEVER GIVE UP I AM GOING TO IMPROVE ONE DAY.
// PRACTICE,PRACTICE,PRACTICE!!!
#include <bits/stdc++.h>
#define int long long int
// #define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mem(a, b) memset(a, b, sizeof(a))
#define inf 1e18
#define endl "\n"
#define all(v) v.begin(), v.end... | // NEVER GIVE UP I AM GOING TO IMPROVE ONE DAY.
// PRACTICE,PRACTICE,PRACTICE!!!
#include <bits/stdc++.h>
#define int long long int
// #define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mem(a, b) memset(a, b, sizeof(a))
#define inf 1e18
#define endl "\n"
#define all(v) v.begin(), v.end... | insert | 22 | 22 | 22 | 25 | 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 ff first
#define ss second
#define ll int64_t
#define ld long double
#define nl cout << "\n"
#define dbg(x) cerr << #x << " = " << x << "\n"
#define dbg2(x, y... | #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 ff first
#define ss second
#define ll int64_t
#define ld long double
#define nl cout << "\n"
#define dbg(x) cerr << #x << " = " << x << "\n"
#define dbg2(x, y... | replace | 164 | 165 | 164 | 165 | 0 |
Time elapsed: 22ms
|
p02598 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1010101010;
constex... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1010101010;
constex... | replace | 50 | 51 | 50 | 51 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define SPEED \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define FOR(i, a, b) for (ll i = a; i ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define SPEED \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define FOR(i, a, b) for (ll i = a; i ... | replace | 117 | 118 | 117 | 118 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int inf = 0x3f3f3f3f;
int n, k;
int a[maxn];
bool check(int x) {
int sum = 0;
for (int i = 1; i <= n; i++) {
sum += a[i] / x;
if (a[i] % x == 0)
sum--;
}
if (sum > k)
return 0;
else
return 1;
}
int main() {
i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int inf = 0x3f3f3f3f;
int n, k;
int a[maxn];
bool check(int x) {
int sum = 0;
for (int i = 1; i <= n; i++) {
sum += a[i] / x;
if (a[i] % x == 0)
sum--;
}
if (sum > k)
return 0;
else
return 1;
}
int main() {
i... | replace | 30 | 31 | 30 | 31 | 0 | |
p02598 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <class TH> void _dbg(const char *sdbg, TH h) {
cerr << sdbg << '=' << h << endl;
}
template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while (*sdbg != ',')
cerr << *sdbg++;
cerr <... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <class TH> void _dbg(const char *sdbg, TH h) {
cerr << sdbg << '=' << h << endl;
}
template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while (*sdbg != ',')
cerr << *sdbg++;
cerr <... | replace | 34 | 35 | 34 | 35 | 0 | |
p02598 | C++ | Runtime Error | /* / \ (Hello)//JSM//*/
/* /*****\ */
/* Jai Shree Mataji / \ |\| |_| $ |-| K */
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#i... | /* / \ (Hello)//JSM//*/
/* /*****\ */
/* Jai Shree Mataji / \ |\| |_| $ |-| K */
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#i... | replace | 200 | 201 | 200 | 201 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define endl '\n'
void max_self(int &a, int b) { a = max(a, b); }
void min_self(int &a, int b) { a = min(a, b); }
int n, k;
vector<int> v;
bool good(int x) {
int cnt = k;
for (int i = 0; i < n; i++) {
cnt -= (v[i] - 1) / x;
}
return c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define endl '\n'
void max_self(int &a, int b) { a = max(a, b); }
void min_self(int &a, int b) { a = min(a, b); }
int n, k;
vector<int> v;
bool good(int x) {
int cnt = k;
for (int i = 0; i < n; i++) {
cnt -= (v[i] - 1) / x;
}
return c... | replace | 25 | 26 | 25 | 26 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef long double ld;
const double E = 1e-7;
const ll INF = 1e17;
#define forn(i, s, f) for (int i = s; i < f; ++i)
#define ft first
#define sec second
#define fora(i, n) for (auto i ... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef long double ld;
const double E = 1e-7;
const ll INF = 1e17;
#define forn(i, s, f) for (int i = s; i < f; ++i)
#define ft first
#define sec second
#define fora(i, n) for (auto i ... | replace | 51 | 52 | 51 | 52 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/hash_map>
#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define REP(i, n) for ((i) = 0; (i) < (n);... | #include <bits/stdc++.h>
#include <ext/hash_map>
#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define REP(i, n) for ((i) = 0; (i) < (n);... | replace | 80 | 81 | 80 | 81 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define db double
#define pb push_back
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define all(a) a.begin(), a.end()
using namespace std;
ll mod = 1e9 + 7;
const ll M = 500006;
ll f[M], inv[M];
ll expo(ll base, ll exponent) {
ll ans = 1;
while (exponent != 0) {
... | #include <bits/stdc++.h>
#define ll long long
#define db double
#define pb push_back
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define all(a) a.begin(), a.end()
using namespace std;
ll mod = 1e9 + 7;
const ll M = 500006;
ll f[M], inv[M];
ll expo(ll base, ll exponent) {
ll ans = 1;
while (exponent != 0) {
... | replace | 81 | 82 | 81 | 82 | 0 | |
p02598 | C++ | Runtime Error | // Template Headers {{{
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vll = vector<long long>;
using vvll = vector<vll>;
template <class ... | // Template Headers {{{
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vll = vector<long long>;
using vvll = vector<vll>;
template <class ... | replace | 47 | 48 | 47 | 48 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
// your code goes
long long int n, k;
cin >> n >> k;
long long int a[n];
for (long int i = 0; i < n; i++) {
cin >> a[i];
}
long long int l = 0, r = 1e9;
long long int ans = 1e9;
while (l <= r) {
long long int mid =... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
// your code goes
long long int n, k;
cin >> n >> k;
long long int a[n];
for (long int i = 0; i < n; i++) {
cin >> a[i];
}
long long int l = 1, r = 1e9;
long long int ans = 1e9;
while (l <= r) {
long long int mid =... | replace | 12 | 13 | 12 | 13 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<pll> vll;
typedef vector<vl> vvl;
#define fori(i, n) for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<pll> vll;
typedef vector<vl> vvl;
#define fori(i, n) for (in... | replace | 96 | 97 | 96 | 97 | 0 | Time Taken : 0.000138
|
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define repz(i, z, n) for (decltype(n) i = (z); i < (n); i++)
#define rep(i, n) for (decltype(n) i = 0; i < (n); i++)
#define REPZ(i, z, n) for (decltype(n) i = (z); i <= (n); i++)
#define REP(i, n) for (decltype(n) i = 0; i <= (n); i++)
#define ALL(v) v.begin(), v.end()
#define len(v) ((ll)(v... | #include <bits/stdc++.h>
#define repz(i, z, n) for (decltype(n) i = (z); i < (n); i++)
#define rep(i, n) for (decltype(n) i = 0; i < (n); i++)
#define REPZ(i, z, n) for (decltype(n) i = (z); i <= (n); i++)
#define REP(i, n) for (decltype(n) i = 0; i <= (n); i++)
#define ALL(v) v.begin(), v.end()
#define len(v) ((ll)(v... | replace | 102 | 103 | 102 | 103 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i... | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i... | replace | 226 | 227 | 226 | 227 | 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 floop(i, a, n) for (int i = a; i < n; i++)
#define rfloop(i, a, n) for (int i = n - 1; i >= a; i--)
#define mloop(it, x) for (it = x.begin(); it != x.end(); it+... | #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 floop(i, a, n) for (int i = a; i < n; i++)
#define rfloop(i, a, n) for (int i = n - 1; i >= a; i--)
#define mloop(it, x) for (it = x.begin(); it != x.end(); it+... | replace | 164 | 165 | 164 | 165 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | replace | 96 | 97 | 96 | 98 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define MAXN 200005
#define REP(temp, init_val, end_val) \
for (int temp = init_val; temp <= end_val; ++temp)
#define REPR(temp, init_val, end_val) \
for (int tem... | #include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define MAXN 200005
#define REP(temp, init_val, end_val) \
for (int temp = init_val; temp <= end_val; ++temp)
#define REPR(temp, init_val, end_val) \
for (int tem... | replace | 51 | 52 | 51 | 52 | 0 | |
p02598 | C++ | Runtime Error | // Bismillahir Rahmanir Rahim .Ya Allah...
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7, INF = 1e9;
const int mx = 2e5 + 5;
vector<ll> v(mx);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n, k;
cin >> n >> k;
for (int i = 0;... | // Bismillahir Rahmanir Rahim .Ya Allah...
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7, INF = 1e9;
const int mx = 2e5 + 5;
vector<ll> v(mx);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n, k;
cin >> n >> k;
for (int i = 0;... | replace | 15 | 16 | 15 | 16 | 0 | |
p02598 | C++ | Time Limit Exceeded | // abc174_e
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | // abc174_e
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | replace | 81 | 82 | 81 | 82 | TLE | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
typedef tuple<long long, long long, long long> tllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const llint INF = 1<<21;
// st... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
typedef tuple<long long, long long, long long> tllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const llint INF = 1<<21;
// st... | replace | 43 | 44 | 43 | 44 | 0 | |
p02598 | C++ | Runtime Error | // #include<i_am_noob_orz>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ull unsigned long long
#define pii pair<int, int>
#define X first
#define Y second
#define mod ((ll)1e9 + 7)
#define pb push_back
#define mp make_pair
#define abs(x) ((x) > 0 ? (x) : (-(x)))
#define F(n)... | // #include<i_am_noob_orz>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ull unsigned long long
#define pii pair<int, int>
#define X first
#define Y second
#define mod ((ll)1e9 + 7)
#define pb push_back
#define mp make_pair
#define abs(x) ((x) > 0 ? (x) : (-(x)))
#define F(n)... | replace | 41 | 42 | 41 | 42 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define M 1000000000
#define f(i, a, b) for (long long i = a; i < b; i++)
#define tc \
long long t; \
cin >> t; ... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000000
#define f(i, a, b) for (long long i = a; i < b; i++)
#define tc \
long long t; \
cin >> t; ... | 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;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll n, k, v[200001], minim = 1e10;
bool ok(ll val) {
ll x = val;
ll nrop = 0;
for (int i = 1; i <= n; i++) {
ll bc = v[i] / x;
if (v[i] % x)
bc++;
nro... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll n, k, v[200001], minim = 1e10;
bool ok(ll val) {
ll x = val;
ll nrop = 0;
for (int i = 1; i <= n; i++) {
ll bc = v[i] / x;
if (v[i] % x)
bc++;
nro... | replace | 26 | 27 | 26 | 27 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265358979
#define mod 1000000007
#define ll long long int
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repn(i, a, b) for (ll i = a; i > b; i--)
#define mod1 1000003
#define mod2 998244353
#define inf 2e18
#define hi "hello"
#define nl "\n"
#def... | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265358979
#define mod 1000000007
#define ll long long int
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repn(i, a, b) for (ll i = a; i > b; i--)
#define mod1 1000003
#define mod2 998244353
#define inf 2e18
#define hi "hello"
#define nl "\n"
#def... | replace | 93 | 94 | 93 | 94 | 0 | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define ral... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define ral... | replace | 45 | 46 | 45 | 46 | 0 | |
p02598 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> inline void chmax(T &a, T ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> inline void chmax(T &a, T ... | replace | 89 | 95 | 89 | 96 | TLE | |
p02598 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int l = 0;
// int r = -1;
int r = 1000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
// r = max(a[i],r);
}
while (l < r) {
int m = l + (r - l) / 2;
int cnt = 0;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int l = 1;
// int r = -1;
int r = 1000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
// r = max(a[i],r);
}
while (l < r) {
int m = l + (r - l) / 2;
int cnt = 0;
for (int i = ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02598 | C++ | Runtime Error | /*
Dont BLUNDER
*/
#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 d long double
#define int long long
#define pii pair<int, int>
#define pb push_back
#define endl '\n'
#define pi acos(... | /*
Dont BLUNDER
*/
#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 d long double
#define int long long
#define pii pair<int, int>
#define pb push_back
#define endl '\n'
#define pi acos(... | replace | 103 | 104 | 103 | 104 | 0 | |
p02598 | C++ | Runtime Error | /*
:: ::
': :
:. :
;' :: :: '
... | /*
:: ::
': :
:. :
;' :: :: '
... | replace | 53 | 54 | 53 | 54 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.