제출 #1231230

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1231230		damamila	Navigation 2 (JOI21_navigation2)	C++20	0 / 100	6 ms	816 KiB

Anna

#include "Anna.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

namespace {


} // namespace

void Anna(int N, int K, std::vector<int> R, std::vector<int> C) {
	int field [105][105];
	for (int r = 0; r < N; r++) {
		for (int c = 0; c < N; c++) {
			field[r][c] = 0;
			for (int i = 0; i < K; i++) {
				int base = 1;
				for (int j = 0; j < i; j++) base = base*5;
				if (r < R[i]) field[r][c] += 2*base;
				else if (r > R[i]) field[r][c] += 3*base;
				else if (c < C[i]) field[r][c] += 0*base;
				else if (c > C[i]) field[r][c] += 1*base;
				else field[r][c] += 4*base;
				//~ cerr << field[r][c]/base << " ";
			}
			//~ cerr << endl;
		}
		//~ cerr << endl;
	}
	for (int r = 0; r < N; r++) {
		for (int c = 0; c < N; c++) {
			SetFlag(r, c, field[r][c]);
			//~ cerr << field[r][c] << " ";
		}
		//~ cerr << endl;
	}
}

Bruno

#include "Bruno.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

namespace {

//~ int variable_example = 1;

} // namespace

std::vector<int> Bruno(int K, std::vector<int> value) {
	vector<int> res(K, 0);
	int flag = value[4];
	for (int i = 0; i < K; i++) {
		res[i] = flag%5;
		flag /= 5;
		//~ cerr << flag << " " << res[i] << endl;
	}
	return res;
}

• Subtask 1: 0 / 100