京都大学プログラミングコンテスト2015

Submission #1590382

Source codeソースコード

// need
#include <iostream>
#include <algorithm>

// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
//#include <tuple>
//#include <unordered_map>
#include <unordered_set>
#include <complex>
//#include <deque>
#include<valarray>

// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
#include <fstream>

// etc
#include <cmath>
#include <cassert>
#include <functional>
#include <iomanip>
//#include <typeinfo>
#include <chrono>
#include <random>
#include <numeric>


#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n"; }

template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")";
	return os;
}

#define int ll
using ll = long long;
using ull = unsigned long long;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;

int dy16[] = { -2,-2,-2,-1,-1,-1,0,0,0,0,1,1,1,2,2,2 };
int dx16[] = { -2,0,2,-1,0,1,-2,-1,1,2,-1,0,1,-2,0,2 };
int dy3[] = { -1,0,1 };

signed main() {
	INIT;
	OUT("..C.......")BR;
	OUT("..........")BR;
	OUT("..........")BR;
	OUT("..........")BR;
	OUT("..........")BR;
	OUT("....C.....")BR;
	OUT("..........")BR;
	OUT("C........C")BR;
	OUT("..........")BR;
	OUT("..........")BR;
	return 0;

	// 以下探索に使用したコード

	int n = 10;
	REP(i1, n) REP(j1, n) {
		PAIR p1(i1, j1);
		REP(i2, n) REP(j2, n) {
			PAIR p2(i2, j2);
			if (p1 == p2) continue;
			REP(i3, n) REP(j3, n) {
				PAIR p3(i3, j3);
				if (p1 == p3 || p2 == p3) continue;
				REP(i4, n) REP(j4, n) {
					PAIR p4(i4, j4);
					if (p1 == p4 || p2 == p4 || p3 == p4) continue;
					std::vector<std::vector<bool>> a(n, std::vector<bool>(n, true));
					auto f = [&](int i, int j) {
						a[i][j] = false;
						REP(d, 16) {
							int dy = i + dy16[d];
							int dx = j + dx16[d];
							if (!IN(0, dy, n) || !IN(0, dx, n)) continue;
							a[dy][dx] = false;
						}
					};
					f(i1, j1);
					f(i2, j2);
					f(i3, j3);
					f(i4, j4);
					std::vector<std::vector<int>> dp(n, std::vector<int>(n, 0));
					REP(i, n) dp[i][0] = a[i][0];
					REP(j, n - 1) REP(i, n) {
						if (dp[i][j] == 0) continue;
						REP(d, 3) {
							int dy = i + dy3[d];
							if (!IN(0, dy, n)) continue;
							if (!a[dy][j + 1]) continue;
							dp[dy][j + 1] += dp[i][j];
						}
					}
					int sum = 0;
					REP(i, n) sum += dp[i][n - 1];
					if (sum == 1) {
						REP(i, n) {
							REP(j, n) {
								PAIR p(i, j);
								if (p == p1 || p == p2 || p == p3 || p == p4) {
									OUT('C');
								}
								else {
									OUT('.');
								}
							}BR;
						}
						return 0;
					}
				}
			}
		}
	}
	return 0;
}

Submission

Task問題 B - GUARDIANS
User nameユーザ名 satanic0258
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 6449 Byte
File nameファイル名
Exec time実行時間 1 ms
Memory usageメモリ使用量 256 KB

Test case

Set

Set name Score得点 / Max score Cases
All 100 / 100 dummy.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
dummy.txt AC 1 ms 256 KB