Submission #211959

#TimeUsernameProblemLanguageResultExecution timeMemory
211959tleontest1ZigZag (COCI17_zigzag)C++14
0 / 80
49 ms65540 KiB
#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; set<string> st[27][li]; vector<int> v; int main(void){ fio(); cin>>n>>k; FOR{ cin>>s; st[s[0]-'a'][0].insert(s); } while(k--){ char c; cin>>c; while(st[c-'a'][a[c-'a']].size()==0)a[c-'a']++; auto it=st[c-'a'][a[c-'a']].begin(); cout<<*it<<endl; st[c-'a'][a[c-'a']+1].insert(*it); st[c-'a'][a[c-'a']].erase(it); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...