oj.uz

답안 #1114095

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114095 2024-11-18T07:44:21 Z vjudge1 Nice sequence (IZhO18_sequence) C++17
0 / 100
 1 ms 504 KB 
#include <bits/stdc++.h>

using i64 = long long;

#ifdef DEBUG 
    #include "/home/ahmetalp/Desktop/Workplace/debug.h"
#else
    #define debug(...) void(23)
#endif

constexpr int INF = int(1E8);

void print(bool s, std::vector<int> x) {
    int n = int(x.size());
    std::cout << n << '\n';
    for (int i = 0; i < n; ++i) {
        std::cout << (s ? -1 : +1) * x[i] << " \n"[i == n - 1];
    }
}

void solve() {
    int N, M;
    std::cin >> N >> M;

    bool swapped = false;
    if (N < M) {
        swapped = true;
        std::swap(N, M);
    }

    if (M == 1) {
        std::vector<int> p(N - 1);
        for (int i = 0; i < N - 1; ++i) {
            p[i] = 1;
        }
        print(swapped, p);
    } else {
        int len = 2 * M - 1;
        std::vector<int> p(len);
        p[0] = -INF;
        for (int i = 1; i < M - 1; ++i) {
            p[i] = -1;
        }
        p[M - 1] = INF + M - 1;
        for (int i = M; i < len; ++i) {
            p[i] = p[i % M];
        }
        print(swapped, p);
    }
    
    return;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int TT = 1; std::cin >> TT;
    for (int i = 1; i <= TT; ++i) {
        solve();
    }

    return 0;
}

Subtask #1
0 / 6.0

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

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

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

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 504 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 24.0

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