Submission #2739938


Source Code Expand

#include <stdio.h>

int* alphaCount(char* str, int start, int end) {
  int* board = new int[300];
  for(int i=0;i<300;i++) {
    board[i] = 0;
  }

  for(int i=start;i<end;i++) {
    board[str[i]]++;
  }

  return board;
}

int alphaUnion(int* board1, int* board2) {
  int res = 0;
  for(int i=0;i<300;i++) {
    if(board1[i] > 0 && board2[i] > 0) {
      res++;
    }
  }

  return res;
}

int main() {
  int N;
  scanf("%d", &N);

  char* str = new char[N + 1];
  scanf("%s", str);

  int res = 0;
  int tmp;
  int *brd1, *brd2;
  for(int i=0;i<N;i++) {
    brd1 = alphaCount(str, 0, i);
    brd2 = alphaCount(str, i, N);
    tmp = alphaUnion(brd1, brd2);
    if(tmp > res) {
      res = tmp;
    }
    delete[] brd1;
    delete[] brd2;
  }

  printf("%d\n", res);

  return 0;
}

Submission Info

Submission Time
Task B - Cut and Count
User KlKlKl
Language C++14 (GCC 5.4.1)
Score 200
Code Size 833 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:29:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &N);
                  ^
./Main.cpp:32:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", str);
                   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 25
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt AC 1 ms 256 KB
subtask_1_03.txt AC 1 ms 256 KB
subtask_1_04.txt AC 1 ms 256 KB
subtask_1_05.txt AC 1 ms 256 KB
subtask_1_06.txt AC 1 ms 256 KB
subtask_1_07.txt AC 1 ms 256 KB
subtask_1_08.txt AC 1 ms 256 KB
subtask_1_09.txt AC 1 ms 256 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB
subtask_1_12.txt AC 1 ms 256 KB
subtask_1_13.txt AC 1 ms 256 KB
subtask_1_14.txt AC 1 ms 256 KB
subtask_1_15.txt AC 1 ms 256 KB
subtask_1_16.txt AC 1 ms 256 KB
subtask_1_17.txt AC 1 ms 256 KB
subtask_1_18.txt AC 1 ms 256 KB
subtask_1_19.txt AC 1 ms 256 KB