# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37978 | 2017-12-29T19:32:42 Z | wasyl | ZigZag (COCI17_zigzag) | C++11 | 196 ms | 7396 KB |
#include <vector> #include <iostream> #include <algorithm> #define d(...) __VA_ARGS__ #define all(x) (x).begin(), (x).end() #define eb(...) emplace_back(__VA_ARGS__) using namespace std;using ll=long long; template<class t>using V = vector< t >; int n, k; V< string > tab [26]; int main() { ios::sync_with_stdio(false); cin >> k >> n; for ( int i = 0; i < k; ++i ) { string z; cin >> z; tab[z[0] - 'a'].eb( move( z ) ); } V< int > pt( 26 ); for ( int i = 0; i < 26; ++i ) sort( all( tab[i] ) ); for ( int i = 0; i < n; ++i ) { char c; cin >> c; c -= 'a'; if ( pt[c] == tab[c].size() ) pt[c] = 0; cout << tab[c][pt[c]] << '\n'; ++pt[c]; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2180 KB | Output is correct |
2 | Correct | 0 ms | 2180 KB | Output is correct |
3 | Correct | 0 ms | 2180 KB | Output is correct |
4 | Correct | 3 ms | 2180 KB | Output is correct |
5 | Correct | 3 ms | 2180 KB | Output is correct |
6 | Correct | 0 ms | 2180 KB | Output is correct |
7 | Runtime error | 149 ms | 7284 KB | Execution timed out (wall clock limit exceeded) |
8 | Correct | 176 ms | 7380 KB | Output is correct |
9 | Runtime error | 196 ms | 7396 KB | Execution timed out (wall clock limit exceeded) |
10 | Runtime error | 156 ms | 7384 KB | Execution timed out (wall clock limit exceeded) |