oj.uz

Submission #1049310

# Submission time Handle Problem Language Result Execution time Memory
1049310 2024-08-08T16:16:19 Z Maite_Morale Mars (APIO22_mars) C++17
0 / 100
 0 ms 448 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vll vector<ll>
#define pll pair<ll,ll>
#define F first
#define S second

vll v[500];
ll pass[500][500];
pll d[4]={{0,1},{1,0},{-1,0},{0,-1}};
void bfs(ll x,pll y){
	queue<pll> q;
	q.push(y);
	pass[y.F][y.S]=1;
	while(!q.empty()){
		pll u=q.front();q.pop();
		for(auto d1 : d){
			pll w=u;w.F+d1.F;w.S+=d1.S;
			if(min(w.F,w.S)<0 || max(w.F,w.S)>=x)continue;
			if(pass[w.F][w.S]==0 && v[w.F][w.S]==1){
				q.push(w);
				pass[w.F][w.S]=1;
			}
		}
	}
}
/*
1
1
1 0 0
1 1 0
0 0 1
*/
std::string process(std::vector <std::vector<std::string>> a, int I, int J, int k, int n)
{	
	
	ll vb=2*k+1;
	ll b=2*(k+1)+1;
	string s={};
	if(k==n-1){
		for(int i=0;i<b;i++){
			v[i].assign(b,0LL);
			for(int j=0;j<b;j++){
				ll bi=0,bj=0;
				if(i>=vb)bi=i-vb+1;
				if(j>=vb)bj=j-vb+1;
				ll d=i-bi*vb+j-bj;
				v[i][j]=a[bi][bj][d]-'0';
				pass[i][j]=0;
				//cout<<v[i][j]<<" ";
			}//cout<<'\n';
		}
		ll r=0;
		for(int i=0;i<b;i++){
			for(int j=0;j<b;j++){
				if(pass[i][j]==0 && v[i][j]==1){
				//	cout<<i<<" "<<j<<"\n";
					r++;bfs(b,{i,j});
				}
			}
		}
		//cout<<r<<":)";
		for(int i=0;i<100;i++){
			if(i<=10 && (r&(1LL<<i)))s+='1';
			else                     s+='0';
		}
		return s;
	}
	else{
		for(int z=0;z<100;z++){
			if(z<b*b){
				ll i=z/b,j=z%b;
				ll bi=0,bj=0;
				if(i>=vb)bi=i-vb+1;
				if(j>=vb)bj=j-vb+1;
				s+=a[bi][bj][i-bi*vb+j-bj];
			}
			else s+='0';
		}
		return s;
	}
}

Compilation message

mars.cpp: In function 'void bfs(ll, std::pair<long long int, long long int>)':
mars.cpp:19:15: warning: statement has no effect [-Wunused-value]
   19 |    pll w=u;w.F+d1.F;w.S+=d1.S;
      |               ^

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 448 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 448 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 448 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 448 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 448 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 448 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 448 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 448 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 448 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #10
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 448 KB Incorrect
2 Halted 0 ms 0 KB -