답안 #342143

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
342143	2021-01-01T13:05:19 Z	maskoff	Nice sequence (IZhO18_sequence)	C++14	15 / 100	2000 ms	876 KB

sequence

#include <bits/stdc++.h>

#define file ""

#define all(x) x.begin(), x.end()

#define sc second
#define fr first

#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const ll inf = 1e18 + 5;
const ll mod = 1e9 + 7;

const int N = 1e6 + 5;

int dx[] = {+1, 0, -1, 0};
int dy[] = {0, +1, 0, -1};

int n, m;

void solve1() {
 	cout << max(n, m) - 1 << endl;
 	for (int i = 1; i < max(n, m); i++) 
 		cout << (min(n, m) == n ? -1 : 1) << " ";
	cout << endl;
}

void solve2() {
	cout << max(n, m) << endl;
	cout << (n == 2 ? 1 : -1) * (max(n, m) / 2 + 1) << " ";
 	for (int i = 1; i <= max(n, m) / 2; i++) 
 		if (n == 2) cout << "-1000000 999999 ";
 		else cout << "1000000 -999999 ";
	cout << endl;
}

bool solve3(vector<int> a) {
	if (a.size() == max(n, m)) {
	 	for (int i = 0; i < a.size(); i++) {
	 		ll sum = 0;
	 		if (i + n - 1 >= a.size()) continue;
	 		int cnt = n;
	 		for (int j = i; cnt > 0; j++, cnt--) sum += a[j];
	 		if (sum >= 0) return 0;
	 	}
	 	for (int i = 0; i < a.size(); i++) {
	 		ll sum = 0;
	 		if (i + m - 1 >= a.size()) continue;
	 		int cnt = m;
	 		for (int j = i; cnt > 0; j++, cnt--) sum += a[j];
	 		if (sum <= 0) return 0;
	 	}
	 	for (int to : a) cout << to << " ";
	 	cout << endl;
		return 1;
	}
	for (int i = -5; i <= 5; i++) {
	 	a.pb(i);
	 	if (solve3(a)) return 1;
	 	a.pop_back();
	}
	return 0;
}


void solve() {
 	cin >> n >> m;
 	vector<int> just;
 	if (max(n, m) % min(n, m) == 0) {solve1(); return;}
 	if (min(n, m) == 2) {solve2(); return;}
 	if (max(n, m) <= 10) {solve3(just); return;}
}

int main() {   
	ios_base :: sync_with_stdio(false);               
	cin.tie(nullptr);
	srand(time(nullptr));
	int t;
	cin >> t;
	while (t--) solve();
  return 0;
}

Compilation message

sequence.cpp: In function 'bool solve3(std::vector<int>)':
sequence.cpp:45:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'const int' [-Wsign-compare]
   45 |  if (a.size() == max(n, m)) {
      |      ~~~~~~~~~^~~~~~~~~~~~
sequence.cpp:46:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |    for (int i = 0; i < a.size(); i++) {
      |                    ~~^~~~~~~~~~
sequence.cpp:48:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     if (i + n - 1 >= a.size()) continue;
      |         ~~~~~~~~~~^~~~~~~~~~~
sequence.cpp:53:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |    for (int i = 0; i < a.size(); i++) {
      |                    ~~^~~~~~~~~~
sequence.cpp:55:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     if (i + m - 1 >= a.size()) continue;
      |         ~~~~~~~~~~^~~~~~~~~~~

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	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	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

#	결과	실행 시간	메모리	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	2 ms	384 KB	Ok
7	Correct	5 ms	748 KB	Ok
8	Correct	3 ms	492 KB	Ok
9	Correct	6 ms	876 KB	Ok
10	Correct	4 ms	620 KB	Ok

Subtask #3
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Ok
2	Correct	1 ms	364 KB	Ok
3	Correct	1 ms	364 KB	Ok
4	Execution timed out	2081 ms	364 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2051 ms	364 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 14.0

#	결과	실행 시간	메모리	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	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	Execution timed out	2081 ms	364 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #6
0 / 18.0

#	결과	실행 시간	메모리	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	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	2 ms	384 KB	Ok
19	Correct	5 ms	748 KB	Ok
20	Correct	3 ms	492 KB	Ok
21	Correct	6 ms	876 KB	Ok
22	Correct	4 ms	620 KB	Ok
23	Correct	1 ms	364 KB	Ok
24	Correct	1 ms	364 KB	Ok
25	Correct	1 ms	364 KB	Ok
26	Execution timed out	2081 ms	364 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

Subtask #7
0 / 24.0

#	결과	실행 시간	메모리	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	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	2 ms	384 KB	Ok
19	Correct	5 ms	748 KB	Ok
20	Correct	3 ms	492 KB	Ok
21	Correct	6 ms	876 KB	Ok
22	Correct	4 ms	620 KB	Ok
23	Correct	1 ms	364 KB	Ok
24	Correct	1 ms	364 KB	Ok
25	Correct	1 ms	364 KB	Ok
26	Execution timed out	2081 ms	364 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

답안 #342143

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 9.0 / 9.0

Subtask #3 0 / 14.0

Subtask #4 0 / 15.0

Subtask #5 0 / 14.0

Subtask #6 0 / 18.0

Subtask #7 0 / 24.0

Subtask #1
6.0 / 6.0

Subtask #2
9.0 / 9.0

Subtask #3
0 / 14.0

Subtask #4
0 / 15.0

Subtask #5
0 / 14.0

Subtask #6
0 / 18.0

Subtask #7
0 / 24.0