| Task: | Järjestys |
| Sender: | vuolen |
| Submission time: | 2016-10-10 00:58:49 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 56 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 19 |
| #2 | ACCEPTED | 37 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.06 s | 1 | details |
| #2 | ACCEPTED | 0.06 s | 2 | details |
| #3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:32:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%" SCNu32, &n);
^
input/code.cpp:40:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%" SCNu32, arr + i);
^
input/code.cpp:63:30: warning: 'max_i' may be used uninitialized in this function [-Wmaybe-uninitialized]
move_arr[move_n++] = max_i + 1;
^Code
#include <stdio.h>
#include <stdint.h>
#define __STDC_FORMAT_MACROS
#include <inttypes.h>
#include <stdlib.h>
#include <math.h>
void flip(uint32_t *arr, uint32_t n) {
uint32_t i;
uint32_t temp;
for (i = 0; i < ceil(n / 2.0); i++) {
temp = arr[i];
arr[i] = arr[n - 1 - i];
arr[n - 1 - i] = temp;
}
}
void print_arr(uint32_t *arr, uint32_t n) {
uint32_t i;
for (i = 0; i < n; i++) {
printf("%" PRIu32 " ", arr[i]);
}
printf("\n");
}
int main(int argc, char *argv[]) {
uint32_t n;
uint32_t *arr;
uint32_t move_n;
uint32_t *move_arr;
scanf("%" SCNu32, &n);
arr = (uint32_t *) calloc(n, sizeof(uint32_t));
move_n = 0;
move_arr = (uint32_t *) calloc(5 * n, sizeof(uint32_t));
uint32_t i;
for (i = 0; i < n; i++) {
scanf("%" SCNu32, arr + i);
}
uint32_t max = 0;
uint32_t max_i;
uint32_t j;
for (j = 0; j < n; j++) {
if (arr[j] > max && arr[j] != j + 1) {
max = arr[j];
max_i = j;
}
}
for (i = 0; i < 5 * n; i++) {
if (max == 0)
break;
for (j = 0; j < n; j++) {
if (arr[j] == max) {
max_i = j;
}
}
move_arr[move_n++] = max_i + 1;
flip(arr, max_i + 1);
move_arr[move_n++] = arr[0];
flip(arr, arr[0]);
max--;
}
printf("%" PRIu32 "\n", move_n);
print_arr(move_arr, move_n);
free(arr);
free(move_arr);
return 0;
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 9 3 4 7 6 5 10 2 8 1 |
| correct output |
|---|
| 32 10 10 9 10 9 8 7 9 4 2 1 4 5 2... |
| user output |
|---|
| 20 7 10 4 9 7 8 4 7 6 6 5 5 3 4 3... |
Test 2
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 1000 650 716 982 41 133 1000 876 92... |
| correct output |
|---|
| 3984 207 207 206 207 128 127 126 12... |
| user output |
|---|
| 2000 6 1000 904 999 964 998 333 997... |
Test 3
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 94703 47808 62366 31885 7091 8... |
| correct output |
|---|
| 399956 98676 98676 98675 98676 62994 ... |
| user output |
|---|
| (empty) |
