#400
Pachete
Într-un depozit există un raft cu n+1
spații de depozitare, numerotate de la 1
la n+1
. Primele n
spatii de depozitare sunt ocupate cu n
pachete numerotate cu valori între 1
și n
, iar spațiul de depozitare n+1
este gol.
Administratorul depozitului decide mutarea pachetelor, astfel încât pentru orice i
, pachetul numerotat cu i
să se afle în spațiul de depozitare i
. Pentru aceasta se va folosi spațiul de depozitare suplimentar, n+1
, singura manevră validă fiind mutarea unui pachet dintr-un spațiu de depozitare în altul, cu condiția ca acesta să fie gol.
Determinați o succesiune de manevre prin care fiecare pachet să fie în spațiul corect.
Problema | Pachete | Operații I/O |
pachete.in /pachete.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #18067861 | Utilizator | |
Fișier | pachete.cpp | Dimensiune | 702 B |
Data încărcării | 28 Octombrie 2019, 10:36 | Scor / rezultat | Eroare de compilare |
pachete.cpp:8:1: error: stray '\342' in program { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:1: error: stray '\200' in program pachete.cpp:8:1: error: stray '\234' in program pachete.cpp:8:1: error: stray '\342' in program pachete.cpp:8:1: error: stray '\200' in program pachete.cpp:8:1: error: stray '\235' in program pachete.cpp:8:1: error: stray '\342' in program pachete.cpp:8:1: error: stray '\200' in program pachete.cpp:8:1: error: stray '\234' in program pachete.cpp:8:1: error: stray '\342' in program pachete.cpp:8:1: error: stray '\200' in program pachete.cpp:8:1: error: stray '\235' in program pachete.cpp:8:1: error: stray '\342' in program pachete.cpp:8:1: error: stray '\200' in program pachete.cpp:8:1: error: stray '\235' in program pachete.cpp:8:1: error: stray '\342' in program pachete.cpp:8:1: error: stray '\200' in program pachete.cpp:8:1: error: stray '\234' in program pachete.cpp: In function 'int main()': pachete.cpp:8:18: error: 'pachete' was not declared in this scope { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:301: error: 'a' was not declared in this scope { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:305: error: expected ';' before numeric constant { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:317: error: expected ';' before numeric constant { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:384: error: 'a' was not declared in this scope { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:388: error: expected ';' before numeric constant { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:397: error: expected ';' before numeric constant { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:464: error: 'a' was not declared in this scope { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:468: error: expected ';' before numeric constant { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:477: error: expected ';' before numeric constant { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:581: error: 'a' was not declared in this scope { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:585: error: expected ';' before numeric constant { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^ pachete.cpp:8:103: warning: unused variable 'a1502' [-Wunused-variable] { ifstream in(“pachete.in”); ofstream out(“pachete.out”); int n,m=0; in>>n; int v[n+2],u[n+2],a1502; for(int i=1;i<=n;i++) { in>>v[i]; u[v[i]]=i; } v[n+1]=0; int l=n+1; int sem=1; while(sem) { sem=0; for(int i=1;i<=n+1;i++) { if((v[i]!=i&&i!=n+1)||(i==n+1&&v[n+1]!=0)) { sem=1; if(v[i]==0) { a[m]0=u[i]; a[m]1=i; m++; l=u[i]; v[u[i]]=0; v[i]=i; u[i]=i; } else { if(l==n+1) { a[m]0=i; a[m]1=l; m++; v[n+1]=v[i]; u[i]=n+1; v[i]=0; l=i; } else if(v[i]==l) { a[m]0=i; a[m]1=v[i]; m++; l=i; u[v[i]]=v[i]; v[v[i]]=v[i]; v[i]=0; } } } } } out<<m<<endl; for(int i=0;i<m;i++) out<<a[i]0<<” “<<a[i]1<<endl; return 0; ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Pachete 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ă.