QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 256 MB Total points: 100

#22739. Ampliare i fienili

Statistics

John ha $N$ fienili rettangolari ($1\le N\le25{,}000$), lati paralleli a $X,Y$, angoli interi in $0..1,000,000$. Non si sovrappongono, ma possono condividere angoli o lati.

Più mucche da mungere quest’anno, vuole ampliare. Possibile senza angolo o parete comune: tutte quattro pareti possono spostarsi un poco fuori senza collisione. Due che toccano in angolo non possono ampliarsi.

Determinate quanti possono ampliarsi.

Input

Riga 1: intero $N$.

Righe $2..N+1$: interi $A,B,C,D$ separati da spazi, inferiore sinistro $(A,B)$, superiore destro $(C,D)$.

Output

Riga 1: intero, numero ampliabile.

Esempi

Input 1

5
0 2 2 7
3 5 5 8
4 2 6 4
6 1 8 6
0 0 8 1

Output 1

2

Nota

Nota

Spiegazione dell’esempio:

5 fienili; primo inferiore sinistro $(0,2)$, superiore destro $(2,7)$, ecc.

Solo primi due nell’input ampliabili. Ogni altro tocca almeno un fienile.

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.