Submission #72073734
Source Code Expand
Copy
/*n の大きさに制約が無く、変換表の前の文字がユニークという制約も無い*/#include <stdio.h>#include <limits.h>char to[1 << CHAR_BIT];int main(void) {int n, m;int i;if (scanf("%d", &n) != 1) return 1;for (i = 0; i < n; i++) {char f[4], t[4];if (scanf("%3s%3s", f, t) != 2) return 1;to[(unsigned char)*f] = *t;}if (scanf("%d", &m) != 1) return 1;
/*
n の大きさに制約が無く、変換表の前の文字がユニークという制約も無い
*/
#include <stdio.h>
#include <limits.h>
char to[1 << CHAR_BIT];
int main(void) {
int n, m;
int i;
if (scanf("%d", &n) != 1) return 1;
for (i = 0; i < n; i++) {
char f[4], t[4];
if (scanf("%3s%3s", f, t) != 2) return 1;
to[(unsigned char)*f] = *t;
}
if (scanf("%d", &m) != 1) return 1;
for (i = 0; i < m; i++) {
char c[4];
if (scanf("%3s", c) != 1) return 1;
putchar(to[(unsigned char)*c] ? to[(unsigned char)*c] : *c);
}
putchar('\n');
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - JOI 2006 予選 問題2 |
| User | mikecat |
| Language | C23 (GCC 14.2.0) |
| Score | 100 |
| Code Size | 608 Byte |
| Status | AC |
| Exec Time | 3 ms |
| Memory | 1620 KiB |
Judge Result
| Set Name | all | ||
|---|---|---|---|
| Score / Max Score | 100 / 100 | ||
| Status |
|
| Set Name | Test Cases |
|---|---|
| all | data1, data2, data3, data4, data5 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| data1 | AC | 0 ms | 1580 KiB |
| data2 | AC | 0 ms | 1620 KiB |
| data3 | AC | 0 ms | 1560 KiB |
| data4 | AC | 1 ms | 1620 KiB |
| data5 | AC | 3 ms | 1572 KiB |