Submission #96605

#	Time	Username	Problem	Language	Result	Execution time	Memory
96605		heon	Ispit (COCI19_ispit)	C++11	9 / 90	291 ms	35132 KiB

Main

#include<bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
typedef vector <int> vi;
typedef pair<int,int> ii;
typedef long long ll;

const int mod = 1e9 + 7;
const ll inf = 3e18 + 5;

bool isti[205][205][205][2];
string temp[505][2], s[505];

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	/*#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	#endif*/

	int n, k;
	cin >> n >> k;
	for(int i = 0; i < n; i++){
		cin >> s[i];
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			temp[j][0] += s[j][i];
		}
		for(int j = 0; j < n; j++){
			for(int l = j + 1; l < n; l++){
				isti[i][j][l][0] = (temp[j][0] == temp[l][0]);
			}
		}
	}
	for(int i = n - 1; i >= 0; i--){
		for(int j = 0; j < n; j++){
			temp[j][1] += s[j][i];
		}
		for(int j = 0; j < n; j++){
			for(int l = j + 1; l < n; l++){
				isti[i][j][l][1] = (temp[j][1] == temp[l][1]);
			}
		}		
	}
	for(int i = 0; i <= n - k; i++){
		int cnt[505][26] = {};
		for(int j = 0; j < n; j++){
			for(int l = 0; l < k; l++){
				cnt[j][s[j][l + i] - 'a']++;
			}
		}
		for(int j = 0; j < n; j++){
			bool ok = 1;
			for(int l = j + 1; l < n; l++){
				for(int x = 0; x < 26; x++){
					if(cnt[j][x] != cnt[l][x]){
						ok = 0;
						break;
					}
				}
				if(!ok) break;
				else{
					bool desno = 1, lijevo = 1;
					if(!i){
						lijevo = isti[i][j][l][0];
					}
					if(i != n - k){
						desno = isti[n - i][j][l][1];
					}
					if(desno && lijevo) return cout << "DA",0;
				}
			}
		}
	}
	cout << "NE";
}

• Subtask 1: 9 / 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