Codeforces Round #565 (Div. 3) B

最新推荐文章于 2022-03-07 15:26:07 发布

weixin_34384557

最新推荐文章于 2022-03-07 15:26:07 发布

阅读量108

点赞数

原文链接：http://www.cnblogs.com/Vampire6/p/11001324.html

版权

本文解析了CodeForces上B.Mergeit！题目的解题思路，介绍了如何通过操作数组元素使其包含尽可能多的3的倍数。通过记录数组中模3余1和余2的元素数量，实现最优的元素组合策略。

摘要由CSDN通过智能技术生成

B. Merge it！

题目链接：http://codeforces.com/contest/1176/problem/B

题目

You are given an array a consisting of n integers a1,a2,…,an

In one operation you can choose two elements of the array and replace them with the element equal to their sum (it does not matter where you insert the new element). For example, from the array [2,1,4]
you can obtain the following arrays: [3,4], [1,6] and [2,5]

Your task is to find the maximum possible number of elements divisible by 3

that are in the array after performing this operation an arbitrary (possibly, zero) number of times.

You have to answer t independent queries.
Input
The first line contains one integer t (1≤t≤1000) — the number of queries.

The first line of each query contains one integer n
(1≤n≤100).

The second line of each query contains n
integers a1,a2,…,an (1≤ai≤109).
Output

For each query print one integer in a single line — the maximum possible number of elements divisible by 3

that are in the array after performing described operation an arbitrary (possibly, zero) number of times.
Example

Input
2
5
3 1 2 3 1
7
1 1 1 1 1 2 2

Output
3
3

Note

In the first query of the example you can apply the following sequence of operations to obtain 3
elements divisible by 3: [3,1,2,3,1]→[3,3,3,1]

In the second query you can obtain 3
elements divisible by 3 with the following sequence of operations: [1,1,1,1,1,2,2]→[1,1,1,1,2,3]→[1,1,1,3,3]→[2,1,3,3]→[3,3,3].

题意

给你一个数组，可以相加任意两个数，让你输出相加任意次数后该数组里的数是3的倍数的个数

思路

3=1+2，所以记录该数组里%3为1的个数了，和%3为2的个数了，之后就可以算结果了，别忘了还存在三个%3为1或2的相加也是3的倍数。

//
// Created by hjy on 19-6-5.
//
#include<bits/stdc++.h>

using namespace std;
const int maxn = 2e5 + 10;
int main()
{

    int T;
    cin>>T;
    while(T--)
    {
        int t;
        cin>>t;
        int x;
        vector<int>sh,ch;
        int sum=0;
        for(int i=0;i<t;i++)
        {
            cin>>x;
            if(x%3==0)
                sum++;
            else
                sh.push_back(x%3);
        }
        int _1=0,_2=0;

        for(int i=0;i<sh.size();i++)
        {
        if(sh[i]==1)_1++;
        else _2++;
        }
           cout<<sum+min(_1,_2)+(max(_1,_2)-min(_1,_2))/3<<endl;
    }
    return 0;
}