oj.uz

답안 #472132

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
472132 2021-09-13T06:50:11 Z abc864197532 Vlak (COCI20_vlak) C++17
30 / 70
 1000 ms 25412 KB 
/*
 *   ##   #####   ####      ####  #    #  ####
 *  #  #  #    # #    #    #    # #    # #    #
 * #    # #####  #         #    # #    # #    #
 * ###### #    # #         #    # # ## # #    #
 * #    # #    # #    #    #    # ##  ## #    #
 * #    # #####   ####      ####  #    #  ####
 */
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define info() cout << __PRETTY_FUNCTION__ << ": " << __LINE__ << endl
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    if (a.empty) o << '{';
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}
template <typename T> struct vv : vector <vector <T>> {
    vv(int n, int m, T v) : vector <vector <T>> (n, vector <T>(m, v)) {}
    vv() {}
};
template <typename T> struct vvv : vector <vv <T>> {
    vvv(int n, int m, int k, T v) : vector <vv <T>> (n, vv <T>(m, k, v)) {}
    vvv() {}
};
#ifdef Doludu
#define test(args...) info(), abc("[" + string(#args) + "]", args)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(args...) void(0)
#define owo ios::sync_with_stdio(false); cin.tie(0)
#endif
const int mod = 1e9 + 7, N = 200001, logN = 20, K = 80000;

map <string, int> id;
int _id = 0;
vector <int> adj[2][N];
vector <bool> vis, dp;

bool solve(int v, int d = 0) {
    if (vis[v]) return dp[v];
    for (int u : adj[d][v]) {
        if (!solve(u, d ^ 1)) return dp[v] = true;
    }
    return dp[v] = false;
} 

void add(string s) {
    if (id.count(s)) return;
    id[s] = _id++;
    vis.pb(false), dp.pb(false);
}

int main () {
    owo;
    add("");
    int n, m;
    cin >> n;
    string s;
    for (int i = 0; i < n; ++i) {
        cin >> s;
        string t;
        int pre = 0;
        for (int j = 0; j < s.length(); ++j) {
            t += s[j];
            add(t);
            adj[0][pre].pb(id[t]);
            pre = id[t];
        }
    }
    cin >> m;
    for (int i = 0; i < m; ++i) {
        cin >> s;
        string t;
        int pre = 0;
        for (int j = 0; j < s.length(); ++j) {
            t += s[j];
            add(t);
            adj[1][pre].pb(id[t]);
            pre = id[t];
        }
    }
    cout << (solve(0) ? "Nina\n" : "Emilija\n");
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:86:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |         for (int j = 0; j < s.length(); ++j) {
      |                         ~~^~~~~~~~~~~~
Main.cpp:98:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |         for (int j = 0; j < s.length(); ++j) {
      |                         ~~^~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1034 ms 9804 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9804 KB Output is correct
2 Correct 8 ms 9804 KB Output is correct
3 Correct 7 ms 9836 KB Output is correct
4 Correct 8 ms 9804 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9764 KB Output is correct
2 Correct 7 ms 9804 KB Output is correct
3 Correct 86 ms 9804 KB Output is correct
4 Correct 8 ms 9804 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 177 ms 9800 KB Output is correct
2 Correct 9 ms 9836 KB Output is correct
3 Correct 8 ms 9804 KB Output is correct
4 Correct 10 ms 9804 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1082 ms 20820 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1089 ms 25412 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1093 ms 22332 KB Time limit exceeded
2 Halted 0 ms 0 KB -