oj.uz

Submission #232510

# Submission time Handle Problem Language Result Execution time Memory
232510 2020-05-17T09:01:00 Z Vimmer Ispit (COCI19_ispit) C++14
45 / 90
 524 ms 760 KB 
#include <bits/stdc++.h>

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define MOD ll(1e9 + 7)
#define block 500

using namespace std;

//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;

typedef short int si;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int kol[30];

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, k;

    cin >> n >> k;

    string s[n];

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

    for (int i = 0; i < n; i++)
        for (int j = i + 1; j < n; j++)
        {
            string str = s[i], t = s[j];

            memset(kol, 0, sizeof(kol));

            for (int u = 0; u < sz(str); u++) kol[str[u] - 'a']++;

            for (int u = 0; u < sz(t); u++) kol[t[u] - 'a']--;

            bool f = 1;

            for (int u = 0; u < 20 && f; u++)
                if (kol[u] != 0) f = 0;

            if (!f) continue;

            int kr = 0;

            for (int u = 0; u < sz(t); u++)
                if (t[u] != str[u]) kr++;

            if (kr > k) continue;

            cout << "DA" << endl;

            exit(0);
        }

    cout << "NE" << endl;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 288 KB Output is correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 384 KB Output is correct
2 Correct 21 ms 384 KB Output is correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 384 KB Output is correct
2 Correct 30 ms 512 KB Output is correct
3 Correct 37 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 504 KB Output is correct
2 Correct 26 ms 460 KB Output is correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 384 KB Output is correct
2 Correct 8 ms 384 KB Output is correct
3 Correct 39 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 473 ms 760 KB Output is correct
2 Correct 369 ms 760 KB Output is correct
3 Incorrect 5 ms 640 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 493 ms 760 KB Output is correct
2 Correct 151 ms 640 KB Output is correct
3 Correct 524 ms 640 KB Output is correct
4 Correct 5 ms 640 KB Output is correct

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 496 ms 760 KB Output is correct
2 Correct 87 ms 640 KB Output is correct
3 Incorrect 5 ms 640 KB Output isn't correct
4 Halted 0 ms 0 KB -