oj.uz

답안 #1048246

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048246 2024-08-08T05:59:29 Z European Bad Bitch(#11090) Make them Meet (EGOI24_makethemmeet) C++17
24 / 100
 3 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = array<lint, 2>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define cr(v, n) (v).clear(), (v).resize(n);

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int n;
	cin >> n;
	cout << 6 * n << "\n";
	for (int j = 0; j < 6 * n; j++) {
		vector<int> a(n);
		if (j & 1) {
			a[0] = 0;
			int cnt = 0;
			for (int k = 1; k + 1 < n; k += 2)
				a[k] = a[k + 1] = ++cnt;
			if (n % 2 == 0)
				a[n - 1] = ++cnt;

		} else {
			int cnt = 0;
			for (int k = 0; k + 1 < n; k += 2)
				a[k] = a[k + 1] = ++cnt;
			if (n % 2 == 1)
				a[n - 1] = ++cnt;
		}
		for (int i = 0; i < n; i++)
			cout << a[i] << " ";
		cout << "\n";
	}
}

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB If people start at 0 and 2, then they can avoid each other
3 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 344 KB Output is correct

Subtask #4
0.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB If people start at 0 and 2, then they can avoid each other
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB If people start at 0 and 2, then they can avoid each other
3 Halted 0 ms 0 KB -