#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <chrono>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin>>n>>m;
set<pii> s;
vector<int> vect(n+1), ans(n+1), ord(n+1);
for (int i=1; i<=m; ++i)s.insert(mp(0ll, -i));
for (int i=1; i<=n; ++i){
cin>>vect[i];
pii temp = *(--s.upper_bound(mp(vect[i], LLONG_MIN/2)));
s.erase(temp);
ord[vect[i]]=-temp.se;
ans[i]=-temp.se;
s.insert(mp(vect[i], temp.se));
}
for (int i=1; i<=n; ++i)cout<<ans[i]<<" ";
cout<<"\n";
for (int i=1; i<=n; ++i)cout<<ord[i]<<" ";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |