oj.uz

Submission #686738

# Submission time Handle Problem Language Result Execution time Memory
686738 2023-01-25T21:25:32 Z quinque Nice sequence (IZhO18_sequence) C++17
76 / 100
 2000 ms 78464 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);
}
int nw = 0;

void fill(int v, vector<vector<int>> &g, vector<int> &pref){
    if (usd[v])
        return;
    usd[v] = 1;
    nw --;
    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);
    nw = IINF;
    for (auto i: top){
        if (!usd[i]){
            pref[i] = nw;
            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 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 1 ms 212 KB Ok
7 Correct 0 ms 212 KB Ok
8 Correct 1 ms 212 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 0 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 1 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 1 ms 212 KB Ok
6 Correct 3 ms 596 KB Ok
7 Correct 12 ms 1804 KB Ok
8 Correct 6 ms 1016 KB Ok
9 Correct 14 ms 2152 KB Ok
10 Correct 11 ms 1356 KB Ok

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 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 1 ms 212 KB Ok
4 Correct 1 ms 212 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 133 ms 24084 KB Ok
7 Correct 119 ms 26636 KB Ok
8 Correct 217 ms 31004 KB Ok
9 Correct 162 ms 27640 KB Ok
10 Correct 94 ms 16764 KB Ok
11 Correct 173 ms 30036 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 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 1 ms 212 KB Ok
7 Correct 0 ms 212 KB Ok
8 Correct 1 ms 212 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 0 ms 212 KB Ok
12 Correct 0 ms 212 KB Ok
13 Correct 1 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 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 0 ms 212 KB Ok
24 Correct 2 ms 468 KB Ok
25 Correct 3 ms 576 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 468 KB Ok
32 Correct 3 ms 468 KB Ok
33 Correct 3 ms 468 KB Ok
34 Correct 6 ms 852 KB Ok
35 Correct 6 ms 980 KB Ok
36 Correct 6 ms 980 KB Ok
37 Correct 5 ms 1000 KB Ok
38 Correct 5 ms 980 KB Ok
39 Correct 6 ms 980 KB Ok
40 Correct 6 ms 980 KB Ok
41 Correct 5 ms 960 KB Ok
42 Correct 5 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 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 1 ms 212 KB Ok
7 Correct 0 ms 212 KB Ok
8 Correct 1 ms 212 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 0 ms 212 KB Ok
12 Correct 0 ms 212 KB Ok
13 Correct 1 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 1 ms 212 KB Ok
18 Correct 3 ms 596 KB Ok
19 Correct 12 ms 1804 KB Ok
20 Correct 6 ms 1016 KB Ok
21 Correct 14 ms 2152 KB Ok
22 Correct 11 ms 1356 KB Ok
23 Correct 1 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 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 0 ms 212 KB Ok
34 Correct 2 ms 468 KB Ok
35 Correct 3 ms 576 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 468 KB Ok
42 Correct 3 ms 468 KB Ok
43 Correct 3 ms 468 KB Ok
44 Correct 6 ms 852 KB Ok
45 Correct 6 ms 980 KB Ok
46 Correct 6 ms 980 KB Ok
47 Correct 5 ms 1000 KB Ok
48 Correct 5 ms 980 KB Ok
49 Correct 6 ms 980 KB Ok
50 Correct 6 ms 980 KB Ok
51 Correct 5 ms 960 KB Ok
52 Correct 5 ms 980 KB Ok
53 Correct 6 ms 980 KB Ok
54 Correct 88 ms 8620 KB Ok
55 Correct 114 ms 8844 KB Ok
56 Correct 104 ms 8864 KB Ok
57 Correct 71 ms 7752 KB Ok
58 Correct 95 ms 8524 KB Ok
59 Correct 94 ms 8168 KB Ok
60 Correct 78 ms 7572 KB Ok
61 Correct 81 ms 8140 KB Ok
62 Correct 110 ms 9052 KB Ok
63 Correct 89 ms 7972 KB Ok
64 Correct 110 ms 9132 KB Ok
65 Correct 99 ms 8744 KB Ok
66 Correct 85 ms 7940 KB Ok
67 Correct 74 ms 8052 KB Ok
68 Correct 88 ms 8696 KB Ok
69 Correct 269 ms 19352 KB Ok
70 Correct 308 ms 19732 KB Ok
71 Correct 271 ms 19772 KB Ok
72 Correct 256 ms 19200 KB Ok
73 Correct 281 ms 19660 KB Ok
74 Correct 294 ms 19684 KB Ok
75 Correct 258 ms 19268 KB Ok
76 Correct 264 ms 19388 KB Ok
77 Correct 277 ms 19532 KB Ok
78 Correct 276 ms 19144 KB Ok
79 Correct 304 ms 19732 KB Ok
80 Correct 266 ms 19600 KB Ok
81 Correct 268 ms 19624 KB Ok
82 Correct 287 ms 19612 KB Ok
83 Correct 262 ms 19760 KB Ok

Subtask #7
0 / 24.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 1 ms 212 KB Ok
6 Correct 1 ms 212 KB Ok
7 Correct 0 ms 212 KB Ok
8 Correct 1 ms 212 KB Ok
9 Correct 1 ms 340 KB Ok
10 Correct 1 ms 212 KB Ok
11 Correct 0 ms 212 KB Ok
12 Correct 0 ms 212 KB Ok
13 Correct 1 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 1 ms 212 KB Ok
18 Correct 3 ms 596 KB Ok
19 Correct 12 ms 1804 KB Ok
20 Correct 6 ms 1016 KB Ok
21 Correct 14 ms 2152 KB Ok
22 Correct 11 ms 1356 KB Ok
23 Correct 1 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 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 0 ms 212 KB Ok
34 Correct 0 ms 212 KB Ok
35 Correct 1 ms 212 KB Ok
36 Correct 1 ms 212 KB Ok
37 Correct 1 ms 212 KB Ok
38 Correct 1 ms 212 KB Ok
39 Correct 133 ms 24084 KB Ok
40 Correct 119 ms 26636 KB Ok
41 Correct 217 ms 31004 KB Ok
42 Correct 162 ms 27640 KB Ok
43 Correct 94 ms 16764 KB Ok
44 Correct 173 ms 30036 KB Ok
45 Correct 2 ms 468 KB Ok
46 Correct 3 ms 576 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 468 KB Ok
53 Correct 3 ms 468 KB Ok
54 Correct 3 ms 468 KB Ok
55 Correct 6 ms 852 KB Ok
56 Correct 6 ms 980 KB Ok
57 Correct 6 ms 980 KB Ok
58 Correct 5 ms 1000 KB Ok
59 Correct 5 ms 980 KB Ok
60 Correct 6 ms 980 KB Ok
61 Correct 6 ms 980 KB Ok
62 Correct 5 ms 960 KB Ok
63 Correct 5 ms 980 KB Ok
64 Correct 6 ms 980 KB Ok
65 Correct 88 ms 8620 KB Ok
66 Correct 114 ms 8844 KB Ok
67 Correct 104 ms 8864 KB Ok
68 Correct 71 ms 7752 KB Ok
69 Correct 95 ms 8524 KB Ok
70 Correct 94 ms 8168 KB Ok
71 Correct 78 ms 7572 KB Ok
72 Correct 81 ms 8140 KB Ok
73 Correct 110 ms 9052 KB Ok
74 Correct 89 ms 7972 KB Ok
75 Correct 110 ms 9132 KB Ok
76 Correct 99 ms 8744 KB Ok
77 Correct 85 ms 7940 KB Ok
78 Correct 74 ms 8052 KB Ok
79 Correct 88 ms 8696 KB Ok
80 Correct 269 ms 19352 KB Ok
81 Correct 308 ms 19732 KB Ok
82 Correct 271 ms 19772 KB Ok
83 Correct 256 ms 19200 KB Ok
84 Correct 281 ms 19660 KB Ok
85 Correct 294 ms 19684 KB Ok
86 Correct 258 ms 19268 KB Ok
87 Correct 264 ms 19388 KB Ok
88 Correct 277 ms 19532 KB Ok
89 Correct 276 ms 19144 KB Ok
90 Correct 304 ms 19732 KB Ok
91 Correct 266 ms 19600 KB Ok
92 Correct 268 ms 19624 KB Ok
93 Correct 287 ms 19612 KB Ok
94 Correct 262 ms 19760 KB Ok
95 Correct 250 ms 20520 KB Ok
96 Correct 347 ms 30780 KB Ok
97 Correct 331 ms 25340 KB Ok
98 Correct 239 ms 22552 KB Ok
99 Correct 288 ms 23200 KB Ok
100 Correct 318 ms 24900 KB Ok
101 Correct 294 ms 26596 KB Ok
102 Correct 296 ms 26880 KB Ok
103 Correct 327 ms 28096 KB Ok
104 Correct 356 ms 30472 KB Ok
105 Correct 341 ms 31368 KB Ok
106 Correct 311 ms 28584 KB Ok
107 Correct 302 ms 30880 KB Ok
108 Correct 399 ms 31424 KB Ok
109 Correct 342 ms 29968 KB Ok
110 Correct 1935 ms 78464 KB Ok
111 Execution timed out 2068 ms 76844 KB Time limit exceeded
112 Halted 0 ms 0 KB -