oj.uz

답안 #1048516

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048516 2024-08-08T08:03:06 Z European Bad Bitch(#11090) Make them Meet (EGOI24_makethemmeet) C++17
10 / 100
 2 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;
	// assume root
	vector<vector<int>> seqs;
	{
		for (int i = 1; i < n; i++) {
			vector<int> a(n);
			a[0] = a[i] = 1;
			seqs.push_back(a);
			seqs.push_back(a);
		}
	}
	// ok it's not..
	for (int i = 1; i < n; i++) {
		vector<int> a(n);
		a[0] = a[i] = 1;
		vector<int> b(n);
		for (int j = 1; j <= i; j++)
			b[j] = 1;
		seqs.push_back(b);
		seqs.push_back(a);
		seqs.push_back(a);
		seqs.push_back(b);
	}
	cout << sz(seqs) << "\n";
	for (auto &v : seqs) {
		for (auto &w : v)
			cout << w << " ";
		cout << "\n";
	}
}

Subtask #1
10.0 / 10.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 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct

Subtask #2
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 0 ms 348 KB If people start at 0 and 2, then they can avoid each other
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 11.0

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

Subtask #4
0.0 / 36.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 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 0 ms 344 KB If people start at 0 and 2, then they can avoid each other
8 Halted 0 ms 0 KB -

Subtask #5
0.0 / 30.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 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 0 ms 348 KB If people start at 0 and 2, then they can avoid each other
10 Halted 0 ms 0 KB -