Pallo

#include <iostream>
#include <vector>
#include<algorithm>
#include <map>
using namespace std;
using ll = long long;
vector<pair<ll,ll>> reitti;
map<pair<ll,ll>, ll> ma;

int main() {
  ll t;
  cin >> t;
  for (int h = 0; h < t; ++h) {
    ll n, m, k;
    ll p = 0;
    ll mutkat = 0;
    cin >> n >> m >> k;
    ll suunta = 0;
    pair<ll,ll> me = {1,1};
    while (p <= k) {
      //cout << me.first << " " << me.second << endl;
      reitti.push_back(me);
      if (suunta == 1) {
        ma[me] = m - me.second;
        if (ma[me] == 0) {
          break;
        }
        p += ma[me];
        me = {me.first - ma[me], me.second + ma[me]};
      }
      else if (suunta == 3) {
        ma[me] = me.second - 1;
        if (ma[me] == 0) break;
        p += ma[me];
        me = {me.first + ma[me], me.second - ma[me]};
      }
      else if (suunta == 2) {
        ma[me] = me.first - 1;
        if (ma[me] == 0) break;
        p += ma[me];
        me = {me.first - ma[me], me.second - ma[me]};
      }
      else if (suunta == 0) {
        ma[me] = n - me.first;
        if (ma[me] == 0) break;
        p += ma[me];
        me = {me.first + ma[me], me.second + ma[me]};
      }
      mutkat++;
      suunta ++;
      suunta = suunta%4;
      //cout << ma[reitti.back()] << " l " << mutkat << endl;
    }
    ll vastaus = 0;
    //cout << me.first << " loppu " << me.second << endl;
    if (!(me.first == 1 && me.second == m) && !(me.first == n && me.second == 1) && !(me.first == n && me.second == m)) {
      //cout << "lol" << endl;
      vastaus = mutkat - 1;
    }
    else {
      if (k % p == 0) vastaus = (k / p) * mutkat ;
      else {
        ll ka = k % p;
        vastaus = (k / p) * mutkat;
        if (vastaus % 2 == 0) {
          ll pa = 0;
          ll l = 0;
          for (auto u : reitti) {
            pa += ma[u];
            l ++;
            if (pa > ka) break;
          }
          vastaus += l - 1;
        }
        else {
          ll ka = k % p;
          vastaus = k / p;
          if (vastaus % 2 == 0) {
            ll pa = 0;
            ll l = 0;
            for (int i = reitti.size()-1; i >= 0; i--) {
              auto u = reitti[i];
              pa += ma[u];
              l ++;
              if (pa > ka) break;
            }
            vastaus += l - 1;
          }
        }
      }
    }
    cout << vastaus << endl;
  }
  for (auto x : ma) {
    ma[x.first] = 0;
  }
  for (int i = reitti.size() - 1; i >= 0; i--) reitti.pop_back();
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED