oj.uz

Submission #334897

# Submission time Handle Problem Language Result Execution time Memory
334897 2020-12-10T07:17:57 Z beksultan04 Nice sequence (IZhO18_sequence) C++14
15 / 100
 9 ms 1004 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 (n == 1 || m == 1){
            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;
            }
            
        }
        else if (m == 2 && n%m != 0){
            cout <<n<<"\n";
            for (i=0;i<n;++i){
                if (i%2 == 0)cout <<"-199999999 ";
                else cout <<"200000000 ";
            }
        }
        else if (n == 2 && m%n != 0){
            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

sequence.cpp:17:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   17 | main(){
      |      ^
sequence.cpp: In function 'int main()':
sequence.cpp:21:22: warning: variable 'mn' set but not used [-Wunused-but-set-variable]
   21 |         int n,m,i,mx,mn;
      |                      ^~
sequence.cpp:9:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
sequence.cpp:19:5: note: in expansion of macro 'scan1'
   19 |     scan1(t)
      |     ^~~~~
sequence.cpp:10:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 | #define scan2(a,b) scanf("%lld %lld",&a, &b);
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~
sequence.cpp:22:9: note: in expansion of macro 'scan2'
   22 |         scan2(n,m)
      |         ^~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory 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 Correct 1 ms 364 KB Ok
11 Correct 1 ms 364 KB Ok
12 Correct 1 ms 364 KB Ok

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Ok
2 Correct 1 ms 364 KB Ok
3 Correct 1 ms 364 KB Ok
4 Correct 1 ms 364 KB Ok
5 Correct 1 ms 384 KB Ok
6 Correct 1 ms 512 KB Ok
7 Correct 5 ms 876 KB Ok
8 Correct 3 ms 620 KB Ok
9 Correct 9 ms 1004 KB Ok
10 Correct 4 ms 748 KB Ok

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Ok
2 Correct 1 ms 384 KB Ok
3 Correct 1 ms 364 KB Ok
4 Incorrect 0 ms 364 KB Jury has the better answer : jans = 9, pans = 7
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Jury has the better answer : jans = 5, pans = 3
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory 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 Correct 1 ms 364 KB Ok
11 Correct 1 ms 364 KB Ok
12 Correct 1 ms 364 KB Ok
13 Correct 1 ms 364 KB Ok
14 Correct 1 ms 384 KB Ok
15 Correct 1 ms 364 KB Ok
16 Incorrect 0 ms 364 KB Jury has the better answer : jans = 9, pans = 7
17 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory 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 Correct 1 ms 364 KB Ok
11 Correct 1 ms 364 KB Ok
12 Correct 1 ms 364 KB Ok
13 Correct 1 ms 364 KB Ok
14 Correct 1 ms 364 KB Ok
15 Correct 1 ms 364 KB Ok
16 Correct 1 ms 364 KB Ok
17 Correct 1 ms 384 KB Ok
18 Correct 1 ms 512 KB Ok
19 Correct 5 ms 876 KB Ok
20 Correct 3 ms 620 KB Ok
21 Correct 9 ms 1004 KB Ok
22 Correct 4 ms 748 KB Ok
23 Correct 1 ms 364 KB Ok
24 Correct 1 ms 384 KB Ok
25 Correct 1 ms 364 KB Ok
26 Incorrect 0 ms 364 KB Jury has the better answer : jans = 9, pans = 7
27 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory 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 Correct 1 ms 364 KB Ok
11 Correct 1 ms 364 KB Ok
12 Correct 1 ms 364 KB Ok
13 Correct 1 ms 364 KB Ok
14 Correct 1 ms 364 KB Ok
15 Correct 1 ms 364 KB Ok
16 Correct 1 ms 364 KB Ok
17 Correct 1 ms 384 KB Ok
18 Correct 1 ms 512 KB Ok
19 Correct 5 ms 876 KB Ok
20 Correct 3 ms 620 KB Ok
21 Correct 9 ms 1004 KB Ok
22 Correct 4 ms 748 KB Ok
23 Correct 1 ms 364 KB Ok
24 Correct 1 ms 384 KB Ok
25 Correct 1 ms 364 KB Ok
26 Incorrect 0 ms 364 KB Jury has the better answer : jans = 9, pans = 7
27 Halted 0 ms 0 KB -