| Task: | Tunnels |
| Sender: | fjuengermann |
| Submission time: | 2017-01-22 14:07:45 +0200 |
| Language: | Java |
| Status: | READY |
| Result: | 47 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 16 |
| #2 | ACCEPTED | 31 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.15 s | 1 | details |
| #2 | ACCEPTED | 0.19 s | 1 | details |
| #3 | ACCEPTED | 0.16 s | 1 | details |
| #4 | ACCEPTED | 0.18 s | 1 | details |
| #5 | ACCEPTED | 0.17 s | 1 | details |
| #6 | ACCEPTED | 0.18 s | 2 | details |
| #7 | ACCEPTED | 0.16 s | 2 | details |
| #8 | ACCEPTED | 0.15 s | 2 | details |
| #9 | ACCEPTED | 0.16 s | 2 | details |
| #10 | ACCEPTED | 0.16 s | 2 | details |
| #11 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #12 | ACCEPTED | 0.80 s | 3 | details |
| #13 | ACCEPTED | 0.57 s | 3 | details |
| #14 | ACCEPTED | 0.49 s | 3 | details |
| #15 | ACCEPTED | 0.43 s | 3 | details |
Code
import java.util.*;
/**
* Created by Florian on 22-Jan-17.
*/
public class Tunnels2 {
static final int N = 100000;
static int[] arriving = new int[N];
static int[] ordered = new int[N];
static int[] incoming = new int[N];
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
StringTokenizer st = new StringTokenizer(sc.nextLine());
int n = Integer.parseInt(st.nextToken());
int m = Integer.parseInt(st.nextToken());
// int[] incoming = new int[n];//
ArrayList<Queue<Integer>> connections = new ArrayList<>();
for (int i = 0; i < n; i++) {
connections.add(new LinkedList<>());
}
for (int i = 0; i < m; i++) {
st = new StringTokenizer(sc.nextLine());
int a = Integer.parseInt(st.nextToken()) - 1;
int b = Integer.parseInt(st.nextToken()) - 1;
// inoutDif[a]++;
// inoutDif[b]--;
incoming[b]++;
connections.get(a).add(b);
// connections.get(b).add(a);
}
// int[] ordered = new int[n];
LinkedList<Integer> noIn = new LinkedList<>();
for (int i = 0; i < n; i++) {
if (incoming[i] == 0)
noIn.add(i);
}
int count = 0;
int node;
while (!noIn.isEmpty()) {
node = noIn.poll();
ordered[count++] = node;
for (Integer next : connections.get(node)) {
incoming[next]--;
if (incoming[next] == 0)
noIn.add(next);
}
}
// int[] arriving = new int[n];
int dUsed = 0;
for (int i = 0; i < n; i++) {
node = ordered[i];
dUsed += Math.max(0, connections.get(node).size() - arriving[node]);
for (Integer next : connections.get(node)) {
arriving[next]++;
}
}
System.out.println(dUsed);
}
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 20 4 5 6 4 5 1 5 9 ... |
| correct output |
|---|
| 11 |
| user output |
|---|
| 11 |
Test 2
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 10 7 3 5 2 9 7 1 5 ... |
| correct output |
|---|
| 5 |
| user output |
|---|
| 5 |
Test 3
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 5 5 7 3 8 5 8 3 7 ... |
| correct output |
|---|
| 4 |
| user output |
|---|
| 4 |
Test 4
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 4 9 1 6 8 7 1 5 7 |
| correct output |
|---|
| 3 |
| user output |
|---|
| 3 |
Test 5
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 2 10 6 2 1 |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
Test 6
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 200 24 40 25 6 36 93 92 90 ... |
| correct output |
|---|
| 97 |
| user output |
|---|
| 97 |
Test 7
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 100 98 37 91 37 60 92 46 27 ... |
| correct output |
|---|
| 60 |
| user output |
|---|
| 60 |
Test 8
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 50 74 95 53 72 69 85 14 13 ... |
| correct output |
|---|
| 34 |
| user output |
|---|
| 34 |
Test 9
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 40 28 76 10 81 13 52 46 83 ... |
| correct output |
|---|
| 29 |
| user output |
|---|
| 29 |
Test 10
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 20 27 35 72 92 56 4 64 80 ... |
| correct output |
|---|
| 18 |
| user output |
|---|
| 18 |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 89244 59358 22943 56710 63331 89437 56581 38400 ... |
| correct output |
|---|
| 102510 |
| user output |
|---|
| (empty) |
Test 12
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 21701 85599 61542 21474 38081 29362 46316 64038 ... |
| correct output |
|---|
| 60593 |
| user output |
|---|
| 60593 |
Test 13
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 50000 86469 4833 16351 35505 59315 33011 95464 16985 ... |
| correct output |
|---|
| 35933 |
| user output |
|---|
| 35933 |
Test 14
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 40000 5392 23534 63204 45619 74330 25925 59678 88427 ... |
| correct output |
|---|
| 30074 |
| user output |
|---|
| 30074 |
Test 15
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 20000 80156 16531 71753 77661 7028 33389 17168 646 ... |
| correct output |
|---|
| 16882 |
| user output |
|---|
| 16882 |
