# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154359 | PedroBigMan | ZigZag (COCI17_zigzag) | C++14 | 410 ms | 13600 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 <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <queue>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
#define si signed
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
vector<priority_queue<pair<ll,string> > > qi; priority_queue<pair<ll,string> > xx; REP(i,0,26) {qi.pb(xx);}
ll N,K; cin>>K>>N; string s;
REP(i,0,K)
{
cin>>s;
qi[(ll) (s[0]-'a')].push(mp(0,s));
}
vector<priority_queue<pl> > q;
vector<string> cur; vector<vector<string> > str;
char c; pair<ll,string> item;
REP(i,0,26)
{
cur.clear(); priority_queue<pl> xxx; ll j=0;
while(qi[i].size()>0) {item=qi[i].top(); cur.pb(item.ss); xxx.push(mp(0,j)); qi[i].pop();j++;}
q.pb(xxx); str.pb(cur);
}
pl ped; ll ind;
REP(i,0,N)
{
cin>>c; ind = (ll) (c-'a');
ped = q[ind].top(); q[ind].pop();
ped.ff--; cout<<str[ind][ped.ss]<<endl; q[ind].push(ped);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |