fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define read(type) readInt<type>() // Fast read
  4. #define ll long long
  5. #define nL "\n"
  6. #define pb push_back
  7. #define mk make_pair
  8. #define pii pair<int, int>
  9. #define a first
  10. #define b second
  11. #define vi vector<int>
  12. #define all(x) (x).begin(), (x).end()
  13. #define umap unordered_map
  14. #define uset unordered_set
  15. #define MOD 1000000007
  16. #define imax INT_MAX
  17. #define imin INT_MIN
  18. #define exp 1e9
  19. #define sz(x) (int((x).size()))
  20.  
  21.  
  22. void solve() {
  23. int n; cin >> n;
  24. map<ll,ll> d;
  25.  
  26. for(auto i = 0; i < n; i++) {
  27. ll o; cin >> o;
  28. if (d.find(o) != d.end()) {
  29. d[o]++;
  30. } else {d[o] = 1;}
  31. }
  32.  
  33. int ans = 0;
  34.  
  35. int len = 1;
  36. pair<ll,ll> cur = *d.begin();
  37.  
  38. while((int)d.size() != 0) {
  39. if (len == 1) {cout << "Add one " << endl; ans++;}
  40. cout << "handing: " << cur.a << endl;
  41. if (d.find(cur.a+1) != d.end()) {
  42. cout << "found " << cur.a+1 << endl;
  43. cur = *d.find(cur.a+1);
  44.  
  45. d[cur.a-1]--;
  46. if (d[cur.a-1] <= 0) {d.erase(cur.a-1);}
  47.  
  48. len++;
  49. } else {
  50. cout << "Not found " << cur.a+1 << endl;
  51. d[cur.a]--;
  52. if (d[cur.a] <= 0) {d.erase(cur.a);}
  53. cur = *d.begin();
  54. len = 1;
  55. }
  56. }
  57.  
  58. cout << ans << endl;
  59.  
  60. }
  61.  
  62.  
  63.  
  64. int32_t main()
  65. {
  66. ios_base::sync_with_stdio(false);
  67. cin.tie(NULL);
  68. int t; cin >> t;
  69. while (t--) {
  70. solve();
  71. }
  72. return 0;
  73. }
Success #stdin #stdout 0.01s 5472KB
stdin
10
6
2 2 3 4 3 1
5
11 8 7 10 9
6
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
8
1 1 4 4 2 3 2 3
6
1 2 3 2 3 4
7
10 11 11 12 12 13 13
7
8 8 9 9 10 10 11
8
4 14 5 15 6 16 7 17
8
5 15 6 14 8 12 9 11
5
4 2 2 3 4
stdout
Add one 
handing: 1
found 2
handing: 2
found 3
handing: 3
found 4
handing: 4
Not found 5
Add one 
handing: 2
found 3
handing: 3
Not found 4
2
Add one 
handing: 7
found 8
handing: 8
found 9
handing: 9
found 10
handing: 10
found 11
handing: 11
Not found 12
1
Add one 
handing: 1000000000
Not found 1000000001
Add one 
handing: 1000000000
Not found 1000000001
Add one 
handing: 1000000000
Not found 1000000001
Add one 
handing: 1000000000
Not found 1000000001
Add one 
handing: 1000000000
Not found 1000000001
Add one 
handing: 1000000000
Not found 1000000001
6
Add one 
handing: 1
found 2
handing: 2
found 3
handing: 3
found 4
handing: 4
Not found 5
Add one 
handing: 1
found 2
handing: 2
found 3
handing: 3
found 4
handing: 4
Not found 5
2
Add one 
handing: 1
found 2
handing: 2
found 3
handing: 3
found 4
handing: 4
Not found 5
Add one 
handing: 2
found 3
handing: 3
Not found 4
2
Add one 
handing: 10
found 11
handing: 11
found 12
handing: 12
found 13
handing: 13
Not found 14
Add one 
handing: 11
found 12
handing: 12
found 13
handing: 13
Not found 14
2
Add one 
handing: 8
found 9
handing: 9
found 10
handing: 10
found 11
handing: 11
Not found 12
Add one 
handing: 8
found 9
handing: 9
found 10
handing: 10
Not found 11
2
Add one 
handing: 4
found 5
handing: 5
found 6
handing: 6
found 7
handing: 7
Not found 8
Add one 
handing: 14
found 15
handing: 15
found 16
handing: 16
found 17
handing: 17
Not found 18
2
Add one 
handing: 5
found 6
handing: 6
Not found 7
Add one 
handing: 8
found 9
handing: 9
Not found 10
Add one 
handing: 11
found 12
handing: 12
Not found 13
Add one 
handing: 14
found 15
handing: 15
Not found 16
4
Add one 
handing: 2
found 3
handing: 3
found 4
handing: 4
Not found 5
Add one 
handing: 2
Not found 3
Add one 
handing: 4
Not found 5
3