# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1095172 | thangdz2k7 | Super Dango Maker (JOI22_dango3) | C++17 | 2467 ms | 840 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.
// author : thembululquaUwU
// 3.9.2024
#include <bits/stdc++.h>
#include "dango3.h"
#define pb push_back
#define fi first
#define se second
#define endl '\n'
using namespace std;
using ll = long long;
using ii = pair <int, int>;
using vi = vector <int>;
const int MaxN = 2e5;
const int mod = 1e9 + 7;
void maxl(auto &a, auto b) {a = max(a, b);}
void minl(auto &a, auto b) {a = min(a, b);}
bool w(vector <int> v, int N, int M){
vi used(N * M, 0);
for (int &t : v) used[t] = 0;
vi inv; for (int i = 0; i < N * M; ++ i) if (!used[i]) inv.pb(i + 1);
return (M - Query(inv) == 1);
}
void Solve(int N, int M){
vector <vi> ans(M);
for (int i = 0; i < N * M; ++ i){
int l = 1, r = M - 1, res = 0;
while (l <= r){
int mid = l + r >> 1;
vi T = ans[mid]; T.pb(i);
if (w(T, N, M)) res = mid, r = mid - 1;
else l = mid + 1;
}
ans[res].pb(i);
}
for (int i = 0; i < M; ++ i) Answer(ans[i]);
}
//void solve(){
//
//}
//
//int main(){
// if (fopen("pqh.inp", "r")){
// freopen("pqh.inp", "r", stdin);
// freopen("pqh.out", "w", stdout);
// }
// ios_base::sync_with_stdio(0);
// cin.tie(0); cout.tie(0);
//
// int t = 1; // cin >> t;
// while (t --) solve();
// return 0;
//}
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... |