#588
Se dă un graf orientat ponderat – în care fiecare arc are asociat un cost, număr natural strict pozitiv, și un nod p
. Să se determine, folosind algoritmul lui Dijkstra, costul minim al drumului de la p
la fiecare nod al grafului.
Problema | Dijkstra | Operații I/O |
![]() dijkstra.in /dijkstra.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #58364639 | Utilizator | |
Fișier | dijkstra.cpp | Dimensiune | 1.16 KB |
Data încărcării | 29 Mai 2025, 14:00 | Scor / rezultat | Eroare de compilare |
dijkstra.cpp:9:1: error: stray '\302' in program fin>>n>>p; ^ dijkstra.cpp:9:1: error: stray '\240' in program dijkstra.cpp:9:1: error: stray '\302' in program dijkstra.cpp:9:1: error: stray '\240' in program dijkstra.cpp:10:1: error: stray '\302' in program int x,y,c; ^ dijkstra.cpp:10:1: error: stray '\240' in program dijkstra.cpp:10:1: error: stray '\302' in program dijkstra.cpp:10:1: error: stray '\240' in program dijkstra.cpp:11:1: error: stray '\302' in program for(int i=1;i<=n;i++){ ^ dijkstra.cpp:11:1: error: stray '\240' in program dijkstra.cpp:11:1: error: stray '\302' in program dijkstra.cpp:11:1: error: stray '\240' in program dijkstra.cpp:12:1: error: stray '\302' in program for(int j=1;j<=n;j++) ^ dijkstra.cpp:12:1: error: stray '\240' in program dijkstra.cpp:12:1: error: stray '\302' in program dijkstra.cpp:12:1: error: stray '\240' in program dijkstra.cpp:12:1: error: stray '\302' in program dijkstra.cpp:12:1: error: stray '\240' in program dijkstra.cpp:12:1: error: stray '\302' in program dijkstra.cpp:12:1: error: stray '\240' in program dijkstra.cpp:13:1: error: stray '\302' in program a[i][j]=oo; ^ dijkstra.cpp:13:1: error: stray '\240' in program dijkstra.cpp:13:1: error: stray '\302' in program dijkstra.cpp:13:1: error: stray '\240' in program dijkstra.cpp:13:1: error: stray '\302' in program dijkstra.cpp:13:1: error: stray '\240' in program dijkstra.cpp:13:1: error: stray '\302' in program dijkstra.cpp:13:1: error: stray '\240' in program dijkstra.cpp:13:1: error: stray '\302' in program dijkstra.cpp:13:1: error: stray '\240' in program dijkstra.cpp:13:1: error: stray '\302' in program dijkstra.cpp:13:1: error: stray '\240' in program dijkstra.cpp:14:1: error: stray '\302' in program a[i][i]=0; ^ dijkstra.cpp:14:1: error: stray '\240' in program dijkstra.cpp:14:1: error: stray '\302' in program dijkstra.cpp:14:1: error: stray '\240' in program dijkstra.cpp:14:1: error: stray '\302' in program dijkstra.cpp:14:1: error: stray '\240' in program dijkstra.cpp:14:1: error: stray '\302' in program dijkstra.cpp:14:1: error: stray '\240' in program dijkstra.cpp:15:1: error: stray '\302' in program } ^ dijkstra.cpp:15:1: error: stray '\240' in program dijkstra.cpp:15:1: error: stray '\302' in program dijkstra.cpp:15:1: error: stray '\240' in program dijkstra.cpp:16:1: error: stray '\302' in program while(fin>>x>>y>>c){ ^ dijkstra.cpp:16:1: error: stray '\240' in program dijkstra.cpp:16:1: error: stray '\302' in program dijkstra.cpp:16:1: error: stray '\240' in program dijkstra.cpp:17:1: error: stray '\302' in program a[x][y]=c; ^ dijkstra.cpp:17:1: error: stray '\240' in program dijkstra.cpp:17:1: error: stray '\302' in program dijkstra.cpp:17:1: error: stray '\240' in program dijkstra.cpp:17:1: error: stray '\302' in program dijkstra.cpp:17:1: error: stray '\240' in program dijkstra.cpp:17:1: error: stray '\302' in program dijkstra.cpp:17:1: error: stray '\240' in program dijkstra.cpp:18:1: error: stray '\302' in program } ^ dijkstra.cpp:18:1: error: stray '\240' in program dijkstra.cpp:18:1: error: stray '\302' in program dijkstra.cpp:18:1: error: stray '\240' in program dijkstra.cpp:19:1: error: stray '\302' in program for(int i=1;i<=n;i++){ ^ dijkstra.cpp:19:1: error: stray '\240' in program dijkstra.cpp:19:1: error: stray '\302' in program dijkstra.cpp:19:1: error: stray '\240' in program dijkstra.cpp:20:1: error: stray '\302' in program if(i!=p) d[i]=a[p][i]; ^ dijkstra.cpp:20:1: error: stray '\240' in program dijkstra.cpp:20:1: error: stray '\302' in program dijkstra.cpp:20:1: error: stray '\240' in program dijkstra.cpp:20:1: error: stray '\302' in program dijkstra.cpp:20:1: error: stray '\240' in program dijkstra.cpp:20:1: error: stray '\302' in program dijkstra.cpp:20:1: error: stray '\240' in program dijkstra.cpp:21:1: error: stray '\302' in program else d[i]=0; ^ dijkstra.cpp:21:1: error: stray '\240' in program dijkstra.cpp:21:1: error: stray '\302' in program dijkstra.cpp:21:1: error: stray '\240' in program dijkstra.cpp:21:1: error: stray '\302' in program dijkstra.cpp:21:1: error: stray '\240' in program dijkstra.cpp:21:1: error: stray '\302' in program dijkstra.cpp:21:1: error: stray '\240' in program dijkstra.cpp:22:1: error: stray '\302' in program viz[i]=0; ^ dijkstra.cpp:22:1: error: stray '\240' in program dijkstra.cpp:22:1: error: stray '\302' in program dijkstra.cpp:22:1: error: stray '\240' in program dijkstra.cpp:22:1: error: stray '\302' in program dijkstra.cpp:22:1: error: stray '\240' in program dijkstra.cpp:22:1: error: stray '\302' in program dijkstra.cpp:22:1: error: stray '\240' in program dijkstra.cpp:23:1: error: stray '\302' in program } ^ dijkstra.cpp:23:1: error: stray '\240' in program dijkstra.cpp:23:1: error: stray '\302' in program dijkstra.cpp:23:1: error: stray '\240' in program dijkstra.cpp:24:1: error: stray '\302' in program int mini,pmin; ^ dijkstra.cpp:24:1: error: stray '\240' in program dijkstra.cpp:24:1: error: stray '\302' in program dijkstra.cpp:24:1: error: stray '\240' in program dijkstra.cpp:25:1: error: stray '\302' in program viz[p]=1; ^ dijkstra.cpp:25:1: error: stray '\240' in program dijkstra.cpp:25:1: error: stray '\302' in program dijkstra.cpp:25:1: error: stray '\240' in program dijkstra.cpp:26:1: error: stray '\302' in program do{ ^ dijkstra.cpp:26:1: error: stray '\240' in program dijkstra.cpp:26:1: error: stray '\302' in program dijkstra.cpp:26:1: error: stray '\240' in program dijkstra.cpp:27:1: error: stray '\302' in program mini=oo; pmin=0; ^ dijkstra.cpp:27:1: error: stray '\240' in program dijkstra.cpp:27:1: error: stray '\302' in program dijkstra.cpp:27:1: error: stray '\240' in program dijkstra.cpp:27:1: error: stray '\302' in program dijkstra.cpp:27:1: error: stray '\240' in program dijkstra.cpp:27:1: error: stray '\302' in program dijkstra.cpp:27:1: error: stray '\240' in program dijkstra.cpp:28:1: error: stray '\302' in program for(int i=1;i<=n;i++){ ^ dijkstra.cpp:28:1: error: stray '\240' in program dijkstra.cpp:28:1: error: stray '\302' in program dijkstra.cpp:28:1: error: stray '\240' in program dijkstra.cpp:28:1: error: stray '\302' in program dijkstra.cpp:28:1: error: stray '\240' in program dijkstra.cpp:28:1: error: stray '\302' in program dijkstra.cpp:28:1: error: stray '\240' in program dijkstra.cpp:29:1: error: stray '\302' in program if(viz[i]==0&&d[i]<mini){ ^ dijkstra.cpp:29:1: error: stray '\240' in program dijkstra.cpp:29:1: error: stray '\302' in program dijkstra.cpp:29:1: error: stray '\240' in program dijkstra.cpp:29:1: error: stray '\302' in program dijkstra.cpp:29:1: error: stray '\240' in program dijkstra.cpp:29:1: error: stray '\302' in program dijkstra.cpp:29:1: error: stray '\240' in program dijkstra.cpp:29:1: error: stray '\302' in program dijkstra.cpp:29:1: error: stray '\240' in program dijkstra.cpp:29:1: error: stray '\302' in program dijkstra.cpp:29:1: error: stray '\240' in program dijkstra.cpp:30:1: error: stray '\302' in program mini=d[i]; ^ dijkstra.cpp:30:1: error: stray '\240' in program dijkstra.cpp:30:1: error: stray '\302' in program dijkstra.cpp:30:1: error: stray '\240' in program dijkstra.cpp:30:1: error: stray '\302' in program dijkstra.cpp:30:1: error: stray '\240' in program dijkstra.cpp:30:1: error: stray '\302' in program dijkstra.cpp:30:1: error: stray '\240' in program dijkstra.cpp:30:1: error: stray '\302' in program dijkstra.cpp:30:1: error: stray '\240' in program dijkstra.cpp:30:1: error: stray '\302' in program dijkstra.cpp:30:1: error: stray '\240' in program dijkstra.cpp:30:1: error: stray '\302' in program dijkstra.cpp:30:1: error: stray '\240' in program dijkstra.cpp:30:1: error: stray '\302' in program dijkstra.cpp:30:1: error: stray '\240' in program dijkstra.cpp:31:1: error: stray '\302' in program pmin=i; ^ dijkstra.cpp:31:1: error: stray '\240' in program dijkstra.cpp:31:1: error: stray '\302' in program dijkstra.cpp:31:1: error: stray '\240' in program dijkstra.cpp:31:1: error: stray '\302' in program dijkstra.cpp:31:1: error: stray '\240' in program dijkstra.cpp:31:1: error: stray '\302' in program dijkstra.cpp:31:1: error: stray '\240' in program dijkstra.cpp:31:1: error: stray '\302' in program dijkstra.cpp:31:1: error: stray '\240' in program dijkstra.cpp:31:1: error: stray '\302' in program dijkstra.cpp:31:1: error: stray '\240' in program dijkstra.cpp:31:1: error: stray '\302' in program dijkstra.cpp:31:1: error: stray '\240' in program dijkstra.cpp:31:1: error: stray '\302' in program dijkstra.cpp:31:1: error: stray '\240' in program dijkstra.cpp:32:1: error: stray '\302' in program } ^ dijkstra.cpp:32:1: error: stray '\240' in program dijkstra.cpp:32:1: error: stray '\302' in program dijkstra.cpp:32:1: error: stray '\240' in program dijkstra.cpp:32:1: error: stray '\302' in program dijkstra.cpp:32:1: error: stray '\240' in program dijkstra.cpp:32:1: error: stray '\302' in program dijkstra.cpp:32:1: error: stray '\240' in program dijkstra.cpp:32:1: error: stray '\302' in program dijkstra.cpp:32:1: error: stray '\240' in program dijkstra.cpp:32:1: error: stray '\302' in program dijkstra.cpp:32:1: error: stray '\240' in program dijkstra.cpp:33:1: error: stray '\302' in program } ^ dijkstra.cpp:33:1: error: stray '\240' in program dijkstra.cpp:33:1: error: stray '\302' in program dijkstra.cpp:33:1: error: stray '\240' in program dijkstra.cpp:33:1: error: stray '\302' in program dijkstra.cpp:33:1: error: stray '\240' in program dijkstra.cpp:33:1: error: stray '\302' in program dijkstra.cpp:33:1: error: stray '\240' in program dijkstra.cpp:34:1: error: stray '\302' in program if(pmin!=0){ ^ dijkstra.cpp:34:1: error: stray '\240' in program dijkstra.cpp:34:1: error: stray '\302' in program dijkstra.cpp:34:1: error: stray '\240' in program dijkstra.cpp:34:1: error: stray '\302' in program dijkstra.cpp:34:1: error: stray '\240' in program dijkstra.cpp:34:1: error: stray '\302' in program dijkstra.cpp:34:1: error: stray '\240' in program dijkstra.cpp:35:1: error: stray '\302' in program viz[pmin]=1; ^ dijkstra.cpp:35:1: error: stray '\240' in program dijkstra.cpp:35:1: error: stray '\302' in program dijkstra.cpp:35:1: error: stray '\240' in program dijkstra.cpp:35:1: error: stray '\302' in program dijkstra.cpp:35:1: error: stray '\240' in program dijkstra.cpp:35:1: error: stray '\302' in program dijkstra.cpp:35:1: error: stray '\240' in program dijkstra.cpp:35:1: error: stray '\302' in program dijkstra.cpp:35:1: error: stray '\240' in program dijkstra.cpp:35:1: error: stray '\302' in program dijkstra.cpp:35:1: error: stray '\240' in program dijkstra.cpp:36:1: error: stray '\302' in program for(int i=1;i<=n;i++){ ^ dijkstra.cpp:36:1: error: stray '\240' in program dijkstra.cpp:36:1: error: stray '\302' in program dijkstra.cpp:36:1: error: stray '\240' in program dijkstra.cpp:36:1: error: stray '\302' in program dijkstra.cpp:36:1: error: stray '\240' in program dijkstra.cpp:36:1: error: stray '\302' in program dijkstra.cpp:36:1: error: stray '\240' in program dijkstra.cpp:36:1: error: stray '\302' in program dijkstra.cpp:36:1: error: stray '\240' in program dijkstra.cpp:36:1: error: stray '\302' in program dijkstra.cpp:36:1: error: stray '\240' in program dijkstra.cpp:37:1: error: stray '\302' in program if(d[pmin]+a[pmin][i]<d[i]) ^ dijkstra.cpp:37:1: error: stray '\240' in program dijkstra.cpp:37:1: error: stray '\302' in program dijkstra.cpp:37:1: error: stray '\240' in program dijkstra.cpp:37:1: error: stray '\302' in program dijkstra.cpp:37:1: error: stray '\240' in program dijkstra.cpp:37:1: error: stray '\302' in program dijkstra.cpp:37:1: error: stray '\240' in program dijkstra.cpp:37:1: error: stray '\302' in program dijkstra.cpp:37:1: error: stray '\240' in program dijkstra.cpp:37:1: error: stray '\302' in program dijkstra.cpp:37:1: error: stray '\240' in program dijkstra.cpp:37:1: error: stray '\302' in program dijkstra.cpp:37:1: error: stray '\240' in program dijkstra.cpp:37:1: error: stray '\302' in program dijkstra.cpp:37:1: error: stray '\240' in program dijkstra.cpp:38:1: error: stray '\302' in program d[i]=d[pmin]+a[pmin][i]; ^ dijkstra.cpp:38:1: error: stray '\240' in program dijkstra.cpp:38:1: error: stray '\302' in program dijkstra.cpp:38:1: error: stray '\240' in program dijkstra.cpp:38:1: error: stray '\302' in program dijkstra.cpp:38:1: error: stray '\240' in program dijkstra.cpp:38:1: error: stray '\302' in program dijkstra.cpp:38:1: error: stray '\240' in program dijkstra.cpp:38:1: error: stray '\302' in program dijkstra.cpp:38:1: error: stray '\240' in program dijkstra.cpp:38:1: error: stray '\302' in program dijkstra.cpp:38:1: error: stray '\240' in program dijkstra.cpp:38:1: error: stray '\302' in program dijkstra.cpp:38:1: error: stray '\240' in program dijkstra.cpp:38:1: error: stray '\302' in program dijkstra.cpp:38:1: error: stray '\240' in program dijkstra.cpp:38:1: error: stray '\302' in program dijkstra.cpp:38:1: error: stray '\240' in program dijkstra.cpp:38:1: error: stray '\302' in program dijkstra.cpp:38:1: error: stray '\240' in program dijkstra.cpp:39:1: error: stray '\302' in program } ^ dijkstra.cpp:39:1: error: stray '\240' in program dijkstra.cpp:39:1: error: stray '\302' in program dijkstra.cpp:39:1: error: stray '\240' in program dijkstra.cpp:39:1: error: stray '\302' in program dijkstra.cpp:39:1: error: stray '\240' in program dijkstra.cpp:39:1: error: stray '\302' in program dijkstra.cpp:39:1: error: stray '\240' in program dijkstra.cpp:39:1: error: stray '\302' in program dijkstra.cpp:39:1: error: stray '\240' in program dijkstra.cpp:39:1: error: stray '\302' in program dijkstra.cpp:39:1: error: stray '\240' in program dijkstra.cpp:40:1: error: stray '\302' in program } ^ dijkstra.cpp:40:1: error: stray '\240' in program dijkstra.cpp:40:1: error: stray '\302' in program dijkstra.cpp:40:1: error: stray '\240' in program dijkstra.cpp:40:1: error: stray '\302' in program dijkstra.cpp:40:1: error: stray '\240' in program dijkstra.cpp:40:1: error: stray '\302' in program dijkstra.cpp:40:1: error: stray '\240' in program dijkstra.cpp:41:1: error: stray '\302' in program }while(pmin!=0); ^ dijkstra.cpp:41:1: error: stray '\240' in program dijkstra.cpp:41:1: error: stray '\302' in program dijkstra.cpp:41:1: error: stray '\240' in program dijkstra.cpp:42:1: error: stray '\302' in program for(int i=1;i<=n;i++) ^ dijkstra.cpp:42:1: error: stray '\240' in program dijkstra.cpp:42:1: error: stray '\302' in program dijkstra.cpp:42:1: error: stray '\240' in program dijkstra.cpp:43:1: error: stray '\302' in program if(d[i]==oo) fout<<-1<<" "; ^ dijkstra.cpp:43:1: error: stray '\240' in program dijkstra.cpp:43:1: error: stray '\302' in program dijkstra.cpp:43:1: error: stray '\240' in program dijkstra.cpp:43:1: error: stray '\302' in program dijkstra.cpp:43:1: error: stray '\240' in program dijkstra.cpp:43:1: error: stray '\302' in program dijkstra.cpp:43:1: error: stray '\240' in program dijkstra.cpp:44:1: error: stray '\302' in program else fout<<d[i]<<" "; ^ dijkstra.cpp:44:1: error: stray '\240' in program dijkstra.cpp:44:1: error: stray '\302' in program dijkstra.cpp:44:1: error: stray '\240' in program dijkstra.cpp:44:1: error: stray '\302' in program dijkstra.cpp:44:1: error: stray '\240' in program dijkstra.cpp:44:1: error: stray '\302' in program dijkstra.cpp:44:1: error: stray '\240' in program dijkstra.cpp:45:1: error: stray '\302' in program return 0; ^ dijkstra.cpp:45:1: error: stray '\240' in program dijkstra.cpp:45:1: error: stray '\302' in program dijkstra.cpp:45:1: error: stray '\240' in program
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Dijkstra face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.