oj.uz

Submission #100863

# Submission time Handle Problem Language Result Execution time Memory
100863 2019-03-14T22:07:53 Z Ort Ispit (COCI19_ispit) C++11
90 / 90
 21 ms 1152 KB 
#include<iostream>
#include<string>
#include<algorithm>
#define MAX 505

using namespace std;

int n, k;
bool ok = 0;

string mat[MAX];
string smat[MAX];
string s;


int main() {
	cin.sync_with_stdio(0); cin.tie(0);
	cin.exceptions(cin.failbit);
	cin >> n >> k;
	for(int i=0;i<n;i++) {
		cin >> s;
		mat[i] = s;
		sort(s.begin(),s.end());
		smat[i] = s;
	}
	int cnt = 0;
	for(int i=0;i<n;i++) {
		for(int j=0;j<n;j++) {
			if(i==j) continue;
			if(smat[i]==smat[j]) {
				int a = 0, b = 0;
				for(int z=0;z<n;z++) {
					if(mat[i][z]==mat[j][z]) a++;
					else break;
				}
				for(int z=n-1;z>=0;z--) {
					if(mat[i][z]==mat[j][z]) b++;
					else break;
				}
				if(n-a-b<=k) {
					cout << "DA";
					return 0;
				}
			}
		}
	}
	cout << "NE";
	return 0;
}

Compilation message

ispit.cpp: In function 'int main()':
ispit.cpp:26:6: warning: unused variable 'cnt' [-Wunused-variable]
  int cnt = 0;
      ^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
9.0 / 9.0

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

Subtask #7
9.0 / 9.0

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

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 896 KB Output is correct
2 Correct 12 ms 896 KB Output is correct
3 Correct 19 ms 896 KB Output is correct
4 Correct 15 ms 1152 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 896 KB Output is correct
2 Correct 9 ms 896 KB Output is correct
3 Correct 18 ms 896 KB Output is correct
4 Correct 21 ms 1152 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 896 KB Output is correct
2 Correct 9 ms 896 KB Output is correct
3 Correct 21 ms 896 KB Output is correct
4 Correct 14 ms 1152 KB Output is correct