Submission #232479

#	Time	Username	Problem	Language	Result	Execution time	Memory
232479		NONAME	Ispit (COCI19_ispit)	C++17	90 / 90	33 ms	29440 KiB

Main

#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define ft first
#define sd second
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
using namespace std;
typedef long long ll;
typedef long double ld;

int n, k;
int pf[501][501][26];
string s[N];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//    in("input.txt");

    cin >> n >> k;

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

        for (int j = 0; j < n; j++) {
            for (int t = 0; t < 26; t++)
                pf[i][j][t] = (j - 1 < 0 ? 0 : pf[i][j - 1][t]);

            pf[i][j][s[i][j] - 'a']++;
        }
    }

    for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
        int l = 0, r = n - 1;
        while (l < r && s[i][l] == s[j][l])
            l++;

        while (l < r && s[i][r] == s[j][r])
            r--;

        if (r - l + 1 > k)
            continue;

        bool f = 1;

        for (int t = 0; t < 26 && f; t++)
            f = ((pf[i][r][t] - (l - 1 < 0 ? 0 : pf[i][l - 1][t])) == (pf[j][r][t] - (l - 1 < 0 ? 0 : pf[j][l - 1][t])));

        if (f) {
            cout << "DA";
            return 0;
        }
    }

    cout << "NE";
}

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