Submission details
Task:Building Teams
Sender:Olivernator
Submission time:2025-09-08 16:57:29 +0300
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#30.00 sdetails
#40.00 sdetails
#5ACCEPTED0.00 sdetails
#60.00 sdetails
#70.00 sdetails
#80.00 sdetails
#90.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails

Compiler report

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     scanf("%d %d", &people, &friendships);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:13:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |         scanf("%d %d", &person1, &person2);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Code

#include <cstdio>
#include <cstdlib>

using namespace std;

int main (int argc, char *argv[]) {
    int people, friendships;
    scanf("%d %d", &people, &friendships);
    int *team = (int *)calloc(people, sizeof(int));

    for (int i = 0; i < friendships; i++) {
        int person1, person2;
        scanf("%d %d", &person1, &person2);
        person1--;
        person2--;
        if (team[person2] && team[person1]){
            printf("IMPOSSIBLE\n");
            free(team);
            return 0;
        }
        if (team[person1]){
            team[person2] = (team[person1] == 1 ? 2:1);
        }else if(team[person2]){
            team[person1] = (team[person2] == 1 ? 2:1);
        }else if((!team[person1]) && (!team[person2])){
            team[person1] = 1;
            team[person2] = 2;
        }
    }

    for (int i = 0; i < people; i++) {
        if (!team[i]){
            team[i]++;
        }
    }

    for (int i = 0; i < people; i++) {
        printf("%d ", team[i]);
    }

    printf("\n");

    free(team);

    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
IMPOSSIBLE

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
IMPOSSIBLE

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
IMPOSSIBLE

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
IMPOSSIBLE

Test 5

Verdict: ACCEPTED

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

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
IMPOSSIBLE

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
IMPOSSIBLE

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
IMPOSSIBLE

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
IMPOSSIBLE

Test 10

Verdict: ACCEPTED

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 11

Verdict: ACCEPTED

input
5 4
1 2
3 4
4 5
5 3

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 12

Verdict: ACCEPTED

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE