제출 #495886

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
495886		kingline	Nice sequence (IZhO18_sequence)	C++17	15 / 100	8 ms	716 KiB

sequence

/*#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")*/
#include <bits/stdc++.h>
//#define file(data) freopen(data".in", "r", stdin); freopen(data".out", "w", stdout);
#define pb push_back
#define all(data) data.begin(), data.end()
#define endl '\n'

using namespace std;

const int N = 2e4 + 5;

int t, n, m;

main() {
    //file("pieaters");
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> t;
    while(t--) {
        cin >> n >> m;
        if(max(n, m) % min(n, m) == 0) {
            if(n > m){
                cout << n - 1 << endl;
                for(int i = 1; i < n; i++) {
                    cout << 1 << " ";
                }
            } else {
                cout << m - 1 << endl;
                for(int i = 1; i < m; i++) {
                    cout << -1 << " ";
                }
            }
            cout << endl;
        } else if(min(n, m) == 2 || 1){
            cout << max(n, m) << endl;
            vector < int > v;
            if(n == 2) {
                for(int i = 1; i <= m; i++) {
                    if(i % 2) cout << m - 1 << " ";
                    else cout << -m << " ";
                }
            } else {
                for(int i = 1; i <= n; i++) {
                    if(i % 2 == 0) cout << n + 1 << " ";
                    else cout << -n << " ";
                }
            }
            cout << endl;
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp:18:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   18 | main() {
      | ^~~~

• Subtask 1: 6 / 6
• Subtask 2: 9 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 14
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24