結果

問題 No.459 C-VS for yukicoder
ユーザー bal4ubal4u
提出日時 2019-08-17 16:56:28
言語 C
(gcc 13.3.0)
結果
AC  
実行時間 5 ms / 2,000 ms
コード長 1,907 bytes
コンパイル時間 523 ms
コンパイル使用メモリ 32,128 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-24 20:01:43
合計ジャッジ時間 3,014 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 58
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.c: In function 'in':
main.c:10:14: warning: implicit declaration of function 'getchar_unlocked' [-Wimplicit-function-declaration]
   10 | #define gc() getchar_unlocked()
      |              ^~~~~~~~~~~~~~~~
main.c:18:24: note: in expansion of macro 'gc'
   18 |         int n = 0, c = gc();
      |                        ^~
main.c: In function 'outs':
main.c:11:15: warning: implicit declaration of function 'putchar_unlocked' [-Wimplicit-function-declaration]
   11 | #define pc(c) putchar_unlocked(c)
      |               ^~~~~~~~~~~~~~~~
main.c:30:33: note: in expansion of macro 'pc'
   30 | void outs(char *s) { while (*s) pc(*s++); pc('\n'); }
      |                                 ^~

ソースコード

diff #
プレゼンテーションモードにする

// yukicoder: No.459 C-VS for yukicoder
// bal4u 2019.8.17
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
////
#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
int in() { //
int n = 0, c = gc();
do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
return n;
}
void ins(char *s) { //  
char *p = s;
do *s = gc();
while (*s++ > ' ');
*--s = 0;
}
void outs(char *s) { while (*s) pc(*s++); pc('\n'); }
////
char blk[3][4] = {"...", "...", "..."};
void out(char a) {
int i; char h[3], b[3][4];
memcpy(b, blk, sizeof(blk));
h[0] = (a >> 4) & 3, h[1] = (a >> 2) & 3, h[2] = a & 3;
for (i = 0; i < 3; i++) while (h[i]) b[--h[i]][i] = '#';
outs(b[2]), outs(b[1]), outs(b[0]);
}
int H, W;
int hi[10005];
int c[30005]; int N;
int f[10005];
char S[10005];
char *ans[10005]; int g[10005];
int main()
{
int i, j, k, t, h[3];
H = in(), W = in(), N = in();
for (j = 0; j < H; j++) {
ins(S);
for (i = 0; i < W; i++) if (S[i] == '#') hi[i]++;
}
for (j = 0; j < N; j++) c[j] = in(), f[c[j]]++;
for (i = 0; i < W; i++) if (f[i]) {
ans[i] = malloc(f[i]);
while (f[i]) {
h[0] = h[1] = h[2] = 0, t = 0;
for (j = 0; j < 3; j++) {
k = i+j, t += f[k];
if (hi[k = i+j] == 0) continue;
if (t <= 1) h[j] = hi[k];
else if (hi[k] < t) h[j] = 0;
else if (hi[k] >= 3*t) h[j] = 3;
else if (hi[k] > 3*t-2) h[j] = 2;
else h[j] = 1;
hi[k] -= h[j];
}
if ((h[0] | h[1] | h[2]) == 0) {
for (j = 0; j < 3; j++) if (hi[k = i+j]) {
h[j] = 1, hi[k]--; break;
}
}
ans[i][g[i]++] = (h[0]<<4) | (h[1]<<2) | h[2];
f[i]--;
}
}
for (i = 0; i < N; i++) k = c[i], out(ans[k][--g[k]]);
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0