# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
238712 | Borbi | Trener (COCI20_trener) | C++14 | 12 ms | 2816 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 <bits/stdc++.h>
using namespace std;
const int MAXN = 1505;
const int MAXK = 55;
int n, k;
vector <string> v[MAXN];
map <string, vector<int>> str[MAXN];;
void read_input()
{
cin >> n >> k;
string s;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < k; j++)
{
cin >> s;
v[i].push_back(s);
if(i > 0)
{
string f = s.substr(0, i);
str[i][f].push_back(j);
//cout << f << "\n";
f = s.substr(1, i + 1);
str[i][f].push_back(j);
//cout << f << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |