# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211964 | tleontest1 | ZigZag (COCI17_zigzag) | C++14 | 332 ms | 13060 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.
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const int li = 100002;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
int cev;
string s[li];
set<int> st[27][4];
vector<int> v;
int main(void){
fio();
cin>>n>>k;
FOR{
cin>>s[i];
}
sort(s+1,s+n+1);
FOR{
st[s[i][0]-'a'][0].insert(i);
}
while(k--){
char c;
cin>>c;
while(st[c-'a'][a[c-'a']].size()==0)a[c-'a']=!a[c-'a'];
auto it=st[c-'a'][a[c-'a']].begin();
cout<<s[*it]<<endl;
st[c-'a'][!a[c-'a']].insert(*it);
st[c-'a'][a[c-'a']].erase(it);
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |