oj.uz

Submission #686742

# Submission time Handle Problem Language Result Execution time Memory
686742 2023-01-25T21:32:49 Z quinque Nice sequence (IZhO18_sequence) C++17
76 / 100
 2000 ms 71936 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;
bitset<N> usd;
int pref[N];

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);
}
int nw = 0;

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

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);
    }
    usd = 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());
    usd = 0;
    nw = IINF;
    for (auto i: top){
        if (!usd[i]){
            pref[i] = nw;
            fill(i, g);
        }
    }
    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 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 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 1 ms 340 KB Ok
12 Correct 1 ms 340 KB Ok

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 340 KB Ok
6 Correct 3 ms 596 KB Ok
7 Correct 14 ms 1744 KB Ok
8 Correct 6 ms 980 KB Ok
9 Correct 16 ms 2016 KB Ok
10 Correct 9 ms 1308 KB Ok

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory 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 0 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 1 ms 340 KB Ok
10 Correct 1 ms 340 KB Ok
11 Correct 0 ms 340 KB Ok

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory 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 1 ms 340 KB Ok
6 Correct 136 ms 21228 KB Ok
7 Correct 108 ms 23316 KB Ok
8 Correct 222 ms 27428 KB Ok
9 Correct 160 ms 24452 KB Ok
10 Correct 104 ms 14984 KB Ok
11 Correct 178 ms 26316 KB Ok

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory 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 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 1 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 0 ms 340 KB Ok
16 Correct 0 ms 340 KB Ok
17 Correct 0 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 1 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 4 ms 596 KB Ok
26 Correct 4 ms 596 KB Ok
27 Correct 2 ms 596 KB Ok
28 Correct 2 ms 596 KB Ok
29 Correct 2 ms 596 KB Ok
30 Correct 2 ms 596 KB Ok
31 Correct 3 ms 596 KB Ok
32 Correct 3 ms 596 KB Ok
33 Correct 3 ms 596 KB Ok
34 Correct 8 ms 924 KB Ok
35 Correct 6 ms 980 KB Ok
36 Correct 6 ms 980 KB Ok
37 Correct 5 ms 980 KB Ok
38 Correct 6 ms 980 KB Ok
39 Correct 6 ms 980 KB Ok
40 Correct 6 ms 980 KB Ok
41 Correct 6 ms 980 KB Ok
42 Correct 6 ms 932 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 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 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 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 0 ms 340 KB Ok
16 Correct 0 ms 340 KB Ok
17 Correct 0 ms 340 KB Ok
18 Correct 3 ms 596 KB Ok
19 Correct 14 ms 1744 KB Ok
20 Correct 6 ms 980 KB Ok
21 Correct 16 ms 2016 KB Ok
22 Correct 9 ms 1308 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 0 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 1 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 4 ms 596 KB Ok
36 Correct 4 ms 596 KB Ok
37 Correct 2 ms 596 KB Ok
38 Correct 2 ms 596 KB Ok
39 Correct 2 ms 596 KB Ok
40 Correct 2 ms 596 KB Ok
41 Correct 3 ms 596 KB Ok
42 Correct 3 ms 596 KB Ok
43 Correct 3 ms 596 KB Ok
44 Correct 8 ms 924 KB Ok
45 Correct 6 ms 980 KB Ok
46 Correct 6 ms 980 KB Ok
47 Correct 5 ms 980 KB Ok
48 Correct 6 ms 980 KB Ok
49 Correct 6 ms 980 KB Ok
50 Correct 6 ms 980 KB Ok
51 Correct 6 ms 980 KB Ok
52 Correct 6 ms 932 KB Ok
53 Correct 6 ms 980 KB Ok
54 Correct 93 ms 8280 KB Ok
55 Correct 113 ms 8564 KB Ok
56 Correct 102 ms 8596 KB Ok
57 Correct 71 ms 7436 KB Ok
58 Correct 99 ms 8188 KB Ok
59 Correct 97 ms 7872 KB Ok
60 Correct 86 ms 7360 KB Ok
61 Correct 78 ms 7876 KB Ok
62 Correct 123 ms 8676 KB Ok
63 Correct 82 ms 7688 KB Ok
64 Correct 104 ms 8808 KB Ok
65 Correct 110 ms 8384 KB Ok
66 Correct 85 ms 7652 KB Ok
67 Correct 73 ms 7772 KB Ok
68 Correct 88 ms 8488 KB Ok
69 Correct 226 ms 17540 KB Ok
70 Correct 294 ms 17956 KB Ok
71 Correct 234 ms 17912 KB Ok
72 Correct 245 ms 17308 KB Ok
73 Correct 333 ms 17696 KB Ok
74 Correct 254 ms 17828 KB Ok
75 Correct 298 ms 17436 KB Ok
76 Correct 252 ms 17680 KB Ok
77 Correct 248 ms 17688 KB Ok
78 Correct 269 ms 17592 KB Ok
79 Correct 250 ms 17800 KB Ok
80 Correct 239 ms 17708 KB Ok
81 Correct 262 ms 17800 KB Ok
82 Correct 250 ms 17696 KB Ok
83 Correct 302 ms 17856 KB Ok

