-
Notifications
You must be signed in to change notification settings - Fork 0
/
D.cpp
114 lines (99 loc) · 2.28 KB
/
D.cpp
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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
//https://codeforces.com/contest/1303/problem/D
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vpi> vvpi;
typedef vector<vpl> vvpl;
typedef set<int> si;
typedef multiset<int> msi;
typedef set<ll> sl;
typedef multiset<ll> msl;
#define clrcin cin.ignore(numeric_limits<streamsize>::max(),'\n');
#define GOGOGO ios::sync_with_stdio(false); cin.tie(nullptr);
#define BYEBYE return 0;
#define all(cn) (cn).begin(), (cn).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repk(i, k, n) for(int i = k; i < n; ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define popcnt __builtin_popcount
#define gcd std::__detail::__gcd
#define lcm std::__detail::__lcm
const int INFI = 1e9 + 5;
const ll INFL = 4e18 + 5;
const int maxlog = 61;
int p[maxlog + 1] = { 0 };
void solve()
{
ll n; cin >> n;
ll sm = 0;
int out = 0;
int m; cin >> m;
rep(i, maxlog)
{
p[i] = 0;
}
int cur;
rep(i, m)
{
cin >> cur;
sm += cur;
int ci = 0;
while (cur >>= 1) {ci++;}
p[ci]++;
}
if (sm < n)
{
cout << -1 << endl;
return;
}
// it is possible
int moves = 0;
rep(i, maxlog)
{
if (!(n & ((ll)1 << (ll)i)))
{
p[i+1] += p[i] / 2;
}
else
{
if (p[i])
{
p[i]--;
p[i+1] += p[i] / 2;
}
else
{
// find highest non used power
// this hamortizes complexity its fine
int ccc = i;
int of = 1;
while(!p[++ccc]) { p[ccc] = 1; of++;}
// cout << i << " " << of << endl;
out += of;
p[ccc]--;
}
}
}
cout << out << endl;
}
int main()
{
GOGOGO
int t; cin >> t;
while(t--)
{
solve();
}
BYEBYE
}