oj.uz

답안 #283624

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283624 2020-08-26T03:46:22 Z arnold518 Iqea (innopolis2018_final_C) C++14
36 / 100
 1658 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;
const int INF = 5e7;

int N;
pii A[MAXN+10];
vector<int> X[MAXN+10], Y[MAXN+10];

struct Line
{
	int l, r, p;
	Line(int l, int r, int p) : l(l), r(r), p(p) {}
	bool operator < (const Line &q) const { return r<q.r; }
};
int Q;
vector<Line> LX[MAXN+10], LY[MAXN+10];
vector<int> adjX[MAXN+10], adjY[MAXN+10];

pii get(int y, int x)
{
	int nx=lower_bound(LX[y].begin(), LX[y].end(), Line(0, x, 0))->p;
	int ny=lower_bound(LY[x].begin(), LY[x].end(), Line(0, y, 0))->p;
	return {nx, ny};
}

pii P[MAXN+10];

struct Tree
{
	int M;
	vector<int> adj[MAXN+10];
	int sz[MAXN+10], del[MAXN+10], cpar[MAXN+10], cdist[MAXN+10][30], cdep[MAXN+10];

	Tree()
	{
		memset(sz, 0, sizeof(sz));
		memset(del, 0, sizeof(del));
		memset(cpar, 0, sizeof(cpar));
		memset(cdist, 0, sizeof(cdist));
		memset(cdep, 0, sizeof(cdep));
		M=0;
		for(int i=1; i<=MAXN; i++) adj[i].clear();
	}

	void getsz(int now, int bef)
	{
		sz[now]=1;
		for(int nxt : adj[now])
		{
			if(nxt==bef) continue;
			if(del[nxt]) continue;
			getsz(nxt, now);
			sz[now]+=sz[nxt];
		}
	}

	int getcen(int now, int bef, int S)
	{
		for(int nxt : adj[now])
		{
			if(nxt==bef) continue;
			if(del[nxt]) continue;
			if(sz[nxt]>S/2) return getcen(nxt, now, S);
		}
		return now;
	}

	void dfs(int now, int bef, int t, int dist)
	{
		cdist[now][t]=dist;
		for(int nxt : adj[now])
		{
			if(nxt==bef) continue;
			if(del[nxt]) continue;
			dfs(nxt, now, t, dist+1);
		}
	}

	void decomp(int now, int bef, int cendep)
	{
		getsz(now, now);
		now=getcen(now, now, sz[now]/2);
		cpar[now]=bef;
		cdep[now]=cendep;

		dfs(now, now, cendep, 0);
		del[now]=true;

		for(auto nxt : adj[now])
		{
			if(del[nxt]) continue;
			decomp(nxt, now, cendep+1);
		}
	}

	void init()
	{
		decomp(1, 0, 1);
		for(int i=1; i<=M; i++) assert(del[i]);
	}

	vector<int> getpar(int now)
	{
		vector<int> ans;
		while(now)
		{
			ans.push_back(now);
			now=cpar[now];
		}
		return ans;
	}
}TX, TY;

vector<pii> TP1;
vector<int> TP2;

