oj.uz

답안 #960381

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960381 2024-04-10T11:04:55 Z hariaakas646 Vlak (COCI20_vlak) C++14
70 / 70
 19 ms 21340 KB 
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;


void usaco()
{
    freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
//    freopen("problem.out", "w", stdout);
}

void fastio()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int trie[200005][26] = {-1};
bool player[200005][2] = {false};
int idx = 0;

void add(string str, int id) {
    int x = 0;
    frange(i, str.size()) {
        int c = str[i] - 'a';
        if(trie[x][c] != -1) {
            x = trie[x][c];
            player[x][id] = true;
        }
        else {
            trie[x][c] = ++idx;
            x = idx;
            player[x][id] = true;
        }
    }
}

bool dfs(int x, int id) {
    bool out = true;
    frange(i, 26) {
        if(trie[x][i] != -1) {
            int e = trie[x][i];
            if(player[e][!id]) {
                bool v = dfs(e, !id);
                if(v) out = false;
            }
        }
    }
    return out;
}

int main() {
    // usaco();
    int n;
    cin >> n;
    frange(i, 200005) {
        frange(j, 26) trie[i][j] = -1;
        frange(j, 2) player[i][j] = false;
    }
    frange(i, n) {
        string str;
        cin >> str;
        add(str, 0);
    }
    int m;
    cin >> m;
    frange(i, m) {
        string str;
        cin >> str;
        add(str, 1);
    }
    if(!dfs(0, 1)) printf("Nina");
    else printf("Emilija");
}

Compilation message

Main.cpp: In function 'void add(std::string, int)':
Main.cpp:7:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define forr(i, j, k) for (int i = j; i < k; i++)
      |                                         ^
Main.cpp:8:22: note: in expansion of macro 'forr'
    8 | #define frange(i, j) forr(i, 0, j)
      |                      ^~~~
Main.cpp:47:5: note: in expansion of macro 'frange'
   47 |     frange(i, str.size()) {
      |     ^~~~~~
Main.cpp: In function 'void usaco()':
Main.cpp:30:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 21080 KB Output is correct
2 Correct 13 ms 21084 KB Output is correct
3 Correct 12 ms 21084 KB Output is correct
4 Correct 10 ms 21084 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 21084 KB Output is correct
2 Correct 11 ms 21084 KB Output is correct
3 Correct 10 ms 21084 KB Output is correct
4 Correct 11 ms 21084 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 21084 KB Output is correct
2 Correct 11 ms 21084 KB Output is correct
3 Correct 11 ms 21116 KB Output is correct
4 Correct 10 ms 21080 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 21080 KB Output is correct
2 Correct 10 ms 21084 KB Output is correct
3 Correct 10 ms 21084 KB Output is correct
4 Correct 10 ms 21084 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 21336 KB Output is correct
2 Correct 19 ms 21340 KB Output is correct
3 Correct 17 ms 21296 KB Output is correct
4 Correct 17 ms 21340 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 21336 KB Output is correct
2 Correct 16 ms 21336 KB Output is correct
3 Correct 16 ms 21336 KB Output is correct
4 Correct 16 ms 21340 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 21340 KB Output is correct
2 Correct 17 ms 21336 KB Output is correct
3 Correct 18 ms 21336 KB Output is correct
4 Correct 17 ms 21340 KB Output is correct