oj.uz

Submission #1114148

# Submission time Handle Problem Language Result Execution time Memory
1114148 2024-11-18T08:50:23 Z vjudge1 Nice sequence (IZhO18_sequence) C++17
43 / 100
 2000 ms 34328 KB 
//Dost SEFEROĞLU
#include <bits/stdc++.h>
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#pragma GCC optimize("O3,unroll-loops")
using namespace std;
//#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<    
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int MOD = 1e9+7,inf = 2e18;
const int N = 2e5+50,Q = 2e5+50;
const int LIM = 1e6+1;
vi edges[LIM];
int v[LIM];
int dad[LIM],sz[LIM];
bool vis[LIM];
struct DSU {
    int find(int x) {
        if (x == dad[x]) return x;
        return dad[x] = find(dad[x]);
    }
    void unite(int x,int y) {
        int a = find(x),b = find(y);
        assert(a != b);
        if (sz[a] > sz[b]) swap(a,b);
        dad[a] = b;
        sz[b]+=sz[a];
    }
};
struct DAG {
    int nd;
    int mex = 1;
    int dfs(int node) {
        vis[node] = 1;
        for (auto it : edges[node]) dfs(it);
        return v[node] = mex++;
    }
    void solve() {
        for (int i = 0;i<=nd;i++) {
            if (!vis[i]) dfs(i);
        }
    }
};
void solve() { 
    int n,m;
    cin >> n >> m;
    int r = 0;
    DSU dsu;
    dad[0] = 0,sz[0] = 0,vis[0] = 0,edges[0].clear();
    for (int i = 1;i<LIM;i++) {
        dad[i] = i,sz[i] = 1,vis[i] = 0,edges[i].clear();
        if (i >= m) {
            if (dsu.find(i) == dsu.find(i-m)) break;
            dsu.unite(i,i-m);
        }
        if (i >= n) {
            if (dsu.find(i-n) == dsu.find(i)) break;
            dsu.unite(i,i-n);
        }
        r = i;
    }
    DAG D;
    cout << r << endl;
    D.nd = r;
    for (int i = 1;i<=r;i++) {
        if (i >= m) {
            edges[i].push_back(i-m);
        }
        if (i >= n) {
            edges[i-n].push_back(i);
        }
    } 
    D.solve();
    for (int i = 1;i<=r;i++) {
        cout << v[i]-v[i-1] << ' ';
    }
    cout << '\n'; 
}                    
                             
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef Dodi
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    cin >> t; 
    while (t --> 0) solve();
}

Compilation message

sequence.cpp:13:29: warning: overflow in conversion from 'double' to 'int' changes value from '2.0e+18' to '2147483647' [-Woverflow]
   13 | const int MOD = 1e9+7,inf = 2e18;
      |                             ^~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23888 KB Ok
