oj.uz

답안 #975472

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
975472 2024-05-05T08:54:35 Z oolimry 화성 (APIO22_mars) C++17
100 / 100
 1816 ms 7220 KB 
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define showlist(x) cerr << #x << " is "; for(auto p : x) cerr << p << " "; cerr << endl;
typedef pair<int,int> ii;

/* 	credits: https://codeforces.com/blog/entry/103229?#comment-917407
* step 1: push all the information into a 5x5 square
* 	define a function group(i,j,k) that says at iteration k, cell i, j belongs to which group
* 	we want 25 groups at the end, group(i,j,k) is a function that roughly divides the grid into 25 roughly equal sized squares
* 
* step 2: divide the grid into 4 quadrants, each of size (n+1) by (n+1).
* 	for each quadrant, store the number of internal components, and the state of the border^ (row n and column n)
* 	store this at (0,0), (0,2), (2,0), (2,2) for each of the 4 quadrants respectively
* 
* step 3: on the 3x3 grid, 
*   decode the info at (0,0), (0,2), (2,0), (2,2)
* 	do more dfs on the row n and column n information to find the remaining components
* 	then add on the number on internal components in each quadrant
* 
* 
* ^ how to store the state of the border:
* 	we reserve 10 bits to store the number of internal components
* 	there are 2*n+1 <= 41 cells on the border --> 41 more bits
* 	the bits on the border, we divide them into consecutive groups
* 	observe the connectivity of the groups follows a bracket sequence
* 	for example, a b a c c a is (a_(b)_a_(c__c)a)
* 	store 1 bit for whether there is a open bracket before each group
* 	and 1 bit for whether there is a close bracket after
* 	max n+1 groups --> 2n+2 = 42 extra bits to store this info
*/

int grid[45][45];
int ccCounter = 1;
map<ii, vector<ii> > adj;
void resetgrid(){
	ccCounter = 1;
	adj.clear();
	for(int i = 0;i < 45;i++) for(int j = 0;j < 45;j++) grid[i][j] = 0;
}

void dfs(int i, int j){
	if(i < 0 or j < 0) return;
	if(grid[i][j] != -1) return;
	
	grid[i][j] = ccCounter;
	
	for(ii a : adj[ii(i,j)]) dfs(a.first, a.second);
	dfs(i+1,j);
	dfs(i-1,j);
	dfs(i,j+1);
	dfs(i,j-1);
}

void orTo(string &a, string b){ ///sets a = a | b
	for(int p = 0;p < 100;p++){
		if(b[p] == '1') a[p] = '1';
	}
}

int n, K;
ii group(int i, int j, int k){ ///step 1 --> group function
	vector<int> things = {};
	for(int i = 0;i <= 2*n - 2*k;i++) things.push_back((i*5) / (2*n - 2*k+1));
	sort(all(things));

	int G = things[i]*10 + things[j]; //((i) / sqsize) * 10 + (j) / sqsize;
	int P = ((i) % 10) * 10 + ((j)%10);
	return {G,P};
}

string writeNumber(int cnt){ ///writes a string with the first bits being the number
	string res = string(100,'0');
	for(int p = 0;p < 100;p++){
		if(cnt % 2 == 1) res[p] = '1';
		cnt /= 2;
	}
	return res;
}

/// we store the no. of internal components from 0-9
/// border cells 0 or 1 from 10-54
/// the bracket group info from 55 onwards
const int CNTBUFFER = 10; 
const int GROUPBUFFER = 55;

///used in step 3, used to decode the quadrant info from step 2
pair<int, vector<int> > decode(string res){ 
	int internalComponents = 0;
	
	for(int b = 0;b < CNTBUFFER;b++){
		if(res[b] == '1') internalComponents += (1LL <<b);
	}
	
	int b = CNTBUFFER;
	vector<int> colors;
	
	for(int i = 0;i <= 2*n;i++){
		colors.push_back(res[b] - '0');
		b++;
	}
	
	vector<vector<int> > groups;
	
	int pre = -1;
	for(int i = 0;i <= 2*n;i++){
		if(colors[i] == 1 ){
			if(pre != 1) groups.push_back({});
			groups.back().push_back(i);
		}
		
		pre = colors[i];
	}
	
	vector<int> S; 
	b = GROUPBUFFER;
	int cnt = 1;
	
	for(auto &v : groups){
		if(res[b] == '1') S.push_back(cnt++);
		b++;
		
		for(int i : v) colors[i] = S.back();
		
		if(res[b] == '1') S.pop_back();
		b++;
	}
	
	
	return {internalComponents, colors};
}


