oj.uz

답안 #796216

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796216 2023-07-28T08:04:07 Z arush_agu 사육제 (CEOI14_carnival) C++17
0 / 100
 10 ms 320 KB 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

void solve() {
  int n;
  cin >> n;

  auto get_rng = [](int l, int r) {
    vi res;
    for (int i = l; i <= r; i++)
      res.push_back(i);
    return res;
  };
  auto ask = [](vi q) {
    cout << q.size() << " ";
    for (int &x : q)
      cout << x << " ";
    cout << endl;
    int res;
    cin >> res;
    return res;
  };
  auto ans = [&](vi a) {
    cout << "0 ";
    for (int i = 1; i <= n; i++)
      cout << a[i] << " ";
    cout << endl;
  };

  int presp = 0;
  vi res(n + 1, -1);
  int counter = 1;
  for (int i = 1; i <= n; i++) {
    int resp = ask(get_rng(1, i));
    if (resp != presp) {
      assert(resp == presp + 1);
      res[i] = counter++;
      presp = resp;
      continue;
    }

    int l = 1, r = i - 1;
    while (l < r) {
      int mid = (l + r) / 2;
      vi aarr = get_rng(l, mid);
      aarr.push_back(i);
      int tmp = ask(aarr);
      if (tmp == (mid - l + 2)) {
        l = mid + 1;
      } else
        r = mid;
    }

    res[i] = res[l];

    presp = resp;
  }
  ans(res);
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

carnival.cpp: In function 'int main()':
carnival.cpp:153:11: warning: unused variable 'start' [-Wunused-variable]
  153 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 316 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 312 KB Output is correct
2 Incorrect 9 ms 208 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 320 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 308 KB Output is correct
2 Incorrect 7 ms 316 KB Incorrect
3 Halted 0 ms 0 KB -