oj.uz

답안 #1011595

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1011595 2024-06-30T19:26:12 Z trMatherz Vlak (COCI20_vlak) C++17
70 / 70
 18 ms 13836 KB 
#include <iostream> //cin, cout


// #include <fstream>
// std::ifstream cin ("slingshot.in");
// std::ofstream cout ("slingshot.out");





// includes
#include <cmath> 
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>
#include <bitset>
#include <complex>


//usings 
using namespace std;
using namespace __gnu_pbds;


// misc
#define ll long long
#define ld long double
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; }
typedef uint64_t hash_t;

// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz resize
#define all(x) x.begin(), x.end()
#define vc vector<char>
#define vvc vector<vc>


// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second

// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// maps
#define mii map<int, int>
#define mll map<ll, ll>

// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRE(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define FE(x, y) F(x, y + 1)
#define A(x, y) for(auto &x : y)


int n, m; 
int ct = 2; 
struct node {
    vi c;
    node (){
        c = vi(26, -1);
    }
};
vector<node> a(2);
void in(int x, string z){
    F(i, sz(z)){
        if(a[x].c[z[i] - 'a'] == -1) a[x].c[z[i] - 'a'] = ct++, a.pb(node());
        x = a[x].c[z[i] - 'a'];
    }
}
int get(int l, int r, int y){
    if(y == 0) {
        if(l == -1) return 1;
        F(i, 26) {
            if(a[l].c[i] != -1) {
                if(r == -1) return 0;
                if(get(a[l].c[i], a[r].c[i], 1) == 0) return 0;
            }
        }
        return 1;
    } else {
        if(r == -1) return 0;
        F(i, 26) {
            if(a[r].c[i] != -1) {
                if(l == -1) return 1;
                if(get(a[l].c[i], a[r].c[i], 0) == 1) return 1;
            }
        }
        return 0;
    }
}
int main(){
    cin >> n;
    F(i, n) {string z; cin >> z; in(0, z);}
    cin >> m;
    F(i, m) {string z; cin >> z; in(1, z);}
    cout << (get(0, 1, 0) == 0 ? "Nina" : "Emilija");
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 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 600 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 604 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 440 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 13040 KB Output is correct
2 Correct 13 ms 12412 KB Output is correct
3 Correct 15 ms 11784 KB Output is correct
4 Correct 18 ms 12852 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 13320 KB Output is correct
2 Correct 13 ms 13836 KB Output is correct
3 Correct 12 ms 12812 KB Output is correct
4 Correct 13 ms 13100 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 13580 KB Output is correct
2 Correct 13 ms 12400 KB Output is correct
3 Correct 13 ms 13068 KB Output is correct
4 Correct 13 ms 13320 KB Output is correct