oj.uz

답안 #1089955

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089955 2024-09-17T12:26:25 Z 12345678 Nice sequence (IZhO18_sequence) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=2e5+5;

int n, m, f, _t, res[nx];

void solve()
{
    cin>>n>>m;
    f=n<m;
    if (n==m) return cout<<0<<'\n', void();
    if (n>m) swap(n, m);
    for (int i=1; i<m; i++) res[i]=1;
    if (f) for (int i=1; i<m; i++) res[i]=-1;
    cout<<m-1<<'\n';
    for (int i=1; i<m; i++) cout<<res[i]<<' ';
    cout<<'\n';
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>_t;
    while (_t--) solve();
}

Subtask #1
0 / 6.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 24.0

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