oj.uz

답안 #689394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
689394 2023-01-28T11:49:25 Z gesgha Nice sequence (IZhO18_sequence) C++17
76 / 100
 2000 ms 45360 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 = 1e6 + 10;
const bool TEST = 1;

void precalc() {}

int G[N][10];
int sz[N];
int a[N];
int sz_A;
bool vis[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;
}

int cnt(int v) {
    vis[v] = 1;
    int res = 1;
    fr(i, 0, sz[v] - 1) if (!vis[G[v][i]]) {
        return 2;
        res += cnt(G[v][i]);
    }
    return res;
}

bool can(int n, int m, int k) {
    fr(i, 0, k) sz[i] = 0;
    sz_A = 0;
    fr(i, 0, k) 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);
    }
    fr(i, 0, k) if (!vis[i]) dfs(i);
    fill(vis, vis + k + 1, 0);
    fr (i, 0, k) {
        int x = cnt(a[i]);
        if (x > 1) 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;
    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 1 ms 340 KB Ok
3 Correct 1 ms 340 KB Ok
4 Correct 1 ms 340 KB Ok
5 Correct 0 ms 340 KB Ok
6 Correct 1 ms 340 KB Ok
7 Correct 1 ms 340 KB Ok
8 Correct 0 ms 340 KB Ok
9 Correct 0 ms 340 KB Ok
10 Correct 0 ms 340 KB Ok
11 Correct 0 ms 340 KB Ok
12 Correct 0 ms 340 KB Ok

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Ok
2 Correct 0 ms 340 KB Ok
3 Correct 0 ms 340 KB Ok
4 Correct 0 ms 340 KB Ok
5 Correct 0 ms 340 KB Ok
6 Correct 4 ms 596 KB Ok
7 Correct 23 ms 1996 KB Ok
8 Correct 10 ms 1104 KB Ok
9 Correct 27 ms 2388 KB Ok
10 Correct 15 ms 1492 KB Ok

Subtask #3
14.0 / 14.0

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

Subtask #4
15.0 / 15.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 329 ms 22500 KB Ok
7 Correct 258 ms 25788 KB Ok
8 Correct 539 ms 27636 KB Ok
9 Correct 395 ms 25848 KB Ok
10 Correct 232 ms 15576 KB Ok
11 Correct 464 ms 28380 KB Ok

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 340 KB Ok
6 Correct 1 ms 340 KB Ok
7 Correct 1 ms 340 KB Ok
8 Correct 0 ms 340 KB Ok
9 Correct 0 ms 340 KB Ok
10 Correct 0 ms 340 KB Ok
11 Correct 0 ms 340 KB Ok
12 Correct 0 ms 340 KB Ok
13 Correct 0 ms 340 KB Ok
14 Correct 1 ms 340 KB Ok
15 Correct 0 ms 340 KB Ok
16 Correct 0 ms 340 KB Ok
17 Correct 1 ms 340 KB Ok
18 Correct 0 ms 340 KB Ok
19 Correct 0 ms 340 KB Ok
20 Correct 0 ms 340 KB Ok
21 Correct 0 ms 340 KB Ok
22 Correct 1 ms 340 KB Ok
23 Correct 0 ms 340 KB Ok
24 Correct 4 ms 468 KB Ok
25 Correct 4 ms 596 KB Ok
26 Correct 4 ms 596 KB Ok
27 Correct 4 ms 596 KB Ok
28 Correct 3 ms 468 KB Ok
29 Correct 3 ms 596 KB Ok
30 Correct 3 ms 468 KB Ok
31 Correct 6 ms 596 KB Ok
32 Correct 5 ms 468 KB Ok
33 Correct 4 ms 468 KB Ok
34 Correct 10 ms 872 KB Ok
35 Correct 9 ms 852 KB Ok
36 Correct 9 ms 980 KB Ok
37 Correct 10 ms 980 KB Ok
38 Correct 10 ms 940 KB Ok
39 Correct 9 ms 852 KB Ok
40 Correct 10 ms 904 KB Ok
41 Correct 10 ms 904 KB Ok
42 Correct 10 ms 984 KB Ok
43 Correct 10 ms 980 KB Ok

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 340 KB Ok
6 Correct 1 ms 340 KB Ok
7 Correct 1 ms 340 KB Ok
8 Correct 0 ms 340 KB Ok
9 Correct 0 ms 340 KB Ok
10 Correct 0 ms 340 KB Ok
11 Correct 0 ms 340 KB Ok
12 Correct 0 ms 340 KB Ok
13 Correct 0 ms 340 KB Ok
14 Correct 0 ms 340 KB Ok
15 Correct 0 ms 340 KB Ok
16 Correct 0 ms 340 KB Ok
17 Correct 0 ms 340 KB Ok
18 Correct 4 ms 596 KB Ok
19 Correct 23 ms 1996 KB Ok
20 Correct 10 ms 1104 KB Ok
21 Correct 27 ms 2388 KB Ok
22 Correct 15 ms 1492 KB Ok
23 Correct 0 ms 340 KB Ok
24 Correct 1 ms 340 KB Ok
25 Correct 0 ms 340 KB Ok
26 Correct 0 ms 340 KB Ok
27 Correct 1 ms 340 KB Ok
28 Correct 0 ms 340 KB Ok
29 Correct 0 ms 340 KB Ok
30 Correct 0 ms 340 KB Ok
31 Correct 0 ms 340 KB Ok
32 Correct 1 ms 340 KB Ok
33 Correct 0 ms 340 KB Ok
34 Correct 4 ms 468 KB Ok
35 Correct 4 ms 596 KB Ok
36 Correct 4 ms 596 KB Ok
37 Correct 4 ms 596 KB Ok
38 Correct 3 ms 468 KB Ok
39 Correct 3 ms 596 KB Ok
40 Correct 3 ms 468 KB Ok
41 Correct 6 ms 596 KB Ok
42 Correct 5 ms 468 KB Ok
43 Correct 4 ms 468 KB Ok
44 Correct 10 ms 872 KB Ok
45 Correct 9 ms 852 KB Ok
46 Correct 9 ms 980 KB Ok
47 Correct 10 ms 980 KB Ok
48 Correct 10 ms 940 KB Ok
49 Correct 9 ms 852 KB Ok
50 Correct 10 ms 904 KB Ok
51 Correct 10 ms 904 KB Ok
52 Correct 10 ms 984 KB Ok
53 Correct 10 ms 980 KB Ok
54 Correct 189 ms 7624 KB Ok
55 Correct 212 ms 8056 KB Ok
56 Correct 207 ms 8088 KB Ok
57 Correct 150 ms 6860 KB Ok
58 Correct 202 ms 8008 KB Ok
59 Correct 191 ms 7476 KB Ok
60 Correct 162 ms 6988 KB Ok
61 Correct 150 ms 7332 KB Ok
62 Correct 238 ms 8384 KB Ok
63 Correct 180 ms 7372 KB Ok
64 Correct 231 ms 8012 KB Ok
65 Correct 202 ms 7900 KB Ok
66 Correct 173 ms 7548 KB Ok
67 Correct 153 ms 7144 KB Ok
68 Correct 197 ms 7824 KB Ok
69 Correct 594 ms 18344 KB Ok
70 Correct 586 ms 18764 KB Ok
71 Correct 539 ms 18472 KB Ok
72 Correct 527 ms 18216 KB Ok
73 Correct 584 ms 18516 KB Ok
74 Correct 520 ms 18148 KB Ok
75 Correct 519 ms 18248 KB Ok
76 Correct 562 ms 18376 KB Ok
77 Correct 524 ms 18212 KB Ok
78 Correct 631 ms 18188 KB Ok
79 Correct 547 ms 18596 KB Ok
80 Correct 565 ms 18272 KB Ok
81 Correct 536 ms 18520 KB Ok
82 Correct 580 ms 18300 KB Ok
83 Correct 601 ms 18412 KB Ok

Subtask #7
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 340 KB Ok
6 Correct 1 ms 340 KB Ok
7 Correct 1 ms 340 KB Ok
8 Correct 0 ms 340 KB Ok
9 Correct 0 ms 340 KB Ok
10 Correct 0 ms 340 KB Ok
11 Correct 0 ms 340 KB Ok
12 Correct 0 ms 340 KB Ok
13 Correct 0 ms 340 KB Ok
14 Correct 0 ms 340 KB Ok
15 Correct 0 ms 340 KB Ok
16 Correct 0 ms 340 KB Ok
17 Correct 0 ms 340 KB Ok
18 Correct 4 ms 596 KB Ok
19 Correct 23 ms 1996 KB Ok
20 Correct 10 ms 1104 KB Ok
21 Correct 27 ms 2388 KB Ok
22 Correct 15 ms 1492 KB Ok
23 Correct 0 ms 340 KB Ok
24 Correct 1 ms 340 KB Ok
25 Correct 0 ms 340 KB Ok
26 Correct 0 ms 340 KB Ok
27 Correct 1 ms 340 KB Ok
28 Correct 0 ms 340 KB Ok
29 Correct 0 ms 340 KB Ok
30 Correct 0 ms 340 KB Ok
31 Correct 0 ms 340 KB Ok
32 Correct 1 ms 340 KB Ok
33 Correct 0 ms 340 KB Ok
34 Correct 0 ms 340 KB Ok
35 Correct 0 ms 340 KB Ok
36 Correct 1 ms 340 KB Ok
37 Correct 1 ms 340 KB Ok
38 Correct 1 ms 340 KB Ok
39 Correct 329 ms 22500 KB Ok
40 Correct 258 ms 25788 KB Ok
41 Correct 539 ms 27636 KB Ok
42 Correct 395 ms 25848 KB Ok
43 Correct 232 ms 15576 KB Ok
44 Correct 464 ms 28380 KB Ok
45 Correct 4 ms 468 KB Ok
46 Correct 4 ms 596 KB Ok
47 Correct 4 ms 596 KB Ok
48 Correct 4 ms 596 KB Ok
49 Correct 3 ms 468 KB Ok
50 Correct 3 ms 596 KB Ok
51 Correct 3 ms 468 KB Ok
52 Correct 6 ms 596 KB Ok
53 Correct 5 ms 468 KB Ok
54 Correct 4 ms 468 KB Ok
55 Correct 10 ms 872 KB Ok
56 Correct 9 ms 852 KB Ok
57 Correct 9 ms 980 KB Ok
58 Correct 10 ms 980 KB Ok
59 Correct 10 ms 940 KB Ok
60 Correct 9 ms 852 KB Ok
61 Correct 10 ms 904 KB Ok
62 Correct 10 ms 904 KB Ok
63 Correct 10 ms 984 KB Ok
64 Correct 10 ms 980 KB Ok
65 Correct 189 ms 7624 KB Ok
66 Correct 212 ms 8056 KB Ok
67 Correct 207 ms 8088 KB Ok
68 Correct 150 ms 6860 KB Ok
69 Correct 202 ms 8008 KB Ok
70 Correct 191 ms 7476 KB Ok
71 Correct 162 ms 6988 KB Ok
72 Correct 150 ms 7332 KB Ok
73 Correct 238 ms 8384 KB Ok
74 Correct 180 ms 7372 KB Ok
75 Correct 231 ms 8012 KB Ok
76 Correct 202 ms 7900 KB Ok
77 Correct 173 ms 7548 KB Ok
78 Correct 153 ms 7144 KB Ok
79 Correct 197 ms 7824 KB Ok
80 Correct 594 ms 18344 KB Ok
81 Correct 586 ms 18764 KB Ok
82 Correct 539 ms 18472 KB Ok
83 Correct 527 ms 18216 KB Ok
84 Correct 584 ms 18516 KB Ok
85 Correct 520 ms 18148 KB Ok
86 Correct 519 ms 18248 KB Ok
87 Correct 562 ms 18376 KB Ok
88 Correct 524 ms 18212 KB Ok
89 Correct 631 ms 18188 KB Ok
90 Correct 547 ms 18596 KB Ok
91 Correct 565 ms 18272 KB Ok
92 Correct 536 ms 18520 KB Ok
93 Correct 580 ms 18300 KB Ok
94 Correct 601 ms 18412 KB Ok
95 Correct 544 ms 22084 KB Ok
96 Correct 841 ms 29180 KB Ok
97 Correct 841 ms 24688 KB Ok
98 Correct 583 ms 25072 KB Ok
99 Correct 613 ms 23136 KB Ok
100 Correct 748 ms 24624 KB Ok
101 Correct 709 ms 26064 KB Ok
102 Correct 716 ms 24400 KB Ok
103 Correct 809 ms 26852 KB Ok
104 Correct 843 ms 28116 KB Ok
105 Correct 890 ms 28900 KB Ok
106 Correct 637 ms 27588 KB Ok
107 Correct 782 ms 27024 KB Ok
108 Correct 1038 ms 29096 KB Ok
109 Correct 863 ms 29464 KB Ok
110 Execution timed out 2087 ms 45360 KB Time limit exceeded
111 Halted 0 ms 0 KB -