제출 #786024

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
786024		yeyso	화성 (APIO22_mars)	C++17	0 / 100	1 ms	424 KiB

mars

#include "mars.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> m;
vector<vector<int>> v;
int dfs(int i, int j, int z){
	
	if(!v[i][j] and m[i][j] != 0){
		v[i][j] = z;
		
		if(i < 5) dfs(i+1, j, z);
		if(j < 5) dfs(i, j+1, z);
	}
}
string process(vector<vector<string>> a, int i, int j, int k, int n)
{	
	if(k == 0){
		string z(100, '0');
		int x = 0;
		for(int i = 0; i < 3; i ++){
			for(int j = 0; j < 3; j ++){
				z[x] = a[i][j][0];
				x += 1;
			}
		}
		return z;
	}

	if(k == 1){
		vector<vector<int>> grid(5, vector<int>(5, 0));
		v = grid;
		int x = 0;
		for(int i = 0; i < 3; i ++){
			for(int j = 0; j < 3; j ++){
				grid[i][j] = a[0][0][x]; x += 1;
			}
		} x = 0;
		for(int i = 0; i < 3; i ++){
			for(int j = 3; j < 6; j ++){
				grid[i][j] = a[0][2][x]; x += 1;
			}
		} x = 0;
		for(int i = 3; i < 6; i ++){
			for(int j = 0; j < 3; j ++){
				grid[i][j] = a[2][0][x]; x += 1;
			}
		} x = 0;
		for(int i = 3; i < 6; i ++){
			for(int j = 3; j < 6; j ++){
				grid[i][j] = a[2][2][x]; x += 1;
			}
		}
		m = grid;
		x = 1;
		
		for(int i = 0; i < grid.size(); i ++){
			for(int j = 0; j < grid[i].size(); j ++){
				dfs(i, j, x);
				x += 1;
			}
		}
		set<int> is;
		for(int i = 0; i < v.size(); i ++){
			for(int j = 0; j < v[i].size(); j ++){
				is.insert(v[i][j]);
			}
		}
		string res = bitset<100>(is.size() - 1).to_string();
		return res;
		
		

	}
	

	return std::string(100 ,'0');
}
/*

*/

컴파일 시 표준 에러 (stderr) 메시지

mars.cpp: In function 'int dfs(int, int, int)':
mars.cpp:14:1: warning: no return statement in function returning non-void [-Wreturn-type]
   14 | }
      | ^
mars.cpp: In function 'std::string process(std::vector<std::vector<std::__cxx11::basic_string<char> > >, int, int, int, int)':
mars.cpp:56:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |   for(int i = 0; i < grid.size(); i ++){
      |                  ~~^~~~~~~~~~~~~
mars.cpp:57:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |    for(int j = 0; j < grid[i].size(); j ++){
      |                   ~~^~~~~~~~~~~~~~~~
mars.cpp:63:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |   for(int i = 0; i < v.size(); i ++){
      |                  ~~^~~~~~~~~~
mars.cpp:64:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |    for(int j = 0; j < v[i].size(); j ++){
      |                   ~~^~~~~~~~~~~~~

• Subtask 1: 0 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 7
• Subtask 4: 0 / 8
• Subtask 5: 0 / 7
• Subtask 6: 0 / 8
• Subtask 7: 0 / 10
• Subtask 8: 0 / 24
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11