2 Correct 20 ms 23888 KB Ok
3 Correct 17 ms 23888 KB Ok
4 Correct 16 ms 23888 KB Ok
5 Correct 17 ms 23888 KB Ok
6 Correct 16 ms 23888 KB Ok
7 Correct 16 ms 23888 KB Ok
8 Correct 16 ms 23888 KB Ok
9 Correct 16 ms 23888 KB Ok
10 Correct 20 ms 23888 KB Ok
11 Correct 16 ms 23828 KB Ok
12 Correct 16 ms 23888 KB Ok

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23840 KB Ok
2 Correct 17 ms 23900 KB Ok
3 Correct 16 ms 23888 KB Ok
4 Correct 16 ms 23888 KB Ok
5 Correct 16 ms 23888 KB Ok
6 Correct 45 ms 24136 KB Ok
7 Correct 540 ms 25024 KB Ok
8 Correct 99 ms 24392 KB Ok
9 Correct 1117 ms 25168 KB Ok
10 Correct 206 ms 24648 KB Ok

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23952 KB Ok
2 Correct 19 ms 23904 KB Ok
3 Correct 17 ms 23888 KB Ok
4 Correct 19 ms 23888 KB Ok
5 Correct 18 ms 23888 KB Ok
6 Correct 17 ms 23888 KB Ok
7 Correct 17 ms 23932 KB Ok
8 Correct 18 ms 23888 KB Ok
9 Correct 19 ms 23888 KB Ok
10 Correct 18 ms 23804 KB Ok
11 Correct 17 ms 23888 KB Ok

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23888 KB Ok
2 Correct 16 ms 23880 KB Ok
3 Correct 16 ms 23888 KB Ok
4 Correct 18 ms 23888 KB Ok
5 Correct 21 ms 23888 KB Ok
6 Execution timed out 2056 ms 31572 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23888 KB Ok
2 Correct 20 ms 23888 KB Ok
3 Correct 17 ms 23888 KB Ok
4 Correct 16 ms 23888 KB Ok
5 Correct 17 ms 23888 KB Ok
6 Correct 16 ms 23888 KB Ok
7 Correct 16 ms 23888 KB Ok
8 Correct 16 ms 23888 KB Ok
9 Correct 16 ms 23888 KB Ok
10 Correct 20 ms 23888 KB Ok
11 Correct 16 ms 23828 KB Ok
12 Correct 16 ms 23888 KB Ok
13 Correct 21 ms 23952 KB Ok
14 Correct 19 ms 23904 KB Ok
15 Correct 17 ms 23888 KB Ok
16 Correct 19 ms 23888 KB Ok
17 Correct 18 ms 23888 KB Ok
18 Correct 17 ms 23888 KB Ok
19 Correct 17 ms 23932 KB Ok
20 Correct 18 ms 23888 KB Ok
21 Correct 19 ms 23888 KB Ok
22 Correct 18 ms 23804 KB Ok
23 Correct 17 ms 23888 KB Ok
24 Correct 20 ms 23888 KB Ok
25 Correct 20 ms 24144 KB Ok
26 Correct 18 ms 23888 KB Ok
27 Correct 17 ms 24144 KB Ok
28 Correct 18 ms 23936 KB Ok
29 Correct 18 ms 23900 KB Ok
30 Correct 18 ms 23900 KB Ok
31 Correct 22 ms 23952 KB Ok
32 Correct 18 ms 24112 KB Ok
33 Correct 18 ms 23888 KB Ok
34 Correct 24 ms 24144 KB Ok
35 Correct 25 ms 24268 KB Ok
36 Correct 33 ms 24400 KB Ok
37 Correct 25 ms 24568 KB Ok
38 Correct 24 ms 24400 KB Ok
39 Correct 24 ms 24144 KB Ok
40 Correct 27 ms 24392 KB Ok
41 Correct 27 ms 24392 KB Ok
42 Correct 26 ms 24364 KB Ok
43 Correct 26 ms 24400 KB Ok

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23888 KB Ok
2 Correct 20 ms 23888 KB Ok
3 Correct 17 ms 23888 KB Ok
4 Correct 16 ms 23888 KB Ok
5 Correct 17 ms 23888 KB Ok
6 Correct 16 ms 23888 KB Ok
7 Correct 16 ms 23888 KB Ok
8 Correct 16 ms 23888 KB Ok
9 Correct 16 ms 23888 KB Ok
10 Correct 20 ms 23888 KB Ok
11 Correct 16 ms 23828 KB Ok
12 Correct 16 ms 23888 KB Ok
13 Correct 16 ms 23840 KB Ok
14 Correct 17 ms 23900 KB Ok
15 Correct 16 ms 23888 KB Ok
16 Correct 16 ms 23888 KB Ok
17 Correct 16 ms 23888 KB Ok
18 Correct 45 ms 24136 KB Ok
19 Correct 540 ms 25024 KB Ok
20 Correct 99 ms 24392 KB Ok
21 Correct 1117 ms 25168 KB Ok
22 Correct 206 ms 24648 KB Ok
23 Correct 21 ms 23952 KB Ok
24 Correct 19 ms 23904 KB Ok
25 Correct 17 ms 23888 KB Ok
26 Correct 19 ms 23888 KB Ok
27 Correct 18 ms 23888 KB Ok
28 Correct 17 ms 23888 KB Ok
29 Correct 17 ms 23932 KB Ok
30 Correct 18 ms 23888 KB Ok
31 Correct 19 ms 23888 KB Ok
32 Correct 18 ms 23804 KB Ok
33 Correct 17 ms 23888 KB Ok
34 Correct 20 ms 23888 KB Ok
35 Correct 20 ms 24144 KB Ok
36 Correct 18 ms 23888 KB Ok
37 Correct 17 ms 24144 KB Ok
38 Correct 18 ms 23936 KB Ok
39 Correct 18 ms 23900 KB Ok
40 Correct 18 ms 23900 KB Ok
41 Correct 22 ms 23952 KB Ok
42 Correct 18 ms 24112 KB Ok
43 Correct 18 ms 23888 KB Ok
44 Correct 24 ms 24144 KB Ok
45 Correct 25 ms 24268 KB Ok
46 Correct 33 ms 24400 KB Ok
47 Correct 25 ms 24568 KB Ok
48 Correct 24 ms 24400 KB Ok
49 Correct 24 ms 24144 KB Ok
50 Correct 27 ms 24392 KB Ok
51 Correct 27 ms 24392 KB Ok
52 Correct 26 ms 24364 KB Ok
53 Correct 26 ms 24400 KB Ok
54 Correct 79 ms 29612 KB Ok
55 Correct 112 ms 29976 KB Ok
56 Correct 82 ms 30280 KB Ok
57 Correct 62 ms 29000 KB Ok
58 Correct 99 ms 29768 KB Ok
59 Correct 91 ms 29328 KB Ok
60 Correct 73 ms 29000 KB Ok
61 Correct 62 ms 29272 KB Ok
62 Correct 99 ms 30032 KB Ok
63 Correct 89 ms 29292 KB Ok
64 Correct 93 ms 30024 KB Ok
65 Correct 81 ms 30024 KB Ok
66 Correct 66 ms 29512 KB Ok
67 Correct 61 ms 29256 KB Ok
68 Correct 87 ms 29768 KB Ok
69 Execution timed out 2052 ms 34328 KB Time limit exceeded
70 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23888 KB Ok
2 Correct 20 ms 23888 KB Ok
3 Correct 17 ms 23888 KB Ok
4 Correct 16 ms 23888 KB Ok
5 Correct 17 ms 23888 KB Ok
6 Correct 16 ms 23888 KB Ok
7 Correct 16 ms 23888 KB Ok
8 Correct 16 ms 23888 KB Ok
9 Correct 16 ms 23888 KB Ok
10 Correct 20 ms 23888 KB Ok
11 Correct 16 ms 23828 KB Ok
12 Correct 16 ms 23888 KB Ok
13 Correct 16 ms 23840 KB Ok
14 Correct 17 ms 23900 KB Ok
15 Correct 16 ms 23888 KB Ok
16 Correct 16 ms 23888 KB Ok
17 Correct 16 ms 23888 KB Ok
18 Correct 45 ms 24136 KB Ok
19 Correct 540 ms 25024 KB Ok
20 Correct 99 ms 24392 KB Ok
21 Correct 1117 ms 25168 KB Ok
22 Correct 206 ms 24648 KB Ok
23 Correct 21 ms 23952 KB Ok
24 Correct 19 ms 23904 KB Ok
25 Correct 17 ms 23888 KB Ok
26 Correct 19 ms 23888 KB Ok
27 Correct 18 ms 23888 KB Ok
28 Correct 17 ms 23888 KB Ok
29 Correct 17 ms 23932 KB Ok
30 Correct 18 ms 23888 KB Ok
31 Correct 19 ms 23888 KB Ok
32 Correct 18 ms 23804 KB Ok
33 Correct 17 ms 23888 KB Ok
34 Correct 17 ms 23888 KB Ok
35 Correct 16 ms 23880 KB Ok
36 Correct 16 ms 23888 KB Ok
37 Correct 18 ms 23888 KB Ok
38 Correct 21 ms 23888 KB Ok
39 Execution timed out 2056 ms 31572 KB Time limit exceeded
40 Halted 0 ms 0 KB -