oj.uz

Submission #686737

# Submission time Handle Problem Language Result Execution time Memory
686737 2023-01-25T21:22:49 Z quinque Nice sequence (IZhO18_sequence) C++17
76 / 100
 348 ms 31504 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] = 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 0 ms 212 KB Ok
2 Correct 0 ms 340 KB Ok
3 Correct 0 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 0 ms 340 KB Ok
6 Correct 0 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 1 ms 212 KB Ok

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 212 KB Ok
6 Correct 3 ms 596 KB Ok
7 Correct 14 ms 1796 KB Ok
8 Correct 6 ms 980 KB Ok
9 Correct 16 ms 2184 KB Ok
10 Correct 11 ms 1320 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 1 ms 212 KB Ok
5 Correct 0 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 212 KB Ok
10 Correct 0 ms 212 KB Ok
11 Correct 1 ms 212 KB Ok

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Ok
2 Correct 0 ms 212 KB Ok
3 Correct 1 ms 212 KB Ok
4 Correct 1 ms 212 KB Ok
5 Correct 0 ms 212 KB Ok
6 Correct 137 ms 24248 KB Ok
7 Correct 113 ms 26572 KB Ok
8 Correct 216 ms 31504 KB Ok
9 Correct 166 ms 27868 KB Ok
10 Correct 94 ms 16928 KB Ok
11 Correct 162 ms 30284 KB Ok

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 0 ms 340 KB Ok
3 Correct 0 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 0 ms 340 KB Ok
6 Correct 0 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 1 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 1 ms 212 KB Ok
17 Correct 0 ms 212 KB Ok
18 Correct 1 ms 212 KB Ok
19 Correct 0 ms 212 KB Ok
20 Correct 0 ms 212 KB Ok
21 Correct 0 ms 212 KB Ok
22 Correct 0 ms 212 KB Ok
23 Correct 1 ms 212 KB Ok
24 Correct 3 ms 596 KB Ok
25 Correct 3 ms 596 KB Ok
26 Correct 3 ms 596 KB Ok
27 Correct 3 ms 596 KB Ok
28 Correct 2 ms 468 KB Ok
29 Correct 2 ms 468 KB Ok
30 Correct 2 ms 468 KB Ok
31 Correct 3 ms 596 KB Ok
32 Correct 2 ms 596 KB Ok
33 Correct 2 ms 596 KB Ok
34 Correct 6 ms 892 KB Ok
35 Correct 8 ms 920 KB Ok
36 Correct 6 ms 980 KB Ok
37 Correct 6 ms 980 KB Ok
38 Correct 5 ms 980 KB Ok
39 Correct 5 ms 968 KB Ok
40 Correct 6 ms 920 KB Ok
41 Correct 6 ms 980 KB Ok
42 Correct 6 ms 980 KB Ok
43 Correct 6 ms 980 KB Ok

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 0 ms 340 KB Ok
3 Correct 0 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 0 ms 340 KB Ok
6 Correct 0 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 1 ms 212 KB Ok
13 Correct 1 ms 212 KB Ok
14 Correct 1 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 3 ms 596 KB Ok
19 Correct 14 ms 1796 KB Ok
20 Correct 6 ms 980 KB Ok
21 Correct 16 ms 2184 KB Ok
22 Correct 11 ms 1320 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 1 ms 212 KB Ok
27 Correct 0 ms 212 KB Ok
28 Correct 1 ms 212 KB Ok
29 Correct 0 ms 212 KB Ok
30 Correct 0 ms 212 KB Ok
31 Correct 0 ms 212 KB Ok
32 Correct 0 ms 212 KB Ok
33 Correct 1 ms 212 KB Ok
34 Correct 3 ms 596 KB Ok
35 Correct 3 ms 596 KB Ok
36 Correct 3 ms 596 KB Ok
37 Correct 3 ms 596 KB Ok
38 Correct 2 ms 468 KB Ok
39 Correct 2 ms 468 KB Ok
40 Correct 2 ms 468 KB Ok
41 Correct 3 ms 596 KB Ok
42 Correct 2 ms 596 KB Ok
43 Correct 2 ms 596 KB Ok
44 Correct 6 ms 892 KB Ok
45 Correct 8 ms 920 KB Ok
46 Correct 6 ms 980 KB Ok
47 Correct 6 ms 980 KB Ok
48 Correct 5 ms 980 KB Ok
49 Correct 5 ms 968 KB Ok
50 Correct 6 ms 920 KB Ok
51 Correct 6 ms 980 KB Ok
52 Correct 6 ms 980 KB Ok
53 Correct 6 ms 980 KB Ok
54 Correct 94 ms 10588 KB Ok
55 Correct 118 ms 11356 KB Ok
56 Correct 118 ms 11640 KB Ok
57 Correct 82 ms 9452 KB Ok
58 Correct 106 ms 10612 KB Ok
59 Correct 103 ms 10048 KB Ok
60 Correct 78 ms 9288 KB Ok
61 Correct 82 ms 10000 KB Ok
62 Correct 141 ms 11116 KB Ok
63 Correct 88 ms 9620 KB Ok
64 Correct 110 ms 11016 KB Ok
65 Correct 107 ms 10960 KB Ok
66 Correct 111 ms 9968 KB Ok
67 Correct 77 ms 9908 KB Ok
68 Correct 100 ms 10588 KB Ok
69 Correct 290 ms 19460 KB Ok
70 Correct 324 ms 19704 KB Ok
71 Correct 250 ms 19608 KB Ok
72 Correct 244 ms 19244 KB Ok
73 Correct 286 ms 19772 KB Ok
74 Correct 299 ms 19740 KB Ok
75 Correct 317 ms 19720 KB Ok
76 Correct 280 ms 19348 KB Ok
77 Correct 281 ms 19792 KB Ok
78 Correct 348 ms 19140 KB Ok
79 Correct 293 ms 19772 KB Ok
80 Correct 306 ms 20032 KB Ok
81 Correct 302 ms 19712 KB Ok
82 Correct 342 ms 19672 KB Ok
83 Correct 289 ms 19524 KB Ok

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 0 ms 340 KB Ok
3 Correct 0 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 0 ms 340 KB Ok
6 Correct 0 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 1 ms 212 KB Ok
13 Correct 1 ms 212 KB Ok
14 Correct 1 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 3 ms 596 KB Ok
19 Correct 14 ms 1796 KB Ok
20 Correct 6 ms 980 KB Ok
21 Correct 16 ms 2184 KB Ok
22 Correct 11 ms 1320 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 1 ms 212 KB Ok
27 Correct 0 ms 212 KB Ok
28 Correct 1 ms 212 KB Ok
29 Correct 0 ms 212 KB Ok
30 Correct 0 ms 212 KB Ok
31 Correct 0 ms 212 KB Ok
32 Correct 0 ms 212 KB Ok
33 Correct 1 ms 212 KB Ok
34 Correct 1 ms 212 KB Ok
35 Correct 0 ms 212 KB Ok
36 Correct 1 ms 212 KB Ok
37 Correct 1 ms 212 KB Ok
38 Correct 0 ms 212 KB Ok
39 Correct 137 ms 24248 KB Ok
40 Correct 113 ms 26572 KB Ok
41 Correct 216 ms 31504 KB Ok
42 Correct 166 ms 27868 KB Ok
43 Correct 94 ms 16928 KB Ok
44 Correct 162 ms 30284 KB Ok
45 Correct 3 ms 596 KB Ok
46 Correct 3 ms 596 KB Ok
47 Correct 3 ms 596 KB Ok
48 Correct 3 ms 596 KB Ok
49 Correct 2 ms 468 KB Ok
50 Correct 2 ms 468 KB Ok
51 Correct 2 ms 468 KB Ok
52 Correct 3 ms 596 KB Ok
53 Correct 2 ms 596 KB Ok
54 Correct 2 ms 596 KB Ok
55 Correct 6 ms 892 KB Ok
56 Correct 8 ms 920 KB Ok
57 Correct 6 ms 980 KB Ok
58 Correct 6 ms 980 KB Ok
59 Correct 5 ms 980 KB Ok
60 Correct 5 ms 968 KB Ok
61 Correct 6 ms 920 KB Ok
62 Correct 6 ms 980 KB Ok
63 Correct 6 ms 980 KB Ok
64 Correct 6 ms 980 KB Ok
65 Correct 94 ms 10588 KB Ok
66 Correct 118 ms 11356 KB Ok
67 Correct 118 ms 11640 KB Ok
68 Correct 82 ms 9452 KB Ok
69 Correct 106 ms 10612 KB Ok
70 Correct 103 ms 10048 KB Ok
71 Correct 78 ms 9288 KB Ok
72 Correct 82 ms 10000 KB Ok
73 Correct 141 ms 11116 KB Ok
74 Correct 88 ms 9620 KB Ok
75 Correct 110 ms 11016 KB Ok
76 Correct 107 ms 10960 KB Ok
77 Correct 111 ms 9968 KB Ok
78 Correct 77 ms 9908 KB Ok
79 Correct 100 ms 10588 KB Ok
80 Correct 290 ms 19460 KB Ok
81 Correct 324 ms 19704 KB Ok
82 Correct 250 ms 19608 KB Ok
83 Correct 244 ms 19244 KB Ok
84 Correct 286 ms 19772 KB Ok
85 Correct 299 ms 19740 KB Ok
86 Correct 317 ms 19720 KB Ok
87 Correct 280 ms 19348 KB Ok
88 Correct 281 ms 19792 KB Ok
89 Correct 348 ms 19140 KB Ok
90 Correct 293 ms 19772 KB Ok
91 Correct 306 ms 20032 KB Ok
92 Correct 302 ms 19712 KB Ok
93 Correct 342 ms 19672 KB Ok
94 Correct 289 ms 19524 KB Ok
95 Incorrect 278 ms 27852 KB Absolute value of 2100022270 bigger than 1000000
96 Halted 0 ms 0 KB -