| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 141673 | mariadinca | Lozinke (COCI17_lozinke) | C++14 | 272 ms | 2408 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
int n, sol, i, j, k, lung = 1;
string s[20001], secc;
map<string, int> m;
set<string> secv;
int cmp(string a, string b){
if(a.length() != b.length())
return a.length() < b.length();
return a < b;
}
int main(){
cin>>n;
for(i=1;i<=n;i++)
cin>>s[i]; /// parolele
sort(s+1, s+n+1, cmp);
/// acum trebuie sa iau fiecare cuvant, sa ii construiesc toate secventele si sa vad daca acele secvente pot debloca parole anterioare
for(i=1;i<=n;i++){
secv.clear(); /// asta este setul in care voi pune toate secventele cuvantului curent
for(j=0;s[i][j]!=0;j++){
secc.clear();
for(k=j;s[i][k]!=0;k++){
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||