## Submission #473125

# Submission time Handle Problem Language Result Execution time Memory
473125 2021-09-15T08:24:45 Z SaraMostafa ZigZag (COCI17_zigzag) C++14
48 / 80
2000 ms 18840 KB
```#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define endl "\n"
#define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const long long mod=1e9+7;
const double PI=acos(-1);
// 1 2 3 --> 1,2,3 ...1,2..1,3..1..2,3..2..3..none (2 power number of elements)
//1 2 3 --> 2--> 1,2..1,3..2,3..(!n/(r!(n-r)!)) aka:ncr
// 1 2 3 -->2-->1,2..2,1..1,3..3,1..2,3..3,2..(n!/(n-r)!) aka:npr
//1 2 3--> 1..1,2..1,2,3..2..2,3..3  number of subarrays -->(n*(n+1))/2 "sum of numbers from 1 to n."
/*
ll power(ll x,ll y)
{
if(y==0)
return 1;
else if(y==1)
return x%mod;
ll  r=power(x%mod,((y%mod)/2)%mod);
if(y%2==0)
return ((r%mod)*(r%mod));
else
return ((r%mod)*(r%mod)*(x%mod));
}

ll inverse(ll md,ll x)
{
return power(x%mod,mod-2);
}

*/
map<string,ll>fr;
bool cmp(string a,string b)
{
if(fr[a]!=fr[b])
return fr[a]<fr[b];
return a<b;
}
int main()
{
//freopen("input.in","r",stdin);

Sara

int k,n;
cin>>k>>n;
vector<string>v(k);
map<char,vector<string>>mp;
for(int i=0; i<k; i++)
{
cin>>v[i];
mp[v[i][0]].push_back(v[i]);
}

vector<char>c(n);
for(int i=0; i<n; i++)
{
cin>>c[i];
sort(mp[c[i]].begin(),mp[c[i]].end(),cmp);
cout<<mp[c[i]][0]<<endl;
fr[mp[c[i]][0]]++;

}
return 0;
}

```

#### Subtask #1 48.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 9 ms 332 KB Output is correct
5 Correct 10 ms 332 KB Output is correct
6 Correct 12 ms 332 KB Output is correct
7 Execution timed out 2080 ms 18704 KB Time limit exceeded
8 Execution timed out 2076 ms 18840 KB Time limit exceeded
9 Execution timed out 2070 ms 18492 KB Time limit exceeded
10 Execution timed out 2063 ms 18796 KB Time limit exceeded