int main()
{
	scanf("%d", &N);
	for(int i=1; i<=N; i++)
	{
		int y, x;
		scanf("%d%d", &y, &x);
		A[i]={y, x};
		X[y].push_back(x);
		Y[x].push_back(y);
	}

	for(int i=1; i<=MAXN; i++)
	{
		if(X[i].empty()) continue;
		sort(X[i].begin(), X[i].end());

		int bef=X[i][0];
		for(int j=0; j+1<X[i].size(); j++)
		{
			if(X[i][j]+1!=X[i][j+1])
			{
				LX[i].push_back({bef, X[i][j], ++TX.M});
				//printf("LX %d %d %d %d\n", i, LX[i].back().l, LX[i].back().r, LX[i].back().p);
				bef=X[i][j+1];
			}
		}
		LX[i].push_back({bef, X[i].back(), ++TX.M});
		//printf("LX %d %d %d %d\n", i, LX[i].back().l, LX[i].back().r, LX[i].back().p);
	}

	int cnt=0;
	for(int i=2; i<=MAXN; i++)
	{
		int p=0;
		for(auto it : LX[i])
		{
			for(; p<LX[i-1].size() && LX[i-1][p].r<it.l; p++);
			for(; p<LX[i-1].size() && LX[i-1][p].l<=it.r; p++)
			{
				int u=LX[i-1][p].p, v=it.p;
				TX.adj[u].push_back(v);
				TX.adj[v].push_back(u);
				cnt++;
				//printf("adjX %d %d\n", u, v);
			}
			if(p) p--;
		}
	}
	assert(cnt==TX.M-1);

	for(int i=1; i<=MAXN; i++)
	{
		if(Y[i].empty()) continue;
		sort(Y[i].begin(), Y[i].end());

		int bef=Y[i][0];
		for(int j=0; j+1<Y[i].size(); j++)
		{
			if(Y[i][j]+1!=Y[i][j+1])
			{
				LY[i].push_back({bef, Y[i][j], ++TY.M});
				//printf("LY %d %d %d %d\n", i, LY[i].back().l, LY[i].back().r, LY[i].back().p);
				bef=Y[i][j+1];
			}
		}
		LY[i].push_back({bef, Y[i].back(), ++TY.M});
		//printf("LY %d %d %d %d\n", i, LY[i].back().l, LY[i].back().r, LY[i].back().p);
	}

	cnt=0;
	for(int i=2; i<=MAXN; i++)
	{
		int p=0;
		for(auto it : LY[i])
		{
			for(; p<LY[i-1].size() && LY[i-1][p].r<it.l; p++);
			for(; p<LY[i-1].size() && LY[i-1][p].l<=it.r; p++)
			{
				int u=LY[i-1][p].p, v=it.p;
				TY.adj[u].push_back(v);
				TY.adj[v].push_back(u);
				cnt++;
				//printf("adjY %d %d\n", u, v);
			}
			if(p) p--;
		}
	}
	assert(cnt==TY.M-1);

	TX.init(); TY.init();

	for(int i=1; i<=N; i++)
	{
		P[i]=get(A[i].first, A[i].second);
		vector<int> V1=TX.getpar(P[i].first);
		vector<int> V2=TY.getpar(P[i].second);
		for(auto it : V1) for(auto jt : V2) TP1.push_back({it, jt});
	}
	sort(TP1.begin(), TP1.end());
	TP1.erase(unique(TP1.begin(), TP1.end()), TP1.end());
	TP2=vector<int>(TP1.size(), INF);

	scanf("%d", &Q);
	bool flag=false;
	while(Q--)
	{
		int tt, y, x;
		scanf("%d%d%d", &tt, &y, &x);

		pii t=get(y, x);

		vector<int> V1=TX.getpar(t.first);
		vector<int> V2=TY.getpar(t.second);

		if(tt==1)
		{
			for(auto it : V1) for(auto jt : V2)
			{
				int pt=lower_bound(TP1.begin(), TP1.end(), pii(it, jt))-TP1.begin();
				TP2[pt]=min(TP2[pt], TX.cdist[t.first][TX.cdep[it]]+TY.cdist[t.second][TY.cdep[jt]]);
			}
		}
		else
		{
			int ans=INF;
			for(auto it : V1) for(auto jt : V2)
			{
				int pt=lower_bound(TP1.begin(), TP1.end(), pii(it, jt))-TP1.begin();
				ans=min(ans, TX.cdist[t.first][TX.cdep[it]]+TY.cdist[t.second][TY.cdep[jt]]+TP2[pt]);
			}
			if(ans==INF) ans=-1;
			printf("%d\n", ans);
		}
	}
}

Compilation message

C.cpp: In function 'int main()':
C.cpp:141:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |   for(int j=0; j+1<X[i].size(); j++)
      |                ~~~^~~~~~~~~~~~
C.cpp:160:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  160 |    for(; p<LX[i-1].size() && LX[i-1][p].r<it.l; p++);
      |          ~^~~~~~~~~~~~~~~
C.cpp:161:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  161 |    for(; p<LX[i-1].size() && LX[i-1][p].l<=it.r; p++)
      |          ~^~~~~~~~~~~~~~~
C.cpp:180:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  180 |   for(int j=0; j+1<Y[i].size(); j++)
      |                ~~~^~~~~~~~~~~~
C.cpp:199:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  199 |    for(; p<LY[i-1].size() && LY[i-1][p].r<it.l; p++);
      |          ~^~~~~~~~~~~~~~~
C.cpp:200:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  200 |    for(; p<LY[i-1].size() && LY[i-1][p].l<=it.r; p++)
      |          ~^~~~~~~~~~~~~~~
C.cpp:227:7: warning: unused variable 'flag' [-Wunused-variable]
  227 |  bool flag=false;
      |       ^~~~
