# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590918 | keta_tsimakuridze | Super Dango Maker (JOI22_dango3) | C++17 | 3243 ms | 880 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;
#include <vector>
namespace {
int variable_example = 1;
}
/*
4 4
2 2 3 2 4 4 3 2 3 1 1 3 4 1 4 1
*/
// namespace
const int MAX_N = 2e4;
int id[MAX_N];
vector<int> v[25];
void Solve(int N, int m) {
vector<vector<int> > x(m);
for(int i = 1; i <= N * m; i++) {
int l = 0, r = m - 1;
while(l <= r) {
int mid = (l + r) / 2;
vector<int> x;
for(int j = 1; j <= N * m; j++) {
if(j > i) x.push_back(j);
else if(j < i && id[j] > mid) x.push_back(j);
}
if(m - Query(x) > mid + 1) l = mid + 1;
else r = mid - 1, id[i] = mid;
}
v[id[i]].push_back(i);
}
for(int i = 1; i <= m; i++) Answer(v[i - 1]);
}
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... |