oj.uz

Submission #173813

# Submission time Handle Problem Language Result Execution time Memory
173813 2020-01-05T13:11:49 Z davitmarg Nice sequence (IZhO18_sequence) C++17
76 / 100
 2000 ms 64972 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 5 * 200005;

int gcd(int a, int b)
{
    if (!a || !b)
        return a + b;
    return gcd(b, a % b);
}

LL lca(LL a, LL b)
{
    return a * b / gcd(a, b);
}

int q, n, m, k, a[N], used[N], tin[N];
vector<int> t, g[N];

inline void dfs(int v)
{
    used[v] = 1;
    for (int i = 0; i < g[v].size(); i++)
    {
        int to = g[v][i];
        if (used[to])
            continue;
        dfs(to);
    }
    //tin[v] = -t.size();
    t.PB(v);
}

bool check(int x)
{
    t.clear();
    for (int i = 0; i <= x; i++)
    {
        g[i].clear();
        used[i] = 0;
        a[i] = i;
    }

    for (int i = 0; i <= x; i++)
    {
        if (i - m >= 0)
            g[i - m].PB(i);
        if (i + n <= x)
            g[i + n].PB(i);
    }
    for (int i = 0; i <= x; i++)
        if (!used[i])
            dfs(i);
    //cout << "!!!!!" << x << endl;
    int v, to;
    for (int i = t.size() - 1; i >= 0; i--)
    {
        v = t[i];
        for (int j = 0; j < g[v].size(); j++)
        {
            to = g[v][j];
            // if (tin[to] <= tin[v])
            //     return 0;
            //cout << v << " : " << to << endl;
            a[to] = max(a[to], a[v] + 1);
        }
    }
    return 1;
}

char uu[12];
void tp(int x)
{
    if (x == 0)
    {
        putchar('0');
        return;
    }
    if (x < 0)
    {
        putchar('-');
        x *= (-1);
    }
    int i = 0;
    while (x)
    {
        uu[i++] = (x % 10) + '0';
        x /= 10;
    }
    for (i = i - 1; i >= 0; --i)
        putchar(uu[i]);
}

int main()
{
    cin >> q;
    while (q--)
    {
        k = 0;
        cin >> n >> m;
        LL l, r, mid;
        l = 0;
        r = min(lca(n, m) - 1ll, 400000ll);
        // while (l <= r)
        // {
        //     mid = (l + r) / 2;
        //     if (check(mid))
        //     {
        //         k = mid;
        //         l = mid + 1;
        //     }
        //     else
        //         r = mid - 1;
        // }
        k = n + m - gcd(n, m) - 1;
        check(k);
        tp(k);
        putchar('\n');
        for (int i = 1; i <= k; i++)
        {
            //printf("%d ", a[i] - a[i - 1]);
            tp(a[i] - a[i - 1]);
            putchar(' ');
        }
        putchar('\n');
    }
    return 0;
}

/*
 
4
3 1
2 3
1 1
2 2
 
 
*/

Compilation message

sequence.cpp: In function 'void dfs(int)':
sequence.cpp:46:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < g[v].size(); i++)
                     ~~^~~~~~~~~~~~~
sequence.cpp: In function 'bool check(int)':
sequence.cpp:82:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < g[v].size(); j++)
                         ~~^~~~~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:124:12: warning: variable 'l' set but not used [-Wunused-but-set-variable]
         LL l, r, mid;
            ^
sequence.cpp:124:15: warning: variable 'r' set but not used [-Wunused-but-set-variable]
         LL l, r, mid;
               ^
sequence.cpp:124:18: warning: unused variable 'mid' [-Wunused-variable]
         LL l, r, mid;
                  ^~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Ok
