# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
635961 | Cross_Ratio | Super Dango Maker (JOI22_dango3) | C++17 | 844 ms | 712 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 <bits/stdc++.h>
using namespace std;
int Query(const vector<int>&);
void Answer(const vector<int>&);
void solve(int N, vector<int> V) {
if(V.size()==0) return;
if(V.size()==N) {
Answer(V);
return;
}
int M = V.size() / N;
int mid = (M / 2);
int i, j;
vector<int> V1, V2;
while(V.size()) {
int k = V.back();
V.pop_back();
for(int n : V1) V.push_back(n);
int k2 = Query(V);
for(int n : V1) V.pop_back();
if(k2 < mid) {
V1.push_back(k);
}
else V2.push_back(k);
}
solve(N, V1);
solve(N, V2);
}
void Solve(int N, int M) {
int i, j;
vector<int> V;
for(i=1;i<=N*M;i++) V.push_back(i);
//random_shuffle(V.begin(),V.end());
solve(N, V);
}
Compilation message (stderr)
# | 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... |