oj.uz

Submission #686740

# Submission time Handle Problem Language Result Execution time Memory
686740 2023-01-25T21:29:02 Z quinque Nice sequence (IZhO18_sequence) C++17
76 / 100
 2000 ms 78528 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;
bool usd[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, 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 340 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 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 1 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 1 ms 212 KB Ok
6 Correct 3 ms 596 KB Ok
7 Correct 12 ms 1836 KB Ok
8 Correct 7 ms 980 KB Ok
9 Correct 14 ms 2148 KB Ok
10 Correct 12 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 1 ms 212 KB Ok
6 Correct 0 ms 212 KB Ok
7 Correct 1 ms 212 KB Ok
8 Correct 0 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 0 ms 212 KB Ok
3 Correct 1 ms 384 KB Ok
4 Correct 1 ms 212 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 140 ms 23368 KB Ok
7 Correct 114 ms 25960 KB Ok
8 Correct 258 ms 30404 KB Ok
9 Correct 173 ms 27176 KB Ok
10 Correct 93 ms 16452 KB Ok
11 Correct 158 ms 29480 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 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
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 1 ms 212 KB Ok
18 Correct 0 ms 212 KB Ok
19 Correct 1 ms 212 KB Ok
20 Correct 0 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 468 KB Ok
25 Correct 3 ms 468 KB Ok
26 Correct 3 ms 596 KB Ok
27 Correct 2 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 2 ms 468 KB Ok
32 Correct 3 ms 468 KB Ok
33 Correct 2 ms 468 KB Ok
34 Correct 5 ms 852 KB Ok
35 Correct 5 ms 980 KB Ok
36 Correct 6 ms 980 KB Ok
37 Correct 8 ms 980 KB Ok
38 Correct 6 ms 852 KB Ok
39 Correct 5 ms 980 KB Ok
40 Correct 5 ms 852 KB Ok
41 Correct 5 ms 972 KB Ok
42 Correct 5 ms 984 KB Ok
43 Correct 6 ms 892 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 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
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 1 ms 212 KB Ok
17 Correct 1 ms 212 KB Ok
18 Correct 3 ms 596 KB Ok
19 Correct 12 ms 1836 KB Ok
20 Correct 7 ms 980 KB Ok
21 Correct 14 ms 2148 KB Ok
22 Correct 12 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 1 ms 212 KB Ok
28 Correct 0 ms 212 KB Ok
29 Correct 1 ms 212 KB Ok
30 Correct 0 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 468 KB Ok
35 Correct 3 ms 468 KB Ok
36 Correct 3 ms 596 KB Ok
37 Correct 2 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 2 ms 468 KB Ok
42 Correct 3 ms 468 KB Ok
43 Correct 2 ms 468 KB Ok
44 Correct 5 ms 852 KB Ok
45 Correct 5 ms 980 KB Ok
46 Correct 6 ms 980 KB Ok
47 Correct 8 ms 980 KB Ok
48 Correct 6 ms 852 KB Ok
49 Correct 5 ms 980 KB Ok
50 Correct 5 ms 852 KB Ok
51 Correct 5 ms 972 KB Ok
52 Correct 5 ms 984 KB Ok
53 Correct 6 ms 892 KB Ok
54 Correct 87 ms 8272 KB Ok
55 Correct 127 ms 8588 KB Ok
56 Correct 105 ms 8552 KB Ok
57 Correct 70 ms 7468 KB Ok
58 Correct 99 ms 8180 KB Ok
59 Correct 85 ms 7864 KB Ok
60 Correct 71 ms 7312 KB Ok
61 Correct 82 ms 7880 KB Ok
62 Correct 110 ms 8720 KB Ok
63 Correct 93 ms 7696 KB Ok
64 Correct 114 ms 8804 KB Ok
65 Correct 94 ms 8464 KB Ok
66 Correct 93 ms 7676 KB Ok
67 Correct 74 ms 7696 KB Ok
68 Correct 92 ms 8616 KB Ok
69 Correct 272 ms 19088 KB Ok
70 Correct 294 ms 19584 KB Ok
71 Correct 271 ms 19476 KB Ok
72 Correct 272 ms 18868 KB Ok
73 Correct 293 ms 19352 KB Ok
74 Correct 330 ms 19260 KB Ok
75 Correct 282 ms 18996 KB Ok
76 Correct 285 ms 19096 KB Ok
77 Correct 243 ms 19236 KB Ok
78 Correct 321 ms 18852 KB Ok
79 Correct 319 ms 19360 KB Ok
80 Correct 294 ms 19216 KB Ok
81 Correct 263 ms 19368 KB Ok
82 Correct 261 ms 19380 KB Ok
83 Correct 245 ms 19376 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 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
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 1 ms 212 KB Ok
17 Correct 1 ms 212 KB Ok
18 Correct 3 ms 596 KB Ok
19 Correct 12 ms 1836 KB Ok
20 Correct 7 ms 980 KB Ok
21 Correct 14 ms 2148 KB Ok
22 Correct 12 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 1 ms 212 KB Ok
28 Correct 0 ms 212 KB Ok
29 Correct 1 ms 212 KB Ok
30 Correct 0 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 0 ms 212 KB Ok
36 Correct 1 ms 384 KB Ok
37 Correct 1 ms 212 KB Ok
38 Correct 1 ms 212 KB Ok
39 Correct 140 ms 23368 KB Ok
40 Correct 114 ms 25960 KB Ok
41 Correct 258 ms 30404 KB Ok
42 Correct 173 ms 27176 KB Ok
43 Correct 93 ms 16452 KB Ok
44 Correct 158 ms 29480 KB Ok
45 Correct 3 ms 468 KB Ok
46 Correct 3 ms 468 KB Ok
47 Correct 3 ms 596 KB Ok
48 Correct 2 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 2 ms 468 KB Ok
53 Correct 3 ms 468 KB Ok
54 Correct 2 ms 468 KB Ok
55 Correct 5 ms 852 KB Ok
56 Correct 5 ms 980 KB Ok
57 Correct 6 ms 980 KB Ok
58 Correct 8 ms 980 KB Ok
59 Correct 6 ms 852 KB Ok
60 Correct 5 ms 980 KB Ok
61 Correct 5 ms 852 KB Ok
62 Correct 5 ms 972 KB Ok
63 Correct 5 ms 984 KB Ok
64 Correct 6 ms 892 KB Ok
65 Correct 87 ms 8272 KB Ok
66 Correct 127 ms 8588 KB Ok
67 Correct 105 ms 8552 KB Ok
68 Correct 70 ms 7468 KB Ok
69 Correct 99 ms 8180 KB Ok
70 Correct 85 ms 7864 KB Ok
71 Correct 71 ms 7312 KB Ok
72 Correct 82 ms 7880 KB Ok
73 Correct 110 ms 8720 KB Ok
74 Correct 93 ms 7696 KB Ok
75 Correct 114 ms 8804 KB Ok
76 Correct 94 ms 8464 KB Ok
77 Correct 93 ms 7676 KB Ok
78 Correct 74 ms 7696 KB Ok
79 Correct 92 ms 8616 KB Ok
80 Correct 272 ms 19088 KB Ok
81 Correct 294 ms 19584 KB Ok
82 Correct 271 ms 19476 KB Ok
83 Correct 272 ms 18868 KB Ok
84 Correct 293 ms 19352 KB Ok
85 Correct 330 ms 19260 KB Ok
86 Correct 282 ms 18996 KB Ok
87 Correct 285 ms 19096 KB Ok
88 Correct 243 ms 19236 KB Ok
89 Correct 321 ms 18852 KB Ok
90 Correct 319 ms 19360 KB Ok
91 Correct 294 ms 19216 KB Ok
92 Correct 263 ms 19368 KB Ok
93 Correct 261 ms 19380 KB Ok
94 Correct 245 ms 19376 KB Ok
95 Correct 245 ms 19840 KB Ok
96 Correct 359 ms 29812 KB Ok
97 Correct 321 ms 24492 KB Ok
98 Correct 225 ms 21692 KB Ok
99 Correct 280 ms 22420 KB Ok
100 Correct 315 ms 24080 KB Ok
101 Correct 290 ms 25540 KB Ok
102 Correct 305 ms 26004 KB Ok
103 Correct 315 ms 26984 KB Ok
104 Correct 343 ms 29512 KB Ok
105 Correct 346 ms 30256 KB Ok
106 Correct 312 ms 27356 KB Ok
107 Correct 293 ms 29752 KB Ok
108 Correct 390 ms 30456 KB Ok
109 Correct 340 ms 28880 KB Ok
110 Correct 1873 ms 77368 KB Ok
111 Execution timed out 2062 ms 78528 KB Time limit exceeded
112 Halted 0 ms 0 KB -