# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
881551 | 2023-12-01T12:47:00 Z | Regulus | Super Dango Maker (JOI22_dango3) | C++17 | 1 ms | 348 KB |
#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 = 105; ll nn, mm, cnt[N], a[N]; vector<int> v[N]; inline void dfs(int d) { if (d > nn*mm) { int i, j, ret; for (i=0; i < mm; ++i) { v[i].clear(); for (j=1; j <= nn; ++j) v[i].pb(a[i*mm+j]); ret = Query(v[i]); if (ret != 1) break; } if (i == mm) { for (i=0; i < mm; ++i) Answer(v[i]); exit(0); } return; } for (int i=1; i <= 4; ++i) { if (!cnt[i]) continue; a[d] = i, --cnt[i]; dfs(d+1); ++cnt[i]; } } void Solve(int n, int m) { ll i, j; nn = n, mm = m; dfs(1); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Wrong Answer [8] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Wrong Answer [8] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Wrong Answer [8] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Wrong Answer [8] |
2 | Halted | 0 ms | 0 KB | - |