oj.uz

Submission #667320

# Submission time Handle Problem Language Result Execution time Memory
667320 2022-12-01T06:19:50 Z Kalashnikov Nice sequence (IZhO18_sequence) C++17
15 / 100
 25 ms 868 KB 
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 
const int N = 2e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;
 
int n, m;
vector<int> ans;
 
bool ch(int len) {
	int pos = m;
	int neg = -m*(n-1)-1;
	for(int p = 0; p < n; p ++) {
		vector<int> vec;
		int s1=0, s2 = 0 , ok = 1;
		for(int i = 1; i <= len; i ++) {
			if(i%n == p) {
				vec.push_back(neg);
			}
			else {
				vec.push_back(pos);
			}
			s1 += vec.back();
			s2 += vec.back();
			if(vec.size() > n) {
				s1 -= vec.end()[-n-1];
			}
			if(vec.size() > m) {
				s2 -= vec.end()[-m-1];
			}
			if(i >= n && s1 >= 0) {
				ok = 0;
				break;
			}
			if(i >= m && s2 <= 0) {
				ok = 0;
				break;
			}
		}
		if(ok) {
			ans = vec;
			return 1;
		}
	}
	
	neg = -m;
	pos = m*(n-1)-1;
	for(int p = 0; p < n; p ++) {
		vector<int> vec;
		int s1=0, s2 = 0 , ok = 1;
		for(int i = 1; i <= len; i ++) {
			if(i%n == p) {
				vec.push_back(pos);
			}
			else {
				vec.push_back(neg);
			}
			s1 += vec.back();
			s2 += vec.back();
			if(vec.size() > n) {
				s1 -= vec.end()[-n-1];
			}
			if(vec.size() > m) {
				s2 -= vec.end()[-m-1];
			}
			if(i >= n && s1 >= 0) {
				ok = 0;
				break;
			}
			if(i >= m && s2 <= 0) {
				ok = 0;
				break;
			}
		}
		if(ok) {
			ans = vec;
			return 1;
		}
	}
	return 0;
}
 
void solve(int tc) {
	cin >> n >> m;
	int coef = 1;
	if(n > m) {
		swap(n , m);
		coef *= -1;
	}
	if(m % n == 0) {
		cout << m-1 << '\n';
		for(int i = 1; i < m; i ++) {
			cout << (-1)*coef << ' ';
		}	
		cout << '\n';
		// return;c
		return;
	}
	int l = m , r = 2*m;
	while(l <= r) {
		int md = l+r >> 1;
		if(ch(md)) {
			l = md+1;
		}
		else {
			r = md-1;
		}
	}
	cout << ans.size() << '\n';
	for(auto x: ans) {
		cout << x*coef << ' ';
	}
	cout << '\n';
}
/*
8 8 -17 8 8 -17 8 8
-8 15 -8 -8 15 -8 -8 15 -8
*/
main() {
    ios;
    int tt = 1 , tc = 0;
    cin >> tt;
    while(tt --) {
        solve(++tc);
    }
    return 0;
}

Compilation message

