text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, q, j = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p >> q;
if (p < (q - 1)) j++;
}
cout << j;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, av = 0;
cin >> n;
int a[n][2];
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
if (a[i][1] - a[i][0] >= 2) av++;
}
cout << av;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int test, ans = 0;
scanf("%d", &test);
while (test--) {
int p, q;
scanf("%d %d", &p, &q);
if (q - p >= 2) ans += 1;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
unsigned long long bpow(unsigned long long a, int n, int mod) {
return n ? n & 1 ? (bpow(a, n - 1, mod) * a) % mod
: (bpow((a * a) % mod, n >> 1ll, mod)) % mod
: 1ll;
}
int get_digit(long long num, int len, int index) {
return num / bpow(10, len - index - 1, 1) % 10;
}
long long digit_sum(int num) {
long long dig_sum = 0;
while (num > 0) {
dig_sum += num % 10;
num /= 10;
}
return dig_sum;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int div_up(int n, int k) { return (n + k - 1) / k; }
const long long MOD = 1e9 + 7;
long long add(long long x, long long y) {
x += y;
if (x >= MOD) return x - MOD;
return x;
}
long long sub(long long x, long long y) {
x -= y;
if (x < 0) return x + MOD;
return x;
}
long long mult(long long x, long long y) { return (x * y) % MOD; }
long long bin_pow(long long x, long long p) {
if (p == 0) return 1;
if (p & 1) return mult(x, bin_pow(x, p - 1));
return bin_pow(mult(x, x), p / 2);
}
long long rev(long long x) { return bin_pow(x, MOD - 2); }
const long double EPS = 0.000001;
const long long INF = 1e9 + 1;
const int N = 1e6;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
cnt += (a + 2 <= b);
}
cout << cnt;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, a1, a2, k = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a1 >> a2;
if ((a2 - a1) > 1) k++;
}
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, count = 0;
scanf("%d", &n);
while (n--) {
int p, q;
scanf("%d%d", &p, &q);
if ((q - p) >= 2) {
count++;
}
}
printf("%d\n", count);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, i, dem;
dem = 0;
scanf("%d", &n);
int A[n][2];
for (i = 0; i < n; ++i) {
scanf("%d %d", &A[i][0], &A[i][1]);
if (A[i][1] - A[i][0] > 1) {
dem = dem + 1;
}
}
printf("\n%d\n", dem);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d\n", &n);
int output(0);
while (n--) {
int p, q;
scanf("%d %d\n", &p, &q);
if (q - p >= 2) {
++output;
}
}
printf("%d\n", output);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, q, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p;
cin >> q;
if (q - p >= 2) ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
int main() {
int n, d = 0;
scanf("%d", &n);
while (n >= 1) {
int a, b;
scanf("%d", &a);
scanf("%d", &b);
if (b - a > 1) d++;
n--;
}
printf("%d", d);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c = 0;
while (n > 0) {
cin >> a >> b;
if (b - a > 1) c++;
n--;
}
cout << c << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, r, arr[100][2];
cin >> n;
for (i = 0; i < n; i++) {
for (j = 0; j < 2; j++) {
cin >> arr[i][j];
}
}
r = 0;
for (i = 0; i < n; i++) {
if (arr[i][1] - arr[i][0] >= 2) {
r++;
}
}
cout << r;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(0);
cout << fixed;
int n, p, q, ctr = 0;
cin >> n;
for (int i = 0; i < (int)(n); ++i) {
cin >> p >> q;
if (q - p >= 2) ++ctr;
}
cout << ctr << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void program() {
int n, p, q;
int a = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p >> q;
if (q - p >= 2) a++;
}
cout << a;
}
int main() {
program();
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n;
scanf(" %d", &n);
int a[n][2];
int i, j, c = 0;
for (i = 0; i < n; i++) {
scanf(" %d %d", &a[i][0], &a[i][1]);
if ((a[i][1] - a[i][0]) >= 2) {
c++;
}
}
printf("%d\n", c);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, k, i, j, a, b, res;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a >> b;
if ((b - a) >= 2) res++;
}
cout << res;
}
|
#include <bits/stdc++.h>
int main() {
std::ios::sync_with_stdio(false);
int n;
std::cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
int p;
int q;
std::cin >> p;
std::cin >> q;
const int delta = q - p;
if (delta >= 2) {
count++;
}
}
std::cout << count << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, n, p, q, s = 0;
scanf("%lld", &n);
for (i = 0; i < n; i++) {
scanf("%lld%lld", &p, &q);
if (q - p >= 2) s++;
}
printf("%lld\n", s);
}
|
#include <bits/stdc++.h>
using namespace std;
int n, d[110];
int main() {
while (cin >> n) {
int ans = 0;
for (int i = 0; i < n; i++) {
int p, q;
cin >> p >> q;
d[i] = q - p;
if (d[i] >= 2) ans++;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i, p[n], q[n], c = 0;
for (i = 0; i < n; i++) {
cin >> p[i] >> q[i];
if (q[i] - p[i] >= 2) c++;
}
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100001], p[100001];
int main() {
int n, i, Max = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", a + i);
p[a[i]]++;
Max = max(Max, a[i]);
}
for (i = 1; i < Max; i++)
if (p[i] < p[i + 1]) {
printf("-1");
return 0;
}
printf("%d\n", p[1]);
for (i = 0; i < n; i++) {
if (i) printf(" ");
printf("%d", p[a[i]]--);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, col = 0, o[100010], c[100010];
int a[100010];
int main() {
cin >> n;
int max = 0;
for (int i = 0; i <= 100000; i++) {
o[i] = 0;
c[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max) max = a[i];
o[a[i]]++;
}
for (int i = 2; i <= max; i++) {
if (o[i] > o[i - 1]) {
cout << -1 << endl;
return 0;
}
}
cout << o[1] << endl;
c[a[0]]++;
cout << c[a[0]];
for (int i = 1; i < n; i++) {
c[a[i]]++;
cout << " " << c[a[i]];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int freq[1000006];
int main() {
cin.sync_with_stdio(0);
cout.sync_with_stdio(0);
int n, x;
cin >> n;
memset(freq, 0, sizeof(freq));
while (n--) {
cin >> x;
v.push_back(x);
freq[x]++;
}
int mx = *max_element(v.begin(), v.end()), prev = 1;
for (int i = 2; i <= mx; i++) {
if (freq[i] > freq[prev]) {
cout << "-1\n";
return 0;
}
prev = i;
}
cout << freq[1] << endl;
for (int i = 0; i < v.size(); i++) {
cout << freq[v[i]] << " ";
freq[v[i]]--;
}
}
|
#include <bits/stdc++.h>
int main() {
int i, j, k, l, m, n;
int in[100001], cnt[100001];
while (scanf("%d", &n) == 1) {
for (i = 0; i < 100001; i++) cnt[i] = 0;
for (i = 0; i < n; i++) scanf("%d", in + i), cnt[in[i]]++;
for (i = 2; i < 100001; i++)
if (cnt[i - 1] < cnt[i]) break;
if (i != 100001) {
puts("-1");
continue;
}
printf("%d\n", cnt[1]);
for (i = 0; i < n; i++) {
if (i) putchar(' ');
printf("%d", cnt[in[i]]--);
}
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
int n, a[100005], b[100005], i;
int main() {
for (; std::cin >> a[n]; n++)
if (n > 0) b[a[n]]++;
for (i = 2; i < 100005; i++)
if (b[i] > b[i - 1]) {
std::cout << -1;
return 0;
}
for (i = 0; i < n; i++)
std::cout << (i ? b[a[i]]-- : b[1]) << (i ? " " : "\n");
}
|
#include <bits/stdc++.h>
int main() {
const long B = 1e5 + 7;
std::vector<long> a(B, 0);
long n;
scanf("%ld", &n);
long cnt(0);
std::vector<long> v(n, 0);
for (long p = 0; p < n; p++) {
scanf("%ld", &v[p]);
++a[v[p]];
cnt = (cnt > a[v[p]]) ? cnt : a[v[p]];
}
bool possible(true);
for (long p = 2; p < B; p++) {
if (a[p - 1] < a[p]) {
possible = false;
break;
}
}
if (possible) {
printf("%ld\n", cnt);
for (long p = 0; p < n; p++) {
printf("%ld ", a[v[p]]);
--a[v[p]];
};
puts("");
} else {
puts("-1");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long r = 1e9;
struct node {
int a, b, c, d;
};
int n, m;
int t;
int k, l;
int a[100005];
int b[100005];
string s;
bool test() {
for (int i = 1; i < 100005 - 2; i++)
if (b[i] < b[i + 1]) return 0;
return 1;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) b[a[i]]++;
if (test()) {
cout << b[1] << endl;
for (int i = 0; i < n; i++) cout << b[a[i]]-- << " ";
} else
cout << -1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
bool b = true;
cin >> n;
int arr[100001];
for (int i = 0; i < 100001; i++) {
arr[i] = 0;
}
vector<pair<int, int> > v;
v.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i].first;
arr[v[i].first]++;
v[i].second = arr[v[i].first];
}
for (int i = 1; i < 100000; i++) {
if (arr[i] < arr[i + 1]) {
b = false;
break;
}
}
if (!b) {
cout << -1;
} else {
cout << arr[1] << endl;
for (int i = 0; i < n; i++) {
cout << v[i].second << " ";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[100005], cnt[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cout.precision(30);
cerr.precision(7);
;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
cnt[a[i]]++;
}
for (int i = 2; i <= 100000; i++) {
if (cnt[i] > cnt[i - 1]) {
cout << "-1";
return 0;
}
}
cout << cnt[1] << "\n";
for (int i = 1; i <= n; i++) cout << cnt[a[i]]-- << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
pair<int, int> a[100100];
int r[100100];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
int x;
scanf("%d", &x);
a[i] = make_pair(x, i);
}
sort(a, a + n);
int id = 1000000;
int last = 1000000;
int ret = -1;
int val = 0;
for (int i = 0; i < n; ++i) {
if (i == 0 || a[i].first != a[i - 1].first) {
++val;
if (id > last || a[i].first != val) {
cout << -1 << endl;
return 0;
}
last = id;
if (id != 1000000) {
ret = max(ret, id);
}
id = 0;
}
++id;
r[a[i].second] = id;
}
if (id != 1000000) {
ret = max(ret, id);
}
cout << ret << endl;
for (int i = 0; i < n; ++i) {
cout << r[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
long long mp[N], curr[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long T = 1;
while (T--) {
long long n;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
for (long long i = 2; i < N; i++) {
if (mp[i] > mp[i - 1]) {
cout << "-1\n";
return 0;
}
}
cout << mp[1] << '\n';
for (long long i = 0; i < n; i++) {
cout << ++curr[a[i]] << ' ';
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> val[100005];
int arr[100005];
int cnt[100005];
int main() {
int inp, ct = 1, mulai = 0, n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> inp;
arr[i] = inp;
cnt[inp]++;
mulai = max(mulai, inp);
}
for (int i = mulai; i; --i) {
int cur = cnt[i];
for (int j = 1; j <= cur; ++j) {
for (int k = i; k; --k) {
cnt[k]--;
if (cnt[k] < 0) {
cout << "-1";
return 0;
}
val[k].push_back(ct);
}
ct++;
}
}
cout << ct - 1 << "\n";
for (int i = 1; i <= n; ++i) {
cout << val[arr[i]].back() << " ";
val[arr[i]].pop_back();
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int a, b, c, d, i, j, n, m, k;
pair<int, int> mas[100001];
int ans[100001];
int main() {
scanf("%d", &n);
for (int _n((n)-1), i(0); i <= _n; i++) {
scanf("%d", &mas[i].first);
mas[i].second = i;
}
sort(mas, mas + n);
c = 1000000000;
d = 0;
k = 1;
for (int _n((n)-1), i(0); i <= _n; i++) {
if (i && mas[i - 1].first == mas[i].first) continue;
if (mas[i].first != k) {
printf("-1\n");
exit(0);
}
++k;
a = i;
while (a < n && mas[a].first == mas[i].first) ++a;
if (a - i > c) {
printf("-1\n");
exit(0);
}
for (int _n(a - 1), j(i); j <= _n; j++) ans[mas[j].second] = j - i;
c = a - i;
if (!i) d = c;
}
printf("%d\n", d);
for (int _n((n)-1), i(0); i <= _n; i++) {
if (i) printf(" ");
printf("%d", ans[i] + 1);
}
printf("\n");
}
|
#include <bits/stdc++.h>
int num[100010], cnt[100010], s[100010];
int main() {
int n, ok, len;
while (scanf("%d", &n) == 1) {
len = 0;
memset(num, 0, sizeof num);
memset(cnt, 0, sizeof cnt);
for (int i = 1; i <= n; ++i) {
scanf("%d", &s[i]);
len = len > s[i] ? len : s[i];
++num[s[i]];
}
ok = 1;
for (int i = 1; i < len; ++i)
if (!num[i] || num[i] < num[i + 1]) {
ok = 0;
break;
}
if (!ok) {
printf("-1\n");
continue;
}
printf("%d\n", num[1]);
for (int i = 1; i < n; ++i) printf("%d ", ++cnt[s[i]]);
printf("%d\n", cnt[s[n]] + 1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 1, 0, 0, 0, 0, 0, 0};
int dy[] = {0, 0, 1, -1, 0, 0, 0, 0};
const int inf = 10000000;
int main() {
int n;
cin >> n;
int a[n];
int ma = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ma = max(ma, a[i]);
}
vector<int> ind[ma];
for (int i = 0; i < n; i++) {
ind[a[i] - 1].push_back(i);
}
int ex = 1;
for (int i = 1; i < ma; i++) {
if (ind[i].size() > ind[i - 1].size()) {
ex = 0;
break;
}
}
if (!ex) {
cout << "-1" << endl;
return 0;
}
int res[n];
for (int i = 0; i < ma; i++) {
vector<int> x = ind[i];
for (int j = 0; j < x.size(); j++) {
res[x[j]] = j + 1;
}
}
cout << ind[0].size() << endl;
for (int i = 0; i < n; i++) {
cout << res[i] << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, a;
cin >> n;
stack<long long> pos[100005];
long long mx = 0, cnt = 0;
for (long long i = 0; i < n; i++) {
cin >> a;
pos[a].push(i + 1);
mx = max(mx, a);
cnt = max(cnt, (long long)pos[a].size());
}
long long ans[n];
for (long long i = 1; i <= cnt; i++) {
for (long long j = mx; j >= 1; j--) {
if (pos[j].empty()) {
cout << -1;
return;
}
long long x = pos[j].top();
pos[j].pop();
ans[x - 1] = i;
}
while (pos[mx].empty()) mx--;
}
cout << cnt << endl;
for (long long i = 0; i < n; i++) cout << ans[i] << " ";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long tt = 1;
while (tt--) {
solve();
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> vt;
vector<int> pd;
int mark[100010];
int mark2[100010];
inline void in() {
memset(mark, 0, sizeof(mark));
memset(mark2, 0, sizeof(mark2));
scanf("%d", &N);
vt.assign(N, 0);
pd.assign(N, 0);
for (int i = 0; i < N; ++i) {
scanf("%d", &vt[i]);
mark[vt[i]]++;
pd[i] = vt[i];
}
sort(vt.begin(), vt.end(), less<int>());
return;
}
inline void doit() {
int happenings = mark[vt[0]];
int numWas = vt[0];
int mx = happenings;
if (numWas != 1) {
printf("-1\n");
return;
}
for (int i = 0; i < N; ++i) {
if (numWas != vt[i]) {
if (abs(numWas - vt[i]) != 1) {
printf("-1\n");
return;
} else if (happenings < mark[vt[i]]) {
printf("-1\n");
return;
} else {
happenings = mark[vt[i]];
numWas = vt[i];
}
}
int nwNum = vt[i];
int dd = mark[vt[i]];
mark[vt[i]]--;
mark2[nwNum]++;
}
printf("%d\n", mx);
for (int i = 0; i < N; ++i) {
printf("%d ", mark2[pd[i]]);
mark2[pd[i]]--;
}
return;
}
int main() {
in();
doit();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
int n;
cin >> n;
vector<int> m(n);
int mmax = 0;
map<int, int> book;
for (int i = 0; i < n; i++) {
cin >> m[i];
mmax = max(mmax, m[i]);
book[m[i]]++;
}
int wina = n + 1;
for (int i = 1; i <= mmax; i++) {
if (book[i] > wina) {
cout << -1 << endl;
return 0;
}
wina = book[i];
}
int ans = book[1];
vector<int> mmm(n);
for (int i = 0; i < n; i++) {
mmm[i] = book[m[i]];
book[m[i]]--;
}
cout << ans << endl;
for (int i = 0; i < n; i++) cout << mmm[i] << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void run_case() {
long long n;
cin >> n;
vector<long long> a(n, 0);
for (long long i = 0; i < n; i++) cin >> a[i];
map<long long, long long> mp;
for (long long i = 0; i < n; i++) {
mp[a[i]]++;
}
auto chk = [&](map<long long, long long> m) {
long long mx = *max_element((a).begin(), (a).end());
long long las = mp[1];
long long lasele = 1;
while (lasele <= mx) {
if (mp[lasele] > las)
return 0;
else {
las = mp[lasele];
lasele++;
}
}
return 1;
};
if (chk(mp) == 0) {
cout << -1 << '\n';
} else {
map<long long, long long> las;
for (auto& ix : a) {
las[ix] = 1;
}
long long ans[n];
for (long long i = 0; i < n; i++) {
ans[i] = las[a[i]];
las[a[i]]++;
}
cout << mp[1] << '\n';
for (auto& ix : ans) {
cout << ix << " ";
}
cout << '\n';
;
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(20);
long long tests = 1;
for (long long tt = 1; tt <= tests; tt++) {
run_case();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void customrun() {}
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
bool isprime(long long n) {
for (long long i = 2; (long long)i * i <= n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
long long fib(int n) {
long long a = 0, b = 1, c, i;
if (n == 0) return a;
for (i = 2; i <= n; i++) {
c = (a + b);
a = b;
b = c;
}
return b;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long extendedgcd(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long x1, y1;
long long d = extendedgcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return d;
}
long long findgrouplcm(vector<int> &arr, int n) {
long long ans = arr[0];
for (long long i = 1; i < n; i++) ans = (arr[i] * (ans / (gcd(arr[i], ans))));
return ans;
}
long long powerwithmod(long long x, unsigned long long y, long long p) {
long long res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
bool comp(const pair<long, long> &a, const pair<long, long> &b) {
if (a.first == b.first) return a.second < b.second;
return a.first < b.first;
}
void solve();
int main() {
clock_t begin = clock();
fast();
customrun();
long long t = 1;
for (long long i = (1); i < (t + 1); i += (1)) {
solve();
}
clock_t end = clock();
double time_spent = (double)(end - begin) / CLOCKS_PER_SEC;
return 0;
}
void solve() {
int n, temp;
cin >> (n);
vector<int> v[100005];
int arr[n];
for (long long i = 0; i < n; i++) {
cin >> (temp);
v[temp].push_back(i);
}
int mx = v[1].size(), res = 0;
for (int i = 1; i < 100005; i++) {
if (v[i].size() > mx) {
cout << (-1);
return;
}
mx = v[i].size();
for (int j = 0; j < v[i].size(); j++) {
arr[v[i][j]] = j + 1;
res = max(res, j + 1);
}
}
cout << res << "\n";
for (auto i : arr) cout << i << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, cnt, sz, col[N];
vector<int> vec[N];
void readInput() {
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vec[x - 1].push_back(i);
}
}
void solve() {
cnt = vec[0].size();
for (int i = 0; i < cnt; i++)
for (int j = 0; !vec[j].empty(); j++)
col[vec[j].back()] = i, vec[j].pop_back(), sz++;
}
void writeOutput() {
if (sz < n) {
cout << "-1\n";
return;
}
cout << cnt << endl;
for (int i = 0; i < n; i++) cout << col[i] + 1 << ' ';
}
int main() {
ios_base ::sync_with_stdio(false), cin.tie(0), cout.tie(0);
readInput(), solve(), writeOutput();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, b, a[100000 + 100], c[100000 + 100], maxn, k, d[100000 + 10];
signed main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] == 1) k++;
maxn = max(maxn, a[i]);
if (a[i] > n) {
cout << -1;
return 0;
}
c[a[i]]++;
}
for (int i = 1; i <= maxn; i++)
if (c[i] < c[i + 1]) {
cout << -1;
return 0;
}
cout << k << "\n";
for (int i = 1; i <= n; i++) cout << ++d[a[i]] << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
pair<int, int> seq[110000];
int res[110000];
int main() {
scanf("%d", &n);
int x;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
seq[i] = make_pair(x, i);
}
sort(seq, seq + n);
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (i == n - 1 || seq[i].first != seq[i + 1].first) {
if (i < n - 1 && seq[i].first != seq[i + 1].first - 1) {
printf("-1\n");
return 0;
}
int j = i, cnt = 1;
while (j > 0 && seq[j - 1].first == seq[j].first) {
j--;
cnt++;
}
if (cnt < ans) {
printf("-1\n");
return 0;
}
ans = max(cnt, ans);
for (int k = j; k <= i; k++) res[seq[k].second] = k - j + 1;
}
}
if (seq[0].first != 1) {
printf("-1\n");
return 0;
}
printf("%d\n", ans);
printf("%d", res[0]);
for (int i = 1; i < n; i++) printf(" %d", res[i]);
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
int a[maxn];
int b[maxn];
int rem[maxn];
int main() {
int n;
cin >> n;
int res = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[a[i]]++;
res = max(a[i], res);
}
for (int i = 1; i <= res; i++) {
if (b[i] < b[i + 1]) {
cout << -1;
return 0;
}
}
cout << b[1] << endl;
for (int i = 0; i <= n; i++) {
rem[i] = 1;
}
for (int i = 0; i < n; i++) {
cout << rem[a[i]] << " ";
rem[a[i]]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, k, l, arr[100009] = {}, brr[100009] = {};
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
brr[arr[i]]++;
}
m = 0;
for (i = 1; i <= 100000; i++) {
if (i == 1)
l = brr[i];
else if (brr[i] > l) {
printf("-1");
return 0;
} else if (brr[i] < l)
l = brr[i];
}
printf("%d\n", brr[1]);
for (i = 0; i < n; i++) {
m = arr[i];
l = brr[m];
printf("%d ", l);
brr[m]--;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, ans[100010];
int cnt[100010], a[100010];
int main() {
int last = -1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), cnt[a[i]]++;
for (int i = 2; i <= 100000; i++)
if (cnt[i] > cnt[i - 1]) {
puts("-1");
return 0;
}
printf("%d\n", cnt[1]);
for (int i = 1; i <= n; i++) printf("%d ", ++ans[a[i]]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int dx[9] = {0, 1, -1, 0, 0, -1, -1, 1, 1};
const int dy[9] = {0, 0, 0, -1, 1, -1, 1, -1, 1};
const double pi = acos(-1.0);
const int N = 1e5;
int n, num = 0;
int ans[N + 100];
vector<int> a[N + 100];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
a[x].push_back(i);
}
int ma = 0;
for (int i = N; i >= 1; i--) {
ma = max(ma, (int)a[i].size());
if ((int)a[i].size() < ma) {
cout << -1 << endl;
return 0;
}
}
while (!a[1].empty()) {
num++;
for (int i = 1; i <= N; i++) {
if ((int)a[i].size() == 0) break;
ans[a[i].back()] = num;
a[i].pop_back();
}
}
cout << num << endl;
for (int i = 1; i <= n; i++) cout << ans[i] << ' ';
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct Pack {
int _val;
int _pos;
public:
Pack(int val, int pos) : _val(val), _pos(pos) {}
bool operator<(const Pack& p) const { return _val < p._val; }
};
bool isExist[100001] = {false};
int C[100001] = {0};
int ans[100001] = {0};
int v[100001] = {0};
int main() {
isExist[0] = true;
int n, val;
cin >> n;
for (int i = 0; i < n; i++) cin >> v[i];
for (int i = 0; i < n; i++) {
C[v[i]]++;
ans[i] = C[v[i]];
}
for (int i = 1; i < 100000; i++) {
if (C[i] < C[i + 1]) {
cout << -1 << endl;
return 0;
}
}
cout << C[1] << endl;
int i;
for (i = 0; i < n - 1; i++) cout << ans[i] << ' ';
cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100100], result[100100], count[100100], i, max = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
count[i] = 0;
}
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
count[a[i]]++;
result[i] = count[a[i]];
if (max < a[i]) max = a[i];
}
for (i = 1; i < max; i++) {
if (count[i] < count[i + 1]) break;
}
if (i < max)
printf("-1");
else {
printf("%d\n", count[1]);
for (i = 1; i <= n; i++) printf("%d ", result[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> cnt;
vector<int> v(n);
int mx = 1;
for (int i = 0; i < n; i++) {
cin >> v[i];
cnt[v[i]]++;
mx = max(mx, v[i]);
}
for (int i = 2; i <= mx; i++) {
if (cnt[i] > cnt[i - 1]) {
cout << -1 << "\n";
return 0;
}
}
cout << cnt[1] << "\n";
for (auto ele : v) {
cout << cnt[ele]-- << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 * 1000 + 10;
int arr[MAXN], t[MAXN];
int main() {
int n;
cin >> n;
int mx = 1;
for (int i = 0; i < n; i++) {
cin >> arr[i];
t[arr[i]]++;
mx = max(mx, arr[i]);
}
for (int i = 1; i < mx; i++)
if (t[i] < t[i + 1]) {
cout << "-1\n";
return 0;
}
cout << t[1] << endl;
for (int j = 0; j < n; j++) {
cout << t[arr[j]] << " ";
t[arr[j]]--;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[100001];
int dp[100001];
int main() {
int n;
scanf("%d", &n);
memset(dp, 0, sizeof dp);
for (int i = 0; i < n; i++) {
cin >> arr[i];
dp[arr[i]]++;
}
for (int i = 2; i <= 100000; i++) {
if (dp[i] > dp[i - 1]) {
cout << "-1" << endl;
return 0;
}
}
cout << dp[1] << endl;
for (int i = 0; i < n; i++) {
cout << dp[arr[i]] << " ";
dp[arr[i]]--;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const long double eps = 1e-6;
int32_t main() {
cout << fixed << setprecision(15);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vector<long long> a(n, 0);
long long maxn = 0;
for (long long i = 0; i < n; ++i) {
cin >> a[i];
maxn = max(maxn, a[i]);
}
vector<long long> res(n, 0);
vector<long long> cnt(maxn + 1, 0);
long long m = 0;
for (long long i = 0; i < n; ++i) {
res[i] = ++cnt[a[i]];
m = max(m, cnt[a[i]]);
}
for (long long i = 2; i <= maxn; ++i) {
if (cnt[i] > cnt[i - 1]) {
cout << "-1\n";
return 0;
}
}
cout << m << "\n";
for (long long i = 0; i < n; ++i) cout << res[i] << " ";
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100005], in[100005];
int main() {
int n, m;
scanf("%d", &n);
int i, j;
for (i = 0; i < n; i++) {
scanf("%d", &in[i]);
in[i] = ++a[in[i]];
}
for (i = 2; i <= 100000; i++)
if (a[i] > a[i - 1]) break;
if (i <= 100000)
printf("-1\n");
else {
printf("%d\n", a[1]);
for (i = 0; i < n; i++) printf("%d%c", in[i], " \n"[i == n - 1]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve(long long testcase) {
long long n;
cin >> n;
vector<long long> v(n);
map<long long, vector<long long>> mp;
for (long long i = 0; i < n; i++) {
cin >> v[i];
mp[v[i]].push_back(i);
}
vector<long long> a, b;
long long c = 1;
for (auto p : mp)
if (p.first != c) {
cout << -1 << '\n';
return;
} else
c++;
for (auto p : mp) a.push_back(p.second.size());
b = a;
sort(b.rbegin(), b.rend());
if (a != b) {
cout << -1 << '\n';
return;
}
long long ans = 0;
vector<long long> Ans(n);
for (;;) {
long long ok = 0;
for (long long i = 0; i < a.size(); i++) {
if (a[i] > 0) {
a[i]--;
ok = 1;
Ans[mp[i + 1].back()] = ans;
mp[i + 1].pop_back();
} else
break;
}
if (!ok) break;
ans++;
}
cout << ans << '\n';
for (long long x : Ans) cout << x + 1 << ' ';
cout << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long T = 1;
for (long long t = 1; t <= T; t++) solve(t);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char* argv[]) {
ios::sync_with_stdio(0);
cin.tie(0);
int n, a, m = 0, m2;
cin >> n;
vector<int> v(n + 2, 0);
vector<int> s;
while (n--) {
cin >> a;
s.push_back(a);
v[a] += 1;
m = max(m, a);
}
m2 = v[1];
for (int i = 2; i <= m; i++) {
m2 = max(m2, v[i]);
if (v[i] > v[i - 1]) {
cout << -1;
return 0;
}
}
cout << m2 << "\n";
for (auto k : s) {
cout << v[k] << " ";
v[k]--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int freq[100005], a[100005];
void solve() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
freq[arr[i]]++;
a[arr[i]] = 1;
}
for (int i = 2; i <= 100001; i++) {
if (freq[i] > freq[i - 1]) {
cout << "-1";
return;
}
}
cout << freq[1] << endl;
for (int i = 0; i < n; i++) {
cout << a[arr[i]] << " ";
a[arr[i]]++;
}
}
int main() {
int t;
t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
long k, na;
};
const long maxn = 100001;
node a[maxn];
long n, b[maxn];
int qsort(long low, long high) {
long i = low, j = high, x = a[(i + j) / 2].k;
while (i < j) {
while (a[i].k < x) i++;
while (a[j].k > x) j--;
if (i <= j) {
swap(a[i], a[j]);
i++;
j--;
}
}
if (i < high) qsort(i, high);
if (j > low) qsort(low, j);
return 0;
}
void init() {
cin >> n;
for (long i = 1; i <= n; i++) {
cin >> a[i].k;
a[i].na = i;
}
qsort(1, n);
}
void work() {
memset(b, 0, sizeof(b));
for (long i = 1; i <= n; i++) b[a[i].k] += 1;
int bj = 1;
for (long i = 2; i <= a[n].k; i++)
if (b[i] > b[i - 1]) bj = 0;
if (bj) {
cout << b[1] << endl;
long s = 0;
for (long i = 1; i <= n; i++) {
if ((i == 1) || (a[i].k == a[i - 1].k))
s++;
else
s = 1;
b[a[i].na] = s;
}
for (long i = 1; i <= n; i++) {
cout << b[i];
if (i != n) cout << " ";
}
cout << endl;
} else
cout << -1 << endl;
}
int main() {
init();
work();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int max1 = 1e5 + 2;
int count[max1];
int index[max1];
for (int i = 0; i < max1; i++) {
count[i] = 0;
index[i] = 1;
}
int n;
cin >> n;
int* arr = new int[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
count[arr[i]]++;
}
int top = 0;
for (int i = 1; i < max1 - 1; i++) {
if (count[i] < count[i + 1]) {
cout << -1 << endl;
return 0;
}
top = max(top, count[i]);
}
cout << top << endl;
for (int i = 0; i < n; i++) {
cout << index[arr[i]] << " ";
index[arr[i]]++;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
int n, a[100005], b[100005], i;
int main() {
for (; std::cin >> a[n]; n++)
if (n > 0) b[a[n]]++;
for (i = 2; i < 100005; i++)
if (b[i] > b[i - 1]) b[1] = -1, n = 1;
for (i = 0; i < n; i++)
std::cout << (i ? b[a[i]]-- : b[1]) << (i ? " " : "\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[100005], ans[100005], maxi, maxiii;
vector<int> f[100005];
int main() {
int i, j, ok = 1;
std::ios::sync_with_stdio(false);
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
f[a[i]].push_back(i);
maxi = max(a[i], maxi);
}
for (i = 1; (i < maxi) && ok; i++)
if (f[i].size() < f[i + 1].size()) ok = 0;
if (!ok) {
cout << -1;
return 0;
}
maxiii = 0;
for (i = 1; i <= maxi; i++) {
j = 0;
for (auto x : f[i]) {
j++;
ans[x] = j;
}
maxiii = max(maxiii, j);
}
cout << maxiii << "\n";
for (i = 1; i <= n; i++) cout << ans[i] << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
v.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int a[200000] = {};
int vmax = 0;
for (int i = 0; i < n; i++) {
a[v[i]]++;
if (vmax < v[i]) vmax = v[i];
}
int x = a[1];
for (int i = 1; i <= vmax; i++) {
if (a[i] > x) {
cout << "-1" << endl;
return 0;
}
x = a[i];
}
int b[200000] = {};
cout << a[1] << endl;
for (int i = 0; i < n; i++) {
cout << b[v[i]] + 1 << " ";
b[v[i]]++;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
inline char skipwhitespace() {
char ch = getchar();
while (ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t') ch = getchar();
return ch;
}
void gi(int &x) {
register int c = getchar();
x = 0;
int sn = 1;
for (; (c < 48 || c > 57); c = getchar())
if (c == '-') sn = -1;
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
x *= sn;
}
void gii(long long int &x) {
register long long int c = getchar();
x = 0;
long long int sn = 1;
for (; (c < 48 || c > 57); c = getchar())
if (c == '-') sn = -1;
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
x *= sn;
}
void wi(int n) {
int sign = n >= 0 ? 1 : -1;
n = n > 0 ? n : -n;
char buf[10];
int i = 9;
if (!n) buf[i--] = 48;
while (n) {
buf[i--] = n % 10 + 48;
n /= 10;
}
if (sign < 0) printf("%c", '-');
while (++i < 10) printf("%c", buf[i]);
}
void wii(long long int n) {
long long int sign = n >= 0 ? 1 : -1;
n = n > 0 ? n : -n;
char buf[25];
long long int i = 24;
if (!n) buf[i--] = 48;
while (n) {
buf[i--] = n % 10 + 48;
n /= 10;
}
if (sign < 0) printf("%c", '-');
while (++i < 25) printf("%c", buf[i]);
}
int gs(char *s) {
char ch = skipwhitespace();
int n = 0;
while ((ch != '\n' && ch != ' ' && ch != '\t')) {
s[n++] = ch;
ch = getchar();
}
s[n] = 0;
return n;
}
void ws(char *s) {
char *p = s;
while (*p) {
printf("%c", *p);
p++;
}
}
int a[100005], ans[100005], cnt[100005] = {0};
int main() {
int n, pre = 0, flag = 1, mx = 0;
gi(n);
for (int i = 0; i < n; i++) gi(a[i]), cnt[a[i]]++;
for (int i = 100005 - 1; i >= 1; i--) {
cnt[i] -= pre;
if (cnt[i] < 0) {
flag = 0;
break;
}
if (i == 0 && cnt[i] != 0) {
flag = 0;
break;
}
pre += cnt[i];
mx = max(mx, pre);
}
for (int i = 1; i <= 100005 - 1; i++) cnt[i] = 1;
if (flag) {
for (int i = 0; i < n; i++) ans[i] = cnt[a[i]], cnt[a[i]]++;
cout << mx << endl;
for (int i = 0; i < n; i++) cout << ans[i] << " ";
printf("\n");
} else
cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
vector<string> alpha{"a", "b", "c", "d", "e", "f", "g", "h", "i",
"j", "k", "l", "m", "n", "o", "p", "q", "r",
"s", "t", "u", "v", "w", "x", "y", "z"};
int GDC(int a, int b) {
if (a == 0) return b;
if (b == 0) return a;
return GDC(b, a % b);
}
int LCD(int a, int b) {
if (a == b) return a;
if (max(a, b) % min(a, b) == 0) return max(a, b);
return a * b;
}
int search(vector<int> a, int b) {
int m = a.size() / 2;
vector<int> h;
int i = -1;
if (b == a[m]) return m;
if (a.size() == 1 && b != a[m]) return -1;
if (b < a[m]) {
h = {a.begin(), a.begin() + m};
i = 0;
} else {
h = {a.begin() + m, a.end()};
i = m;
}
int s = search(h, b);
return s < 0 ? -1 : i + s;
}
int searchU(vector<int> a, int b) {
for (int i = 0; i < a.size(); i++) {
if (a[i] == b) return i;
}
return -1;
}
int min(vector<int> a) {
int best = pow(2, 31) - 1;
for (auto b : a) {
if (b < best) best = b;
}
return best;
}
int max(vector<int> a) {
int best = 0;
for (auto b : a) {
if (b > best) best = b;
}
return best;
}
void printVector(vector<int> v) {
for (auto i : v) {
cout << i << " ";
}
cout << '\n';
}
bool in(int val, vector<int> v) {
for (auto i : v) {
if (i == val) {
return true;
}
}
return false;
}
int sum(vector<int> v) {
int sum = 0;
for (auto i : v) {
sum += i;
}
return sum;
}
int main() {
int cases = 1;
for (int _case = 0; _case < cases; _case++) {
int n;
cin >> n;
vector<int> nums = {0};
vector<int> a;
for (int i = 0; i < n; i++) {
int val;
cin >> val;
a.push_back(val);
nums.push_back(0);
}
if (max(a) >= nums.size()) {
for (int i = nums.size() - 1; i < max(a); i++) {
nums.push_back(0);
}
}
vector<int> b;
for (int i = 0; i < n; i++) {
nums[a[i]]++;
b.push_back(nums[a[i]]);
}
bool x = false;
for (int i = 2; i < nums.size(); i++) {
if (nums[i] > nums[i - 1]) {
cout << -1 << '\n';
x = true;
break;
}
}
if (!x) {
cout << max(b) << '\n';
printVector(b);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100100], used[100100];
int b[100100];
vector<vector<int> > store;
int main() {
int n, x, maxN = 0;
cin >> n;
store.resize(100100);
for (int i = 0; i < n; i++) {
cin >> x;
a[x]++;
store[x].push_back(i);
maxN = max(maxN, x);
}
a[0] = a[1];
for (int i = 1; i <= maxN; i++) {
if (a[i] > a[i - 1]) {
cout << -1;
return 0;
}
}
int cur = 0;
while (a[1]) {
int index = 1;
++cur;
while (a[index]) {
a[index]--;
b[store[index][used[index]]] = cur;
used[index]++;
index++;
}
}
cout << cur << endl;
for (int i = 0; i < n; i++) cout << b[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, v = 0;
scanf("%d", &n);
map<int, stack<int>, greater<int>> c;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
c[x].push(i);
}
vector<int> a(n);
while (!c.empty()) {
v++;
auto it = c.begin();
for (int i = it->first; i >= 1; i--) {
if (i != it->first) {
puts("-1");
return 0;
}
a[it->second.top()] = v;
it->second.pop();
if (it->second.empty())
c.erase(it++);
else
it++;
}
}
printf("%d\n", v);
for (int x : a) printf("%d ", x);
}
|
#include <bits/stdc++.h>
using namespace std;
int s[100100];
int a[100100];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 0; i < n; i++) s[a[i]]++;
int ok = 1;
for (int i = 1; i <= 100000; i++) {
if (s[i] < s[i + 1]) {
ok = 0;
break;
}
}
if (!ok) {
cout << -1 << endl;
return 0;
}
cout << s[1] << endl;
for (int i = 0; i < n; i++) {
cout << s[a[i]] << " ";
s[a[i]]--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char c;
long long n, i, j, k, nn = 1, nb = 100010, nm, u, m = 0;
struct sd {
long long num, z, as;
} a[100010] = {0};
long long rd() {
nm = 0;
u = 1;
c = getchar();
while (c < '0' || '9' < c) {
if (c == '-') u *= -1;
c = getchar();
}
while ('0' <= c && c <= '9') nm = nm * 10 + c - '0', c = getchar();
return nm * u;
}
bool cmp(sd x, sd y) { return x.z < y.z; }
bool cpt(sd x, sd y) { return x.num < y.num; }
int main() {
n = rd();
for (i = 1; i <= n; ++i) {
a[i].z = rd();
a[i].num = i;
if (a[i].z == 1) m++;
}
sort(a + 1, a + n + 1, cmp);
for (i = 1; i <= n; ++i) {
if (a[i].z == a[i - 1].z)
nn++;
else {
if (a[i].z != a[i - 1].z + 1 || nn > nb) {
printf("-1");
return 0;
}
nb = nn;
nn = 1;
if (i == 1) nb = 100010;
}
}
if (nn > nb) {
printf("-1");
return 0;
}
nn = 0;
for (i = 1; i <= n; ++i) {
if (a[i].z == a[i - 1].z)
nn++;
else
nn = 1;
a[i].as = nn;
}
sort(a + 1, a + n + 1, cpt);
printf("%lld\n", m);
for (i = 1; i <= n; ++i) printf("%lld ", a[i].as);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<vector<int> > wyst(100001);
vector<int> odp(n);
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
wyst[x].push_back(i);
}
int nr = 1;
while (wyst[1].size() != 0) {
for (int i = 1; wyst[i].size() != 0; ++i) {
odp[wyst[i].back()] = nr;
wyst[i].pop_back();
}
++nr;
}
--nr;
bool db = true;
for (int i = 0; i < 100001; ++i)
if (wyst[i].size() != 0) db = false;
if (db) {
cout << nr << endl;
for (int i = 0; i < n; ++i) cout << odp[i] << " ";
} else
cout << "-1";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, arr[100005], has[100005], t;
vector<int> v[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
arr[a]++;
has[i] = arr[a];
v[has[i]].push_back(a);
t = max(t, has[i]);
}
for (int i = 0; i < 100000; i++) {
int p = v[i].size();
if (p != 0) {
int tmp = 0;
for (int j = 0; j < p; j++) {
tmp += v[i][j];
}
if (tmp != ((p * (p + 1)) / 2)) {
cout << "-1" << endl;
return 0;
}
}
}
cout << t << endl;
for (int i = 1; i <= n; i++) cout << has[i] << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> values(n + 5, 0);
int val;
for (int i = 0; i < n; i++) {
scanf("%d", &val);
values[i + 1] = val;
}
vector<int> freq(n + 5, 0);
for (int i = 0; i < n; i++) {
int x = values[i + 1];
if (x > n) {
cout << -1 << endl;
return 0;
}
freq[x]++;
values[i + 1] = freq[x];
}
int v = freq[1];
bool correct = true;
for (int i = 2; i <= n; i++) {
if (freq[i] > v) {
correct = false;
break;
}
v = freq[i];
}
if (correct) {
cout << freq[1] << endl;
for (int i = 1; i <= n; i++) {
if (i == 1)
cout << values[i];
else
cout << " " << values[i];
}
cout << endl;
} else
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const long long INF = 1e18;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
map<int, vector<int>> mp;
map<int, int> ans;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
mp[x].push_back(i);
;
}
int prev = n;
int g = 1;
for (auto i : mp) {
if (i.first != g || i.second.size() > prev) {
cout << -1;
exit(0);
}
g++;
prev = i.second.size();
}
vector<int> sv;
int cur = 1;
for (int i : mp[1]) {
sv.push_back(cur);
ans[i] = cur++;
}
for (auto i : mp) {
if (i.first == 1) continue;
int fx = 1;
for (int j : i.second) {
ans[j] = fx++;
}
}
cout << cur - 1 << endl;
for (int i = 1; i <= n; ++i) {
cout << ans[i] << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) { return (b == 0) ? a : GCD(b, a % b); }
long long LCM(long long a, long long b) {
long long temp = GCD(a, b);
return temp ? (a / temp * b) : 0;
}
long long oo = 1e18;
long long const M = 1e6, N = 1e6 + 7;
long long n, m, sum, t, c, k;
long long x, y;
int f[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
;
for (int i = 0; i < n; i++) {
x = v[i];
m = max(m, x);
f[x]++;
}
for (int i = 0; i < m + 1; i++) {
if (f[i + 1] < f[i + 2]) return cout << -1, 0;
}
cout << f[1] << '\n';
for (int i = 0; i < n; i++) {
cout << f[v[i]]-- << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, a[N], cnt[N];
void readInput() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i], cnt[--a[i]]++;
}
void writeOutput() {
for (int i = N - 1; i; i--)
if (cnt[i] > cnt[i - 1]) {
cout << "-1\n";
return;
}
cout << cnt[0] << endl;
for (int i = 0; i < n; i++) cout << cnt[a[i]]-- << ' ';
}
int main() {
ios_base ::sync_with_stdio(false), cin.tie(0), cout.tie(0);
readInput(), writeOutput();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
static int buc[100001];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
buc[a[i]]++;
}
bool ok = true;
int mx = *max_element(a.begin(), a.end()), m = 0;
for (int i = mx; i >= 1; i--) {
buc[i] -= m;
if (buc[i] < 0) {
ok = false;
break;
}
m += buc[i];
}
if (!ok) {
puts("-1");
return 0;
}
printf("%d\n", m);
static int cnt[100001];
for (int i = 0; i < n; i++) {
if (i > 0) putchar(' ');
printf("%d", ++cnt[a[i]]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
vector<pair<int, int> > perm[MAXN];
int ans[MAXN];
int N;
vector<pair<int, int> > vec;
int main(int argc, char *argv[]) {
scanf("%d", &N);
for (int i = 0, _i = N; i < _i; ++i) {
int a;
scanf("%d", &a);
vec.push_back(pair<int, int>(a, i));
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N;) {
int j;
int k = 0;
for (j = i; j < N && vec[i].first == vec[j].first; j++) {
perm[k++].push_back(vec[j]);
}
i = j;
}
int sz = 0;
for (int i = 0, _i = N; i < _i; ++i) {
if (perm[i].empty()) continue;
++sz;
if (perm[i][0].first != 1) {
printf("-1\n");
return 0;
}
ans[perm[i][0].second] = i + 1;
int last = 1;
for (int j = 1; j < perm[i].size(); j++) {
if (perm[i][j].first != last + 1) {
printf("-1\n");
return 0;
}
ans[perm[i][j].second] = i + 1;
last++;
}
}
printf("%d\n", sz);
for (int i = 0, _i = N; i < _i; ++i) {
printf("%d ", ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 * 1000 + 1000;
int arr[MAXN];
vector<int> pt[MAXN];
int mrk[MAXN];
int32_t main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
for (int i = 0; i < n; i++) pt[arr[i]].push_back(i);
int cnt = n;
int cnt_2 = 1;
while (cnt) {
if (pt[1].size() == 0) {
cout << -1 << endl;
return 0;
}
int pt_2 = 1;
while (pt[pt_2].size() > 0) {
mrk[pt[pt_2][pt[pt_2].size() - 1]] = cnt_2;
pt[pt_2].pop_back();
cnt--;
pt_2++;
}
cnt_2++;
}
cout << *max_element(mrk, mrk + n) << endl;
for (int i = 0; i < n; i++) cout << mrk[i] << ' ';
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
struct dot {
int key, id;
} a[100100];
int m, f[100100], n;
int cmp(const void *x, const void *y) {
return ((dot *)x)->key - ((dot *)y)->key;
}
int main() {
int i, j, k, x, y;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i].key);
a[i].id = i;
}
qsort(a + 1, n, sizeof(dot), cmp);
y = a[n].key;
x = n;
m = 0;
while (y > 0) {
i = x;
k = 0;
while (a[i].key == y) {
f[a[i].id] = ++k;
i--;
}
if (k < m) {
cout << -1 << endl;
return 0;
}
if (k > m) m = k;
y--;
x = i;
}
printf("%d\n", m);
for (i = 1; i < n; i++) printf("%d ", f[i]);
printf("%d\n", f[n]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[100005], b[100005], i;
int main() {
cin >> n;
for (; i < n; i++) {
cin >> a[i];
b[a[i]]++;
}
for (i = 2; i < 100005; i++)
if (b[i] > b[i - 1]) {
cout << -1;
return 0;
}
cout << b[1] << "\n";
for (i = 0; i < n; i++) cout << (b[a[i]]--) << " ";
}
|
#include <bits/stdc++.h>
int main() {
int a[100010], k[100010], i, n;
memset(k, 0, sizeof(int) * 100010);
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
k[a[i] - 1]++;
}
for (i = 0; i < 100010 - 1; i++) {
if (k[i] < k[i + 1]) {
printf("-1");
return 0;
}
}
printf("%d\n", k[0]);
for (i = 0; i < n; i++) {
printf("%d ", k[a[i] - 1]);
k[a[i] - 1]--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int N;
int cnt[MAXN];
int ans[MAXN];
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
cin >> N;
for (int a = 1; a <= N; a++) {
int x;
cin >> x;
ans[a] = ++cnt[x];
}
for (int a = 2; a < MAXN; a++) {
if (cnt[a] > cnt[a - 1]) {
cout << -1;
return 0;
}
}
cout << cnt[1] << "\n";
for (int a = 1; a <= N; a++) {
cout << ans[a] << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T next_int() {
T p = 1, x = 0;
char ch;
do {
ch = getchar();
} while (ch <= ' ');
if (ch == '-') {
p = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch - '0');
ch = getchar();
}
return p * x;
}
const int max_n = (int)1e5 + 228;
const int max_int = (int)1e9 + 228;
int a[max_n];
int b[max_n];
int main() {
int n = next_int<int>();
for (int i = 0; i < n; i++) {
a[i] = next_int<int>();
b[a[i]]++;
a[i] = b[a[i]];
}
bool ok = 1;
for (int i = 2; i < max_n; i++) {
if (b[i] > b[i - 1]) ok = 0;
}
if (ok == 0) {
puts("-1");
return 0;
}
cout << b[1] << "\n";
for (int i = 0; i < n; i++) cout << a[i] << " ";
puts("");
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 1, MOD = 1e9 + 7;
long long n, ans, a[MAX], q, b[MAX];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
q = max(q, a[i]);
b[a[i]]++;
if (a[i] == 1) ans++;
}
for (int i = q; i > 1; i--) {
if (b[i] > b[i - 1]) {
cout << "-1";
return 0;
}
}
cout << ans << endl;
for (int i = 0; i < n; i++) {
if (b[a[i]] != 0) {
cout << b[a[i]] << " ";
b[a[i]]--;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int mid, n;
int cnt[MAXN];
int a[MAXN][2];
bool flag = true;
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i][0];
if (a[i][0] > mid) mid = a[i][0];
cnt[a[i][0]]++;
a[i][1] = cnt[a[i][0]];
}
for (int i = 1; i <= mid - 1; i++)
if (cnt[i] < cnt[i + 1]) {
flag = false;
break;
}
if (flag) {
cout << cnt[1] << endl;
for (int i = 0; i < n; i++) cout << a[i][1] << " ";
} else
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, i, m = 0;
int a[100004], c[100004], x[100004];
int main() {
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
c[a[i]]++;
m = max(m, a[i]);
}
for (i = m; i > 1; i--) {
if (c[i] > c[i - 1]) {
printf("-1\n");
return 0;
}
x[i] = 0;
}
printf("%d\n", c[1]);
for (i = 0; i < n; i++) {
x[a[i]]++;
printf("%d ", x[a[i]]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
int a[n + 1], b[100001];
for (int i = 1; i <= 100000; i++) b[i] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
b[a[i]]++;
}
for (int i = 2; i <= 100000; i++) {
if (b[i] > b[i - 1]) {
cout << -1;
return 0;
}
}
cout << b[1] << endl;
for (int i = 1; i <= n; i++) {
cout << b[a[i]] << " ";
b[a[i]]--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> L1[100000];
pair<int, int> L2[100000];
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &L1[i].first);
L1[i].second = i;
}
sort(L1, L1 + N);
int idx = 1;
int num = 1;
int max_idx = 987654321;
int one_cnt = 0;
for (int i = 0; i < N; i++) {
L2[i].first = L1[i].second;
if (num == L1[i].first) {
if (idx > max_idx) {
printf("-1\n");
return 0;
}
L2[i].second = idx++;
} else {
max_idx = min(max_idx, idx - 1);
idx = 1;
num++;
i--;
continue;
}
one_cnt += (L1[i].first == 1);
}
sort(L2, L2 + N);
printf("%d\n", one_cnt);
for (int i = 0; i < N; i++) {
if (i != 0) printf(" ");
printf("%d", L2[i].second);
}
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
int freq[MAXN + 5];
int n;
int arr[MAXN + 5];
int which[MAXN + 5];
int main() {
int c, c2;
scanf("%d", &n);
for (c = 0; c < n; c++) {
scanf("%d", &arr[c]);
freq[arr[c]]++;
which[c] = freq[arr[c]];
}
for (c = 1; c <= MAXN; c++)
if (freq[c] < freq[c + 1]) break;
if (c > MAXN) {
printf("%d\n", freq[1]);
for (c = 0; c < n; c++) {
if (c) printf(" ");
printf("%d", which[c]);
}
printf("\n");
} else
printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
vector<set<int>> vs(n);
map<int, int> mp;
int mx = 0;
for (auto i : v) vs[mp[i]++].insert(i), mx = max(mx, mp[i]);
bool good = 1;
for (auto i : vs) {
int cnt = 1;
for (auto j : i) {
if (j != cnt) good = 0;
cnt++;
}
}
mp.clear();
if (good) {
cout << mx << endl;
for (auto i : v) cout << ++mp[i] << " ";
} else
cout << -1;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[101000];
int kol[101000];
int main() {
memset(kol, 0, sizeof(kol));
int n, i;
scanf("%d", &n);
int max = 0;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
kol[a[i]]++;
if (a[i] > max) max = a[i];
}
bool flag = true;
for (i = max; i > 1; i--)
if (kol[i - 1] < kol[i]) {
flag = false;
break;
}
if (flag) {
printf("%d\n", kol[1]);
for (i = 1; i <= n; i++) {
printf("%d ", kol[a[i]]);
kol[a[i]]--;
}
} else
printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int b[100005];
int n, x;
int a[100005];
int main() {
memset(b, 0, sizeof(b));
scanf("%d", &n);
int mm;
int ma = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
b[x]++;
a[i] = x;
ma = max(ma, x);
}
for (int i = ma; i > 1; i--)
if (b[i] > b[i - 1]) {
printf("-1\n");
return 0;
}
printf("%d\n", b[1]);
for (int i = 1; i <= n; i++) printf("%d ", b[a[i]]--);
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, d, a[100001], b[100001];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[a[i]]++;
}
for (int i = 2; i <= 100000; i++) {
if (b[i] > b[i - 1]) {
cout << "-1";
return 0;
}
}
cout << b[1] << "\n";
for (int i = 0; i < n; i++) {
b[i] = 1;
}
for (int i = 0; i < n; i++) {
cout << b[a[i]] << " ";
b[a[i]]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int x, long long int y) {
if (y == 0) return x;
return gcd(y, x % y);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
map<int, int> m;
int n, l = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
l = max(l, v[i]);
if (m.find(v[i]) != m.end())
m[v[i]]++;
else
m.insert({v[i], 1});
}
bool ok = true;
for (int i = 1; i < l; i++) {
if (m[i] < m[i + 1]) {
ok = false;
break;
}
}
if (ok) {
cout << m[1] << "\n";
for (int i = 0; i < n; i++) {
cout << m[v[i]] << " ";
m[v[i]]--;
}
} else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, _max = 1;
cin >> n;
int data[n];
for (int i = (0); i < (n); i++) cin >> data[i];
int ans[n];
map<int, vector<int> > d = map<int, vector<int> >();
for (int i = (0); i < (n); i++) {
if (d.find(data[i]) == d.end()) {
_max = max(_max, data[i]);
d[data[i]] = vector<int>();
}
d[data[i]].push_back(i);
ans[i] = d[data[i]].size();
}
for (int i = (1); i < (_max); i++) {
if (d.find(i) == d.end() || d[i].size() < d[i + 1].size()) {
cout << -1;
return 0;
}
}
cout << d[1].size() << endl;
for (int i = (0); i < (n); i++) cout << ans[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int b[1111111];
int c[1111111];
int main(void) {
int i, n, mx, mmx;
while (scanf(" %d", &n) != EOF) {
memset(c, 0, sizeof(c));
mx = 1;
mmx = 1;
for (i = 0; i < n; i++) {
scanf(" %d", &b[i]);
if (b[i] > mmx) mmx = b[i];
c[b[i] - 1]++;
b[i] = c[b[i] - 1];
}
for (i = 0; i < n; i++)
if (c[i] > mx) mx = c[i];
for (i = 1; i < n; i++) {
if (c[i] > c[i - 1]) break;
}
if (i < n || mmx > n)
printf("-1\n");
else {
printf("%d\n", mx);
for (i = 0; i < n; i++) printf("%d%c", b[i], (i == n - 1) ? '\n' : ' ');
}
}
return 0;
}
|
#include <bits/stdc++.h>
const int MAXN = 100007;
using namespace std;
int count_[MAXN], res[MAXN];
int n;
vector<int> id[MAXN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
int u;
cin >> u;
count_[u]++;
id[u].push_back(i);
}
int i = 1;
int j = 1;
for (int t = 1; t <= n; t++) {
if (id[j].size() == 0) {
cout << -1;
return 0;
}
int x = id[j].back();
id[j].pop_back();
res[x] = i;
j++;
if (id[j].size() == 0) {
i++;
j = 1;
}
}
cout << i - 1 << endl;
for (int t = 1; t <= n; t++) cout << res[t] << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
struct info {
int n;
int pos;
int ind;
} val[100005];
int N, ans;
int c[100005];
bool cmp(struct info a, struct info b) { return a.n < b.n; }
bool cmp1(struct info a, struct info b) { return a.ind < b.ind; }
int main() {
int i;
scanf("%d", &N);
ans = 0;
for (i = 0; i < N; i++) {
scanf("%d", &val[i].n);
if (val[i].n == 1) ans++;
val[i].ind = i;
}
bool flag = true;
sort(val, val + N, cmp);
for (i = 0; i < N; i++) {
if (val[i].n == 1) {
val[i].pos = c[val[i].n] + 1;
c[1]++;
} else {
if (c[val[i].n] >= ans) flag = false;
val[i].pos = (c[val[i].n]) + 1;
c[val[i].n]++;
if (c[val[i].n - 1] < c[val[i].n]) flag = false;
}
}
sort(val, val + N, cmp1);
if (!flag) {
printf("%d\n", -1);
return 0;
}
printf("%d\n", ans);
for (int k = 0; k < N; k++) {
if (k) printf(" ");
printf("%d", val[k].pos);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int maxn = (int)1e5 + 10;
const int mod = (int)1e9;
int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; }
int fastMin(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; }
int c[100005];
int a[100005];
int main() {
int n, i, m = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
c[a[i]]++;
m = (a[i] > m ? a[i] : m);
}
for (i = m; i > 1; i--)
if (c[i] > c[i - 1]) {
cout << -1 << endl;
return 0;
}
cout << c[1] << endl;
for (i = 0; i < n; i++) {
cout << c[a[i]] << " ";
c[a[i]]--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct E {
int id, num;
bool operator<(const E e) const { return num < e.num; }
};
int n;
E ar[1000000];
int C[1000000];
int R[1000000];
int main() {
memset(C, 0, sizeof(C));
cin >> n;
int ma = 0;
bool ok = true;
for (int i = 0; i < n; i++) {
cin >> ar[i].num;
C[ar[i].num]++;
ma = max(ma, C[ar[i].num]);
ar[i].id = i;
}
if (ma > C[1]) ok = false;
if (ok) {
sort(ar, ar + n);
R[ar[0].id] = 1;
for (int i = 1; i < n; i++) {
if (ar[i].num == ar[i - 1].num) {
R[ar[i].id] = R[ar[i - 1].id] + 1;
} else if (ar[i].num == ar[i - 1].num + 1 &&
C[ar[i].num] <= C[ar[i - 1].num]) {
R[ar[i].id] = 1;
} else {
ok = false;
break;
}
}
if (!ok)
cout << -1 << endl;
else {
cout << ma << endl;
for (int i = 0; i < n; i++) cout << R[i] << " ";
cout << endl;
}
} else
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
int32_t main() {
int n;
cin >> n;
vector<int> a(n), cnt((int)1e5 + 5);
for (int &i : a) {
cin >> i;
cnt[i]++;
}
for (__typeof(((int)cnt.size())) i = (2) - ((2) > (((int)cnt.size())));
i != (((int)cnt.size())) - ((2) > (((int)cnt.size())));
i += 1 - (((2) > (((int)cnt.size()))) << 1)) {
if (cnt[i] > cnt[i - 1]) {
cout << -1 << "\n";
return 0;
}
}
vector<int> res(n);
cnt = vector<int>(1e5 + 5);
int mx = 1;
for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));
i += 1 - (((0) > (n)) << 1)) {
cnt[a[i]]++;
res[i] = cnt[a[i]];
mx = max(mx, res[i]);
}
cout << mx << "\n";
for (int i : res) cout << i << ' ';
cout << "\n";
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.