oj.uz

Submission #1113431

# Submission time Handle Problem Language Result Execution time Memory
1113431 2024-11-16T14:50:45 Z Nonoze Make them Meet (EGOI24_makethemmeet) C++17
0 / 100
 1 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;

#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define cmin(a, b) a=min(a, b)
#define cmax(a, b) a=max(a, b)
#define fi first
#define se second
#define pb push_back
#define mp make_pair

#define int long long

void solve();

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	solve();
	return 0;
}

vector<vector<int>> vec;


void print() {
	cout << sz(vec) << endl;
	for (auto &a: vec) {
		for (auto &u: a) cout << u << ' ';
		cout << endl;
	}
	cout << endl;
}

void add(vector<int> &a) { vec.pb(a); }


int n, m;
vector<int> a;


void solve() {
	cin >> n >> m; a.clear(), a.resize(n, -1);
	int cnt=0;
	for (int i=0; i+1<n; i+=2) {
		a[i]=a[i+1]=cnt++;
	}
	if (n%2) a[n-1]=cnt++;
	for (int i=0; i<n-1; i++) {
		add(a);
		int bk=a.back();
		a.pop_back();
		if (a.back()!=bk) a.insert(a.begin(), bk);
		else a.insert(a.begin(), cnt++);
	}
	cnt=0;
	for (int i=0; i+1<n; i+=2) {
		a[i]=a[i+1]=cnt++;
	}
	if (n%2) a[n-1]=cnt++;
	for (int i=0; i<n-1; i++) {
		add(a);
		int bk=a.back();
		a.pop_back();
		if (a.back()!=bk) a.insert(a.begin(), bk);
		else a.insert(a.begin(), cnt++);
	}
	print();
}

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB If people start at 0 and 2, then they can avoid each other
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Incorrect 1 ms 336 KB If people start at 3 and 4, then they can avoid each other
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Incorrect 1 ms 336 KB If people start at 3 and 4, then they can avoid each other
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB If people start at 0 and 2, then they can avoid each other
3 Halted 0 ms 0 KB -