CSES - Aalto Competitive Programming 2024 - wk2 - Homework - Results
Submission details
Task:Apartments
Sender:aarol
Submission time:2024-09-05 17:52:57 +0300
Language:Rust
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5--details
#6--details
#7--details
#8--details
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13--details
#14--details
#15--details
#16--details
#17ACCEPTED0.02 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails

Code

fn main() {
    let input = std::io::stdin().lines().next().unwrap().unwrap();

    let parts: Vec<_> = input.split(" ").collect();
    let k: i64 = parts[2].parse().unwrap();

    let input = std::io::stdin().lines().next().unwrap().unwrap();
    let mut applicants: Vec<i64> = input.split(" ").map(|a| a.parse().unwrap()).collect();
    let input = std::io::stdin().lines().next().unwrap().unwrap();
    let mut apartments: Vec<i64> = input.split(" ").map(|a| a.parse().unwrap()).collect();

    applicants.sort_unstable();
    apartments.sort_unstable();
    
    let mut result = 0;

    while apartments.len() > 0{
        let apartment = apartments.remove(0);
        while applicants.len() > 0 {
            let applicant = applicants[0];
            if (apartment - applicant).abs() <= k {
                applicants.remove(0);
                result += 1;
                break;
            }
            if applicant - apartment < k {
                applicants.remove(0);
            } else if apartment - applicant < k {
                break;
            }

        }
    }
    println!("{result}");
}

Test details

Test 1

Verdict: ACCEPTED

input
10 10 0
37 62 56 69 34 46 10 86 16 49
50 95 47 43 9 62 83 71 71 7

correct output
1

user output
1

Test 2

Verdict: ACCEPTED

input
10 10 10
90 41 20 39 49 21 35 31 74 86
14 24 24 7 82 85 82 4 60 95

correct output
6

user output
6

Test 3

Verdict: ACCEPTED

input
10 10 1000
59 5 65 15 42 81 58 96 50 1
18 59 71 65 97 83 80 68 92 67

correct output
10

user output
10

Test 4

Verdict: ACCEPTED

input
10 10 1000000000
25 80 59 43 67 21 77 5 8 99
66 41 62 24 88 55 1 53 50 60

correct output
10

user output
10

Test 5

Verdict:

input
200000 200000 0
34 48 12 99 89 71 20 7 9 38 58...

correct output
197286

user output
(empty)

Test 6

Verdict:

input
200000 200000 10
89 26 46 74 91 19 47 18 83 85 ...

correct output
200000

user output
(empty)

Test 7

Verdict:

input
200000 200000 1000
71 84 11 90 70 59 60 11 52 65 ...

correct output
200000

user output
(empty)

Test 8

Verdict:

input
200000 200000 1000000000
21 94 92 4 12 5 38 47 59 92 2 ...

correct output
200000

user output
(empty)

Test 9

Verdict: ACCEPTED

input
10 10 0
727245017 647121519 549745115 ...

correct output
0

user output
0

Test 10

Verdict: ACCEPTED

input
10 10 10
30734435 218114477 257355293 4...

correct output
0

user output
0

Test 11

Verdict: ACCEPTED

input
10 10 1000
7899629 162004163 327616450 51...

correct output
0

user output
0

Test 12

Verdict: ACCEPTED

input
10 10 1000000000
725746771 537157640 742868604 ...

correct output
10

user output
10

Test 13

Verdict:

input
200000 200000 0
375495587 322263536 985991668 ...

correct output
42

user output
(empty)

Test 14

Verdict:

input
200000 200000 10
906603621 968136956 666786366 ...

correct output
846

user output
(empty)

Test 15

Verdict:

input
200000 200000 1000
215460174 880023362 242442952 ...

correct output
57149

user output
(empty)

Test 16

Verdict:

input
200000 200000 1000000000
50349580 773460492 440699400 8...

correct output
200000

user output
(empty)

Test 17

Verdict: ACCEPTED

input
199999 1 1
199996 199997 149999 117797 19...

correct output
1

user output
1

Test 18

Verdict: ACCEPTED

input
5 2 2
2 2 2 40 50
40 50

correct output
2

user output
2

Test 19

Verdict: ACCEPTED

input
4 3 5
60 45 80 60
30 60 75

correct output
2

user output
2