sequence.cpp: In function 'bool ch(int)':
sequence.cpp:33:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |    if(vec.size() > n) {
      |       ~~~~~~~~~~~^~~
sequence.cpp:36:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |    if(vec.size() > m) {
      |       ~~~~~~~~~~~^~~
sequence.cpp:68:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   68 |    if(vec.size() > n) {
      |       ~~~~~~~~~~~^~~
sequence.cpp:71:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   71 |    if(vec.size() > m) {
      |       ~~~~~~~~~~~^~~
sequence.cpp: In function 'void solve(int)':
sequence.cpp:109:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  109 |   int md = l+r >> 1;
      |            ~^~
sequence.cpp: At global scope:
sequence.cpp:127:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  127 | main() {
      | ^~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 1 ms 212 KB Ok
3 Correct 0 ms 212 KB Ok
4 Correct 1 ms 212 KB Ok
5 Correct 0 ms 212 KB Ok
6 Correct 0 ms 212 KB Ok
7 Correct 1 ms 212 KB Ok
8 Correct 0 ms 212 KB Ok
9 Correct 1 ms 212 KB Ok
10 Correct 0 ms 212 KB Ok
11 Correct 0 ms 212 KB Ok
12 Correct 0 ms 212 KB Ok

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 0 ms 212 KB Ok
3 Correct 1 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 0 ms 212 KB Ok
6 Correct 4 ms 340 KB Ok
7 Correct 21 ms 820 KB Ok
8 Correct 9 ms 468 KB Ok
9 Correct 25 ms 868 KB Ok
10 Correct 13 ms 672 KB Ok

Subtask #3
0 / 14.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 1 ms 212 KB Ok
3 Correct 0 ms 212 KB Ok
4 Correct 1 ms 212 KB Ok
5 Correct 0 ms 212 KB Ok
6 Correct 0 ms 212 KB Ok
7 Correct 1 ms 212 KB Ok
8 Correct 0 ms 212 KB Ok
9 Correct 1 ms 212 KB Ok
10 Correct 0 ms 212 KB Ok
11 Correct 0 ms 212 KB Ok
12 Correct 0 ms 212 KB Ok
13 Correct 1 ms 212 KB Ok
14 Correct 0 ms 212 KB Ok
15 Correct 0 ms 212 KB Ok
16 Correct 0 ms 212 KB Ok
17 Correct 1 ms 212 KB Ok
18 Incorrect 0 ms 212 KB Jury has the better answer : jans = 11, pans = 10
19 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 1 ms 212 KB Ok
3 Correct 0 ms 212 KB Ok
4 Correct 1 ms 212 KB Ok
5 Correct 0 ms 212 KB Ok
6 Correct 0 ms 212 KB Ok
7 Correct 1 ms 212 KB Ok
8 Correct 0 ms 212 KB Ok
9 Correct 1 ms 212 KB Ok
10 Correct 0 ms 212 KB Ok
11 Correct 0 ms 212 KB Ok
12 Correct 0 ms 212 KB Ok
13 Correct 0 ms 212 KB Ok
14 Correct 0 ms 212 KB Ok
15 Correct 1 ms 212 KB Ok
16 Correct 0 ms 212 KB Ok
17 Correct 0 ms 212 KB Ok
18 Correct 4 ms 340 KB Ok
19 Correct 21 ms 820 KB Ok
20 Correct 9 ms 468 KB Ok
21 Correct 25 ms 868 KB Ok
22 Correct 13 ms 672 KB Ok
23 Correct 1 ms 212 KB Ok
24 Correct 0 ms 212 KB Ok
25 Correct 0 ms 212 KB Ok
26 Correct 0 ms 212 KB Ok
27 Correct 1 ms 212 KB Ok
28 Incorrect 0 ms 212 KB Jury has the better answer : jans = 11, pans = 10
29 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 1 ms 212 KB Ok
3 Correct 0 ms 212 KB Ok
4 Correct 1 ms 212 KB Ok
5 Correct 0 ms 212 KB Ok
6 Correct 0 ms 212 KB Ok
7 Correct 1 ms 212 KB Ok
8 Correct 0 ms 212 KB Ok
9 Correct 1 ms 212 KB Ok
10 Correct 0 ms 212 KB Ok
11 Correct 0 ms 212 KB Ok
12 Correct 0 ms 212 KB Ok
13 Correct 0 ms 212 KB Ok
14 Correct 0 ms 212 KB Ok
15 Correct 1 ms 212 KB Ok
16 Correct 0 ms 212 KB Ok
17 Correct 0 ms 212 KB Ok
18 Correct 4 ms 340 KB Ok
19 Correct 21 ms 820 KB Ok
20 Correct 9 ms 468 KB Ok
21 Correct 25 ms 868 KB Ok
22 Correct 13 ms 672 KB Ok
23 Correct 1 ms 212 KB Ok
24 Correct 0 ms 212 KB Ok
25 Correct 0 ms 212 KB Ok
26 Correct 0 ms 212 KB Ok
27 Correct 1 ms 212 KB Ok
28 Incorrect 0 ms 212 KB Jury has the better answer : jans = 11, pans = 10
29 Halted 0 ms 0 KB -