oj.uz

답안 #598117

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
598117 2022-07-17T16:05:29 Z xynex 사육제 (CEOI14_carnival) C++17
100 / 100
 28 ms 256 KB 
/**
  * Author: Tenjin
  * Created: 28.06.2022 14:48
  * Why am I so stupid? :c
  * Slishkom slab
**/

#include <bits/stdc++.h>
// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int N = 3e4 + 1;
const ll INF = 9e18;
const int M = 2e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

int a[N];
int ask(int l, int r) {
  write(r - l + 1, ' ');
  for(int i = l; i <= r; ++i) {
    write(i, ' ');
  }
  print("");
  int x; read(x);
  return x;
}
void solve() {
  int n; read(n);
  int whr = 1;
  a[1] = whr++;
  for(int i = 2; i <= n; ++i) {
    if(ask(1, i - 1) != ask(1, i)) {
      a[i] = whr++;
    }
    else {
      int l = 1, r = i - 1;
      while((r - l) >= 0) {
        int mid = (r + l) >> 1;
        if(ask(mid, i - 1) != ask(mid, i)) r = mid - 1;
        else l = mid + 1;
      }
     // print(r, a[r]);
      a[i] = a[r];
    }
  }
  for(int i = 0; i <= n; ++i) {
    write(a[i], ' ');
  }
}

int main() {
  //freop("");
  ios::sync_with_stdio(false);
  //cin.tie(0);
//  cout.tie(0);
  int t = 1;
//  read(t);
  for (int i = 1; i <= t; ++i) {
    //write("Case #" + to_string(i) + ": ");
    solve();
  }
  return 0;
}

Compilation message

carnival.cpp: In function 'void freop(std::string)':
carnival.cpp:71:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
carnival.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 208 KB Output is correct
2 Correct 15 ms 208 KB Output is correct
3 Correct 11 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 21 ms 208 KB Output is correct
6 Correct 23 ms 208 KB Output is correct
7 Correct 23 ms 208 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 208 KB Output is correct
2 Correct 18 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 6 ms 208 KB Output is correct
5 Correct 18 ms 224 KB Output is correct
6 Correct 20 ms 208 KB Output is correct
7 Correct 24 ms 208 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 256 KB Output is correct
2 Correct 22 ms 208 KB Output is correct
3 Correct 13 ms 208 KB Output is correct
4 Correct 6 ms 208 KB Output is correct
5 Correct 15 ms 208 KB Output is correct
6 Correct 22 ms 208 KB Output is correct
7 Correct 21 ms 208 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 208 KB Output is correct
2 Correct 21 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 5 ms 208 KB Output is correct
5 Correct 16 ms 208 KB Output is correct
6 Correct 11 ms 208 KB Output is correct
7 Correct 18 ms 208 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 208 KB Output is correct
2 Correct 22 ms 208 KB Output is correct
3 Correct 11 ms 208 KB Output is correct
4 Correct 11 ms 208 KB Output is correct
5 Correct 14 ms 208 KB Output is correct
6 Correct 9 ms 208 KB Output is correct
7 Correct 6 ms 208 KB Output is correct