oj.uz

Submission #523308

# Submission time Handle Problem Language Result Execution time Memory
523308 2022-02-07T11:23:40 Z lucri Cave (IOI13_cave) C++17
100 / 100
 254 ms 540 KB 
#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;
}*/

Compilation message

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.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 408 KB Output is correct
2 Correct 106 ms 404 KB Output is correct
3 Correct 146 ms 428 KB Output is correct
4 Correct 96 ms 404 KB Output is correct
5 Correct 183 ms 436 KB Output is correct
6 Correct 159 ms 428 KB Output is correct
7 Correct 181 ms 436 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 149 ms 440 KB Output is correct
13 Correct 141 ms 428 KB Output is correct
14 Correct 134 ms 428 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 170 ms 428 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 284 KB Output is correct
6 Correct 174 ms 332 KB Output is correct
7 Correct 128 ms 424 KB Output is correct
8 Correct 254 ms 428 KB Output is correct
9 Correct 216 ms 332 KB Output is correct
10 Correct 218 ms 424 KB Output is correct
11 Correct 136 ms 424 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 284 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 284 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 284 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 284 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 288 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 20 ms 360 KB Output is correct
21 Correct 1 ms 280 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 30 ms 336 KB Output is correct
24 Correct 30 ms 356 KB Output is correct
25 Correct 30 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 21 ms 336 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 20 ms 332 KB Output is correct
31 Correct 22 ms 332 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 32 ms 332 KB Output is correct
36 Correct 41 ms 332 KB Output is correct
37 Correct 1 ms 204 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 408 KB Output is correct
2 Correct 106 ms 404 KB Output is correct
3 Correct 146 ms 428 KB Output is correct
4 Correct 96 ms 404 KB Output is correct
5 Correct 183 ms 436 KB Output is correct
6 Correct 159 ms 428 KB Output is correct
7 Correct 181 ms 436 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 149 ms 440 KB Output is correct
13 Correct 141 ms 428 KB Output is correct
14 Correct 134 ms 428 KB Output is correct
15 Correct 189 ms 332 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 170 ms 428 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 284 KB Output is correct
20 Correct 174 ms 332 KB Output is correct
21 Correct 128 ms 424 KB Output is correct
22 Correct 254 ms 428 KB Output is correct
23 Correct 216 ms 332 KB Output is correct
24 Correct 218 ms 424 KB Output is correct
25 Correct 136 ms 424 KB Output is correct
26 Correct 0 ms 284 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 284 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 2 ms 284 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 288 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 288 KB Output is correct
44 Correct 0 ms 204 KB Output is correct
45 Correct 20 ms 360 KB Output is correct
46 Correct 1 ms 280 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 30 ms 336 KB Output is correct
49 Correct 30 ms 356 KB Output is correct
50 Correct 30 ms 332 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 21 ms 336 KB Output is correct
54 Correct 0 ms 204 KB Output is correct
55 Correct 20 ms 332 KB Output is correct
56 Correct 22 ms 332 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 32 ms 332 KB Output is correct
61 Correct 41 ms 332 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 94 ms 404 KB Output is correct
64 Correct 103 ms 404 KB Output is correct
65 Correct 153 ms 424 KB Output is correct
66 Correct 100 ms 420 KB Output is correct
67 Correct 177 ms 332 KB Output is correct
68 Correct 138 ms 424 KB Output is correct
69 Correct 225 ms 424 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 135 ms 428 KB Output is correct
73 Correct 138 ms 332 KB Output is correct
74 Correct 147 ms 540 KB Output is correct
75 Correct 158 ms 428 KB Output is correct
76 Correct 1 ms 280 KB Output is correct
77 Correct 0 ms 204 KB Output is correct
78 Correct 215 ms 424 KB Output is correct
79 Correct 135 ms 424 KB Output is correct
80 Correct 222 ms 332 KB Output is correct
81 Correct 220 ms 424 KB Output is correct
82 Correct 232 ms 424 KB Output is correct
83 Correct 124 ms 348 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 25 ms 332 KB Output is correct
86 Correct 134 ms 428 KB Output is correct
87 Correct 1 ms 284 KB Output is correct
88 Correct 1 ms 204 KB Output is correct
89 Correct 31 ms 416 KB Output is correct
90 Correct 32 ms 332 KB Output is correct
91 Correct 31 ms 336 KB Output is correct
92 Correct 216 ms 424 KB Output is correct
93 Correct 217 ms 428 KB Output is correct
94 Correct 227 ms 332 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 142 ms 436 KB Output is correct
98 Correct 23 ms 332 KB Output is correct
99 Correct 140 ms 424 KB Output is correct
100 Correct 0 ms 204 KB Output is correct
101 Correct 26 ms 292 KB Output is correct
102 Correct 29 ms 332 KB Output is correct
103 Correct 128 ms 332 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 1 ms 204 KB Output is correct
106 Correct 1 ms 204 KB Output is correct
107 Correct 31 ms 332 KB Output is correct
108 Correct 31 ms 332 KB Output is correct
109 Correct 233 ms 428 KB Output is correct
110 Correct 207 ms 428 KB Output is correct
111 Correct 0 ms 204 KB Output is correct