Submission #33248616


Source Code Expand

#include<cmath>
#include<vector>
#include<string>
#define cmin(x,y) if(x>y) x=y;
#define cmax(x,y) if(x<y) x=y;
#define eb emplace_back
using namespace std;
using db=double;
using uni=unsigned long long;
const int FSIZE=1<<26,INF=0x7fffffff,fx[8]={1,0,-1,0,1,1,-1,-1},fy[8]={0,1,0,-1,1,-1,1,-1};
const db pi=acos(-1);
struct image{
	int rx,ry;
	vector<vector<bool>> raw,null,vis;
	image(const char *s){
		for(raw.eb((0));*s=='\n'||*s=='#'||*s=='.';++s)
			if(*s=='\n'){
				if(*(s+1)=='.'||*(s+1)=='#') raw.eb((0));
			}else raw.back().eb(*s=='#');
		ry=raw[0].size();
		null.resize(rx=raw.size());
		for(auto &i:null) i.resize(ry);
	}
	image(int x,int y):ry(y+1){
		raw.resize(rx=x+1);
		for(auto &i:raw) i.resize(y+1);
		null=raw;
	}
	image(int w,const char *s):ry(w){
		bool p=1;
		auto get=[&](int k){
			for(p^=1;k--;){
				raw.back().eb(p);
				if(raw.back().size()==ry) raw.eb((0));
			}};
		raw.eb((0));
		for(uni k=0;*s;++s)
			if(*s==' '){
				if(k<190) get(k);
				else for(uni x=k;x;x>>=5) get(x&31);
				k=0;
			}else k=k*95+*s-33;
		raw.pop_back();
		null.resize(rx=raw.size());
		for(auto &i:null) i.resize(ry);
	}
	auto &operator[](int x){return(raw[x]);}
	struct sqr{
		int x0,x1,y0,y1;
		void operator+=(sqr b){
			cmin(x0,b.x0)cmax(x1,b.x1)
			cmin(y0,b.y0)cmax(y1,b.y1)
		}
		void operator+=(pair<int,int> b){
			cmin(x0,b.first)cmax(x1,b.first)
			cmin(y0,b.second)cmax(y1,b.second)
		}
	};
	sqr find(int x,int y){
		sqr re={x,x,y,y};
		vis[x][y]=1;
		for(int i=0,nx,ny;i<8;++i)
			if(~(nx=x+fx[i])&&~(ny=y+fy[i])&&nx<rx&&ny<ry&&!vis[nx][ny]&&raw[nx][ny]==raw[x][y])
				re+=find(nx,ny);
		return(re);
	}
	template<class T>void foreach(T func){
		for(int i=0;i<rx;++i)
			for(int j=0;j<ry;++j) func(i,j);
	}
	auto &reno(){
		vis=null;
		foreach([&](int x,int y){
			int bk=raw[x][y];
			for(int i=0,nx,ny;i<8;++i)
				if(~(nx=x+fx[i])&&~(ny=y+fy[i])&&nx<rx&&ny<ry)
					bk+=raw[nx][ny];
			raw[x][y]=bk>4;});
		return(*this);
	}
	auto split(){
		vector<image> re;
		vis=null;
		for(int i=0;i<ry;++i)
			for(int j=0,nx,ny;j<rx;++j)
				if(raw[j][i]&&!vis[j][i]){
					sqr out=find(j,i);
					if((nx=out.x1-out.x0)*(ny=out.y1-out.y0)<80) continue;
					image nxt(nx,ny);
					nxt.foreach([&](int x,int y){nxt[x][y]=raw[x+out.x0][y+out.y0];});
					re.eb(nxt);
				}
		return(re);
	}
	template<class T>auto trans(T func){
		vector<pair<int,int>> point;
		sqr out={INF,-INF,INF,-INF};
		foreach([&](int x,int y){
			if(!raw[x][y]) return;
			auto p=func(x,y);
			point.eb(p);
			out+=p;});
		image re(out.x1-out.x0,out.y1-out.y0);
		for(auto i:point)
			re[i.first-out.x0][i.second-out.y0]=1;
		return(re);
	}
	auto rotate(db ang){
		ang=ang/180*pi;
		db csa=cos(ang),sia=sin(ang),cex=rx/2.,cey=ry/2.;
		return(trans([&](int x,int y){
			return(make_pair((x-cex)*csa+(y-cey)*sia+cex,-(x-cex)*sia+(y-cey)*csa+cey));}));
	}
	auto cut(db cx,db cy){
		return(trans([&](int x,int y){return(make_pair(x+y*cy,y+x*cx));}));
	}
	auto fit(int rxt,int ryt){
		image re(rxt,ryt);
		db delx=(db)rxt/rx,dely=(db)ryt/ry;
		foreach([&](int x,int y){if(raw[x][y]) re[x=x*delx][y=y*dely]=1;});
		return(re);
	}
	db match(image &x){
		if(min(abs((db)ry/rx-(db)x.ry/x.rx),abs((db)rx/ry-(db)x.rx/x.ry))>0.2) return(0);
		int re=0,mix=min(rx,x.rx)-1,miy=min(ry,x.ry)-1;
		auto a=this->fit(mix,miy),b=x.fit(mix,miy);
		a.foreach([&](int x,int y){re+=a[x][y]==b[x][y];});
		return((db)re/(mix*miy));
	}
};
vector<image> trans[16];
vector<image> charset({
{30,"/(Z>k5rpG- 05|Tes`Cbl %.)|F7>Tu5 oo3$s$lNM oo3$s/)(] /iV1d;jA>K 0/t0K-(usu `2O#f.n=G S%2Op3 "},
{27,"4;{D@&Ol^x /xoT%W-H Oe%.AxXC5 Oe%.AxXC5 Oe%.AxXC5 \"ID8yq \"H )j "},
{28,"+Mm-u+r60= 05kx9`fP'\\ (l?:yvmH\\( 4;|B@rIg:# _QwDo9;'' ,[0E@,wQP6 Sh:[IpOZP \"U *+ "},
{28,")cKS}@p1aD 05kx9`@[os Ou2:MXQ0| 9`+Zk=.dpe 0lBpTs;8Fp 0)zxq3Q?Gt U]FR>4oH. FZf "},
{30,"`\"pAl[\\K# ;U@Xq(T{S6 0;5oU%v}!m ,Ke6O>2pa( #}l8n \"v P6LVwNc`t #4ySB5i,x "},
{28,"-8/eJXT]M8 0l32ni_ecN )c;vg@iA.j 0lR{i<~bGD <PhMqXvpa; 0<5X1fSWr Y);f+{U:* "},
{29,"0lRMbF!8wy 0lRL7Yx_SH ,eb&_jD~Vh 3D!XEg<#NV #>Rj1Z7L*b 1T(FG.o^*z 0vvDh$?P\\d NYT%H` "},
{28,"4t \"M %32,I{nYnJ -C1BZI\"y/ OeEu3c$?{ U/M^Xc}Q> Ou0p'}`{+ Oe&]KK|_d 64j90R$ "},
{28,"+M|;cpYJ[F 00S,13#;^b &|D-U=zs\\? C.=c-%,17 1feVt=l2qQ 7uJ6=&~X}V 3_-]065<>e =DM\"WnRe=Y $. "},
{28,")^1i*Xxot+ 06,/jya!3S 7uEU#Pb}jU 5Nx13cQ{?C 0*,{fU\"MZY 2Vcx.kHhAS 4A6]cbs'j4 qpQpj< "},
{21,"0A$&=F3'Ba 2+U;$UvGD/ 99fCq\"2p_~ 0F=p1!?(*p ;)aRed1r)W 20oUjR3+f* 5jLYN_H`p2 .Va|8bD*3+ $fC1 "},
{21,"3j7^;;Iyw 204P[FOo4 99vP~Sd5*W 0F=p1!f8a> 7J+NR4p][# 20o%s!.]h_ 2+E_4w$-Zf .VaLA1?Q?5 5qqD "},
{27,R"(JKhf2n"v; 0>qwv>q " JKhf2n"l0 "v42HHf&g )"},{28,"4U \"N *+ "},
{26,"J<*z]Vh( &pNR}bx5_b eSZ\\ _ #>1#V6Hu.5 /tF\">9a{Ct 3^N.E-.1}M 7%2 "},
{28,"JL9YFlFi\" JL9Y:!~TT OtaHl7%r OtaHl7%R JL9YFk8F* JL9Y:!~TT Ou27IYGzC OtaHl7%R #z3[eZ "}});
char charname[17]="0123456789()+-*/";
string ans;
int t,n,m;
char BuF[FSIZE],*InF=BuF;
void read(int &x){
	for(;*InF<33;++InF);
	for(x=0;32<*InF;x=x*10+(*InF++^48));
}
void init(){
	for(int i=0;i<16;++i)
		for(db j=-15;j<16;j+=3){
			auto tmp=charset[i].rotate(j).reno();
			trans[i].eb(tmp.cut(-.1,-.1).reno());
			trans[i].eb(tmp.cut(-.1,.1).reno());
			trans[i].eb(tmp.cut(.1,-.1).reno());
			trans[i].eb(tmp.cut(.1,.1).reno());
			trans[i].eb(tmp);
		}
}
#define caseopt(x) case #x[0]:st0.back()x##=rhs;break;
#define pops(check) for(;check;st1.pop_back()) calc(st1.back());
int level(char c){return(c=='('?0:1+(c=='*'||c=='/'));}
int calc(string& s){
	vector<int> st0;
	vector<char> st1;
	auto calc=[&](char c){
		int rhs=st0.back();
		st0.pop_back();
		switch(c){
			caseopt(+)
			caseopt(-)
			caseopt(*)
			caseopt(/)
		}
	};
	int optnum=0,isd=0;
	for(auto c:s){
		if(47<c&&c<58){
			optnum=10*optnum+(c^48);
			isd=1;
			continue;
		}
		if(isd){
			st0.eb(optnum);
			isd=optnum=0;
		}
		if(st1.size()&&c!='('){
			if(c==')'){
				pops(st1.back()!='(')
				st1.pop_back();
				continue;
			}else pops(st1.size()&&level(c)<=level(st1.back()))
		}
		st1.eb(c);
	}
	if(47<s.back()&&s.back()<58) st0.eb(optnum);
	pops(st1.size())
	return(st0.back());
}
int main(){
	fread(BuF,1,FSIZE,stdin);
	read(t);read(n);read(m);
	for(init();*InF<33;++InF);
	image in(InF);
	for(auto &i:in.reno().split()){
		db bestmatch=0,tmp;int bestnum=0;
		for(int j=0;j<16;++j){
			tmp=i.match(charset[j]);
			if(tmp>0&&tmp<.5) continue;
			for(auto &k:trans[j])
				if((tmp=i.match(k))>bestmatch){
					bestmatch=tmp;
					bestnum=j;
				}
		}
		ans+=charname[bestnum];
	}
	printf("%d\n",calc(ans));
}