Subtask #7
0 / 24.0

# Verdict Execution time Memory 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 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 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 0 ms 340 KB Ok
16 Correct 0 ms 340 KB Ok
17 Correct 0 ms 340 KB Ok
18 Correct 3 ms 596 KB Ok
19 Correct 14 ms 1744 KB Ok
20 Correct 6 ms 980 KB Ok
21 Correct 16 ms 2016 KB Ok
22 Correct 9 ms 1308 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 0 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 1 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 1 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 136 ms 21228 KB Ok
40 Correct 108 ms 23316 KB Ok
41 Correct 222 ms 27428 KB Ok
42 Correct 160 ms 24452 KB Ok
43 Correct 104 ms 14984 KB Ok
44 Correct 178 ms 26316 KB Ok
45 Correct 3 ms 596 KB Ok
46 Correct 4 ms 596 KB Ok
47 Correct 4 ms 596 KB Ok
48 Correct 2 ms 596 KB Ok
49 Correct 2 ms 596 KB Ok
50 Correct 2 ms 596 KB Ok
51 Correct 2 ms 596 KB Ok
52 Correct 3 ms 596 KB Ok
53 Correct 3 ms 596 KB Ok
54 Correct 3 ms 596 KB Ok
55 Correct 8 ms 924 KB Ok
56 Correct 6 ms 980 KB Ok
57 Correct 6 ms 980 KB Ok
58 Correct 5 ms 980 KB Ok
59 Correct 6 ms 980 KB Ok
60 Correct 6 ms 980 KB Ok
61 Correct 6 ms 980 KB Ok
62 Correct 6 ms 980 KB Ok
63 Correct 6 ms 932 KB Ok
64 Correct 6 ms 980 KB Ok
65 Correct 93 ms 8280 KB Ok
66 Correct 113 ms 8564 KB Ok
67 Correct 102 ms 8596 KB Ok
68 Correct 71 ms 7436 KB Ok
69 Correct 99 ms 8188 KB Ok
70 Correct 97 ms 7872 KB Ok
71 Correct 86 ms 7360 KB Ok
72 Correct 78 ms 7876 KB Ok
73 Correct 123 ms 8676 KB Ok
74 Correct 82 ms 7688 KB Ok
75 Correct 104 ms 8808 KB Ok
76 Correct 110 ms 8384 KB Ok
77 Correct 85 ms 7652 KB Ok
78 Correct 73 ms 7772 KB Ok
79 Correct 88 ms 8488 KB Ok
80 Correct 226 ms 17540 KB Ok
81 Correct 294 ms 17956 KB Ok
82 Correct 234 ms 17912 KB Ok
83 Correct 245 ms 17308 KB Ok
84 Correct 333 ms 17696 KB Ok
85 Correct 254 ms 17828 KB Ok
86 Correct 298 ms 17436 KB Ok
87 Correct 252 ms 17680 KB Ok
88 Correct 248 ms 17688 KB Ok
89 Correct 269 ms 17592 KB Ok
90 Correct 250 ms 17800 KB Ok
91 Correct 239 ms 17708 KB Ok
92 Correct 262 ms 17800 KB Ok
93 Correct 250 ms 17696 KB Ok
94 Correct 302 ms 17856 KB Ok
95 Correct 247 ms 19840 KB Ok
96 Correct 343 ms 29496 KB Ok
97 Correct 325 ms 24416 KB Ok
98 Correct 237 ms 21384 KB Ok
99 Correct 282 ms 22368 KB Ok
100 Correct 318 ms 24000 KB Ok
101 Correct 287 ms 25732 KB Ok
102 Correct 317 ms 25812 KB Ok
103 Correct 333 ms 26820 KB Ok
104 Correct 354 ms 29304 KB Ok
105 Correct 366 ms 36504 KB Ok
106 Correct 311 ms 27068 KB Ok
107 Correct 301 ms 29560 KB Ok
108 Correct 375 ms 30136 KB Ok
109 Correct 349 ms 28744 KB Ok
110 Correct 1853 ms 70832 KB Ok
111 Execution timed out 2070 ms 71936 KB Time limit exceeded
112 Halted 0 ms 0 KB -