/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 1ms 404.0 KiB
#3 Accepted 2ms 320.0 KiB
#4 Accepted 2ms 320.0 KiB
#5 Accepted 2ms 532.0 KiB
#6 Accepted 2ms 324.0 KiB
#7 Accepted 2ms 532.0 KiB

Code

#include <iostream>
using namespace std;

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    cin >> n;
    int cnt[3] = {0, 0, 0};
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      cnt[x % 3]++;
    }
    int ans = cnt[0] + cnt[1] + cnt[2];
    int tot = cnt[1] + 2 * cnt[2];
    if (tot % 3 == 1) {
      if (cnt[1])
        ans--;
      else
        ans -= 2;
    } else if (tot % 3 == 2) {
      if (cnt[2])
        ans--;
      else
        ans -= 2;
    }
    cout << ans << '\n';
  }
  return 0;
}

Information

Submit By
Type
Submission
Problem
P1013 Divisible by 3
Language
C++17 (G++ 13.2.0)
Submit At
2024-10-03 21:30:10
Judged At
2024-11-11 02:44:21
Judged By
Score
100
Total Time
2ms
Peak Memory
532.0 KiB