Submission #8461454
Source Code Expand
N{++c>N?B[$1]=$2+1:A[$2]=$1+1}!N{N=$1} END{for(;i<c;)for(j=B[i++];j-->0;)A[j]&&A[j]<i&&j*=A[j]=!++s;print+s}
Submission Info
Submission Time | |
---|---|
Task | C - 2D Plane 2N Points |
User | kotatsugame |
Language | Awk (mawk 1.3.3) |
Score | 400 |
Code Size | 109 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 380 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example_0, example_1, example_2, example_3, example_4 |
All | example_0, example_1, example_2, example_3, example_4, line_0, line_1, line_2, line_3, maxrand_0, maxrand_1, maxrand_2, maxrand_3, maxrand_4, rand_0, rand_1, rand_2 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_0 | AC | 4 ms | 380 KB |
example_1 | AC | 1 ms | 256 KB |
example_2 | AC | 1 ms | 256 KB |
example_3 | AC | 1 ms | 256 KB |
example_4 | AC | 1 ms | 256 KB |
line_0 | AC | 1 ms | 256 KB |
line_1 | AC | 2 ms | 256 KB |
line_2 | AC | 1 ms | 256 KB |
line_3 | AC | 1 ms | 256 KB |
maxrand_0 | AC | 1 ms | 256 KB |
maxrand_1 | AC | 1 ms | 256 KB |
maxrand_2 | AC | 1 ms | 256 KB |
maxrand_3 | AC | 1 ms | 256 KB |
maxrand_4 | AC | 1 ms | 256 KB |
rand_0 | AC | 1 ms | 256 KB |
rand_1 | AC | 1 ms | 256 KB |
rand_2 | AC | 1 ms | 256 KB |