oj.uz

Submission #170330

# Submission time Handle Problem Language Result Execution time Memory
170330 2019-12-24T20:06:30 Z ngmh Ispit (COCI19_ispit) C++11
90 / 90
 132 ms 1400 KB 
#include <bits/stdc++.h>
using namespace std;

int n, k, s, e;
string a[505], b[505];
int main(){
    cin >> n >> k;
    for(int i = 0; i < n; i++){
        cin >> a[i]; b[i] = a[i];
        sort(b[i].begin(), b[i].end());
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < i; j++){
            if(b[i] != b[j]) continue;
            s = n;
            e = 0;
            for(int l = 0; l < n; l++){
                if(a[i][l] != a[j][l]){
                    s = min(s, l);
                    e = max(e, l);
                }
            }
            if((e-s+1) <= k){ cout << "DA"; return 0; }
        }
    }
    cout << "NE";
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 504 KB Output is correct
2 Correct 6 ms 484 KB Output is correct
3 Correct 14 ms 504 KB Output is correct
4 Correct 7 ms 504 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 504 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 10 ms 504 KB Output is correct
4 Correct 11 ms 504 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 472 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 12 ms 504 KB Output is correct
4 Correct 9 ms 504 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 508 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 10 ms 504 KB Output is correct
4 Correct 12 ms 504 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1272 KB Output is correct
2 Correct 25 ms 1400 KB Output is correct
3 Correct 97 ms 1400 KB Output is correct
4 Correct 113 ms 1272 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 1400 KB Output is correct
2 Correct 24 ms 1400 KB Output is correct
3 Correct 85 ms 1336 KB Output is correct
4 Correct 132 ms 1272 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1272 KB Output is correct
2 Correct 25 ms 1364 KB Output is correct
3 Correct 122 ms 1372 KB Output is correct
4 Correct 80 ms 1368 KB Output is correct