제출 #523308

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
523308		lucri	동굴 (IOI13_cave)	C++17	100 / 100	254 ms	540 KiB

cave

#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include "cave.h"
/*
#define MAX_N 5000
#define MAX_CALLS 70000

#define fail(s, x...) do { \
		fprintf(stderr, s "\n", ## x); \
		exit(1); \
	} while(0)

/* Symbol obfuscation
#define N koala
#define realS kangaroo
#define realD possum
#define inv platypus
#define num_calls echidna

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;
    int correct = 1;
    for (i = 0; i < N; ++i)
        if (S[i] != realS[i] || D[i] != realD[i]) {
            correct = 0;
            break;
        }

    if (correct)
        printf("CORRECT\n");
    else
        printf("INCORRECT\n");

    for (i = 0; i < N; ++i) {
        if (i > 0)
            printf(" ");
        printf("%d", S[i]);
    }
    printf("\n");

    for (i = 0; i < N; ++i) {
        if (i > 0)
            printf(" ");
        printf("%d", D[i]);
    }
    printf("\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;
}
*/
void exploreCave(int N)
{
    int poz[N+5]={0},link[N+5];
    std::pair <int,int>c[N+5];
    bool sta[N+5]={false};
    int vede=tryCombination(poz);
    for(int qwerty=0;qwerty<N;++qwerty)
    {
        int b=0,e=N-1;
        while(b<=e)
        {
            int mij=(b+e)/2;
            for(int i=b;i<=mij;++i)
            {
                if(sta[i]==false)
                    poz[i]=1;
            }
            int vedeacum=tryCombination(poz);
            for(int i=b;i<=mij;++i)
            {
                if(sta[i]==false)
                    poz[i]=0;
            }
            if(vedeacum==qwerty&&vede!=qwerty||vedeacum!=qwerty&&vede==qwerty)
                e=mij-1;
            else
                b=mij+1;
        }
        c[qwerty].first=b;
        c[qwerty].second=qwerty;
        sta[b]=true;
        if(vede==qwerty)
        {
            poz[b]=1;
            vede=tryCombination(poz);
        }
    }
    sort(c,c+N);
    for(int i=0;i<N;++i)
        link[i]=c[i].second;
    answer(poz,link);
}
/*

int init() {
    int i, res;

    FILE *f = fopen("cave.in", "r");
	if (!f)
		fail("Failed to open input file.");

	res = fscanf(f, "%d", &N);

    for (i = 0; i < N; ++i) {
        res = fscanf(f, "%d", &realS[i]);
    }
    for (i = 0; i < N; ++i) {
        res = fscanf(f, "%d", &realD[i]);
        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;
}*/

컴파일 시 표준 에러 (stderr) 메시지

cave.cpp:14:1: warning: "/*" within comment [-Wcomment]
   14 | /* Symbol obfuscation
      |  
cave.cpp: In function 'void exploreCave(int)':
cave.cpp:96:32: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   96 |             if(vedeacum==qwerty&&vede!=qwerty||vedeacum!=qwerty&&vede==qwerty)
      |                ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24