# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
885213 | HossamHero7 | Super Dango Maker (JOI22_dango3) | C++17 | 2848 ms | 1088 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>
#include "dango3.h"
//#include "grader.cpp"
using namespace std;
typedef long long ll;
int query(set<int> &st){
return Query(vector<int>(st.begin(),st.end()));
}
void Solve(int n, int m) {
set<int> all;
for(int i=1;i<=n*m;i++) all.insert(i);
for(int it=0;it<m-1;it++){
vector<int> x(all.begin(),all.end());
all.erase(all.begin());
int exp = m - 1 - it;
vector<int> rem;
rem.push_back(x[0]);
for(int i=1;i<x.size();i++){
if(rem.size() == n) break;
all.erase(x[i]);
if(query(all) < exp) all.insert(x[i]);
else rem.push_back(x[i]);
}
Answer(rem);
}
Answer(vector<int>(all.begin(),all.end()));
}
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... |