2 Correct 23 ms 23800 KB Ok
3 Correct 23 ms 23800 KB Ok
4 Correct 23 ms 23800 KB Ok
5 Correct 23 ms 23800 KB Ok
6 Correct 23 ms 23800 KB Ok
7 Correct 23 ms 23800 KB Ok
8 Correct 23 ms 23800 KB Ok
9 Correct 23 ms 23844 KB Ok
10 Correct 23 ms 23800 KB Ok
11 Correct 22 ms 23800 KB Ok
12 Correct 23 ms 23800 KB Ok

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23800 KB Ok
2 Correct 22 ms 23800 KB Ok
3 Correct 23 ms 23800 KB Ok
4 Correct 23 ms 23800 KB Ok
5 Correct 23 ms 23800 KB Ok
6 Correct 25 ms 24060 KB Ok
7 Correct 33 ms 24668 KB Ok
8 Correct 28 ms 24184 KB Ok
9 Correct 35 ms 24824 KB Ok
10 Correct 30 ms 24440 KB Ok

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Ok
2 Correct 23 ms 23800 KB Ok
3 Correct 23 ms 23800 KB Ok
4 Correct 23 ms 23800 KB Ok
5 Correct 23 ms 23928 KB Ok
6 Correct 23 ms 23800 KB Ok
7 Correct 23 ms 23772 KB Ok
8 Correct 27 ms 23800 KB Ok
9 Correct 24 ms 23800 KB Ok
10 Correct 23 ms 23868 KB Ok
11 Correct 23 ms 23800 KB Ok

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Ok
2 Correct 23 ms 23800 KB Ok
3 Correct 20 ms 23772 KB Ok
4 Correct 23 ms 23800 KB Ok
5 Correct 23 ms 23772 KB Ok
6 Correct 119 ms 36716 KB Ok
7 Correct 100 ms 37104 KB Ok
8 Correct 164 ms 39428 KB Ok
9 Correct 168 ms 37356 KB Ok
10 Correct 85 ms 32240 KB Ok
11 Correct 147 ms 39500 KB Ok

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Ok
2 Correct 23 ms 23800 KB Ok
3 Correct 23 ms 23800 KB Ok
4 Correct 23 ms 23800 KB Ok
5 Correct 23 ms 23800 KB Ok
6 Correct 23 ms 23800 KB Ok
7 Correct 23 ms 23800 KB Ok
8 Correct 23 ms 23800 KB Ok
9 Correct 23 ms 23844 KB Ok
10 Correct 23 ms 23800 KB Ok
11 Correct 22 ms 23800 KB Ok
12 Correct 23 ms 23800 KB Ok
13 Correct 23 ms 23800 KB Ok
14 Correct 23 ms 23800 KB Ok
15 Correct 23 ms 23800 KB Ok
16 Correct 23 ms 23800 KB Ok
17 Correct 23 ms 23928 KB Ok
18 Correct 23 ms 23800 KB Ok
19 Correct 23 ms 23772 KB Ok
20 Correct 27 ms 23800 KB Ok
21 Correct 24 ms 23800 KB Ok
22 Correct 23 ms 23868 KB Ok
23 Correct 23 ms 23800 KB Ok
24 Correct 25 ms 24056 KB Ok
25 Correct 25 ms 24056 KB Ok
26 Correct 24 ms 23940 KB Ok
27 Correct 24 ms 23928 KB Ok
28 Correct 25 ms 23928 KB Ok
29 Correct 24 ms 23928 KB Ok
30 Correct 24 ms 23928 KB Ok
31 Correct 25 ms 24056 KB Ok
32 Correct 24 ms 23996 KB Ok
33 Correct 24 ms 24056 KB Ok
34 Correct 27 ms 24056 KB Ok
35 Correct 28 ms 24184 KB Ok
36 Correct 29 ms 24312 KB Ok
37 Correct 28 ms 24184 KB Ok
38 Correct 28 ms 24160 KB Ok
39 Correct 27 ms 24056 KB Ok
40 Correct 28 ms 24184 KB Ok
41 Correct 28 ms 24184 KB Ok
42 Correct 28 ms 24136 KB Ok
43 Correct 32 ms 24184 KB Ok

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Ok
2 Correct 23 ms 23800 KB Ok
3 Correct 23 ms 23800 KB Ok
4 Correct 23 ms 23800 KB Ok
5 Correct 23 ms 23800 KB Ok
6 Correct 23 ms 23800 KB Ok
7 Correct 23 ms 23800 KB Ok
8 Correct 23 ms 23800 KB Ok
9 Correct 23 ms 23844 KB Ok
10 Correct 23 ms 23800 KB Ok
11 Correct 22 ms 23800 KB Ok
12 Correct 23 ms 23800 KB Ok
13 Correct 22 ms 23800 KB Ok
14 Correct 22 ms 23800 KB Ok
15 Correct 23 ms 23800 KB Ok
16 Correct 23 ms 23800 KB Ok
17 Correct 23 ms 23800 KB Ok
18 Correct 25 ms 24060 KB Ok
19 Correct 33 ms 24668 KB Ok
20 Correct 28 ms 24184 KB Ok
21 Correct 35 ms 24824 KB Ok
22 Correct 30 ms 24440 KB Ok
23 Correct 23 ms 23800 KB Ok
24 Correct 23 ms 23800 KB Ok
25 Correct 23 ms 23800 KB Ok
26 Correct 23 ms 23800 KB Ok
27 Correct 23 ms 23928 KB Ok
28 Correct 23 ms 23800 KB Ok
29 Correct 23 ms 23772 KB Ok
30 Correct 27 ms 23800 KB Ok
31 Correct 24 ms 23800 KB Ok
32 Correct 23 ms 23868 KB Ok
33 Correct 23 ms 23800 KB Ok
34 Correct 25 ms 24056 KB Ok
35 Correct 25 ms 24056 KB Ok
36 Correct 24 ms 23940 KB Ok
37 Correct 24 ms 23928 KB Ok
38 Correct 25 ms 23928 KB Ok
39 Correct 24 ms 23928 KB Ok
40 Correct 24 ms 23928 KB Ok
41 Correct 25 ms 24056 KB Ok
42 Correct 24 ms 23996 KB Ok
43 Correct 24 ms 24056 KB Ok
44 Correct 27 ms 24056 KB Ok
45 Correct 28 ms 24184 KB Ok
46 Correct 29 ms 24312 KB Ok
47 Correct 28 ms 24184 KB Ok
48 Correct 28 ms 24160 KB Ok
49 Correct 27 ms 24056 KB Ok
50 Correct 28 ms 24184 KB Ok
51 Correct 28 ms 24184 KB Ok
52 Correct 28 ms 24136 KB Ok
53 Correct 32 ms 24184 KB Ok
54 Correct 83 ms 29236 KB Ok
55 Correct 108 ms 29428 KB Ok
56 Correct 84 ms 29420 KB Ok
57 Correct 69 ms 28784 KB Ok
58 Correct 86 ms 29168 KB Ok
59 Correct 81 ms 29040 KB Ok
60 Correct 77 ms 28588 KB Ok
61 Correct 69 ms 29040 KB Ok
62 Correct 97 ms 29428 KB Ok
63 Correct 77 ms 28820 KB Ok
64 Correct 88 ms 29296 KB Ok
65 Correct 87 ms 29296 KB Ok
66 Correct 75 ms 29036 KB Ok
67 Correct 69 ms 28788 KB Ok
68 Correct 83 ms 29204 KB Ok
69 Correct 311 ms 35384 KB Ok
70 Correct 351 ms 36376 KB Ok
71 Correct 272 ms 33524 KB Ok
72 Correct 340 ms 35864 KB Ok
73 Correct 371 ms 34384 KB Ok
74 Correct 251 ms 33652 KB Ok
75 Correct 325 ms 33904 KB Ok
76 Correct 331 ms 36340 KB Ok
77 Correct 255 ms 33136 KB Ok
78 Correct 303 ms 36212 KB Ok
79 Correct 284 ms 35012 KB Ok
80 Correct 262 ms 34436 KB Ok
81 Correct 323 ms 35604 KB Ok
82 Correct 392 ms 35188 KB Ok
83 Correct 363 ms 34164 KB Ok

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Ok
2 Correct 23 ms 23800 KB Ok
3 Correct 23 ms 23800 KB Ok
4 Correct 23 ms 23800 KB Ok
5 Correct 23 ms 23800 KB Ok
6 Correct 23 ms 23800 KB Ok
7 Correct 23 ms 23800 KB Ok
8 Correct 23 ms 23800 KB Ok
9 Correct 23 ms 23844 KB Ok
10 Correct 23 ms 23800 KB Ok
11 Correct 22 ms 23800 KB Ok
12 Correct 23 ms 23800 KB Ok
13 Correct 22 ms 23800 KB Ok
14 Correct 22 ms 23800 KB Ok
15 Correct 23 ms 23800 KB Ok
16 Correct 23 ms 23800 KB Ok
17 Correct 23 ms 23800 KB Ok
18 Correct 25 ms 24060 KB Ok
19 Correct 33 ms 24668 KB Ok
20 Correct 28 ms 24184 KB Ok
21 Correct 35 ms 24824 KB Ok
22 Correct 30 ms 24440 KB Ok
23 Correct 23 ms 23800 KB Ok
24 Correct 23 ms 23800 KB Ok
25 Correct 23 ms 23800 KB Ok
26 Correct 23 ms 23800 KB Ok
27 Correct 23 ms 23928 KB Ok
28 Correct 23 ms 23800 KB Ok
29 Correct 23 ms 23772 KB Ok
30 Correct 27 ms 23800 KB Ok
31 Correct 24 ms 23800 KB Ok
32 Correct 23 ms 23868 KB Ok
33 Correct 23 ms 23800 KB Ok
34 Correct 23 ms 23800 KB Ok
35 Correct 23 ms 23800 KB Ok
36 Correct 20 ms 23772 KB Ok
37 Correct 23 ms 23800 KB Ok
38 Correct 23 ms 23772 KB Ok
39 Correct 119 ms 36716 KB Ok
40 Correct 100 ms 37104 KB Ok
41 Correct 164 ms 39428 KB Ok
42 Correct 168 ms 37356 KB Ok
43 Correct 85 ms 32240 KB Ok
44 Correct 147 ms 39500 KB Ok
45 Correct 25 ms 24056 KB Ok
46 Correct 25 ms 24056 KB Ok
47 Correct 24 ms 23940 KB Ok
48 Correct 24 ms 23928 KB Ok
49 Correct 25 ms 23928 KB Ok
50 Correct 24 ms 23928 KB Ok
51 Correct 24 ms 23928 KB Ok
52 Correct 25 ms 24056 KB Ok
53 Correct 24 ms 23996 KB Ok
54 Correct 24 ms 24056 KB Ok
55 Correct 27 ms 24056 KB Ok
56 Correct 28 ms 24184 KB Ok
57 Correct 29 ms 24312 KB Ok
58 Correct 28 ms 24184 KB Ok
59 Correct 28 ms 24160 KB Ok
60 Correct 27 ms 24056 KB Ok
61 Correct 28 ms 24184 KB Ok
62 Correct 28 ms 24184 KB Ok
63 Correct 28 ms 24136 KB Ok
64 Correct 32 ms 24184 KB Ok
65 Correct 83 ms 29236 KB Ok
66 Correct 108 ms 29428 KB Ok
67 Correct 84 ms 29420 KB Ok
68 Correct 69 ms 28784 KB Ok
69 Correct 86 ms 29168 KB Ok
70 Correct 81 ms 29040 KB Ok
71 Correct 77 ms 28588 KB Ok
72 Correct 69 ms 29040 KB Ok
73 Correct 97 ms 29428 KB Ok
74 Correct 77 ms 28820 KB Ok
75 Correct 88 ms 29296 KB Ok
76 Correct 87 ms 29296 KB Ok
77 Correct 75 ms 29036 KB Ok
78 Correct 69 ms 28788 KB Ok
79 Correct 83 ms 29204 KB Ok
80 Correct 311 ms 35384 KB Ok
81 Correct 351 ms 36376 KB Ok
82 Correct 272 ms 33524 KB Ok
83 Correct 340 ms 35864 KB Ok
84 Correct 371 ms 34384 KB Ok
85 Correct 251 ms 33652 KB Ok
86 Correct 325 ms 33904 KB Ok
87 Correct 331 ms 36340 KB Ok
88 Correct 255 ms 33136 KB Ok
89 Correct 303 ms 36212 KB Ok
90 Correct 284 ms 35012 KB Ok
91 Correct 262 ms 34436 KB Ok
92 Correct 323 ms 35604 KB Ok
93 Correct 392 ms 35188 KB Ok
94 Correct 363 ms 34164 KB Ok
95 Correct 192 ms 37652 KB Ok
96 Correct 331 ms 44096 KB Ok
97 Correct 263 ms 40636 KB Ok
98 Correct 213 ms 41060 KB Ok
99 Correct 198 ms 40552 KB Ok
100 Correct 269 ms 39784 KB Ok
101 Correct 218 ms 42852 KB Ok
102 Correct 272 ms 40812 KB Ok
103 Correct 273 ms 41748 KB Ok
104 Correct 279 ms 43236 KB Ok
105 Correct 329 ms 43752 KB Ok
106 Correct 260 ms 43620 KB Ok
107 Correct 310 ms 43108 KB Ok
108 Correct 365 ms 43536 KB Ok
109 Correct 300 ms 44644 KB Ok
110 Execution timed out 2041 ms 64972 KB Time limit exceeded
111 Halted 0 ms 0 KB -