Pallo

#include <bits/stdc++.h>

typedef long long ll;

#define M 1000000007
#define N (1 << 18)

using namespace std;

void test_case() {
    ll n, m, k;
    cin >> n >> m >> k;

    pair<ll, ll> pos = {1, 1};
    pair<int, int> dir = {1, 1};

    ll ans = 0;

    for (int t = 0; t < k;) {
        //pos = {pos.first + dir.first, pos.second + dir.second};
        
        int rightdst = m - pos.first;
        int leftdst = pos.first - 1;

        int updst = pos.second - 1;
        int downdst = n - pos.second;

        int xdst = dir.first == 1 ? rightdst : leftdst;
        int ydst = dir.second == 1 ? downdst : updst;

        int travel = min(xdst, ydst);

        t += travel;

        /*if (travel == 0) {
            cout << "FAIL" << endl;
            break;
        }*/
        if (t > k) break;

        pos = {pos.first + travel * dir.first, pos.second + travel * dir.second};

        bool hit = 0;
        if (pos.first == m || pos.first == 1) {
            hit = 1;
            dir.first *= -1;
        }
        if (pos.second == n || pos.second == 1) {
            hit = 1;
            dir.second *= -1;
        }
        ans += hit;
    }

    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    for (int i = 0; i < t; ++i) {
        test_case();
        cout << "\n";
    }

    return 0;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED