Problem p01284 (C++) — buggy submission, verdict: Time Limit Exceeded

#include "bits/stdc++.h"

#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#define DUMP(v)                                                                \\
  REP(aa, (v).size()) {                                                        \\
    cout << v[aa];                                                             \\
    if (aa != v.size() - 1)                                                    \\
      cout << " ";                                                             \\
    else                                                                       \\
      cout << endl;                                                            \\
  }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};

using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int t;
  while (cin >> t, t) {
    vi v(t);
    REP(i, t) cin >> v[i];
    int n;
    cin >> n;
    vi d(100, INF);
    REP(i, n) {
      int a, b;
      cin >> a >> b;
      if (d[a - 1] == INF)
        d[a - 1] = b;
      else
        d[a - 1] = min(b, d[a - 1]);
    }
    int p = 100, cnt = 0;
    while (p != 0) {
      REP(i, p) {
        int flag = 1;
        FOR(j, i, p) {
          if (v[(j - i) % t] > d[j])
            flag = 0;
        }
        if (flag) {
          p = i;
          break;
        }
      }

      cnt++;
    }
    cout << cnt - 1 << endl;
  }
}

Error: TLE

Fixed submission:

#include "bits/stdc++.h"

#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#define DUMP(v)                                                                \\
  REP(aa, (v).size()) {                                                        \\
    cout << v[aa];                                                             \\
    if (aa != v.size() - 1)                                                    \\
      cout << " ";                                                             \\
    else                                                                       \\
      cout << endl;                                                            \\
  }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};

using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int t;
  while (cin >> t, t) {
    vi v(t);
    REP(i, t) cin >> v[i];
    int n;
    cin >> n;
    vi d(100, INF);
    REP(i, n) {
      int a, b;
      cin >> a >> b;
      d[a - 1] = b;
    }
    int p = 100, cnt = 0;
    while (p != 1) {
      REP(i, p) {
        int flag = 1;
        FOR(j, i, p) {
          if (v[(j - i) % t] > d[j])
            flag = 0;
        }
        if (flag) {
          p = i;
          break;
        }
      }

      cnt++;
    }
    cout << cnt << endl;
  }
}