Pizzeriat

input/code.cpp: In function 'void buildTrees(int)':
input/code.cpp:14:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < treeAsc[layer-1].size(); i++){
                    ^
input/code.cpp:18:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(i == treeAsc[layer-1].size())
          ^

#include <iostream>
#include <vector>

using namespace std;

int n, q;

vector <int> treeAsc[100];
vector <int> treeDesc[100];

bool isRight(int x) { return x % 2; }

void buildTrees(int layer){
  for(int i = 0; i < treeAsc[layer-1].size(); i++){
    treeAsc[layer].push_back(treeAsc[layer-1][i]);
    treeDesc[layer].push_back(treeDesc[layer-1][i]);
    i++;
    if(i == treeAsc[layer-1].size())
      break;
    treeAsc[layer][i/2] = min(treeAsc[layer][i/2], treeAsc[layer-1][i]);
    treeDesc[layer][i/2] = min(treeDesc[layer][i/2], treeDesc[layer-1][i]);
  }
  if(treeAsc[layer].size() > 1)
    buildTrees(layer+1);
}

pair <int, int> childrenOf(int layer, int node){ return {(1 << layer)*node, (1 << layer)*(node+1)}; }

int queryAsc(int b, int layer, int node, bool up){
  pair<int, int> c = childrenOf(layer, node);
  if(layer == -1)
    return 0;
  if(c.second == b)
    return treeAsc[layer][node];
  if(up){
    if(c.second > b){
      return queryAsc(b, layer, node, false);
    }else{
      if(isRight(node))
        return min(treeAsc[layer][node], queryAsc(b, layer+1, (node/2)+1, true));
      else
        return queryAsc(b, layer+1, (node/2), true);
    }
  }else{
    if(c.second > b){
      return queryAsc(b, layer-1, node*2, false);
    }else{
      return min(treeAsc[layer][node], queryAsc(b, layer-1, (node+1)*2, false));
      }
  }
}


int queryDesc(int b, int layer, int node, bool up){
  pair<int, int> c = childrenOf(layer, node);
  if(layer == -1)
    return 0;
  if(c.second == b)
    return treeDesc[layer][node];
  if(up){
    if(c.second > b){
      return queryDesc(b, layer, node, false);
    }else{
      if(isRight(node))
        return min(treeDesc[layer][node], queryDesc(b, layer+1, (node/2)+1, true));
      else
        return queryDesc(b, layer+1, (node/2), true);
    }
  }else{
    if(c.second > b){
      return queryDesc(b, layer-1, node*2, false);
    }else{
      return min(treeDesc[layer][node], queryDesc(b, layer-1, (node+1)*2, false));
      }
  }
}

int main(){
  cin >> n >> q;
  for(int i = 0; i < n; i++){
    int t;
    cin >> t;
    treeAsc[0].push_back(t+i);
    treeDesc[0].push_back(t+(n-i)-1);
  }
  buildTrees(1);
  /*
  for(int i = 0; i < 17; i++){
    for(int k : treeAsc[i])
      cout << k << " ";
    cout << endl;
  }
  for(int i = 0; i < 17; i++){
    for(int k : treeDesc[i])
      cout << k << " ";
    cout << endl;
  }*/
  for(int w = 0; w < q; w++){
    char c;
    cin >> c;

      int k;
      cin >> k;
      k--;
      cout << min(queryAsc(n, 0, k, true)-k, queryDesc(k+1, 0, 0, true) - (n-k-1)) << endl;
  }
}

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