Submission #67112131
Source Code Expand
Copy
#include <stdio.h>int N, Q;int Query[312345][3];int head = 0;int array[1123456];int main(void) {int i;if (scanf("%d%d", &N, &Q) != 2) return 1;for (i = 0; i < Q; i++) {if (scanf("%d%d", &Query[i][0], &Query[i][1]) != 2) return 1;if (Query[i][0] == 1) {if (scanf("%d", &Query[i][2]) != 1) return 1;}}for (i = 0; i < N; i++) array[i] = i + 1;for (i = 0; i < Q; i++) {switch (Query[i][0]) {case 1:
#include <stdio.h>
int N, Q;
int Query[312345][3];
int head = 0;
int array[1123456];
int main(void) {
int i;
if (scanf("%d%d", &N, &Q) != 2) return 1;
for (i = 0; i < Q; i++) {
if (scanf("%d%d", &Query[i][0], &Query[i][1]) != 2) return 1;
if (Query[i][0] == 1) {
if (scanf("%d", &Query[i][2]) != 1) return 1;
}
}
for (i = 0; i < N; i++) array[i] = i + 1;
for (i = 0; i < Q; i++) {
switch (Query[i][0]) {
case 1:
array[(Query[i][1] - 1 + head) % N] = Query[i][2];
break;
case 2:
printf("%d\n", array[(Query[i][1] - 1 + head) % N]);
break;
case 3:
head = (head + Query[i][1]) % N;
break;
}
}
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | C - Rotatable Array |
| User | mikecat |
| Language | C (gcc 12.2.0) |
| Score | 300 |
| Code Size | 692 Byte |
| Status | AC |
| Exec Time | 65 ms |
| Memory | 9772 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 300 / 300 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt, sample_02.txt |
| All | sample_01.txt, sample_02.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample_01.txt | AC | 1 ms | 1636 KiB |
| sample_02.txt | AC | 2 ms | 5508 KiB |
| test_01.txt | AC | 0 ms | 1632 KiB |
| test_02.txt | AC | 1 ms | 1644 KiB |
| test_03.txt | AC | 0 ms | 1628 KiB |
| test_04.txt | AC | 55 ms | 9176 KiB |
| test_05.txt | AC | 52 ms | 9136 KiB |
| test_06.txt | AC | 53 ms | 9180 KiB |
| test_07.txt | AC | 53 ms | 9016 KiB |
| test_08.txt | AC | 51 ms | 9180 KiB |
| test_09.txt | AC | 54 ms | 9076 KiB |
| test_10.txt | AC | 49 ms | 5260 KiB |
| test_11.txt | AC | 43 ms | 5280 KiB |
| test_12.txt | AC | 49 ms | 5352 KiB |
| test_13.txt | AC | 48 ms | 5900 KiB |
| test_14.txt | AC | 60 ms | 9160 KiB |
| test_15.txt | AC | 46 ms | 5248 KiB |
| test_16.txt | AC | 48 ms | 5248 KiB |
| test_17.txt | AC | 51 ms | 5328 KiB |
| test_18.txt | AC | 46 ms | 7288 KiB |
| test_19.txt | AC | 53 ms | 9152 KiB |
| test_20.txt | AC | 36 ms | 5172 KiB |
| test_21.txt | AC | 49 ms | 5180 KiB |
| test_22.txt | AC | 52 ms | 5212 KiB |
| test_23.txt | AC | 51 ms | 5256 KiB |
| test_24.txt | AC | 65 ms | 9060 KiB |
| test_25.txt | AC | 36 ms | 5160 KiB |
| test_26.txt | AC | 44 ms | 5104 KiB |
| test_27.txt | AC | 44 ms | 5268 KiB |
| test_28.txt | AC | 55 ms | 6832 KiB |
| test_29.txt | AC | 60 ms | 9008 KiB |
| test_30.txt | AC | 47 ms | 5232 KiB |
| test_31.txt | AC | 50 ms | 5180 KiB |
| test_32.txt | AC | 45 ms | 5184 KiB |
| test_33.txt | AC | 46 ms | 7280 KiB |
| test_34.txt | AC | 63 ms | 9772 KiB |
| test_35.txt | AC | 47 ms | 5248 KiB |
| test_36.txt | AC | 48 ms | 5172 KiB |
| test_37.txt | AC | 46 ms | 5288 KiB |
| test_38.txt | AC | 47 ms | 5748 KiB |
| test_39.txt | AC | 51 ms | 9060 KiB |
| test_40.txt | AC | 41 ms | 5108 KiB |
| test_41.txt | AC | 43 ms | 5148 KiB |
| test_42.txt | AC | 52 ms | 5248 KiB |
| test_43.txt | AC | 58 ms | 8800 KiB |
| test_44.txt | AC | 61 ms | 9176 KiB |