提出 #33745961


ソースコード 拡げる

#include<bits/stdc++.h>
#define eb emplace_back
using namespace std;
using db=double;
const int 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=0;
	vector<vector<bool>> raw,null,vis;
	void empty(int x){
		null.resize(rx=x);
		for(auto &i:null) i.resize(ry);
	}
	image(char *s){
		for(raw.eb((0));*s;++s)
			if(*s<33){
				if(s[1]>32) raw.eb(0);
			}else raw.back().eb(*s<46);
		ry=raw[0].size();
		empty(raw.size());
	}
	image(int x,int y):ry(y+1){
		empty(x+1);
		raw=null;
	}
	image(const char *s){
		bool p=1;
		auto get=[&](int k){
			if(ry) for(p^=1;k--;){
				raw.back().eb(p);
				if(raw.back().size()==ry) raw.eb(0);
			}else ry=k;};
		raw.eb(0);
		for(unsigned __int128 k=0;*s;++s)
			if(*s<33){
				if(k<200) get(k);
				else for(;k;k>>=5) get(k&31);
				k=0;
			}else k=k*94+*s-33;
		raw.pop_back();
		empty(raw.size());
	}
	auto &operator[](int x){return(raw[x]);}
	struct sqr{
		int x0,x1,y0,y1;
		void operator+=(sqr b){
			if(x0>b.x0) x0=b.x0;
			if(x1<b.x1) x1=b.x1;
			if(y0>b.y0) y0=b.y0;
			if(y1<b.y1) y1=b.y1;
		}
		void operator+=(pair<int,int> b){*this+={b.first,b.first,b.second,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){
		db csa=cos(ang=ang/180*pi),sia=sin(ang);
		return(trans([&](int x,int y){
			x-=rx/2.;y-=ry/2.;
			return(make_pair(x*csa+y*sia+rx/2.,-x*sia+y*csa+ry/2.));}));
	}
	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))>.16) 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],charset={"AxQ%f-;FAXg-wZsd57S [hTbG#n]32^|dTJ//j% $,%4\\ns'pcKkI66IuJs1 s3TZ/gx~RH8Xojo!CZs 2{Hd1u| ",
"($@P,-K{@3C<CKNRe6ZJ Cn^]-2?JcYj/|t|FY]9 $#/eljap#*JVGhB \"d ",
"=h'<zG4O|/D]dyy0aO1 k)>}GkxZ=L\\AB}|DJ1O &n6UED^$d3)/A/X1-?kg 'Fb:8t%*\"Qp \"r ",
"=h'<q<5YOwE@%X|\\{#A [PDl]+@HueYy%tIPf]g \"nbCd2S^S9\\<]}p5+NBn )zzniDe1Kyw=Z; ",
"cZ8N|{}P4Iz=4(AiJt! FA9x<4_\\(;O;]45?9g+ Bn~`WQ \"w '[DQhcJA&Z7H!#)/6D2 ",
"@#Rk(J'ZUkO;wt}+sqe s/F9Pf0w2&q5\"V3h`-I $7UIj0`GQc~hAo#Pl4cJ ('|,YU'JUD9 ",
"GsWKgb.dDv&J1U]a!#B :n.Ph;V,+I}pM8>ZL|w ATQketMq;r=$SRwu*L= JV[QS(J8n;i}!eSPSNV ",
"=  \"r F@S,#3P-*>=^WtNfqB& Co#Z1FPlTl'IF_eo!s= +Qxw@fO\\S#(C-6GdqE=L 2u\\$ ",
"AlZ&3UusxgB;\"O8f6BC 6Fl.+14.TFFP/C_t%|( g,Nm!a]}%U>oA/3lFJ@ @.c~g*CiH6f=\\O8;[M} %!nJs ",
"EYF50'a}7.]XLAP>&j3 &Ax(r.CO=aOmuj//C1s CzUYU!jSy]s_]XHI9<Q jbyZ5McEV/MA(l0_O9L ",
"JkEF_S%~~vT5Z-DWI]. VbDrf>(Ie,7C#*'F*X^ C'YYh4*V.JtnTKnv}V; N{rB~AkvI1d,eUS#-u6 (6l`N.Y ",
"K%3BR_yKvm[U}Ct<&`( VbDuz%`~O4P:SQ(}'*W BybZ?A&1.WOm6+>w+=9 JvxKKo0iUx;r4d/Yvs] *8R)RWO7 ",
",1`Q7Z14hw\"#D?Q^6 #\" %/LI)@ym)*-%2d0qnm ","=  #) ",
"%FB=bLFG+!:Nav]f.=6M gfrO _ 26e5^gS?Lt!THI,7B@| &8QgRu\\p$s7[0/ ",
"?u~eE4Uj<qR>`?^0S@{ +Qxv;?^{zNGk*StT5`y9 +Qxv;?^{zNGk*StT6uue (teU(yvl-eu,fvei-/HK 6 "};
char charname[17]="0123456789()+-*/";
string ans;
char BuF[1<<21];
void init(){
	for(int i=0;i<16;++i)
		for(db j=-15;j<16;j+=3){
			auto nxt=charset[i].rotate(j).reno();
			trans[i].eb(nxt.cut(-.1,-.1).reno());
			trans[i].eb(nxt.cut(-.1,.1).reno());
			trans[i].eb(nxt.cut(.1,-.1).reno());
			trans[i].eb(nxt.cut(.1,.1).reno());
			trans[i].eb(nxt);
		}
}
#define caseopt(x) case #x[0]:st0.back()x##=rhs;break;
#define pops(check)\
for(;check;st1.pop_back()){\
	int rhs=st0.back();\
	st0.pop_back();\
	switch(st1.back()){\
		caseopt(+)\
		caseopt(-)\
		caseopt(*)\
		caseopt(/)\
	}\
}
int level(char c){return(c==40?0:1+(c==42||c==47));}
void putans(auto s){
	vector<int> st0,st1;
	int now=0,num=0;
	for(auto c:s){
		if(isdigit(c)){
			(now*=10)+=c^48;
			num=1;
			continue;
		}
		if(num){
			st0.eb(now);
			num=now=0;
		}
		if(st1.size()&&c!=40){
			if(c==41){
				pops(st1.back()!=40)
				st1.pop_back();
				continue;
			}else pops(st1.size()&&level(c)<=level(st1.back()))
		}
		st1.eb(c);
	}
	if(isdigit(s.back())) st0.eb(now);
	pops(st1.size())
	printf("%d\n",st0.back());
}
int main(){
	scanf("%*d%*d%*d ");
	fread(BuF,1,1<<21,stdin);
	init();
	image in(BuF);
	for(auto &i:in.reno().split()){
		db bestmatch=0,tmp;int bestnum=0;
		for(int j=0;j<16;++j)
			if(!(tmp=i.match(charset[j]))||tmp>.5)
				for(auto &k:trans[j])
					if((tmp=i.match(k))>bestmatch){
						bestmatch=tmp;
						bestnum=j;
					}
		ans+=charname[bestnum];
	}
	putans(ans);
}

