oj.uz

답안 #237479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
237479 2020-06-07T00:02:29 Z _7_7_ Nice sequence (IZhO18_sequence) C++14
6 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>                                           
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e5 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;


int t, n, m;
bool ok;
vi v;

void write () {
    printf("%d\n", sz(v));
	for (auto x : v)
		printf("%d ", !ok ? x : -x);
	printf("\n");
}

main () {
	cin >> t;
	while (t--) {
		cin >> n >> m;
		
		ok = 0;
		v.clear();

		if (n < m) {
			swap(n, m); 
			ok = 1;
		}

		if (!(n % m)) {
			for (int i = 0; i < n - 1; ++i)
				v.pb(1);
			write();
			continue;
		}

		if (m == 2) {
			for (int i = 1; i < n; ++i)
				if (i & 1)
					v.pb(-1);
				else
					v.pb(2);
			if (n & 1)
				v.pb(-N);
			write();
			continue;
		}
	}
}

Compilation message

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

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Ok
2 Correct 5 ms 256 KB Ok
3 Correct 5 ms 256 KB Ok
4 Correct 4 ms 384 KB Ok
5 Correct 4 ms 384 KB Ok
6 Correct 4 ms 256 KB Ok
7 Correct 5 ms 256 KB Ok
8 Correct 4 ms 256 KB Ok
9 Correct 4 ms 256 KB Ok
10 Correct 5 ms 256 KB Ok
11 Correct 4 ms 256 KB Ok
12 Correct 4 ms 256 KB Ok

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 384 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 384 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Ok
2 Correct 5 ms 256 KB Ok
3 Correct 5 ms 256 KB Ok
4 Correct 4 ms 384 KB Ok
5 Correct 4 ms 384 KB Ok
6 Correct 4 ms 256 KB Ok
7 Correct 5 ms 256 KB Ok
8 Correct 4 ms 256 KB Ok
9 Correct 4 ms 256 KB Ok
10 Correct 5 ms 256 KB Ok
11 Correct 4 ms 256 KB Ok
12 Correct 4 ms 256 KB Ok
13 Incorrect 4 ms 384 KB there is incorrect sequence
14 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Ok
2 Correct 5 ms 256 KB Ok
3 Correct 5 ms 256 KB Ok
4 Correct 4 ms 384 KB Ok
5 Correct 4 ms 384 KB Ok
6 Correct 4 ms 256 KB Ok
7 Correct 5 ms 256 KB Ok
8 Correct 4 ms 256 KB Ok
9 Correct 4 ms 256 KB Ok
10 Correct 5 ms 256 KB Ok
11 Correct 4 ms 256 KB Ok
12 Correct 4 ms 256 KB Ok
13 Incorrect 5 ms 384 KB there is incorrect sequence
14 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Ok
2 Correct 5 ms 256 KB Ok
3 Correct 5 ms 256 KB Ok
4 Correct 4 ms 384 KB Ok
5 Correct 4 ms 384 KB Ok
6 Correct 4 ms 256 KB Ok
7 Correct 5 ms 256 KB Ok
8 Correct 4 ms 256 KB Ok
9 Correct 4 ms 256 KB Ok
10 Correct 5 ms 256 KB Ok
11 Correct 4 ms 256 KB Ok
12 Correct 4 ms 256 KB Ok
13 Incorrect 5 ms 384 KB there is incorrect sequence
14 Halted 0 ms 0 KB -