oj.uz

Submission #991206

# Submission time Handle Problem Language Result Execution time Memory
991206 2024-06-01T15:05:22 Z LOLOLO Cezar (COCI16_cezar) C++14
10 / 100
 1 ms 468 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 110;
string s[N];
string st[N];
int cc[N];

vector <int> ed[30];
vector <char> ans;
char pos[30];

bool visited[30];

void dfs(int v) {
    visited[v] = true;
    for (int u : ed[v]) {
        if (!visited[u])
            dfs(u);
    }
    ans.push_back(char(v + 'a'));
}

void topological_sort() {
    ans.clear();
    for (int i = 0; i < 26; ++i) {
        if (!visited[i]) {
            dfs(i);
        }
    }
    reverse(ans.begin(), ans.end());
}

ll solve() {
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> s[i];
    }

    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        st[i] = s[x];
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j < i; j++) {
            bool is = 0;
            for (int k = 0; k < min(len(st[i]), len(st[j])); k++) {
                if (st[i][k] != st[j][k]) {
                    is = 1;
                    ed[st[j][k] - 'a'].pb(st[i][k] - 'a');
                    break;
                }
            }

            if (is == 0 && len(st[i]) < len(st[j])) {
                cout << "NE\n";
                return 0;
            }
        }
    }

    topological_sort();
    for (int i = 0; i < 26; i++) {
        pos[ans[i] - 'a'] = char(i + 'a');
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < len(st[i]); j++) {
            st[i][j] = pos[st[i][j] - 'a'];
        }
    }

    for (int i = 2; i <= n; i++) {
        if (st[i] < st[i - 1]) {
            cout << "NE\n";
            return 0;
        }
    }

    cout << "DA\n";
    for (int i = 0; i < 26; i++)
        cout << pos[i];

    return 0;
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
 
    int t = 1;
    //cin >> t;
 
    while (t--) {
        solve();
    }
 
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 352 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 356 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 352 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 352 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 1 ms 352 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 352 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 352 KB Output isn't correct
2 Halted 0 ms 0 KB -