Submission #1018715

#TimeUsernameProblemLanguageResultExecution timeMemory
1018715j_vdd16Counting Mushrooms (IOI20_mushrooms)C++17
10 / 100
139 ms352 KiB
#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

int use_machine(vi x);

int count_mushrooms(int n)
{
	int answer = 1;
	for (int i = 1; i < n; i++)
	{
		answer += 1 - use_machine({ 0, i });
	}

	return answer;
}
#Verdict Execution timeMemoryGrader output
Fetching results...