C.cpp:125:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  125 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
C.cpp:129:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  129 |   scanf("%d%d", &y, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~
C.cpp:226:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  226 |  scanf("%d", &Q);
      |  ~~~~~^~~~~~~~~~
C.cpp:231:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  231 |   scanf("%d%d%d", &tt, &y, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 45696 KB Output is correct
2 Correct 30 ms 45808 KB Output is correct
3 Correct 30 ms 45816 KB Output is correct
4 Correct 88 ms 50156 KB Output is correct
5 Correct 84 ms 50156 KB Output is correct
6 Correct 92 ms 50156 KB Output is correct
7 Correct 125 ms 50408 KB Output is correct
8 Correct 128 ms 50408 KB Output is correct
9 Correct 131 ms 50416 KB Output is correct
10 Correct 134 ms 50280 KB Output is correct
11 Correct 131 ms 50440 KB Output is correct
12 Correct 143 ms 50312 KB Output is correct
13 Correct 135 ms 50408 KB Output is correct
14 Correct 130 ms 50408 KB Output is correct
15 Correct 123 ms 50408 KB Output is correct
16 Correct 137 ms 54500 KB Output is correct
17 Correct 130 ms 50400 KB Output is correct
18 Correct 139 ms 50396 KB Output is correct
19 Correct 134 ms 50288 KB Output is correct
20 Correct 127 ms 50440 KB Output is correct
21 Correct 130 ms 50408 KB Output is correct
22 Correct 171 ms 54632 KB Output is correct
23 Correct 154 ms 54632 KB Output is correct
24 Correct 163 ms 54892 KB Output is correct
25 Correct 59 ms 47736 KB Output is correct
26 Correct 68 ms 48496 KB Output is correct
27 Correct 51 ms 47860 KB Output is correct
28 Correct 164 ms 54892 KB Output is correct
29 Correct 161 ms 54884 KB Output is correct
30 Correct 176 ms 54888 KB Output is correct
31 Correct 169 ms 54888 KB Output is correct
32 Correct 167 ms 54760 KB Output is correct
33 Correct 166 ms 54632 KB Output is correct
34 Correct 168 ms 54756 KB Output is correct
35 Correct 174 ms 54904 KB Output is correct
36 Correct 50 ms 47860 KB Output is correct
37 Correct 173 ms 54884 KB Output is correct
38 Correct 167 ms 54884 KB Output is correct
39 Correct 171 ms 54888 KB Output is correct
40 Correct 167 ms 54888 KB Output is correct
41 Correct 162 ms 54756 KB Output is correct
42 Correct 161 ms 54760 KB Output is correct
43 Correct 53 ms 47728 KB Output is correct
44 Correct 169 ms 54728 KB Output is correct
45 Correct 166 ms 54760 KB Output is correct
46 Correct 53 ms 47728 KB Output is correct
47 Correct 111 ms 50292 KB Output is correct
48 Correct 120 ms 50280 KB Output is correct
49 Correct 104 ms 50152 KB Output is correct
50 Correct 110 ms 50152 KB Output is correct
51 Correct 89 ms 50164 KB Output is correct
52 Correct 127 ms 50412 KB Output is correct
53 Correct 123 ms 50412 KB Output is correct
54 Correct 147 ms 54416 KB Output is correct
55 Correct 135 ms 54504 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 45696 KB Output is correct
2 Correct 30 ms 45808 KB Output is correct
3 Correct 30 ms 45816 KB Output is correct
4 Correct 88 ms 50156 KB Output is correct
5 Correct 84 ms 50156 KB Output is correct
6 Correct 92 ms 50156 KB Output is correct
7 Correct 125 ms 50408 KB Output is correct
8 Correct 128 ms 50408 KB Output is correct
9 Correct 131 ms 50416 KB Output is correct
10 Correct 134 ms 50280 KB Output is correct
11 Correct 131 ms 50440 KB Output is correct
12 Correct 143 ms 50312 KB Output is correct
13 Correct 135 ms 50408 KB Output is correct
14 Correct 130 ms 50408 KB Output is correct
15 Correct 123 ms 50408 KB Output is correct
16 Correct 137 ms 54500 KB Output is correct
17 Correct 130 ms 50400 KB Output is correct
18 Correct 139 ms 50396 KB Output is correct
19 Correct 134 ms 50288 KB Output is correct
20 Correct 127 ms 50440 KB Output is correct
21 Correct 130 ms 50408 KB Output is correct
22 Correct 171 ms 54632 KB Output is correct
23 Correct 154 ms 54632 KB Output is correct
24 Correct 163 ms 54892 KB Output is correct
25 Correct 59 ms 47736 KB Output is correct
26 Correct 68 ms 48496 KB Output is correct
27 Correct 51 ms 47860 KB Output is correct
28 Correct 164 ms 54892 KB Output is correct
29 Correct 161 ms 54884 KB Output is correct
30 Correct 176 ms 54888 KB Output is correct
31 Correct 169 ms 54888 KB Output is correct
32 Correct 167 ms 54760 KB Output is correct
33 Correct 166 ms 54632 KB Output is correct
34 Correct 168 ms 54756 KB Output is correct
35 Correct 174 ms 54904 KB Output is correct
36 Correct 50 ms 47860 KB Output is correct
37 Correct 173 ms 54884 KB Output is correct
38 Correct 167 ms 54884 KB Output is correct
39 Correct 171 ms 54888 KB Output is correct
40 Correct 167 ms 54888 KB Output is correct
41 Correct 162 ms 54756 KB Output is correct
42 Correct 161 ms 54760 KB Output is correct
43 Correct 53 ms 47728 KB Output is correct
44 Correct 169 ms 54728 KB Output is correct
45 Correct 166 ms 54760 KB Output is correct
46 Correct 53 ms 47728 KB Output is correct
47 Correct 111 ms 50292 KB Output is correct
48 Correct 120 ms 50280 KB Output is correct
49 Correct 104 ms 50152 KB Output is correct
50 Correct 110 ms 50152 KB Output is correct
51 Correct 89 ms 50164 KB Output is correct
52 Correct 127 ms 50412 KB Output is correct
53 Correct 123 ms 50412 KB Output is correct
54 Correct 147 ms 54416 KB Output is correct
55 Correct 135 ms 54504 KB Output is correct
56 Correct 690 ms 50148 KB Output is correct
57 Correct 699 ms 50156 KB Output is correct
58 Correct 658 ms 50156 KB Output is correct
59 Correct 1110 ms 50428 KB Output is correct
60 Correct 1116 ms 50412 KB Output is correct
61 Correct 1138 ms 50524 KB Output is correct
62 Correct 1143 ms 50360 KB Output is correct
63 Correct 1082 ms 50408 KB Output is correct
64 Correct 1184 ms 50652 KB Output is correct
65 Correct 1014 ms 50412 KB Output is correct
66 Correct 1206 ms 50684 KB Output is correct
67 Correct 1118 ms 50408 KB Output is correct
68 Correct 1132 ms 50652 KB Output is correct
69 Correct 1084 ms 50280 KB Output is correct
70 Correct 1182 ms 50480 KB Output is correct
71 Correct 1144 ms 50284 KB Output is correct
72 Correct 1188 ms 51004 KB Output is correct
73 Correct 1182 ms 50524 KB Output is correct
74 Correct 293 ms 47728 KB Output is correct
75 Correct 381 ms 48496 KB Output is correct
76 Correct 218 ms 47860 KB Output is correct
77 Correct 1588 ms 54884 KB Output is correct
78 Correct 1592 ms 54888 KB Output is correct
79 Correct 207 ms 47860 KB Output is correct
80 Correct 1658 ms 54880 KB Output is correct
81 Correct 1628 ms 54884 KB Output is correct
82 Correct 1496 ms 54756 KB Output is correct
83 Correct 1515 ms 54756 KB Output is correct
84 Correct 272 ms 47728 KB Output is correct
85 Correct 1499 ms 54756 KB Output is correct
86 Correct 1500 ms 54760 KB Output is correct
87 Correct 249 ms 47808 KB Output is correct
88 Correct 1037 ms 50284 KB Output is correct
89 Correct 1071 ms 50520 KB Output is correct
90 Correct 886 ms 50152 KB Output is correct
91 Correct 849 ms 50152 KB Output is correct
92 Correct 690 ms 50156 KB Output is correct
93 Correct 1102 ms 50648 KB Output is correct
94 Correct 1010 ms 50512 KB Output is correct
95 Correct 1233 ms 54632 KB Output is correct
96 Correct 1264 ms 54504 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 667 ms 81188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 537 ms 262148 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 45696 KB Output is correct
2 Correct 30 ms 45808 KB Output is correct
3 Correct 30 ms 45816 KB Output is correct
4 Correct 88 ms 50156 KB Output is correct
5 Correct 84 ms 50156 KB Output is correct
6 Correct 92 ms 50156 KB Output is correct
7 Correct 125 ms 50408 KB Output is correct
8 Correct 128 ms 50408 KB Output is correct
9 Correct 131 ms 50416 KB Output is correct
10 Correct 134 ms 50280 KB Output is correct
11 Correct 131 ms 50440 KB Output is correct
12 Correct 143 ms 50312 KB Output is correct
13 Correct 135 ms 50408 KB Output is correct
14 Correct 130 ms 50408 KB Output is correct
15 Correct 123 ms 50408 KB Output is correct
16 Correct 137 ms 54500 KB Output is correct
17 Correct 130 ms 50400 KB Output is correct
18 Correct 139 ms 50396 KB Output is correct
19 Correct 134 ms 50288 KB Output is correct
20 Correct 127 ms 50440 KB Output is correct
21 Correct 130 ms 50408 KB Output is correct
22 Correct 171 ms 54632 KB Output is correct
23 Correct 154 ms 54632 KB Output is correct
24 Correct 163 ms 54892 KB Output is correct
25 Correct 59 ms 47736 KB Output is correct
26 Correct 68 ms 48496 KB Output is correct
27 Correct 51 ms 47860 KB Output is correct
28 Correct 164 ms 54892 KB Output is correct
29 Correct 161 ms 54884 KB Output is correct
30 Correct 176 ms 54888 KB Output is correct
31 Correct 169 ms 54888 KB Output is correct
32 Correct 167 ms 54760 KB Output is correct
33 Correct 166 ms 54632 KB Output is correct
34 Correct 168 ms 54756 KB Output is correct
35 Correct 174 ms 54904 KB Output is correct
36 Correct 50 ms 47860 KB Output is correct
37 Correct 173 ms 54884 KB Output is correct
38 Correct 167 ms 54884 KB Output is correct
39 Correct 171 ms 54888 KB Output is correct
40 Correct 167 ms 54888 KB Output is correct
41 Correct 162 ms 54756 KB Output is correct
42 Correct 161 ms 54760 KB Output is correct
43 Correct 53 ms 47728 KB Output is correct
44 Correct 169 ms 54728 KB Output is correct
45 Correct 166 ms 54760 KB Output is correct
46 Correct 53 ms 47728 KB Output is correct
47 Correct 111 ms 50292 KB Output is correct
48 Correct 120 ms 50280 KB Output is correct
49 Correct 104 ms 50152 KB Output is correct
50 Correct 110 ms 50152 KB Output is correct
51 Correct 89 ms 50164 KB Output is correct
52 Correct 127 ms 50412 KB Output is correct
53 Correct 123 ms 50412 KB Output is correct
54 Correct 147 ms 54416 KB Output is correct
55 Correct 135 ms 54504 KB Output is correct
56 Correct 690 ms 50148 KB Output is correct
57 Correct 699 ms 50156 KB Output is correct
58 Correct 658 ms 50156 KB Output is correct
59 Correct 1110 ms 50428 KB Output is correct
60 Correct 1116 ms 50412 KB Output is correct
61 Correct 1138 ms 50524 KB Output is correct
62 Correct 1143 ms 50360 KB Output is correct
63 Correct 1082 ms 50408 KB Output is correct
64 Correct 1184 ms 50652 KB Output is correct
65 Correct 1014 ms 50412 KB Output is correct
66 Correct 1206 ms 50684 KB Output is correct
67 Correct 1118 ms 50408 KB Output is correct
68 Correct 1132 ms 50652 KB Output is correct
69 Correct 1084 ms 50280 KB Output is correct
70 Correct 1182 ms 50480 KB Output is correct
71 Correct 1144 ms 50284 KB Output is correct
72 Correct 1188 ms 51004 KB Output is correct
73 Correct 1182 ms 50524 KB Output is correct
74 Correct 293 ms 47728 KB Output is correct
75 Correct 381 ms 48496 KB Output is correct
76 Correct 218 ms 47860 KB Output is correct
77 Correct 1588 ms 54884 KB Output is correct
78 Correct 1592 ms 54888 KB Output is correct
79 Correct 207 ms 47860 KB Output is correct
80 Correct 1658 ms 54880 KB Output is correct
81 Correct 1628 ms 54884 KB Output is correct
82 Correct 1496 ms 54756 KB Output is correct
83 Correct 1515 ms 54756 KB Output is correct
84 Correct 272 ms 47728 KB Output is correct
85 Correct 1499 ms 54756 KB Output is correct
86 Correct 1500 ms 54760 KB Output is correct
87 Correct 249 ms 47808 KB Output is correct
88 Correct 1037 ms 50284 KB Output is correct
89 Correct 1071 ms 50520 KB Output is correct
90 Correct 886 ms 50152 KB Output is correct
91 Correct 849 ms 50152 KB Output is correct
92 Correct 690 ms 50156 KB Output is correct
93 Correct 1102 ms 50648 KB Output is correct
94 Correct 1010 ms 50512 KB Output is correct
95 Correct 1233 ms 54632 KB Output is correct
96 Correct 1264 ms 54504 KB Output is correct
97 Incorrect 667 ms 81188 KB Output isn't correct
98 Halted 0 ms 0 KB -