| Task: | Connect cities |
| Sender: | aalto26bh_039 |
| Submission time: | 2026-09-06 17:22:58 +0300 |
| Language: | Java |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.13 s | details |
| #2 | WRONG ANSWER | 0.13 s | details |
| #3 | ACCEPTED | 0.12 s | details |
| #4 | WRONG ANSWER | 0.13 s | details |
| #5 | WRONG ANSWER | 0.13 s | details |
| #6 | TIME LIMIT EXCEEDED | -- | details |
| #7 | TIME LIMIT EXCEEDED | -- | details |
| #8 | TIME LIMIT EXCEEDED | -- | details |
| #9 | TIME LIMIT EXCEEDED | -- | details |
| #10 | TIME LIMIT EXCEEDED | -- | details |
| #11 | ACCEPTED | 0.66 s | details |
| #12 | ACCEPTED | 0.13 s | details |
Code
import java.util.*;
public class ConnectCities {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int m = input.nextInt();
List<Connection> newConnections = new ArrayList<>();
for (int i = 0; i < n-1; i++){
newConnections.add(new Connection(i+1, i+2));
}
List<Integer> oldCons = new ArrayList<>();
for (int j = 0; j < m; j++){
int a = input.nextInt();
int b = input.nextInt();
int bigger = Math.max(a, b);
if(!(oldCons.contains(a) && oldCons.contains(b))){
boolean found = false;
int i = 0;
while (i < newConnections.size() && !found){
if (newConnections.get(i).b == bigger){
newConnections.remove(i);
oldCons.add(a);
oldCons.add(b);
found = true;
}
i++;
}
i = 0;
int smaller = Math.min(a, b);
while (i < newConnections.size() && !found){
if (newConnections.get(i).b == smaller){
newConnections.remove(i);
oldCons.add(a);
oldCons.add(b);
found = true;
}
i++;
}
}
}
System.out.println(newConnections.size());
newConnections.forEach(con -> System.out.println(con.a + " " + con.b));
}
}
class Connection{
int a;
int b;
Connection(int a, int b){
this.a = a;
this.b = b;
}
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 10 10 2 5 5 6 1 4 6 8 ... |
| correct output |
|---|
| 2 1 2 2 7 |
| user output |
|---|
| 2 1 2 6 7 |
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 3 9 6 8 9 10 7 8 ... |
| correct output |
|---|
| 2 1 4 4 5 |
| user output |
|---|
| 4 2 3 3 4 4 5 5 6 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 10 10 7 9 1 7 1 3 3 4 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 4
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 4 8 5 9 4 9 2 7 ... |
| correct output |
|---|
| 1 1 3 |
| user output |
|---|
| 3 1 2 2 3 3 4 |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 4 9 2 4 7 10 1 8 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 2 1 2 5 6 |
Test 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 7233 22146 94937 96203 6133 10731 98737 99193 ... |
| correct output |
|---|
| 4785 1 2 2 3 3 4 4 5 ... |
| user output |
|---|
| (empty) |
Test 7
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 92950 93575 24401 88897 41796 99364 47106 50330 ... |
| correct output |
|---|
| 4868 1 2 2 7 7 9 9 15 ... |
| user output |
|---|
| (empty) |
Test 8
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 15637 76736 79169 98809 4382 86557 73383 77029 ... |
| correct output |
|---|
| 4683 1 9 9 20 20 27 27 28 ... |
| user output |
|---|
| (empty) |
Test 9
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 47932 66981 86401 99942 4353 27841 60492 67345 ... |
| correct output |
|---|
| 4807 1 6 6 7 7 11 11 12 ... |
| user output |
|---|
| (empty) |
Test 10
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 6554 44548 76413 98555 5447 59589 70166 74434 ... |
| correct output |
|---|
| 4786 1 2 2 18 18 21 21 27 ... |
| user output |
|---|
| (empty) |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 100000 1 1 2 |
| correct output |
|---|
| 99998 1 3 3 4 4 5 5 6 ... |
| user output |
|---|
| 99998 2 3 3 4 4 5 5 6 ... |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 10 9 2 5 5 6 1 4 6 8 ... |
| correct output |
|---|
| 2 1 2 2 7 |
| user output |
|---|
| 2 1 2 6 7 |
