#738819 (C++17) No.1837 Same but Different

• 問題: No.1837 Same but Different
• ユーザー: kwm_t
• 提出日時: 2022-02-12 10:34:57
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 3 ms / 2,000 ms
• コード長: 1,508 bytes
• コンパイル時間: 2,485 ms
• コンパイル使用メモリ: 202,264 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-28 12:28:02
• 合計ジャッジ時間: 3,726 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	3 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	3 ms; 5,376 KB
testcase_11	AC	3 ms; 5,376 KB
testcase_12	AC	3 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	2 ms; 5,376 KB
testcase_21	AC	3 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB
testcase_23	AC	2 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n), b(n);
	rep(i, n) {
		a[i] = i * 3;
		b[i] = i * 3 + 7;
	}
	if (1 == n % 3) {
		a[0]++;
	}
	else if (2 == n % 3) {
		a[0]++;
		a[1]++;
	}
	int diff = 0;
	rep(i, n)diff += b[i] - a[i];
	int last = 9999;
	rrep(i, n) {
		if (0 == diff)break;
		long long x = min(diff, (((last - 1) - a[i]) / 3) * 3);
		diff -= x;
		a[i] += x;
		last = a[i];
	}
	long long suma = 0;
	rep(i, n)suma += a[i];
	long long sumb = 0;
	rep(i, n)sumb += b[i];
	//cout << suma << " " << sumb << endl;
	rep(i, n)cout << a[i] << " ";
	cout << endl;
	rep(i, n)cout << b[i] << " ";
	cout << endl;
	return 0;
}