# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42283 | milmillin | ZigZag (COCI17_zigzag) | C++14 | 243 ms | 13872 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 <cstdio>
#include <vector>
#include <queue>
#include <string>
#include <iostream>
using namespace std;
struct word {
string x;
int cnt;
};
bool operator< (const word &a, const word&b) {
if (a.cnt!=b.cnt) return a.cnt>b.cnt;
return a.x>b.x;
}
priority_queue<word> qq[30];
int main () {
int k,n;
scanf("%d%d",&k,&n);
string x;
for (int i=0;i<k;i++) {
cin>>x;
qq[x[0]-'a'].push(word{x,0});
}
char xx;
word now;
for (int i=0;i<n;i++) {
scanf(" %c",&xx);
now = qq[xx-'a'].top();
qq[xx-'a'].pop();
cout << now.x << '\n';
now.cnt++;
qq[xx-'a'].push(now);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |