# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
940436 | jasen_penchev | Super Dango Maker (JOI22_dango3) | C++17 | 378 ms | 852 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 "dango3.h"
///#include "grader.cpp"
#include <iostream>
#include <vector>
#define endl '\n'
using namespace std;
int Query(const vector<int> &x);
void Answer(const vector<int> &a);
void rec(vector<int> &v, int cnt)
{
if (cnt == 1)
{
Answer(v);
return;
}
vector<int> v2;
for (int i = v.size() - 1; i >= 0; -- i)
{
v2.push_back(v[i]);
v.erase(v.begin() + i);
if (Query(v) < cnt / 2)
{
v.push_back(v2.back());
v2.pop_back();
}
}
# | 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... |