This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
#include "dango3.h"
using namespace std;
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 400;
const int MAXM = 25;
namespace {
int n, m;
}
void Solve(int N, int M) {
n = N; m = M;
vi id(n * m, 0);
iota(ALL(id), 1);
RREP (i, m - 1, 0) {
vi pref, suf;
reverse(ALL(id));
for (int j : id) {
suf.pb(j);
}
reverse(ALL(id));
vi ans;
for (int j : id) {
suf.pop_back();
vi vec;
for (int k : pref) {
vec.pb(k);
}
for (int k : suf) {
vec.pb(k);
}
if (Query(vec) == i) {
ans.pb(j);
if (SZ(ans) == n) {
break;
}
} else {
pref.pb(j);
}
}
vi nid;
for (int k : pref) {
nid.pb(k);
}
for (int k : suf) {
nid.pb(k);
}
id = nid;
Answer(ans);
}
}
# | 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... |