oj.uz

Submission #123179

# Submission time Handle Problem Language Result Execution time Memory
123179 2019-06-30T09:58:02 Z ekrem Cave (IOI13_cave) C++
100 / 100
 1659 ms 696 KB 
#include "cave.h"
// #include <stdio.h>
// #include <stdlib.h>

// #define MAX_N 5000
// #define MAX_CALLS 70000


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

// static int NN;
// 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 < NN; ++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 < NN; ++i) {
//         if (i > 0)
//             printf(" ");
//         printf("%d", S[i]);
//     }
//     printf("\n");

//     for (i = 0; i < NN; ++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 < NN; ++i)
//         if (S[inv[i]] != realS[inv[i]])
//             return i;
//     return -1;
// }



//
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define orta ((bas+son)/2)
#define mod 1000000007
#define LOGN 16
#define N 1000005
using namespace std;

typedef long long ll;

int n, d, ne[N], c[N], s[N], ss[N], u[N], nee[N], cc[N];

int sor(int x){
	int xx = 0;
	for(int i = 0; i < n; i++){
		if(!u[i]){
			ss[i] = s[xx];
			xx++;
		}
	}
	for(int i = 0; i < x; i++)
		ss[c[i]] = ne[i];
	int cvp = tryCombination(ss);
	return (cvp == -1)?n:cvp;
}

int bak(int x){
	int xx = 0;
	for(int i = 0; i < n; i++){
		if(!u[i]){
			if(xx == x)
				return i;
			ss[i] = s[xx];
			xx++;
		}
	}
	return mod;
}

void exploreCave(int nn) {n = nn;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n - i; j++)
			s[j] = 0;
		int ilk = sor(i);
		for(int j = 0; j < n - i; j++)
			s[j] = 1;
		int iki = sor(i);
		d = (iki > ilk);
		ne[i] = d;
		int bas = 0, son = n - 1 - i;
		// cout << i << " " << bas << " " << son << endl;
		while(bas < son){
			for(int j = 0; j <= orta; j++)
				s[j] = d;
			for(int j = orta + 1; j < n - i; j++)
				s[j] = 1 - d;
			if(sor(i) > i)
				son = orta;
			else
				bas = orta + 1;
		}
		c[i] = bak(orta);
		u[c[i]] = 1;
	}
	for(int i = 0; i < n; i++){
		cc[c[i]] = i;
		nee[c[i]] = ne[i];
	}
	answer(nee, cc);
}






// int init() {
//     int i, res;

//     FILE *f = fopen("in.txt", "r");

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

//     for (i = 0; i < NN; ++i) {
//         res = fscanf(f, "%d", &realS[i]);
//     }
//     for (i = 0; i < NN; ++i) {
//         res = fscanf(f, "%d", &realD[i]);
//         inv[realD[i]] = i;
//     }

//     num_calls = 0;
//     return NN;
// }



