[Codeforces] Round #630 (Div. 2) B. Composite Coloring

Codeforces Round #630 (Div. 2) B. Composite Coloring

  • Time : O(n)
  • Space : O(n)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <bits/stdc++.h>

#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")//Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

struct PairHash {
inline std::size_t operator()(const std::pair<int, int> &v) const { return v.first * 31 + v.second; }
};

#define M_PI 3.14159265358979323846 /* pi */
#define MAX_N 202020
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define umll unordered_map<ll,ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)

ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }

using namespace std;
ll p[] = {2,3,5,7,11,13,17,19,23,29,31};

pair<ll, vll> solve(vll A) {
ll n = A.size();
ll res = 0;
vll use[11];
for(ll i = 0; i < n; i++) {
for(ll j = 0; j < 11; j++) {
if(A[i] % p[j] == 0) {
A[i] = j + 1;
use[j].push_back(i);
break;
}
}
}
for(ll i = 0; i < 11; i++) {
if(use[i].empty()) {
for(ll j = i + 1; j < 11; j++) {
if(!use[j].empty()) {
for(auto& k : use[j]) {
A[k] = i + 1;
use[i].push_back(k);
}
use[j].clear();
break;
}
}
}
if(!use[i].empty())
res = i + 1;
}

return {res, A};
}

int main() {
ios_base::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(0);
cout.precision(12);
ll tc = 1;
cin>>tc;
for (ll i = 1; i <= tc; i++) {
ll n;
cin>>n;
vll A(n);
for(ll j = 0; j < n; j++) cin>>A[j];
auto res = solve(A);
cout<<res.first<<endl;
for(auto& r : res.second)cout<<r<<' '; cout<<endl;
}
return 0;
}
Author: Song Hayoung
Link: https://songhayoung.github.io/2022/06/24/PS/Codeforces/div2-630-b/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.