# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1118912 | thangdz2k7 | Minerals (JOI19_minerals) | C++17 | 0 ms | 0 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 "minerals.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 N = 2e5 + 5;
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);}
int rt[N], sz = 0;
void dnc(vector <int> p, int L, int R){
if (p.empty()) return;
if (L == R) {
rt[p[0]] = L;
return;
}
vector <int> lf, rg;
int mid = L + R >> 1;
for (int i = L; i <= mid; ++ i) Query(i), ++ sz;
for (int id : p){
if (Query(id) == sz) lf.push_back(id);
else rg.push_back(id);
++ sz;
}
for (int id : p){
Query(id); -- sz;
}
dnc(rg, mid + 1, R);
for (int i = L; i <= mid; ++ i) Query(i), sz --;
dnc(lf, L, mid);
}
void solve(){
int n; cin >> n;
vector <int> cur(n);
iota(cur.begin(), cur.end(), 1);
dnc(cur, n + 1, n + n);
for (int i = 1; i <= n; ++ i) Answer(i, rt[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;
//}