Submission Info

Judge Result

Set Name Case0 Case1 Case2 Case3 Case4 Case5 Case6 Case7 Case8 Case9 Case10 Case11 Case12 Case13 Case14 Case15 Case16 Case17 Case18 Case19 Case20 Case21 Case22 Case23 Case24 Case25 Case26 Case27 Case28 Case29 Case30 Case31 Case32 Case33 Case34 Case35 Case36 Case37 Case38 Case39 Case40 Case41 Case42 Case43 Case44 Case45 Case46 Case47 Case48 Case49 Case50 Case51 Case52 Case53 Case54 Case55 Case56 Case57 Case58 Case59 Case60 Case61 Case62 Case63 Case64 Case65 Case66 Case67 Case68 Case69 Case70 Case71 Case72 Case73 Case74 Case75 Case76 Case77 Case78 Case79 Case80 Case81 Case82 Case83 Case84 Case85 Case86 Case87 Case88 Case89 Case90 Case91 Case92 Case93 Case94 Case95 Case96 Case97 Case98 Case99 Case100 Case101 Case102 Case103 Case104 Case105 Case106 Case107 Case108 Case109 Case110 Case111 Case112 Case113 Case114 Case115 Case116 Case117 Case118 Case119 Case120 Case121 Case122 Case123 Case124 Case125 Case126 Case127 Case128 Case129 Case130 Case131 Case132 Case133 Case134 Case135 Case136 Case137 Case138 Case139
Score / Max Score 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 4 / 4 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
Case0 000.txt
Case1 001.txt
Case2 002.txt
Case3 003.txt
Case4 004.txt
Case5 005.txt
Case6 006.txt
Case7 007.txt
Case8 008.txt
Case9 009.txt
Case10 010.txt
Case11 011.txt
Case12 012.txt
Case13 013.txt
Case14 014.txt
Case15 015.txt
Case16 016.txt
Case17 017.txt
Case18 018.txt
Case19 019.txt
Case20 020.txt
Case21 021.txt
Case22 022.txt
Case23 023.txt
Case24 024.txt
Case25 025.txt
Case26 026.txt
Case27 027.txt
Case28 028.txt
Case29 029.txt
Case30 030.txt
Case31 031.txt
Case32 032.txt
Case33 033.txt
Case34 034.txt
Case35 035.txt
Case36 036.txt
Case37 037.txt
Case38 038.txt
Case39 039.txt
Case40 040.txt
Case41 041.txt
Case42 042.txt
Case43 043.txt
Case44 044.txt
Case45 045.txt
Case46 046.txt
Case47 047.txt
Case48 048.txt
Case49 049.txt
Case50 050.txt
Case51 051.txt
Case52 052.txt
Case53 053.txt
Case54 054.txt
Case55 055.txt
Case56 056.txt
Case57 057.txt
Case58 058.txt
Case59 059.txt
Case60 060.txt
Case61 061.txt
Case62 062.txt
Case63 063.txt
Case64 064.txt
Case65 065.txt
Case66 066.txt
Case67 067.txt
Case68 068.txt
Case69 069.txt
Case70 070.txt
Case71 071.txt
Case72 072.txt
Case73 073.txt
Case74 074.txt
Case75 075.txt
Case76 076.txt
Case77 077.txt
Case78 078.txt
Case79 079.txt
Case80 080.txt
Case81 081.txt
Case82 082.txt
Case83 083.txt
Case84 084.txt
Case85 085.txt
Case86 086.txt
Case87 087.txt
Case88 088.txt
Case89 089.txt
Case90 090.txt
Case91 091.txt
Case92 092.txt
Case93 093.txt
Case94 094.txt
Case95 095.txt
Case96 096.txt
Case97 097.txt
Case98 098.txt
Case99 099.txt
Case100 100.txt
Case101 101.txt
Case102 102.txt
Case103 103.txt
Case104 104.txt
Case105 105.txt
Case106 106.txt
Case107 107.txt
Case108 108.txt
Case109 109.txt
Case110 110.txt
Case111 111.txt
Case112 112.txt
Case113 113.txt
Case114 114.txt
Case115 115.txt
Case116 116.txt
Case117 117.txt
Case118 118.txt
Case119 119.txt
Case120 120.txt
Case121 121.txt
Case122 122.txt
Case123 123.txt
Case124 124.txt
Case125 125.txt
Case126 126.txt
Case127 127.txt
Case128 128.txt
Case129 129.txt
Case130 130.txt
Case131 131.txt
Case132 132.txt
Case133 133.txt
Case134 134.txt
Case135 135.txt
Case136 136.txt
Case137 137.txt
Case138 138.txt
Case139 139.txt
Case Name Status Exec Time Memory
000.txt AC 46 ms 9008 KiB
001.txt AC 43 ms 9132 KiB
002.txt AC 43 ms 9056 KiB
003.txt AC 48 ms 9232 KiB
004.txt AC 49 ms 9032 KiB
005.txt AC 51 ms 9108 KiB
006.txt AC 46 ms 9068 KiB
007.txt AC 53 ms 9164 KiB
008.txt AC 45 ms 8916 KiB
009.txt AC 46 ms 9136 KiB
010.txt AC 48 ms 9108 KiB
011.txt AC 50 ms 9180 KiB
012.txt AC 49 ms 9152 KiB
013.txt AC 49 ms 9028 KiB
014.txt AC 51 ms 9024 KiB
015.txt AC 49 ms 9040 KiB
016.txt AC 48 ms 9068 KiB
017.txt AC 48 ms 9032 KiB
018.txt AC 50 ms 9096 KiB
019.txt AC 49 ms 9068 KiB
020.txt AC 53 ms 9036 KiB
021.txt AC 51 ms 9036 KiB
022.txt AC 51 ms 9192 KiB
023.txt AC 52 ms 9036 KiB
024.txt AC 52 ms 9220 KiB
025.txt AC 49 ms 9060 KiB
026.txt AC 51 ms 9188 KiB
027.txt AC 48 ms 9240 KiB
028.txt AC 47 ms 9076 KiB
029.txt AC 49 ms 8964 KiB
030.txt AC 200 ms 9428 KiB
031.txt AC 162 ms 9472 KiB
032.txt AC 183 ms 9560 KiB
033.txt AC 187 ms 9480 KiB
034.txt AC 179 ms 9432 KiB
035.txt AC 174 ms 9432 KiB
036.txt AC 179 ms 9432 KiB
037.txt AC 180 ms 9480 KiB
038.txt AC 155 ms 9452 KiB
039.txt AC 190 ms 9632 KiB
040.txt AC 190 ms 9464 KiB
041.txt AC 194 ms 9336 KiB
042.txt AC 175 ms 9592 KiB
043.txt AC 178 ms 9428 KiB
044.txt AC 178 ms 9524 KiB
045.txt AC 204 ms 9580 KiB
046.txt AC 188 ms 9436 KiB
047.txt AC 189 ms 9460 KiB
048.txt AC 182 ms 9580 KiB
049.txt AC 190 ms 9596 KiB
050.txt AC 179 ms 9576 KiB
051.txt AC 169 ms 9492 KiB
052.txt AC 168 ms 9508 KiB
053.txt AC 179 ms 9448 KiB
054.txt AC 183 ms 9492 KiB
055.txt AC 173 ms 9348 KiB
056.txt AC 183 ms 9360 KiB
057.txt AC 132 ms 9368 KiB
058.txt AC 198 ms 9540 KiB
059.txt AC 161 ms 9480 KiB
060.txt AC 162 ms 9464 KiB
061.txt AC 166 ms 9400 KiB
062.txt AC 162 ms 9476 KiB
063.txt AC 141 ms 9472 KiB
064.txt AC 181 ms 9448 KiB
065.txt AC 155 ms 9600 KiB
066.txt AC 156 ms 9440 KiB
067.txt AC 150 ms 9412 KiB
068.txt AC 163 ms 9572 KiB
069.txt AC 159 ms 9400 KiB
070.txt AC 179 ms 9428 KiB
071.txt AC 175 ms 9432 KiB
072.txt AC 181 ms 9424 KiB
073.txt AC 192 ms 9476 KiB
074.txt AC 205 ms 9628 KiB
075.txt AC 175 ms 9572 KiB
076.txt AC 189 ms 9412 KiB
077.txt AC 206 ms 9464 KiB
078.txt AC 199 ms 9492 KiB
079.txt AC 181 ms 9400 KiB
080.txt AC 189 ms 9436 KiB
081.txt AC 185 ms 9464 KiB
082.txt AC 168 ms 9352 KiB
083.txt AC 189 ms 9496 KiB
084.txt AC 161 ms 9460 KiB
085.txt AC 181 ms 9496 KiB
086.txt AC 201 ms 9488 KiB
087.txt AC 177 ms 9664 KiB
088.txt AC 185 ms 9612 KiB
089.txt AC 182 ms 9464 KiB
090.txt AC 578 ms 10540 KiB
091.txt AC 732 ms 10712 KiB
092.txt AC 748 ms 10452 KiB
093.txt AC 718 ms 10532 KiB
094.txt AC 760 ms 10556 KiB
095.txt AC 746 ms 10716 KiB
096.txt AC 742 ms 10760 KiB
097.txt AC 745 ms 10632 KiB
098.txt AC 716 ms 10660 KiB
099.txt AC 728 ms 10676 KiB
100.txt AC 690 ms 10828 KiB
101.txt AC 674 ms 10600 KiB
102.txt AC 653 ms 10668 KiB
103.txt AC 671 ms 10632 KiB
104.txt AC 682 ms 10660 KiB
105.txt AC 671 ms 10640 KiB
106.txt AC 657 ms 10860 KiB
107.txt AC 703 ms 10676 KiB
108.txt AC 685 ms 10636 KiB
109.txt AC 661 ms 10612 KiB
110.txt AC 641 ms 10848 KiB
111.txt AC 613 ms 10860 KiB
112.txt AC 645 ms 10672 KiB
113.txt AC 628 ms 10652 KiB
114.txt AC 610 ms 10700 KiB
115.txt AC 635 ms 10648 KiB
116.txt AC 587 ms 10852 KiB
117.txt AC 589 ms 10856 KiB
118.txt AC 625 ms 10724 KiB
119.txt AC 622 ms 10796 KiB
120.txt AC 621 ms 10708 KiB
121.txt AC 632 ms 10696 KiB
122.txt AC 620 ms 10892 KiB
123.txt AC 630 ms 10660 KiB
124.txt AC 609 ms 10752 KiB
125.txt AC 620 ms 10728 KiB
126.txt AC 622 ms 10700 KiB
127.txt AC 627 ms 10720 KiB
128.txt AC 579 ms 10788 KiB
129.txt AC 632 ms 10696 KiB
130.txt AC 604 ms 10916 KiB
131.txt AC 595 ms 10784 KiB
132.txt AC 662 ms 10756 KiB
133.txt AC 624 ms 10704 KiB
134.txt AC 625 ms 10552 KiB
135.txt AC 613 ms 10732 KiB
136.txt AC 621 ms 10804 KiB
137.txt AC 648 ms 10712 KiB
138.txt AC 593 ms 10728 KiB
139.txt AC 631 ms 10864 KiB