#2561
Se consideră un set de două șiruri de caractere X și Y. Șirul X este format din caractere din mulțimea {'A'..'Z', 'a' ..'z', '*'}, iar șirul Y este format din caractere din mulțimea {'A'..'Z', 'a'..'z'}. Lungimea șirului Y este mai mare sau egală cu numărul de caractere * din X. Caracterele * din șirul X vor fi înlocuite cu caractere din Y, evident fără a depăși numărul de apariții ale acestora. Fiind date N seturi de câte două șiruri fiecare, (X1, Y1), (X2, Y2), …, (XN, YN), să se determine lungimea celui mai lung subșir strict crescător ce se poate forma în Xi prin înlocuirea caracterelor * cu caractere din Yi, 1 ≤ i ≤ N.
Balcaniada de Informatică 2018, ziua de antrenament
| Problema | addchar | Operații I/O |
addchar.in/addchar.out
|
|---|---|---|---|
| Limita timp | 0.2 secunde | Limita memorie |
Total: 128 MB
/
Stivă 32 MB
|
| Id soluție | #58737081 | Utilizator | |
| Fișier | addchar.cpp | Dimensiune | 2.36 KB |
| Data încărcării | 28 Iulie 2025, 19:36 | Scor/rezultat | Eroare de compilare |
addchar.cpp:1:1: error: stray '\310' in program Compania lui Jimmy are n plantații cu flori. Pentru fiecare plantație se cunoaște tipul florilor cultivate, respectiv câte tone de flori au fost produse anul acesta. Se cunoaște că plantațiile cu flori sunt conectate prin n - 1 drumuri astfel încât la fiecare plantație se poate ajunge de la oricare altă plantație și există un singur mod de ajunge de la plantația x la plantația y , pentru fiecare 1 ≤ x, y ≤ n. De asemenea, știm și distanța în km pentru fiecare dintre cele n - 1 drumuri. ^ addchar.cpp:1:1: error: stray '\233' in program addchar.cpp:1:1: error: stray '\310' in program addchar.cpp:1:1: error: stray '\233' in program addchar.cpp:1:1: error: stray '\310' in program addchar.cpp:1:1: error: stray '\231' in program addchar.cpp:1:1: error: stray '\303' in program addchar.cpp:1:1: error: stray '\242' in program addchar.cpp:1:1: error: stray '\310' in program addchar.cpp:1:1: error: stray '\231' in program addchar.cpp:1:1: error: stray '\304' in program addchar.cpp:1:1: error: stray '\203' in program addchar.cpp:1:1: error: stray '\310' in program addchar.cpp:1:1: error: stray '\233' in program addchar.cpp:1:1: error: stray '\303' in program addchar.cpp:1:1: error: stray '\256' in program addchar.cpp:1:1: error: stray '\303' in program addchar.cpp:1:1: error: stray '\242' in program addchar.cpp:1:1: error: stray '\310' in program addchar.cpp:1:1: error: stray '\233' in program addchar.cpp:1:1: error: stray '\304' in program addchar.cpp:1:1: error: stray '\203' in program addchar.cpp:1:1: error: stray '\310' in program addchar.cpp:1:1: error: stray '\233' in program addchar.cpp:1:1: error: stray '\310' in program addchar.cpp:1:1: error: stray '\231' in program addchar.cpp:1:1: error: stray '\304' in program addchar.cpp:1:1: error: stray '\203' in program addchar.cpp:1:1: error: stray '\310' in program addchar.cpp:1:1: error: stray '\233' in program addchar.cpp:1:1: error: stray '\310' in program addchar.cpp:1:1: error: stray '\233' in program addchar.cpp:1:1: error: stray '\342' in program addchar.cpp:1:1: error: stray '\211' in program addchar.cpp:1:1: error: stray '\244' in program addchar.cpp:1:1: error: stray '\342' in program addchar.cpp:1:1: error: stray '\211' in program addchar.cpp:1:1: error: stray '\244' in program addchar.cpp:1:1: error: stray '\310' in program addchar.cpp:1:1: error: stray '\231' in program addchar.cpp:1:1: error: stray '\310' in program addchar.cpp:1:1: error: stray '\231' in program addchar.cpp:1:1: error: stray '\310' in program addchar.cpp:1:1: error: stray '\233' in program addchar.cpp:1:1: error: stray '\303' in program addchar.cpp:1:1: error: stray '\256' in program addchar.cpp:2:1: error: stray '\310' in program Cerința ^ addchar.cpp:2:1: error: stray '\233' in program addchar.cpp:3:1: error: stray '\304' in program Jimmy vrea să aducă toate florile de același tip în același loc, cu cost minim de transport. Dacă avem a tone de flori şi vrem să le trimitem pe o distanță de b kilometri, costul transportului este a * b. Pentru fiecare tip de floare Jimmy vrea să determine costul minim de transport pentru a aduce toate florile de același tip la un loc. ^ addchar.cpp:3:1: error: stray '\203' in program addchar.cpp:3:1: error: stray '\304' in program addchar.cpp:3:1: error: stray '\203' in program addchar.cpp:3:1: error: stray '\310' in program addchar.cpp:3:1: error: stray '\231' in program addchar.cpp:3:1: error: stray '\303' in program addchar.cpp:3:1: error: stray '\256' in program addchar.cpp:3:1: error: stray '\310' in program addchar.cpp:3:1: error: stray '\231' in program addchar.cpp:3:1: error: stray '\304' in program addchar.cpp:3:1: error: stray '\203' in program addchar.cpp:3:1: error: stray '\305' in program addchar.cpp:3:1: error: stray '\237' in program addchar.cpp:3:1: error: stray '\304' in program addchar.cpp:3:1: error: stray '\203' in program addchar.cpp:3:1: error: stray '\310' in program addchar.cpp:3:1: error: stray '\233' in program addchar.cpp:3:1: error: stray '\304' in program addchar.cpp:3:1: error: stray '\203' in program addchar.cpp:3:1: error: stray '\304' in program addchar.cpp:3:1: error: stray '\203' in program addchar.cpp:3:1: error: stray '\310' in program addchar.cpp:3:1: error: stray '\231' in program addchar.cpp:5:1: error: stray '\304' in program Pe prima linie se va găsi numărul n, apoi, pe cea de-a doua linie, n litere mici separate între ele prin câte un spațiu, care simbolizează tipul de floare produs pe plantația i (fiecare tip de floare este o literă mică a alfabetului englez). Pe cea de-a treia linie se găsesc n numere întregi care reprezintă câte tone din fiecare floare au fost produse pe plantația i. Pe fiecare dintre următoarele n - 1 linii se găsesc trei numere naturale x, y, d, cu semnificația că există drum direct între plantațiile x şi y, iar numărul d reprezintă distanța de la x la y. ^ addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\304' in program addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\303' in program addchar.cpp:5:1: error: stray '\256' in program addchar.cpp:5:1: error: stray '\303' in program addchar.cpp:5:1: error: stray '\242' in program addchar.cpp:5:1: error: stray '\310' in program addchar.cpp:5:1: error: stray '\233' in program addchar.cpp:5:1: error: stray '\304' in program addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\310' in program addchar.cpp:5:1: error: stray '\233' in program addchar.cpp:5:1: error: stray '\304' in program addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\304' in program addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\304' in program addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\303' in program addchar.cpp:5:1: error: stray '\256' in program addchar.cpp:5:1: error: stray '\304' in program addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\303' in program addchar.cpp:5:1: error: stray '\242' in program addchar.cpp:5:1: error: stray '\310' in program addchar.cpp:5:1: error: stray '\233' in program addchar.cpp:5:1: error: stray '\304' in program addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\304' in program addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\310' in program addchar.cpp:5:1: error: stray '\233' in program addchar.cpp:5:1: error: stray '\304' in program addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\304' in program addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\303' in program addchar.cpp:5:1: error: stray '\256' in program addchar.cpp:5:1: error: stray '\310' in program addchar.cpp:5:1: error: stray '\233' in program addchar.cpp:5:1: error: stray '\305' in program addchar.cpp:5:1: error: stray '\237' in program addchar.cpp:5:1: error: stray '\304' in program addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\304' in program addchar.cpp:5:1: error: stray '\203' in program addchar.cpp:5:1: error: stray '\310' in program addchar.cpp:5:1: error: stray '\233' in program addchar.cpp:6:1: error: stray '\310' in program Date de ieșire ^ addchar.cpp:6:1: error: stray '\231' in program addchar.cpp:7:1: error: stray '\310' in program Pe prima linie se afișează 26 de numere separate prin spațiu, al i-lea număr reprezentând costul minim de transport pentru tipul de floare specificat de litera de pe poziția i în alfabetul englez (răspunsurile sunt în ordinea în care literele se găsesc în alfabet). ^ addchar.cpp:7:1: error: stray '\231' in program addchar.cpp:7:1: error: stray '\304' in program addchar.cpp:7:1: error: stray '\203' in program addchar.cpp:7:1: error: stray '\310' in program addchar.cpp:7:1: error: stray '\233' in program addchar.cpp:7:1: error: stray '\304' in program addchar.cpp:7:1: error: stray '\203' in program addchar.cpp:7:1: error: stray '\303' in program addchar.cpp:7:1: error: stray '\242' in program addchar.cpp:7:1: error: stray '\310' in program addchar.cpp:7:1: error: stray '\233' in program addchar.cpp:7:1: error: stray '\303' in program addchar.cpp:7:1: error: stray '\256' in program addchar.cpp:7:1: error: stray '\304' in program addchar.cpp:7:1: error: stray '\203' in program addchar.cpp:7:1: error: stray '\303' in program addchar.cpp:7:1: error: stray '\256' in program addchar.cpp:7:1: error: stray '\303' in program addchar.cpp:7:1: error: stray '\256' in program addchar.cpp:7:1: error: stray '\304' in program addchar.cpp:7:1: error: stray '\203' in program addchar.cpp:7:1: error: stray '\303' in program addchar.cpp:7:1: error: stray '\256' in program addchar.cpp:8:1: error: stray '\310' in program Restricții și precizări ^ addchar.cpp:8:1: error: stray '\233' in program addchar.cpp:8:1: error: stray '\310' in program addchar.cpp:8:1: error: stray '\231' in program addchar.cpp:8:1: error: stray '\304' in program addchar.cpp:8:1: error: stray '\203' in program addchar.cpp:9:1: error: stray '\342' in program • 4 ≤ n < 200 001. ^ addchar.cpp:9:1: error: stray '\200' in program addchar.cpp:9:1: error: stray '\242' in program addchar.cpp:9:1: error: stray '\342' in program addchar.cpp:9:1: error: stray '\211' in program addchar.cpp:9:1: error: stray '\244' in program addchar.cpp:10:1: error: stray '\342' in program • Fiecare dintre numerele din datele de intrare este un număr natural mai mic decât 200 001. ^ addchar.cpp:10:1: error: stray '\200' in program addchar.cpp:10:1: error: stray '\242' in program addchar.cpp:10:1: error: stray '\304' in program addchar.cpp:10:1: error: stray '\203' in program addchar.cpp:10:1: error: stray '\303' in program addchar.cpp:10:1: error: stray '\242' in program addchar.cpp:11:1: error: stray '\342' in program • Destinaţia finală a fiecărui transport este una dintre cele n plantaţii existente. ^ addchar.cpp:11:1: error: stray '\200' in program addchar.cpp:11:1: error: stray '\242' in program addchar.cpp:11:1: error: stray '\305' in program addchar.cpp:11:1: error: stray '\243' in program addchar.cpp:11:1: error: stray '\304' in program addchar.cpp:11:1: error: stray '\203' in program addchar.cpp:11:1: error: stray '\304' in program addchar.cpp:11:1: error: stray '\203' in program addchar.cpp:11:1: error: stray '\305' in program addchar.cpp:11:1: error: stray '\243' in program addchar.cpp:12:1: error: stray '\342' in program • Dacă există litere care nu reprezintă codul tipului unei flori, atunci costul minim de transport pentru acel tip este 0. ^ addchar.cpp:12:1: error: stray '\200' in program addchar.cpp:12:1: error: stray '\242' in program addchar.cpp:12:1: error: stray '\304' in program addchar.cpp:12:1: error: stray '\203' in program addchar.cpp:12:1: error: stray '\304' in program addchar.cpp:12:1: error: stray '\203' in program addchar.cpp:12:1: error: stray '\304' in program addchar.cpp:12:1: error: stray '\203' in program addchar.cpp:13:1: error: stray '\342' in program • Pentru 20% din teste, n < 1000. ^ addchar.cpp:13:1: error: stray '\200' in program addchar.cpp:13:1: error: stray '\242' in program addchar.cpp:14:1: error: stray '\342' in program • Pentru alte 25% din teste, n < 100 000. ^ addchar.cpp:14:1: error: stray '\200' in program addchar.cpp:14:1: error: stray '\242' in program addchar.cpp:23:1: error: stray '\310' in program Ieșire ^ addchar.cpp:23:1: error: stray '\231' in program addchar.cpp:1:1: error: 'Compania' does not name a type Compania lui Jimmy are n plantații cu flori. Pentru fiecare plantație se cunoaște tipul florilor cultivate, respectiv câte tone de flori au fost produse anul acesta. Se cunoaște că plantațiile cu flori sunt conectate prin n - 1 drumuri astfel încât la fiecare plantație se poate ajunge de la oricare altă plantație și există un singur mod de ajunge de la plantația x la plantația y , pentru fiecare 1 ≤ x, y ≤ n. De asemenea, știm și distanța în km pentru fiecare dintre cele n - 1 drumuri. ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema addchar 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ă.