burek

input/code.cpp: In function 'int chx(int, int)':
input/code.cpp:17:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
input/code.cpp: In function 'int chy(int, int)':
input/code.cpp:23:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

#include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define LINF 999999999999999999LL
#define N (1<<20)
#define M 1000000007

using namespace std;

int vx[2 * N];
int vy[2 * N];

int chx (int k, int n) {
  k += N;
  vx[k] += n;
  for (k /= 2; k >= 1; k /= 2) vx[k] = vx[2 * k] + vx[2 * k + 1];
}

int chy (int k, int n) {
  k += N;
  vy[k] += n;
  for (k /= 2; k >= 1; k /= 2) vy[k] = vy[2 * k] + vy[2 * k + 1];
}

int gety (int k) {
  int a = 1;
  int b = k + N;
  int s = 0;
  while (a <= b) {
    if (a % 2 == 1) s += vy[a++];
    if (b % 2 == 0) s += vy[b--];
    a /= 2; b /= 2;
  }
  return s;
}

int getx (int k) {
  int a = 1;
  int b = k + N;
  int s = 0;
  while (a <= b) {
    if (a % 2 == 1) s += vx[a++];
    if (b % 2 == 0) s += vx[b--];
    a /= 2; b /= 2;
  }
  return s;
}

int main () {
  int n;
  cin>>n;
  for (int i = 0; i < n; i++) {
    int x1, y1, x2, y2, x3, y3;
    cin>>x1>>y1>>x2>>y2>>x3>>y3;
    int miy = min(min(y1, y2), y3);
    int may = max(max(y1, y2), y3);
    int mix = min(min(x1, x2), x3);
    int mx = max(max(x1, x2), x3);
    chx(mix + 1, 1);
    chx(mx, -1);
    chy(miy + 1, 1);
    chy(may, -1);
  }
  int q;
  cin>>q;
  for (int i = 0; i < q; i++) {
    char c, e;
    cin>>c>>e;
    int p;
    cin>>p;
    if (c == 'x') cout<<getx(p)<<endl;
    else cout<<gety(p)<<endl;
  }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED