Submission #35378

#TimeUsernameProblemLanguageResultExecution timeMemory
35378RockyBZigZag (COCI17_zigzag)C++14
48 / 80
86 ms11156 KiB
/// In The Name Of God #pragma GCC optimize("Ofast") #pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx") #include <bits/stdc++.h> #define f first #define s second #define pb push_back #define pp pop_back #define mp make_pair #define sz(x) (int)x.size() #define sqr(x) ((x) * 1ll * (x)) #define all(x) x.begin(), x.end() #define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0); #define nl '\n' #define ioi exit(0); typedef long long ll; typedef long double ld; typedef unsigned long long ull; const int N = (int)5e5 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7; const ll linf = (ll)1e18 + 7; const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1}; using namespace std; int n, k; set < pair <int, string> > st[26]; int main() { #ifdef IOI2018 freopen ("in.txt", "r", stdin); #endif Kazakhstan cin >> n >> k; for (int i = 1; i <= n; i++) { string s; cin >> s; st[s[0] - 'a'].insert({0, s}); } for (int i = 1; i <= k; i++) { char x; cin >> x; x -= 'a'; pair <int, string> it = *st[x].begin(); cout << it.s << nl; st[x].erase(it); it.f++; st[x].insert(it); } ioi }

Compilation message (stderr)

zigzag.cpp: In function 'int main()':
zigzag.cpp:51:32: warning: array subscript has type 'char' [-Wchar-subscripts]
   pair <int, string> it = *st[x].begin();
                                ^
zigzag.cpp:53:7: warning: array subscript has type 'char' [-Wchar-subscripts]
   st[x].erase(it);
       ^
zigzag.cpp:55:7: warning: array subscript has type 'char' [-Wchar-subscripts]
   st[x].insert(it);
       ^
#Verdict Execution timeMemoryGrader output
Fetching results...