Submission details
Task:Building Teams
Sender:Olivernator
Submission time:2025-09-08 16:27:39 +0300
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#30.00 sdetails
#40.00 sdetails
#50.00 sdetails
#60.07 sdetails
#70.07 sdetails
#80.07 sdetails
#90.07 sdetails
#100.07 sdetails
#110.00 sdetails
#120.00 sdetails

Compiler report

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d %d %d", &people, &houses, &max_diff);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d", &prefs[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~
input/code.cpp:19:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |         scanf("%d", &available[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Code

#include <algorithm>
#include <cstdio>
#include <cstdlib>

using namespace std;

int main (int argc, char *argv[]) {
    int people,houses,max_diff;
    scanf("%d %d %d", &people, &houses, &max_diff);

    int *prefs = (int *)malloc(sizeof(int[people]));
    int *available = (int *)malloc(sizeof(int[houses]));

    for (int i = 0; i < people; i++) {
        scanf("%d", &prefs[i]);
    }

    for (int i = 0; i < houses; i++) {
        scanf("%d", &available[i]);
    }

    int *pend = &prefs[people];
    int *aend = &available[houses];
    sort(prefs, pend);
    sort(available, aend);

    int *pcurrent = prefs;
    int *acurrent = available;

    int ret = 0;
    while(pcurrent != pend && acurrent != aend){
        if ((*pcurrent - max_diff) > *acurrent){
            acurrent++;
        } else if ((*pcurrent + max_diff) < *acurrent) {
            pcurrent++;
        }else {
            acurrent++;
            pcurrent++;
            ret++;
        }
    }
    printf("%d", ret);

    free(prefs);
    free(available);

    return 0;
}

Test details

Test 1

Verdict:

input
10 20
3 4
8 10
3 7
1 8
...

correct output
1 1 1 2 2 1 2 2 2 1 

user output
10

Test 2

Verdict:

input
10 20
1 3
8 10
2 4
6 8
...

correct output
1 1 2 2 1 1 1 2 1 1 

user output
10

Test 3

Verdict:

input
10 20
7 10
3 10
9 10
2 10
...

correct output
1 2 2 1 1 1 2 1 2 1 

user output
10

Test 4

Verdict:

input
10 20
2 4
2 10
7 10
4 6
...

correct output
1 2 1 1 2 2 2 1 2 1 

user output
10

Test 5

Verdict:

input
10 20
3 5
8 10
9 10
1 8
...

correct output
IMPOSSIBLE

user output
10

Test 6

Verdict:

input
100000 200000
47355 96505
90709 92058
735 80715
91802 94265
...

correct output
1 2 2 1 2 1 1 1 2 2 1 2 1 1 1 ...

user output
100000

Test 7

Verdict:

input
100000 200000
59991 95794
95150 96051
78453 94730
90411 95523
...

correct output
1 1 1 2 2 1 1 2 1 2 1 2 2 2 1 ...

user output
100000

Test 8

Verdict:

input
100000 200000
89827 96402
65137 86792
80965 94708
19479 48078
...

correct output
1 2 1 1 2 1 2 2 2 1 2 1 1 2 1 ...

user output
100000

Test 9

Verdict:

input
100000 200000
72952 83723
66197 70052
2949 52160
55753 95651
...

correct output
1 1 2 2 2 1 1 2 2 2 2 2 1 2 1 ...

user output
100000

Test 10

Verdict:

input
100000 200000
38942 96755
70049 82663
7746 72732
87819 99029
...

correct output
IMPOSSIBLE

user output
100000

Test 11

Verdict:

input
5 4
1 2
3 4
4 5
5 3

correct output
IMPOSSIBLE

user output
2

Test 12

Verdict:

input
4 5
1 2
1 4
2 3
2 4
...

correct output
IMPOSSIBLE

user output
4