MSE06H - Japan

Japan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M cities on the West coast (M ≤ 1000, N ≤ 1000). K superhighways will be build. Cities on each coast are numbered 1, 2, ... from North to South. Each superhighway is straight line and connects city on the East coast with city of the West coast.

The funding for the construction is guaranteed by ACM. A major portion of the sum is determined by the number of crossings between superhighways. At most two superhighways cross at one location. Write a program that calculates the number of the crossings between superhighways.


The input file starts with T - the number of test cases. Each test case starts with three numbers – N, M, K. Each of the next K lines contains two numbers – the numbers of cities connected by the superhighway. The first one is the number of the city on the East coast and second one is the number of the city of the West coast.


For each test case write one line on the standard output:

Test case "case number": "number of crossings"


3 4 4
1 4
2 3
3 2
3 1

Test case 1: 5

hide comments
karthik1997: 2018-01-05 08:17:01

Fast I/O + sort + 1D BIT (0.06s )
Fast I/O + sort + 1D Segment Tree (0.12s )
Fast I/O + no sort + 2D Segment Tree(TLE) :(
Makes me wonder , if there is any faster approach :O , since people solved it much faster

Last edit: 2018-01-05 08:26:02
shiv2111: 2018-01-03 07:35:52

Printing "Test Case" cause 10 WA

br4in1: 2017-11-15 12:07:46

simple dp

sfialok98: 2017-06-05 21:58:36

Solved Using 2D BIT...

flyingduchman_: 2017-03-28 18:26:24

Java tle, c++ ac

blackbird_: 2017-01-05 02:37:51

code with C++ is accepted, but the same code with Python 3 get TLE. Why ?!

cat_got_bored: 2016-11-01 18:34:41

Just a warning, k can be as big as 10^6. Didn't notice and got some stupid RTEs :-(

tni_mdixit: 2016-10-27 21:09:56

using the simple counting approach by structure (O(m*n)) , getting tle...
do i need any specific algo or brute force is enough.

Ahmed Osama: 2016-08-13 19:33:36

I got WA because of using %I64d instead of %lld

Bhuvnesh Jain: 2016-05-24 18:38:52

No need to sort or use BIT, complexity is O(n*m) per test case

Added by:~!(*(@*!@^&
Time limit:0.124s-0.209s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Southeastern European 2006