# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
334895 | 2020-12-10T07:16:18 Z | beksultan04 | Nice sequence (IZhO18_sequence) | C++14 | 1 ms | 364 KB |
#include <bits/stdc++.h> using namespace std; #define int long long #define pii pair<int,int> #define OK puts("OK"); #define fr first #define sc second #define ret return #define scan1(a) scanf("%lld",&a); #define scan2(a,b) scanf("%lld %lld",&a, &b); #define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c); #define all(s) s.begin(),s.end() #define pb push_back #define endi puts(""); const int N = 1e6+12,INF=1e9+7; main(){ int t; scan1(t) while (t--){ int n,m,i,mx,mn; scan2(n,m) mx = max(m,n); mn = min(m,n); if (m == 2){ cout <<n<<"\n"; for (i=0;i<n;++i){ if (i%2 == 0)cout <<"-199999999 "; else cout <<"200000000 "; } } else if (n == 2){ cout <<m<<"\n"; for (i=0;i<m;++i){ if (i%2 == 0)cout <<"199999999 "; else cout <<"-200000000 "; } } else { cout <<mx-1<<"\n"; if (n > m){ for (i=1;i<n;++i)cout <<"1 "; endi; } else { for (i=1;i<m;++i)cout <<"-1 "; endi; } } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Ok |
2 | Correct | 1 ms | 364 KB | Ok |
3 | Correct | 0 ms | 364 KB | Ok |
4 | Correct | 1 ms | 364 KB | Ok |
5 | Correct | 1 ms | 364 KB | Ok |
6 | Correct | 1 ms | 364 KB | Ok |
7 | Correct | 1 ms | 364 KB | Ok |
8 | Correct | 1 ms | 364 KB | Ok |
9 | Correct | 1 ms | 364 KB | Ok |
10 | Incorrect | 1 ms | 364 KB | there is incorrect sequence |
11 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | there is incorrect sequence |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Ok |
2 | Correct | 1 ms | 364 KB | Ok |
3 | Incorrect | 1 ms | 364 KB | there is incorrect sequence |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 364 KB | there is incorrect sequence |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Ok |
2 | Correct | 1 ms | 364 KB | Ok |
3 | Correct | 0 ms | 364 KB | Ok |
4 | Correct | 1 ms | 364 KB | Ok |
5 | Correct | 1 ms | 364 KB | Ok |
6 | Correct | 1 ms | 364 KB | Ok |
7 | Correct | 1 ms | 364 KB | Ok |
8 | Correct | 1 ms | 364 KB | Ok |
9 | Correct | 1 ms | 364 KB | Ok |
10 | Incorrect | 1 ms | 364 KB | there is incorrect sequence |
11 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Ok |
2 | Correct | 1 ms | 364 KB | Ok |
3 | Correct | 0 ms | 364 KB | Ok |
4 | Correct | 1 ms | 364 KB | Ok |
5 | Correct | 1 ms | 364 KB | Ok |
6 | Correct | 1 ms | 364 KB | Ok |
7 | Correct | 1 ms | 364 KB | Ok |
8 | Correct | 1 ms | 364 KB | Ok |
9 | Correct | 1 ms | 364 KB | Ok |
10 | Incorrect | 1 ms | 364 KB | there is incorrect sequence |
11 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Ok |
2 | Correct | 1 ms | 364 KB | Ok |
3 | Correct | 0 ms | 364 KB | Ok |
4 | Correct | 1 ms | 364 KB | Ok |
5 | Correct | 1 ms | 364 KB | Ok |
6 | Correct | 1 ms | 364 KB | Ok |
7 | Correct | 1 ms | 364 KB | Ok |
8 | Correct | 1 ms | 364 KB | Ok |
9 | Correct | 1 ms | 364 KB | Ok |
10 | Incorrect | 1 ms | 364 KB | there is incorrect sequence |
11 | Halted | 0 ms | 0 KB | - |