## Submission #473123

# Submission time Handle Problem Language Result Execution time Memory
473123 2021-09-15T08:22:07 Z HossamHero7 ZigZag (COCI17_zigzag) C++14
80 / 80
93 ms 16904 KB
```#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef vector <ll> row;
typedef vector <row> matrix;
#define endl '\n'
#define fast ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define all(v) ((v).begin()), ((v).end())
#define allR(v) ((v).rbegin()), ((v).rend())
#define For(i,n) for(int i=0;i<(int)(n);i++)
#define sz(v) v.size()
#define swapS(a,b) if(a>b) swap(a,b)
const ll mod = 1e9+7;
const ll OO = 1e18;
const ll invalid = -1e18;
int dx[] = {0,0,-1,1,1,1,-1,-1};
int dy[] = {1,-1,0,0,1,-1,-1,1};
ll fixMod(ll x){
return ((x%mod) + mod) % mod;
}
ll lcm(ll a,ll b){
return max(a,b)/__gcd(a,b)*min(a,b);
}
ll power(ll a,ll b){
if(b==0) return 1;
if(b==1) return a;
if(b&1){
ll y=power(a,b/2);
return (y*y*a);
}
else {
ll y=power(a,b/2);
return (y*y);
}
}
ll inv(ll n){
return power(n,(mod-2));
}
matrix zero(int n,int m){
return matrix(n,row(m,0));
}
matrix identity(int n){
matrix ret = zero(n,n);
for(int i=0;i<n;i++){
ret[i][i] = 1;
}
return ret;
}
matrix multiply(const matrix &a, const matrix &b){
matrix ret = zero(a.size(),b[0].size());
for(int i=0;i<a.size();i++){
for(int k=0;k<a[0].size();k++){
for(int j=0;j<b[0].size();j++){
ret[i][j] += a[i][k] * b[k][j];
ret[i][j] = ret[i][j];
}
}
}
return ret;
}
matrix matrixPower(matrix &a,ll b){
if(b == 0) return identity(a.size());
if(b == 1) return a;
matrix r = matrixPower(a,b/2);
if(b&1) return multiply(multiply(r,r),a);
return multiply(r,r);
}
void solve(){
int n,m;
cin>>n>>m;
vector <pair<vector<string>,int> > v(26);
vector <string> temp(n);
for(int i=0;i<n;i++){
string s;
cin>>s;
temp.push_back(s);
}
sort(temp.begin(),temp.end());
for(auto i : temp){
v[i[0]-'a'].first.push_back(i);
v[i[0]-'a'].second = 0;
}
while(m--){
char c;
cin>>c;
c -= 'a';
cout<<v[c].first[v[c].second%v[c].first.size()]<<endl;
v[c].second ++;
}

}
int main()
{
fast
ll t=1;
// cin>>t;
while(t--){
//Some important Notes:
//  1- Any minus with mod fixed mod
//  2- Any divide with mod inverse
//  3- Any mod problem make mod in every where
//  4- Any dp problem don't forget to return the saved value :)
solve();
}
return 0;
}
```

### Compilation message

```zigzag.cpp: In function 'matrix multiply(const matrix&, const matrix&)':
zigzag.cpp:52:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 |     for(int i=0;i<a.size();i++){
|                 ~^~~~~~~~~
zigzag.cpp:53:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 |         for(int k=0;k<a[0].size();k++){
|                     ~^~~~~~~~~~~~
zigzag.cpp:54:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
54 |             for(int j=0;j<b[0].size();j++){
|                         ~^~~~~~~~~~~~```

#### Subtask #1 80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 92 ms 16884 KB Output is correct
8 Correct 93 ms 16824 KB Output is correct
9 Correct 90 ms 16852 KB Output is correct
10 Correct 93 ms 16904 KB Output is correct