Submission #495768

#	Time	Username	Problem	Language	Result	Execution time	Memory
495768		xynex	Nice sequence (IZhO18_sequence)	C++17	100 / 100	1485 ms	33076 KiB

sequence

/*
* Author: xynex
* Created: 20.12.2021 09:17
* 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 = 3e6 + 5;
const ll INF = 9e18;
const int M = 3e3 + 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*/

void precalc() {

}

int n, m;
int _[N];
int ans[N];
int cnt[N];
bool ok;
void made_array(int lim) {
    for(int i = 0; i <= lim; ++i) _[i] = 0, cnt[i] = 0;
    for(int i = 0; i <= lim; ++i) {
        if(i >= n) _[i - n]++;
        if((i + m) <= lim) _[i + m]++;
    }
    queue<int> q;
    for(int i = 0; i <= lim; ++i) {
        if(_[i]) continue;
        q.push(i);
    }
    if(q.empty()) {
        ok = 0;
    }
    int whr = 1;
    while(!q.empty()) {
        int v = q.front();
        q.pop();
        cnt[v] = whr++;
        if(v >= n && _[v - n]) {
            _[v - n]--;
            if(!_[v - n]) q.push(v - n);
        }
        if((v + m) <= lim && _[v + m]) {
            _[v + m]--;
            if(!_[v + m]) q.push(v + m);
        }
    }
}
bool check(int lim) {
    for(int i = 1; i <= lim; ++i) ans[i] = cnt[i] - cnt[i - 1];
    int cnt = 0;
    /*for(int i = 1; i <= lim; ++i) write(ans[i], ' ');
    print("");*/
    for(int i = 1; i <= lim; ++i) {
        if(i > n) cnt -= ans[i - n];
        cnt += ans[i];
        if(i >= n) {
            if(cnt >= 0) {
                return 0;
            }
        }
    }
    cnt = 0;
    for(int i = 1; i <= lim; ++i) {
        if(i > m) cnt -= ans[i - m];
        cnt += ans[i];
        if(i >= m) {
            if(cnt <= 0) {
                return 0;
            }
        }
    }
    return 1;
}
void solve() {
    read(n, m);
    int l = min(n - 1, m - 1), r = n + m;
  //  print("X");
    while((r - l) >= 0) {
        int mid = (r + l) >> 1;
        ok = 1;
        made_array(mid);
        //print(mid);
        if(check(mid)) l = mid + 1;
        else r = mid - 1;
    }
    l--;
    made_array(l);
    if(!check(l)) {
        print(0);
        return;
    }
    print(l);
    for(int i = 1; i <= l; ++i) write(ans[i], ' ');
    print("");
}

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

Compilation message (stderr)

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

• Subtask 1: 6 / 6
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 14 / 14
• Subtask 6: 18 / 18
• Subtask 7: 24 / 24