oj.uz

Submission #825936

# Submission time Handle Problem Language Result Execution time Memory
825936 2023-08-15T09:26:25 Z ajay ZigZag (COCI17_zigzag) C++14
80 / 80
 101 ms 8624 KB 
/* Ajay Jadhav */

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'

void solve()
{
    int n, k;
    cin >> n >> k;
    priority_queue<pair<int, string>, vector<pair<int, string>>, greater<pair<int, string>>> pq[26];
    rep(i, 0, n)
    {
        string s;
        cin >> s;
        pq[s[0] - 'a'].push({1, s});
    }

    rep(i, 0, k)
    {
        char ch;
        cin >> ch;
        pair<int, string> ans = pq[ch - 'a'].top();
        pq[ch - 'a'].pop();
        pq[ch - 'a'].push({ans.x + 1, ans.y});
        cout << ans.y << endl;
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 101 ms 8568 KB Output is correct
8 Correct 66 ms 8488 KB Output is correct
9 Correct 82 ms 8500 KB Output is correct
10 Correct 67 ms 8624 KB Output is correct