/* http://usaco.org/index.php?page=viewproblem2&cpid=572# (create a free account) USACO 2015 December Silver Ques. 3: Breed Counting This code is not for Sololearn, I recommend onlinegdb.com or visual studio code Make a file named paint.in and put in: 6 3 2 1 1 3 2 1 1 6 3 3 2 4 Output: 3 2 1 1 0 0 2 0 1 I recommend not copying this code into USACO though it works cause you need to do it yourself. */ #include #include using namespace std; typedef long long ll; int main(){ ifstream fin("bcount.in"); ofstream fout("bcount.out"); ll n, q; fin >> n >> q; vector one, two, three; for(int i = 0; i < n; i++){ int b; fin >> b; if(b == 1){ one.push_back(1); two.push_back(0); three.push_back(0); } else if (b == 2) { one.push_back(0); two.push_back(1); three.push_back(0); } else { one.push_back(0); two.push_back(0); three.push_back(1); } } vector sum1, sum2, sum3; int tmp1 =0, tmp2 = 0, tmp3 = 0; sum1.push_back(0); sum2.push_back(0); sum3.push_back(0); for(int i = 0;i < n; i++){ tmp1 += one[i]; tmp2 += two[i]; tmp3 += three[i]; sum1.push_back(tmp1); sum2.push_back(tmp2); sum3.push_back(tmp3); } for(int i = 0; i < q; i++){ ll a, b; fin >> a >> b; int test1 = sum1[b] - sum1[a - 1], test2 = sum2[b] - sum2[a - 1], test3 = sum3[b] - sum3[a - 1]; fout << sum1[b] - sum1[a - 1] << " " << sum2[b] - sum2[a - 1] << " " << sum3[b] - sum3[a - 1] << endl; } fout.close(); fin.close(); return 0; }

USACO #28: Breed Counting C++