oj.uz

Submission #686736

# Submission time Handle Problem Language Result Execution time Memory
686736 2023-01-25T21:20:50 Z quinque Nice sequence (IZhO18_sequence) C++17
76 / 100
 400 ms 31424 KB 
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC target("sse4,avx2,fma,avx")
#include <stdlib.h>
#include <time.h>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <climits>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define unit unsigned int
#define ld double
#define F first
#define S second
// chrono::system_clock::now().time_since_epoch().count());

using namespace std;
const int N = 4e5 + 100, IINF = 1e9 + 10, LOG = 19, K = 1 << 10;
const ll INF = 1e18 + 214;
int usd[N];

bool cycle(int v, int &n, int &m, int &sz){
    if (usd[v] == sz)
        return false;
    usd[v] = sz;
    bool fl = true;
    if (v + m <= sz)
        fl &= cycle(v + m, n, m, sz);
    if (v - n >= 0)
        fl &= cycle(v - n, n, m, sz);
    return fl;
}

bool can(int n, int m, int sz){
    return cycle(0, n, m, sz);
}
vector<int> top;
void dfs(int v, vector<vector<int>> &g){
    if (usd[v])
        return;
    usd[v] = 1;
    for (auto i : g[v])
        dfs(i, g);
    top.push_back(v);
}

