Submission details
Task:Connect cities
Sender:aalto26bh_039
Submission time:2026-09-06 16:49:23 +0300
Language:Java
Status:READY
Result:
Test results
testverdicttime
#10.13 sdetails
#20.13 sdetails
#3ACCEPTED0.10 sdetails
#4ACCEPTED0.13 sdetails
#50.13 sdetails
#6--details
#7--details
#8--details
#9--details
#10--details
#11ACCEPTED0.72 sdetails
#120.13 sdetails

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));
        }

        for (int j = 0; j < m; j++){
            int a = input.nextInt();
            int b = input.nextInt();
            int bigger = Math.max(a, b);

            boolean found = false;
            int i = 0;
            while (i < newConnections.size() && !found){
                 if (newConnections.get(i).b == bigger){
                    newConnections.remove(i);
                    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);
                    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:

input
10 10
2 5
5 6
1 4
6 8
...

correct output
2
1 2
2 7

user output
1
6 7

Test 2

Verdict:

input
10 10
3 9
6 8
9 10
7 8
...

correct output
2
1 4
4 5

user output
3
2 3
3 4
4 5

Test 3

Verdict: ACCEPTED

input
10 10
7 9
1 7
1 3
3 4
...

correct output
0

user output
0

Test 4

Verdict: ACCEPTED

input
10 10
4 8
5 9
4 9
2 7
...

correct output
1
1 3

user output
1
2 3

Test 5

Verdict:

input
10 10
4 9
2 4
7 10
1 8
...

correct output
0

user output
1
1 2

Test 6

Verdict:

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:

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:

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:

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:

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:

input
10 9
2 5
5 6
1 4
6 8
...

correct output
2
1 2
2 7

user output
1
6 7