/// step 2 function, given the quadrant, return a string encoding
/// no. of internal components & border info
/// takes in a list of cells, rotated such that the border we're interested at top left corner
string generateCorner(vector<vector<int> > g){ 
	int internalComponents = 0;
	
	resetgrid();
	
	for(int i = 0;i <= n;i++){
		for(int j = 0;j <= n;j++){
			grid[i][j] = -g[i][j];
		}
	}
	
	for(int i = 0;i <= n;i++){
		for(int j = 0;j <= n;j++){
			if(grid[i][j] == -1){
				dfs(i,j);
				ccCounter++;
			}
		}
	}
	
	/// debug: coloring (color = component color) of the grid
	/* 
	for(int i = 0;i <= n;i++){
		for(int j = 0;j <= n;j++){
			cerr << grid[i][j] << " ";
		}
		cerr << endl;
	}
	
	//*/
	
	set<int> borderComponents;
	for(int i = 0;i <= n;i++){
		for(int j = 0;j <= n;j++){
			if((i == 0 or j == 0) and grid[i][j] != 0){
				borderComponents.insert(grid[i][j]);
			}
		}
	}
	
	internalComponents = ccCounter - 1 - sz(borderComponents);
	string res = writeNumber(internalComponents);
	
	vector<ii> order;
	for(int i = n;i >= 1;i--) order.push_back(ii(i,0));
	for(int j = 0;j <= n;j++) order.push_back(ii(0,j));
	
	vector<int> colors;
	for(ii cell : order) colors.push_back(grid[cell.first][cell.second]);
		
	vector<int> groups;
	
	int b = CNTBUFFER;
	int pre = -1;
	for(int x : colors){
		if(x != 0){
			res[b] = '1';
			
			if(pre != x) groups.push_back(x);
		}
		b++;
		pre = x;
	}
	
	map<int,vector<int> > grouppos;
	for(int i = 0;i < sz(groups);i++){
		grouppos[groups[i]].push_back(i);
	}
	
	b = GROUPBUFFER;
	for(int i = 0;i < sz(groups);i++){
		int g  = groups[i];
		if(i == grouppos[g][0]) res[b] = '1';
		b++;
		if(i == grouppos[g].back()) res[b] = '1';
		b++;
	}
		
	auto decoded = decode(res); 
	
	/// debug: check decoded.first == internalComponents
	//show(internalComponents); show(decoded.first); 
	
	
	/// debug: check decoded.second ~= colors
	//showlist(colors); showlist(decoded.second);
	
	
	return res;
}

