Submission #1203243
Source Code Expand
// 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 <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 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=(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 PAIR std::pair<int, int> #define PAIRLL std::pair<ll, ll> #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 SHOWPAIR(p) {std::cerr << #p << "\t:(" << p.first << ",\t" << p.second << ")\n";} #define SHOWPAIRVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr<<'('<<yyy.first<<", "<<yyy.second<<") ";}std::cerr << "\n";}} #define SHOWPAIRVECTOR(v) {for(const auto& xxx:v){std::cerr<<'('<<xxx.first<<", "<<xxx.second<<") ";}std::cerr<<"\n";} #define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cerr << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cerr << tmp.front() << "\n";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"; } #define int ll using ll = long long; using ull = unsigned long long; 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; signed main() { INIT; VAR(int, n); bool left = true; std::string s1(""), s2(""); std::vector<std::string> s({ "..", ".#", "#.", "##" }); while (true) { bool f = false; REP(i, 4) { if (left) { OUT(s1)OUT(s[i][0])BR; OUT(s2)OUT(s[i][1])ENDL; VAR(char, c); if (c == 'e') return 0; if (c == 'T') { s1 += s[i][0]; s2 += s[i][1]; f = true; break; } } else { OUT(s[i][0])OUT(s1)BR; OUT(s[i][1])OUT(s2)ENDL; VAR(char, c); if (c == 'T') { s1 = s[i][0] + s1; s2 = s[i][1] + s2; f = true; break; } } } if (!f) left = false; if (s1.size() == n) break; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Long Blackboard |
User | satanic0258 |
Language | C++14 (GCC 5.4.1) |
Score | 150 |
Code Size | 5482 Byte |
Status | AC |
Exec Time | 15 ms |
Memory | 724 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 150 / 150 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_small_00.txt, 00_small_01.txt, 00_small_02.txt, 00_small_03.txt, 00_small_04.txt, 00_small_05.txt, 00_small_06.txt, 00_small_07.txt, 00_small_08.txt, 00_small_09.txt, 10_medium_10.txt, 10_medium_11.txt, 10_medium_12.txt, 10_medium_13.txt, 10_medium_14.txt, 10_medium_15.txt, 10_medium_16.txt, 10_medium_17.txt, 10_medium_18.txt, 10_medium_19.txt, 20_large_20.txt, 20_large_21.txt, 20_large_22.txt, 20_large_23.txt, 20_large_24.txt, 20_large_25.txt, 20_large_26.txt, 20_large_27.txt, 20_large_28.txt, 20_large_29.txt, 20_large_30.txt, 20_large_31.txt, 20_large_32.txt, 20_large_33.txt, 20_large_34.txt, 20_large_35.txt, 20_large_36.txt, 20_large_37.txt, 20_large_38.txt, 20_large_39.txt, 20_large_40.txt, 20_large_41.txt, 20_large_42.txt, 20_large_43.txt, 20_large_44.txt, 20_large_45.txt, 20_large_46.txt, 20_large_47.txt, 20_large_48.txt, 20_large_49.txt, 30_large_50.txt, 30_large_51.txt, 30_large_52.txt, 30_large_53.txt, 40_large_54.txt, 40_large_55.txt, 40_large_56.txt, 40_large_57.txt, 40_large_58.txt, 40_large_59.txt, 40_large_60.txt, 40_large_61.txt, 40_large_62.txt, 40_large_63.txt, 40_large_64.txt, 40_large_65.txt, 40_large_66.txt, 40_large_67.txt, 40_large_68.txt, 40_large_69.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_small_00.txt | AC | 4 ms | 588 KB |
00_small_01.txt | AC | 4 ms | 716 KB |
00_small_02.txt | AC | 4 ms | 592 KB |
00_small_03.txt | AC | 4 ms | 724 KB |
00_small_04.txt | AC | 4 ms | 720 KB |
00_small_05.txt | AC | 4 ms | 724 KB |
00_small_06.txt | AC | 4 ms | 720 KB |
00_small_07.txt | AC | 4 ms | 724 KB |
00_small_08.txt | AC | 4 ms | 720 KB |
00_small_09.txt | AC | 3 ms | 716 KB |
10_medium_10.txt | AC | 6 ms | 720 KB |
10_medium_11.txt | AC | 6 ms | 720 KB |
10_medium_12.txt | AC | 7 ms | 712 KB |
10_medium_13.txt | AC | 6 ms | 720 KB |
10_medium_14.txt | AC | 7 ms | 724 KB |
10_medium_15.txt | AC | 6 ms | 724 KB |
10_medium_16.txt | AC | 6 ms | 720 KB |
10_medium_17.txt | AC | 6 ms | 720 KB |
10_medium_18.txt | AC | 6 ms | 720 KB |
10_medium_19.txt | AC | 7 ms | 724 KB |
20_large_20.txt | AC | 10 ms | 720 KB |
20_large_21.txt | AC | 10 ms | 716 KB |
20_large_22.txt | AC | 10 ms | 720 KB |
20_large_23.txt | AC | 10 ms | 592 KB |
20_large_24.txt | AC | 10 ms | 596 KB |
20_large_25.txt | AC | 11 ms | 716 KB |
20_large_26.txt | AC | 10 ms | 592 KB |
20_large_27.txt | AC | 10 ms | 724 KB |
20_large_28.txt | AC | 10 ms | 720 KB |
20_large_29.txt | AC | 11 ms | 724 KB |
20_large_30.txt | AC | 11 ms | 596 KB |
20_large_31.txt | AC | 10 ms | 720 KB |
20_large_32.txt | AC | 10 ms | 716 KB |
20_large_33.txt | AC | 11 ms | 592 KB |
20_large_34.txt | AC | 10 ms | 720 KB |
20_large_35.txt | AC | 11 ms | 720 KB |
20_large_36.txt | AC | 10 ms | 592 KB |
20_large_37.txt | AC | 11 ms | 720 KB |
20_large_38.txt | AC | 10 ms | 720 KB |
20_large_39.txt | AC | 11 ms | 720 KB |
20_large_40.txt | AC | 10 ms | 720 KB |
20_large_41.txt | AC | 10 ms | 712 KB |
20_large_42.txt | AC | 11 ms | 592 KB |
20_large_43.txt | AC | 10 ms | 720 KB |
20_large_44.txt | AC | 11 ms | 592 KB |
20_large_45.txt | AC | 10 ms | 596 KB |
20_large_46.txt | AC | 11 ms | 716 KB |
20_large_47.txt | AC | 11 ms | 720 KB |
20_large_48.txt | AC | 11 ms | 720 KB |
20_large_49.txt | AC | 10 ms | 724 KB |
30_large_50.txt | AC | 6 ms | 720 KB |
30_large_51.txt | AC | 9 ms | 716 KB |
30_large_52.txt | AC | 12 ms | 716 KB |
30_large_53.txt | AC | 14 ms | 716 KB |
40_large_54.txt | AC | 6 ms | 592 KB |
40_large_55.txt | AC | 9 ms | 596 KB |
40_large_56.txt | AC | 12 ms | 720 KB |
40_large_57.txt | AC | 15 ms | 720 KB |
40_large_58.txt | AC | 6 ms | 592 KB |
40_large_59.txt | AC | 9 ms | 720 KB |
40_large_60.txt | AC | 12 ms | 716 KB |
40_large_61.txt | AC | 15 ms | 716 KB |
40_large_62.txt | AC | 6 ms | 596 KB |
40_large_63.txt | AC | 9 ms | 720 KB |
40_large_64.txt | AC | 12 ms | 720 KB |
40_large_65.txt | AC | 15 ms | 596 KB |
40_large_66.txt | AC | 6 ms | 592 KB |
40_large_67.txt | AC | 9 ms | 596 KB |
40_large_68.txt | AC | 12 ms | 720 KB |
40_large_69.txt | AC | 15 ms | 720 KB |