oj.uz

답안 #689408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
689408 2023-01-28T12:24:56 Z gesgha Nice sequence (IZhO18_sequence) C++17
76 / 100
 2000 ms 57092 KB 
#include <bits/stdc++.h>

#define fr(x, l, r) for (int x = l; x <= r; x++)
#define rf(x, l, r) for (int x = l; x >= r; x--)
#define fe(x, y) for (auto& x : y)

#define fi first
#define se second
#define m_p make_pair
#define pb push_back
#define pw(x) (ll(1) << ull(x))
#define all(x) (x).begin(), x.end()
#define sz(x) (int)x.size()
#define mt make_tuple

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;

template <typename T>
using ve = vector<T>;

template <typename T>
bool umn(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <typename T>
bool umx(T& a, T b) {return a < b ? a = b, 1 : 0;}

const ll OO = 1e18;
const int oo = 1e9;
const int mod = 1e9 + 7;
const int P = 29;
const ld eps = 0.00000001;
const int N = 4e5 + 10;
const bool TEST = 1;

void precalc() {}

int G[N][5];
int sz[N];
int a[N];
int sz_A;
bool vis[N];
int ptr[N];

void dfs(int v) {
    vis[v] = 1;
    fr(i, 0, sz[v] - 1) if (!vis[G[v][i]]) dfs(G[v][i]);
    a[sz_A++] = v;
}


bool visn[N];

bool is_cycle(int v) {
    a[sz_A++] = v;
    visn[v] = 1;
    vis[v] = 1;
    bool ok = 0;
    fr(i, 0, sz[v] - 1) {
        if (visn[G[v][i]]) return 1;
        if (!vis[G[v][i]]) {
            ok |= is_cycle(G[v][i]);
            if (ok) return 1;
        }
    }
    return 0;
}


bool can(int n, int m, int k) {
    sz_A = 0;
    fr(i, 0, k) sz[i] = ptr[i] = vis[i] = 0;

    fr(i, 1, k) {
        if (i + n - 1 <= k) G[i + n - 1][sz[i + n - 1]++] = (i - 1);
        if (i + m - 1 <= k) G[i - 1][sz[i - 1]++] = (i + m - 1);
    }
    bool ok = 0;
    fr(i, 0, k) {
        if (vis[i]) continue;
        ok |= is_cycle(i);
        fr(i, 0, sz_A - 1) visn[a[i]] = 0;
        sz_A = 0;
        if (ok) return 0;
    }
    return 1;
}
int pr[N];
int A[N];

void solve(int TST) {
    int n, m;
    cin >> n >> m;

    int l = max(n, m) - 1;
    int r = 2 * max(n, m);

    while(l < r) {
        int tm = (l + r + 1) >> 1;
        if (can(n, m, tm)) l = tm;
        else r = tm - 1;
    }

    fr(i, 0, l) {
        sz[i] = 0;
        ptr[i] = 0;
    }
    sz_A = 0;
    fr(i, 0, l) vis[i] = 0;

    fr(i, 1, l) {
        if (i + n - 1 <= l) G[i + n - 1][sz[i + n - 1]++] = (i - 1);
        if (i + m - 1 <= l) G[i - 1][sz[i - 1]++] = (i + m - 1);
    }
    fr(i, 0, l) if (!vis[i]) dfs(i);
    reverse(a, a + sz_A);

    int cnt = 0;
    fr (i, 0, sz_A - 1) pr[a[i]] = cnt++;

    fr(i, 1, l) A[i] = pr[i] - pr[i - 1];

    cout << l << endl;
    fr(i, 1, l) cout << A[i] << ' ';
    cout << endl;
}


int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int q = 1;
    if (TEST) cin >> q;
    precalc();
    for (int z = 1; z <= q; z++) {
        solve(z);
    }
    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Ok
2 Correct 0 ms 340 KB Ok
3 Correct 1 ms 340 KB Ok
4 Correct 1 ms 340 KB Ok
5 Correct 1 ms 340 KB Ok
6 Correct 1 ms 340 KB Ok
7 Correct 1 ms 340 KB Ok
8 Correct 1 ms 340 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 1 ms 340 KB Ok
11 Correct 1 ms 340 KB Ok
12 Correct 1 ms 340 KB Ok

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Ok
2 Correct 1 ms 340 KB Ok
3 Correct 1 ms 340 KB Ok
4 Correct 1 ms 340 KB Ok
5 Correct 1 ms 340 KB Ok
6 Correct 4 ms 596 KB Ok
7 Correct 21 ms 1748 KB Ok
8 Correct 10 ms 980 KB Ok
9 Correct 27 ms 2004 KB Ok
10 Correct 14 ms 1256 KB Ok

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Ok
2 Correct 0 ms 340 KB Ok
3 Correct 0 ms 340 KB Ok
4 Correct 1 ms 340 KB Ok
5 Correct 1 ms 340 KB Ok
6 Correct 0 ms 340 KB Ok
7 Correct 1 ms 340 KB Ok
8 Correct 1 ms 340 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 1 ms 340 KB Ok
11 Correct 1 ms 340 KB Ok

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Ok
2 Correct 0 ms 340 KB Ok
3 Correct 1 ms 340 KB Ok
4 Correct 0 ms 340 KB Ok
5 Correct 1 ms 340 KB Ok
6 Correct 299 ms 20128 KB Ok
7 Correct 269 ms 22888 KB Ok
8 Correct 542 ms 24732 KB Ok
9 Correct 408 ms 23364 KB Ok
10 Correct 225 ms 13788 KB Ok
11 Correct 455 ms 25484 KB Ok

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Ok
2 Correct 0 ms 340 KB Ok
3 Correct 1 ms 340 KB Ok
4 Correct 1 ms 340 KB Ok
5 Correct 1 ms 340 KB Ok
6 Correct 1 ms 340 KB Ok
7 Correct 1 ms 340 KB Ok
8 Correct 1 ms 340 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 1 ms 340 KB Ok
11 Correct 1 ms 340 KB Ok
12 Correct 1 ms 340 KB Ok
13 Correct 1 ms 340 KB Ok
14 Correct 0 ms 340 KB Ok
15 Correct 0 ms 340 KB Ok
16 Correct 1 ms 340 KB Ok
17 Correct 1 ms 340 KB Ok
18 Correct 0 ms 340 KB Ok
19 Correct 1 ms 340 KB Ok
20 Correct 1 ms 340 KB Ok
21 Correct 1 ms 340 KB Ok
22 Correct 1 ms 340 KB Ok
23 Correct 1 ms 340 KB Ok
24 Correct 3 ms 468 KB Ok
25 Correct 4 ms 468 KB Ok
26 Correct 3 ms 468 KB Ok
27 Correct 3 ms 468 KB Ok
28 Correct 4 ms 468 KB Ok
29 Correct 2 ms 468 KB Ok
30 Correct 2 ms 468 KB Ok
31 Correct 4 ms 468 KB Ok
32 Correct 4 ms 528 KB Ok
33 Correct 4 ms 468 KB Ok
34 Correct 9 ms 852 KB Ok
35 Correct 11 ms 916 KB Ok
36 Correct 9 ms 852 KB Ok
37 Correct 9 ms 852 KB Ok
38 Correct 8 ms 876 KB Ok
39 Correct 8 ms 884 KB Ok
40 Correct 9 ms 852 KB Ok
41 Correct 9 ms 852 KB Ok
42 Correct 19 ms 884 KB Ok
43 Correct 9 ms 864 KB Ok

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Ok
2 Correct 0 ms 340 KB Ok
3 Correct 1 ms 340 KB Ok
4 Correct 1 ms 340 KB Ok
5 Correct 1 ms 340 KB Ok
6 Correct 1 ms 340 KB Ok
7 Correct 1 ms 340 KB Ok
8 Correct 1 ms 340 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 1 ms 340 KB Ok
11 Correct 1 ms 340 KB Ok
12 Correct 1 ms 340 KB Ok
13 Correct 1 ms 340 KB Ok
14 Correct 1 ms 340 KB Ok
15 Correct 1 ms 340 KB Ok
16 Correct 1 ms 340 KB Ok
17 Correct 1 ms 340 KB Ok
18 Correct 4 ms 596 KB Ok
19 Correct 21 ms 1748 KB Ok
20 Correct 10 ms 980 KB Ok
21 Correct 27 ms 2004 KB Ok
22 Correct 14 ms 1256 KB Ok
23 Correct 1 ms 340 KB Ok
24 Correct 0 ms 340 KB Ok
25 Correct 0 ms 340 KB Ok
26 Correct 1 ms 340 KB Ok
27 Correct 1 ms 340 KB Ok
28 Correct 0 ms 340 KB Ok
29 Correct 1 ms 340 KB Ok
30 Correct 1 ms 340 KB Ok
31 Correct 1 ms 340 KB Ok
32 Correct 1 ms 340 KB Ok
33 Correct 1 ms 340 KB Ok
34 Correct 3 ms 468 KB Ok
35 Correct 4 ms 468 KB Ok
36 Correct 3 ms 468 KB Ok
37 Correct 3 ms 468 KB Ok
38 Correct 4 ms 468 KB Ok
39 Correct 2 ms 468 KB Ok
40 Correct 2 ms 468 KB Ok
41 Correct 4 ms 468 KB Ok
42 Correct 4 ms 528 KB Ok
43 Correct 4 ms 468 KB Ok
44 Correct 9 ms 852 KB Ok
45 Correct 11 ms 916 KB Ok
46 Correct 9 ms 852 KB Ok
47 Correct 9 ms 852 KB Ok
48 Correct 8 ms 876 KB Ok
49 Correct 8 ms 884 KB Ok
50 Correct 9 ms 852 KB Ok
51 Correct 9 ms 852 KB Ok
52 Correct 19 ms 884 KB Ok
53 Correct 9 ms 864 KB Ok
54 Correct 130 ms 6268 KB Ok
55 Correct 173 ms 6764 KB Ok
56 Correct 159 ms 6712 KB Ok
57 Correct 116 ms 5572 KB Ok
58 Correct 146 ms 6524 KB Ok
59 Correct 140 ms 6216 KB Ok
60 Correct 116 ms 5772 KB Ok
61 Correct 110 ms 5964 KB Ok
62 Correct 183 ms 6932 KB Ok
63 Correct 138 ms 6052 KB Ok
64 Correct 176 ms 6616 KB Ok
65 Correct 156 ms 6472 KB Ok
66 Correct 128 ms 6196 KB Ok
67 Correct 118 ms 5884 KB Ok
68 Correct 147 ms 6492 KB Ok
69 Correct 442 ms 16840 KB Ok
70 Correct 572 ms 17216 KB Ok
71 Correct 423 ms 16844 KB Ok
72 Correct 455 ms 16700 KB Ok
73 Correct 468 ms 17076 KB Ok
74 Correct 399 ms 16792 KB Ok
75 Correct 396 ms 16748 KB Ok
76 Correct 472 ms 16876 KB Ok
77 Correct 389 ms 16736 KB Ok
78 Correct 476 ms 16612 KB Ok
79 Correct 450 ms 17060 KB Ok
80 Correct 419 ms 16840 KB Ok
81 Correct 410 ms 17168 KB Ok
82 Correct 453 ms 16884 KB Ok
83 Correct 408 ms 16844 KB Ok

Subtask #7
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Ok
2 Correct 0 ms 340 KB Ok
3 Correct 1 ms 340 KB Ok
4 Correct 1 ms 340 KB Ok
5 Correct 1 ms 340 KB Ok
6 Correct 1 ms 340 KB Ok
7 Correct 1 ms 340 KB Ok
8 Correct 1 ms 340 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 1 ms 340 KB Ok
11 Correct 1 ms 340 KB Ok
12 Correct 1 ms 340 KB Ok
13 Correct 1 ms 340 KB Ok
14 Correct 1 ms 340 KB Ok
15 Correct 1 ms 340 KB Ok
16 Correct 1 ms 340 KB Ok
17 Correct 1 ms 340 KB Ok
18 Correct 4 ms 596 KB Ok
19 Correct 21 ms 1748 KB Ok
20 Correct 10 ms 980 KB Ok
21 Correct 27 ms 2004 KB Ok
22 Correct 14 ms 1256 KB Ok
23 Correct 1 ms 340 KB Ok
24 Correct 0 ms 340 KB Ok
25 Correct 0 ms 340 KB Ok
26 Correct 1 ms 340 KB Ok
27 Correct 1 ms 340 KB Ok
28 Correct 0 ms 340 KB Ok
29 Correct 1 ms 340 KB Ok
30 Correct 1 ms 340 KB Ok
31 Correct 1 ms 340 KB Ok
32 Correct 1 ms 340 KB Ok
33 Correct 1 ms 340 KB Ok
34 Correct 1 ms 340 KB Ok
35 Correct 0 ms 340 KB Ok
36 Correct 1 ms 340 KB Ok
37 Correct 0 ms 340 KB Ok
38 Correct 1 ms 340 KB Ok
39 Correct 299 ms 20128 KB Ok
40 Correct 269 ms 22888 KB Ok
41 Correct 542 ms 24732 KB Ok
42 Correct 408 ms 23364 KB Ok
43 Correct 225 ms 13788 KB Ok
44 Correct 455 ms 25484 KB Ok
45 Correct 3 ms 468 KB Ok
46 Correct 4 ms 468 KB Ok
47 Correct 3 ms 468 KB Ok
48 Correct 3 ms 468 KB Ok
49 Correct 4 ms 468 KB Ok
50 Correct 2 ms 468 KB Ok
51 Correct 2 ms 468 KB Ok
52 Correct 4 ms 468 KB Ok
53 Correct 4 ms 528 KB Ok
54 Correct 4 ms 468 KB Ok
55 Correct 9 ms 852 KB Ok
56 Correct 11 ms 916 KB Ok
57 Correct 9 ms 852 KB Ok
58 Correct 9 ms 852 KB Ok
59 Correct 8 ms 876 KB Ok
60 Correct 8 ms 884 KB Ok
61 Correct 9 ms 852 KB Ok
62 Correct 9 ms 852 KB Ok
63 Correct 19 ms 884 KB Ok
64 Correct 9 ms 864 KB Ok
65 Correct 130 ms 6268 KB Ok
66 Correct 173 ms 6764 KB Ok
67 Correct 159 ms 6712 KB Ok
68 Correct 116 ms 5572 KB Ok
69 Correct 146 ms 6524 KB Ok
70 Correct 140 ms 6216 KB Ok
71 Correct 116 ms 5772 KB Ok
72 Correct 110 ms 5964 KB Ok
73 Correct 183 ms 6932 KB Ok
74 Correct 138 ms 6052 KB Ok
75 Correct 176 ms 6616 KB Ok
76 Correct 156 ms 6472 KB Ok
77 Correct 128 ms 6196 KB Ok
78 Correct 118 ms 5884 KB Ok
79 Correct 147 ms 6492 KB Ok
80 Correct 442 ms 16840 KB Ok
81 Correct 572 ms 17216 KB Ok
82 Correct 423 ms 16844 KB Ok
83 Correct 455 ms 16700 KB Ok
84 Correct 468 ms 17076 KB Ok
85 Correct 399 ms 16792 KB Ok
86 Correct 396 ms 16748 KB Ok
87 Correct 472 ms 16876 KB Ok
88 Correct 389 ms 16736 KB Ok
89 Correct 476 ms 16612 KB Ok
90 Correct 450 ms 17060 KB Ok
91 Correct 419 ms 16840 KB Ok
92 Correct 410 ms 17168 KB Ok
93 Correct 453 ms 16884 KB Ok
94 Correct 408 ms 16844 KB Ok
95 Correct 347 ms 17484 KB Ok
96 Correct 586 ms 23784 KB Ok
97 Correct 567 ms 20044 KB Ok
98 Correct 338 ms 19824 KB Ok
99 Correct 474 ms 18772 KB Ok
100 Correct 515 ms 19924 KB Ok
101 Correct 552 ms 21040 KB Ok
102 Correct 485 ms 20036 KB Ok
103 Correct 530 ms 21660 KB Ok
104 Correct 567 ms 23096 KB Ok
105 Correct 561 ms 23396 KB Ok
106 Correct 390 ms 22092 KB Ok
107 Correct 541 ms 22004 KB Ok
108 Correct 596 ms 23576 KB Ok
109 Correct 465 ms 23688 KB Ok
110 Execution timed out 2082 ms 57092 KB Time limit exceeded
111 Halted 0 ms 0 KB -