/*************************************
* author: marvinthang *
* created: 08.07.2023 10:25:09 *
*************************************/
#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
// end of template
namespace {
} // namespace
void Solve(int N, int M) {
vector <vector <int>> ans(M);
REP(i, N * M) {
int l = 1, r = M - 1;
while (l <= r) {
int m = l + r >> 1;
vector <bool> ask(M * N, true);
REP(i, m) for (int j: ans[i]) ask[j - 1] = false;
ask[i] = false;
vector <int> q;
REP(i, M * N) if (ask[i]) q.push_back(i + 1);
int v = Query(q);
if (M - v > m) l = m + 1;
else r = m - 1;
}
ans[r].push_back(i + 1);
}
REP(i, M) Answer(ans[i]);
}
#ifdef LOCAL
#include <cstdio>
#include <cstdlib>
#include "dango3.h"
namespace {
using std::exit;
using std::fprintf;
using std::printf;
using std::scanf;
constexpr int Q_MAX = 50'000;
constexpr int NM_MAX = 10'000;
int N;
int M;
int C[NM_MAX + 1];
int query_count = 0;
int answer_count = 0;
bool finishes[NM_MAX + 1];
void WrongAnswer(int code) {
printf("Wrong Answer [%d]\n", code);
exit(0);
}
} // namespace
int Query(const std::vector<int> &x) {
if (++query_count > Q_MAX) WrongAnswer(3);
bool presents[NM_MAX + 1];
for (int i = 1; i <= N * M; ++i) presents[i] = false;
int colors[NM_MAX + 1];
for (int i = 1; i <= N; i++) colors[i] = 0;
for (const int t : x) {
if (t <= 0 || t > N * M) WrongAnswer(1);
if (presents[t]) WrongAnswer(2);
presents[t] = true;
colors[C[t]]++;
}
int color_min = M;
for (int i = 1; i <= N; i++) {
if (colors[i] < color_min) color_min = colors[i];
}
return color_min;
}
void Answer(const std::vector<int> &a) {
++answer_count;
if ((int)a.size() != N) WrongAnswer(4);
for (const int t : a) {
if (t <= 0 || t > N * M) WrongAnswer(5);
if (finishes[t]) WrongAnswer(6);
finishes[t] = true;
}
int colors[NM_MAX + 1];
for (int i = 1; i <= N; i++) colors[i] = 0;
for (const int t : a) {
colors[C[t]]++;
}
for (int i = 1; i <= N; i++) {
if (colors[i] != 1) WrongAnswer(7);
}
}
int main() {
file("dango3");
if (scanf("%d%d", &N, &M) != 2) {
fprintf(stderr, "Error while reading input.\n");
exit(1);
}
for (int i = 1; i <= N * M; ++i) {
if (scanf("%d", &C[i]) != 1) {
fprintf(stderr, "Error while reading input.\n");
exit(1);
}
}
for (int i = 1; i <= N * M; ++i) finishes[i] = false;
Solve(N, M);
if (answer_count != M) WrongAnswer(8);
printf("Accepted: %d\n", query_count);
return 0;
}
#endif
Compilation message
dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:56:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
56 | int m = l + r >> 1;
| ~~^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
13 ms |
368 KB |
Output is correct |
| 2 |
Correct |
11 ms |
304 KB |
Output is correct |
| 3 |
Correct |
15 ms |
304 KB |
Output is correct |
| 4 |
Correct |
11 ms |
340 KB |
Output is correct |
| 5 |
Correct |
13 ms |
364 KB |
Output is correct |
| 6 |
Correct |
11 ms |
340 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
361 ms |
452 KB |
Output is correct |
| 2 |
Correct |
367 ms |
564 KB |
Output is correct |
| 3 |
Correct |
431 ms |
484 KB |
Output is correct |
| 4 |
Correct |
422 ms |
476 KB |
Output is correct |
| 5 |
Correct |
379 ms |
444 KB |
Output is correct |
| 6 |
Correct |
350 ms |
440 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1522 ms |
568 KB |
Output is correct |
| 2 |
Correct |
1612 ms |
564 KB |
Output is correct |
| 3 |
Correct |
1631 ms |
604 KB |
Output is correct |
| 4 |
Correct |
1662 ms |
604 KB |
Output is correct |
| 5 |
Correct |
1359 ms |
548 KB |
Output is correct |
| 6 |
Correct |
1384 ms |
540 KB |
Output is correct |
