The Great ATM Robbery

Limits

Subtask 1 (20%): 1 ≤ N, M ≤ 300.

Subtask 2 (30%): 1 ≤ N, M ≤ 3000.

Subtask 3 (50%): 1 ≤ N, M ≤ 500000.

Subtask 4 (0%): Sample Testcase



Submitting to 'The Great ATM Robbery'


You're not logged in! Click here to login


Submitting to 'The Great ATM Robbery'


You're not logged in! Click here to login


Submitting .cpp to 'The Great ATM Robbery'


You're not logged in! Click here to login


Compile Errors


							
Time Limit: 1.5 Seconds
Memory Limit: 256MB
No. of ACs: 6
Your best score: 0
Source: APIO 2009

Subtask Score
1 20
2 30
3 50
4 0