Pallo

input/code.cpp: In function 'int main()':
input/code.cpp:58:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(d > k){
                ~~^~~
input/code.cpp:112:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(d > k){
                    ~~^~~

#include <bits/stdc++.h>
#define ll long long
using namespace std;

#define fr(x) for(ll i = 0; i < x; i++)

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    ll t, n, m, cycle, moves, x, y, changes, d;

    unsigned ll k;

    cin >> t;

    fr(t)
    {
        cin >> n >> m >> k;

        x = y = 1;

        ll dv, dp;
        dv = 1; dp = 1;
        d = 0;
        moves = cycle = changes = 0;

        bool first = true;
        while(true)
        {
            if(((x == 1 && y == 1) || (x == 1 && y == n) || (x == m && y == 1) || (x == m && y == n)) && !first){
                cycle = changes;
                
                break;
            }
            if(first){
                first = false;
            }

            if(dv == 1){
                if(dp == 1){
                    d = min(m-x, n-y);
                }
                else{
                    d = min(m-x, y-1);
                }
            }
            else{
                if(dp == 1){
                    d = min(x-1, n-y);
                }
                else{
                    d = min(x-1, y-1);
                }
            }

            if(d > k){
                break;
            }
            moves += d;
            ++changes;
            k -= d;

            x += dv * d; y += dp * d;

            if(x == 1 || x == m){
                dv *= -1;
            }
            if(y == 1 || y == n){
                dp *= -1;
            }

        }
        ll cyclesleft = 0;
        if(cycle > 0){
            changes += (k/moves) * cycle;
            cyclesleft = k/moves;
            k -= (k/moves) * moves;
        }

        if(k > 0){
            if(cyclesleft % 2 == 1){
                x = y = 1;
                dv = 1; dp = 1;
            }

            while(true)
            {
                
                if(first){
                    first = false;
                }

                if(dv == 1){
                    if(dp == 1){
                        d = min(m-x, n-y);
                    }
                    else{
                        d = min(m-x, y-1);
                    }
                }
                else{
                    if(dp == 1){
                        d = min(x-1, n-y);
                    }
                    else{
                        d = min(x-1, y-1);
                    }
                }

                if(d > k){
                    break;
                }
                moves += d;
                ++changes;
                k -= d;

                x += dv * d; y += dp * d;

                if(x == 1 || x == m){
                    dv *= -1;
                }
                if(y == 1 || y == n){
                    dp *= -1;
                }

            }
        }
        cout << changes << endl;

    }
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED