oj.uz

답안 #447298

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447298 2021-07-26T02:22:21 Z 2548631 ZigZag (COCI17_zigzag) C++17
80 / 80
 176 ms 12608 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vii> vvii;

#define fastIO ios::sync_with_stdio(false), cin.tie(NULL)
#define forw(i, l, r) for( int i = (l) ; i < (r) ; i++ )
#define forb(i, r, l) for( int i = (r) ; i >= (l) ; i-- )
#define log2i(x) (64 - __builtin_clzll(1ll * (x)) - 1)
#define numBit(x) (__builtin_popcountll(1ll * (x)))
#define getBit(x, i) ((x) >> (i) & 1)
#define Pi acos(-1.0l)
#define sz(x) int(x.size())
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(x) cerr << #x << " = " << x << '\n';

const int N = 1e5 + 7;
int n, q;
set<pair<int, pair<string, int> > > d[26];

int main() {
    fastIO;
#ifndef ONLINE_JUDGE
    //freopen("test.inp","r",stdin);
    //freopen("test.out","w",stdout);
#endif

    cin >> n >> q;
    forw(i, 0, n) {
        string st; cin >> st;
        d[st[0] - 'a'].insert(mp(0, mp(st, i)));
    }
    while(q--) {
        char c; cin >> c;
        auto tmp = *d[c - 'a'].begin();
        d[c - 'a'].erase(d[c - 'a'].begin());
        cout << tmp.se.fi << '\n';
        tmp.fi++;
        d[c - 'a'].insert(tmp);
    }
    return 0;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 176 ms 12388 KB Output is correct
8 Correct 156 ms 12396 KB Output is correct
9 Correct 148 ms 12608 KB Output is correct
10 Correct 146 ms 12484 KB Output is correct