Submission #495799

#	Time	Username	Problem	Language	Result	Execution time	Memory
495799		Nalrimet	Birthday gift (IZhO18_treearray)	C++17	0 / 100	0 ms	204 KiB

treearray

#include<bits/stdc++.h>

using namespace std;

const int N = 1e4 + 5;
const int inf = 1000000000;

#define int long long
#define F first
#define S second
#define pb push_back
#define ppb pop_back

int t, n, m, sum1, sum2 ;
vector<int> ans, v;

void rec(){
//    if(n % m == 0 && ans.size() == n - 1){
//        return;
//    }
//    if(m % n == 0 && ans.size() == m - 1){
//        return;
//    }
//    cout << ans.size() << '\n';
    if(v.size() >= n){
        if(sum1 >= 0) return;
    }
    if(v.size() >= m){
        if(sum2 <= 0) return;
    }
    if(v.size() > ans.size()){
        ans = v;
    }
    if(v.size() >= n) sum1 -= v[v.size() - n];
    if(v.size() >= m) sum2 -= v[v.size() - m];
    for(int i = -10; i <= 10; ++i){
        sum1 += i;
        sum2 += i;
        v.pb(i);
        rec();
        v.ppb();
        sum1 -= i;
        sum2 -= i;
    }
    if(v.size() >= n) sum1 += v[v.size() - n];
    if(v.size() >= m) sum2 += v[v.size() - m];
}

//1
//6 2
//5
//-9 10 -9 10 -9

//1
//6 3
//5
//-10 1 10 -10 1

//1
//6 4
//7
//-7 -10 8 10 -7 -10 8

//1
//6 5
//9
//-3 -2 -2 -2 10 -3 -2 -2 -2

 main() {

//    ios_base::sync_with_stdio(0);
//    cin.tie(0);
//    cout.tie(0);

    cin >> t;

    while(t--){
        cin >> n >> m;
        if(min(n, m) == 2 && n != m){
            cout << max(n, m) << '\n';
            if(n > m){
                for(int i = 1; i <= n; ++i){
                    if(i % 2) cout << -(N - 1) << ' ';
                    else cout << N << ' ';
                }
            }
            else{
                for(int i = 1; i <= m; ++i){
                    if(i % 2) cout << N - 1 << ' ';
                    else cout << -N << ' ';
                }
            }
            cout << '\n';
            continue;
        }
        if(n > m){
            cout << n - 1 << '\n';
            for(int i = 1; i < n; ++i){
                cout << 1 << ' ';
            }
        }
        else{
            cout << m - 1 << '\n';
            for(int i = 1; i < m; ++i){
                cout << -1 << ' ';
            }
        }
        cout << '\n';
    }

    return 0;

}

Compilation message (stderr)

treearray.cpp: In function 'void rec()':
treearray.cpp:25:17: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   25 |     if(v.size() >= n){
      |        ~~~~~~~~~^~~~
treearray.cpp:28:17: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   28 |     if(v.size() >= m){
      |        ~~~~~~~~~^~~~
treearray.cpp:34:17: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   34 |     if(v.size() >= n) sum1 -= v[v.size() - n];
      |        ~~~~~~~~~^~~~
treearray.cpp:35:17: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   35 |     if(v.size() >= m) sum2 -= v[v.size() - m];
      |        ~~~~~~~~~^~~~
treearray.cpp:45:17: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   45 |     if(v.size() >= n) sum1 += v[v.size() - n];
      |        ~~~~~~~~~^~~~
treearray.cpp:46:17: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   46 |     if(v.size() >= m) sum2 += v[v.size() - m];
      |        ~~~~~~~~~^~~~
treearray.cpp: At global scope:
treearray.cpp:69:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   69 |  main() {
      |  ^~~~

• Subtask 1: 0 / 12
• Subtask 2: 0 / 18
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44