oj.uz

Submission #173814

# Submission time Handle Problem Language Result Execution time Memory
173814 2020-01-05T13:12:26 Z davitmarg Nice sequence (IZhO18_sequence) C++17
0 / 100
 27 ms 23828 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)
{
    for (int i = 0; i <= x; i++)
        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:77: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:119:12: warning: variable 'l' set but not used [-Wunused-but-set-variable]
         LL l, r, mid;
            ^
sequence.cpp:119:15: warning: variable 'r' set but not used [-Wunused-but-set-variable]
         LL l, r, mid;
               ^
sequence.cpp:119:18: warning: unused variable 'mid' [-Wunused-variable]
         LL l, r, mid;
                  ^~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 23800 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 23800 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 23800 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 23828 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 23800 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 23800 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 23800 KB there is incorrect sequence
2 Halted 0 ms 0 KB -