oj.uz

Submission #958545

# Submission time Handle Problem Language Result Execution time Memory
958545 2024-04-06T03:09:17 Z gaga999 Super Dango Maker (JOI22_dango3) C++17
100 / 100
 2078 ms 940 KB 
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

void Solve(int N, int M);

int Query(const std::vector<int> &x);
void Answer(const std::vector<int> &a);

namespace
{
    int A, cp = 1;
    vector<int> ans[30];
    bool ban[10005];
    int qy(int lm, int cr)
    {
        for (int i = 1; i <= lm; i++)
            for (int j : ans[i])
                ban[j] = 1;
        vector<int> tp;
        for (int i = 1; i <= A; i++)
            if (!ban[i] && i != cr)
                tp.pb(i);
        for (int i = 1; i <= lm; i++)
            for (int j : ans[i])
                ban[j] = 0;
        return Query(tp);
    }
}

void Solve(int n, int m)
{
    A = n * m;
    for (int i = 1; i <= A; i++)
    {
        int l = 1, r = cp;
        while (l < r)
        {
            int md = (l + r) >> 1;
            if (qy(md, i) == m - md)
                r = md;
            else
                l = md + 1;
        }
        ans[l].pb(i);
        if (r == cp)
            cp++;
    }
    // for (int i = 1; i <= m; i++)
    // {
    //     for (int j : ans[i])
    //         cerr << j << " ";
    //     cerr << '\n';
    // }
    for (int i = 1; i <= m; i++)
        Answer(ans[i]);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 504 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 348 KB Output is correct
2 Correct 14 ms 520 KB Output is correct
3 Correct 16 ms 348 KB Output is correct
4 Correct 18 ms 520 KB Output is correct
5 Correct 13 ms 348 KB Output is correct
6 Correct 11 ms 348 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 348 KB Output is correct
2 Correct 399 ms 844 KB Output is correct
3 Correct 522 ms 592 KB Output is correct
4 Correct 520 ms 832 KB Output is correct
5 Correct 354 ms 844 KB Output is correct
6 Correct 346 ms 584 KB Output is correct

Subtask #4
78.0 / 78.0

# Verdict Execution time Memory Grader output
1 Correct 1649 ms 900 KB Output is correct
2 Correct 1594 ms 856 KB Output is correct
3 Correct 2078 ms 752 KB Output is correct
4 Correct 2073 ms 940 KB Output is correct
5 Correct 1359 ms 928 KB Output is correct
6 Correct 1342 ms 684 KB Output is correct