# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
881550 | Regulus | Super Dango Maker (JOI22_dango3) | C++17 | 2 ms | 604 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "dango3.h"
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define debug(x) cerr << #x << " = " << (x) << ' '
#define endl cerr << '\n'
#define all(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()
#define lowbit(x) (x)&-(x)
#define pb emplace_back
#define F first
#define S second
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const int N = 1e5+5;
ll n, m;
bool in[N], in2[N];
vector<int> v, v2;
void Solve(int tmp1, int tmp2)
{
ll i, j, cur=0, cnt, pre=-1;
n = tmp1, m = tmp2;
for (i=1; i <= n*m; ++i) in[i] = 1;
for (int t=1; t <= m; ++t)
{
while (cur <= n*m && !in[cur]) ++cur;
if (cur > n*m) break;
for (i=1; i <= n*m; ++i) in2[i] = 0;
v.clear();
in2[cur] = 1;
for (i=1; i <= n*m; ++i)
{
if (!in[i] || cur == i) continue;
in2[i] = 1;
for (j=1; j <= n*m; ++j)
{
if (!in[j] || in2[j]) continue;
v.pb(j);
}
int ret = Query(v);
if (ret != m-t) v.pop_back(), in2[i] = 0;
}
Answer(v);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |