oj.uz

Submission #774259

# Submission time Handle Problem Language Result Execution time Memory
774259 2023-07-05T13:28:30 Z Trumling Cave (IOI13_cave) C++14
100 / 100
 149 ms 668 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()

/*
#include <stdio.h>
#include <stdlib.h>
#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)


#define N koala
#define realS kangaroo
#define realD possum
#define inv platypus
#define num_calls echidna

 int N;
 int realS[MAX_N];
 int realD[MAX_N];
 int inv[MAX_N];
 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;
}

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;
}
*/
///********************************************************************************************************
//tryCombination
void exploreCave(int n) 
{
int s[n]={ },d[n];

int st[13][n];
for(int i=0;i<13;i++)
    for(int j=0;j<n;j++)
        st[i][j]=0;

for(int i=0;(1<<i)<n;i++)
    for(int j=0;j<n;j++)
        if(j&(1<<i))
            st[i][j]=1;

for(int i=0;i<n;i++)
{
        ll ans1=tryCombination(s),ans;
        if(ans1==-1)
        ans1=INF;
        ll pos=0;
        
        for(int j=0;(1<<j)<n;j++)
        {

            ans=tryCombination(st[j]);
            if(ans==-1)
            ans=INF;
            if(ans1>i  &&  ans==i)
                pos+=(1<<j);
            if(ans1==i  &&  ans>i)
                pos+=(1<<j);
        }

        d[pos]=i;
        s[pos]=((ans1>i)?0:1);
        for(int j=0;(1<<j)<n;j++)
        st[j][pos]=s[pos];
    
    
}

answer(s,d);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 468 KB Output is correct
2 Correct 63 ms 568 KB Output is correct
3 Correct 116 ms 632 KB Output is correct
4 Correct 67 ms 576 KB Output is correct
5 Correct 129 ms 624 KB Output is correct
6 Correct 100 ms 624 KB Output is correct
7 Correct 119 ms 624 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 110 ms 664 KB Output is correct
13 Correct 95 ms 660 KB Output is correct
14 Correct 97 ms 664 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 620 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 112 ms 660 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 109 ms 664 KB Output is correct
7 Correct 110 ms 660 KB Output is correct
8 Correct 132 ms 660 KB Output is correct
9 Correct 116 ms 660 KB Output is correct
10 Correct 131 ms 664 KB Output is correct
11 Correct 142 ms 664 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 304 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 19 ms 444 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 14 ms 460 KB Output is correct
24 Correct 14 ms 444 KB Output is correct
25 Correct 14 ms 464 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 14 ms 464 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 14 ms 468 KB Output is correct
31 Correct 14 ms 460 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 15 ms 456 KB Output is correct
36 Correct 14 ms 440 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 468 KB Output is correct
2 Correct 63 ms 568 KB Output is correct
3 Correct 116 ms 632 KB Output is correct
4 Correct 67 ms 576 KB Output is correct
5 Correct 129 ms 624 KB Output is correct
6 Correct 100 ms 624 KB Output is correct
7 Correct 119 ms 624 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 110 ms 664 KB Output is correct
13 Correct 95 ms 660 KB Output is correct
14 Correct 97 ms 664 KB Output is correct
15 Correct 107 ms 620 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 112 ms 660 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 109 ms 664 KB Output is correct
21 Correct 110 ms 660 KB Output is correct
22 Correct 132 ms 660 KB Output is correct
23 Correct 116 ms 660 KB Output is correct
24 Correct 131 ms 664 KB Output is correct
25 Correct 142 ms 664 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 304 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 19 ms 444 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 14 ms 460 KB Output is correct
49 Correct 14 ms 444 KB Output is correct
50 Correct 14 ms 464 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 14 ms 464 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 14 ms 468 KB Output is correct
56 Correct 14 ms 460 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 15 ms 456 KB Output is correct
61 Correct 14 ms 440 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 59 ms 596 KB Output is correct
64 Correct 64 ms 596 KB Output is correct
65 Correct 116 ms 656 KB Output is correct
66 Correct 76 ms 604 KB Output is correct
67 Correct 120 ms 664 KB Output is correct
68 Correct 100 ms 660 KB Output is correct
69 Correct 121 ms 596 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 115 ms 664 KB Output is correct
73 Correct 94 ms 596 KB Output is correct
74 Correct 94 ms 596 KB Output is correct
75 Correct 104 ms 668 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 107 ms 660 KB Output is correct
79 Correct 111 ms 668 KB Output is correct
80 Correct 111 ms 596 KB Output is correct
81 Correct 126 ms 664 KB Output is correct
82 Correct 149 ms 660 KB Output is correct
83 Correct 121 ms 620 KB Output is correct
84 Correct 1 ms 300 KB Output is correct
85 Correct 15 ms 460 KB Output is correct
86 Correct 94 ms 656 KB Output is correct
87 Correct 1 ms 300 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 15 ms 448 KB Output is correct
90 Correct 17 ms 468 KB Output is correct
91 Correct 15 ms 456 KB Output is correct
92 Correct 115 ms 656 KB Output is correct
93 Correct 105 ms 664 KB Output is correct
94 Correct 124 ms 664 KB Output is correct
95 Correct 1 ms 308 KB Output is correct
96 Correct 1 ms 304 KB Output is correct
97 Correct 116 ms 596 KB Output is correct
98 Correct 20 ms 340 KB Output is correct
99 Correct 95 ms 656 KB Output is correct
100 Correct 1 ms 308 KB Output is correct
101 Correct 15 ms 460 KB Output is correct
102 Correct 17 ms 340 KB Output is correct
103 Correct 98 ms 660 KB Output is correct
104 Correct 1 ms 300 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 18 ms 340 KB Output is correct
108 Correct 17 ms 440 KB Output is correct
109 Correct 119 ms 656 KB Output is correct
110 Correct 119 ms 660 KB Output is correct
111 Correct 1 ms 212 KB Output is correct