Submission #1693248
Source Code Expand
/**
*
*/
// #include {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#ifdef DEBUG
#include <fmt/format.h>
#include <fmt/ostream.h>
#endif
using namespace std;
// }}}
// type {{{
using s8 = int8_t;
using u8 = uint8_t;
using s16 = int16_t;
using u16 = uint16_t;
using s32 = int32_t;
using u32 = uint32_t;
using s64 = int64_t;
using u64 = uint64_t;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;
template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
// }}}
// hide {{{
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wunused-const-variable"
#endif
// }}}
// 適宜調整
//#define int s64
constexpr bool AUTOFLUSH = false;
constexpr bool STDIO_ENABLE = false;
constexpr int IOS_PREC = 10;
constexpr int INF_S32 = 1'010'000'000;
constexpr s64 INF_S64 = 1'010'000'000'000'000'000LL;
constexpr auto INF = INF_S64;
constexpr double EPS = 1e-9;
constexpr s64 MOD = 1'000'000'007;
// hide {{{
#ifdef __clang__
#pragma clang diagnostic pop
#endif
// }}}
// util {{{
template<typename T>
constexpr bool is_odd(T x)
{
return x % 2 == 1;
}
template<typename T>
constexpr bool is_even(T x)
{
return x % 2 == 0;
}
template<typename T>
constexpr int cmp(T x, T y)
{
return (x > y) - (x < y);
}
template<typename T>
constexpr int sgn(T x)
{
return cmp(x, T(0));
}
template<typename T>
constexpr typename enable_if<is_signed<T>::value,T>::type modulo(T a, T b)
{
assert(b > 0);
T r = a % b;
return r >= 0 ? r : r+b;
}
template<typename T>
constexpr T clamp(T x, T lo, T hi)
{
assert(lo <= hi);
if(x < lo)
return lo;
else if(x > hi)
return hi;
else
return x;
}
int sqrti(int x)
{
assert(x >= 0);
return static_cast<int>(sqrt(x));
}
s64 sqrtl(s64 x)
{
assert(x >= 0);
return static_cast<s64>(sqrt(x));
}
template<typename T>
bool chmax(T& xmax, const T& x)
{
if(x > xmax) {
xmax = x;
return true;
}
else {
return false;
}
}
template<typename T>
bool chmin(T& xmin, const T& x)
{
if(x < xmin) {
xmin = x;
return true;
}
else {
return false;
}
}
template<typename T>
constexpr int SIZE(const T& c)
{
return static_cast<int>(c.size());
}
template<typename T, size_t N>
constexpr int SIZE(const T (&)[N])
{
return static_cast<int>(N);
}
template<typename InputIt, typename T>
int argfind(InputIt first, InputIt last, const T& x)
{
auto it = find(first, last, x);
return distance(first, it);
}
template<typename InputIt>
int argmax(InputIt first, InputIt last)
{
auto it = max_element(first, last);
return distance(first, it);
}
template<typename InputIt>
int argmin(InputIt first, InputIt last)
{
auto it = min_element(first, last);
return distance(first, it);
}
template<typename InputIt>
bool alltrue(InputIt first, InputIt last)
{
return all_of(first, last, [](bool b) { return b; });
}
template<typename InputIt>
bool anytrue(InputIt first, InputIt last)
{
return any_of(first, last, [](bool b) { return b; });
}
template<typename InputIt>
bool allfalse(InputIt first, InputIt last)
{
return !anytrue(first, last);
}
template<typename InputIt>
bool anyfalse(InputIt first, InputIt last)
{
return !alltrue(first, last);
}
struct pairhash {
template<typename T1, typename T2>
size_t operator()(const pair<T1,T2>& p) const
{
size_t ans = 17;
ans = 31*ans + hash<T1>()(p.first);
ans = 31*ans + hash<T2>()(p.second);
return ans;
}
};
template<typename K, typename V>
pair<typename map<K,V>::iterator, bool> insert_or_assign(map<K,V>& m, const K& k, const V& v)
{
auto it = m.lower_bound(k);
if(it != end(m) && !m.key_comp()(k,it->first)) {
it->second = v;
return make_pair(it, false);
}
else {
auto it_ins = m.insert(it, make_pair(k,v));
return make_pair(it_ins, true);
}
}
template<typename K, typename V>
pair<typename unordered_map<K,V>::iterator, bool>
insert_or_assign(unordered_map<K,V>& m, const K& k, const V& v)
{
auto it = m.find(k);
if(it != end(m)) {
it->second = v;
return make_pair(it, false);
}
else {
auto it_ins = m.insert(it, make_pair(k,v));
return make_pair(it_ins, true);
}
}
template<typename T>
string TO_STRING(const T& x)
{
ostringstream out;
out << x;
return out.str();
}
template<typename InputIt>
string JOIN(InputIt first, InputIt last, const string& sep)
{
ostringstream out;
while(first != last) {
out << *first++;
if(first != last)
out << sep;
}
return out.str();
}
template<typename InputIt>
auto SUM(InputIt first, InputIt last)
{
using T = typename iterator_traits<InputIt>::value_type;
return accumulate(first, last, T());
}
template<typename T>
void UNIQ(T& c)
{
c.erase(unique(begin(c), end(c)), end(c));
}
template<typename T, typename C>
T POP(stack<T,C>& stk)
{
T x = stk.top(); stk.pop();
return x;
}
template<typename T, typename C>
T POP(queue<T,C>& que)
{
T x = que.front(); que.pop();
return x;
}
template<typename T, typename Cont, typename Cmp>
T POP(priority_queue<T,Cont,Cmp>& que)
{
T x = que.top(); que.pop();
return x;
}
template<typename T>
void RD(T& x)
{
cin >> x;
#ifdef DEBUG
if(!cin) assert(false);
#endif
}
// 出力 {{{
// FPRINTSEQ {{{
template<typename InputIt>
ostream& FPRINTSEQ(ostream& out, InputIt first, InputIt last)
{
for(InputIt it = first; it != last; ++it) {
if(it != first) out << ' ';
out << *it;
}
return out;
}
template<typename InputIt>
ostream& PRINTSEQ(InputIt first, InputIt last)
{
return FPRINTSEQ(cout, first, last);
}
template<typename InputIt>
ostream& DPRINTSEQ(InputIt first, InputIt last)
{
return FPRINTSEQ(cerr, first, last);
}
// }}}
// 1次元生配列 {{{
template<typename T, size_t N>
ostream& FPRINTARRAY1(ostream& out, const T (&c)[N])
{
return FPRINTSEQ(out, cbegin(c), cend(c));
}
template<typename T, size_t N>
ostream& PRINTARRAY1(const T (&c)[N])
{
return FPRINTARRAY1(cout, c);
}
template<typename T, size_t N>
ostream& DPRINTARRAY1(const T (&c)[N])
{
return FPRINTARRAY1(cerr, c);
}
// }}}
// 2次元生配列 {{{
template<typename T, size_t N1, size_t N2>
ostream& FPRINTARRAY2(ostream& out, const T (&c)[N1][N2])
{
out << '\n';
for(const auto& e : c) {
FPRINTARRAY1(out, e) << '\n';
}
return out;
}
template<typename T, size_t N1, size_t N2>
ostream& PRINTARRAY2(const T (&c)[N1][N2])
{
return FPRINTARRAY2(cout, c);
}
template<typename T, size_t N1, size_t N2>
ostream& DPRINTARRAY2(const T (&c)[N1][N2])
{
return FPRINTARRAY2(cerr, c);
}
// }}}
// 非mapコンテナ {{{
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& c)
{
return FPRINTSEQ(out, cbegin(c), cend(c));
}
// 特別扱い
template<typename T>
ostream& operator<<(ostream& out, const vector<vector<T>>& c)
{
out << '\n';
for(const auto& e : c) {
out << e << '\n';
}
return out;
}
// 特別扱い
ostream& operator<<(ostream& out, const vector<string>& c)
{
out << '\n';
for(const string& e : c) {
out << e << '\n';
}
return out;
}
template<typename T>
ostream& operator<<(ostream& out, const deque<T>& c)
{
return FPRINTSEQ(out, cbegin(c), cend(c));
}
template<typename T>
ostream& operator<<(ostream& out, const list<T>& c)
{
return FPRINTSEQ(out, cbegin(c), cend(c));
}
template<typename T>
ostream& operator<<(ostream& out, const forward_list<T>& c)
{
return FPRINTSEQ(out, cbegin(c), cend(c));
}
template<typename T>
ostream& operator<<(ostream& out, const set<T>& c)
{
return FPRINTSEQ(out, cbegin(c), cend(c));
}
template<typename T>
ostream& operator<<(ostream& out, const unordered_set<T>& c)
{
return out << set<T>(cbegin(c), cend(c));
}
template<typename T>
ostream& operator<<(ostream& out, const multiset<T>& c)
{
return FPRINTSEQ(out, cbegin(c), cend(c));
}
template<typename T>
ostream& operator<<(ostream& out, const unordered_multiset<T>& c)
{
return out << multiset<T>(cbegin(c), cend(c));
}
template<typename T, size_t N>
ostream& operator<<(ostream& out, const array<T,N>& c)
{
return FPRINTSEQ(out, cbegin(c), cend(c));
}
// }}}
// mapコンテナ {{{
template<typename InputIt>
ostream& FPRINTMAP(ostream& out, InputIt first, InputIt last)
{
out << "{\n";
for(auto it = first; it != last; ++it) {
out << " " << it->first << " : " << it->second << '\n';
}
out << "}\n";
return out;
}
template<typename InputIt>
ostream& PRINTMAP(InputIt first, InputIt last)
{
return FPRINTMAP(cout, first, last);
}
template<typename InputIt>
ostream& DPRINTMAP(InputIt first, InputIt last)
{
return FPRINTMAP(cerr, first, last);
}
template<typename K, typename V>
ostream& operator<<(ostream& out, const map<K,V>& c)
{
return FPRINTMAP(out, cbegin(c), cend(c));
}
template<typename K, typename V>
ostream& operator<<(ostream& out, const unordered_map<K,V>& c)
{
return out << map<K,V>(cbegin(c), cend(c));
}
template<typename K, typename V>
ostream& operator<<(ostream& out, const multimap<K,V>& c)
{
return FPRINTMAP(out, cbegin(c), cend(c));
}
template<typename K, typename V>
ostream& operator<<(ostream& out, const unordered_multimap<K,V>& c)
{
return out << multimap<K,V>(cbegin(c), cend(c));
}
// }}}
// stack/queue/priority_queue {{{
template<typename T, typename C>
ostream& operator<<(ostream& out, stack<T,C> c)
{
while(!c.empty()) {
out << c.top();
c.pop();
if(!c.empty()) out << ' ';
}
return out;
}
template<typename T, typename C>
ostream& operator<<(ostream& out, queue<T,C> c)
{
while(!c.empty()) {
out << c.front();
c.pop();
if(!c.empty()) out << ' ';
}
return out;
}
template<typename T, typename Cont, typename Cmp>
ostream& operator<<(ostream& out, priority_queue<T,Cont,Cmp> c)
{
while(!c.empty()) {
out << c.top();
c.pop();
if(!c.empty()) out << ' ';
}
return out;
}
// }}}
// pair/tuple {{{
template<typename T1, typename T2>
ostream& operator<<(ostream& out, const pair<T1,T2>& p)
{
return out << '(' << p.first << ',' << p.second << ')';
}
template<typename Tuple, size_t Pos>
ostream& FPRINTTUPLE(ostream& out, const Tuple&)
{
return out;
}
template<typename Tuple, size_t Pos, typename T, typename... TS>
ostream& FPRINTTUPLE(ostream& out, const Tuple& t)
{
if(Pos != 0)
out << ',';
out << get<Pos>(t);
return FPRINTTUPLE<Tuple,Pos+1,TS...>(out, t);
}
template<typename... TS>
ostream& operator<<(ostream& out, const tuple<TS...>& t)
{
out << '(';
FPRINTTUPLE<tuple<TS...>,0,TS...>(out, t);
out << ')';
return out;
}
// }}}
// PRINT {{{
ostream& FPRINT(ostream& out) { return out; }
template<typename T, typename... TS>
ostream& FPRINT(ostream& out, const T& x, const TS& ...args)
{
out << x;
if(sizeof...(args))
out << ' ';
return FPRINT(out, args...);
}
template<typename... TS>
ostream& FPRINTLN(ostream& out, const TS& ...args)
{
FPRINT(out, args...);
return out << '\n';
}
template<typename... TS>
ostream& PRINT(const TS& ...args)
{
return FPRINT(cout, args...);
}
template<typename... TS>
ostream& PRINTLN(const TS& ...args)
{
return FPRINTLN(cout, args...);
}
template<typename... TS>
ostream& DPRINT(const TS& ...args)
{
return FPRINT(cerr, args...);
}
template<typename... TS>
ostream& DPRINTLN(const TS& ...args)
{
return FPRINTLN(cerr, args...);
}
// }}}
// }}}
void FLUSH()
{
if(STDIO_ENABLE)
fflush(stdout);
else
cout.flush();
}
[[noreturn]] void EXIT()
{
#ifdef DEBUG
fflush(stdout);
fflush(stderr);
cout.flush();
cerr.flush();
#else
FLUSH();
#endif
//quick_exit(0); // does not work on codeforces
_Exit(0);
}
struct IoInit {
IoInit()
{
#ifndef DEBUG
cin.tie(nullptr);
if(!STDIO_ENABLE)
ios::sync_with_stdio(false);
#endif
cout << fixed << setprecision(IOS_PREC);
if(AUTOFLUSH) {
if(STDIO_ENABLE)
setvbuf(stdout, nullptr, _IONBF, 0);
cout << unitbuf;
}
}
} IOINIT;
#define FOR(i, start, end) for(s64 i = (start); i < (end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(f,c,...) (([&](decltype((c)) cc) { return (f)(begin(cc), end(cc), ## __VA_ARGS__); })(c))
#define MEMSET(a,v) memset((a), (v), sizeof(a))
#define DBG(x) DPRINTLN('L', __LINE__, ':', #x, ':', (x))
// }}}
struct UnionFind {
// 根には要素数を負の値で格納
UnionFind(size_t n) : uni(n, -1), n_set(n) {}
size_t size() const { return uni.size(); }
// 集合の個数
size_t set_count() const { return n_set; }
int root(int x)
{
if(uni[x] < 0) return x;
return uni[x] = root(uni[x]);
}
void unite(int x, int y)
{
int rx = root(x);
int ry = root(y);
if(rx != ry) {
// 要素数が大きい方を根とする
// (rx が根となる)
if(uni[rx] > uni[ry])
swap(rx,ry);
uni[rx] += uni[ry];
uni[ry] = rx;
--n_set;
}
}
bool same(int x, int y)
{
return root(x) == root(y);
}
vector<int> uni;
size_t n_set;
};
int H, W;
int SX, SY;
int GX, GY;
vector<vector<int>> M;
int idx(int x, int y)
{
return (W+1)*y + x;
}
void solve()
{
// 左/上に余白(壁)を設ける
M.assign(H+1, vector<int>(W+1, 1));
UnionFind uf((H+1) * (W+1));
REP(y, H) {
string s; RD(s);
REP(x, W) {
char c = s[x];
if(c == 's') {
SX = x+1;
SY = y+1;
}
else if(c == 'g') {
GX = x+1;
GY = y+1;
}
if(c != '#') {
if(M[y+1][x] == 0)
uf.unite(idx(x,y+1), idx(x+1,y+1));
if(M[y][x+1] == 0)
uf.unite(idx(x+1,y), idx(x+1,y+1));
M[y+1][x+1] = 0;
}
}
}
bool ans = uf.same(idx(SX,SY), idx(GX,GY));
PRINTLN(ans ? "Yes" : "No");
}
signed main(signed /*argc*/, char** /*argv*/)
{
RD(H);
RD(W);
solve();
EXIT();
}
Submission Info
Submission Time |
|
Task |
A - 深さ優先探索 |
User |
yumsiim |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
15137 Byte |
Status |
AC |
Exec Time |
6 ms |
Memory |
2304 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt |
All |
00_min_01.txt, 00_min_02.txt, 00_min_03.txt, 00_min_04.txt, 00_min_05.txt, 00_min_06.txt, 00_min_07.txt, 00_min_08.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_rndhard_00.txt, 02_rndhard_01.txt, 02_rndhard_02.txt, 02_rndhard_03.txt, 02_rndhard_04.txt, 02_rndhard_05.txt, 02_rndhard_06.txt, 02_rndhard_07.txt, 02_rndhard_08.txt, 02_rndhard_09.txt, 02_rndhard_10.txt, 02_rndhard_11.txt, 02_rndhard_12.txt, 02_rndhard_13.txt, 02_rndhard_14.txt, 02_rndhard_15.txt, 02_rndhard_16.txt, 02_rndhard_17.txt, 02_rndhard_18.txt, 02_rndhard_19.txt, 02_rndhard_20.txt, 02_rndhard_21.txt, 02_rndhard_22.txt, 02_rndhard_23.txt, 02_rndhard_24.txt, 02_rndhard_25.txt, 02_rndhard_26.txt, 02_rndhard_27.txt, 02_rndhard_28.txt, 02_rndhard_29.txt, 02_rndhard_30.txt, 02_rndhard_31.txt, 02_rndhard_32.txt, 02_rndhard_33.txt, 02_rndhard_34.txt, 02_rndhard_35.txt, 02_rndhard_36.txt, 02_rndhard_37.txt, 02_rndhard_38.txt, 02_rndhard_39.txt, 03_rndhardsmall_00.txt, 03_rndhardsmall_01.txt, 03_rndhardsmall_02.txt, 03_rndhardsmall_03.txt, 03_rndhardsmall_04.txt, 03_rndhardsmall_05.txt, 03_rndhardsmall_06.txt, 03_rndhardsmall_07.txt, 03_rndhardsmall_08.txt, 03_rndhardsmall_09.txt |
Case Name |
Status |
Exec Time |
Memory |
00_min_01.txt |
AC |
1 ms |
256 KB |
00_min_02.txt |
AC |
1 ms |
256 KB |
00_min_03.txt |
AC |
1 ms |
256 KB |
00_min_04.txt |
AC |
1 ms |
256 KB |
00_min_05.txt |
AC |
1 ms |
256 KB |
00_min_06.txt |
AC |
1 ms |
256 KB |
00_min_07.txt |
AC |
1 ms |
256 KB |
00_min_08.txt |
AC |
1 ms |
256 KB |
00_sample_01.txt |
AC |
1 ms |
256 KB |
00_sample_02.txt |
AC |
1 ms |
256 KB |
00_sample_03.txt |
AC |
1 ms |
256 KB |
00_sample_04.txt |
AC |
1 ms |
256 KB |
00_sample_05.txt |
AC |
1 ms |
256 KB |
01_rnd_00.txt |
AC |
3 ms |
2304 KB |
01_rnd_01.txt |
AC |
6 ms |
2304 KB |
01_rnd_02.txt |
AC |
6 ms |
2304 KB |
01_rnd_03.txt |
AC |
6 ms |
2304 KB |
01_rnd_04.txt |
AC |
6 ms |
2304 KB |
01_rnd_05.txt |
AC |
5 ms |
2304 KB |
01_rnd_06.txt |
AC |
6 ms |
2304 KB |
01_rnd_07.txt |
AC |
6 ms |
2304 KB |
01_rnd_08.txt |
AC |
3 ms |
2304 KB |
01_rnd_09.txt |
AC |
4 ms |
2304 KB |
01_rnd_10.txt |
AC |
6 ms |
2304 KB |
01_rnd_11.txt |
AC |
3 ms |
2304 KB |
01_rnd_12.txt |
AC |
6 ms |
2304 KB |
01_rnd_13.txt |
AC |
6 ms |
2304 KB |
01_rnd_14.txt |
AC |
6 ms |
2304 KB |
01_rnd_15.txt |
AC |
6 ms |
2304 KB |
01_rnd_16.txt |
AC |
3 ms |
2304 KB |
01_rnd_17.txt |
AC |
6 ms |
2176 KB |
01_rnd_18.txt |
AC |
3 ms |
2304 KB |
01_rnd_19.txt |
AC |
6 ms |
2304 KB |
02_rndhard_00.txt |
AC |
6 ms |
2304 KB |
02_rndhard_01.txt |
AC |
6 ms |
2304 KB |
02_rndhard_02.txt |
AC |
6 ms |
2304 KB |
02_rndhard_03.txt |
AC |
6 ms |
2304 KB |
02_rndhard_04.txt |
AC |
6 ms |
2304 KB |
02_rndhard_05.txt |
AC |
6 ms |
2304 KB |
02_rndhard_06.txt |
AC |
6 ms |
2304 KB |
02_rndhard_07.txt |
AC |
6 ms |
2304 KB |
02_rndhard_08.txt |
AC |
6 ms |
2304 KB |
02_rndhard_09.txt |
AC |
6 ms |
2304 KB |
02_rndhard_10.txt |
AC |
6 ms |
2304 KB |
02_rndhard_11.txt |
AC |
6 ms |
2304 KB |
02_rndhard_12.txt |
AC |
6 ms |
2304 KB |
02_rndhard_13.txt |
AC |
6 ms |
2304 KB |
02_rndhard_14.txt |
AC |
6 ms |
2304 KB |
02_rndhard_15.txt |
AC |
6 ms |
2304 KB |
02_rndhard_16.txt |
AC |
6 ms |
2304 KB |
02_rndhard_17.txt |
AC |
6 ms |
2304 KB |
02_rndhard_18.txt |
AC |
6 ms |
2304 KB |
02_rndhard_19.txt |
AC |
6 ms |
2304 KB |
02_rndhard_20.txt |
AC |
6 ms |
2304 KB |
02_rndhard_21.txt |
AC |
6 ms |
2304 KB |
02_rndhard_22.txt |
AC |
6 ms |
2304 KB |
02_rndhard_23.txt |
AC |
6 ms |
2304 KB |
02_rndhard_24.txt |
AC |
6 ms |
2304 KB |
02_rndhard_25.txt |
AC |
6 ms |
2304 KB |
02_rndhard_26.txt |
AC |
6 ms |
2304 KB |
02_rndhard_27.txt |
AC |
6 ms |
2304 KB |
02_rndhard_28.txt |
AC |
6 ms |
2304 KB |
02_rndhard_29.txt |
AC |
6 ms |
2304 KB |
02_rndhard_30.txt |
AC |
6 ms |
2304 KB |
02_rndhard_31.txt |
AC |
6 ms |
2304 KB |
02_rndhard_32.txt |
AC |
6 ms |
2304 KB |
02_rndhard_33.txt |
AC |
6 ms |
2304 KB |
02_rndhard_34.txt |
AC |
6 ms |
2304 KB |
02_rndhard_35.txt |
AC |
6 ms |
2304 KB |
02_rndhard_36.txt |
AC |
6 ms |
2304 KB |
02_rndhard_37.txt |
AC |
6 ms |
2304 KB |
02_rndhard_38.txt |
AC |
6 ms |
2304 KB |
02_rndhard_39.txt |
AC |
6 ms |
2304 KB |
03_rndhardsmall_00.txt |
AC |
1 ms |
256 KB |
03_rndhardsmall_01.txt |
AC |
1 ms |
256 KB |
03_rndhardsmall_02.txt |
AC |
1 ms |
256 KB |
03_rndhardsmall_03.txt |
AC |
1 ms |
256 KB |
03_rndhardsmall_04.txt |
AC |
1 ms |
256 KB |
03_rndhardsmall_05.txt |
AC |
1 ms |
256 KB |
03_rndhardsmall_06.txt |
AC |
1 ms |
256 KB |
03_rndhardsmall_07.txt |
AC |
1 ms |
256 KB |
03_rndhardsmall_08.txt |
AC |
1 ms |
256 KB |
03_rndhardsmall_09.txt |
AC |
1 ms |
256 KB |