Submission #3183144
Source Code Expand
// ~/BAU/ACM-ICPC/Teams/Rampage/Corvus // ~/sudo apt-get verdict Accpeted #include <iostream> #include <stdio.h> #include <stdlib.h> #include <time.h> #include <memory.h> #include <limits.h> #include <math.h> #include <string.h> #include <string> #include <cstring> #include <algorithm> #include <vector> #include <queue> #include <stack> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <bitset> #include <functional> using namespace std; typedef long long ll; typedef unsigned long long ull; const int N = 205; const ll MOD = 1e9 + 7; const double eps = 1e-9; struct cmp { bool operator()(const vector<ll> &a, const vector<ll> &b) const { for (int i = 1; i < a.size(); i++) { if (a[i] - a[i - 1] != b[i] - b[i - 1]) return a[i] - a[i - 1] < b[i] - b[i - 1]; } return false; } }; int n; ll k, a[N]; map<vector<ll>, vector<pair<ll, ll> >, cmp> mp; inline int count(ll x) { int c = 0; while (x) { c++; x -= (x & -x); } return c; } vector<ll> calcDiff(vector<ll> &v) { vector<ll> r; for (int i = 1; i < v.size(); i++) r.push_back(v[i] - v[i - 1]); return r; } int main() { scanf("%d%lld", &n, &k); for (int i = 0; i < n; i++) scanf("%lld", a + i); sort(a, a + n); for (ll d = 0; d <= min(60ll, k); d++) { ll msk = (1ll << d) - 1; vector<ll> v; v.push_back(-1); for (int i = 0; i < n; i++) v.push_back(a[i] & msk); sort(v.begin(), v.end()); v.resize(unique(v.begin(), v.end()) - v.begin()); for (int i = 1; i < (int)v.size(); i++) { ll pre = v[i - 1] + 1, cur = v[i], val = pre; for(ll j=60; j>=0; j--) if (pre >> j != cur >> j) { if (pre >> j << j == pre) val = pre; else val = cur >> j << j; break; } ll rem = k - d - count(val); if (rem < 0) continue; vector<ll> v2; for (int j = 0; j < n; j++) v2.push_back((a[j] - val) >> d); if (v2[0] < 0) continue; mp[v2].push_back(make_pair(max(0ll,v2[0]-rem), v2[0])); } } int ans = 0; for (auto it = mp.begin(); it != mp.end(); it++) { vector<pair<ll, ll> > v = it->second; sort(v.begin(), v.end()); ll last = v[0].first - 1; for (int i = 0; i < (int)v.size(); i++) { ll l = max(last + 1, v[i].first), r = v[i].second; if (l <= r) ans = (ans + (r - l + 1)) % MOD; last = max(last, r); } } printf("%d\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Shift and Decrement |
User | Corvus |
Language | C++14 (GCC 5.4.1) |
Score | 1200 |
Code Size | 2451 Byte |
Status | AC |
Exec Time | 33 ms |
Memory | 16512 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:65:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%lld", &n, &k); ^ ./Main.cpp:67:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld", a + i); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1200 / 1200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt, sample4.txt |
All | sample1.txt, sample2.txt, sample3.txt, sample4.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 4.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
1.txt | AC | 29 ms | 14336 KB |
10.txt | AC | 25 ms | 11776 KB |
11.txt | AC | 20 ms | 6272 KB |
12.txt | AC | 20 ms | 6016 KB |
13.txt | AC | 23 ms | 9216 KB |
14.txt | AC | 10 ms | 5376 KB |
15.txt | AC | 5 ms | 2560 KB |
16.txt | AC | 21 ms | 6784 KB |
17.txt | AC | 27 ms | 12544 KB |
18.txt | AC | 26 ms | 12032 KB |
19.txt | AC | 20 ms | 5888 KB |
2.txt | AC | 31 ms | 15744 KB |
20.txt | AC | 21 ms | 6272 KB |
21.txt | AC | 28 ms | 14592 KB |
22.txt | AC | 14 ms | 4480 KB |
23.txt | AC | 30 ms | 14848 KB |
24.txt | AC | 31 ms | 16384 KB |
25.txt | AC | 33 ms | 16000 KB |
26.txt | AC | 23 ms | 7808 KB |
27.txt | AC | 28 ms | 13696 KB |
28.txt | AC | 30 ms | 15744 KB |
29.txt | AC | 26 ms | 12544 KB |
3.txt | AC | 32 ms | 16512 KB |
30.txt | AC | 15 ms | 4864 KB |
31.txt | AC | 31 ms | 11008 KB |
32.txt | AC | 26 ms | 12032 KB |
33.txt | AC | 19 ms | 5504 KB |
34.txt | AC | 21 ms | 6656 KB |
35.txt | AC | 26 ms | 11904 KB |
36.txt | AC | 5 ms | 2560 KB |
37.txt | AC | 20 ms | 6272 KB |
38.txt | AC | 21 ms | 6528 KB |
39.txt | AC | 26 ms | 12416 KB |
4.txt | AC | 23 ms | 7808 KB |
40.txt | AC | 25 ms | 10752 KB |
41.txt | AC | 20 ms | 6272 KB |
42.txt | AC | 20 ms | 5632 KB |
43.txt | AC | 26 ms | 13184 KB |
44.txt | AC | 14 ms | 4480 KB |
5.txt | AC | 28 ms | 14080 KB |
6.txt | AC | 30 ms | 15488 KB |
7.txt | AC | 28 ms | 13824 KB |
8.txt | AC | 15 ms | 4480 KB |
9.txt | AC | 26 ms | 12416 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
sample4.txt | AC | 2 ms | 384 KB |