# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167239 | chikien2009 | Exhibition (JOI19_ho_t2) | C++20 | 0 ms | 524 KiB |
#include <bits/stdc++.h>
using namespace std;
inline void setup()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n, m, l, r, c[100000], mid, res = 0;
pair<int, int> p[100000];
inline bool Check(int inp)
{
for (int i = 0, j = 0; i < n; ++i)
{
if (c[j] >= p[i].first)
{
j++;
}
if (j == inp)
{
return true;
}
}
return false;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |