# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
105496 | 2019-04-12T17:45:52 Z | leonarda | ZigZag (COCI17_zigzag) | C++14 | 259 ms | 12284 KB |
#include<bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair #define F first #define S second typedef pair<int, int> pi; typedef long long int lint; const int inf = 0x3f3f3f3f; const int maxn = 1e5; int n, k; vector< string > v; queue< string > q[26]; int main () { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> k >> n; v.reserve(k); for(int i = 0; i < k; ++i) { string s; cin >> s; v.pb(s); } sort(v.begin(), v.end()); for(int i = 0; i < v.size(); ++i) { q[v[i][0] - 'a'].push(v[i]); } for(int i = 0; i < n; ++i) { char c; cin >> c; string out = q[c - 'a'].front(); q[c - 'a'].pop(); q[c - 'a'].push(out); cout << out << endl; } return 0; } // :)
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 384 KB | Output is correct |
2 | Correct | 3 ms | 384 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
4 | Correct | 3 ms | 384 KB | Output is correct |
5 | Correct | 3 ms | 384 KB | Output is correct |
6 | Correct | 7 ms | 640 KB | Output is correct |
7 | Correct | 259 ms | 12284 KB | Output is correct |
8 | Correct | 238 ms | 12280 KB | Output is correct |
9 | Correct | 230 ms | 12280 KB | Output is correct |
10 | Correct | 227 ms | 12280 KB | Output is correct |