提出情報

コンパイルエラー

./Main.cpp: In lambda function:
./Main.cpp:31:25: warning: comparison of integer expressions of different signedness: ‘std::vector<bool>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
   31 |     if(raw.back().size()==ry) raw.eb(0);
      |        ~~~~~~~~~~~~~~~~~^~~~
./Main.cpp: At global scope:
./Main.cpp:167:13: warning: use of ‘auto’ in parameter declaration only available with ‘-fconcepts’
  167 | void putans(auto s){
      |             ^~~~
./Main.cpp: In function ‘int main()’:
./Main.cpp:194:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  194 |  scanf("%*d%*d%*d ");
      |  ~~~~~^~~~~~~~~~~~~~
./Main.cpp:195:7: warning: ignoring return value of ‘size_t fread(void*, size_t, size_t, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  195 |  fread(BuF,1,1<<21,stdin);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~

ジャッジ結果

セット名 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
得点 / 配点 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
結果
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
セット名 テストケース
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
ケース名 結果 実行時間 メモリ
000.txt AC 71 ms 11220 KiB
001.txt AC 70 ms 11244 KiB
002.txt AC 70 ms 11244 KiB
003.txt AC 80 ms 11188 KiB
004.txt AC 78 ms 11084 KiB
005.txt AC 81 ms 11188 KiB
006.txt AC 76 ms 11184 KiB
007.txt AC 81 ms 11080 KiB
008.txt AC 73 ms 11200 KiB
009.txt AC 76 ms 11160 KiB
010.txt AC 81 ms 11184 KiB
011.txt AC 79 ms 11176 KiB
012.txt AC 82 ms 11272 KiB
013.txt AC 81 ms 11236 KiB
014.txt AC 79 ms 11280 KiB
015.txt AC 80 ms 11184 KiB
016.txt AC 80 ms 11212 KiB
017.txt AC 79 ms 11156 KiB
018.txt AC 80 ms 11192 KiB
019.txt AC 81 ms 11180 KiB
020.txt AC 84 ms 11216 KiB
021.txt AC 82 ms 11080 KiB
022.txt AC 85 ms 11160 KiB
023.txt AC 82 ms 11280 KiB
024.txt AC 84 ms 11160 KiB
025.txt AC 85 ms 11188 KiB
026.txt AC 80 ms 11284 KiB
027.txt AC 80 ms 11188 KiB
028.txt AC 78 ms 11112 KiB
029.txt AC 79 ms 11188 KiB
030.txt AC 303 ms 11628 KiB
031.txt AC 244 ms 11660 KiB
032.txt AC 271 ms 11716 KiB
033.txt AC 275 ms 11748 KiB
034.txt AC 253 ms 11604 KiB
035.txt AC 264 ms 11640 KiB
036.txt AC 266 ms 11524 KiB
037.txt AC 264 ms 11596 KiB
038.txt AC 230 ms 11552 KiB
039.txt AC 290 ms 11608 KiB
040.txt AC 276 ms 11704 KiB
041.txt AC 292 ms 11736 KiB
042.txt AC 264 ms 11632 KiB
043.txt AC 258 ms 11544 KiB
044.txt AC 259 ms 11692 KiB
045.txt AC 304 ms 11628 KiB
046.txt AC 277 ms 11664 KiB
047.txt AC 288 ms 11700 KiB
048.txt AC 258 ms 11724 KiB
049.txt AC 281 ms 11548 KiB
050.txt AC 265 ms 11700 KiB
051.txt AC 253 ms 11676 KiB
052.txt AC 252 ms 11624 KiB
053.txt AC 264 ms 11684 KiB
054.txt AC 276 ms 11628 KiB
055.txt AC 264 ms 11544 KiB
056.txt AC 280 ms 11464 KiB
057.txt AC 179 ms 11680 KiB
058.txt AC 298 ms 11572 KiB
059.txt AC 240 ms 11560 KiB
060.txt AC 244 ms 11592 KiB
061.txt AC 241 ms 11576 KiB
062.txt AC 243 ms 11640 KiB
063.txt AC 211 ms 11440 KiB
064.txt AC 277 ms 11532 KiB
065.txt AC 236 ms 11580 KiB
066.txt AC 243 ms 11500 KiB
067.txt AC 224 ms 11524 KiB
068.txt AC 251 ms 11664 KiB
069.txt AC 241 ms 11544 KiB
070.txt AC 274 ms 11640 KiB
071.txt AC 263 ms 11616 KiB
072.txt AC 275 ms 11652 KiB
073.txt AC 284 ms 11644 KiB
074.txt AC 294 ms 11616 KiB
075.txt AC 252 ms 11664 KiB
076.txt AC 296 ms 11596 KiB
077.txt AC 307 ms 11624 KiB
078.txt AC 310 ms 11544 KiB
079.txt AC 274 ms 11676 KiB
080.txt AC 284 ms 11640 KiB
081.txt AC 267 ms 11532 KiB
082.txt AC 249 ms 11652 KiB
083.txt AC 282 ms 11620 KiB
084.txt AC 237 ms 11656 KiB
085.txt AC 274 ms 11540 KiB
086.txt AC 309 ms 11700 KiB
087.txt AC 266 ms 11640 KiB
088.txt AC 268 ms 11652 KiB
089.txt AC 268 ms 11684 KiB
090.txt AC 906 ms 12576 KiB
091.txt AC 1128 ms 12960 KiB
092.txt AC 1134 ms 12916 KiB
093.txt AC 1096 ms 12792 KiB
094.txt AC 1142 ms 12804 KiB
095.txt AC 1137 ms 12952 KiB
096.txt AC 1120 ms 12904 KiB
097.txt AC 1128 ms 12940 KiB
098.txt AC 1087 ms 12924 KiB
099.txt AC 1100 ms 12872 KiB
100.txt AC 993 ms 12872 KiB
101.txt AC 992 ms 12940 KiB
102.txt AC 951 ms 12932 KiB
103.txt AC 956 ms 13004 KiB
104.txt AC 1004 ms 12864 KiB
105.txt AC 993 ms 12928 KiB
106.txt AC 953 ms 13016 KiB
107.txt AC 1026 ms 12960 KiB
108.txt AC 999 ms 13060 KiB
109.txt AC 957 ms 12984 KiB
110.txt AC 948 ms 12908 KiB
111.txt AC 883 ms 12976 KiB
112.txt AC 948 ms 12996 KiB
113.txt AC 910 ms 12988 KiB
114.txt AC 869 ms 12936 KiB
115.txt AC 928 ms 12988 KiB
116.txt AC 848 ms 13020 KiB
117.txt AC 848 ms 13092 KiB
118.txt AC 903 ms 13016 KiB
119.txt AC 918 ms 13044 KiB
120.txt AC 892 ms 12960 KiB
121.txt AC 910 ms 13092 KiB
122.txt AC 884 ms 13068 KiB
123.txt AC 911 ms 13048 KiB
124.txt AC 878 ms 13140 KiB
125.txt AC 877 ms 13076 KiB
126.txt AC 903 ms 13000 KiB
127.txt AC 905 ms 13016 KiB
128.txt AC 815 ms 13196 KiB
129.txt AC 929 ms 12972 KiB
130.txt AC 871 ms 13116 KiB
131.txt AC 859 ms 13016 KiB
132.txt AC 967 ms 13008 KiB
133.txt AC 918 ms 12972 KiB
134.txt AC 906 ms 13120 KiB
135.txt AC 878 ms 13056 KiB
136.txt AC 899 ms 13024 KiB
137.txt AC 939 ms 13044 KiB
138.txt AC 842 ms 13000 KiB
139.txt AC 914 ms 13048 KiB