| Task: | Building Teams |
| Sender: | aalto26bm_022 |
| Submission time: | 2026-09-07 19:22:58 +0300 |
| Language: | C |
| Status: | READY |
| Result: | RUNTIME ERROR |
| test | verdict | time | |
|---|---|---|---|
| #1 | RUNTIME ERROR | 0.00 s | details |
| #2 | RUNTIME ERROR | 0.00 s | details |
| #3 | RUNTIME ERROR | 0.00 s | details |
| #4 | RUNTIME ERROR | 0.00 s | details |
| #5 | RUNTIME ERROR | 0.00 s | details |
| #6 | WRONG ANSWER | 0.05 s | details |
| #7 | WRONG ANSWER | 0.05 s | details |
| #8 | WRONG ANSWER | 0.05 s | details |
| #9 | WRONG ANSWER | 0.05 s | details |
| #10 | ACCEPTED | 0.05 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | WRONG ANSWER | 0.00 s | details |
Compiler report
input/code.c:27:6: warning: return type of 'main' is not 'int' [-Wmain]
27 | void main() {
| ^~~~
input/code.c: In function 'main':
input/code.c:39:9: warning: unused variable 'imp' [-Wunused-variable]
39 | int imp;
| ^~~
input/code.c:30:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | scanf("%d %d", &m, &n);
| ^~~~~~~~~~~~~~~~~~~~~~
input/code.c:35:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
35 | scanf("%d %d", pair1, pair2);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.c:37:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
37 | scanf("%d %d", pair1 + i, pair2 + i);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~Code
#include <stdio.h>
#include <stdlib.h>
int search(int* p1, int* p2, int* t, int p, int n) {
int m = (t[p] + 1) % 2;
for (int i = 0; i < n; ++i) {
if (p1[i] == p) {
if (t[p2[i]] == (m + 1) / 2 ) return -1;
if (t[p2[i]] != m) {
t[p2[i]] = m;
if (search(p1, p2, t, p2[i], n) == -1) return -1;
}
} else if (p2[i] == p) {
if (t[p1[i]] == (m + 1) / 2 ) return -1;
if (t[p1[i]] != m) {
t[p1[i]] = m;
if (search(p1, p2, t, p1[i], n) == -1) {
printf("IMPOSSIBLE");
return -1;
}
}
}
}
return 0;
}
void main() {
int n;
int m;
scanf("%d %d", &m, &n);
int* pair1 = (int*)malloc(n * sizeof(int));
int* pair2 = (int*)malloc(n * sizeof(int));
int* team = (int*)malloc(m * sizeof(int));
for (int i = 0; i < m; ++i) { *(team + i) = -1; }
scanf("%d %d", pair1, pair2);
for (int i = 0; i < n; ++i) {
scanf("%d %d", pair1 + i, pair2 + i);
}
int imp;
for (int i = 0; i < n; ++i) {
if (team[pair1[i]] == -1) {
if(search(pair1, pair2, team, pair1[0], n) == -1) return;
}
}
for (int i = 0; i < m; ++i) {
printf("%d ", *(team + i));
}
}
Test details
Test 1
Verdict: RUNTIME ERROR
| 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 |
|---|
| (empty) |
Error:
Fatal glibc error: malloc.c:2599 (sysmalloc): assertion failed: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
Test 2
Verdict: RUNTIME ERROR
| 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 |
|---|
| (empty) |
Error:
Fatal glibc error: malloc.c:2599 (sysmalloc): assertion failed: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
Test 3
Verdict: RUNTIME ERROR
| 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 |
|---|
| (empty) |
Error:
Fatal glibc error: malloc.c:2599 (sysmalloc): assertion failed: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
Test 4
Verdict: RUNTIME ERROR
| 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 |
|---|
| (empty) |
Error:
Fatal glibc error: malloc.c:2599 (sysmalloc): assertion failed: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
Test 5
Verdict: RUNTIME ERROR
| input |
|---|
| 10 20 3 5 8 10 9 10 1 8 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| (empty) |
Error:
Fatal glibc error: malloc.c:2599 (sysmalloc): assertion failed: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
Test 6
Verdict: WRONG ANSWER
| 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: WRONG ANSWER
| 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: WRONG ANSWER
| 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: WRONG ANSWER
| 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: WRONG ANSWER
| input |
|---|
| 4 5 1 2 1 4 2 3 2 4 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| (empty) |