oj.uz

답안 #259687

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259687 2020-08-08T09:48:30 Z leaked Ispit (COCI19_ispit) C++14
90 / 90
 837 ms 34684 KB 
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 2e9,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
template<typename T> bool umax(T& a, T b) {return a<b?a=b,1:0;}
template<typename T> bool umin(T& a, T b) {return b<a?a=b,1:0;}
bool is_prime(ll val){for(ll i=2;i<=sqrt(val);i++)if(val%i==0)return 0; return 1;}
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int M=999999937;
const int N=5e2+2;
const int ppp=73;
const int Y=1;
const int X=0;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,125),mt19937(time(0)));
void bad(){
    cout<<"-1";
    exit(0);
}
char a[N][N];
vector<int> pref[N][N];
signed main()
{
    fast_io;
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++) {
        for(int j=1;j<=n;++j) cin>>a[i][j];
        pref[i][0].assign(26,0);
        for(int j=1;j<=n;++j) {
            pref[i][j]=pref[i][j-1];pref[i][j][a[i][j]-'a']++;
        }
    }
    bool ok=0;
    for(int j=1;j+k-1<=n;j++){
        int s=j+k-1;
        map<pair<string,string>,vector<int>>mp;
        for(int i=1;i<=n;i++){
            string pr,su;
            for(int c=1;c<j;c++) pr+=a[i][c];
            for(int c=s+1;c<=n;c++) su+=a[i][c];
//            debug()<<imie(pr)<<imie(su);
            mp[{pr,su}].p_b(i);
        }
        for(auto &z : mp){
            map<vector<int>,int>fck;
            for(auto &g : z.s){
                vector<int>kek(26,0);
                for(int c=0;c<26;c++){
                    kek[c]=pref[g][s][c]-pref[g][j-1][c];
                }
//                debug()<<imie(g)<<imie(kek);
                fck[kek]++;
            }
//            debug()<<imie(sz(fck))<<imie(sz(z.s));
            ok|=(sz(fck)!=sz(z.s));
//            debug()<<imie(ok)<<imie(sz(fck)!=sz(z.s));
        }
    }
    if(!ok) cout<<"NE";
    else cout<<"DA";
    return 0;
}
/*

*/

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6272 KB Output is correct
2 Correct 4 ms 6272 KB Output is correct
3 Correct 4 ms 6272 KB Output is correct
4 Correct 4 ms 6272 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6272 KB Output is correct
2 Correct 4 ms 6272 KB Output is correct
3 Correct 5 ms 6272 KB Output is correct
4 Correct 5 ms 6272 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6272 KB Output is correct
2 Correct 5 ms 6272 KB Output is correct
3 Correct 4 ms 6400 KB Output is correct
4 Correct 4 ms 6272 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 10880 KB Output is correct
2 Correct 12 ms 10880 KB Output is correct
3 Correct 52 ms 11000 KB Output is correct
4 Correct 52 ms 11000 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 10880 KB Output is correct
2 Correct 14 ms 10880 KB Output is correct
3 Correct 31 ms 10880 KB Output is correct
4 Correct 33 ms 10880 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 10880 KB Output is correct
2 Correct 10 ms 10880 KB Output is correct
3 Correct 21 ms 10880 KB Output is correct
4 Correct 23 ms 10880 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 10880 KB Output is correct
2 Correct 13 ms 10880 KB Output is correct
3 Correct 40 ms 10880 KB Output is correct
4 Correct 48 ms 10880 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 34456 KB Output is correct
2 Correct 42 ms 34304 KB Output is correct
3 Correct 78 ms 34296 KB Output is correct
4 Correct 71 ms 34296 KB Output is correct

Subtask #9
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 34296 KB Output is correct
2 Correct 41 ms 34208 KB Output is correct
3 Correct 827 ms 34684 KB Output is correct
4 Correct 837 ms 34680 KB Output is correct

Subtask #10
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 34300 KB Output is correct
2 Correct 46 ms 34300 KB Output is correct
3 Correct 302 ms 34552 KB Output is correct
4 Correct 280 ms 34536 KB Output is correct