| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1.5 초 (추가 시간 없음) | 1024 MB (추가 메모리 없음) | 73 | 23 | 21 | 36.207% |
You are given two positive integers $X$ and $Y$ of the same length in base 10. $Z$ is defined as the positive integer in base 10 satisfying the following conditions.
You have to perform $Q$ queries. Each query is one of the followings:
The $i$-th digit of a positive integer is defined from the left. For example, The third digit of 1234ドル$ is 3ドル$.
The first line contains two space-separated integers, $X$ and $Y$.
The second line contains a single integer, $Q$.
The following $Q$ lines contain space-separated integers describing the queries. Each line has one of the following forms, where the first integer represents the type of the query:
1 $i$ $x$ : Change the $i$-th digit of $Y$ to $x$.2 $i$ : Output the $i$-th digit of $Z$. If there is no such $Z,ドル print $-1$.It is guaranteed that there is at least one query of type 2.
For each query of type 2, output the answer for the query. The answers should be separated by newlines.
Let len$(A)$ be the number of digits in a positive integer $A$.
len$(X) =$len$(Y)$len$(Y),ドル 0ドル\leq x\leq 9$. If $i=1,ドル $x\neq 0$.len$(Y)$.3304 1615 6 2 3 2 4 1 1 3 2 2 1 2 4 2 1
3 4 0 3
838046 780357 10 2 1 2 2 1 2 4 2 3 2 4 1 4 5 2 5 2 6 1 1 9 2 2
8 0 3 4 6 8 -1
2950 9052 4 2 1 2 2 2 3 2 4
9 0 5 2
University > KAIST > KAIST ICPC Mock Competition > 2022 KAIST 12th ICPC Mock Competition E번
Camp > Petrozavodsk Programming Camp > Winter 2023 > Day 4: KAIST+KOI Contest, Grand Prix of Korea F번