oj.uz

Submission #954446

# Submission time Handle Problem Language Result Execution time Memory
954446 2024-03-27T23:57:44 Z __Davit__ Cave (IOI13_cave) C++17
0 / 100
 2 ms 460 KB 
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

namespace {


    int *subtask2(int a[]) {
        return a;
        int n = sizeof(a) / sizeof(int);
        int res[n];
        for (int i = 0; i < n; i++) {
            a[i] ^= 1;
            int x = tryCombination(a);
            a[i] ^= 1;
            res[i] = x;
        }
        return res;
    }
}

void exploreCave(int N) {
    int a[N];
    for (int i = 0; i < N; i++)a[i] = 0;
    int *b = subtask2(a);
//    for (int i = 0; i < N; i++)b[i] = i;
//    int x = tryCombination(a);

    answer(a, b);
}

Compilation message

cave.cpp: In function 'int* {anonymous}::subtask2(int*)':
cave.cpp:11:24: warning: 'sizeof' on array function parameter 'a' will return size of 'int*' [-Wsizeof-array-argument]
   11 |         int n = sizeof(a) / sizeof(int);
      |                       ~^~
cave.cpp:9:23: note: declared here
    9 |     int *subtask2(int a[]) {
      |                   ~~~~^~~
cave.cpp:19:16: warning: address of local variable 'res' returned [-Wreturn-local-addr]
   19 |         return res;
      |                ^~~
cave.cpp:12:13: note: declared here
   12 |         int res[n];
      |             ^~~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 460 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Answer is wrong
2 Halted 0 ms 0 KB -