oj.uz

답안 #686739

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
686739 2023-01-25T21:26:36 Z quinque Nice sequence (IZhO18_sequence) C++17
76 / 100
 2000 ms 68516 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

# 결과 실행 시간 메모리 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
12 Correct 0 ms 212 KB Ok

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 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 3 ms 524 KB Ok
7 Correct 12 ms 1676 KB Ok
8 Correct 6 ms 980 KB Ok
9 Correct 14 ms 1896 KB Ok
10 Correct 8 ms 1228 KB Ok

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Ok
5 Correct 0 ms 212 KB Ok
6 Correct 0 ms 260 KB Ok
7 Correct 1 ms 212 KB Ok
8 Correct 1 ms 212 KB Ok
9 Correct 1 ms 212 KB Ok
10 Correct 0 ms 212 KB Ok
11 Correct 0 ms 212 KB Ok

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 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 148 ms 20152 KB Ok
7 Correct 104 ms 21608 KB Ok
8 Correct 201 ms 26384 KB Ok
9 Correct 160 ms 23424 KB Ok
10 Correct 98 ms 14492 KB Ok
11 Correct 152 ms 25132 KB Ok

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 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
12 Correct 0 ms 212 KB Ok
13 Correct 1 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 0 ms 212 KB Ok
18 Correct 0 ms 260 KB Ok
19 Correct 1 ms 212 KB Ok
20 Correct 1 ms 212 KB Ok
21 Correct 1 ms 212 KB Ok
22 Correct 0 ms 212 KB Ok
23 Correct 0 ms 212 KB Ok
24 Correct 3 ms 468 KB Ok
25 Correct 3 ms 552 KB Ok
26 Correct 3 ms 596 KB Ok
27 Correct 3 ms 560 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 552 KB Ok
33 Correct 2 ms 468 KB Ok
34 Correct 6 ms 852 KB Ok
35 Correct 5 ms 852 KB Ok
36 Correct 7 ms 848 KB Ok
37 Correct 6 ms 860 KB Ok
38 Correct 8 ms 796 KB Ok
39 Correct 6 ms 852 KB Ok
40 Correct 6 ms 852 KB Ok
41 Correct 6 ms 852 KB Ok
42 Correct 7 ms 852 KB Ok
43 Correct 6 ms 852 KB Ok

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 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
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 1 ms 212 KB Ok
17 Correct 0 ms 212 KB Ok
18 Correct 3 ms 524 KB Ok
19 Correct 12 ms 1676 KB Ok
20 Correct 6 ms 980 KB Ok
21 Correct 14 ms 1896 KB Ok
22 Correct 8 ms 1228 KB Ok
23 Correct 1 ms 212 KB Ok
24 Correct 0 ms 212 KB Ok
25 Correct 1 ms 212 KB Ok
26 Correct 0 ms 212 KB Ok
27 Correct 0 ms 212 KB Ok
28 Correct 0 ms 260 KB Ok
29 Correct 1 ms 212 KB Ok
30 Correct 1 ms 212 KB Ok
31 Correct 1 ms 212 KB Ok
32 Correct 0 ms 212 KB Ok
33 Correct 0 ms 212 KB Ok
34 Correct 3 ms 468 KB Ok
35 Correct 3 ms 552 KB Ok
36 Correct 3 ms 596 KB Ok
37 Correct 3 ms 560 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 552 KB Ok
43 Correct 2 ms 468 KB Ok
44 Correct 6 ms 852 KB Ok
45 Correct 5 ms 852 KB Ok
46 Correct 7 ms 848 KB Ok
47 Correct 6 ms 860 KB Ok
48 Correct 8 ms 796 KB Ok
49 Correct 6 ms 852 KB Ok
50 Correct 6 ms 852 KB Ok
51 Correct 6 ms 852 KB Ok
52 Correct 7 ms 852 KB Ok
53 Correct 6 ms 852 KB Ok
54 Correct 89 ms 8548 KB Ok
55 Correct 107 ms 8800 KB Ok
56 Correct 113 ms 8744 KB Ok
57 Correct 73 ms 7760 KB Ok
58 Correct 93 ms 8524 KB Ok
59 Correct 98 ms 8184 KB Ok
60 Correct 85 ms 7572 KB Ok
61 Correct 78 ms 8196 KB Ok
62 Correct 133 ms 9048 KB Ok
63 Correct 82 ms 8020 KB Ok
64 Correct 107 ms 8964 KB Ok
65 Correct 104 ms 8756 KB Ok
66 Correct 84 ms 7868 KB Ok
67 Correct 72 ms 8004 KB Ok
68 Correct 94 ms 8776 KB Ok
69 Correct 274 ms 16948 KB Ok
70 Correct 374 ms 17240 KB Ok
71 Correct 257 ms 17216 KB Ok
72 Correct 247 ms 16696 KB Ok
73 Correct 278 ms 17084 KB Ok
74 Correct 270 ms 17052 KB Ok
75 Correct 241 ms 16756 KB Ok
76 Correct 324 ms 16888 KB Ok
77 Correct 338 ms 17116 KB Ok
78 Correct 258 ms 16716 KB Ok
79 Correct 306 ms 17184 KB Ok
80 Correct 242 ms 16984 KB Ok
81 Correct 263 ms 17060 KB Ok
82 Correct 263 ms 17112 KB Ok
83 Correct 334 ms 17212 KB Ok

