oj.uz

Submission #5391

# Submission time Handle Problem Language Result Execution time Memory
5391 2014-04-21T06:59:58 Z ecardenaz Cave (IOI13_cave) C
100 / 100
 753 ms 560 KB 
//Emmanuel Antonio Cardenaz
//21 Abril 2014
 
#include "cave.h"
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>


typedef struct {
    int valorSwitch;
    int puerta;
    int active;
    int size;
} swit;
swit * codigo;

void loadcode(int N) {
    codigo = (swit *) calloc(N, sizeof (swit));
    int i;
    for (i = 0; i < N; i++) {
        codigo[i].size = 1;
        codigo[i].valorSwitch = 1;
        codigo[i].active = -1;
        codigo[i].puerta = -1;
    }
}

void complementa(int ini, int fin) {
    int i;
    for (i = ini; i <= fin; i++) {
        if (codigo[i].active == -1) {
            if (codigo[i].valorSwitch == 1) {
                codigo[i].valorSwitch = 0;
            } else {
                codigo[i].valorSwitch = 1;
            }
        } else {
            codigo[i].valorSwitch = codigo[i].active;
        }
    }
}

void exploreCave(int N) {
    int i, j;
    int izquierda, derecha, m;
    int s[N];
    int code[N];
    int puerta[N];
    loadcode(N);

    int t;
    int v;
    int x;

    for (i = 0; i < N; i++) {
        izquierda = 0;
        derecha = N - 1;


        complementa(0, N - 1);
        for (x = 0; x < N; x++) {
            code[x] = codigo[x].valorSwitch;
        }
        t = tryCombination(code);
        if (t == i) {
            complementa(0, N - 1);
        }

        while (izquierda < derecha) {
            m = (izquierda + derecha) / 2;            
            complementa(izquierda,m);            
            for (x = 0; x < N; x++) {
                code[x] = codigo[x].valorSwitch;
            }
            v = tryCombination(code);
            if (v == i) {
                complementa(izquierda, m);
                derecha = m;
            } else {
                izquierda = m + 1;
            }
        }
        codigo[izquierda].active = codigo[izquierda].valorSwitch;
        codigo[izquierda].puerta = i;
    }

    for (i = 0; i < N; i++) {
        code[i] = codigo[i].valorSwitch;
        puerta[i] = codigo[i].puerta;
    }
    answer(code, puerta);
}

Compilation message

cave.c: In function 'exploreCave':
cave.c:48:9: warning: unused variable 's' [-Wunused-variable]
     int s[N];
         ^
cave.c:46:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 512 KB Output is correct
2 Correct 387 ms 480 KB Output is correct
3 Correct 592 ms 496 KB Output is correct
4 Correct 366 ms 488 KB Output is correct
5 Correct 639 ms 492 KB Output is correct
6 Correct 530 ms 560 KB Output is correct
7 Correct 570 ms 496 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 304 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 497 ms 504 KB Output is correct
13 Correct 535 ms 512 KB Output is correct
14 Correct 517 ms 500 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 531 ms 496 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 479 ms 512 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 605 ms 500 KB Output is correct
7 Correct 487 ms 500 KB Output is correct
8 Correct 699 ms 496 KB Output is correct
9 Correct 620 ms 512 KB Output is correct
10 Correct 673 ms 512 KB Output is correct
11 Correct 484 ms 504 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 432 KB Output is correct
5 Correct 6 ms 256 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 6 ms 256 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 416 KB Output is correct
12 Correct 6 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 360 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 6 ms 256 KB Output is correct
4 Correct 5 ms 304 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 75 ms 420 KB Output is correct
7 Correct 6 ms 256 KB Output is correct
8 Correct 6 ms 256 KB Output is correct
9 Correct 100 ms 384 KB Output is correct
10 Correct 134 ms 412 KB Output is correct
11 Correct 98 ms 384 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 77 ms 416 KB Output is correct
15 Correct 5 ms 360 KB Output is correct
16 Correct 77 ms 420 KB Output is correct
17 Correct 117 ms 416 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 304 KB Output is correct
20 Correct 6 ms 256 KB Output is correct
21 Correct 100 ms 412 KB Output is correct
22 Correct 99 ms 420 KB Output is correct
23 Correct 5 ms 256 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 488 KB Output is correct
2 Correct 450 ms 512 KB Output is correct
3 Correct 607 ms 504 KB Output is correct
4 Correct 469 ms 480 KB Output is correct
5 Correct 699 ms 496 KB Output is correct
6 Correct 557 ms 500 KB Output is correct
7 Correct 594 ms 520 KB Output is correct
8 Correct 5 ms 304 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 475 ms 512 KB Output is correct
11 Correct 521 ms 504 KB Output is correct
12 Correct 482 ms 504 KB Output is correct
13 Correct 529 ms 512 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 618 ms 512 KB Output is correct
17 Correct 462 ms 512 KB Output is correct
18 Correct 674 ms 512 KB Output is correct
19 Correct 717 ms 512 KB Output is correct
20 Correct 753 ms 496 KB Output is correct
21 Correct 518 ms 496 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 85 ms 416 KB Output is correct
24 Correct 563 ms 500 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 6 ms 256 KB Output is correct
27 Correct 113 ms 416 KB Output is correct
28 Correct 119 ms 428 KB Output is correct
29 Correct 95 ms 424 KB Output is correct
30 Correct 641 ms 500 KB Output is correct
31 Correct 699 ms 496 KB Output is correct
32 Correct 695 ms 508 KB Output is correct
33 Correct 6 ms 256 KB Output is correct
34 Correct 5 ms 256 KB Output is correct
35 Correct 471 ms 500 KB Output is correct
36 Correct 95 ms 412 KB Output is correct
37 Correct 534 ms 512 KB Output is correct
38 Correct 6 ms 304 KB Output is correct
39 Correct 82 ms 416 KB Output is correct
40 Correct 81 ms 384 KB Output is correct
41 Correct 538 ms 496 KB Output is correct
42 Correct 6 ms 256 KB Output is correct
43 Correct 6 ms 256 KB Output is correct
44 Correct 6 ms 256 KB Output is correct
45 Correct 100 ms 428 KB Output is correct
46 Correct 87 ms 412 KB Output is correct
47 Correct 659 ms 496 KB Output is correct
48 Correct 616 ms 488 KB Output is correct
49 Correct 5 ms 256 KB Output is correct