USACO · 1228

Counting Liars

This C++ solution uses string processing for USACO 1228 Counting Liars. Read the reasoning, inspect the code, or try your own test case below.

1228Implementation & simulationString processingC++29 lines
Solution060of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

String processing

Counting Liars matches L/G threshold claims and minimizing the number of inconsistent cows; the code evaluates the relevant thresholds.

Implementation & simulation

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

counting_liars.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        int n, mx = -1;
        cin >> n;
        vector<pair<string, int>> v;
        for(int i = 0; i < n; i++){
            string c;
            int x;
            cin >> c >> x;
            if(x > mx) mx = x;
            v.emplace_back(c, x);
        }
        int ans = n;
        for(auto[a, b] : v){
            int cnt = 0;
            for(auto[x, y] : v){
                if(x == "L" && b > y) cnt++;
                else if(x == "G" && b < y) cnt++;
            }
            ans = min(ans, cnt);
        }
        cout << ans << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.