# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
770082 | raysh07 | 도넛 (JOI14_ho_t3) | C++17 | 429 ms | 4436 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
int n;
vector <int> a, p;
bool check(int x){
for (int i = 1; i <= n; i++){
int last = i - 1;
for (int j = 0; j < 3; j++){
last = lower_bound(p.begin(), p.end(), p[last] + x) - p.begin();
}
if (last < i + n) return true;
}
return false;
}
void Solve()
{
cin >> n;
a.resize(2 * n + 1, 0);
p.resize(2 * n + 4, 0);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |