# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
164224 | aggu_01000101 | Ispit (COCI19_ispit) | C++14 | 2052 ms | 55544 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <queue>
#include <fstream>
#include <set>
#include <iomanip>
#include <unordered_map>
#define INF 1e16
#define int long long
#define N (int)1e5 + 5
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(false);
cout.tie(0); cin.tie(0);
int n, m;
cin>>n>>m;
char mat[n][n];
int maxpref[n][n];
int maxsuff[n][n];
for(int i = 0;i<n;i++){
string s;
cin>>s;
for(int j =0 ;j<s.length();j++){
mat[i][j] = s[j];
}
}
int freq[n][n][26];
for(int i = 0;i<n;i++){
for(int j =0 ;j<n;j++){
for(int k = 0;k<26;k++){
freq[i][j][k] = 0;
}
}
for(int j = i+1;j<n;j++){
maxpref[i][j] = maxpref[j][i] = maxsuff[j][i] = maxsuff[i][j] = 0;
int k = -1;
while(++k<n && mat[i][k]==mat[j][k]) maxpref[i][j] = ++maxpref[j][i];
k = n;
while(--k>=0 && mat[i][k]==mat[j][k]) maxsuff[i][j] = ++maxsuff[j][i];
}
}
for(int i = 0;i<n;i++){
freq[i][0][mat[i][0] - 'a']=1;
for(int j = 1;j<n;j++){
for(int k = 0;k<26;k++){
freq[i][j][k]=freq[i][j-1][k];
}
freq[i][j][mat[i][j]-'a']++;
}
}
bool possible = false;
for(int i = 0;i<=(n-m);i++){
int last = i+m-1;
for(int j = 0;j<(n-1);j++){
for(int l = j+1;l<n;l++) {
bool firstsame = true;
bool lastsame = true;
bool charcountsame = true;
if(maxpref[j][l]<(i+1)) firstsame = false;
if(maxsuff[j][l]<(n-last-1)) lastsame = false;
for (int k = 0; k < 26; k++) {
int count1 = freq[j][last][k] - i == 0 ? 0 : freq[j][i - 1][k];
int count2 = freq[l][last][k] - i == 0 ? 0 : freq[l][i - 1][k];
if (count1 != count2) charcountsame = false;
}
if (firstsame && lastsame && charcountsame) possible = true;
}
}
}
for(int i = 0;i<(n-1);i++){
for(int l = i+1;l<n;l++) {
bool same = true;
for (int j = 0; j < n; j++) {
if (mat[i][j] != mat[l][j]) same = false;
}
if (same) possible = true;
}
}
if(possible) cout<<"DA"<<endl;
else cout<<"NE"<<endl;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |