// CF template, version 3.0
#include <bits/stdc++.h>
#include "mushrooms.h"
using namespace std;
#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}
//#define int long long int
template <typename T, typename I>
struct segtree {
int n;
vector<T> tree;
vector<I> initial;
T id;
segtree(int i_n, vector<I> i_initial, T i_id): n(i_n), initial(i_initial), id(i_id) {
tree.resize(4 * n);
}
T conquer(T left, T right) {
// write your conquer function
}
T value(I inp) {
// write your value function
}
void build(int v, int l, int r) {
if (l == r) tree[v] = value(initial[l]);
else {
int middle = (l + r) / 2;
build(2 * v, l, middle);
build(2 * v + 1, middle + 1, r);
tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
}
}
void upd(int v, int l, int r, int i, I x) {
if (l == r) tree[v] = value(x);
else {
int middle = (l + r) / 2;
if (middle >= i) upd(2 * v, l, middle, i, x);
else upd(2 * v + 1, middle + 1, r, i, x);
tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
}
}
T query(int v, int l, int r, int ql, int qr) {
if (ql <= l && r <= qr) return tree[v];
else if (r < ql || qr < l) return id;
int middle = (l + r) / 2;
T left = query(2 * v, l, middle, ql, qr);
T right = query(2 * v + 1, middle + 1, r, ql, qr);
return conquer(left, right);
}
};
// vector<int>
int count_mushrooms(int n) {
int a = 1;
int b = 0;
vector<int> A;
vector<int> B;
A.push_back(0);
forto(min(n - 1, 200), i) {
vector<int> X;
X.push_back(0);
X.push_back(i + 1);
int pairs = use_machine(X);
if (pairs) B.push_back(i + 1), b++;
else A.push_back(i + 1), a++;
}
if (n > 201) {
n -= 201;
int ind = 201;
while (n) {
int num = min(n, 100);
vector<int> X;
if (A.size() >= 101) {
forto(100, i) X.push_back(A[i]), X.push_back(ind + i);
X.push_back(A[100]);
int pairs = use_machine(X);
a += 100 - pairs / 2;
} else {
forto(100, i) X.push_back(B[i]), X.push_back(ind + i);
X.push_back(B[100]);
int pairs = use_machine(X);
a += pairs / 2;
}
n -= num;
ind += num;
}
}
return a;
}
Compilation message
mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
| ^
mushrooms.cpp:78:5: note: in expansion of macro 'forto'
78 | forto(min(n - 1, 200), i) {
| ^~~~~
mushrooms.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
| ^
mushrooms.cpp:93:17: note: in expansion of macro 'forto'
93 | forto(100, i) X.push_back(A[i]), X.push_back(ind + i);
| ^~~~~
mushrooms.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
| ^
mushrooms.cpp:98:17: note: in expansion of macro 'forto'
98 | forto(100, i) X.push_back(B[i]), X.push_back(ind + i);
| ^~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
356 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Incorrect |
1 ms |
344 KB |
Invalid value 2000 in the query array. |
| 7 |
Halted |
0 ms |
0 KB |
- |