// int main() {
// 	freopen("out.txt", "w", stdout);
//     int NN;
// 	NN = init();
// 	exploreCave(NN);
//     printf("INCORRECT\nYour solution did not call answer().\n");
// 	return 0;
// }

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 709 ms 532 KB Output is correct
2 Correct 667 ms 560 KB Output is correct
3 Correct 1051 ms 576 KB Output is correct
4 Correct 729 ms 512 KB Output is correct
5 Correct 1071 ms 596 KB Output is correct
6 Correct 1074 ms 604 KB Output is correct
7 Correct 1100 ms 640 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 1052 ms 640 KB Output is correct
13 Correct 1067 ms 644 KB Output is correct
14 Correct 1020 ms 632 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1117 ms 640 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Correct 1006 ms 640 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 460 KB Output is correct
6 Correct 1042 ms 564 KB Output is correct
7 Correct 1059 ms 640 KB Output is correct
8 Correct 1578 ms 560 KB Output is correct
9 Correct 1647 ms 612 KB Output is correct
10 Correct 1622 ms 560 KB Output is correct
11 Correct 1094 ms 580 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 548 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 396 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 128 ms 504 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 209 ms 508 KB Output is correct
24 Correct 217 ms 504 KB Output is correct
25 Correct 209 ms 640 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 161 ms 516 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 153 ms 492 KB Output is correct
31 Correct 141 ms 520 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 6 ms 512 KB Output is correct
35 Correct 206 ms 640 KB Output is correct
36 Correct 221 ms 516 KB Output is correct
37 Correct 5 ms 512 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 709 ms 532 KB Output is correct
2 Correct 667 ms 560 KB Output is correct
3 Correct 1051 ms 576 KB Output is correct
4 Correct 729 ms 512 KB Output is correct
5 Correct 1071 ms 596 KB Output is correct
6 Correct 1074 ms 604 KB Output is correct
7 Correct 1100 ms 640 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 1052 ms 640 KB Output is correct
13 Correct 1067 ms 644 KB Output is correct
14 Correct 1020 ms 632 KB Output is correct
15 Correct 1117 ms 640 KB Output is correct
16 Correct 6 ms 460 KB Output is correct
17 Correct 1006 ms 640 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 5 ms 460 KB Output is correct
20 Correct 1042 ms 564 KB Output is correct
21 Correct 1059 ms 640 KB Output is correct
22 Correct 1578 ms 560 KB Output is correct
23 Correct 1647 ms 612 KB Output is correct
24 Correct 1622 ms 560 KB Output is correct
25 Correct 1094 ms 580 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 6 ms 548 KB Output is correct
35 Correct 6 ms 384 KB Output is correct
36 Correct 6 ms 512 KB Output is correct
37 Correct 6 ms 396 KB Output is correct
38 Correct 6 ms 512 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 6 ms 384 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 5 ms 512 KB Output is correct
43 Correct 5 ms 512 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 128 ms 504 KB Output is correct
46 Correct 7 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 209 ms 508 KB Output is correct
49 Correct 217 ms 504 KB Output is correct
50 Correct 209 ms 640 KB Output is correct
51 Correct 5 ms 512 KB Output is correct
52 Correct 6 ms 384 KB Output is correct
53 Correct 161 ms 516 KB Output is correct
54 Correct 6 ms 384 KB Output is correct
55 Correct 153 ms 492 KB Output is correct
56 Correct 141 ms 520 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 5 ms 512 KB Output is correct
59 Correct 6 ms 512 KB Output is correct
60 Correct 206 ms 640 KB Output is correct
61 Correct 221 ms 516 KB Output is correct
62 Correct 5 ms 512 KB Output is correct
63 Correct 678 ms 552 KB Output is correct
64 Correct 687 ms 544 KB Output is correct
65 Correct 1127 ms 644 KB Output is correct
66 Correct 706 ms 596 KB Output is correct
67 Correct 1054 ms 556 KB Output is correct
68 Correct 1029 ms 564 KB Output is correct
69 Correct 1058 ms 588 KB Output is correct
70 Correct 5 ms 384 KB Output is correct
71 Correct 6 ms 460 KB Output is correct
72 Correct 1018 ms 632 KB Output is correct
73 Correct 1038 ms 576 KB Output is correct
74 Correct 1028 ms 548 KB Output is correct
75 Correct 1022 ms 572 KB Output is correct
76 Correct 5 ms 384 KB Output is correct
77 Correct 6 ms 460 KB Output is correct
78 Correct 1031 ms 632 KB Output is correct
79 Correct 1070 ms 572 KB Output is correct
80 Correct 1625 ms 640 KB Output is correct
81 Correct 1659 ms 592 KB Output is correct
82 Correct 1626 ms 636 KB Output is correct
83 Correct 989 ms 644 KB Output is correct
84 Correct 5 ms 384 KB Output is correct
85 Correct 147 ms 516 KB Output is correct
86 Correct 964 ms 640 KB Output is correct
87 Correct 6 ms 512 KB Output is correct
88 Correct 6 ms 512 KB Output is correct
89 Correct 221 ms 512 KB Output is correct
90 Correct 213 ms 520 KB Output is correct
91 Correct 215 ms 512 KB Output is correct
92 Correct 1604 ms 592 KB Output is correct
93 Correct 1589 ms 696 KB Output is correct
94 Correct 1615 ms 596 KB Output is correct
95 Correct 6 ms 384 KB Output is correct
96 Correct 5 ms 420 KB Output is correct
97 Correct 978 ms 568 KB Output is correct
98 Correct 147 ms 516 KB Output is correct
99 Correct 987 ms 564 KB Output is correct
100 Correct 5 ms 384 KB Output is correct
101 Correct 153 ms 516 KB Output is correct
102 Correct 158 ms 516 KB Output is correct
103 Correct 968 ms 644 KB Output is correct
104 Correct 5 ms 384 KB Output is correct
105 Correct 6 ms 384 KB Output is correct
106 Correct 5 ms 512 KB Output is correct
107 Correct 213 ms 504 KB Output is correct
108 Correct 198 ms 508 KB Output is correct
109 Correct 1513 ms 564 KB Output is correct
110 Correct 1582 ms 640 KB Output is correct
111 Correct 5 ms 384 KB Output is correct