# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
681845 | Vladth11 | ZigZag (COCI17_zigzag) | C++14 | 192 ms | 16232 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>
#pragma GCC optimize("Ofast")
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
using namespace std;
typedef pair <int, int> pii;
typedef long long ll;
const int NMAX = 100001;
const int VMAX = 41;
const int INF = 1e9;
const int MOD = 1000000009;
const int BLOCK = 318;
const int base = 31;
const int nrbits = 21;
vector <int> v[2][27];
string s[NMAX];
string org[NMAX];
int indice[27];
int main() {
#ifdef HOME
ifstream cin(".in");
ofstream cout(".out");
#endif // HOME
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m, i, maxim = 0;
cin >> n >> m;
for(i = 1; i <= n; i++){
cin >> s[i];
org[i] = s[i];
for(int j = 0; j < s[i].size(); j++) s[i][j]++;
maxim = max(maxim, (int)s[i].size());
}
for(i = 1; i <= n; i++){
while(s[i].size() < maxim){
s[i] += 'a';
}
}
maxim--;
for(i = 1; i <= n; i++)
v[1 - (maxim%2)][0].push_back(i);
for(i = maxim; i >= 0; i--){
int act = i%2;
int last = 1 - act;
for(int j = 0; j < 27; j++){
for(auto x : v[last][j]){
v[act][s[x][i] - 'a'].push_back(x);
}
v[last][j].clear();
}
}
while(m--){
char c;
int ind;
cin >> c;
ind = c - 'a';
ind++;
cout << org[v[0][ind][indice[ind]]] << "\n";
indice[ind]++;
if(indice[ind] == v[0][ind].size()) indice[ind] = 0;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |