# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1110335 | 2024-11-09T09:21:57 Z | KasymK | Nice sequence (IZhO18_sequence) | C++17 | 7 ms | 848 KB |
#include "bits/stdc++.h" using namespace std; #define ff first #define ss second #define all(v) v.begin(), v.end() #define ll long long #define pb push_back #define pii pair<int, int> #define pli pair<ll, int> #define pll pair<ll, ll> #define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i) #define wr puts("----------------") template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;} template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;} void solve(){ int n, m; scanf("%d%d", &n, &m); int x = max(n,m)-(max(n,m)%2==0); printf("%d\n", x); if(n<m) for(int i = 1; i <= x; i++) printf("%d ", i&1?x:-x-1); else for(int i = 1; i <= x; i++) printf("%d ", i&1?-x:x+1); puts(""); } int main(){ int tt; scanf("%d", &tt); while(tt--) solve(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | there is incorrect sequence |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Ok |
2 | Correct | 1 ms | 336 KB | Ok |
3 | Correct | 1 ms | 336 KB | Ok |
4 | Correct | 1 ms | 336 KB | Ok |
5 | Correct | 1 ms | 336 KB | Ok |
6 | Correct | 2 ms | 336 KB | Ok |
7 | Correct | 6 ms | 848 KB | Ok |
8 | Correct | 4 ms | 592 KB | Ok |
9 | Correct | 7 ms | 848 KB | Ok |
10 | Correct | 4 ms | 592 KB | Ok |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | there is incorrect sequence |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Jury has the better answer : jans = 5, pans = 3 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | there is incorrect sequence |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | there is incorrect sequence |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | there is incorrect sequence |
2 | Halted | 0 ms | 0 KB | - |