Submission #2401307
Source Code Expand
/* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
// container library
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
/* ---------- Namespace ---------- */
using namespace std;
/* ---------- Type Abbreviation ---------- */
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
using ll = long long;
using PL = P<ll, ll>;
using PS = P<string, ll>;
using VI = V<int>;
using VVI = V<VI>;
using VL = V<ll>;
using VVL = V<VL>;
using VS = V<string>;
using VB = V<bool>;
using VVB = V<VB>;
using VPL = V<PL>;
using VPS = V<PS>;
#define fst first
#define snd second
/* ---------- conversion ---------- */
#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
/* ---------- container ---------- */
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define GSORT(c) sort(ALL(c), greater<decltype((c).front())>())
#define SZ(x) (LL((x).size()))
/* ---------- repetition ---------- */
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (ll i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
// Usual REP runs from 0 to n-1 (R: n to 0)
// Natural REP runs from 1 to n (R: n to 1)
/* ---------- Constants ---------- */
// const ll MOD = 1e9 + 7;
// const int INF = 1 << 25;
const ll INF = 1LL << 50;
// const ll dx[4] = {0, -1, 1, 0};
// const ll dy[4] = {-1, 0, 0, 1};
// const ll dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
// const ll dy[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
/* ---------- Debug ---------- */
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;
template <typename T>
void testVector(T& v) {
REP(i, SZ(v)) {
cout << i << ":" << v << endl;
}
}
/* ^^^^^^^^^^^^^^^ Settting Part ^^^^^^^^^^^^^^^ */
/* ---------- Variances ---------- */
VVL b(2, VL(3)), c(3, VL(2));
/* ---------- Functions ---------- */
PL calc_score(int turn, VS board) {
if (turn == 10) {
ll dai = 0, ko = 0;
REP(i, 2) {
REP(j, 3) {
if (board[i][j] == board[i + 1][j]) {
dai += b[i][j];
} else {
ko += b[i][j];
}
}
}
REP(i, 3) {
REP(j, 2) {
if (board[i][j] == board[i][j + 1]) {
dai += c[i][j];
} else {
ko += c[i][j];
}
}
}
return {dai, ko};
}
char mark = (turn % 2 == 0 ? 'x' : 'o');
PL best = {-INF, -INF};
REP(i, 3) {
REP(j, 3) {
if (board[i][j] == '.') {
board[i][j] = mark;
PL score = calc_score(turn + 1, board);
if (mark == 'o' && (score.fst >= best.fst)) {
best = score;
} else if (mark == 'x' && (score.snd >= best.snd)) {
best = score;
}
board[i][j] = '.';
}
}
}
return best;
}
/* ---------- Main Function ---------- */
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
REP(i, 2) {
REP(j, 3) {
cin >> b[i][j];
}
}
REP(i, 3) {
REP(j, 2) {
cin >> c[i][j];
}
}
VS firstboard(3, "...");
PL ans = calc_score(1, firstboard);
cout << ans.fst << endl;
cout << ans.snd << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 双子と○×ゲーム |
User |
Tiramister |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
3771 Byte |
Status |
AC |
Exec Time |
252 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample-01.txt, sample-02.txt |
All |
sample-01.txt, sample-02.txt, test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt, sample-01.txt, sample-02.txt |
Case Name |
Status |
Exec Time |
Memory |
sample-01.txt |
AC |
251 ms |
256 KB |
sample-02.txt |
AC |
239 ms |
256 KB |
test-01.txt |
AC |
236 ms |
256 KB |
test-02.txt |
AC |
251 ms |
256 KB |
test-03.txt |
AC |
238 ms |
256 KB |
test-04.txt |
AC |
237 ms |
256 KB |
test-05.txt |
AC |
251 ms |
256 KB |
test-06.txt |
AC |
238 ms |
256 KB |
test-07.txt |
AC |
236 ms |
256 KB |
test-08.txt |
AC |
237 ms |
256 KB |
test-09.txt |
AC |
252 ms |
256 KB |
test-10.txt |
AC |
239 ms |
256 KB |
test-11.txt |
AC |
238 ms |
256 KB |
test-12.txt |
AC |
237 ms |
256 KB |
test-13.txt |
AC |
237 ms |
256 KB |
test-14.txt |
AC |
252 ms |
256 KB |
test-15.txt |
AC |
236 ms |
256 KB |
test-16.txt |
AC |
239 ms |
256 KB |
test-17.txt |
AC |
236 ms |
256 KB |
test-18.txt |
AC |
237 ms |
256 KB |
test-19.txt |
AC |
238 ms |
256 KB |
test-20.txt |
AC |
251 ms |
256 KB |