int gcd(int a, int b){
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

void fill(int v, vector<vector<int>> &g, vector<int> &pref){
    if (usd[v])
        return;
    usd[v] = 1;
    for (auto i : g[v]){
        pref[i] = min(pref[i], pref[v] - 1);
        fill(i, g, pref);
    }
}

inline void solve(){
    int n, m;
    cin >> n >> m;
    int start = -1;
    if (n > m)
        swap(n, m), start *= -1;
    int l = n + m - 1 - gcd(n, m);
    cout << l << '\n';
    vector<vector<int>> g(l + 1);
    for (int i = 0; i <= l; i ++){
        if (i + m <= l)
            g[i].push_back(i + m);
        if (i - n >= 0)
            g[i].push_back(i - n);
    }
    for (int i = 0; i <= l; i ++)
        usd[i] = 0;
    top.clear();
    for (int i = 0; i <= l; i ++){
        if (usd[i])
            continue;
        dfs(i, g);
    }
    //cout << "why" << '\n';
    reverse(top.begin(), top.end());
    for (int i = 0; i <= l; i ++)
        usd[i] = 0;
    vector<int> pref(l + 1, IINF);
    int nw = l + 1;
    for (auto i: top){
        if (!usd[i]){
            pref[i] = nw;
            nw += l + 1;
            fill(i, g, pref);
        }
    }
    for (int i = 1; i <= l; i ++)
        cout << (pref[i] - pref[i - 1]) * start << ' ';
    cout << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T;
    cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Ok
2 Correct 1 ms 212 KB Ok
3 Correct 1 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 1 ms 212 KB Ok
7 Correct 0 ms 212 KB Ok
8 Correct 0 ms 212 KB Ok
9 Correct 0 ms 340 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 1 ms 212 KB Ok
12 Correct 0 ms 212 KB Ok

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 0 ms 212 KB Ok
3 Correct 1 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 3 ms 596 KB Ok
7 Correct 15 ms 1900 KB Ok
8 Correct 6 ms 980 KB Ok
9 Correct 15 ms 2152 KB Ok
10 Correct 9 ms 1356 KB Ok

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 0 ms 212 KB Ok
3 Correct 0 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 0 ms 212 KB Ok
6 Correct 0 ms 212 KB Ok
7 Correct 0 ms 212 KB Ok
8 Correct 1 ms 212 KB Ok
9 Correct 1 ms 212 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 0 ms 212 KB Ok

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 1 ms 212 KB Ok
3 Correct 0 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 131 ms 24164 KB Ok
7 Correct 124 ms 26608 KB Ok
8 Correct 219 ms 31424 KB Ok
9 Correct 173 ms 27932 KB Ok
10 Correct 99 ms 16924 KB Ok
11 Correct 173 ms 30352 KB Ok

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Ok
2 Correct 1 ms 212 KB Ok
3 Correct 1 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 1 ms 212 KB Ok
7 Correct 0 ms 212 KB Ok
8 Correct 0 ms 212 KB Ok
9 Correct 0 ms 340 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 1 ms 212 KB Ok
12 Correct 0 ms 212 KB Ok
13 Correct 0 ms 212 KB Ok
14 Correct 0 ms 212 KB Ok
15 Correct 0 ms 212 KB Ok
16 Correct 0 ms 212 KB Ok
17 Correct 0 ms 212 KB Ok
18 Correct 0 ms 212 KB Ok
19 Correct 0 ms 212 KB Ok
20 Correct 1 ms 212 KB Ok
21 Correct 1 ms 212 KB Ok
22 Correct 1 ms 212 KB Ok
23 Correct 0 ms 212 KB Ok
24 Correct 3 ms 596 KB Ok
25 Correct 3 ms 596 KB Ok
26 Correct 2 ms 596 KB Ok
27 Correct 2 ms 640 KB Ok
28 Correct 2 ms 468 KB Ok
29 Correct 2 ms 468 KB Ok
30 Correct 2 ms 472 KB Ok
31 Correct 3 ms 600 KB Ok
32 Correct 3 ms 600 KB Ok
33 Correct 2 ms 596 KB Ok
34 Correct 6 ms 908 KB Ok
35 Correct 8 ms 980 KB Ok
36 Correct 6 ms 988 KB Ok
37 Correct 6 ms 952 KB Ok
38 Correct 6 ms 980 KB Ok
39 Correct 6 ms 980 KB Ok
40 Correct 6 ms 944 KB Ok
41 Correct 7 ms 980 KB Ok
42 Correct 8 ms 1008 KB Ok
43 Correct 6 ms 980 KB Ok

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Ok
2 Correct 1 ms 212 KB Ok
3 Correct 1 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 1 ms 212 KB Ok
7 Correct 0 ms 212 KB Ok
8 Correct 0 ms 212 KB Ok
9 Correct 0 ms 340 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 1 ms 212 KB Ok
12 Correct 0 ms 212 KB Ok
13 Correct 0 ms 212 KB Ok
14 Correct 0 ms 212 KB Ok
15 Correct 1 ms 212 KB Ok
16 Correct 0 ms 212 KB Ok
17 Correct 1 ms 212 KB Ok
18 Correct 3 ms 596 KB Ok
19 Correct 15 ms 1900 KB Ok
20 Correct 6 ms 980 KB Ok
21 Correct 15 ms 2152 KB Ok
22 Correct 9 ms 1356 KB Ok
23 Correct 0 ms 212 KB Ok
24 Correct 0 ms 212 KB Ok
25 Correct 0 ms 212 KB Ok
26 Correct 0 ms 212 KB Ok
27 Correct 0 ms 212 KB Ok
28 Correct 0 ms 212 KB Ok
29 Correct 0 ms 212 KB Ok
30 Correct 1 ms 212 KB Ok
31 Correct 1 ms 212 KB Ok
32 Correct 1 ms 212 KB Ok
33 Correct 0 ms 212 KB Ok
34 Correct 3 ms 596 KB Ok
35 Correct 3 ms 596 KB Ok
36 Correct 2 ms 596 KB Ok
37 Correct 2 ms 640 KB Ok
38 Correct 2 ms 468 KB Ok
39 Correct 2 ms 468 KB Ok
40 Correct 2 ms 472 KB Ok
41 Correct 3 ms 600 KB Ok
42 Correct 3 ms 600 KB Ok
43 Correct 2 ms 596 KB Ok
44 Correct 6 ms 908 KB Ok
45 Correct 8 ms 980 KB Ok
46 Correct 6 ms 988 KB Ok
47 Correct 6 ms 952 KB Ok
48 Correct 6 ms 980 KB Ok
49 Correct 6 ms 980 KB Ok
50 Correct 6 ms 944 KB Ok
51 Correct 7 ms 980 KB Ok
52 Correct 8 ms 1008 KB Ok
53 Correct 6 ms 980 KB Ok
54 Correct 97 ms 10640 KB Ok
55 Correct 121 ms 11392 KB Ok
56 Correct 125 ms 11776 KB Ok
57 Correct 85 ms 9432 KB Ok
58 Correct 103 ms 10604 KB Ok
59 Correct 94 ms 9968 KB Ok
60 Correct 84 ms 9212 KB Ok
61 Correct 94 ms 10008 KB Ok
62 Correct 132 ms 11072 KB Ok
63 Correct 90 ms 9560 KB Ok
64 Correct 144 ms 10928 KB Ok
65 Correct 111 ms 10940 KB Ok
66 Correct 94 ms 9976 KB Ok
67 Correct 77 ms 9892 KB Ok
68 Correct 108 ms 10612 KB Ok
69 Correct 272 ms 19408 KB Ok
70 Correct 400 ms 19684 KB Ok
71 Correct 266 ms 19900 KB Ok
72 Correct 253 ms 19236 KB Ok
73 Correct 267 ms 19816 KB Ok
74 Correct 325 ms 19760 KB Ok
75 Correct 337 ms 19792 KB Ok
76 Correct 271 ms 19352 KB Ok
77 Correct 293 ms 19720 KB Ok
78 Correct 303 ms 19204 KB Ok
79 Correct 293 ms 19768 KB Ok
80 Correct 289 ms 19892 KB Ok
81 Correct 301 ms 19752 KB Ok
82 Correct 331 ms 19648 KB Ok
83 Correct 282 ms 19548 KB Ok

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Ok
2 Correct 1 ms 212 KB Ok
3 Correct 1 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 1 ms 212 KB Ok
7 Correct 0 ms 212 KB Ok
8 Correct 0 ms 212 KB Ok
9 Correct 0 ms 340 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 1 ms 212 KB Ok
12 Correct 0 ms 212 KB Ok
13 Correct 0 ms 212 KB Ok
14 Correct 0 ms 212 KB Ok
15 Correct 1 ms 212 KB Ok
16 Correct 0 ms 212 KB Ok
17 Correct 1 ms 212 KB Ok
18 Correct 3 ms 596 KB Ok
19 Correct 15 ms 1900 KB Ok
20 Correct 6 ms 980 KB Ok
21 Correct 15 ms 2152 KB Ok
22 Correct 9 ms 1356 KB Ok
23 Correct 0 ms 212 KB Ok
24 Correct 0 ms 212 KB Ok
25 Correct 0 ms 212 KB Ok
26 Correct 0 ms 212 KB Ok
27 Correct 0 ms 212 KB Ok
28 Correct 0 ms 212 KB Ok
29 Correct 0 ms 212 KB Ok
30 Correct 1 ms 212 KB Ok
31 Correct 1 ms 212 KB Ok
32 Correct 1 ms 212 KB Ok
33 Correct 0 ms 212 KB Ok
34 Correct 0 ms 212 KB Ok
35 Correct 1 ms 212 KB Ok
36 Correct 0 ms 212 KB Ok
37 Correct 0 ms 212 KB Ok
38 Correct 1 ms 212 KB Ok
39 Correct 131 ms 24164 KB Ok
40 Correct 124 ms 26608 KB Ok
41 Correct 219 ms 31424 KB Ok
42 Correct 173 ms 27932 KB Ok
43 Correct 99 ms 16924 KB Ok
44 Correct 173 ms 30352 KB Ok
45 Correct 3 ms 596 KB Ok
46 Correct 3 ms 596 KB Ok
47 Correct 2 ms 596 KB Ok
48 Correct 2 ms 640 KB Ok
49 Correct 2 ms 468 KB Ok
50 Correct 2 ms 468 KB Ok
51 Correct 2 ms 472 KB Ok
52 Correct 3 ms 600 KB Ok
53 Correct 3 ms 600 KB Ok
54 Correct 2 ms 596 KB Ok
55 Correct 6 ms 908 KB Ok
56 Correct 8 ms 980 KB Ok
57 Correct 6 ms 988 KB Ok
58 Correct 6 ms 952 KB Ok
59 Correct 6 ms 980 KB Ok
60 Correct 6 ms 980 KB Ok
61 Correct 6 ms 944 KB Ok
62 Correct 7 ms 980 KB Ok
63 Correct 8 ms 1008 KB Ok
64 Correct 6 ms 980 KB Ok
65 Correct 97 ms 10640 KB Ok
66 Correct 121 ms 11392 KB Ok
67 Correct 125 ms 11776 KB Ok
68 Correct 85 ms 9432 KB Ok
69 Correct 103 ms 10604 KB Ok
70 Correct 94 ms 9968 KB Ok
71 Correct 84 ms 9212 KB Ok
72 Correct 94 ms 10008 KB Ok
73 Correct 132 ms 11072 KB Ok
74 Correct 90 ms 9560 KB Ok
75 Correct 144 ms 10928 KB Ok
76 Correct 111 ms 10940 KB Ok
77 Correct 94 ms 9976 KB Ok
78 Correct 77 ms 9892 KB Ok
79 Correct 108 ms 10612 KB Ok
80 Correct 272 ms 19408 KB Ok
81 Correct 400 ms 19684 KB Ok
82 Correct 266 ms 19900 KB Ok
83 Correct 253 ms 19236 KB Ok
84 Correct 267 ms 19816 KB Ok
85 Correct 325 ms 19760 KB Ok
86 Correct 337 ms 19792 KB Ok
87 Correct 271 ms 19352 KB Ok
88 Correct 293 ms 19720 KB Ok
89 Correct 303 ms 19204 KB Ok
90 Correct 293 ms 19768 KB Ok
91 Correct 289 ms 19892 KB Ok
92 Correct 301 ms 19752 KB Ok
93 Correct 331 ms 19648 KB Ok
94 Correct 282 ms 19548 KB Ok
95 Incorrect 266 ms 26284 KB All the numbers must be nonzero
96 Halted 0 ms 0 KB -