Submission #853518

#	Time	Username	Problem	Language	Result	Execution time	Memory
853518		HoriaHaivas	Ispit (COCI19_ispit)	C++14	0 / 90	9 ms	756 KiB

Main

/*
    "vrem gridiuri cu en si capa"
    - om intelept - 2023
*/
#include<bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")

using namespace std;

char a[501][501];
int f[27][501];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    int i,j,n,k,l,h;
    bool ok,ok2;
    cin >> n >> k;
    for (i=1; i<=n; i++)
    {
        for (j=1; j<=n; j++)
        {
            cin >> a[i][j];
        }
    }
    for (i=1; i<=n; i++)
    {
        for (j=1; j<k; j++)
        {
            f[a[i][j]-'a'+1][i]++;
        }
    }
    ok2=false;
    for (j=k; j<=n && !ok2; j++)
    {
        for (i=1; i<=n; i++)
        {
            f[a[i][j]-'a'+1][i]++;
            if (j>k)
                f[a[i][j-k]-'a'+1][i]--;
        }
        for (i=1; i<=n && !ok2; i++)
        {
            for (l=1; l<=n && !ok2; l++)
            {
                if (l!=i)
                {
                    ok=true;
                    for (h=1; h<=26 && ok; h++)
                    {
                        if (f[h][i]!=f[h][l])
                            ok=false;
                    }
                    if (ok==true)
                        ok2=true;
                }
            }
        }
    }
    if (ok2)
        cout << "DA\n";
    else
        cout << "NE\n";
    return 0;
}

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