提出 #1616172
ソースコード 拡げる
#include <bits/stdc++.h>
using namespace std;
int req[5];
int freq[26];
int main()
{
int N, M;
cin >> N >> M;
for(int i = 0; i < N; i++) {
for(int j = 0; j < M; j++) {
set<pair<int, int>> s;
s.insert({i, j});
s.insert({N - 1 - i, j});
s.insert({N - 1 - i, M - 1 - j});
s.insert({i, M - 1 - j});
if(*s.begin() == make_pair(i, j))
req[s.size()]++;
char c;
scanf(" %c", &c);
freq[c - 'a']++;
}
}
for(int i = 0; i < 26; i++) {
for(int j = 4; j >= 1; j--) {
while(freq[i] >= j && req[j] >= 1) {
freq[i] -= j;
req[j] -= 1;
}
}
if(freq[i]) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
}
提出情報
| 提出日時 | |
|---|---|
| 問題 | C - Palindromic Matrix |
| ユーザ | FatalEagle |
| 言語 | C++14 (GCC 5.4.1) |
| 得点 | 400 |
| コード長 | 921 Byte |
| 結果 | AC |
| 実行時間 | 3 ms |
| メモリ | 256 KiB |
コンパイルエラー
./Main.cpp: In function ‘int main()’:
./Main.cpp:22:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf(" %c", &c);
^
ジャッジ結果
| セット名 | Sample | All | ||||
|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 400 / 400 | ||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
| All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| 0_00.txt | AC | 1 ms | 256 KiB |
| 0_01.txt | AC | 1 ms | 256 KiB |
| 0_02.txt | AC | 1 ms | 256 KiB |
| 0_03.txt | AC | 1 ms | 256 KiB |
| 0_04.txt | AC | 1 ms | 256 KiB |
| 1_00.txt | AC | 1 ms | 256 KiB |
| 1_01.txt | AC | 1 ms | 256 KiB |
| 1_02.txt | AC | 1 ms | 256 KiB |
| 1_03.txt | AC | 1 ms | 256 KiB |
| 1_04.txt | AC | 1 ms | 256 KiB |
| 1_05.txt | AC | 1 ms | 256 KiB |
| 1_06.txt | AC | 1 ms | 256 KiB |
| 1_07.txt | AC | 1 ms | 256 KiB |
| 1_08.txt | AC | 1 ms | 256 KiB |
| 1_09.txt | AC | 3 ms | 256 KiB |
| 1_10.txt | AC | 3 ms | 256 KiB |
| 1_11.txt | AC | 3 ms | 256 KiB |
| 1_12.txt | AC | 3 ms | 256 KiB |
| 1_13.txt | AC | 3 ms | 256 KiB |
| 1_14.txt | AC | 3 ms | 256 KiB |
| 1_15.txt | AC | 2 ms | 256 KiB |
| 1_16.txt | AC | 2 ms | 256 KiB |
| 1_17.txt | AC | 2 ms | 256 KiB |
| 1_18.txt | AC | 2 ms | 256 KiB |
| 1_19.txt | AC | 2 ms | 256 KiB |
| 1_20.txt | AC | 2 ms | 256 KiB |
| 1_21.txt | AC | 1 ms | 256 KiB |
| 1_22.txt | AC | 1 ms | 256 KiB |
| 1_23.txt | AC | 1 ms | 256 KiB |
| 1_24.txt | AC | 1 ms | 256 KiB |
| 1_25.txt | AC | 1 ms | 256 KiB |
| 1_26.txt | AC | 1 ms | 256 KiB |