oj.uz

Submission #934532

# Submission time Handle Problem Language Result Execution time Memory
934532 2024-02-27T14:18:15 Z 8pete8 Robots (APIO13_robots) C++17
30 / 100
 2 ms 8792 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<cassert>
#include<limits.h>
#include<cmath>
#include<set>
#include<numeric> //gcd(a,b)
#include<algorithm>
#include<bitset> 
#include<stack>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define pppiiii pair<pii,pii>
#define ppii pair<int,pii>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
//#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
#define int long long
const int mod=1e9+7,mxn=505,lg=30,inf=1e18,minf=-1e18,Mxn=2e6,root=700;
void setIO(string name){
	ios_base::sync_with_stdio(0); cin.tie(0);		
	freopen((name+".in").c_str(),"r",stdin);		
	freopen((name+".out").c_str(),"w",stdout);	
}	 
pii pos[10];
char grid[mxn+10][mxn+10];
int n,h,w;
int dp[mxn+10][mxn+10][10],dist[mxn+10][mxn+10][4],realdist[mxn+10][mxn+10];
int realdist2[mxn+10][mxn+10];
int u[4]={1,0,-1,0},r[4]={0,-1,0,1};
bool vis[mxn+10][mxn+10];
bool valid(int x,int y){
	if(x<=0||x>h||y<=0||y>w)return false;
	if(grid[x][y]=='x')return false;
	return true;
}
struct node{
	int x,y,stp,di;
	bool operator<(const node o)const{return stp>o.stp;}
};
void play(int x,int y){//get min dist
	for(int i=1;i<=h;i++)for(int j=1;j<=w;j++){
		for(int k=0;k<4;k++)dist[i][j][k]=inf;
		realdist[i][j]=inf;
	}
	priority_queue<node>q;
	realdist[x][y]=0;
	for(int i=0;i<4;i++)q.push({x,y,1,i});
	while(!q.empty()){
		auto [cx,cy,stp,di]=q.top();
		q.pop();
		vis[cx][cy]=1;
		if(dist[cx][cy][di]<=stp)continue;
		dist[cx][cy][di]=stp;
		if((grid[cx][cy]=='A'||grid[cx][cy]=='C')){
			int add=1;
			if(grid[cx][cy]=='A')add=-1;
			di=(di+add+4)%4;
		}
		int nx=cx+u[di],ny=cy+r[di];
		if(valid(nx,ny)){
			if(dist[nx][ny][di]>stp)q.push({nx,ny,stp,di});
		}
		else{
			realdist[cx][cy]=min(realdist[cx][cy],stp);
			for(int k=0;k<4;k++)if(dist[cx][cy][k]>stp+1)q.push({cx,cy,stp+1,k});
		}
	}
}
int32_t main(){
	fastio
	cin>>n>>w>>h;
	if(n!=2)return 0;//test finding min dist
	int ans=inf;
	for(int i=1;i<=h;i++)for(int j=1;j<=w;j++){
		for(int k=1;k<=9;k++)dp[i][j][k]=inf;
		cin>>grid[i][j];
		if(grid[i][j]>='1'&&grid[i][j]<='9')pos[grid[i][j]-'0']={i,j};
	}
	play(pos[1].f,pos[1].s);/*
	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			cout<<((realdist[i][j]==inf)?-1:realdist[i][j])<<" ";
		}
		cout<<'\n';
	}
	return 0;
	*/
	swap(realdist,realdist2);
	play(pos[2].f,pos[2].s);
	for(int i=1;i<=h;i++)for(int j=1;j<=w;j++)ans=min(ans,realdist[i][j]+realdist2[i][j]);
	cout<<((ans==inf)?-1:ans);
	return 0;
	/*
	for(int i=1;i<=2;i++){
		
		//break;
	}*/
	
	//for(int i=1;i<=h;i++)for(int j=1;j<=w;j++)ans=min(ans,dp[i][j][n]);
	cout<<ans;
	/*


	*/
}

Compilation message

robots.cpp: In function 'void setIO(std::string)':
robots.cpp:37:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
robots.cpp:38:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8400 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8792 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8400 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8792 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Incorrect 1 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8400 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8792 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Incorrect 1 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -