| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 635960 | Cross_Ratio | Super Dango Maker (JOI22_dango3) | C++17 | 2377 ms | 480 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>&);
vector<vector<int>> A;
vector<int> V;
void Solve(int N, int M) {
    A.resize(M);
    int i, j;
    for(i=1;i<=N*M;i++) V.push_back(i);
    //random_shuffle(V.begin(),V.end());
    int pt = 0;
    vector<int> V2;
    while(V.size()) {
        int k = V.back();
        V.pop_back();
        for(int n : V2) V.push_back(n);
        int k2 = Query(V);
        for(int n : V2) V.pop_back();
        if(k2==M-1-pt) {
            A[pt].push_back(k);
            for(int n : V2) V.push_back(n);
            V2.clear();
            if(A[pt].size()==N) {
                pt++;
                for(int n : V2) V.push_back(n);
                V2.clear();
            }
        }
        else {
            V2.push_back(k);
        }
    }
    for(i=0;i<M;i++) {
        Answer(A[i]);
    }
}
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... | ||||
