| Task: | Sadonkorjuu |
| Sender: | DualRed |
| Submission time: | 2022-11-01 20:59:49 +0200 |
| Language: | Java |
| Status: | READY |
| Result: | 33 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 33 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.07 s | 1, 2 | details |
| #2 | ACCEPTED | 0.07 s | 1, 2 | details |
| #3 | ACCEPTED | 0.08 s | 1, 2 | details |
| #4 | ACCEPTED | 0.07 s | 1, 2 | details |
| #5 | ACCEPTED | 0.07 s | 1, 2 | details |
| #6 | ACCEPTED | 0.10 s | 1, 2 | details |
| #7 | ACCEPTED | 0.98 s | 2 | details |
| #8 | ACCEPTED | 0.11 s | 1, 2 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #10 | ACCEPTED | 0.10 s | 1, 2 | details |
| #11 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #12 | WRONG ANSWER | 0.84 s | 2 | details |
| #13 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #14 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #15 | ACCEPTED | 0.10 s | 1, 2 | details |
| #16 | ACCEPTED | 0.10 s | 1, 2 | details |
| #17 | ACCEPTED | 0.10 s | 1, 2 | details |
| #18 | ACCEPTED | 0.10 s | 1, 2 | details |
| #19 | ACCEPTED | 0.12 s | 1, 2 | details |
| #20 | ACCEPTED | 0.12 s | 1, 2 | details |
| #21 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #22 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #23 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #24 | ACCEPTED | 0.12 s | 1, 2 | details |
| #25 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #26 | ACCEPTED | 0.10 s | 1, 2 | details |
| #27 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #28 | ACCEPTED | 0.10 s | 1, 2 | details |
| #29 | ACCEPTED | 0.93 s | 2 | details |
| #30 | ACCEPTED | 0.10 s | 1, 2 | details |
| #31 | ACCEPTED | 0.81 s | 2 | details |
Code
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws IOException {
Solver solver = new Solver();
System.out.println(solver.Solve());
}
}
class Solver{
public int Solve() throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
// INPUT
int cityCount = Integer.parseInt(bufferedReader.readLine());
String[] cityTypes = bufferedReader.readLine().split(" ");
City[] cities = new City[cityCount];
for(int i = 0; i < cityCount; i++){
cities[i] = new City(i, Integer.parseInt(cityTypes[i]) == 1);
}
for(int i = 0; i < cityCount - 1; i++){
String[] inp = bufferedReader.readLine().split(" ");
cities[Integer.parseInt(inp[0]) - 1].AddConnection(cities[Integer.parseInt(inp[1]) - 1], Integer.parseInt(inp[2]));
cities[Integer.parseInt(inp[1]) - 1].AddConnection(cities[Integer.parseInt(inp[0]) - 1], Integer.parseInt(inp[2]));
}
// test generator
/*int cityCount = 200000;
City[] cities = new City[cityCount];
for(int i = 0; i < cityCount; i++){
cities[i] = new City(i, i > 100000 / 2);
}
for(int i = 0; i < cityCount - 1; i++){
Random random = new Random();
int randomIndex;
do {
randomIndex = random.nextInt(cityCount);
}
while (randomIndex == i);
String[] inp = {String.valueOf(i), String.valueOf(randomIndex), "1"};
cities[Integer.parseInt(inp[0])].AddConnection(cities[Integer.parseInt(inp[1])], Integer.parseInt(inp[2]));
cities[Integer.parseInt(inp[1])].AddConnection(cities[Integer.parseInt(inp[0])], Integer.parseInt(inp[2]));
}*/
//long start = System.currentTimeMillis();
// ALG
for(int i = 0; i < cityCount; i++){
if (!cities[i].isField){
//System.out.println("a hamina found");
boolean[] usedFlags = new boolean[cityCount];
CalculateShortestPaths(cities[i], 0, usedFlags);
}
}
int totalLength = 0;
for(int i = 0; i < cityCount; i++){
if (cities[i].isField){
//System.out.println(String.valueOf(i) + " -> " + String.valueOf(cities[i].shortestPath));
totalLength += cities[i].shortestPath;
}
}
//long finish = System.currentTimeMillis();
//long timeElapsed = finish - start;
//System.out.println(timeElapsed / 1000.0);
return totalLength;
}
void CalculateShortestPaths(City city, int totalCost, boolean[] usedFlags){
for (Connection connection : city.connections) {
int thisID = connection.destination.cityID;
if (usedFlags[thisID]) { continue; }
if (!connection.destination.isField) { continue; }
else {
int newCost = totalCost + connection.cost;
if (newCost < connection.destination.shortestPath){
connection.destination.shortestPath = newCost;
} else { continue; }
}
usedFlags[thisID] = true;
CalculateShortestPaths(connection.destination, totalCost + connection.cost, usedFlags);
usedFlags[thisID] = false;
}
}
class City {
public int cityID;
public boolean isField;
public List<Connection> connections;
public int shortestPath = Integer.MAX_VALUE;
public City(int cityID, boolean isField){
this.cityID = cityID;
this.isField = isField;
connections = new ArrayList<Connection>();
}
public void AddConnection(City destination, int cost) {
connections.add(new Connection(destination, cost));
}
}
class Connection {
public City destination;
public int cost;
public Connection(City destination, int cost){
this.destination = destination;
this.cost = cost;
}
}
}
Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1 0 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 2
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 0 0 0 0 0 1 2 1 2 3 2 3 4 3 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 3
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 4 1 0 1 1 1 2 10 2 3 20 2 4 30 |
| correct output |
|---|
| 60 |
| user output |
|---|
| 60 |
Test 4
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ... |
| correct output |
|---|
| 80 |
| user output |
|---|
| 80 |
Test 5
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 0 1 0 1 1 1 2 1 2 3 5 3 4 3 ... |
| correct output |
|---|
| 6 |
| user output |
|---|
| 6 |
Test 6
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 5506363 |
| user output |
|---|
| 5506363 |
Test 7
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1795118520 |
| user output |
|---|
| 1795118520 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ... |
| correct output |
|---|
| 293576 |
| user output |
|---|
| 293576 |
Test 9
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 816932444 |
| user output |
|---|
| (empty) |
Test 10
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 3089 |
| user output |
|---|
| 3089 |
Test 11
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 40839 |
| user output |
|---|
| (empty) |
Test 12
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 5683983203973 |
| user output |
|---|
| 1741471365 |
Test 13
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 ... |
| correct output |
|---|
| 58572993 |
| user output |
|---|
| (empty) |
Test 14
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 32755 |
| user output |
|---|
| (empty) |
Test 15
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 126238345 |
| user output |
|---|
| 126238345 |
Test 16
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ... |
| correct output |
|---|
| 278678 |
| user output |
|---|
| 278678 |
Test 17
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ... |
| correct output |
|---|
| 34929 |
| user output |
|---|
| 34929 |
Test 18
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1543963 |
| user output |
|---|
| 1543963 |
Test 19
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 39606 |
| user output |
|---|
| 39606 |
Test 20
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ... |
| correct output |
|---|
| 321598 |
| user output |
|---|
| 321598 |
Test 21
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 978670626 |
| user output |
|---|
| (empty) |
Test 22
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 375218 |
| user output |
|---|
| (empty) |
Test 23
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 ... |
| correct output |
|---|
| 60422556 |
| user output |
|---|
| (empty) |
Test 24
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 291990 |
| user output |
|---|
| 291990 |
Test 25
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 59607954 |
| user output |
|---|
| (empty) |
Test 26
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 990 |
| user output |
|---|
| 990 |
Test 27
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 199982 |
| user output |
|---|
| (empty) |
Test 28
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 7987 |
| user output |
|---|
| 7987 |
Test 29
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 3137875 |
| user output |
|---|
| 3137875 |
Test 30
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 4657693 |
| user output |
|---|
| 4657693 |
Test 31
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1652889357 |
| user output |
|---|
| 1652889357 |
