oj.uz

Submission #301970

# Submission time Handle Problem Language Result Execution time Memory
301970 2020-09-18T10:41:59 Z BlancaHM Cave (IOI13_cave) C++14
46 / 100
 20 ms 512 KB 
#include "cave.h"
#include <iostream>
#include <fstream>
#include <cfloat>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstring>
#include <cmath>
#include <climits>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<string> vs;
#define fir first
#define sec second
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define mp make_pair
#define len(v) ((int)v.size())
#define all(v) v.begin(), v.end()

void exploreCave(int N) {
	int finalS[N], finalD[N], switchComb[N];
	memset(finalS, -1, sizeof(finalS));
	memset(finalD, -1, sizeof(finalD));
	memset(switchComb, 0, sizeof(switchComb));
	int val = tryCombination(switchComb), curVal;
	while(val != -1) {
		for (int i = 0; i < N; i++) {
			if (finalS[i] != -1) continue;
			switchComb[i] = 1;
			curVal = tryCombination(switchComb);
			if (curVal == -1) {
				finalD[i] = val;
				finalS[i] = 1;
				val = -1;
				break;
			}
			if (curVal > val) {
				finalD[i] = val;
				val = curVal;
				finalS[i] = 1;
			} else if (curVal < val) {
				finalD[i] = curVal;
				finalS[i] = 0;
				switchComb[i] = 0;
			} else switchComb[i] = 0;
		}
		if (val == -1) break;
	}
	for (int i = 0; i < N; i++) {
		if (finalS[i] == -1) {
			finalS[i] = switchComb[i];
			switchComb[i] = 1 - switchComb[i];
			curVal = tryCombination(switchComb);
			finalD[i] = curVal;
			switchComb[i] = 1 - switchComb[i];
		}
	}
	answer(finalS, finalD);
}

Subtask #1
12.0 / 12.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 15 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 15 ms 384 KB Output is correct
7 Correct 15 ms 384 KB Output is correct
8 Correct 17 ms 384 KB Output is correct
9 Correct 18 ms 384 KB Output is correct
10 Correct 17 ms 384 KB Output is correct
11 Correct 15 ms 384 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Incorrect 3 ms 384 KB too much calls on tryCombination()
21 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 464 KB Output is correct
2 Correct 15 ms 416 KB Output is correct
3 Correct 15 ms 384 KB Output is correct
4 Correct 11 ms 512 KB Output is correct
5 Correct 15 ms 384 KB Output is correct
6 Correct 20 ms 384 KB Output is correct
7 Correct 15 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 15 ms 512 KB Output is correct
13 Correct 15 ms 384 KB Output is correct
14 Correct 15 ms 384 KB Output is correct
15 Correct 15 ms 384 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 15 ms 384 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 15 ms 384 KB Output is correct
21 Correct 15 ms 384 KB Output is correct
22 Correct 17 ms 384 KB Output is correct
23 Correct 18 ms 384 KB Output is correct
24 Correct 17 ms 384 KB Output is correct
25 Correct 15 ms 384 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 1 ms 256 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 1 ms 256 KB Output is correct
45 Incorrect 3 ms 384 KB too much calls on tryCombination()
46 Halted 0 ms 0 KB -