oj.uz

답안 #689406

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
689406 2023-01-28T12:20:11 Z gesgha Nice sequence (IZhO18_sequence) C++17
76 / 100
 2000 ms 62548 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];
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 1 ms 340 KB Ok
3 Correct 1 ms 340 KB Ok
4 Correct 0 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 1 ms 340 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 0 ms 340 KB Ok
11 Correct 0 ms 340 KB Ok
12 Correct 1 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 1 ms 340 KB Ok
4 Correct 1 ms 340 KB Ok
5 Correct 0 ms 340 KB Ok
6 Correct 4 ms 656 KB Ok
7 Correct 20 ms 1908 KB Ok
8 Correct 11 ms 1080 KB Ok
9 Correct 27 ms 2220 KB Ok
10 Correct 13 ms 1392 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 1 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 0 ms 340 KB Ok
5 Correct 0 ms 340 KB Ok
6 Correct 312 ms 23556 KB Ok
7 Correct 232 ms 26700 KB Ok
8 Correct 497 ms 28552 KB Ok
9 Correct 386 ms 26664 KB Ok
10 Correct 219 ms 16144 KB Ok
11 Correct 433 ms 29588 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 0 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 1 ms 340 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 0 ms 340 KB Ok
11 Correct 0 ms 340 KB Ok
12 Correct 1 ms 340 KB Ok
13 Correct 0 ms 340 KB Ok
14 Correct 1 ms 340 KB Ok
15 Correct 1 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 3 ms 596 KB Ok
25 Correct 5 ms 596 KB Ok
26 Correct 3 ms 596 KB Ok
27 Correct 4 ms 596 KB Ok
28 Correct 3 ms 468 KB Ok
29 Correct 2 ms 596 KB Ok
30 Correct 2 ms 468 KB Ok
31 Correct 3 ms 596 KB Ok
32 Correct 4 ms 596 KB Ok
33 Correct 3 ms 520 KB Ok
34 Correct 8 ms 980 KB Ok
35 Correct 9 ms 980 KB Ok
36 Correct 9 ms 980 KB Ok
37 Correct 9 ms 1016 KB Ok
38 Correct 8 ms 912 KB Ok
39 Correct 8 ms 980 KB Ok
40 Correct 10 ms 892 KB Ok
41 Correct 9 ms 900 KB Ok
42 Correct 8 ms 992 KB Ok
43 Correct 9 ms 948 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 0 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 1 ms 340 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 0 ms 340 KB Ok
11 Correct 0 ms 340 KB Ok
12 Correct 1 ms 340 KB Ok
13 Correct 0 ms 340 KB Ok
14 Correct 0 ms 340 KB Ok
15 Correct 1 ms 340 KB Ok
16 Correct 1 ms 340 KB Ok
17 Correct 0 ms 340 KB Ok
18 Correct 4 ms 656 KB Ok
19 Correct 20 ms 1908 KB Ok
20 Correct 11 ms 1080 KB Ok
21 Correct 27 ms 2220 KB Ok
22 Correct 13 ms 1392 KB Ok
23 Correct 0 ms 340 KB Ok
24 Correct 1 ms 340 KB Ok
25 Correct 1 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 3 ms 596 KB Ok
35 Correct 5 ms 596 KB Ok
36 Correct 3 ms 596 KB Ok
37 Correct 4 ms 596 KB Ok
38 Correct 3 ms 468 KB Ok
39 Correct 2 ms 596 KB Ok
40 Correct 2 ms 468 KB Ok
41 Correct 3 ms 596 KB Ok
42 Correct 4 ms 596 KB Ok
43 Correct 3 ms 520 KB Ok
44 Correct 8 ms 980 KB Ok
45 Correct 9 ms 980 KB Ok
46 Correct 9 ms 980 KB Ok
47 Correct 9 ms 1016 KB Ok
48 Correct 8 ms 912 KB Ok
49 Correct 8 ms 980 KB Ok
50 Correct 10 ms 892 KB Ok
51 Correct 9 ms 900 KB Ok
52 Correct 8 ms 992 KB Ok
53 Correct 9 ms 948 KB Ok
54 Correct 135 ms 8088 KB Ok
55 Correct 171 ms 8616 KB Ok
56 Correct 157 ms 8460 KB Ok
57 Correct 113 ms 7352 KB Ok
58 Correct 154 ms 8384 KB Ok
59 Correct 144 ms 7872 KB Ok
60 Correct 117 ms 7384 KB Ok
61 Correct 114 ms 7756 KB Ok
62 Correct 182 ms 8836 KB Ok
63 Correct 135 ms 7684 KB Ok
64 Correct 168 ms 8484 KB Ok
65 Correct 160 ms 8248 KB Ok
66 Correct 143 ms 7912 KB Ok
67 Correct 114 ms 7556 KB Ok
68 Correct 147 ms 8248 KB Ok
69 Correct 537 ms 18892 KB Ok
70 Correct 590 ms 19148 KB Ok
71 Correct 480 ms 18836 KB Ok
72 Correct 570 ms 18804 KB Ok
73 Correct 619 ms 19044 KB Ok
74 Correct 477 ms 18740 KB Ok
75 Correct 451 ms 18636 KB Ok
76 Correct 564 ms 18844 KB Ok
77 Correct 461 ms 18692 KB Ok
78 Correct 577 ms 18688 KB Ok
79 Correct 519 ms 19028 KB Ok
80 Correct 513 ms 18764 KB Ok
81 Correct 517 ms 19008 KB Ok
82 Correct 533 ms 18756 KB Ok
83 Correct 491 ms 18892 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 0 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 1 ms 340 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 0 ms 340 KB Ok
11 Correct 0 ms 340 KB Ok
12 Correct 1 ms 340 KB Ok
13 Correct 0 ms 340 KB Ok
14 Correct 0 ms 340 KB Ok
15 Correct 1 ms 340 KB Ok
16 Correct 1 ms 340 KB Ok
17 Correct 0 ms 340 KB Ok
18 Correct 4 ms 656 KB Ok
19 Correct 20 ms 1908 KB Ok
20 Correct 11 ms 1080 KB Ok
21 Correct 27 ms 2220 KB Ok
22 Correct 13 ms 1392 KB Ok
23 Correct 0 ms 340 KB Ok
24 Correct 1 ms 340 KB Ok
25 Correct 1 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 0 ms 340 KB Ok
38 Correct 0 ms 340 KB Ok
39 Correct 312 ms 23556 KB Ok
40 Correct 232 ms 26700 KB Ok
41 Correct 497 ms 28552 KB Ok
42 Correct 386 ms 26664 KB Ok
43 Correct 219 ms 16144 KB Ok
44 Correct 433 ms 29588 KB Ok
45 Correct 3 ms 596 KB Ok
46 Correct 5 ms 596 KB Ok
47 Correct 3 ms 596 KB Ok
48 Correct 4 ms 596 KB Ok
49 Correct 3 ms 468 KB Ok
50 Correct 2 ms 596 KB Ok
51 Correct 2 ms 468 KB Ok
52 Correct 3 ms 596 KB Ok
53 Correct 4 ms 596 KB Ok
54 Correct 3 ms 520 KB Ok
55 Correct 8 ms 980 KB Ok
56 Correct 9 ms 980 KB Ok
57 Correct 9 ms 980 KB Ok
58 Correct 9 ms 1016 KB Ok
59 Correct 8 ms 912 KB Ok
60 Correct 8 ms 980 KB Ok
61 Correct 10 ms 892 KB Ok
62 Correct 9 ms 900 KB Ok
63 Correct 8 ms 992 KB Ok
64 Correct 9 ms 948 KB Ok
65 Correct 135 ms 8088 KB Ok
66 Correct 171 ms 8616 KB Ok
67 Correct 157 ms 8460 KB Ok
68 Correct 113 ms 7352 KB Ok
69 Correct 154 ms 8384 KB Ok
70 Correct 144 ms 7872 KB Ok
71 Correct 117 ms 7384 KB Ok
72 Correct 114 ms 7756 KB Ok
73 Correct 182 ms 8836 KB Ok
74 Correct 135 ms 7684 KB Ok
75 Correct 168 ms 8484 KB Ok
76 Correct 160 ms 8248 KB Ok
77 Correct 143 ms 7912 KB Ok
78 Correct 114 ms 7556 KB Ok
79 Correct 147 ms 8248 KB Ok
80 Correct 537 ms 18892 KB Ok
81 Correct 590 ms 19148 KB Ok
82 Correct 480 ms 18836 KB Ok
83 Correct 570 ms 18804 KB Ok
84 Correct 619 ms 19044 KB Ok
85 Correct 477 ms 18740 KB Ok
86 Correct 451 ms 18636 KB Ok
87 Correct 564 ms 18844 KB Ok
88 Correct 461 ms 18692 KB Ok
89 Correct 577 ms 18688 KB Ok
90 Correct 519 ms 19028 KB Ok
91 Correct 513 ms 18764 KB Ok
92 Correct 517 ms 19008 KB Ok
93 Correct 533 ms 18756 KB Ok
94 Correct 491 ms 18892 KB Ok
95 Correct 360 ms 23232 KB Ok
96 Correct 649 ms 31024 KB Ok
97 Correct 612 ms 26096 KB Ok
98 Correct 379 ms 26616 KB Ok
99 Correct 470 ms 24452 KB Ok
100 Correct 571 ms 25812 KB Ok
101 Correct 555 ms 27804 KB Ok
102 Correct 539 ms 25864 KB Ok
103 Correct 594 ms 28492 KB Ok
104 Correct 619 ms 29724 KB Ok
105 Correct 607 ms 30644 KB Ok
106 Correct 432 ms 29368 KB Ok
107 Correct 557 ms 28700 KB Ok
108 Correct 687 ms 30612 KB Ok
109 Correct 543 ms 31228 KB Ok
110 Execution timed out 2075 ms 62548 KB Time limit exceeded
111 Halted 0 ms 0 KB -