DMOJ · aac2p2

An Animal Contest 2 P2 - Koala Party

This C++ solution uses sorting & greedy for DMOJ aac2p2 An Animal Contest 2 P2 - Koala Party. Read the reasoning, inspect the code, or try your own test case below.

aac2p2Implementation & simulationSorting & greedyC++39 lines
Solution124of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Sorting & greedy

Koala Party arithmetic-progression counting condition matches the implementation.

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

P_2_Koala_Party.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1LL << 60; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n; cin >> n;
        if (n == 2) {
            int s = 0;
            for (int i = 0; i < n; i++) {
                int x; cin >> x;
                s += x;
            }
            cout << (s & 1 ? 1 : 2) << '\n';
        } else {
            vector<int> v(n);
            for (int i = 0; i < n; i++) cin >> v[i];
            sort(v.begin(), v.end());
            for (int i = 1; i < n - 1; i++) {
                int l = i - 1, r = i + 1;
                while (l >= 0 && r < v.size()) {
                    ll s = v[l] + v[r];
                    ll mid = 2LL * v[i];
                    if (s == mid) {
                        cout << 3 << '\n';
                        return 0;
                    } else if (s < mid) {
                        r++;
                    } else {
                        l--;
                    }
                }
            }
            cout << 2 << '\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.