Bubble Cup V8 I Robots protection

View as PDF

Points: 30
Time limit: 0.6s
Memory limit: 512M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Company "Robots industries" produces robots for territory protection. Robots protect triangle territories – right isosceles triangles with catheti parallel to North-South and East-West directions.

Owner of some land buys and sets robots on his territory to protect it. From time to time, businessmen want to build offices on that land and want to know how many robots will guard it. You are to handle these queries.

Input Specification

The first line contains integer – width and height of the land, and integer – number of queries to handle.

Next lines contain queries you need to process.

Two types of queries:

1. – add a robot to protect a triangle. Depending on the value of dir, the values of and represent a different triangle:
• : Triangle is defined by the points
• : Triangle is defined by the points
• : Triangle is defined by the points
• : Triangle is defined by the points
2. – output how many robots guard this point (robot guards a point if the point is inside or on the border of its triangle)

Output Specification

For each second type query output how many robots guard this point. Each answer should be in a separate line.

Constraints

• All points of triangles are within range
• All values are positive integers

Example Input

17 10
1 1 3 2 4
1 3 10 3 7
1 2 6 8 2
1 3 9 4 2
2 4 4
1 4 15 10 6
2 7 7
2 9 4
2 12 2
2 13 8

Example output

2
2
2
0
1