Submission #945791

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
945791	2024-03-14T07:47:43 Z	vjudge1	Cave (IOI13_cave)	C++17	Compilation error	0 ms	0 KB

cave

#include "cave.h"

void exploreCave(int N)
{
    /* ... */
    int cur[N];
    int pos[N];

    int req[N];
    for (int i = 0; i < N; ++i)
    {

        int L = 0, R = N;

        int val = tryCombination(req);
        int V;
        if (val > i or val == -1)
            V = 0;
        else
            V = 1;

        while (R - L > 1)
        {
            int M = (L + R) >> 1;
            for (int j = L; j < M; ++j)
                req[j] = V;
            for (int j = M; j < R; ++j)
                req[j] = 1 - V;
            int val = tryCombination(req);
            if (val > i or val == -1)
                R = M;
            else
                L = M;
        }
        cur[i] = V;
        pos[i] = L;
    }

    answer(cur, pos);
}

///////////////////////////////////////

#include "cave.h"
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>

#define MAX_N 5000
#define MAX_CALLS 70000

static int N;
static int realS[MAX_N];
static int realD[MAX_N];
static int inv[MAX_N];
static int num_calls;

void answer(int S[], int D[])
{
    int i;
    for (i = 0; i < N; ++i)
        if (S[i] != realS[i] || D[i] != realD[i])
        {
            printf("INCORRECT\nWrong answer:");
            if (S[i] != realS[i])
                printf("S[%d] != realS[%d]", i, i);
            else
                printf("D[%d] != realD[%d]", i, i);
            exit(0);
        }

    printf("CORRECT\n");
    exit(0);
}

int tryCombination(int S[])
{
    int i;

    if (num_calls >= MAX_CALLS)
    {
        printf("INCORRECT\nToo many calls to tryCombination().\n");
        exit(0);
    }
    ++num_calls;

    for (i = 0; i < N; ++i)
        if (S[inv[i]] != realS[inv[i]])
            return i;
    return -1;
}

int init()
{
    int i;

    assert(scanf("%d", &N) == 1);

    for (i = 0; i < N; ++i)
    {
        assert(scanf("%d", &realS[i]) == 1);
    }
    for (i = 0; i < N; ++i)
    {
        assert(scanf("%d", &realD[i]) == 1);
        inv[realD[i]] = i;
    }

    num_calls = 0;
    return N;
}

int main()
{
    int N;
    N = init();
    exploreCave(N);
    printf("INCORRECT\nYour solution did not call answer().\n");
    return 0;
}

Compilation message

/usr/bin/ld: /tmp/ccNFHyhG.o: in function `answer':
cave.cpp:(.text+0x0): multiple definition of `answer'; /tmp/ccWl1h0C.o:grader.c:(.text+0x0): first defined here
/usr/bin/ld: /tmp/ccNFHyhG.o: in function `tryCombination':
cave.cpp:(.text+0xc0): multiple definition of `tryCombination'; /tmp/ccWl1h0C.o:grader.c:(.text+0x80): first defined here
/usr/bin/ld: /tmp/ccNFHyhG.o: in function `init()':
cave.cpp:(.text+0x3b0): multiple definition of `init()'; /tmp/ccWl1h0C.o:grader.c:(.text+0x110): first defined here
/usr/bin/ld: /tmp/ccNFHyhG.o: in function `main':
cave.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccWl1h0C.o:grader.c:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status