# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96991 | 2019-02-13T08:08:26 Z | Danylo99 | Ispit (COCI19_ispit) | C++17 | 179 ms | 932 KB |
#include <bits/stdc++.h> #define ll long long #define LL long long #define PB push_back #define INF 2000000000 #define X first #define Y second using namespace std; const LL mod = 998244353; const LL MAX = 600005; string s[505]; int diff[26]; int diff2[26]; int main() { //freopen("input.txt" , "r" , stdin); ios_base::sync_with_stdio(0); int n , k; cin >> n >> k; for(int i = 0; i < n; i++) { cin >> s[i]; for(auto &x : s[i]) x -= 'a'; } for(int i = 0; i < n; i++) { for(int j = i + 1; j < n; j++) { memset(diff2 , 0 , sizeof diff2); for(int k = 0; k < n; k++) { diff2[s[i][k]]-- , diff2[s[j][k]]++; } bool bad = false; for(int k = 0; k < 26; k++) bad |= diff2[k]; if(bad) continue; memset(diff , 0 , sizeof diff); int cnt = 0; for(int k = 0; k < n; k++) { if(s[i][k] != s[j][k]) { cnt++; diff[s[i][k]]++; diff[s[j][k]]--; } } for(int i = 0; i < 26; i++) cnt += abs(diff[i]); if(cnt / 2 > k) continue; cout << "DA"; return 0; } } cout << "NE"; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 384 KB | Output is correct |
2 | Correct | 3 ms | 384 KB | Output is correct |
3 | Incorrect | 2 ms | 512 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Incorrect | 2 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 384 KB | Output is correct |
2 | Correct | 6 ms | 384 KB | Output is correct |
3 | Incorrect | 3 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 384 KB | Output is correct |
2 | Correct | 8 ms | 384 KB | Output is correct |
3 | Incorrect | 2 ms | 512 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 384 KB | Output is correct |
2 | Correct | 9 ms | 384 KB | Output is correct |
3 | Incorrect | 3 ms | 512 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 384 KB | Output is correct |
2 | Correct | 4 ms | 512 KB | Output is correct |
3 | Incorrect | 3 ms | 512 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 105 ms | 904 KB | Output is correct |
2 | Correct | 72 ms | 896 KB | Output is correct |
3 | Incorrect | 5 ms | 896 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 127 ms | 932 KB | Output is correct |
2 | Correct | 37 ms | 896 KB | Output is correct |
3 | Correct | 179 ms | 896 KB | Output is correct |
4 | Correct | 3 ms | 896 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 105 ms | 896 KB | Output is correct |
2 | Correct | 21 ms | 896 KB | Output is correct |
3 | Incorrect | 4 ms | 896 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |