Submission #3168161


Source Code Expand

#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
#include <string.h>
#include <numeric>
using namespace std;

//#define int long long
#define reps(i,s,n) for(int (i)=(s);(i)<(n);++(i))
#define rep(i,n) reps(i,0,n)
#define rept(i,n) rep(i,(n)+1)
#define repst(i,s,n) reps(i,s,(n)+1)
#define reprt(i,n,t) for(int (i)=(n);(i)>=(t);--(i))
#define repr(i,n) reprt(i,n,0)
#define each(itr,v) for(auto &(itr):(v))
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define tmax(x,y,z) max(x,max(y,z))
#define tmin(x,y,z) min(x,min(y,z))
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define ln '\n'
#define bln(i,n) (((i)==(n)-1)?'\n':' ')
#define dbg(x) cout<<#x" = "<<(x)<<ln<<flush
#define dbga(x,n) {cout<<#x" : ";for(int (i)=0;i<(n);++i){cout<<((x)[i])<<(i==((n)-1)?'\n':' ')<<flush;}}
#define zero(a) memset(a,0,sizeof(a))
#define unq(a) sort(all(a)),a.erase(unique(all(a)),a.end())

//typedef complex<double> P;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vector<int> > mat;

const ll inf = (ll)1e9+10;
const ll linf = (ll)1e18+10;
const ll mod = (ll)(1e9+7);
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};
const double eps = 1e-10;

ll mop(ll a,ll b,ll m=mod) {ll r=1;a%=m;for(;b;b>>=1){if(b&1)r=r*a%m;a=a*a%m;}return r;}
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b) {return a*b/gcd(a,b);}
bool ool(int x,int y,int h,int w) {return((x<0)||(h<=x)||(y<0)||(w<=y));}
bool deq(double a,double b) {return abs(a-b)<eps;}

struct oreno_initializer {
	oreno_initializer() {
		cin.tie(0);
		ios::sync_with_stdio(0);
	}
} oreno_initializer;



int n;
string c, sx, sy, x[] = {".", ".", "#", "#"}, y[] = {".", "#", ".", "#"}, t, lx, ly;
bool re;

signed main() {
	cin >> n;
	while (1) {
		if (!re) rep(i,4) {
			cout << sx+x[i] << endl << sy+y[i] << endl << flush;
			cin >> t;
			if (t=="end") return 0;
			if (t=="T") {
				sx += x[i], sy += y[i];
				break;
			}
			if (i==3) re = 1;
		} else rep(i,4) {
			cout << lx+x[i]+sx << endl << ly+y[i]+sy << endl << flush;
			cin >> t;
			if (t=="end") return 0;
			if (t=="T") {
				lx += x[i], ly += y[i];
				break;
			}
		}
	}
}

Submission Info

Submission Time
Task D - Long Blackboard
User creep04
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2735 Byte
Status QLE
Exec Time 22 ms
Memory 724 KB

Judge Result

Set Name All
Score / Max Score 0 / 150
Status
AC × 15
QLE × 55
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 716 KB
00_small_01.txt QLE 20 ms 724 KB
00_small_02.txt AC 4 ms 724 KB
00_small_03.txt AC 4 ms 720 KB
00_small_04.txt QLE 20 ms 720 KB
00_small_05.txt QLE 19 ms 720 KB
00_small_06.txt QLE 20 ms 720 KB
00_small_07.txt AC 4 ms 720 KB
00_small_08.txt QLE 20 ms 724 KB
00_small_09.txt AC 4 ms 724 KB
10_medium_10.txt QLE 19 ms 720 KB
10_medium_11.txt QLE 20 ms 724 KB
10_medium_12.txt QLE 19 ms 720 KB
10_medium_13.txt QLE 18 ms 720 KB
10_medium_14.txt AC 7 ms 716 KB
10_medium_15.txt QLE 20 ms 596 KB
10_medium_16.txt QLE 19 ms 720 KB
10_medium_17.txt QLE 20 ms 720 KB
10_medium_18.txt QLE 20 ms 716 KB
10_medium_19.txt QLE 21 ms 720 KB
20_large_20.txt QLE 20 ms 724 KB
20_large_21.txt QLE 19 ms 720 KB
20_large_22.txt QLE 20 ms 720 KB
20_large_23.txt QLE 20 ms 724 KB
20_large_24.txt QLE 22 ms 720 KB
20_large_25.txt QLE 20 ms 592 KB
20_large_26.txt QLE 20 ms 720 KB
20_large_27.txt QLE 20 ms 720 KB
20_large_28.txt QLE 20 ms 720 KB
20_large_29.txt QLE 19 ms 724 KB
20_large_30.txt QLE 19 ms 720 KB
20_large_31.txt QLE 19 ms 720 KB
20_large_32.txt QLE 19 ms 720 KB
20_large_33.txt QLE 20 ms 716 KB
20_large_34.txt QLE 20 ms 720 KB
20_large_35.txt QLE 20 ms 724 KB
20_large_36.txt QLE 21 ms 720 KB
20_large_37.txt QLE 20 ms 724 KB
20_large_38.txt QLE 20 ms 716 KB
20_large_39.txt QLE 20 ms 724 KB
20_large_40.txt QLE 19 ms 592 KB
20_large_41.txt QLE 20 ms 720 KB
20_large_42.txt QLE 20 ms 724 KB
20_large_43.txt QLE 20 ms 720 KB
20_large_44.txt QLE 20 ms 724 KB
20_large_45.txt QLE 20 ms 724 KB
20_large_46.txt AC 13 ms 720 KB
20_large_47.txt QLE 20 ms 720 KB
20_large_48.txt QLE 20 ms 720 KB
20_large_49.txt QLE 20 ms 724 KB
30_large_50.txt AC 7 ms 720 KB
30_large_51.txt AC 11 ms 724 KB
30_large_52.txt AC 15 ms 720 KB
30_large_53.txt AC 20 ms 596 KB
40_large_54.txt QLE 19 ms 724 KB
40_large_55.txt AC 11 ms 724 KB
40_large_56.txt QLE 20 ms 720 KB
40_large_57.txt QLE 20 ms 724 KB
40_large_58.txt QLE 20 ms 724 KB
40_large_59.txt QLE 20 ms 724 KB
40_large_60.txt QLE 20 ms 720 KB
40_large_61.txt AC 19 ms 720 KB
40_large_62.txt QLE 20 ms 724 KB
40_large_63.txt AC 11 ms 596 KB
40_large_64.txt QLE 20 ms 724 KB
40_large_65.txt QLE 20 ms 724 KB
40_large_66.txt QLE 20 ms 720 KB
40_large_67.txt AC 11 ms 720 KB
40_large_68.txt QLE 19 ms 724 KB
40_large_69.txt QLE 20 ms 724 KB