///returns the number of internal components in the quadrant (di,dj)
///and also fills in the grid + the adjacency list
int lastStepConnectivity(int di, int dj, string res){
	vector<ii> order;
	for(int i = n;i >= 1;i--) order.push_back(ii(i+n,n));
	for(int j = 0;j <= n;j++) order.push_back(ii(n,j+n));
		
	for(ii &v : order){
		if(di == 0) v.first = 2*n - v.first;
		if(dj == 0) v.second = 2*n - v.second;
	}
	
	auto ddd = decode(res);
	int internalComponents = ddd.first;
	vector<int> colors = ddd.second;
	
	map<int, ii> pre;
	for(int i = 0;i < sz(order);i++){
		ii cell = order[i];
		int c = colors[i];
		if(c != 0){
			grid[cell.first][cell.second] = -1;
		
			if(pre.find(c) != pre.end()){
				ii cell2 = pre[c];
				adj[cell].push_back(cell2);
				adj[cell2].push_back(cell);
			}
			pre[c] = cell;
		}
	}
	
	return internalComponents;
}


 
string process(vector <vector<string>> a, int I, int J, int K, int _n){
	n = _n;
	
	/// debug: checking if the grouping algo is good
	/*
	for(int k = 0;k < n;k++){
		for(int i = 0;i <= 2*n - 2*k;i++){
			for(int j = 0;j <= 2*n - 2*k;j++){
				int g = group(i,j,k).first;
				if(g < 10) cerr << " ";
				cerr << g << " ";
			}
			cerr << endl;
		}
		cerr << endl;
	}
	exit(0);
	//*/
	
	
	if(_n == 1){
		resetgrid();
		for(int i = 0;i <= 2;i++){
			for(int j = 0;j <= 2;j++){
				if(a[i][j][0] == '1') grid[i][j] = -1;
			}
		}
		
		int ans = 0;
		for(int i = 0;i <= 2;i++){
			for(int j = 0;j <= 2;j++){
				if(grid[i][j] == -1){
					dfs(i,j);
					ans++;
				}
			}
		}
		
		string res = writeNumber(ans);
		return res;
	}
	
	string res = string(100 ,'0');
	
	if(K == 0){ ///first run
		for(int io = 0;io <= 2;io++){
			for(int jo = 0;jo <= 2;jo++){
				if(a[io][jo][0] == '1'){
					a[io][jo] = string(100, '0');
					a[io][jo][group(io+I,jo+J,0).second] = '1';
				}
				else a[io][jo] = string(100, '0');
			}
		}
	}
	
	if(K == n-1){ ///last phase --> convert to binary 
		resetgrid();
		
		int ans = 0;
		ans += lastStepConnectivity(0,0,a[0][0]);
		ans += lastStepConnectivity(0,2,a[0][2]);
		ans += lastStepConnectivity(2,0,a[2][0]);
		ans += lastStepConnectivity(2,2,a[2][2]);
		
		/// debug: check if the row n and column n border is copied correctly
		/*
		for(int i = 0;i <= 2*n;i++){
			for(int j = 0;j <= 2*n;j++){
				cerr << grid[i][j] << " ";
			}
			cerr << endl;
		}
		//*/
		
		int laterComponents = 0;
		for(int i = 0;i <= 2*n;i++){
			for(int j = 0;j <= 2*n;j++){
				if(grid[i][j] == -1){
					dfs(i,j);
					laterComponents++;
				}
			}
		}
			
		res = writeNumber(ans + laterComponents);
		
		return res;
	}
	
	if(K <= n-2){
		for(int i = 0;i <= 2;i++){
			for(int j = 0;j <= 2;j++){
				if(group(I,J,K+1).first == group(i+I, j+J, K).first){
					orTo(res, a[i][j]);
				} 
			}
		}
	}
	if(K == n-2){
		if(I == 1 or J == 1) return res;
		
		map<ii, ii> GPtoCell;
		for(int i = 0;i <= 2*n;i++){
			for(int j = 0;j <= 2*n;j++){
				GPtoCell[group(i,j,0)] = ii(i,j);
			}
		}

		vector<vector<int> > g;
		
		resetgrid();
		for(int io = 0;io <= 2;io++){
			for(int jo = 0;jo <= 2;jo++){
				int groupno = group(io+I,jo+J,K).first;
				for(int p = 0;p < 100;p++){
					if(a[io][jo][p] == '1'){
						ii cell = GPtoCell[{groupno, p}];
						grid[cell.first][cell.second] = 1;
					}
				}
			}
		}
		
		/// debug: check if the quadrant cells are copied correctly
		/*
		for(int i = 0;i <= 2*n;i++){
			for(int j = 0;j <= 2*n;j++){
				cerr << grid[i][j] << " ";
			}
			cerr << endl;
		}
		//*/
		
		int di = (I-1), dj = (J-1);
		
		for(int i = n;i >= 0 and i <= 2*n;i += di){
			g.push_back({});
			for(int j = n;j >= 0 and j <= 2*n;j += dj){
				g.back().push_back(grid[i][j]);
			}
		}
		
		res = generateCorner(g);		
	}
	
	return res;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3972 KB Output is correct
2 Correct 8 ms 4220 KB Output is correct
3 Correct 8 ms 3460 KB Output is correct
4 Correct 7 ms 3872 KB Output is correct
5 Correct 8 ms 3788 KB Output is correct
6 Correct 8 ms 3780 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3972 KB Output is correct
2 Correct 8 ms 4220 KB Output is correct
3 Correct 8 ms 3460 KB Output is correct
4 Correct 7 ms 3872 KB Output is correct
5 Correct 8 ms 3788 KB Output is correct
6 Correct 8 ms 3780 KB Output is correct
7 Correct 8 ms 4228 KB Output is correct
8 Correct 16 ms 4228 KB Output is correct
9 Correct 16 ms 4080 KB Output is correct
10 Correct 14 ms 3828 KB Output is correct
11 Correct 13 ms 4664 KB Output is correct
12 Correct 16 ms 4304 KB Output is correct
13 Correct 17 ms 4236 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3972 KB Output is correct
2 Correct 8 ms 4220 KB Output is correct
3 Correct 8 ms 3460 KB Output is correct
4 Correct 7 ms 3872 KB Output is correct
5 Correct 8 ms 3788 KB Output is correct
6 Correct 8 ms 3780 KB Output is correct
7 Correct 8 ms 4228 KB Output is correct
8 Correct 16 ms 4228 KB Output is correct
9 Correct 16 ms 4080 KB Output is correct
10 Correct 14 ms 3828 KB Output is correct
11 Correct 13 ms 4664 KB Output is correct
12 Correct 16 ms 4304 KB Output is correct
13 Correct 17 ms 4236 KB Output is correct
14 Correct 34 ms 4040 KB Output is correct
15 Correct 41 ms 4288 KB Output is correct
16 Correct 42 ms 4076 KB Output is correct
17 Correct 40 ms 4132 KB Output is correct
18 Correct 35 ms 4196 KB Output is correct
19 Correct 37 ms 3968 KB Output is correct
20 Correct 35 ms 4376 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3972 KB Output is correct
2 Correct 8 ms 4220 KB Output is correct
3 Correct 8 ms 3460 KB Output is correct
4 Correct 7 ms 3872 KB Output is correct
5 Correct 8 ms 3788 KB Output is correct
6 Correct 8 ms 3780 KB Output is correct
7 Correct 8 ms 4228 KB Output is correct
8 Correct 16 ms 4228 KB Output is correct
9 Correct 16 ms 4080 KB Output is correct
10 Correct 14 ms 3828 KB Output is correct
11 Correct 13 ms 4664 KB Output is correct
12 Correct 16 ms 4304 KB Output is correct
13 Correct 17 ms 4236 KB Output is correct
14 Correct 34 ms 4040 KB Output is correct
15 Correct 41 ms 4288 KB Output is correct
16 Correct 42 ms 4076 KB Output is correct
17 Correct 40 ms 4132 KB Output is correct
18 Correct 35 ms 4196 KB Output is correct
19 Correct 37 ms 3968 KB Output is correct
20 Correct 35 ms 4376 KB Output is correct
21 Correct 65 ms 4456 KB Output is correct
22 Correct 91 ms 4236 KB Output is correct
23 Correct 87 ms 4140 KB Output is correct
24 Correct 85 ms 4036 KB Output is correct
25 Correct 87 ms 4336 KB Output is correct
26 Correct 94 ms 3936 KB Output is correct
27 Correct 93 ms 3992 KB Output is correct
28 Correct 85 ms 4236 KB Output is correct

Subtask #5
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3972 KB Output is correct
2 Correct 8 ms 4220 KB Output is correct
3 Correct 8 ms 3460 KB Output is correct
4 Correct 7 ms 3872 KB Output is correct
5 Correct 8 ms 3788 KB Output is correct
6 Correct 8 ms 3780 KB Output is correct
7 Correct 8 ms 4228 KB Output is correct
8 Correct 16 ms 4228 KB Output is correct
9 Correct 16 ms 4080 KB Output is correct
10 Correct 14 ms 3828 KB Output is correct
11 Correct 13 ms 4664 KB Output is correct
12 Correct 16 ms 4304 KB Output is correct
13 Correct 17 ms 4236 KB Output is correct
14 Correct 34 ms 4040 KB Output is correct
15 Correct 41 ms 4288 KB Output is correct
16 Correct 42 ms 4076 KB Output is correct
17 Correct 40 ms 4132 KB Output is correct
18 Correct 35 ms 4196 KB Output is correct
19 Correct 37 ms 3968 KB Output is correct
20 Correct 35 ms 4376 KB Output is correct
21 Correct 65 ms 4456 KB Output is correct
22 Correct 91 ms 4236 KB Output is correct
23 Correct 87 ms 4140 KB Output is correct
24 Correct 85 ms 4036 KB Output is correct
25 Correct 87 ms 4336 KB Output is correct
26 Correct 94 ms 3936 KB Output is correct
27 Correct 93 ms 3992 KB Output is correct
28 Correct 85 ms 4236 KB Output is correct
29 Correct 132 ms 3912 KB Output is correct
30 Correct 182 ms 4288 KB Output is correct
31 Correct 183 ms 4296 KB Output is correct
32 Correct 175 ms 4280 KB Output is correct
33 Correct 184 ms 4604 KB Output is correct
34 Correct 187 ms 4032 KB Output is correct
35 Correct 181 ms 4096 KB Output is correct
36 Correct 167 ms 4412 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3972 KB Output is correct
2 Correct 8 ms 4220 KB Output is correct
3 Correct 8 ms 3460 KB Output is correct
4 Correct 7 ms 3872 KB Output is correct
5 Correct 8 ms 3788 KB Output is correct
6 Correct 8 ms 3780 KB Output is correct
7 Correct 8 ms 4228 KB Output is correct
8 Correct 16 ms 4228 KB Output is correct
9 Correct 16 ms 4080 KB Output is correct
10 Correct 14 ms 3828 KB Output is correct
11 Correct 13 ms 4664 KB Output is correct
12 Correct 16 ms 4304 KB Output is correct
13 Correct 17 ms 4236 KB Output is correct
14 Correct 34 ms 4040 KB Output is correct
15 Correct 41 ms 4288 KB Output is correct
16 Correct 42 ms 4076 KB Output is correct
17 Correct 40 ms 4132 KB Output is correct
18 Correct 35 ms 4196 KB Output is correct
19 Correct 37 ms 3968 KB Output is correct
20 Correct 35 ms 4376 KB Output is correct
21 Correct 65 ms 4456 KB Output is correct
22 Correct 91 ms 4236 KB Output is correct
23 Correct 87 ms 4140 KB Output is correct
24 Correct 85 ms 4036 KB Output is correct
25 Correct 87 ms 4336 KB Output is correct
26 Correct 94 ms 3936 KB Output is correct
27 Correct 93 ms 3992 KB Output is correct
28 Correct 85 ms 4236 KB Output is correct
29 Correct 132 ms 3912 KB Output is correct
30 Correct 182 ms 4288 KB Output is correct
31 Correct 183 ms 4296 KB Output is correct
32 Correct 175 ms 4280 KB Output is correct
33 Correct 184 ms 4604 KB Output is correct
34 Correct 187 ms 4032 KB Output is correct
35 Correct 181 ms 4096 KB Output is correct
36 Correct 167 ms 4412 KB Output is correct
37 Correct 232 ms 4464 KB Output is correct
38 Correct 313 ms 4492 KB Output is correct
39 Correct 310 ms 4852 KB Output is correct
40 Correct 314 ms 4376 KB Output is correct
41 Correct 323 ms 4396 KB Output is correct
42 Correct 324 ms 4864 KB Output is correct
43 Correct 319 ms 4328 KB Output is correct
44 Correct 323 ms 4320 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3972 KB Output is correct
2 Correct 8 ms 4220 KB Output is correct
3 Correct 8 ms 3460 KB Output is correct
4 Correct 7 ms 3872 KB Output is correct
5 Correct 8 ms 3788 KB Output is correct
6 Correct 8 ms 3780 KB Output is correct
7 Correct 8 ms 4228 KB Output is correct
8 Correct 16 ms 4228 KB Output is correct
9 Correct 16 ms 4080 KB Output is correct
10 Correct 14 ms 3828 KB Output is correct
11 Correct 13 ms 4664 KB Output is correct
12 Correct 16 ms 4304 KB Output is correct
13 Correct 17 ms 4236 KB Output is correct
14 Correct 34 ms 4040 KB Output is correct
15 Correct 41 ms 4288 KB Output is correct
16 Correct 42 ms 4076 KB Output is correct
17 Correct 40 ms 4132 KB Output is correct
18 Correct 35 ms 4196 KB Output is correct
19 Correct 37 ms 3968 KB Output is correct
20 Correct 35 ms 4376 KB Output is correct
21 Correct 65 ms 4456 KB Output is correct
22 Correct 91 ms 4236 KB Output is correct
23 Correct 87 ms 4140 KB Output is correct
24 Correct 85 ms 4036 KB Output is correct
25 Correct 87 ms 4336 KB Output is correct
26 Correct 94 ms 3936 KB Output is correct
27 Correct 93 ms 3992 KB Output is correct
28 Correct 85 ms 4236 KB Output is correct
29 Correct 132 ms 3912 KB Output is correct
30 Correct 182 ms 4288 KB Output is correct
31 Correct 183 ms 4296 KB Output is correct
32 Correct 175 ms 4280 KB Output is correct
33 Correct 184 ms 4604 KB Output is correct
34 Correct 187 ms 4032 KB Output is correct
35 Correct 181 ms 4096 KB Output is correct
36 Correct 167 ms 4412 KB Output is correct
37 Correct 232 ms 4464 KB Output is correct
38 Correct 313 ms 4492 KB Output is correct
39 Correct 310 ms 4852 KB Output is correct
40 Correct 314 ms 4376 KB Output is correct
41 Correct 323 ms 4396 KB Output is correct
42 Correct 324 ms 4864 KB Output is correct
43 Correct 319 ms 4328 KB Output is correct
44 Correct 323 ms 4320 KB Output is correct
45 Correct 414 ms 4496 KB Output is correct
46 Correct 511 ms 4784 KB Output is correct
47 Correct 534 ms 4620 KB Output is correct
48 Correct 533 ms 4420 KB Output is correct
49 Correct 521 ms 4532 KB Output is correct
50 Correct 510 ms 4888 KB Output is correct
51 Correct 529 ms 4852 KB Output is correct
52 Correct 517 ms 4488 KB Output is correct
53 Correct 523 ms 4784 KB Output is correct
54 Correct 518 ms 4980 KB Output is correct
55 Correct 528 ms 5828 KB Output is correct
56 Correct 515 ms 5000 KB Output is correct

Subtask #8
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3972 KB Output is correct
2 Correct 8 ms 4220 KB Output is correct
3 Correct 8 ms 3460 KB Output is correct
4 Correct 7 ms 3872 KB Output is correct
5 Correct 8 ms 3788 KB Output is correct
6 Correct 8 ms 3780 KB Output is correct
7 Correct 8 ms 4228 KB Output is correct
8 Correct 16 ms 4228 KB Output is correct
9 Correct 16 ms 4080 KB Output is correct
10 Correct 14 ms 3828 KB Output is correct
11 Correct 13 ms 4664 KB Output is correct
12 Correct 16 ms 4304 KB Output is correct
13 Correct 17 ms 4236 KB Output is correct
14 Correct 34 ms 4040 KB Output is correct
15 Correct 41 ms 4288 KB Output is correct
16 Correct 42 ms 4076 KB Output is correct
17 Correct 40 ms 4132 KB Output is correct
18 Correct 35 ms 4196 KB Output is correct
19 Correct 37 ms 3968 KB Output is correct
20 Correct 35 ms 4376 KB Output is correct
21 Correct 65 ms 4456 KB Output is correct
22 Correct 91 ms 4236 KB Output is correct
23 Correct 87 ms 4140 KB Output is correct
24 Correct 85 ms 4036 KB Output is correct
25 Correct 87 ms 4336 KB Output is correct
26 Correct 94 ms 3936 KB Output is correct
27 Correct 93 ms 3992 KB Output is correct
28 Correct 85 ms 4236 KB Output is correct
29 Correct 132 ms 3912 KB Output is correct
30 Correct 182 ms 4288 KB Output is correct
31 Correct 183 ms 4296 KB Output is correct
32 Correct 175 ms 4280 KB Output is correct
33 Correct 184 ms 4604 KB Output is correct
34 Correct 187 ms 4032 KB Output is correct
35 Correct 181 ms 4096 KB Output is correct
36 Correct 167 ms 4412 KB Output is correct
37 Correct 232 ms 4464 KB Output is correct
38 Correct 313 ms 4492 KB Output is correct
39 Correct 310 ms 4852 KB Output is correct
40 Correct 314 ms 4376 KB Output is correct
41 Correct 323 ms 4396 KB Output is correct
42 Correct 324 ms 4864 KB Output is correct
43 Correct 319 ms 4328 KB Output is correct
44 Correct 323 ms 4320 KB Output is correct
45 Correct 414 ms 4496 KB Output is correct
46 Correct 511 ms 4784 KB Output is correct
47 Correct 534 ms 4620 KB Output is correct
48 Correct 533 ms 4420 KB Output is correct
49 Correct 521 ms 4532 KB Output is correct
50 Correct 510 ms 4888 KB Output is correct
51 Correct 529 ms 4852 KB Output is correct
52 Correct 517 ms 4488 KB Output is correct
53 Correct 523 ms 4784 KB Output is correct
54 Correct 518 ms 4980 KB Output is correct
55 Correct 528 ms 5828 KB Output is correct
56 Correct 515 ms 5000 KB Output is correct
57 Correct 659 ms 5556 KB Output is correct
58 Correct 804 ms 6552 KB Output is correct
59 Correct 795 ms 5268 KB Output is correct
60 Correct 835 ms 5288 KB Output is correct
61 Correct 815 ms 5476 KB Output is correct
62 Correct 818 ms 5792 KB Output is correct
63 Correct 821 ms 5768 KB Output is correct
64 Correct 800 ms 5772 KB Output is correct
65 Correct 776 ms 5236 KB Output is correct
66 Correct 792 ms 5364 KB Output is correct
67 Correct 818 ms 5424 KB Output is correct
68 Correct 797 ms 5564 KB Output is correct

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3972 KB Output is correct
2 Correct 8 ms 4220 KB Output is correct
3 Correct 8 ms 3460 KB Output is correct
4 Correct 7 ms 3872 KB Output is correct
5 Correct 8 ms 3788 KB Output is correct
6 Correct 8 ms 3780 KB Output is correct
7 Correct 8 ms 4228 KB Output is correct
8 Correct 16 ms 4228 KB Output is correct
9 Correct 16 ms 4080 KB Output is correct
10 Correct 14 ms 3828 KB Output is correct
11 Correct 13 ms 4664 KB Output is correct
12 Correct 16 ms 4304 KB Output is correct
13 Correct 17 ms 4236 KB Output is correct
14 Correct 34 ms 4040 KB Output is correct
15 Correct 41 ms 4288 KB Output is correct
16 Correct 42 ms 4076 KB Output is correct
17 Correct 40 ms 4132 KB Output is correct
18 Correct 35 ms 4196 KB Output is correct
19 Correct 37 ms 3968 KB Output is correct
20 Correct 35 ms 4376 KB Output is correct
21 Correct 65 ms 4456 KB Output is correct
22 Correct 91 ms 4236 KB Output is correct
23 Correct 87 ms 4140 KB Output is correct
24 Correct 85 ms 4036 KB Output is correct
25 Correct 87 ms 4336 KB Output is correct
26 Correct 94 ms 3936 KB Output is correct
27 Correct 93 ms 3992 KB Output is correct
28 Correct 85 ms 4236 KB Output is correct
29 Correct 132 ms 3912 KB Output is correct
30 Correct 182 ms 4288 KB Output is correct
31 Correct 183 ms 4296 KB Output is correct
32 Correct 175 ms 4280 KB Output is correct
33 Correct 184 ms 4604 KB Output is correct
34 Correct 187 ms 4032 KB Output is correct
35 Correct 181 ms 4096 KB Output is correct
36 Correct 167 ms 4412 KB Output is correct
37 Correct 232 ms 4464 KB Output is correct
38 Correct 313 ms 4492 KB Output is correct
39 Correct 310 ms 4852 KB Output is correct
40 Correct 314 ms 4376 KB Output is correct
41 Correct 323 ms 4396 KB Output is correct
42 Correct 324 ms 4864 KB Output is correct
43 Correct 319 ms 4328 KB Output is correct
44 Correct 323 ms 4320 KB Output is correct
45 Correct 414 ms 4496 KB Output is correct
46 Correct 511 ms 4784 KB Output is correct
47 Correct 534 ms 4620 KB Output is correct
48 Correct 533 ms 4420 KB Output is correct
49 Correct 521 ms 4532 KB Output is correct
50 Correct 510 ms 4888 KB Output is correct
51 Correct 529 ms 4852 KB Output is correct
52 Correct 517 ms 4488 KB Output is correct
53 Correct 523 ms 4784 KB Output is correct
54 Correct 518 ms 4980 KB Output is correct
55 Correct 528 ms 5828 KB Output is correct
56 Correct 515 ms 5000 KB Output is correct
57 Correct 659 ms 5556 KB Output is correct
58 Correct 804 ms 6552 KB Output is correct
59 Correct 795 ms 5268 KB Output is correct
60 Correct 835 ms 5288 KB Output is correct
61 Correct 815 ms 5476 KB Output is correct
62 Correct 818 ms 5792 KB Output is correct
63 Correct 821 ms 5768 KB Output is correct
64 Correct 800 ms 5772 KB Output is correct
65 Correct 776 ms 5236 KB Output is correct
66 Correct 792 ms 5364 KB Output is correct
67 Correct 818 ms 5424 KB Output is correct
68 Correct 797 ms 5564 KB Output is correct
69 Correct 1007 ms 6320 KB Output is correct
70 Correct 1195 ms 6100 KB Output is correct
71 Correct 1246 ms 6600 KB Output is correct
72 Correct 1230 ms 6100 KB Output is correct
73 Correct 1218 ms 6572 KB Output is correct
74 Correct 1250 ms 6476 KB Output is correct
75 Correct 1216 ms 6472 KB Output is correct
76 Correct 1231 ms 6488 KB Output is correct

Subtask #10
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3972 KB Output is correct
2 Correct 8 ms 4220 KB Output is correct
3 Correct 8 ms 3460 KB Output is correct
4 Correct 7 ms 3872 KB Output is correct
5 Correct 8 ms 3788 KB Output is correct
6 Correct 8 ms 3780 KB Output is correct
7 Correct 8 ms 4228 KB Output is correct
8 Correct 16 ms 4228 KB Output is correct
9 Correct 16 ms 4080 KB Output is correct
10 Correct 14 ms 3828 KB Output is correct
11 Correct 13 ms 4664 KB Output is correct
12 Correct 16 ms 4304 KB Output is correct
13 Correct 17 ms 4236 KB Output is correct
14 Correct 34 ms 4040 KB Output is correct
15 Correct 41 ms 4288 KB Output is correct
16 Correct 42 ms 4076 KB Output is correct
17 Correct 40 ms 4132 KB Output is correct
18 Correct 35 ms 4196 KB Output is correct
19 Correct 37 ms 3968 KB Output is correct
20 Correct 35 ms 4376 KB Output is correct
21 Correct 65 ms 4456 KB Output is correct
22 Correct 91 ms 4236 KB Output is correct
23 Correct 87 ms 4140 KB Output is correct
24 Correct 85 ms 4036 KB Output is correct
25 Correct 87 ms 4336 KB Output is correct
26 Correct 94 ms 3936 KB Output is correct
27 Correct 93 ms 3992 KB Output is correct
28 Correct 85 ms 4236 KB Output is correct
29 Correct 132 ms 3912 KB Output is correct
30 Correct 182 ms 4288 KB Output is correct
31 Correct 183 ms 4296 KB Output is correct
32 Correct 175 ms 4280 KB Output is correct
33 Correct 184 ms 4604 KB Output is correct
34 Correct 187 ms 4032 KB Output is correct
35 Correct 181 ms 4096 KB Output is correct
36 Correct 167 ms 4412 KB Output is correct
37 Correct 232 ms 4464 KB Output is correct
38 Correct 313 ms 4492 KB Output is correct
39 Correct 310 ms 4852 KB Output is correct
40 Correct 314 ms 4376 KB Output is correct
41 Correct 323 ms 4396 KB Output is correct
42 Correct 324 ms 4864 KB Output is correct
43 Correct 319 ms 4328 KB Output is correct
44 Correct 323 ms 4320 KB Output is correct
45 Correct 414 ms 4496 KB Output is correct
46 Correct 511 ms 4784 KB Output is correct
47 Correct 534 ms 4620 KB Output is correct
48 Correct 533 ms 4420 KB Output is correct
49 Correct 521 ms 4532 KB Output is correct
50 Correct 510 ms 4888 KB Output is correct
51 Correct 529 ms 4852 KB Output is correct
52 Correct 517 ms 4488 KB Output is correct
53 Correct 523 ms 4784 KB Output is correct
54 Correct 518 ms 4980 KB Output is correct
55 Correct 528 ms 5828 KB Output is correct
56 Correct 515 ms 5000 KB Output is correct
57 Correct 659 ms 5556 KB Output is correct
58 Correct 804 ms 6552 KB Output is correct
59 Correct 795 ms 5268 KB Output is correct
60 Correct 835 ms 5288 KB Output is correct
61 Correct 815 ms 5476 KB Output is correct
62 Correct 818 ms 5792 KB Output is correct
63 Correct 821 ms 5768 KB Output is correct
64 Correct 800 ms 5772 KB Output is correct
65 Correct 776 ms 5236 KB Output is correct
66 Correct 792 ms 5364 KB Output is correct
67 Correct 818 ms 5424 KB Output is correct
68 Correct 797 ms 5564 KB Output is correct
69 Correct 1007 ms 6320 KB Output is correct
70 Correct 1195 ms 6100 KB Output is correct
71 Correct 1246 ms 6600 KB Output is correct
72 Correct 1230 ms 6100 KB Output is correct
73 Correct 1218 ms 6572 KB Output is correct
74 Correct 1250 ms 6476 KB Output is correct
75 Correct 1216 ms 6472 KB Output is correct
76 Correct 1231 ms 6488 KB Output is correct
77 Correct 1215 ms 5668 KB Output is correct
78 Correct 1730 ms 6272 KB Output is correct
79 Correct 1816 ms 6436 KB Output is correct
80 Correct 1727 ms 6564 KB Output is correct
81 Correct 1719 ms 6288 KB Output is correct
82 Correct 1746 ms 7220 KB Output is correct
83 Correct 1698 ms 5764 KB Output is correct
84 Correct 1630 ms 6868 KB Output is correct