CSES - Aalto Competitive Programming 2024 - wk2 - Homework - Results
Submission details
Task:Apartments
Sender:minghao
Submission time:2024-09-08 23:45:05 +0300
Language:C++11
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.06 sdetails
#6ACCEPTED0.06 sdetails
#7ACCEPTED0.06 sdetails
#8ACCEPTED0.06 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.10 sdetails
#14ACCEPTED0.10 sdetails
#15ACCEPTED0.10 sdetails
#16ACCEPTED0.10 sdetails
#17ACCEPTED0.04 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails

Compiler report

input/code.cpp: In function 'void Test()':
input/code.cpp:23:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |     freopen("temp\\in.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     scanf("%d%d%d", &n, &m, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:30:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |         scanf("%d", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~
input/code.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         scanf("%d", &b[i]);
      |...

Code

#include<iostream>
#include<cstdio>
#include<algorithm>
typedef long long LL;

const int N=200005;
int n, m, k;
int a[N], b[N];

inline int Compare(const int& cur_human, const int& cur_house)
{
    if(cur_human > n)
        return -1;
    if(b[cur_house] < a[cur_human]-k)
        return -1;
    if(b[cur_house] > a[cur_human]+k)
        return 1;
    return 0;
}

void Test()
{
    freopen("temp\\in.txt", "r", stdin);
}
int main()
{
    // Test();
    scanf("%d%d%d", &n, &m, &k);
    for(int i=1; i<=n; i++)
        scanf("%d", &a[i]);
    for(int i=1; i<=m; i++)
        scanf("%d", &b[i]);

    std::sort(a+1, a+n+1);
    std::sort(b+1, b+m+1);

    int ans = 0, cur = 1; // cursor of human
    for(int i=1; i<=m; i++)
    {
        // Scan the apartments
        while(Compare(cur, i) == 1)
            cur++;
        if(Compare(cur, i) == 0)
            ans++, cur++;
    }

    printf("%d", ans);
    return 0;
}

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: ACCEPTED

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

correct output
197286

user output
197286

Test 6

Verdict: ACCEPTED

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

correct output
200000

user output
200000

Test 7

Verdict: ACCEPTED

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

correct output
200000

user output
200000

Test 8

Verdict: ACCEPTED

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

correct output
200000

user output
200000

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: ACCEPTED

input
200000 200000 0
375495587 322263536 985991668 ...

correct output
42

user output
42

Test 14

Verdict: ACCEPTED

input
200000 200000 10
906603621 968136956 666786366 ...

correct output
846

user output
846

Test 15

Verdict: ACCEPTED

input
200000 200000 1000
215460174 880023362 242442952 ...

correct output
57149

user output
57149

Test 16

Verdict: ACCEPTED

input
200000 200000 1000000000
50349580 773460492 440699400 8...

correct output
200000

user output
200000

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