#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;
const ll mod2=998244353;
const ll inf=1e18*4;
const ld pai=acos(-1);
int n,q;
vector<string>v[270];
int num[270];
int main(){
cin>>n>>q;
for(int i=0;i<n;i++){
string x;cin>>x;
v[x[0]].pb(x);
}
for(int i=0;i<26;i++)sort(v[i+'a'].begin(),v[i+'a'].end());
while(q--){
char x;cin>>x;
if(num[x]==v[x].size())num[x]=0;
cout<<v[x][num[x]++]<<endl;
}
}
Compilation message
zigzag.cpp: In function 'int main()':
zigzag.cpp:36:23: warning: array subscript has type 'char' [-Wchar-subscripts]
v[x[0]].pb(x);
^
zigzag.cpp:41:25: warning: array subscript has type 'char' [-Wchar-subscripts]
if(num[x]==v[x].size())num[x]=0;
^
zigzag.cpp:41:31: warning: array subscript has type 'char' [-Wchar-subscripts]
if(num[x]==v[x].size())num[x]=0;
^
zigzag.cpp:41:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(num[x]==v[x].size())num[x]=0;
~~~~~~^~~~~~~~~~~~~
zigzag.cpp:41:45: warning: array subscript has type 'char' [-Wchar-subscripts]
if(num[x]==v[x].size())num[x]=0;
^
zigzag.cpp:42:26: warning: array subscript has type 'char' [-Wchar-subscripts]
cout<<v[x][num[x]++]<<endl;
^
zigzag.cpp:42:33: warning: array subscript has type 'char' [-Wchar-subscripts]
cout<<v[x][num[x]++]<<endl;
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
3 ms |
376 KB |
Output is correct |
4 |
Correct |
3 ms |
376 KB |
Output is correct |
5 |
Correct |
4 ms |
376 KB |
Output is correct |
6 |
Correct |
4 ms |
376 KB |
Output is correct |
7 |
Correct |
435 ms |
7864 KB |
Output is correct |
8 |
Correct |
439 ms |
8088 KB |
Output is correct |
9 |
Correct |
440 ms |
7888 KB |
Output is correct |
10 |
Correct |
439 ms |
7832 KB |
Output is correct |