Submission #676505

#TimeUsernameProblemLanguageResultExecution timeMemory
676505penguin133Ispit (COCI19_ispit)C++17
90 / 90
1143 ms1428 KiB
#include <bits/stdc++.h> using namespace std; int main(){ ios::sync_with_stdio(0);cin.tie(0); int n,k; cin >> n >> k; char arr[n][n]; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ cin >> arr[i][j]; } } char tmp[n][n]; for(int i=k-1;i<n;i++){ for(int j=0;j<n;j++)for(int l=0;l<n;l++)tmp[j][l] = arr[j][l]; for(int j=0;j<n;j++)sort(tmp[j]+i-k+1, tmp[j] + i + 1); multiset<string>st; for(int j=0;j<n;j++){ string s = ""; for(int l=0;l<n;l++)s += tmp[j][l]; if(st.find(s) != st.end())return cout << "DA", 0; st.insert(s); } } cout << "NE"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...