Submission #481650

#	Time	Username	Problem	Language	Result	Execution time	Memory
481650		ssense	Cave (IOI13_cave)	C++14	12 / 100	8 ms	332 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
//																																					int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}//ssense
void exploreCave(int n)
{
	int s[n], d[n];
	for(int i = 0; i < n; i++)
	{
		s[i] = 0;
	}
	for(int i = 0; i < n; i++)
	{
		d[i] = i;
	}
	while(true)
	{
		int now = tryCombination(s);
		if(now == -1)
		{
			break;
		}
		s[now] = 1;
	}
	answer(s, d);
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24