Pizzeriat

#include <iostream>

using namespace std;

int n, q;

int p[100000];

int main(){
  cin >> n >> q;
  for(int i = 0; i < n; i++){
    int t;
    cin >> t;
    p[i] = t;
  }
  for(int i = 0; i < q; i++){
    char c;
    cin >> c;
    if(c == '2'){
      int tgt;
      cin >> tgt;
      tgt--;
      int m = p[0] + tgt;
      for(int t = 1; t < n; t++){
        m = min(m, p[t] + abs(tgt - t));
      }
      cout << m << endl;
    }else{
      int a, b;
      cin >> a >> b;
      p[a-1] = b;
    }
  }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED