oj.uz

Submission #481415

# Submission time Handle Problem Language Result Execution time Memory
481415 2021-10-20T18:03:33 Z sanskar Vlak (COCI20_vlak) C++17
70 / 70
 225 ms 454612 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef double lf;
typedef long double Lf;
typedef pair <int,int> pii;
typedef pair <ll, ll> pll;

#define TRACE(x) cerr << #x << "  " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define _ << " " <<

#define fi first
#define sec second
#define mp make_pair
#define pb push_back

const int ABC = 28;
const int MAXN = 1000010;

struct Node {
  int state;
  Node *child[ABC];

  Node() {
    state = 0;
    REP(i, ABC) child[i] = NULL;
  }
};

int cnt;
Node nodes[MAXN * 2];

Node *newNode() {
  return &nodes[cnt++];
}

struct Trie {
  Node *root;

  Trie() {
    root = newNode();
  }

  void insert(Node *node, string &s, int pos, int mask) {
    if (pos == (int)s.size()) {
      return;
    }
    node->state |= mask;

    if (!node->child[s[pos] - 'a']) {
      node->child[s[pos] - 'a'] = newNode();
    }
    insert(node->child[s[pos] - 'a'], s, pos + 1, mask);
  }

  int solve(Node *node, int turn) {
    if (!(node->state & (1 << turn))) {
      return 0;
    }

    for (int i = 0; i < ABC; i++) {
      if (node->child[i] && !solve(node->child[i], turn ^ 1)) {
        return 1;
      }
    }
    return 0;
  }
};

Trie T;

const string ans[] = {"Emilija", "Nina"};

int main() {
  for (int i = 0; i < 2; i++) {
    int n;
    string s;
    cin >> n;
    for (int j = 0; j < n; j++) {
      cin >> s;
      T.insert(T.root, s, 0, (1 << i));
    }
  }

  cout << ans[T.solve(T.root, 0)] << endl;
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 454244 KB Output is correct
2 Correct 215 ms 454188 KB Output is correct
3 Correct 192 ms 454228 KB Output is correct
4 Correct 212 ms 454224 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 454256 KB Output is correct
2 Correct 209 ms 454188 KB Output is correct
3 Correct 189 ms 454324 KB Output is correct
4 Correct 191 ms 454412 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 454288 KB Output is correct
2 Correct 192 ms 454300 KB Output is correct
3 Correct 220 ms 454200 KB Output is correct
4 Correct 185 ms 454224 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 454224 KB Output is correct
2 Correct 191 ms 454184 KB Output is correct
3 Correct 194 ms 454196 KB Output is correct
4 Correct 185 ms 454252 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 454472 KB Output is correct
2 Correct 201 ms 454432 KB Output is correct
3 Correct 192 ms 454468 KB Output is correct
4 Correct 203 ms 454480 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 454468 KB Output is correct
2 Correct 194 ms 454420 KB Output is correct
3 Correct 201 ms 454392 KB Output is correct
4 Correct 206 ms 454612 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 454468 KB Output is correct
2 Correct 203 ms 454528 KB Output is correct
3 Correct 203 ms 454396 KB Output is correct
4 Correct 194 ms 454476 KB Output is correct