oj.uz

답안 #96591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96591 2019-02-10T11:32:37 Z psmao Ispit (COCI19_ispit) C++14
0 / 90
 31 ms 27388 KB 
#include <bits/stdc++.h>
using namespace std;

#define fo(i,s,t) for(int i = s; i <= t; ++ i)
#define fd(i,s,t) for(int i = s; i >= t; -- i)
#define bf(i,s) for(int i = head[s]; i; i = e[i].next)
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
#define VI vector<int>
#define sf scanf
#define pf printf
#define fp freopen
#define SZ(x) ((int)(x).size())
#ifdef MPS
#define D(x...) printf(x)
#else
#define D(x...)
#endif
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
const int inf = 1<<30;
const ll INF = 1ll<<60;
const db Inf = 1e20;
const db eps = 1e-9;

void gmax(int &a,int b){a = (a > b ? a : b);}
void gmin(int &a,int b){a = (a < b ? a : b);}

const int maxn = 505;

int n, k, cnt[maxn][maxn][27];
char a[maxn][maxn];

int main()
{
	#ifdef MPS	
		fp("1.in","r",stdin);
		fp("1.out","w",stdout);
	#endif
	sf("%d%d",&n,&k);
	fo(i,1,n) sf("%s",a[i]+1);
	fo(i,1,n)
	{
		fo(j,1,n) cnt[i][j][a[i][j]-'a'+1] = 1;
		fo(j,1,n) fo(k,1,26) cnt[i][j][k] += cnt[i][j-1][k];
	}
	fo(l,1,n-k+1)
	{
		int r = l + k - 1;
		fo(a,1,n) fo(b,a+1,n) 
		{
			fo(k,1,26) if(cnt[a][r][k] - cnt[a][l-1][k] != cnt[b][r][k] - cnt[b][l-1][k]) goto gg;
			return 0 * pf("DA\n");
			gg:;
		}
	}
	pf("NE\n");
	return 0;
}

Compilation message

ispit.cpp: In function 'int main()':
ispit.cpp:44:4: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  sf("%d%d",&n,&k);
    ^
ispit.cpp:45:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fo(i,1,n) sf("%s",a[i]+1);
              ^

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5496 KB Output is correct
2 Correct 7 ms 5496 KB Output is correct
3 Incorrect 8 ms 5464 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5500 KB Output is correct
2 Correct 6 ms 5496 KB Output is correct
3 Incorrect 8 ms 5496 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5496 KB Output is correct
2 Correct 7 ms 5496 KB Output is correct
3 Incorrect 7 ms 5496 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5496 KB Output is correct
2 Correct 6 ms 5496 KB Output is correct
3 Incorrect 6 ms 5496 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 27256 KB Output is correct
2 Correct 30 ms 27388 KB Output is correct
3 Incorrect 29 ms 27256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 27256 KB Output is correct
2 Correct 27 ms 27228 KB Output is correct
3 Incorrect 27 ms 27256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 27256 KB Output is correct
2 Correct 31 ms 27332 KB Output is correct
3 Incorrect 28 ms 27316 KB Output isn't correct
4 Halted 0 ms 0 KB -