competitive_programming_progress/1490B.cpp at master · YolgeSanchez/competitive_programming_progress · GitHub

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
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long
using namespace std;

void init_code() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  #ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  #endif
}

void solve() {
  int length, movements = 0, remaind[3] = {0,0,0};
  cin >> length;
  int nums[length];

  for (int i = 0; i < length; i++) {
    cin >> nums[i];
    ++remaind[nums[i]%3];
  }

  while (remaind[0] != remaind[1] || remaind[1] != remaind[2]) {
    if (remaind[1] > remaind[2]) {
      for (int i = 0; i < length; i++) {
        if (nums[i]%3 != 1) continue;

        ++nums[i];
        ++movements;
        --remaind[1];
        ++remaind[2];
        break;
      }
      continue;
    }

    if (remaind[2] > remaind[0]) {
      for (int i = 0; i < length; i++) {
        if (nums[i]%3 != 2) continue;

        ++nums[i];
        ++movements;
        --remaind[2];
        ++remaind[0];
        break;
      }
      continue;
    }

    if (remaind[0] > remaind[1]) {
      for (int i = 0; i < length; i++) {
        if (nums[i]%3 != 0) continue;

        ++nums[i];
        ++movements;
        --remaind[0];
        ++remaind[1];
        break;
      }
      continue;
    }

  }

  cout << movements << endl;

}

int main() {
  init_code();

  int t;
  cin >> t;
  while (t--) solve();

  return 0;
}