oj.uz

답안 #1035739

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1035739 2024-07-26T14:22:25 Z phoenix Nice sequence (IZhO18_sequence) C++17
0 / 100
 5 ms 12176 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 500500;

int n, m;

vector<int> g[N];
int color[N];
bool cycle;

void dfs(int s) {
    color[s] = 1;
    for (int to : g[s]) {
        if (!color[to]) dfs(to);
        cycle |= (color[to] == 1);
    }
    color[s] = 2;
}

void build(int len) {
    for (int i = 0; i <= len; i++) {
        g[i].clear();
        color[i] = 0;
    }
    for (int i = 0; i <= len - n; i++) {
        g[i].push_back(i + n);
    }
    for (int i = 0; i <= len - m; i++) {
        g[i + m].push_back(i);
    }
}

vector<int> top;
void topsort(int s) {
    color[s] = 1;
    for (int to : g[s]) if (!color[to]) {
        topsort(to);
    }
    top.push_back(s);
}

bool check(int len) {
    build(len);
    cycle = false;
    for (int i = 0; i <= len; i++) {
        if (color[i]) continue;
        dfs(i);
        if (cycle) return true;
    }
    return false;
}

void solve() {
    cin >> n >> m;
    int l = 0, r = 10;
    while (r - l > 1) {
        int mid = (l + r) / 2;
        if (check(mid))
            r = mid;
        else 
            l = mid;
    }
    int len = l;
    for (int i = 0; i <= len; i++) color[i] = 0;
    top.clear();
    for (int i = 0; i <= len; i++) if (!color[i])
        topsort(i);
    
    int arr[len + 1] = {};
    for (int i = 0; i <= len; i++) {
        arr[top[i]] = i;
    }
    cout << len << '\n';
    for (int i = 1; i <= len; i++)
        cout << arr[i] - arr[i - 1] << ' ';
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while (t --> 0) {
        solve();
        cout << '\n';
    }
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 12120 KB Jury has the better answer : jans = 99, pans = 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 12120 KB Jury has the better answer : jans = 11, pans = 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 12124 KB Ok
2 Correct 5 ms 12020 KB Ok
3 Correct 5 ms 12124 KB Ok
4 Incorrect 5 ms 12176 KB Jury has the better answer : jans = 11, pans = 9
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 12124 KB Jury has the better answer : jans = 10, pans = 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 12120 KB Jury has the better answer : jans = 99, pans = 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 12120 KB Jury has the better answer : jans = 99, pans = 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 12120 KB Jury has the better answer : jans = 99, pans = 9
2 Halted 0 ms 0 KB -