Submission #1361056

#	Time	Username	Problem	Language	Result	Execution time	Memory
1361056		trandkhoa	Vlak (COCI20_vlak)	C++20	0 / 70	16 ms	41752 KiB

Main

/**
 *     Author: Tran Dang Khoa
**/
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
#define FOR(i,l,r) for(int i = (l), _r = (r); i <= _r; i++)
#define FORN(i,r,l) for(int i = (r), _l = (l); i >= _l; i--)
#define MASK(x) (1LL << (x))
#define BIT(x,i) (((x) >> (i)) & 1)
#define sz(x) (int)x.size()
#define all(v) (v).begin(),(v).end()
#define segleft (id << 1)
#define segright (id << 1 | 1)
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
const int MOD = 1e9+7;

void iofile(string s) {
    freopen((s + ".inp").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int N = 2e5 + 5;
int Trie[2][N][26];
int cnt0 = 1, cnt1 = 1;

void build() {
    FOR(i, 0, N-1) {
        FOR(j, 0, 25) {
            Trie[0][i][j] = -1;
            Trie[1][i][j] = -1;
        }
    }
}

void insert_string(const string &s, int i) {
    int p = 1;
    for (char c : s) {
        int id = c - 'a';
        if (Trie[i][p][id] == -1) Trie[i][p][id] = (i ? ++cnt1 : ++cnt0);
        p = Trie[i][p][id];
    }
}

void trandkhoa() {
    build();

	int n; cin >> n;
	vector<string> Nina_str(n + 1);

	FOR(i, 1, n) {
		string word; cin >> word;
		insert_string(word, 0);
		Nina_str[i] = word;
	}

	int m; cin >> m;
	vector<string> Emilija_str(m + 1);

	FOR(i, 1, m) {
		string word; cin >> word;
		insert_string(word, 1);
		Emilija_str[i] = word;
	}

	bool flag = false;

	FOR(i, 1, n) {
		string word = Nina_str[i];
		int pNina = 1, pEmilija = 1;

		FOR(j, 1, sz(word)) {
			int c = word[j - 1] - 'a';
			if (j & 1) {
				if (Trie[1][pEmilija][c] == -1) {
					flag = true;
					break;
				}

				pNina = Trie[0][pNina][c];
				pEmilija = Trie[1][pEmilija][c];

				bool check = false;
				FOR(t, 1, 26) {
					if (Trie[1][pEmilija][t] != -1) check = true;
				}

				if (!check) {
					flag = true;
					break;
				}
			} else {
				bool check = false;

				FOR(t, 1, 26) {
					if (Trie[1][pEmilija][t] != -1 && Trie[0][pNina][t] == -1) check = true;
				}

				if (check) break;

				if (Trie[0][pNina][c] != -1 && Trie[1][pEmilija][c] != -1) {
					pNina = Trie[0][pNina][c];
					pEmilija = Trie[1][pEmilija][c];
				} else {
					break;
				}
			}
		}

		if (flag) break;
	}

	if (flag) {
        cout << "Nina" << endl;
 	} else {
        cout << "Emilija" << endl;
 	}
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    //iofile("");
    int test = 1;
    //cin >> test;
    while(test--) trandkhoa();

    return (0 ^ 0);
}

Compilation message (stderr)

Main.cpp: In function 'void iofile(std::string)':
Main.cpp:24:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |     freopen((s + ".inp").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:25:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void trandkhoa()':
Main.cpp:101:64: warning: iteration 25 invokes undefined behavior [-Waggressive-loop-optimizations]
  101 |                                         if (Trie[1][pEmilija][t] != -1 && Trie[0][pNina][t] == -1) check = true;
      |                                             ~~~~~~~~~~~~~~~~~~~^
Main.cpp:8:49: note: within this loop
    8 | #define FOR(i,l,r) for(int i = (l), _r = (r); i <= _r; i++)
      |                                                 ^
Main.cpp:100:33: note: in expansion of macro 'FOR'
  100 |                                 FOR(t, 1, 26) {
      |                                 ^~~
Main.cpp:90:64: warning: iteration 25 invokes undefined behavior [-Waggressive-loop-optimizations]
   90 |                                         if (Trie[1][pEmilija][t] != -1) check = true;
      |                                             ~~~~~~~~~~~~~~~~~~~^
Main.cpp:8:49: note: within this loop
    8 | #define FOR(i,l,r) for(int i = (l), _r = (r); i <= _r; i++)
      |                                                 ^
Main.cpp:89:33: note: in expansion of macro 'FOR'
   89 |                                 FOR(t, 1, 26) {
      |                                 ^~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10