Subtask #7
0 / 24.0

# 결과 실행 시간 메모리 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
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 1 ms 212 KB Ok
17 Correct 0 ms 212 KB Ok
18 Correct 3 ms 524 KB Ok
19 Correct 12 ms 1676 KB Ok
20 Correct 6 ms 980 KB Ok
21 Correct 14 ms 1896 KB Ok
22 Correct 8 ms 1228 KB Ok
23 Correct 1 ms 212 KB Ok
24 Correct 0 ms 212 KB Ok
25 Correct 1 ms 212 KB Ok
26 Correct 0 ms 212 KB Ok
27 Correct 0 ms 212 KB Ok
28 Correct 0 ms 260 KB Ok
29 Correct 1 ms 212 KB Ok
30 Correct 1 ms 212 KB Ok
31 Correct 1 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 0 ms 212 KB Ok
36 Correct 0 ms 212 KB Ok
37 Correct 0 ms 212 KB Ok
38 Correct 0 ms 212 KB Ok
39 Correct 148 ms 20152 KB Ok
40 Correct 104 ms 21608 KB Ok
41 Correct 201 ms 26384 KB Ok
42 Correct 160 ms 23424 KB Ok
43 Correct 98 ms 14492 KB Ok
44 Correct 152 ms 25132 KB Ok
45 Correct 3 ms 468 KB Ok
46 Correct 3 ms 552 KB Ok
47 Correct 3 ms 596 KB Ok
48 Correct 3 ms 560 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 552 KB Ok
54 Correct 2 ms 468 KB Ok
55 Correct 6 ms 852 KB Ok
56 Correct 5 ms 852 KB Ok
57 Correct 7 ms 848 KB Ok
58 Correct 6 ms 860 KB Ok
59 Correct 8 ms 796 KB Ok
60 Correct 6 ms 852 KB Ok
61 Correct 6 ms 852 KB Ok
62 Correct 6 ms 852 KB Ok
63 Correct 7 ms 852 KB Ok
64 Correct 6 ms 852 KB Ok
65 Correct 89 ms 8548 KB Ok
66 Correct 107 ms 8800 KB Ok
67 Correct 113 ms 8744 KB Ok
68 Correct 73 ms 7760 KB Ok
69 Correct 93 ms 8524 KB Ok
70 Correct 98 ms 8184 KB Ok
71 Correct 85 ms 7572 KB Ok
72 Correct 78 ms 8196 KB Ok
73 Correct 133 ms 9048 KB Ok
74 Correct 82 ms 8020 KB Ok
75 Correct 107 ms 8964 KB Ok
76 Correct 104 ms 8756 KB Ok
77 Correct 84 ms 7868 KB Ok
78 Correct 72 ms 8004 KB Ok
79 Correct 94 ms 8776 KB Ok
80 Correct 274 ms 16948 KB Ok
81 Correct 374 ms 17240 KB Ok
82 Correct 257 ms 17216 KB Ok
83 Correct 247 ms 16696 KB Ok
84 Correct 278 ms 17084 KB Ok
85 Correct 270 ms 17052 KB Ok
86 Correct 241 ms 16756 KB Ok
87 Correct 324 ms 16888 KB Ok
88 Correct 338 ms 17116 KB Ok
89 Correct 258 ms 16716 KB Ok
90 Correct 306 ms 17184 KB Ok
91 Correct 242 ms 16984 KB Ok
92 Correct 263 ms 17060 KB Ok
93 Correct 263 ms 17112 KB Ok
94 Correct 334 ms 17212 KB Ok
95 Correct 258 ms 20520 KB Ok
96 Correct 363 ms 30768 KB Ok
97 Correct 360 ms 25412 KB Ok
98 Correct 224 ms 22480 KB Ok
99 Correct 297 ms 23208 KB Ok
100 Correct 328 ms 24892 KB Ok
101 Correct 303 ms 26560 KB Ok
102 Correct 309 ms 27012 KB Ok
103 Correct 331 ms 27904 KB Ok
104 Correct 369 ms 30452 KB Ok
105 Correct 351 ms 31256 KB Ok
106 Correct 329 ms 28460 KB Ok
107 Correct 313 ms 30780 KB Ok
108 Correct 408 ms 31424 KB Ok
109 Correct 371 ms 30004 KB Ok
110 Correct 1873 ms 68516 KB Ok
111 Execution timed out 2077 ms 66900 KB Time limit exceeded
112 Halted 0 ms 0 KB -