oj.uz

Submission #147509

# Submission time Handle Problem Language Result Execution time Memory
147509 2019-08-29T21:12:33 Z ipaljak Ispit (COCI19_ispit) C++14
45 / 90
 259 ms 892 KB 
#include <bits/stdc++.h>

using namespace std;

#define TRACE(x) cerr << #x << " " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<

typedef long long llint;

const int MOD = 1e9 + 7;
const int MAXN = 505;

bool ok[MAXN];

int n, k;
char s[MAXN][MAXN];

int main(void) {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; ++i) scanf("%s", s[i]);

  for (int j = 0; j < n; ++j) {
    int cnt[26]; memset(cnt, 0, sizeof cnt);
    for (int i = 0; i < n; ++i) {
      ++cnt[s[i][j] - 'a'];
      if (cnt[s[i][j] - 'a'] > 1) ok[j] = true;
    }
  }

  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      bool check = true;
      int lo = n - 1, hi = 0;
      for (int k = 0; k < n; ++k) {
        if (s[i][k] == s[j][k]) continue;
        if (!ok[k]) check = false;
        lo = min(lo, k); hi = max(hi, k);
      }
      if (check && hi - lo + 1 <= k) {
        printf("DA\n");
        return 0;
      }
    }
  }

  printf("NE\n");
  return 0;
}

Compilation message

ispit.cpp: In function 'int main()':
ispit.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &n, &k);
   ~~~~~^~~~~~~~~~~~~~~~
ispit.cpp:22:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   for (int i = 0; i < n; ++i) scanf("%s", s[i]);
                               ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 360 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 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 380 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 500 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

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

Subtask #6
9.0 / 9.0

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

Subtask #7
0 / 9.0

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

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 852 KB Output is correct
2 Correct 163 ms 760 KB Output is correct
3 Correct 77 ms 892 KB Output is correct
4 Correct 109 ms 892 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 760 KB Output is correct
2 Correct 4 ms 760 KB Output is correct
3 Correct 138 ms 860 KB Output is correct
4 Correct 144 ms 884 KB Output is correct

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 860 KB Output isn't correct
2 Halted 0 ms 0 KB -