oj.uz

Submission #164233

# Submission time Handle Problem Language Result Execution time Memory
164233 2019-11-18T17:52:10 Z aggu_01000101 Ispit (COCI19_ispit) C++14
18 / 90
 2000 ms 55424 KB 
#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];
    int freq[n][n][26];
    for(int i = 0;i<n;i++){
        string s;
        cin>>s;
        for(int j =0 ;j<s.length();j++){
            mat[i][j] = s[j];
        }
    }
    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 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']++;
        }
    }
    for(int i = 0;i<n;i++){
        for(int j = i+1;j<n;j++){
            maxpref[i][j] = maxsuff[i][j] = 0;
            int k = -1;
            while(++k<n && mat[i][k]==mat[j][k]) ++maxpref[i][j];
            k = n;
            while(--k>=0 && mat[i][k]==mat[j][k]) ++maxsuff[i][j];
        }
    }
    bool possible = false;
    for(int i = 0;i<n;i++){
        for(int k = i+1;k<n;k++){
            unordered_map<char, int> cnt;
            unordered_map<char, int> cnt1;
            int samecount = 26;
            for(int j = 0;j<m;j++){
                if(mat[i][j] != mat[k][j] && cnt[mat[i][j]] == cnt1[mat[i][j]]) samecount--;
                cnt[mat[i][j]]++;
                if(mat[i][j] != mat[k][j] && cnt[mat[k][j]] == cnt1[mat[k][j]]) samecount--;
                cnt1[mat[k][j]]++;
                if(mat[i][j] != mat[k][j] && cnt[mat[i][j]] == cnt1[mat[i][j]]) samecount++;
                if(mat[i][j] != mat[k][j] && cnt[mat[k][j]] == cnt1[mat[k][j]]) samecount++;
            }
            if(samecount==26 && maxsuff[i][k]>=(n-m)) possible = true;
            for(int j = m;j<n;j++){
                if(mat[i][j-m] != mat[k][j-m] && cnt[mat[i][j-m]] == cnt1[mat[i][j-m]]) samecount--;
                cnt[mat[i][j-m]]--;
                if(mat[i][j-m] != mat[k][j-m] && cnt1[mat[k][j-m]] == cnt[mat[k][j-m]]) samecount--;
                cnt1[mat[k][j-m]]--;
                if(mat[i][j] != mat[k][j] && cnt[mat[i][j]] == cnt1[mat[i][j]]) samecount--;
                cnt[mat[i][j]]++;
                if(mat[i][j] != mat[k][j] && cnt[mat[k][j]] == cnt1[mat[k][j]]) samecount--;
                cnt1[mat[k][j]]++;
                if(mat[i][j] != mat[k][j] && cnt[mat[i][j]] == cnt1[mat[i][j]]) samecount++;
                if(mat[i][j] != mat[k][j] && cnt[mat[k][j]] == cnt1[mat[k][j]]) samecount++;
                if(samecount==26 && maxsuff[i][k]>=(n-m-1) && maxpref[i][k]>=(j-m+1)) possible = true;
                //cout<<i<<" "<<k<<" "<<samecount<<endl;
            }
        }
    }
    for(int i = 0;i<(n-1);i++){
        for(int l = i+1;l<n;l++) {
            if (maxpref[i][l]==n) possible = true;
        }
    }
    if(possible) cout<<"DA"<<endl;
    else cout<<"NE"<<endl;
}

Compilation message

ispit.cpp: In function 'int32_t main()':
ispit.cpp:26:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j =0 ;j<s.length();j++){
                       ~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 380 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 735 ms 9208 KB Output is correct
2 Incorrect 758 ms 9184 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 720 ms 9208 KB Output is correct
2 Incorrect 755 ms 9208 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 759 ms 9208 KB Output is correct
2 Incorrect 730 ms 9188 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 723 ms 9192 KB Output is correct
2 Correct 736 ms 9208 KB Output is correct
3 Correct 931 ms 9188 KB Output is correct
4 Incorrect 688 ms 9208 KB Output isn't correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2064 ms 55424 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2074 ms 55416 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2063 ms 55416 KB Time limit exceeded
2 Halted 0 ms 0 KB -