fork download
  1. import java.util.*;
  2. import java.lang.*;
  3. import java.io.*;
  4.  
  5. public class node {
  6. public int x;
  7. public int y;
  8. public node(int x, int y) {
  9. this.x = x;
  10. this.y = y;
  11. }
  12. }
  13. class Main
  14. {
  15. const int inf = 10000000;
  16. vector <node> cities;
  17. int d [200];
  18. void diikstra ( int n ){
  19. d[0] = 0;
  20. for (int i = 1; i < n; i++){
  21. d[i] = inf;
  22. }
  23. public static void main (String[] args) throws java.lang.Exception
  24. {
  25. priority_queue < pair <int, int> > q;
  26. q.push({d[0], 0});
  27. while (!q.empty()) {
  28. int num_v = q.top().second;
  29. node cur = cities[num_v];
  30. int distv = -q.top().first;
  31. q.pop();
  32. for (int i = 0; i < n; i++) {
  33. int distance = max (distv, (cur.x - cities[i].x)*(cur.x - cities[i].x)+(cur.y - cities[i].y)*(cur.y - cities[i].y));
  34. if(d[i] > distance){
  35. d[i] = distance;
  36. q.push ({-distance, i});
  37. }
  38. }
  39. }
  40. }
  41. int main() {
  42. cout.precision(3);
  43. int q;
  44. cin >> q;
  45. for (int w = 0; w < q; w++){
  46. int n;
  47. cin >> n;
  48. for (int i = 0; i < n; i++){
  49. int a, b;
  50. cin >> a >> b;
  51. cities.push_back({a,b});
  52. }
  53. diikstra (n);
  54. for (int i = 0; i < n; i++){
  55. cities.pop_back();
  56. }
  57. cout << fixed << sqrt(d[1]) << endl;
  58. }
  59. }
Runtime error #stdin #stdout #stderr 0.06s 2184192KB
stdin
Standard input is empty
stdout
Standard output is empty
stderr
Exception in thread "main" java.util.NoSuchElementException
	at java.util.Scanner.throwFor(Scanner.java:862)
	at java.util.Scanner.next(Scanner.java:1485)
	at java.util.Scanner.nextInt(Scanner.java:2117)
	at java.util.Scanner.nextInt(Scanner.java:2076)
	at Main.main(Main.java:27)