Pizzeriat

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define M 1000000007

using namespace std;


ll n, q, a, b, c, f, npv[101010], npo[101010];
vector<ll> v;

int main() {
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(0);
	cin >> n >> q;
	v.push_back(0);
	for(int i=0; i<n; i++) {
		cin >> f;
		v.push_back(f);
	}
	npv[1] = v[1];
	for(int i=2; i<=n; i++) {
		npv[i] = min(npv[i-1]+1, v[i]);
	}
	npo[n] = v[n];
	for(int i=n-1; i>=1; i--) {
		npo[i] = min(npo[i+1]+1, v[i]);
	}
	for(int i=0; i<q; i++) {
		cin >> a;
		if(a==2) {
			cin >> b;
		cout << min(npv[b], npo[b]) << "\n";
		} else {
			cin >> a >> b;
		}
	}
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 2

Verdict: ACCEPTED

Test 5

Group: 2

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: WRONG ANSWER

Test 8

Group: 3

Verdict: WRONG ANSWER

Test 9

Group: 3

Verdict: WRONG ANSWER