| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 854620 | 2023-09-28T07:53:06 Z | efedmrlr | Vlak (COCI20_vlak) | C++17 | 26 ms | 20568 KB |
#include <bits/stdc++.h>
using namespace std;
#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl
#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
struct TrieNode {
TrieNode *c[ALPH];
bool isA, isB;
TrieNode() {
isA = 0;
isB = 0;
for(int i = 0; i<ALPH; i++) {
c[i] = NULL;
}
}
void update(string s, int ind, bool type) {
if(type) {
isB = 1;
}
else {
isA = 1;
}
if(ind == s.size()) {
return;
}
if(c[s[ind] - 'a'] == NULL) {
c[s[ind] - 'a'] = new TrieNode();
}
c[s[ind] - 'a']->update(s, ind + 1, type);
}
bool query(int ind) {
bool ans = 0;
if(ind & 1) {
for(int i = 0; i<ALPH; i++) {
if(c[i] == NULL) continue;
if(c[i]->isB != 0) {
ans |= c[i]->query(ind + 1);
}
}
}
else {
for(int i = 0; i<ALPH; i++) {
if(c[i] == NULL) continue;
if(c[i]->isA != 0) {
ans |= !(c[i]->query(ind + 1) );
}
}
ans = !ans;
}
return ans;
}
};
inline void solve() {
cin >> n;
TrieNode *root = new TrieNode();
for(int i = 0; i<n; i++) {
string tmp;
cin >> tmp;
root->update(tmp, 0, 0);
}
cin >> m;
for(int i = 0; i<m; i++) {
string tmp;
cin >> tmp;
root->update(tmp, 0, 1);
}
bool res = root->query(0);
if(res) {
cout<<"Emilija\n";
}
else {
cout<<"Nina\n";
}
}
signed main() {
//freopen("milkvisits.in", "r", stdin);
//freopen("milkvisits.out", "w", stdout);
//fastio();
int test = 1;
//cin>>test;
while(test--) {
solve();
}
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 600 KB | Output is correct |
| 2 | Correct | 1 ms | 684 KB | Output is correct |
| 3 | Correct | 1 ms | 604 KB | Output is correct |
| 4 | Correct | 1 ms | 604 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 600 KB | Output is correct |
| 2 | Correct | 1 ms | 600 KB | Output is correct |
| 3 | Correct | 1 ms | 604 KB | Output is correct |
| 4 | Correct | 1 ms | 604 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 604 KB | Output is correct |
| 2 | Correct | 1 ms | 604 KB | Output is correct |
| 3 | Correct | 1 ms | 604 KB | Output is correct |
| 4 | Correct | 1 ms | 604 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 604 KB | Output is correct |
| 2 | Correct | 0 ms | 604 KB | Output is correct |
| 3 | Correct | 1 ms | 604 KB | Output is correct |
| 4 | Correct | 1 ms | 604 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 23 ms | 19288 KB | Output is correct |
| 2 | Correct | 22 ms | 18008 KB | Output is correct |
| 3 | Correct | 21 ms | 16980 KB | Output is correct |
| 4 | Correct | 22 ms | 18772 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 20 ms | 19540 KB | Output is correct |
| 2 | Correct | 22 ms | 20568 KB | Output is correct |
| 3 | Correct | 20 ms | 18776 KB | Output is correct |
| 4 | Correct | 26 ms | 19292 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 21 ms | 18524 KB | Output is correct |
| 2 | Correct | 21 ms | 18012 KB | Output is correct |
| 3 | Correct | 22 ms | 18524 KB | Output is correct |
| 4 | Correct | 26 ms | 19536 KB | Output is correct |